poj-1306

//356K  0MS G++
#include <stdio.h>  
#include <string.h>  
#include <math.h>  
  
  
int m;  
int n;  
  
int originalM;
int originalN;
  
// void getNum(unsigned int n, unsigned int m) {    
//     // long long total = n;    
//     m = m < (n -m) ? m : (n -m);  
//     if (m == 0) {  
//         printf("1\n");  
//         return;  
//     }  
//     double cnm = 1;    
//     // for (long i = 1; i <=m ; i++) {  
//     //     cnm = cnm*(n-i+1)/i;  
//     // }  
//     int i;
//     for(i=n; i>n-m; i--) c*=i;
//     for(i=m; i>1; i--) c/=i;
  
  
//     // printf("%.0lf\n", cnm);    
//     printf("%d things taken %d at a time is %.0lf exactly.\n", 
//         originalN, originalM, cnm);
// }    

    
void getNum(unsigned int n, unsigned int m) {    
    if (m == 0 || m == n) {  
        // printf("1\n");  
        printf("%d things taken %d at a time is %d exactly.\n", 
        originalN, originalM, 1);
        return;  
    }  
    m = m < (n -m) ? m : (n -m);    
      
    double cnm = 1.0;    
    while(m>0)    
        cnm *= (double)(n--)/(double)(m--);    
    cnm+=0.5;    
    // printf("%lld\n", (long long)cnm);    
    printf("%d things taken %d at a time is %lld exactly.\n", 
        originalN, originalM, (long long)cnm);
}    
  
  
int main() {    
    while(scanf("%d %d", &n, &m) != EOF) {    
        originalM = m;
        originalN = n;
        if (!m && !n) {    
            return 0;    
        } else if (!n) {    
            // printf("0\n");
            printf("%d things taken %d at a time is %d exactly.\n",
            originalN, originalM, 0);     
        } else if (!m) {  
            // printf("1\n");
            printf("%d things taken %d at a time is %d exactly.\n", 
            originalN, originalM, 1);    
        } else{    
            getNum(n, m);    
        }    
    }    
}   

同2249,

做一送一，不过终于看到了上面两种解法终究在运算很多次的时候，是得不到真正正确结果的，

比如67 27

第一个方法得到的是4105075349580976128

第二个是4105075349580976640

但其实据说正确的是4105075349580976232

下面这个代码可以得到：

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;

long long com(long long n, long long r)
{
    if (n - r < r)
        r = n - r;
    long long i, j, s = 1;
    for (i = 0, j = 1; i < r; ++i)
    {
        s *= (n - i);
        for (; j <= r && s % j == 0; ++j)
            s /= j;
    }
    return s;
}

int main()
{
    //freopen("t.txt", "r", stdin);
    long long m, n;
    while (scanf("%lld%lld", &m, &n), m | n)
        printf("%lld things taken %lld at a time is %lld exactly.\n", m, n, com(m, n));
    return 0;
}

真没看出原因，不过此题没有这么BT的数据，因此上面就可以AC了。