# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
811228 |
2023-08-07T02:48:04 Z |
pcc |
Sob (COCI19_sob) |
C++14 |
|
1 ms |
340 KB |
#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;
if(n>3000){
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;
}
}
else{
for(int i = 0;i<n;i++){
cout<<i<<" ";
for(int j = m;j<n+m;j++){
if((i&j) == i){
cout<<j<<'\n';
break;
}
if(j == n+m-1)assert(false);
}
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |