# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
811218 | | pcc | Sob (COCI19_sob) | C++14 | | 30 ms | 3844 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;
#define ll long long
#define pll pair<ll,ll>
#define pii pair<int,int>
#define fs first
#define sc second
int calc(int k){
int re = 0;
while(!(k&1))k>>=1,re++;
return re;
}
int main(){
ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
int n,m;
cin>>n>>m;
int start = m;
for(int i = m;i<n+m;i++){
if(calc(start)<calc(i))start = i;
}
int now = start;
for(int i = 0;i<n;i++){
cout<<i<<' '<<now<<'\n';
now++;
if(now == n+m)now = m;
}
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... |