HDU-6555-The Fool（整除分块）

The Fool

Problem Description

The Fool is numbered 0 – the number of unlimited potential –and therefore does not have a specific place in the sequence of the Tarot cards. The Fool can be placed either at the beginning of the Major Arcana or at the end. The Major Arcana is often considered as the Fool’s journey through life and as such, he is
ever present and therefore needs no number.

Given n ∈ N+, print the parity of
N
∑ [n/i]，
i=1
where [x] = max a (a∈Z,a≤x)

Input

The first line of the input contains one integer T ≤ 100, denoting the number of testcases. Then T testcases follow.
In each of the T testcases, there is a positive number n ≤ 109.

Output

For each testcase, print a single line starting with “Case i : ”(i indicates the case number) and then “even” or “odd”, separated with a single space.

Sample Input

3
1
10000
100000000
 

Sample Output

Case 1: odd
Case 2: even
Case 3: even
 

Source
2018CCPC吉林赛区（重现赛）- 感谢北华大学

解题思路：

简单整除分块。对于i<sqrt(n)，直接暴力。
对于i>sqrt(n)枚举 计算 等于 1-sqrt(n) 的个数。

AC代码：

#include <iostream>
#include <cstdio>
#include <math.h>
#include <algorithm>
#include <string>
using namespace std;
typedef long long ll;
const int N = 1e6+10;
struct node{
    ll i,j,k;
    ll id;
}a[N];

bool cmp(node a1,node a2)
{
    if(-a1.k*a2.i + a2.k * a1.j == -a2.k*a1.i + a1.k*a2.j)
        return a1.id < a2.id;
    return -a1.k*a2.i + a2.k * a1.j < -a2.k*a1.i + a1.k*a2.j;
}

int main()
{
    ll t,m,n;
    ll cas = 1;
    cin>>t;
    while(t--)
    {
        cin>>n;
        ll len = sqrt(n);
        ll tmp = 0;
        for(int i = 1 ; n/i >= len ; i ++)
            tmp += n/i;
        for(int i = len-1 ; i >= 1; i --)
        {
            tmp += (n/i - n/(i+1))*i;
        }
        cout<<"Case "<<cas++<<": ";
        if(tmp%2)
            cout<<"odd"<<endl;
        else
            cout<<"even"<<endl;
    }
	return 0;
}