poj 1942

这一次是怎么求阶乘的问题

n,m已经到int的最大；杨辉三角是n^2/2;

代码如下

#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>using namespace std;int main(){long long n,m;double ans,t;while(~scanf("%I64d%I64d",&n,&m)){if(n==0&&m==0) break;t=m+n;if(n>m) n=m;ans=1.0;for(int i=1;i<=n;i++)ans*=(t-i+1.0)/(i+0.0);printf("%.0f\n",ans);}return 0;}