# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
83856 | faceless | Question (Grader is different from the original contest) (CEOI14_question_grader) | C++14 | 0 ms | 0 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>
#define MP make_pair
#define F first
#define PB push_back
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int maxn = 200 + 4;
int numbit (int mask) {
int ret = 0;
while (mask) {
mask -= mask & -mask;
ret ++;
}
return ret;
}
int to[2000];
int main (){
int n, x, y;
cin >> n >> x >> y;
int tmp = 1;
for (int mask = 0; mask < (1 << 12); mask ++) {
if (numbit (mask) == 6) {
to[tmp ++] = mask;
}
}
for (int i = 0; i < 12; i++) {
if (to[x] & (1 << i) and (to[y] & (1 << i)) == 0)
return i + 1;
}
}
#include <bits/stdc++.h>
#define MP make_pair
#define F first
#define PB push_back
#define S second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const int maxn = 200 + 4;
int numbit (int mask) {
int ret = 0;
while (mask) {
mask -= mask & -mask;
ret ++;
}
return ret;
}
int to[2000];
int main (){
int n, q, h;
cin >> n >> q >> h;
int tmp = 1;
for (int mask = 0; mask < (1 << 12); mask ++) {
if (numbit (mask) == 6) {
to[tmp ++] = mask;
}
}
int mask = to[q];
if (mask & (1 << (h - 1)))
return 1;
return 0;
}