# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
257960 | igm_igm | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef int64_t llo;
#define mp make_pair
#define pb push_back
#define a first
#define b second
int val[921];
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int tt;
cin>>tt;
int co=0;
for(int i=0;i<(1<<12);i++){
if(__builtin_popcount(i)==6){
co+=1;
if(co>920){
break;
}
val[co]=i;
}
}
if(tt==1){
int n,t;
cin>>n>>t;
while(t--){
int aa,bb;
cin>>aa>>bb;
int pp=0;
aa=val[aa];
bb=val[bb];
for(int i=0;i<12;i++){
if(((1<<i)&aa)){
if(((1<<i)&bb)==0){
cout<<i+1<<endl;
break;
}
}
}
}
}
else{
int n,t;
cin>>n>>t;
while(t--){
int aa,bb;
cin>>aa>>bb;
int pp=0;
aa=val[aa];
if((aa&(1<<(bb-1)))){
cout<<"yes"<<endl;
}
else{
cout<<"no"<<endl;
}
}
}
return 0;
}