# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1229821 | nhnguyen14 | Sob (COCI19_sob) | C++20 | 42 ms | 7240 KiB |
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAXLOG=20;
const int N=(int)1e6;
int n,m;
namespace subtask1{
bool f[N+2]={};
void main_code(){
int cur_idx_a=n-1,cur_idx_b=m;
while(cur_idx_a>=0){
int nxt=-1;
for(int i=cur_idx_b;i<=m+n-1;++i){
if ((i&cur_idx_a)==cur_idx_a){
nxt=i;
break;
}
}
assert(nxt!=-1);
for(int i=nxt;i>=cur_idx_b;--i,--cur_idx_a){
assert((i&cur_idx_a)==cur_idx_a);
cout<<cur_idx_a<<' '<<i<<'\n';
}
cur_idx_b=nxt+1;
}
return;
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(0) ; cout.tie(0);
#define task "main"
if (fopen(task".inp","r")){
freopen(task".inp","r",stdin);
// freopen(task".out","w",stdout);
}
cin>>n>>m;
return subtask1::main_code(),0;
assert(false);
return 0;
}
Compilation message (stderr)
# | 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... |