Diophantus of Alexandria （唯一分解求一个数的因子数）

Diophantus of Alexandria was an egypt mathematician living in Alexandria. He was one of the first mathematicians to study equations where variables were restricted to integral values. In honor of him, these equations are commonly called diophantine equations. One of the most famous diophantine equation is x^n + y^n = z^n. Fermat suggested that for n > 2, there are no solutions with positive integral values for x, y and z. A proof of this theorem (called Fermat's last theorem) was found only recently by Andrew Wiles. 

Consider the following diophantine equation: 

1 / x + 1 / y = 1 / n where x, y, n ∈ N+ (1)

Diophantus is interested in the following question: for a given n, how many distinct solutions (i. e., solutions satisfying x ≤ y) does equation (1) have? For example, for n = 4, there are exactly three distinct solutions: 

1 / 5 + 1 / 20 = 1 / 4 
1 / 6 + 1 / 12 = 1 / 4 
1 / 8 + 1 / 8 = 1 / 4

Clearly, enumerating these solutions can become tedious for bigger values of n. Can you help Diophantus compute the number of distinct solutions for big values of n quickly? 

Input

The first line contains the number of scenarios. Each scenario consists of one line containing a single number n (1 ≤ n ≤ 10^9). 

Output

The output for every scenario begins with a line containing "Scenario #i:", where i is the number of the scenario starting at 1. Next, print a single line with the number of distinct solutions of equation (1) for the given value of n. Terminate each scenario with a blank line. 

Sample Input

2
4
1260

Sample Output

Scenario #1:
3

Scenario #2:
113

题意：

1 / x + 1 / y = 1 / n,x, y, n ∈ N+ ,x<=y,求满足条件的xy的对数

思路：问题转化成求n^2的因子中小于等于n的个数

  

#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
const int maxn=100005;
int prime[maxn];
bool isPrime[maxn];
int cnt=0;
void init()
{
	for(int i=2;i<maxn;i++)
	{
		if(!isPrime[i]) prime[cnt++]=i;
		for(int j=0;j<cnt&&(ll)i*prime[j]<maxn;j++)
		{
			isPrime[i*prime[j]]=true;
			if(i%prime[j]==0) break;
		}
	}
}
int main()
{
	init();
	int t;
	cin>>t;
	for(int k=1;k<=t;k++)
	{
		int n;
		cin>>n;
		int ans=1;
		//通过唯一分解求出n^2的因子总数 
		for(int i=0;i<cnt&&prime[i]<=n;i++)
		{
			int tmp=0;
			while(n%prime[i]==0) 
			{
				tmp++;
				n/=prime[i];
			}
			ans*=1+tmp*2;
		}
		if(n>1) ans*=3;//如果最后一个因子大于1，那么他的因子数（2*1+1)=3，所以乘上3 
		printf("Scenario #%d:\n%d\n\n",k,(ans+1)/2); //最后求出n^2的因子中小于等于n的 
	}
	return 0;
}