D - Sigma Function（唯一分解定理 + 思维）

D - Sigma Function

 

1336 - Sigma Function

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

Sigma function is an interesting function in Number Theory. It is denoted by the Greek letter Sigma (σ). This function actually denotes the sum of all divisors of a number. For example σ(24) = 1+2+3+4+6+8+12+24=60. Sigma of small numbers is easy to find but for large numbers it is very difficult to find in a straight forward way. But mathematicians have discovered a formula to find sigma. If the prime power decomposition of an integer is

Then we can write,

For some n the value of σ(n) is odd and for others it is even. Given a value n, you will have to find how many integers from 1 to n have even value of σ.

Input

Input starts with an integer T (≤ 100), denoting the number of test cases.

Each case starts with a line containing an integer n (1 ≤ n ≤ 10¹²).

Output

For each case, print the case number and the result.

Sample Input	Output for Sample Input
4 3 10 100 1000	Case 1: 1 Case 2: 5 Case 3: 83 Case 4: 947

题目就是这个样子的，首先我们看(p[i]^(e[i]+1) - 1)/(p[i] - 1) 这个等比数列和可以化简为

 p[i]^0 + p[i]^1 +.....+ p[i]^e[i];

首先我们可以知道如果p[i] = 2; 则其和一定为奇数（偶数+1）；

我们知道除2以外，素数都是奇数，所以 （p[i]^0 + p[i]^1 +.....+ p[i]^e[i]）要满足是奇数的话e[i]一定是偶数（两两组合还剩一个奇数）；

所以满足sigm（i）是奇数的条件，则如果i是一个平方数，那么他的约数和一定是奇数，如果2*i是平方数，他的约数和也是奇数。。。减去即可！！！！！

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 100+7;
int t;
ll  n;

int main()
{
    scanf("%d",&t);
    int cas = 0;
    while(t--)
    {
        scanf("%lld", &n);
        ll k = n;
        n -= (ll)sqrt(k);
        n -= (ll)sqrt(k/2);
        printf("Case %d: %lld\n",++cas, n);
    }
    return 0;
}