Waiting

代码：

#include<bits/stdc++.h>
long long a[101][101];
using namespace std;
int main(){
  long long m,n,j,i;
  cin>>n>>m;
  while(n!=0&&m!=0){
  	for(i=0;i<=n;i++){
  		a[i][0]=1;
  		for(j=1;j<=i;j++){
  			a[i][j]=a[i-1][j]+a[i-1][j-1];
  		}
  	}
  	printf("%lld things taken %lld at a time is %lld exactly.\n",n,m,a[n][m]);
  	cin>>n>>m;
  }		
  return 0;
}