# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
845029 | M_W_13 | Cheerleaders (info1cup20_cheerleaders) | C++17 | 113 ms | 16024 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 <iostream>
using namespace std;
int main()
{
ios_base::sync_with_stdio(0); cin.tie(0);
int t;
cin >> t;
for (int i = 0; i < t; i++) {
int n, k;
cin >> n >> k;
if (k == 1) {
int klasy[n];
int suma = 0;
for (int x = 0; x< n; x++) {
cin >> klasy[x];
suma += klasy[x];
}
if (suma % 2 == 0) {
cout << "0";
}
else {
cout << "1";
}
}
else {
int log = 0;
while ((1 << log) < k) {
log++;
}
if ((1 << log) > k) {
log--;
}
int klasy[n];
long long potegi[n][log + 1];
for (int x = 0; x < n; x++) {
cin >> klasy[x];
for (int l = 0; l < log + 1; l++) {
if (klasy[x] % (1 << l) == 0) {
potegi[x][l] = klasy[x]/(1 << l);
}
else {
potegi[x][l] = 0;
}
}
}
int suma;
for (int l = 0; l < log + 1; l++) {
suma = 0;
for (int x = 0; x < n; x++) {
suma += potegi[x][l];
}
if (suma % 2 == 1) {
cout << "1";
break;
}
}
if (suma % 2 == 0) {
cout << "0";
}
}
}
return 0;
}
Compilation message (stderr)
# | 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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |