#include<iostream.h> 
long factorial(int nummer); // 計排列組合嘅函數
void main() 
{ 
int i,n,m; 
cout<<"輸入括號中的數字: "; 
cin>> m; 
cout<<"排列是: "; 
cin>>n;
double answer=m; 
for(i=1;i<n;i++) // 計排列 
answer*=--m; 
cout<<"P("<<m+n-1<<","<<n<<")="; 
cout<<answer<<endl; 
answer/=factorial(n); // 計組合
cout<<"組合就是: ";
cout<<"C("<<m+n-1<<","<<n<<")="; 
cout<<answer<<endl; 
} 

long factorial(int nummer) 
{ 
if(nummer<=1)return 1; 
else return nummer*factorial(nummer-1); 
}