1
/**/
/**************************************
2Problem: HEU 2036 Paths on a Grid
3Time: 0.0020 s
4Memory: 256 k
5Accepted Time: 2009-03-27 18:52:43
6Tips: 求组合数,linux,long long,%lld;windows,__int64,%I64d
7**************************************/
8 #include < stdio.h >
9 int main()
10 {
11 long long m,n;
12 long long res;
13 while(1)
14 {
15 scanf("%lld%lld",&m,&n);
16 if(m==0&&n==0)break;
17 long long x=m<n?m:n;
18 long long i,j;
19 res=1;
20 if(x!=m+n)
21 for(i=1,j=m+n-x+1;i<=x;i++,j++)
22 res=res*j/i;
23 printf("%lld\n",res);
24 }
25 return 0;
26}
27
2Problem: HEU 2036 Paths on a Grid
3Time: 0.0020 s
4Memory: 256 k
5Accepted Time: 2009-03-27 18:52:43
6Tips: 求组合数,linux,long long,%lld;windows,__int64,%I64d
7**************************************/
8 #include < stdio.h >
9 int main()
10 {
11 long long m,n;
12 long long res;
13 while(1)
14 {
15 scanf("%lld%lld",&m,&n);
16 if(m==0&&n==0)break;
17 long long x=m<n?m:n;
18 long long i,j;
19 res=1;
20 if(x!=m+n)
21 for(i=1,j=m+n-x+1;i<=x;i++,j++)
22 res=res*j/i;
23 printf("%lld\n",res);
24 }
25 return 0;
26}
27