1:求n!
#include "stdafx.h"
#include <iostream>
using namespace std;
unsigned spc(unsigned m)
{
unsigned f;
if(m==0)
f=1;
else
f=spc(n-1)*n;
return f;
}
int main()
{
unsigned q;
unsigned w;
cout<<"please input a data"<<endl;
cin>>q;
w=spc(q);
cout<<"the result is"<<w<<endl;
return 0;
}
2:求组合
#include "stdafx.h"
#include<iostream>
using namespace std;
unsigned comm(unsigned m,unsigned n)
{
unsigned f;
if(n>m)
cout<<"please input another data"<<endl;
else if(m==n||n==0)
f=1;
else
f=comm((m-1),n)+comm((m-1),(n-1));
return f;
}
int main()
{
unsigned result;
cout<<"please input data"<<endl;
unsigned m,n;
cin>>m>>n;
result=comm(m,n);
cout<<result;
return 0;
}
3:2进制到10进制转换
#include<iostream>
using namespace std;
double pow(int x,int n)
{
double s=1.0;
while(n--)
s*=x;
return s;
}
int main()
{
int result;
int bin;
cout<<"please input an binary"<<endl;
for(int i=6;i>=0;i--)
{
cin>>bin<<endl;
if(bin==1)
result+=static_cast<int>(pow(2,i));
}
cout<<result<<endl;
return 0;
}