hdu 2421 数论--积性函数

Deciphering Password

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2075    Accepted Submission(s): 557

Problem Description

Xiaoming has just come up with a new way for encryption, by calculating the key from a publicly viewable number in the following way:
Let the public key N = A ^B, where 1 <= A, B <= 1000000, and a ₀, a ₁, a ₂, …, a _k-1 be the factors of N, then the private key M is calculated by summing the cube of number of factors of all ais. For example, if A is 2 and B is 3, then N = A ^B = 8, a ₀ = 1, a ₁ = 2, a ₂ = 4, a ₃ = 8, so the value of M is 1 + 8 + 27 + 64 = 100.
However, contrary to what Xiaoming believes, this encryption scheme is extremely vulnerable. Can you write a program to prove it?

 

Input

There are multiple test cases in the input file. Each test case starts with two integers A, and B. (1 <= A, B <= 1000000). Input ends with End-of-File.
Note: There are about 50000 test cases in the input file. Please optimize your algorithm to ensure that it can finish within the given time limit.

 

Output

For each test case, output the value of M (mod 10007) in the format as indicated in the sample output.

 

Sample Input

  
  

   
   2 2
1 1
4 7
  
  

 

Sample Output

  
  

   
   Case 1: 36
Case 2: 1
Case 3: 4393
  
  

/*
* hdu2421
* author  : mazciwong
* creat on: 2016-12-10
*/

/*
思路：积性函数--数论
http://www.acmerblog.com/hdu-2421-deciphering-password-3885.html#comments

*/


#include <iostream>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;
const int MOD = 10007;
const int _4MOD = 4 * MOD;
typedef long long ll;
typedef vector<pair<int, int> > Int_Pair;

void get_prime_table(int N, vector<int> &pt)
{
	vector<bool> ip;
	ip.resize(N + 1);
	fill(ip.begin(), ip.end(), true);
	int j, t=N-1;
	for (int i = 3; i <= N; i++)
	{
		int s = (int)sqrt(i);
		for (j = 2; j <= s; j++)
			if (i%j == 0) break;
		if (j <= s)
		{
			ip[i] = false;
			t--;
		}
	}
	pt.resize(t);
	t = 0;
	for (int i = 2; i <= N; i++)
		if (ip[i]) pt[t++] = i;
}

void get_prime_factor(int N, Int_Pair &f, const vector<int> &p)  // 得到的数放vecotr f里;  素数表P
{
	int plen = p.size();
	for (int i = 0; i < plen; i++)
	{
		int t = p[i];
		if (N%t == 0)
		{
			int n = 0;
			while (N%t == 0)
			{
				n++;
				N /= t;
			}
			f.push_back(make_pair(t, n)); //第一个是因子,第二个是指数
		}
		if (N == 1) break;
	}
	if (N > 1)
		f.push_back(make_pair(N, 1));
}

int main()
{
	vector<int> prime_table;
	get_prime_table(2000, prime_table);
	int a, b;
	int cnt = 1;
	int ans = 0;
	while (scanf("%d%d", &a, &b) != EOF)
	{
		Int_Pair ip;//初始化一个放数对的vector
		get_prime_factor(a, ip, prime_table);
		ans = 1;
		for (int i = 0, len = ip.size(); i < len; i++)
		{
			int n = (ip[i].second*(ll)b + 1) % _4MOD;
			ll tmp = ((n*n) % _4MOD)*(((n + 1)*(n + 1)) % _4MOD);
			tmp = (tmp%_4MOD) / 4;
			ans *= tmp;
			ans %= MOD;
		}
		printf("Case %d: %d\n", cnt++, ans);
	}
	return 0;
}