Hdu 1299

Diophantus of Alexandria

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2326    Accepted Submission(s): 887

Problem Description

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

令y = n + k (k >= 1)，　则x = n^2/k + n , x为整数，　所以k为n^2的约数，因为x >= y, 所以k <= n, 所以

可以将问题简化为求n^2的不大于ｎ的约数的个数，然后素数分解。

Accepted Code:

 /*************************************************************************
     > File Name: 1299.cpp
     > Author: Stomach_ache
     > Mail: sudaweitong@gmail.com
     > Created Time: 2014年07月10日 星期四 16时39分38秒
     > Propose:
  ************************************************************************/

 #include <cmath>
 #include <string>
 #include <cstdio>
 #include <fstream>
 #include <cstring>
 #include <iostream>
 #include <algorithm>
 using namespace std;

 int n;
 int prime[];
 bool vis[];
 int cnt = ;

 void isPrime() {
       cnt = ;
     int k = (int)sqrt(1000000000.0) + ;
       for (int i = ; i <= k; i++) vis[i] = true;
     for (int i = ; i <= k; i++) {
           if (vis[i]) {
             prime[cnt++] = i;
             for (int j = i*i; j <= k; j += i) vis[j] = false;
         }
     }
 }

 int main(void) {
       isPrime();
     int c = ;
     int t;
     scanf("%d", &t);
       while (t--) {
           scanf("%d", &n);
           int ans = ;
         for (int i = ; i < cnt && prime[i] <= n; i++) {
               int tmp = ;
               while (n % prime[i] == ) {
                   tmp++;
                 n /= prime[i];
             }
             ans *=  +  * tmp;
         }
         if (n > ) ans *= ;
         printf("Scenario #%d:\n", c++);
         printf("%d\n\n", (ans + ) / );
     }

     return ;
 }