hdu 2421 Deciphering Password

http://acm.hdu.edu.cn/showproblem.php?pid=2421

　　因为没初始化质因数数组f，所以wa了好几遍....- -     还是初始化的问题，看来以后要注意点！

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>
#include <iostream>

#define debug 0

using namespace std;

typedef __int64 ll;
const int mod = 10007;
const int maxn = 1005;

bool np[maxn];
int pn, pr[maxn >> 2];

void gp(){
    memset(np, 0, sizeof(np));
    np[0] = np[1] = true;
    pn = 0;
    for (int i = 2; i < maxn; i++){
        if (!np[i]) pr[pn++] = i;
        for (int j = 0; j < pn && pr[j] * i < maxn; j++){
            np[pr[j] * i] = true;
            if (i % pr[j] == 0) break;
        }
    }
    #if debug
    printf("pn %d\n", pn);
    #endif
}

void fac(int a, int *f, int &cnt){
    int i = 0;

    cnt = 0;
    while (pr[i] * pr[i] <= a && i < pn){
        while (a % pr[i] == 0){
            f[cnt++] = pr[i];
            a /= pr[i];
        }
        i++;
    }
    if (a != 1) f[cnt++] = a;
}

void deal(int a, int b, int c){
    int f[50], tmp;
    int ans = 1;
    int cnt = 0;
    int n = 0;

    memset(f, 0, sizeof(f));
    b %= mod;
    fac(a, f, n);
    sort(f, f + n);
    #if debug
    printf("n  %d\n\n", n);
    for (int i = 0; i < n; i++){
        printf("%d\n", f[i]);
    }
    f[n] = 0;
    #endif
    for (int i = 0; i < n; i++){
        cnt++;
        if (f[i] != f[i + 1]) {
            #if debug
            printf("cnt %d   b %d\n", cnt, b);
            #endif
            cnt *= b;
            cnt %= mod;
            tmp = (((cnt + 1) % mod) * (cnt + 2) / 2) % mod;
            tmp = (tmp * tmp) % mod;
            ans *= tmp;
            ans %= mod;
            cnt = 0;
        }
        if (!ans) break;
    }
    printf("Case %d: %d\n", c, ans);
}

int main(){
    int i = 1;
    int a, b;

    gp();
    while (~scanf("%d%d", &a, &b)){
        deal(a, b, i);
        i++;
    }

    return 0;
}

——written by Lyon