제출 #235608

#제출 시각아이디문제언어결과실행 시간메모리
235608dooweySob (COCI19_sob)C++14
39 / 110
6 ms512 KiB
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = 510;
bool use[N];

int main(){
  fastIO;
  int n, m;
  cin >> n >> m;
  for(int i = n - 1; i >= 0 ; i -- ){
    for(int j = 0 ; j < n; j ++ ){
      if(use[j]) continue;
      if((i & (m + j))==i){
        use[j]=true;
        cout << i << " " << m + j << "\n";
        break;
      }
    }
  }
  return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...