LightOj 1045 大数处理

[code]#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <string>
using namespace std;
const int MAXN = 1000000 + 5;
double fac[MAXN];
int main()
{
    fac[0] = 0;
    for(int i = 1 ; i < MAXN ; i++) fac[i] = fac[i - 1] + log(1.0 * i);
    int T;
    scanf("%d", &T);
    for(int cas = 1 ; cas <= T ; cas++){
        int n, m;
        scanf("%d%d", &n, &m);
        int ans = fac
 / log(1.0 * m) + 1;
        printf("Case %d: %d\n", cas, ans);
    }
    return 0;
}