# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
497785 |
2021-12-23T19:45:27 Z |
inksamurai |
Sob (COCI19_sob) |
C++17 |
|
1 ms |
460 KB |
#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>;
bool ispo2(int n){
while(n%2==0){
n/=2;
}
return n==1;
}
int main(){
_32bB6rn;
int n,m;
cin>>n>>m;
assert(ispo2(n));
int x=n-1;
int j=-1;
rep(i,n){
int y=i+m;
if((x&y)==x){
j=i;
break;
}
}
vec(pii) pans;
int oj=j;
while(j>=0){
pans.pb({x,j+m});
j--;
x--;
}
j=oj+1;
while(j<n){
pans.pb({x,j+m});
x--;
j++;
}
for(auto p : pans){
cout<<p.fi<<" "<<p.se<<"\n";
}
//
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
460 KB |
Execution killed with signal 6 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
204 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |