A - Odd vs Even(规律)

https://atcoder.jp/contests/arc116/tasks/arc116_a


找规律

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
int main(void)
{
  	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        LL n;cin>>n;
        if(n&1){
            cout<<"Odd"<<"\n";
        }
        else if(n%2==0){
           LL k=n/2;
           if(k&1){
            cout<<"Same"<<"\n";
           }
           else cout<<"Even"<<"\n";
        }
    }
return 0;
}

 

上一篇:整数奇偶排序


下一篇:1315. Sum of Nodes with Even-Valued Grandparent