31-35.个人练习

来源：互联网发布：淘宝降权查询网站编辑：程序博客网时间：2024/05/18 01:01

#include <stdio.h>#include <stdlib.h>int F(int n,int m){  if (n<=2) return 1;  if(m==1||n==m) return 1;  else return F(n-1,m-1)+m*F(n-1,m);}int main(){    int n;    int m;    int a;   scanf("%d %d",&n,&m );   a=F(n,m);   printf("%d",a);   return 0;}

#include<iostream>#include<iomanip>#include<stdlib.h>using std::cout;using std::endl;using std::cin;int sPath(int*,int,int);int aSize=0;int main(){cin>>aSize;int *x=new int[aSize];int *y=new int[aSize];for(int i=0;i<aSize;i++){cin>>x[i];cin>>y[i];}int p=0;p=sPath(y,0,aSize-1);cout<<p<<endl;return 0;}int sPath(int a[],int x,int y){int f,b,total=0;if(x==y){for(int i=0;i<aSize;i++)total+=abs(a[x]-a[i]);return total;}f=sPath(a,x,(x+y)/2);b=sPath(a,(x+y)/2+1,y);return f<b?f:b;}

#include <iostream>using namespace std;int Sort(int,int*);int sNum=0;int main(){    cin>>sNum;    int*x= new int [sNum];    for(int i=0;i<sNum;i++)    {        cin>>x[i];    }   int r=1;   r=Sort(sNum,x);   cout<<r<<endl;}int Sort(int n,int x[]){    int cunt=0;    for(int a=0;a<n;a++){        for(int b=(a+1);b<n;b++)       {        if(x[a]>x[b])        {            cunt++;        }       }    }    return cunt;}

阅读全文

0 0