hdu2608 0or1（找规律）

Description

Solving problem is a interesting thing. Yifenfei like to slove different problem,because he think it is a way let him more intelligent. But as we know,yifenfei is weak in math. When he come up against a difficult math problem, he always try to get a hand. Now the problem is coming! Let we
define T(n) as the sum of all numbers which are positive integers can divied n. and S(n) = T(1) + T(2) + T(3)…..+T(n).

Input

The first line of the input contains an integer T which means the number of test cases. Then T lines follow, each line consists of only one positive integers n. You may assume the integer will not exceed 2^31.

Output

For each test case, you should output one lines of one integer S(n) %2. So you may see the answer is always 0 or 1 .

Sample Input

3
1
2
3 

Sample Output

1
0
0



        
  

Hint

Hint S(3) = T(1) + T(2) +T(3) = 1 + (1+2) + (1+3) = 8 S(3) % 2 = 0

 

网上找的 ：

分析: 假设数n=2^k*p1^s1*p2^s2*p3^s3*...*pi^si;k,s1...si>=0,p1..pi为n的素因子 所以T[n]=(2^0+2^1+...+2^k)*(p1^0+p1^1+...+p1^s1)*...*(pi^0+pi^1+...+pi^si); 显然(2^0+2^1+...+2^k)%2=1,所以T[n]是0或1就取决于(p1^0+p1^1+...+p1^s1)*...*(pi^0+pi^1+...+pi^si) 而p1...pi都是奇数(除2之外的素数一定是奇数),所以(pi^0+pi^1+...+pi^si)只要有一个si为奇数(i=1...i)  则(pi^0+pi^1+...+pi^si)%2=0,则T[n]%2=0 若si为奇数,则pi^si+1为偶数,pi^1+pi^2+...+pi^(si-1)为偶数(偶数个奇数和为偶数)所以要T[n]%2=1,则所有的si为偶数，则n=2^(k%2)*m^2; m=2^(k/2)*p1^(s1/2)*p2^(s2/2)*...*pi^(si/2)所以只要n为某个数的平方或者某个数的平方和则T[n]%2=1,只要统计n的个数即可 

 

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<queue>
#include<algorithm>
#include<map>
#include<cmath>
#include<iomanip>
using namespace std;
int main()
{
    int t,n;
    cin>>t;
    while(t--)
    {
        cin>>n;
        int sum=(int)sqrt(n*1.0)+(int)sqrt(n*1.0/2);
        cout<<sum%2<<endl;
    }
    return 0;
}