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>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _32bB6rn ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
int main(){
_32bB6rn;
int n,m;
cin>>n>>m;
vi a,b;
rep(i,n){
a.pb(i);
b.pb(i+m);
}
auto affine=[&](vi a,vi b)->bool{
bool pok=1;
rep(i,n){
int x=a[i],y=b[i];
int z=x&y;
if(z!=x){
pok=0;
break;
}
}
return pok;
};
rep(_,n){
if(affine(a,b)){
rep(i,n){
cout<<a[i]<<" "<<b[i]<<"\n";
}
exit(0);
}
rotate(b.begin(),b.begin()+1,b.end());
}
//
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |