The Fool HDU 6555 思维/数论

开个根就行

#include <cstdio>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <queue>
#include <vector>
#include <map>
#include <string>
#include <iterator>
#include <set>


#define lint long long
using namespace std;


int main()
{
    lint i,n,m,j,k,l,t,r,cnt;

    scanf("%lld",&t);



    for(lint ttt=1;ttt<=t;ttt++)
    {
        scanf("%lld",&n);

        cnt=n;
        k=0;
        for(i=1;i*i<=n;i++)
        {
            k+=n/i;
            k%=2;

            if(n/i==i) break;

            //printf("%lld,%lld\n",n/i,cnt-(n/(i+1)));

            k+=i*(cnt-(n/(i+1)));
            cnt=(n/(i+1));
            k%=2;
        }

        //printf("%lld",k);

        if(k%2==0)
        printf("Case %lld: even\n",ttt);
        else
        printf("Case %lld: odd\n",ttt);
    }


    return 0;
}