The Fool HDU - 6555

The Fool HDU - 6555

传送门
题目大意为：
给出一个数n，求从这个数除以1到n所得的结果之和，是奇数还是偶数。
数据范围1e9
解：暴力肯定T，然后我分先，一个数除以从它的一半开始就等于一，所以就跑了n/2的次数。以为可以过（以前大致认为1e9就跑1000ms)，最后T了。打表发现规律，3(1 ~ 3 )为奇数，5（4 ~ 9）为偶数…打个表就晓得了，最后做法就是sqrt(n),判断它的奇偶即可

#include <iostream>
#include <cstdio>
#include<cstdlib>
#include <fstream>
#include <algorithm>
#include <cmath>
#include <deque>
#include <vector>
#include <queue>
#include <string>
#include <cstring>
#include <map>
#include<time.h>
#include <stack>
#include <list>
#include <set>
#include <sstream>
#include <iterator>
using namespace std;
#define FOPI freopen("input.in", "r", stdin)
#define DOPI freopen("output.out", "w", stdout)
#define ll long long int
#define fro(i,a,n) for(ll i=a;i<n;i++)
#define pre(i,a,n) for(ll i=n-1;i>=a;i--)
#define mem(a,b) memset(a,b,sizeof(a))
#define ls l,mid,rt<<1
#define rs mid+1,r,rt<<1|1
#define fi first
#define se second
#define s_d(a) scanf("%d",&a)
#define s_lld(a) scanf("%lld",&a)
#define s_s(a) scanf("%s",a)
#define s_ch(a) scanf("%c",&a)
typedef pair<ll,ll> P;
ll gcd(ll a,ll b){return b==0?a:gcd(b,a%b);}
const double PI = 3.1415926535897932;
const double EPS=1e-6;
const int INF=0x3f3f3f3f;
const int maxn = 2e5+100;
int lowbit(int x){return x&(-x);}
int main()
{
    ios::sync_with_stdio(0);
    int t;
    cin>>t;
    int case1=1;
    while(t--)
    {
        int a;
        cin>>a;
         a=sqrt(a);
        cout<<"Case "<<case1++<<": ";
        if(a%2==1)
            cout<<"odd"<<endl;
        else
            cout<<"even"<<endl;

    }
    return 0;
}