3067441_tle.java

北大大牛代码 1240道题的原代码 超级权威

import java.util.*;
import java.math.*;

public class Main 
{
    static int num[] = new int [10001];
    static int cnt[] = new int [10001];
    public static void main(String[] args) 
    {
        Scanner cin = new Scanner (System.in);
        int a, b, m, t, i;
        
        a = cin.nextInt();
        b = cin.nextInt();
        m = 0;
        if(a%2==0)
        {
            num[m] = 2;
            while(a%2==0)
            {
                a /= 2;
                cnt[m]++;
            }
            cnt[m] *= b;
            m++;
        }
        t = (int)Math.sqrt((double)(a))+1;
        for(i = 3; i < t&&a!=1; i+=2)
        {
            if(a%i==0)
            {
                num[m] = i;
                while(a%i==0)
                {
                    a /= i;
                    cnt[m]++;
                }
                cnt[m] *= b;
                t = (int)Math.sqrt((double)(a))+1;
                m++;
            }
        }
        if(a!=1)
        {
            num[m] = a;
            cnt[m] = b;
            m++;
        }
        BigInteger mod = new BigInteger("9901");
        BigInteger n = new BigInteger("1");
        for(i = 0; i < m; i++)
        {
            n = n.multiply(BigInteger.valueOf(num[i]).pow(cnt[i]+1).subtract(BigInteger.ONE).divide(BigInteger.valueOf(num[i]-1)));
            n = n.mod(mod);
        }
        System.out.println(n);
    }
    
}