Codeforces Round #697 (Div. 3) A. Odd Divisor

标签：break   include   div   cpp   round   ios   int   lld   get   

Aimee

只要不能写成\(2^N N \subseteq N^*\)就肯定有

 #include<iostream>
 #include<cstdio>
 #include<cmath>
 #define int long long
 using namespace std;
 int n,m;
 int prime[5000001];
 int flag[10000001];
 int Aimee[5000001];
 int p; 
 int num;
 int now;
 int t;
 long long x;
 signed main(){
     scanf("%d",&t);
	 while(t--){
	 	int f=0;
	 	scanf("%lld",&x);
		while(x>1){
			if(x&1){
				cout<<"Yes\n";
				f=1;
				break;
			}
			x>>=1;
		}
		if(!f){
			cout<<"No\n";
		}
	 }  
     return 0;
 }

Codeforces Round #697 (Div. 3) A. Odd Divisor

标签：break   include   div   cpp   round   ios   int   lld   get   

原文地址：https://www.cnblogs.com/For-Miku/p/14440309.html