buggy_code
stringlengths 11
625k
| fixed_code
stringlengths 17
625k
| bug_type
stringlengths 2
4.45k
| language
int64 0
8
| token_count
int64 5
200k
|
|---|---|---|---|---|
#include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a[28];
int f[31];
rep(i, 28) scanf("%d", &a[i]);
fill(f, f + 31, 0);
f[0] = 1;
rep(i, 28) f[a[i]] = 1;
rep(i, 30) if (f[i + 1] == 0) printf("%d\n", i);
}
|
#include <algorithm>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int a[28];
int f[31];
rep(i, 28) scanf("%d", &a[i]);
fill(f, f + 31, 0);
f[0] = 1;
rep(i, 28) f[a[i]] = 1;
rep(i, 30) if (f[i + 1] == 0) printf("%d\n", i + 1);
}
|
[["+", 64, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 116
|
#include <iostream>
#include <vector>
using namespace std;
#define NUM 30
int main(void) {
vector<bool> at(NUM + 1, false);
for (int i = 0; i < NUM; i++) {
int student;
cin >> student;
at[student] = true;
}
for (int i = 1; i < NUM + 1; i++) {
if (at[i])
cout << i << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
#define NUM 30
int main(void) {
vector<bool> at(NUM + 1, false);
for (int i = 0; i < NUM; i++) {
int student;
cin >> student;
at[student] = true;
}
for (int i = 1; i < NUM + 1; i++) {
if (at[i] == false)
cout << i << endl;
}
return 0;
}
|
[["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 147]]
| 1
| 95
|
#include <iostream>
using namespace std;
int main() {
bool b[31];
for (int i = 0, t; i < 28; i++)
cin >> t, b[t] = true;
for (int i = 1; i < 31; i++)
if (b[i])
cout << i << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
bool b[31] = {};
for (int i = 0, t; i < 28; i++)
cin >> t, b[t] = true;
for (int i = 1; i < 31; i++)
if (!b[i])
cout << i << endl;
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 43, 49, 50, 0, 32], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 45], ["+", 8, 9, 0, 43, 49, 50, 51, 83, 0, 46], ["+", 0, 7, 8, 57, 15, 339, 51, 91, 17, 111]]
| 1
| 75
|
#include <stdio.h>
int main() {
int st[30] = {0}, i, n;
for (i = 0; i < 28; i++) {
scanf("%d", &n);
st[i - 1] = 1;
}
for (i = 0; i < 30; i++)
if (st[i] == 0)
printf("%d\n", i + 1);
}
|
#include <stdio.h>
int main() {
int st[30] = {0}, i, n;
for (i = 0; i < 28; i++) {
scanf("%d", &n);
st[n - 1] = 1;
}
for (i = 0; i < 30; i++)
if (st[i] == 0)
printf("%d\n", i + 1);
}
|
[["-", 0, 11, 31, 69, 341, 342, 0, 16, 31, 22], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 31, 22]]
| 1
| 90
|
#include <cstdio>
int main() {
int a[31] = {}, i;
for (i = 28; i--; a[*a])
scanf("%d", a);
for (i = 1; i < 31; ++i)
a[i] ? 0 : printf("%d\n", i);
}
|
#include <cstdio>
int main() {
int a[31] = {}, i;
for (i = 28; i--; a[*a] = 1)
scanf("%d", a);
for (i = 1; i < 31; ++i)
a[i] ? 0 : printf("%d\n", i);
}
|
[["+", 0, 14, 8, 9, 0, 7, 26, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 7, 26, 11, 12, 13]]
| 1
| 73
|
#include <cstdio>
int main() {
int a[31] = {}, i;
for (i = 28; i--; a[*a])
scanf("%d", a);
for (i = 1; i < 31; ++i)
a[i] ? 0 : printf("%d\n", i);
}
|
#import <cstdio>
int main() {
int a[31] = {}, i;
for (i = 28; i--; a[*a] = 1)
scanf("%d", a);
for (i = 1; i < 31; ++i)
a[i] ? 0 : printf("%d\n", i);
}
|
[["-", 36, 36, 36, 36, 0, 30, 0, 135, 0, 138], ["+", 36, 36, 36, 36, 0, 30, 0, 181, 182, 183], ["+", 0, 14, 8, 9, 0, 7, 26, 11, 17, 32], ["+", 0, 14, 8, 9, 0, 7, 26, 11, 12, 13]]
| 1
| 73
|
#include <iostream>
using namespace std;
int main() {
int buf;
bool stud[30];
for (int i = 0; i < 30; i++) {
stud[i] = 0;
}
for (int i = 0; i < 28; i++) {
cin >> buf;
stud[buf] = 1;
}
for (int i = 0; i < 30; i++) {
if (stud[i] == 0) {
cout << i + 1 << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int buf;
bool stud[30];
for (int i = 0; i < 30; i++) {
stud[i] = 0;
}
for (int i = 0; i < 28; i++) {
cin >> buf;
stud[buf - 1] = 1;
}
for (int i = 0; i < 30; i++) {
if (stud[i] == 0) {
cout << i + 1 << endl;
}
}
return 0;
}
|
[["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]]
| 1
| 109
|
#include <iostream>
using namespace std;
bool submitted[31] = {false};
int main() {
int n;
for (int i = 1; i <= 28; i++) {
cin >> n;
submitted[n] = true;
}
for (int i = 1; i < 31; i++) {
if (submitted[i])
cout << i << endl;
}
}
|
#include <iostream>
using namespace std;
bool submitted[31] = {false};
int main() {
int n;
for (int i = 1; i <= 28; i++) {
cin >> n;
submitted[n] = true;
}
for (int i = 1; i <= 30; i++) {
if (!submitted[i])
cout << i << endl;
}
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 17, 18], ["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 17, 19], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 91, 17, 111]]
| 1
| 81
|
#include <stdio.h>
int main(void) {
int a[31] = {0};
int i = 0, j = 0;
int num = 0;
int b[2] = {0};
a[0] = 0;
for (i = 0; i <= 27; i++) {
scanf("%d", &num);
a[num] = 1;
}
j = 0;
for (i = 1; i <= 30; i++) {
if (a[i] == 0) {
b[j] = i;
j++;
}
}
if (b[0] > b[1]) {
j = a[0];
a[0] = a[1];
a[1] = j;
}
for (i = 0; i <= 1; i++) {
printf("%d ", b[i]);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int a[31] = {0};
int i = 0, j = 0;
int num = 0;
int b[2] = {0};
a[0] = 0;
for (i = 0; i <= 27; i++) {
scanf("%d", &num);
a[num] = 1;
}
j = 0;
for (i = 1; i <= 30; i++) {
if (a[i] == 0) {
b[j] = i;
j++;
}
}
if (b[0] > b[1]) {
j = a[0];
a[0] = a[1];
a[1] = j;
}
for (i = 0; i <= 1; i++) {
printf("%d\n", b[i]);
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 190
|
#include <iostream>
using namespace std;
bool d[30];
int main(void) {
int n;
for (int i = 0; i < 28; i++) {
cin >> n;
d[n - 1] = true;
}
for (int i = 0; i < 30; i++)
if (d[i])
cout << i + 1 << endl;
return 0;
}
|
#include <iostream>
using namespace std;
bool d[30];
int main(void) {
int n;
for (int i = 0; i < 28; i++) {
cin >> n;
d[n - 1] = true;
}
for (int i = 0; i < 30; i++)
if (!d[i])
cout << i + 1 << endl;
return 0;
}
|
[["+", 0, 7, 8, 57, 15, 339, 51, 91, 17, 111]]
| 1
| 83
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int st[30] = {0};
int i;
for (i = 0; i < 28; i++) {
int input;
cin >> input;
st[input - 1] = 1;
}
for (i = 0; i < 28; i++) {
if (!st[i])
printf("%d\n", i);
}
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int st[30] = {0};
int i;
for (i = 0; i < 28; i++) {
int input;
cin >> input;
st[input - 1] = 1;
}
for (i = 0; i < 30; i++) {
if (!st[i])
printf("%d\n", i + 1);
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 17, 72], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 12, 13]]
| 1
| 98
|
#include <stdio.h>
#include <string.h>
bool vis[35];
int main() {
int t;
while (scanf("%d", &t) == 1) {
memset(vis, false, 35 * sizeof(bool));
vis[t] = true;
for (int i = 0; i < 27; i++) {
scanf("%d", &t);
vis[t] = true;
}
for (int i = 0; i < 35; i++) {
if (vis[i] == false) {
printf("%d\n", i);
}
}
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
bool vis[35];
int main() {
int t;
while (scanf("%d", &t) == 1) {
memset(vis, false, 35 * sizeof(bool));
vis[t] = true;
for (int i = 0; i < 27; i++) {
scanf("%d", &t);
vis[t] = true;
}
for (int i = 1; i < 31; i++) {
if (vis[i] == false) {
printf("%d\n", i);
}
}
}
return 0;
}
|
[["-", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 51, 13], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 129
|
#include <iostream>
using namespace std;
int main() {
int submit[31] = {0};
int submiter;
for (int i = 0; i < 28; i++) {
cin >> submiter;
submit[submiter] = 1;
}
for (int i = 1; i < 31; i++) {
if (submit[i] == 0) {
cout << submit[i] << endl;
}
}
}
|
#include <iostream>
using namespace std;
int main() {
int submit[31] = {0};
int submiter;
for (int i = 0; i < 28; i++) {
cin >> submiter;
submit[submiter] = 1;
}
for (int i = 1; i < 31; i++) {
if (submit[i] == 0) {
cout << i << endl;
}
}
}
|
[["-", 0, 1, 0, 16, 31, 16, 12, 69, 28, 22], ["-", 0, 16, 31, 16, 12, 69, 341, 342, 0, 70], ["-", 0, 16, 31, 16, 12, 69, 341, 342, 0, 73]]
| 1
| 88
|
#include <iostream>
using namespace std;
int main(void) {
int buf;
bool students[30];
for (int i = 0; i < 30; i++) {
students[i] = true;
}
for (int i = 0; i < 28; i++) {
cin >> buf;
students[buf] = false;
}
for (int i = 0; i < 30; i++) {
if (students[i])
cout << i << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main(void) {
int buf;
bool students[30];
for (int i = 0; i < 30; i++) {
students[i] = true;
}
for (int i = 0; i < 28; i++) {
cin >> buf;
students[buf - 1] = false;
}
for (int i = 0; i < 30; i++) {
if (students[i])
cout << i + 1 << endl;
}
return 0;
}
|
[["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13], ["+", 64, 1, 0, 16, 31, 16, 12, 16, 17, 72], ["+", 64, 1, 0, 16, 31, 16, 12, 16, 12, 13]]
| 1
| 104
|
#include <cstdio>
int main() {
bool sub[30];
for (int i = 0; i < 30; i++)
sub[i] = false;
for (int i = 0; i < 28; i++) {
int tmp;
scanf("%d", &tmp);
sub[tmp - 1] = true;
}
for (int i = 0; i < 30; i++) {
if (!sub[i])
printf("%d\n", i - 1);
}
return 0;
}
|
#include <cstdio>
int main() {
bool sub[30];
for (int i = 0; i < 30; i++)
sub[i] = false;
for (int i = 0; i < 28; i++) {
int tmp;
scanf("%d", &tmp);
sub[tmp - 1] = true;
}
for (int i = 0; i < 30; i++) {
if (!sub[i])
printf("%d\n", i + 1);
}
return 0;
}
|
[["-", 64, 1, 0, 2, 3, 4, 0, 16, 17, 33], ["+", 64, 1, 0, 2, 3, 4, 0, 16, 17, 72]]
| 1
| 112
|
#include <algorithm>
#include <iostream>
using namespace std;
#define INF (1 << 30)
int main() {
bool a[31] = {}, b;
for (int i = 0; i < 28; i++)
cin >> b, a[b] = true;
for (int i = 1; i < 31; i++)
if (!a[i])
cout << i << endl;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
#define INF (1 << 30)
int main() {
bool a[31] = {};
int b;
for (int i = 0; i < 28; i++)
cin >> b, a[b] = true;
for (int i = 1; i < 31; i++)
if (!a[i])
cout << i << endl;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 43, 0, 21], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 0, 35], ["+", 0, 30, 0, 14, 8, 9, 0, 43, 39, 40]]
| 1
| 81
|
#include <iostream>
using namespace std;
int main() {
int a[30];
for (int i = 0; i < 30; i++)
a[i] = 0;
int n;
for (int i = 0; i < 28; i++) {
cin >> n;
a[n - 1]++;
}
for (int i = 0; i < 30; i++) {
if (a[i] == 0) {
cout << i - 1 << "\n";
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a[30];
for (int i = 0; i < 30; i++)
a[i] = 0;
int n;
for (int i = 0; i < 28; i++) {
cin >> n;
a[n - 1]++;
}
for (int i = 0; i < 30; i++) {
if (a[i] == 0) {
cout << i + 1 << "\n";
}
}
return 0;
}
|
[["-", 0, 1, 0, 16, 31, 16, 12, 16, 17, 33], ["+", 0, 1, 0, 16, 31, 16, 12, 16, 17, 72]]
| 1
| 110
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int x[30] = {}, a;
for (int i = 0; i < 28; i++) {
cin >> a;
x[a] = 1;
}
for (int i = 0; i < 30; i++) {
if (x[i] == 0)
cout << i + 1 << endl;
}
return 0;
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int x[30] = {}, a;
for (int i = 0; i < 28; i++) {
cin >> a;
x[a - 1] = 1;
}
for (int i = 0; i < 30; i++) {
if (x[i] == 0)
cout << i + 1 << endl;
}
return 0;
}
|
[["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]]
| 1
| 88
|
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n;
int a, b;
int i;
a = b = 0;
for (i = 0; i < 8; i++) {
scanf("%d", &n);
if (i < 4) {
a += n;
} else {
b += n;
}
printf("%d\n", max(a, b));
}
return (0);
}
|
#include <algorithm>
#include <cstdio>
using namespace std;
int main() {
int n;
int a, b;
int i;
a = b = 0;
for (i = 0; i < 8; i++) {
scanf("%d", &n);
if (i < 4) {
a += n;
} else {
b += n;
}
}
printf("%d\n", max(a, b));
return (0);
}
|
[["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 95
|
#include <bits/stdc++.h>
using namespace std;
#define for_(i, a, b) for (int i = a; i < b; ++i)
int main() {
int A = 0, B = 0, a;
for_(i, 0, 4) scanf("%d", &a), A += a;
for_(i, 0, 4) scanf("%d", &a);
B += a;
cout << max(A, B) << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define for_(i, a, b) for (int i = a; i < b; ++i)
int main() {
int A = 0, B = 0, a;
for_(i, 0, 4) scanf("%d", &a), A += a;
for_(i, 0, 4) scanf("%d", &a), B += a;
cout << max(A, B) << endl;
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 1, 0, 34, 0, 21]]
| 1
| 93
|
#include <iostream>
using namespace std;
int main() {
int S, P, w, x, y, z, a, b, c, d;
cin >> w >> x >> y >> z;
S = w + x + y + z;
cin >> a >> b >> c >> d;
P = a + b + c + d;
if (S == P) {
cout << S << endl;
}
int q = max(S, P);
cout << q << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int S, P, w, x, y, z, a, b, c, d;
cin >> w >> x >> y >> z;
S = w + x + y + z;
cin >> a >> b >> c >> d;
P = a + b + c + d;
if (S == P) {
cout << S << endl;
} else {
int q = max(S, P);
cout << q << endl;
}
return 0;
}
|
[["+", 0, 14, 8, 9, 0, 57, 75, 76, 0, 95], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]]
| 1
| 106
|
// Example program
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a;
int b;
int c;
int d;
int e;
int f;
int g;
int h;
cin >> a >> b >> c >> d >> e >> f;
vector<int> v{a + b + c + d, e + f + g + h};
sort(v.begin(), v.end());
cout << v[1] << endl;
}
|
// Example program
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int a;
int b;
int c;
int d;
int e;
int f;
int g;
int h;
cin >> a >> b >> c >> d >> e >> f >> g >> h;
vector<int> v{a + b + c + d, e + f + g + h};
sort(v.begin(), v.end());
cout << v[1] << endl;
}
|
[["+", 8, 9, 0, 1, 0, 16, 31, 16, 17, 152], ["+", 8, 9, 0, 1, 0, 16, 31, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 17, 152], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 12, 22]]
| 1
| 102
|
#include <stdio.h>
int main() {
int t = 0, s = 0, b, a = 0, i, j;
for (j = 0; j < 4; j++) {
scanf("%d", &a);
s = a + s;
}
for (i = 0; i < 4; i++) {
scanf("%d", &b);
t = b + t;
}
if (a > b) {
printf("%d\n", a);
} else {
printf("%d\n", b);
}
}
|
#include <stdio.h>
int main() {
int t = 0, s = 0, b, a = 0, i, j;
for (j = 0; j < 4; j++) {
scanf("%d", &a);
s = a + s;
}
for (i = 0; i < 4; i++) {
scanf("%d", &b);
t = b + t;
}
if (s > t) {
printf("%d\n", s);
} else {
printf("%d\n", t);
}
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 31, 22], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 22], ["-", 64, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 64, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22]]
| 1
| 120
|
#include <iostream>
using namespace std;
int main() {
int a[4], b[4];
int n = 0;
while (cin >> a[n]) {
n++;
if (n == 4)
break;
}
n = 0;
while (cin >> b[n]) {
n++;
if (n == 4)
break;
}
int A = a[0] + a[1] + a[2] + a[3];
int B = b[0] + b[1] + b[2] + b[3];
if (A > B) {
cout << A << endl;
}
if (A < B) {
cout << B << endl;
}
if (A = B) {
cout << A << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a[4], b[4];
int n = 0;
while (cin >> a[n]) {
n++;
if (n == 4)
break;
}
n = 0;
while (cin >> b[n]) {
n++;
if (n == 4)
break;
}
int A = a[0] + a[1] + a[2] + a[3];
int B = b[0] + b[1] + b[2] + b[3];
if (A > B) {
cout << A << endl;
}
if (A < B) {
cout << B << endl;
}
if (A == B) {
cout << A << endl;
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]]
| 1
| 167
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1 << 29;
int main() {
int v[] = {};
REP(i, 2) {
REP(j, 4) {
int a;
cin >> a;
v[i] += a;
}
}
cout << max(v[0], v[1]) << endl;
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define FOR(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define ALL(c) (c).begin(), (c).end()
const int INF = 1 << 29;
int main() {
int v[4] = {};
REP(i, 2) {
REP(j, 4) {
int a;
cin >> a;
v[i] += a;
}
}
cout << max(v[0], v[1]) << endl;
}
|
[["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13]]
| 1
| 117
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
int max = 0;
for (int i = 0; i < 2; ++i) {
cin >> a >> b >> c >> d;
int sum = a + b + c + d;
if (sum > max)
sum = max;
}
cout << max << endl;
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
int a, b, c, d;
int max = 0;
for (int i = 0; i < 2; ++i) {
cin >> a >> b >> c >> d;
int sum = a + b + c + d;
if (sum > max)
max = sum;
}
cout << max << endl;
return 0;
}
|
[["-", 8, 9, 0, 57, 64, 1, 0, 11, 31, 22], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 12, 22]]
| 1
| 82
|
#include <cstdio>
using namespace std;
int main(void) {
int a = 0, b = 0, c;
for (int i = 0; i < 4; i++) {
scanf("%d", c);
a += c;
}
for (int i = 0; i < 4; i++) {
scanf("%d", c);
b += c;
}
if (a > b)
printf("%d\n", a);
else
printf("%d\n", b);
return 0;
}
|
#include <cstdio>
using namespace std;
int main(void) {
int a = 0, b = 0, c;
for (int i = 0; i < 4; i++) {
scanf("%d", &c);
a += c;
}
for (int i = 0; i < 4; i++) {
scanf("%d", &c);
b += c;
}
if (a > b)
printf("%d\n", a);
else
printf("%d\n", b);
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]]
| 1
| 112
|
#include <stdio.h>
int main(void) {
int point[4];
int i;
int sum[2], max = 0;
sum[0] = 0;
sum[1] = 0;
for (i = 0; i < 2; i++) {
scanf("%d %d %d %d", &point[0], &point[1], &point[2], point[3]);
sum[i] += point[0] + point[1] + point[2] + point[3];
if (max < sum[i]) {
max = sum[i];
}
}
printf("%d\n", max);
return 0;
}
|
#include <stdio.h>
int main(void) {
int point[4];
int i;
int sum[2], max = 0;
sum[0] = 0;
sum[1] = 0;
for (i = 0; i < 2; i++) {
scanf("%d %d %d %d", &point[0], &point[1], &point[2], &point[3]);
sum[i] += point[0] + point[1] + point[2] + point[3];
if (max < sum[i]) {
max = sum[i];
}
}
printf("%d\n", max);
return 0;
}
|
[["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]]
| 1
| 143
|
// include
//------------------------------------------
#include <bits/stdc++.h> // only for GCC
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
// container util
//------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
// repetition
//------------------------------------------
#define loop(i, a, b) for (ull i = (a); i < ull(b); ++i)
#define rep(i, n) loop(i, 0, n)
#define iter(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define riter(i, c) for (auto i = (c).rbegin(); i != (c).rend(); ++i)
// constant
//--------------------------------------------
const double eps = 1e-10;
const double pi = acos(-1.0);
const double inf = (int)1e8;
// output vector
// ------------------------------------------
namespace std {
template <typename T> ostream &operator<<(ostream &os, vector<T> const &v) {
iter(it, v) os << *it << (it + 1 == v.end() ? "" : ",");
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << "[" << p.dirst << "," << p.second << "]";
}
} // namespace std
// clear memory
// ------------------------------------------
#define clr(a, i) memset((a), (i), sizeof(a))
int main() {
vi a(4), b(4);
rep(i, 4) cin >> a[i];
rep(i, 4) cin >> b[i];
if (accumulate(all(a), 0) > accumulate(all(b), 0))
cout << accumulate(all(a), 0) << endl;
else
cout << accumulate(all(a), 0) << endl;
}
|
// include
//------------------------------------------
#include <bits/stdc++.h> // only for GCC
using namespace std;
// typedef
//------------------------------------------
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef pair<int, int> pii;
typedef long long ll;
typedef unsigned long long ull;
// container util
//------------------------------------------
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
// repetition
//------------------------------------------
#define loop(i, a, b) for (ull i = (a); i < ull(b); ++i)
#define rep(i, n) loop(i, 0, n)
#define iter(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define riter(i, c) for (auto i = (c).rbegin(); i != (c).rend(); ++i)
// constant
//--------------------------------------------
const double eps = 1e-10;
const double pi = acos(-1.0);
const double inf = (int)1e8;
// output vector
// ------------------------------------------
namespace std {
template <typename T> ostream &operator<<(ostream &os, vector<T> const &v) {
iter(it, v) os << *it << (it + 1 == v.end() ? "" : ",");
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << "[" << p.dirst << "," << p.second << "]";
}
} // namespace std
// clear memory
// ------------------------------------------
#define clr(a, i) memset((a), (i), sizeof(a))
int main() {
vi a(4), b(4);
rep(i, 4) cin >> a[i];
rep(i, 4) cin >> b[i];
if (accumulate(all(a), 0) > accumulate(all(b), 0))
cout << accumulate(all(a), 0) << endl;
else
cout << accumulate(all(b), 0) << endl;
}
|
[["-", 12, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 22]]
| 1
| 370
|
#!/usr/bin/env python
import copy
x = ['Front', 'Right', 'Back', 'Left']
y = ['Top', 'Front', 'Bottom', 'Back']
z = ['Top', 'Left', 'Bottom', 'Right']
def turn(dice, direction):
turned_dice = copy.deepcopy(dice)
# x?????????
if direction == 'Right':
for i in range(4):
turned_dice[x[i]] = dice[x[(i+1)%4]]
if direction == 'Left':
for i in range(4):
turned_dice[x[i]] = dice[x[(i-1)%4]]
# y?????????
if direction == 'North':
for i in range(4):
turned_dice[y[i]] = dice[y[(i+1)%4]]
if direction == 'South':
for i in range(4):
turned_dice[y[i]] = dice[y[(i-1)%4]]
# z?????????
if direction == 'East':
for i in range(4):
turned_dice[z[i]] = dice[z[(i+1)%4]]
if direction == 'West':
for i in range(4):
turned_dice[z[i]] = dice[z[(i-1)%4]]
return turned_dice
if __name__ == '__main__':
while True:
n = int(eval(input()))
if n == 0:
break
dice = {'Top': 1, 'Front': 2, 'Right': 3,
'Left': 4, 'Back': 5, 'Bottom': 6}
ret = 1
for i in range(n):
dice = turn(dice, eval(input()))
ret += dice['Top']
print(ret)
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import copy
x = ['Front', 'Right', 'Back', 'Left']
y = ['Top', 'Front', 'Bottom', 'Back']
z = ['Top', 'Left', 'Bottom', 'Right']
def turn(dice, direction):
turned_dice = copy.deepcopy(dice)
# x?????????
if direction == 'Right':
for i in range(4):
turned_dice[x[i]] = dice[x[(i+1)%4]]
if direction == 'Left':
for i in range(4):
turned_dice[x[i]] = dice[x[(i-1)%4]]
# y?????????
if direction == 'North':
for i in range(4):
turned_dice[y[i]] = dice[y[(i+1)%4]]
if direction == 'South':
for i in range(4):
turned_dice[y[i]] = dice[y[(i-1)%4]]
# z?????????
if direction == 'East':
for i in range(4):
turned_dice[z[i]] = dice[z[(i+1)%4]]
if direction == 'West':
for i in range(4):
turned_dice[z[i]] = dice[z[(i-1)%4]]
return turned_dice
if __name__ == '__main__':
while True:
n = int(input())
if n == 0:
break
dice = {'Top': 1, 'Front': 2, 'Right': 3,
'Left': 4, 'Back': 5, 'Bottom': 6}
ret = 1
for i in range(n):
dice = turn(dice, input())
ret += dice['Top']
print(ret)
|
[["-", 0, 662, 12, 652, 3, 4, 0, 652, 63, 22], ["-", 12, 652, 3, 4, 0, 652, 3, 4, 0, 24], ["-", 0, 652, 3, 4, 0, 652, 3, 4, 0, 25]]
| 5
| 399
|
import sys
s=sys.stdin
while 1:
n=int(s.readline())
if n==0:break
a=1;s='123456'
for _ in[0]*n:
s=[s[int(e)]for e in{'N':"152304",'E':"310542",'W':"215043",'S':"402351",'R':"024135",'L':"031425"}[s.readline()[0]]]
a+=int(s[0])
print(a)
|
import sys
d=sys.stdin
while 1:
n=int(d.readline())
if n==0:break
a=1;s='123456'
for _ in[0]*n:
s=[s[int(e)]for e in{'N':"152304",'E':"310542",'W':"215043",'S':"402351",'R':"024135",'L':"031425"}[d.readline()[0]]]
a+=int(s[0])
print(a)
|
[["-", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["+", 36, 36, 0, 656, 0, 1, 0, 662, 31, 22], ["-", 12, 652, 3, 4, 0, 652, 63, 319, 500, 22], ["+", 12, 652, 3, 4, 0, 652, 63, 319, 500, 22], ["-", 12, 206, 206, 206, 51, 652, 63, 319, 500, 22], ["+", 12, 206, 206, 206, 51, 652, 63, 319, 500, 22]]
| 5
| 130
|
// AOJ 0503: Cup
// 2017.10.29 bal4u@uu
#include <stdio.h>
#include <stdlib.h>
int c[16];
int main() {
int n, m, i, j, k, ans;
int p3[16];
for (p3[0] = 1, i = 1; i < 16; i++)
p3[i] = 3 * p3[i - 1];
while (scanf("%d%d", &n, &m) && n > 0) {
for (i = 0; i < 3; i++) {
scanf("%d", &j);
while (j-- > 0)
scanf("%d", &k), c[k] = i;
}
ans = k = 0;
for (i = 0; i < n; i++) {
j = c[i] - k;
if (j < 0)
j = -j;
ans += j * p3[n - i];
if (j == 1)
k = 2 - k;
}
k = p3[n] - ans - 1;
if (ans > k)
ans = k;
if (ans > m)
ans = -1;
printf("%d\n", ans);
}
return 0;
}
|
// AOJ 0503: Cup
// 2017.10.29 bal4u@uu
#include <stdio.h>
#include <stdlib.h>
int c[16];
int main() {
int n, m, i, j, k, ans;
int p3[16];
for (p3[0] = 1, i = 1; i < 16; i++)
p3[i] = 3 * p3[i - 1];
while (scanf("%d%d", &n, &m) && n > 0) {
for (i = 0; i < 3; i++) {
scanf("%d", &j);
while (j-- > 0)
scanf("%d", &k), c[k - 1] = i;
}
ans = k = 0;
for (i = 0; i < n; i++) {
j = c[i] - k;
if (j < 0)
j = -j;
ans += j * p3[n - i - 1];
if (j == 1)
k = 2 - k;
}
k = p3[n] - ans - 1;
if (ans > k)
ans = k;
if (ans > m)
ans = -1;
printf("%d\n", ans);
}
return 0;
}
|
[["+", 0, 34, 12, 11, 31, 69, 71, 16, 17, 33], ["+", 0, 34, 12, 11, 31, 69, 71, 16, 12, 13], ["+", 0, 11, 12, 16, 12, 69, 71, 16, 17, 33], ["+", 0, 11, 12, 16, 12, 69, 71, 16, 12, 13]]
| 0
| 249
|
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int pow3[16], c[16];
int n, m, i, j, k, d, x, y, p;
pow3[0] = 1;
for (i = 1; i <= 15; ++i) {
pow3[i] = pow3[i - 1] * 3;
}
while (scanf("%d%d", &n, &m), n) {
for (i = 0; i < 3; ++i) {
for (scanf("%d", &j); j > 0; --j) {
scanf("%d", &k);
c[n - k] = i;
}
}
p = 0;
x = 0;
for (i = n - 1; i >= 0; --i) {
d = abs(p - c[i]);
x += pow3[i] * d;
if (d == 1) {
p = 2 - p;
}
}
y = pow3[n] - 1 - x;
if (x > y) {
x = k;
}
printf("%d\n", x > m ? -1 : x);
}
return 0;
}
|
#include <stdio.h>
#include <stdlib.h>
int main(void) {
int pow3[16], c[16];
int n, m, i, j, k, d, x, y, p;
pow3[0] = 1;
for (i = 1; i <= 15; ++i) {
pow3[i] = pow3[i - 1] * 3;
}
while (scanf("%d%d", &n, &m), n) {
for (i = 0; i < 3; ++i) {
for (scanf("%d", &j); j > 0; --j) {
scanf("%d", &k);
c[n - k] = i;
}
}
p = 0;
x = 0;
for (i = n - 1; i >= 0; --i) {
d = abs(p - c[i]);
x += pow3[i] * d;
if (d == 1) {
p = 2 - p;
}
}
y = pow3[n] - 1 - x;
if (x > y) {
x = y;
}
printf("%d\n", x > m ? -1 : x);
}
return 0;
}
|
[["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]]
| 0
| 253
|
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#define INF 15
#define A 0
#define B 1
#define C 2
char cond[INF];
char n;
int m;
int sum;
void move(int pos, char dist) {
char now = cond[pos];
if (now == dist) {
return;
} else if (abs(now - dist) == 2) {
move(pos, B);
move(pos, dist);
} else {
int i;
char no_present = (dist + now == 1) ? C : (dist + now == 2) ? B : A;
for (i = 1; pos + i < n; i++) {
if (cond[pos + i] == dist || cond[pos + i] == now) {
move(pos + i, no_present);
}
}
cond[pos] = dist;
sum += 1;
}
return;
}
int main() {
while (1) {
int i;
char dist;
scanf("%d %d", &n, &m);
if (n == 0 && m == 0) {
break;
}
for (i = 0; i < 3; i++) {
int j, k;
scanf("%d", &k);
for (j = 0; j < k; j++) {
int tmp;
scanf("%d", &tmp);
cond[tmp - 1] = i;
}
}
dist = (cond[0] != B) ? cond[0] : A;
for (i = 0; i < n; i++) {
move(i, dist);
}
if (sum <= m) {
printf("%d\n", sum);
} else {
printf("-1\n");
}
}
}
|
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#define INF 15
#define A 0
#define B 1
#define C 2
char cond[INF];
char n;
int m;
int sum;
void move(int pos, char dist) {
char now = cond[pos];
if (now == dist) {
return;
} else if (abs(now - dist) == 2) {
move(pos, B);
move(pos, dist);
} else {
int i;
char no_present = (dist + now == 1) ? C : (dist + now == 2) ? B : A;
for (i = 1; pos + i < n; i++) {
if (cond[pos + i] == dist || cond[pos + i] == now) {
move(pos + i, no_present);
}
}
cond[pos] = dist;
sum += 1;
}
return;
}
int main() {
while (1) {
int i;
char dist;
sum = 0;
scanf("%d %d", &n, &m);
if (n == 0 && m == 0) {
break;
}
for (i = 0; i < 3; i++) {
int j, k;
scanf("%d", &k);
for (j = 0; j < k; j++) {
int tmp;
scanf("%d", &tmp);
cond[tmp - 1] = i;
}
}
dist = (cond[0] != B) ? cond[0] : A;
for (i = 0; i < n; i++) {
move(i, dist);
}
if (sum <= m) {
printf("%d\n", sum);
} else {
printf("-1\n");
}
}
}
|
[["+", 0, 52, 8, 9, 0, 1, 0, 11, 31, 22], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 17, 32], ["+", 0, 52, 8, 9, 0, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35]]
| 1
| 363
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> T;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(), (x).end())
#define all(x) (x).begin(), (x).end()
#define EQ(a, b) (abs((a) - (b)) < EPS)
int a, b, c, d, n, r;
int le, ri, up, down;
int area, len;
vector<T> vec;
map<P, int> m;
map<P, int>::iterator it;
int imos[2][10004];
int main() {
while (1) {
memset(imos, 0, sizeof(imos));
area = 0;
len = 0;
le = down = INF;
ri = up = 1;
m.clear();
scanf("%d %d", &n, &r);
if (n == 0 && r == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d %d %d %d", &a, &b, &c, &d);
a++;
b++;
c++;
d++;
ri = max(ri, c);
le = min(le, a);
up = max(up, d);
down = min(down, b);
m[P(a, b)]++;
m[P(a, d)]--;
m[P(c, b)]--;
m[P(c, d)]++;
}
vec.pb(T(P(INF, INF), INF));
SORT(vec);
int index = 0;
for (int i = le; i <= ri + 1; i++) {
for (int j = down; j <= up + 1; j++) {
imos[i % 2][j] = imos[i % 2][j - 1];
it = m.find(P(i, j));
if (it != m.end())
imos[i % 2][j] += (*it).sec;
}
for (int j = down; j <= up + 1; j++) {
imos[i % 2][j] += imos[(i - 1) % 2][j];
if (imos[i % 2][j] > 0)
area++;
if (!!imos[i % 2][j - 1] != !!imos[i % 2][j])
len++;
if (!!imos[(i - 1) % 2][j] != !!imos[i % 2][j])
len++;
}
cout << endl;
}
cout << area << endl;
if (r == 2)
cout << len << endl;
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> T;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#define SORT(x) sort((x).begin(), (x).end())
#define all(x) (x).begin(), (x).end()
#define EQ(a, b) (abs((a) - (b)) < EPS)
int a, b, c, d, n, r;
int le, ri, up, down;
int area, len;
vector<T> vec;
map<P, int> m;
map<P, int>::iterator it;
int imos[2][10004];
int main() {
while (1) {
memset(imos, 0, sizeof(imos));
area = 0;
len = 0;
le = down = INF;
ri = up = 1;
m.clear();
scanf("%d %d", &n, &r);
if (n == 0 && r == 0)
break;
for (int i = 0; i < n; i++) {
scanf("%d %d %d %d", &a, &b, &c, &d);
a++;
b++;
c++;
d++;
ri = max(ri, c);
le = min(le, a);
up = max(up, d);
down = min(down, b);
m[P(a, b)]++;
m[P(a, d)]--;
m[P(c, b)]--;
m[P(c, d)]++;
}
vec.pb(T(P(INF, INF), INF));
SORT(vec);
int index = 0;
for (int i = le; i <= ri + 1; i++) {
for (int j = down; j <= up + 1; j++) {
imos[i % 2][j] = imos[i % 2][j - 1];
it = m.find(P(i, j));
if (it != m.end())
imos[i % 2][j] += (*it).sec;
}
for (int j = down; j <= up + 1; j++) {
imos[i % 2][j] += imos[(i - 1) % 2][j];
if (imos[i % 2][j] > 0)
area++;
if (!!imos[i % 2][j - 1] != !!imos[i % 2][j])
len++;
if (!!imos[(i - 1) % 2][j] != !!imos[i % 2][j])
len++;
}
}
cout << area << endl;
if (r == 2)
cout << len << endl;
}
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 17, 151], ["-", 0, 7, 8, 9, 0, 1, 0, 16, 12, 22], ["-", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35]]
| 1
| 654
|
#include <stdio.h>
int main(void) {
int Ascore[4], Bscore[4], i;
for (i = 0; i < 4; i++)
scanf("%d", &Ascore[i]);
for (i = 0; i < 4; i++)
scanf("%d", &Bscore[i]);
Ascore[4] = Ascore[0] + Ascore[1] + Ascore[2] + Ascore[3];
Bscore[4] = Bscore[0] + Bscore[1] + Bscore[2] + Bscore[3];
if (Ascore[4] > Bscore[4])
printf("%d\n", Ascore[4]);
else
printf("%d\n", Bscore[4]);
return 0;
}
|
#include <stdio.h>
int main(void) {
int Ascore[5], Bscore[5], i;
for (i = 0; i < 4; i++)
scanf("%d", &Ascore[i]);
for (i = 0; i < 4; i++)
scanf("%d", &Bscore[i]);
Ascore[4] = Ascore[0] + Ascore[1] + Ascore[2] + Ascore[3];
Bscore[4] = Bscore[0] + Bscore[1] + Bscore[2] + Bscore[3];
if (Ascore[4] > Bscore[4])
printf("%d\n", Ascore[4]);
else
printf("%d\n", Bscore[4]);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]]
| 0
| 166
|
#include <stdio.h>
int main() {
int aj, am, as, ae, bj, bm, bs, be, S, T;
scanf("%d %d %d %d", &aj, &am, &as, &ae);
scanf("%d %d %d %d", &bj, &bm, &bs, &be);
S = aj + am + as + ae;
T = bj + bm + bs + be;
if (T = S) {
printf("%d\n", S);
} else if (T > S) {
printf("%d\n", T);
} else if (T < S) {
printf("%d\n", S);
}
return 0;
}
|
#include <stdio.h>
int main() {
int aj, am, as, ae, bj, bm, bs, be, S, T;
scanf("%d %d %d %d", &aj, &am, &as, &ae);
scanf("%d %d %d %d", &bj, &bm, &bs, &be);
S = aj + am + as + ae;
T = bj + bm + bs + be;
if (T == S) {
printf("%d\n", S);
} else if (T > S) {
printf("%d\n", T);
} else if (T < S) {
printf("%d\n", S);
}
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 23, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60]]
| 0
| 146
|
#include <stdio.h>
int main() {
int a, b, c, d, e, f, g, h;
int S, T;
scanf("%d %d %d %d\n %d %d %d %d", &a, &b, &c, &d, &e, &f, &g, &h);
S = a + b + c + d;
T = e + f + g + h;
if (S < T) {
printf("%d\n", T);
} else if (S > T)
printf("%d\n", S);
else if (S == T)
printf("%d(=%d\n", S, T);
return (0);
}
|
#include <stdio.h>
int main() {
int a, b, c, d, e, f, g, h;
int S, T;
scanf("%d %d %d %d\n %d %d %d %d", &a, &b, &c, &d, &e, &f, &g, &h);
S = a + b + c + d;
T = e + f + g + h;
if (S < T) {
printf("%d\n", T);
} else if (S > T)
printf("%d\n", S);
else if (S == T)
printf("%d\n", T);
return (0);
}
|
[["-", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 64, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 57, 64, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 57, 64, 1, 0, 2, 3, 4, 0, 22]]
| 0
| 142
|
#include <stdio.h>
int main() {
int a[4], i, at = 0, bt = 0;
for (i = 0; i < 3; i++) {
scanf("%d", &a[i]);
at += a[i];
}
for (i = 0; i < 3; i++) {
scanf("%d", &a[i]);
bt += a[i];
}
if (at < bt) {
printf("%d\n", bt);
} else {
printf("%d\n", at);
}
return (0);
}
|
#include <stdio.h>
int main() {
int a[4], i, at = 0, bt = 0;
for (i = 0; i < 4; i++) {
scanf("%d", &a[i]);
at += a[i];
}
for (i = 0; i < 4; i++) {
scanf("%d", &a[i]);
bt += a[i];
}
if (at < bt) {
printf("%d\n", bt);
} else {
printf("%d\n", at);
}
return (0);
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 130
|
#include <stdio.h>
int main() {
int sa, sb, sc, sd;
int ta, tb, tc, td;
int sums, sumt;
scanf("%d %d %d %d", &sa, &sb, &sc, &sd);
scanf("%d %d %d %d", &ta, &tb, &tc, &tb);
sums = sa + sb + sc + sd;
sumt = ta + tb + tc + td;
if (sums >= sumt)
printf("%d\n", sums);
else
printf("%d\n", sumt);
return 0;
}
|
#include <stdio.h>
int main() {
int sa, sb, sc, sd;
int ta, tb, tc, td;
int sums, sumt;
scanf("%d %d %d %d", &sa, &sb, &sc, &sd);
scanf("%d %d %d %d", &ta, &tb, &tc, &td);
sums = sa + sb + sc + sd;
sumt = ta + tb + tc + td;
if (sums >= sumt)
printf("%d\n", sums);
else {
printf("%d\n", sumt);
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 0, 1, 0, 2, 3, 4, 0, 66, 28, 22], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 45], ["+", 8, 9, 0, 57, 75, 76, 0, 9, 0, 46]]
| 0
| 119
|
#include <stdio.h>
int main(void) {
int a1, a2, a3, a4;
int b1, b2, b3, b4;
int s, t;
scanf("%d %d %d %d", &a1, &a2, &a3, &a4);
scanf("%d %d %d %d", &b1, &b2, &b3, &b4);
s = a1 + a2 + a3 + a4;
t = b1;
b2;
b3;
b4;
printf("%d\n", (s > t) ? s : t);
return 0;
}
|
#include <stdio.h>
int main(void) {
int a1, a2, a3, a4;
int b1, b2, b3, b4;
int s, t;
scanf("%d %d %d %d", &a1, &a2, &a3, &a4);
scanf("%d %d %d %d", &b1, &b2, &b3, &b4);
s = a1 + a2 + a3 + a4;
t = b1 + b2 + b3 + b4;
printf("%d\n", (s > t) ? s : t);
return 0;
}
|
[["-", 0, 30, 0, 14, 8, 9, 0, 1, 0, 35], ["+", 0, 11, 12, 16, 31, 16, 31, 16, 17, 72], ["+", 0, 1, 0, 11, 12, 16, 31, 16, 17, 72], ["+", 8, 9, 0, 1, 0, 11, 12, 16, 17, 72]]
| 0
| 111
|
#include <stdio.h>
int main(void) {
int j, m, e, s;
int S = 0;
int T = 0;
scanf("%d %d %d %d", &j, &m, &e, &s);
S = j + m + e + s;
scanf("%d %d %d %d", &j, &m, &e, &s);
T = j + m + e + s;
if (S > T) {
printf("%d\n", S);
} else if (T < S) {
printf("%d\n", T);
} else {
printf("%d\n", S);
}
return (0);
}
|
#include <stdio.h>
int main(void) {
int j, m, e, s;
int S = 0;
int T = 0;
scanf("%d %d %d %d", &j, &m, &e, &s);
S = j + m + e + s;
scanf("%d %d %d %d", &j, &m, &e, &s);
T = j + m + e + s;
if (S > T) {
printf("%d\n", S);
} else if (T > S) {
printf("%d\n", T);
} else {
printf("%d\n", S);
}
return (0);
}
|
[["-", 75, 76, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 75, 76, 0, 57, 15, 23, 0, 16, 17, 47]]
| 0
| 141
|
#include <stdio.h>
int main(void) {
int a[4];
int b[4];
int s, t, i, j;
s = 0;
t = 0;
for (i = 0; i < 4; i++) {
scanf("%d", &a[i]);
s += a[i];
}
for (j = 0; j < 4; j++) {
scanf("%d", &b[i]);
t += b[j];
}
if (t == s) {
printf("%d\n", s);
} else if (t > s) {
printf("%d\n", t);
} else {
printf("%d\n", s);
}
return (0);
}
|
#include <stdio.h>
int main(void) {
int a[4];
int b[4];
int s, t, i, j;
s = 0;
t = 0;
for (i = 0; i < 4; i++) {
scanf("%d", &a[i]);
s += a[i];
}
for (j = 0; j < 4; j++) {
scanf("%d", &b[j]);
t += b[j];
}
if (t == s) {
printf("%d\n", s);
} else if (t > s) {
printf("%d\n", t);
} else {
printf("%d\n", s);
}
return (0);
}
|
[["-", 0, 2, 3, 4, 0, 66, 28, 69, 71, 22], ["+", 0, 2, 3, 4, 0, 66, 28, 69, 71, 22]]
| 0
| 163
|
#include <stdio.h>
int main(void) {
int z1, m1, s1, e1, z2, m2, s2, e2, s, t;
scanf("%d %d %d %d", &z1, &m1, &s1, &e1);
scanf("%d %d %d %d", &z2, &m2, &s2, &e2);
s = z1 + m1 + s1 + e1;
t = z2 + m2 + s2 + e2;
if (s > t) {
printf("%d\n", s);
} else if (s < t) {
printf("%d\n", t);
} else {
printf("%d=%d\n", s, t);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
int z1, m1, s1, e1, z2, m2, s2, e2, s, t;
scanf("%d %d %d %d", &z1, &m1, &s1, &e1);
scanf("%d %d %d %d", &z2, &m2, &s2, &e2);
s = z1 + m1 + s1 + e1;
t = z2 + m2 + s2 + e2;
if (s > t) {
printf("%d\n", s);
} else if (s < t) {
printf("%d\n", t);
} else {
printf("%d\n", s);
}
return 0;
}
|
[["-", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 6], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22]]
| 0
| 143
|
#include <stdio.h>
int main() {
int a = 0, b = 0, i, x;
for (i = 0; i < a; i++) {
scanf("%d", &x);
a += x;
}
for (i = 0; i < a; i++) {
scanf("%d", &x);
b += x;
}
if (a > b)
printf("%d\n", a);
else
printf("%d\n", b);
return 0;
}
|
#include <stdio.h>
int main() {
int a = 0, b = 0, i, x;
for (i = 0; i < 4; i++) {
scanf("%d", &x);
a += x;
}
for (i = 0; i < 4; i++) {
scanf("%d", &x);
b += x;
}
if (a > b)
printf("%d\n", a);
else
printf("%d\n", b);
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 22], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 0
| 109
|
#include <stdio.h>
int main(void) {
int a, b, c, d, x, y, e, f, g, h;
scanf("%d %d %d %d", &a, &b, &c, &d);
x = 0;
x += a;
x += b;
x += c;
x += d;
scanf("%d %d %d %d", &e, &f, &g, &h);
y = 0;
y += e;
y += f;
y += g;
y += h;
if (x > y)
putc("%d\n", x);
else
putc("%d\n", y);
return 0;
}
|
#include <stdio.h>
int main(void) {
int a, b, c, d, x, y, e, f, g, h;
scanf("%d %d %d %d", &a, &b, &c, &d);
x = 0;
x += a;
x += b;
x += c;
x += d;
scanf("%d %d %d %d", &e, &f, &g, &h);
y = 0;
y += e;
y += f;
y += g;
y += h;
if (x > y)
printf("%d\n", x);
else
printf("%d\n", y);
return 0;
}
|
[["-", 8, 9, 0, 57, 64, 1, 0, 2, 63, 22], ["+", 8, 9, 0, 57, 64, 1, 0, 2, 63, 22], ["-", 0, 57, 75, 76, 0, 1, 0, 2, 63, 22], ["+", 0, 57, 75, 76, 0, 1, 0, 2, 63, 22]]
| 0
| 138
|
s, t;
main(x, i) {
for (; ~scanf("%d", &x); i++ < 4 ? s += x : (t += x))
;
s = !printf("%d\n", s > t ? s : t);
}
|
s, t, i;
main(x) {
for (; ~scanf("%d", &x); i++ < 4 ? s += x : (t += x))
;
s = !printf("%d\n", s > t ? s : t);
}
|
[["+", 36, 36, 36, 36, 0, 30, 0, 43, 0, 21], ["+", 36, 36, 36, 36, 0, 30, 0, 43, 49, 22], ["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 21], ["-", 0, 30, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 0, 1, 0, 2, 3, 4, 0, 25, 0, 35]]
| 0
| 62
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string str;
while (cin >> str) {
for (int i = 0; i < str.length(); i++) {
str[i] = (str[i] - 'A' + 3) % 26 + 'A';
}
cout << str << endl;
}
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string str;
while (cin >> str) {
for (int i = 0; i < str.length(); i++) {
str[i] = (str[i] - 'A' + 23) % 26 + 'A';
}
cout << str << endl;
}
return 0;
}
|
[["-", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["+", 12, 16, 31, 16, 31, 23, 0, 16, 12, 13]]
| 1
| 78
|
#include <stdio.h>
int main(void) {
char a[10000], i;
while (scanf("%s", a) != EOF) {
for (i = 0; a[i]; i++) {
a[i] = a[i] - 3;
if (a[i] < 'D') {
a[i] = a[i] + 26;
}
}
printf("%s\n", a);
}
return 0;
}
|
#include <stdio.h>
int main(void) {
char a[10000], i;
while (scanf("%s", a) != EOF) {
for (i = 0; a[i]; i++) {
a[i] = a[i] - 3;
if (a[i] < 'A') {
a[i] = a[i] + 26;
}
}
printf("%s\n", a);
}
return 0;
}
|
[["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125]]
| 1
| 98
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 0; i < str.size(); i++) {
if (str[i] >= 'X') {
str[i] = str[i] - 23;
} else {
str[i] = str[i] + 3;
}
}
cout << str << endl;
return 0;
}
|
#include <algorithm>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 0; i < str.size(); i++) {
if (str[i] <= 'C') {
str[i] = str[i] + 23;
} else {
str[i] = str[i] - 3;
}
}
cout << str << endl;
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["-", 64, 9, 0, 1, 0, 11, 12, 16, 17, 33], ["+", 64, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["-", 0, 9, 0, 1, 0, 11, 12, 16, 17, 72], ["+", 0, 9, 0, 1, 0, 11, 12, 16, 17, 33]]
| 1
| 122
|
#include <iostream>
using namespace std;
int main() {
char ch;
while (cin >> ch)
cout << char((ch + 10) % 26 + 'A') << endl;
}
|
#include <iostream>
using namespace std;
int main() {
char ch;
while (cin >> ch)
cout << char((ch + 10) % 26 + 'A');
cout << endl;
}
|
[["+", 0, 14, 8, 9, 0, 52, 8, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22]]
| 1
| 40
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string in, out;
string sample = "abcdefghijklmnopqrstuvwxyzabc";
cin >> in;
for (int i = 0; i < in.size(); i++) {
for (int j = 0; j < 26; j++) {
if (in[i] == sample[j + 3]) {
cout << sample[j];
}
}
}
cout << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string in, out;
string sample = "ABCDEFGHIJKLMNOPQRSTUVWXYZABC";
cin >> in;
for (int i = 0; i < in.size(); i++) {
for (int j = 0; j < 26; j++) {
if (in[i] == sample[j + 3]) {
cout << sample[j];
}
}
}
cout << endl;
return 0;
}
|
[["-", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6], ["+", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6]]
| 1
| 96
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(), in.end()
const double PI = acos(-1);
const double EPS = 1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
string s;
cin >> s;
rep(i, s.size()) {
s[i] += 3;
if (s[i] > 'Z')
s[i] -= 26;
}
cout << s << endl;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(), in.end()
const double PI = acos(-1);
const double EPS = 1e-10;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
string s;
cin >> s;
rep(i, s.size()) {
s[i] -= 3;
if (s[i] < 'A')
s[i] += 26;
}
cout << s << endl;
}
|
[["-", 8, 9, 0, 9, 0, 1, 0, 11, 17, 107], ["+", 8, 9, 0, 9, 0, 1, 0, 11, 17, 110], ["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["-", 0, 9, 0, 57, 64, 1, 0, 11, 17, 110], ["+", 0, 9, 0, 57, 64, 1, 0, 11, 17, 107]]
| 1
| 140
|
#include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
for (int i = 0; i < s.size(); ++i) {
s[i] -= 3;
if (s[i] <= 'A')
s[i] += 26;
}
std::cout << s << std::endl;
return 0;
}
|
#include <iostream>
#include <string>
int main() {
std::string s;
std::cin >> s;
for (int i = 0; i < s.size(); ++i) {
s[i] -= 3;
if (s[i] < 'A')
s[i] += 26;
}
std::cout << s << std::endl;
return 0;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18]]
| 1
| 79
|
#include <iostream>
using namespace std;
char ans(char t) {
if (t == 'G') {
return 'D';
}
if (t == 'H') {
return 'E';
}
if (t == 'I') {
return 'F';
}
if (t == 'J') {
return 'G';
}
if (t == 'K') {
return 'H';
}
if (t == 'L') {
return 'I';
}
if (t == 'N') {
return 'J';
}
if (t == 'M') {
return 'K';
}
if (t == 'O') {
return 'L';
}
if (t == 'P') {
return 'M';
}
if (t == 'Q') {
return 'N';
}
if (t == 'R') {
return 'O';
}
if (t == 'S') {
return 'P';
}
if (t == 'T') {
return 'Q';
}
if (t == 'U') {
return 'R';
}
if (t == 'V') {
return 'S';
}
if (t == 'W') {
return 'T';
}
if (t == 'X') {
return 'U';
}
if (t == 'Y') {
return 'V';
}
if (t == 'Z') {
return 'W';
}
if (t == 'A') {
return 'X';
}
if (t == 'B') {
return 'Y';
}
if (t == 'C') {
return 'Z';
}
if (t == 'D') {
return 'A';
}
if (t == 'E') {
return 'B';
}
if (t == 'F') {
return 'C';
}
}
int main() {
char a[1000];
int i = 0;
while (cin >> a[i]) {
i++;
}
for (int j = 0; j < i; j++) {
cout << ans(a[j]);
}
cout << endl;
return 0;
}
|
#include <iostream>
using namespace std;
char ans(char t) {
if (t == 'G') {
return 'D';
}
if (t == 'H') {
return 'E';
}
if (t == 'I') {
return 'F';
}
if (t == 'J') {
return 'G';
}
if (t == 'K') {
return 'H';
}
if (t == 'L') {
return 'I';
}
if (t == 'M') {
return 'J';
}
if (t == 'N') {
return 'K';
}
if (t == 'O') {
return 'L';
}
if (t == 'P') {
return 'M';
}
if (t == 'Q') {
return 'N';
}
if (t == 'R') {
return 'O';
}
if (t == 'S') {
return 'P';
}
if (t == 'T') {
return 'Q';
}
if (t == 'U') {
return 'R';
}
if (t == 'V') {
return 'S';
}
if (t == 'W') {
return 'T';
}
if (t == 'X') {
return 'U';
}
if (t == 'Y') {
return 'V';
}
if (t == 'Z') {
return 'W';
}
if (t == 'A') {
return 'X';
}
if (t == 'B') {
return 'Y';
}
if (t == 'C') {
return 'Z';
}
if (t == 'D') {
return 'A';
}
if (t == 'E') {
return 'B';
}
if (t == 'F') {
return 'C';
}
}
int main() {
char a[1000];
int i = 0;
while (cin >> a[i]) {
i++;
}
for (int j = 0; j < i; j++) {
cout << ans(a[j]);
}
cout << endl;
return 0;
}
|
[["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125]]
| 1
| 468
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 0; i < str.size(); i++) {
str[i] += 3;
if (str[i] > 'Z') {
str[i] -= 26;
}
}
cout << str << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
string str;
cin >> str;
for (int i = 0; i < str.size(); i++) {
str[i] -= 3;
if (str[i] < 'A') {
str[i] += 26;
}
}
cout << str << endl;
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 110], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 110], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107]]
| 1
| 83
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
char mozi[1003] = {0};
scanf("%s", mozi);
for (int i = 0; i < 1000; i++) {
if (mozi[i] == 0)
break;
mozi[i] += 3;
if (mozi[i] >= 88)
mozi[i] -= 26;
printf("%c", mozi[i]);
}
printf("\n");
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
char mozi[1003] = {0};
scanf("%s", mozi);
for (int i = 0; i < 1000; i++) {
if (mozi[i] == 0)
break;
mozi[i] -= 3;
if (mozi[i] < 65)
mozi[i] += 26;
printf("%c", mozi[i]);
}
printf("\n");
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 110], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 17, 110], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 107]]
| 1
| 111
|
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
char s[1002];
scanf("%s", s);
for (int i = 0; i < strlen(s); i++) {
if (s[i] <= 'C')
s[i] += 26;
printf("%c", &s[i] - 3);
}
printf("\n");
}
|
#include <cstdio>
#include <cstring>
using namespace std;
int main() {
char s[1002];
scanf("%s", s);
for (int i = 0; i < strlen(s); i++) {
if (s[i] <= 'C')
s[i] += 26;
printf("%c", s[i] - 3);
}
printf("\n");
}
|
[["-", 0, 2, 3, 4, 0, 16, 31, 66, 17, 67]]
| 1
| 88
|
#include <stdio.h>
#include <string.h>
int main() {
char str[1001];
int i;
scanf("%s", str);
for (i = 0; i < strlen(str); i++) {
str[i] += 3;
if (str[i] > 122)
str[i] -= 122;
}
printf("%s\n", str);
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main() {
char str[1001];
int i;
scanf("%s", str);
for (i = 0; i < strlen(str); i++) {
str[i] -= 3;
if (str[i] < 65)
str[i] += 26;
}
printf("%s\n", str);
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 110], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 17, 110], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 107], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 12, 13]]
| 1
| 82
|
#include <iostream>
#include <string.h>
using namespace std;
int main(void) {
char a[26] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I',
'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R',
'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
char b[1000];
int c[1000], i, n, s, kazu;
cin >> b;
for (i = 0; i < 1000; i++) {
c[i] = 0;
}
kazu = strlen(b);
n = 0;
for (i = 0; i < kazu; i++) {
for (s = 0; s < 26; s++) {
if (b[i] == a[s]) {
if (s - 3 < 0) {
c[n] = s + 23;
n++;
} else {
c[n] = s - 3;
n++;
}
}
}
}
for (i = 0; i < kazu; i++) {
cout << a[c[i]] << endl;
}
return 0;
}
|
#include <iostream>
#include <string.h>
using namespace std;
int main(void) {
char a[26] = {'A', 'B', 'C', 'D', 'E', 'F', 'G', 'H', 'I',
'J', 'K', 'L', 'M', 'N', 'O', 'P', 'Q', 'R',
'S', 'T', 'U', 'V', 'W', 'X', 'Y', 'Z'};
char b[1000];
int c[1000], i, n, s, kazu;
cin >> b;
for (i = 0; i < 1000; i++) {
c[i] = 0;
}
kazu = strlen(b);
n = 0;
for (i = 0; i < kazu; i++) {
for (s = 0; s < 26; s++) {
if (b[i] == a[s]) {
if (s - 3 < 0) {
c[n] = s + 23;
n++;
} else {
c[n] = s - 3;
n++;
}
}
}
}
for (i = 0; i < kazu; i++) {
cout << a[c[i]];
}
cout << endl;
return 0;
}
|
[["+", 8, 9, 0, 7, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 295
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
using namespace std;
typedef pair<int, int> pii;
#define MAX 99999999
int main() {
char s[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string hoge;
cin >> hoge;
rep(i, hoge.size()) {
if (hoge[i] <= 68)
cout << s[hoge[i] - 65 + 23];
else
cout << s[hoge[i] - 68];
}
cout << endl;
}
|
#include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define vi vector<int>
#define vvi vector<vector<int>>
#define ll long long int
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define vb vector<bool>
#define vc vector<char>
#define vs vector<string>
#define ld long double
#define INF 1e9
#define EPS 0.0000000001
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define CC puts("-------ok--------");
#define all(in) in.begin(), in.end()
using namespace std;
typedef pair<int, int> pii;
#define MAX 99999999
int main() {
char s[] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
string hoge;
cin >> hoge;
rep(i, hoge.size()) {
if (hoge[i] < 68)
cout << s[hoge[i] - 65 + 23];
else
cout << s[hoge[i] - 68];
}
cout << endl;
}
|
[["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 18]]
| 1
| 175
|
#include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string ss, kk;
cin >> ss;
for (int i = 0; i < ss.length(); i++) {
if (ss[i] >= 'A' && ss[i] <= 'W')
kk += (ss[i] + 3);
else
kk += (ss[i] - 23);
}
cout << kk << endl;
// while(1);
return 0;
}
|
#include <algorithm>
#include <cctype>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string ss, kk;
cin >> ss;
for (int i = 0; i < ss.length(); i++) {
if (ss[i] >= 'D' && ss[i] <= 'Z')
kk += (ss[i] - 3);
else
kk += (ss[i] + 23);
}
cout << kk << endl;
// while(1);
return 0;
}
|
[["-", 15, 339, 51, 16, 31, 16, 12, 103, 0, 125], ["+", 15, 339, 51, 16, 31, 16, 12, 103, 0, 125], ["-", 15, 339, 51, 16, 12, 16, 12, 103, 0, 125], ["+", 15, 339, 51, 16, 12, 16, 12, 103, 0, 125], ["-", 64, 1, 0, 11, 12, 23, 0, 16, 17, 72], ["+", 64, 1, 0, 11, 12, 23, 0, 16, 17, 33], ["-", 0, 1, 0, 11, 12, 23, 0, 16, 17, 33], ["+", 0, 1, 0, 11, 12, 23, 0, 16, 17, 72]]
| 1
| 118
|
#include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
s[i] += 3;
if (s[i] > 90) {
s[i] -= 26;
}
}
cout << s << endl;
}
|
#include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
s[i] -= 3;
if (s[i] < 65) {
s[i] += 26;
}
}
cout << s << endl;
}
|
[["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 110], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 110], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107]]
| 1
| 80
|
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
string S;
unsigned int n;
int main(void) {
getline(cin, S);
n = S.length();
for (int i = 0; i < n; i++) {
char c = S[i];
int n = ((c - 'A') + 3) % 26;
printf("%c", 'A' + n);
}
printf("\n");
}
|
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
string S;
unsigned int n;
int main(void) {
getline(cin, S);
n = S.length();
for (int i = 0; i < n; i++) {
char c = S[i];
int n = ((c - 'A') + 23) % 26;
printf("%c", 'A' + n);
}
printf("\n");
}
|
[["-", 49, 50, 51, 16, 31, 23, 0, 16, 12, 13], ["+", 49, 50, 51, 16, 31, 23, 0, 16, 12, 13]]
| 1
| 100
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] = 'A')
s[i] = 'X';
else if (s[i] = 'B')
s[i] = 'Y';
else if (s[i] = 'C')
s[i] = 'Z';
else
s[i] = s[i] - 3;
}
cout << s << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 'A')
s[i] = 'X';
else if (s[i] == 'B')
s[i] = 'Y';
else if (s[i] == 'C')
s[i] = 'Z';
else
s[i] = s[i] - 3;
}
cout << s << endl;
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 75, 76, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 75, 76, 0, 57, 15, 339, 51, 16, 17, 60]]
| 1
| 122
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string A;
getline(cin, A);
for (int i = 0; i < A.length(); i++) {
if (A[i] >= 'D' && A[i] <= 'Z') {
A[i] -= 3;
cout << A[i];
}
if (A[i] >= 'A' && A[i] <= 'C') {
A[i] += 23;
cout << A[i];
}
}
cout << "\n";
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string A;
getline(cin, A);
for (int i = 0; i < A.length(); i++) {
if (A[i] >= 'D' && A[i] <= 'Z') {
A[i] -= 3;
cout << A[i];
} else if (A[i] >= 'A' && A[i] <= 'C') {
A[i] += 23;
cout << A[i];
}
}
cout << "\n";
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]]
| 1
| 125
|
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
static const double EPS = 1e-5;
#define FOR(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
string line;
cin >> line;
REP(i, line.size()) { cout << (char)((line[i] - 3) % ('Z' - 'A' + 1) + 'A'); }
cout << endl;
return 0;
}
|
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long LL;
typedef pair<int, int> P;
static const double EPS = 1e-5;
#define FOR(i, k, n) for (int i = (k); i < (int)(n); ++i)
#define REP(i, n) FOR(i, 0, n)
int main(void) {
string line;
cin >> line;
REP(i, line.size()) {
cout << (char)((line[i] - 3 - 'A' + 26) % ('Z' - 'A' + 1) + 'A');
}
cout << endl;
return 0;
}
|
[["+", 31, 16, 31, 23, 0, 16, 31, 16, 17, 33], ["+", 31, 23, 0, 16, 31, 16, 12, 103, 0, 104], ["+", 31, 23, 0, 16, 31, 16, 12, 103, 0, 125], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 17, 72], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 12, 13]]
| 1
| 147
|
#include <stdio.h>
char *f(char *s) {
char *a = s;
for (; *s; s++)
*s = (*s - 42) % 26 + 65;
return a;
}
int main() {
char *s;
scanf("%s", s);
printf("%s\n", f(s));
}
|
#include <stdio.h>
char *f(char *s) {
char *a = s;
for (; *s; s++)
*s = (*s - 42) % 26 + 65;
return a;
}
int main() {
char s[1001];
scanf("%s", s);
printf("%s\n", f(s));
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 84, 0, 48], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 0, 70], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 0, 73]]
| 1
| 76
|
#include <cstdio>
int main() {
char str[1024];
scanf("%s", str);
char *ptr = str;
while (*ptr != '\0') {
if (*ptr <= 'W') {
*ptr += 3;
} else {
*ptr = 'A' + (*ptr - 'X');
}
ptr++;
}
printf("%s\n", str);
}
|
#include <cstdio>
int main() {
char str[1024];
scanf("%s", str);
char *ptr = str;
while (*ptr != '\0') {
if (*ptr >= 'D') {
*ptr -= 3;
} else {
*ptr = 'X' + (*ptr - 'A');
}
ptr++;
}
printf("%s\n", str);
}
|
[["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 20], ["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 110], ["-", 0, 1, 0, 11, 12, 16, 31, 103, 0, 125], ["+", 0, 1, 0, 11, 12, 16, 31, 103, 0, 125], ["-", 12, 16, 12, 23, 0, 16, 12, 103, 0, 125], ["+", 12, 16, 12, 23, 0, 16, 12, 103, 0, 125]]
| 1
| 88
|
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string str;
cin >> str;
int j = str.length();
for (int i = 0; i < j; i++) {
str[i] += 3;
if (str[i] > 'Z')
str[i] -= 'Z' - 'A' + 1;
}
cout << str << endl;
return 0;
}
|
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string str;
cin >> str;
int j = str.length();
for (int i = 0; i < j; i++) {
str[i] -= 3;
if (str[i] < 'A')
str[i] += 'Z' - 'A' + 1;
}
cout << str << endl;
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 110], ["-", 8, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["-", 8, 9, 0, 57, 64, 1, 0, 11, 17, 110], ["+", 8, 9, 0, 57, 64, 1, 0, 11, 17, 107]]
| 1
| 89
|
#include <stdio.h>
#include <string.h>
int main() {
char c;
while (true) {
c = getchar();
if (c == EOF) {
break;
} else if (c == '\n') {
putchar('\n');
} else if (c >= 'A' && c <= 'Z') {
c += 3;
if (c > 'Z') {
c -= 26;
}
putchar(c);
}
}
return 0;
}
|
#include <stdio.h>
#include <string.h>
int main() {
char c;
while (true) {
c = getchar();
if (c == EOF) {
break;
} else if (c == '\n') {
putchar('\n');
} else if (c >= 'A' && c <= 'Z') {
c -= 3;
if (c < 'A') {
c += 26;
}
putchar(c);
}
}
return 0;
}
|
[["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 110], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 47], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 18], ["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["-", 0, 57, 64, 9, 0, 1, 0, 11, 17, 110], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 17, 107]]
| 1
| 96
|
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
char s[1000];
scanf("%s", s);
for (int i = 0; i < 1000; i++) {
if (s[i] == ' ')
continue;
if (s[i] == '\0')
break;
if ('A' == s[i])
s[i] = 'X';
else if ('B' == s[i])
s[i] = 'Y';
else if ('D' == s[i])
s[i] = 'Z';
else
s[i] -= 3;
}
printf("%s", s);
return 0;
}
|
#include <iostream>
#include <math.h>
#include <stdio.h>
using namespace std;
int main() {
char s[1000];
scanf("%s", s);
for (int i = 0; i < 1000; i++) {
if (s[i] == ' ')
continue;
if (s[i] == '\0')
break;
else if ('A' == s[i])
s[i] = 'X';
else if ('B' == s[i])
s[i] = 'Y';
else if ('C' == s[i])
s[i] = 'Z';
else
s[i] -= 3;
}
printf("%s\n", s);
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95], ["-", 0, 57, 15, 339, 51, 16, 31, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 31, 103, 0, 125], ["+", 0, 1, 0, 2, 3, 4, 0, 5, 0, 44]]
| 1
| 155
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
cout << (char)((s[i] - 'A' + 26) % 26 + 'A');
}
cout << endl;
}
|
#include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
cout << (char)((s[i] - 'A' + 23) % 26 + 'A');
}
cout << endl;
}
|
[["-", 0, 16, 31, 16, 31, 23, 0, 16, 12, 13], ["+", 0, 16, 31, 16, 31, 23, 0, 16, 12, 13]]
| 1
| 71
|
#include <iostream>
using namespace std;
int main() {
char ch;
while (cin >> ch) {
cout << (char)(ch > 67 ? ch - 3 : ch + 23) << endl;
}
return 0;
}
|
#include <iostream>
using namespace std;
int main() {
char ch;
while (cin >> ch) {
cout << (char)(ch > 67 ? ch - 3 : ch + 23);
}
cout << endl;
return 0;
}
|
[["+", 8, 9, 0, 52, 8, 9, 0, 1, 0, 35], ["+", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46], ["+", 0, 14, 8, 9, 0, 1, 0, 16, 31, 22], ["-", 0, 14, 8, 9, 0, 52, 8, 9, 0, 46]]
| 1
| 47
|
#include <algorithm>
#include <cstdio>
#include <cwctype>
#include <fstream>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string in;
cin >> in;
string out;
out = in;
for (int i = 0; i < in.size(); i++) {
int x = in[i] - 'A';
x += 3;
x = (x > 25) ? x - 26 : x;
out[i] = x + 'A';
}
cout << out << endl;
return 0;
}
|
#include <algorithm>
#include <cstdio>
#include <cwctype>
#include <fstream>
#include <iostream>
#include <math.h>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
string in;
cin >> in;
string out;
out = in;
for (int i = 0; i < in.size(); i++) {
int x = in[i] - 'A';
x -= 3;
x = (x < 0) ? x + 26 : x;
out[i] = x + 'A';
}
cout << out << endl;
return 0;
}
|
[["-", 0, 7, 8, 9, 0, 1, 0, 11, 17, 107], ["+", 0, 7, 8, 9, 0, 1, 0, 11, 17, 110], ["-", 0, 11, 12, 41, 15, 23, 0, 16, 17, 47], ["-", 0, 11, 12, 41, 15, 23, 0, 16, 12, 13], ["+", 0, 11, 12, 41, 15, 23, 0, 16, 17, 18], ["+", 0, 11, 12, 41, 15, 23, 0, 16, 12, 13], ["-", 0, 1, 0, 11, 12, 41, 64, 16, 17, 33], ["+", 0, 1, 0, 11, 12, 41, 64, 16, 17, 72]]
| 1
| 112
|
arr = [*"a".."z"]
puts gets.chomp.tr(arr.join(""), arr.rotate(-3).join(""))
|
arr = [*"A".."Z"]
puts gets.chomp.tr(arr.join(""), arr.rotate(-3).join(""))
|
[["-", 12, 516, 0, 741, 0, 475, 756, 557, 0, 6], ["+", 12, 516, 0, 741, 0, 475, 756, 557, 0, 6], ["-", 12, 516, 0, 741, 0, 475, 444, 557, 0, 6], ["+", 12, 516, 0, 741, 0, 475, 444, 557, 0, 6]]
| 4
| 41
|
before = ("D".."Z").to_a + ("A".."C").to_a
after = ("A".."Z").to_a
answer = ""
hash = Hash[*before.zip(after).flatten]
gets.chomp.chars {|c| answer += hash[c]}
p answer
|
before = ("D".."Z").to_a + ("A".."C").to_a
after = ("A".."Z").to_a
answer = ""
hash = Hash[*before.zip(after).flatten]
gets.chomp.chars {|c| answer += hash[c]}
puts answer
|
[["-", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22], ["+", 36, 36, 36, 36, 0, 493, 0, 652, 735, 22]]
| 4
| 74
|
import java.util.Scanner;
public class Main {
static int n = 0;
static Integer[] cardSet = null;
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
n = stdIn.nextInt();
cardSet = new Integer[2 * n];
for (int i = 0; i < n * 2; i++) {
cardSet[i] = i + 1;
}
int m = stdIn.nextInt();
for (int i = 0; i < m; i++) {
int shuffle = stdIn.nextInt();
if (shuffle != 0) {
hinduShuffle(shuffle);
} else {
riffleShuffle();
}
}
for (int i = 0; i < cardSet.length; i++) {
System.out.println(cardSet[i]);
}
}
//++++++++++++++++++++++++++++++++++++++++++++++++++++
//ヒンズーシャッフル
//++++++++++++++++++++++++++++++++++++++++++++++++++++
public static void hinduShuffle(int shufflePosition) {
Integer[] cardSetCopy = (Integer[])cardSet.clone();
int i = 0;
for (; i < cardSet.length - shufflePosition; i++) {
cardSet[i] = cardSetCopy[i + shufflePosition];
}
for (int j = 0; j < shufflePosition; j++, i++) {
cardSet[i] = cardSetCopy[j];
}
}
//++++++++++++++++++++++++++++++++++++++++++++++++++++
//リフルシャッフル
//++++++++++++++++++++++++++++++++++++++++++++++++++++
public static void riffleShuffle() {
Integer[] cardSetCopy = (Integer[])cardSet.clone();
int x = 0;
for (int i = 2; i < cardSet.length; i += 2) {
cardSet[i] = cardSetCopy[x];
x++;
}
for (int i = 1; i < cardSet.length; i += 2) {
cardSet[i] = cardSetCopy[x];
x++;
}
}
}
|
import java.util.Scanner;
public class Main {
static int n = 0;
static Integer[] cardSet = null;
public static void main(String[] args) {
Scanner stdIn = new Scanner(System.in);
n = stdIn.nextInt();
cardSet = new Integer[2 * n];
for (int i = 0; i < n * 2; i++) {
cardSet[i] = i + 1;
}
int m = stdIn.nextInt();
for (int i = 0; i < m; i++) {
int shuffle = stdIn.nextInt();
if (shuffle != 0) {
hinduShuffle(shuffle);
} else {
riffleShuffle();
}
}
for (int i = 0; i < cardSet.length; i++) {
System.out.println(cardSet[i]);
}
}
//++++++++++++++++++++++++++++++++++++++++++++++++++++
//ヒンズーシャッフル
//++++++++++++++++++++++++++++++++++++++++++++++++++++
public static void hinduShuffle(int shufflePosition) {
Integer[] cardSetCopy = (Integer[])cardSet.clone();
int i = 0;
for (; i < cardSet.length - shufflePosition; i++) {
cardSet[i] = cardSetCopy[i + shufflePosition];
}
for (int j = 0; j < shufflePosition; j++, i++) {
cardSet[i] = cardSetCopy[j];
}
}
//++++++++++++++++++++++++++++++++++++++++++++++++++++
//リフルシャッフル
//++++++++++++++++++++++++++++++++++++++++++++++++++++
public static void riffleShuffle() {
Integer[] cardSetCopy = (Integer[])cardSet.clone();
int x = 1;
for (int i = 2; i < cardSet.length; i += 2) {
cardSet[i] = cardSetCopy[x];
x++;
}
for (int i = 1; i < cardSet.length; i += 2) {
cardSet[i] = cardSetCopy[x];
x++;
}
}
}
|
[["-", 0, 195, 8, 196, 0, 503, 49, 200, 51, 499], ["+", 0, 195, 8, 196, 0, 503, 49, 200, 51, 499]]
| 3
| 365
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
typedef pair<int, int> P;
int swaP(P *a, P *b) {
P c;
c = *a;
*a = *b;
*b = c;
}
int bSort(P *start, P *end) {
int len = end - start;
for (int i = 0; i < len - 1; i++) {
for (int j = 0; j < len - 1; j++) {
if (start[j] > start[j + 1]) {
swap(start[j], start[j + 1]);
}
}
}
return 0;
}
int main(void) {
int n;
int ctrlNum;
int cmd;
P cards[256];
scanf("%d", &n);
for (int i = 0; i < 2 * n; i++) {
cards[i] = P(i, i + 1);
}
scanf("%d", &ctrlNum);
for (int i = 0; i < ctrlNum; i++) {
scanf("%d", &cmd);
switch (cmd) {
case 0:
for (int j = 0; j < 2 * n; j++) {
if (cards[j].first < n) {
cards[j].first *= 2;
} else if (cards[j].first >= n) {
cards[j].first -= n;
cards[j].first *= 2;
cards[j].first++;
}
}
break;
default:
for (int j = 0; j < 2 * n; j++) {
cards[j].first = ((cards[j].first + cmd) % (2 * n));
}
break;
}
}
bSort(cards, cards + 2 * n);
for (int i = 0; i < 2 * n; i++) {
printf("%d\n", cards[i].second);
}
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
typedef pair<int, int> P;
int swaP(P *a, P *b) {
P c;
c = *a;
*a = *b;
*b = c;
}
int bSort(P *start, P *end) {
int len = end - start;
for (int i = 0; i < len - 1; i++) {
for (int j = 0; j < len - 1; j++) {
if (start[j] > start[j + 1]) {
swap(start[j], start[j + 1]);
}
}
}
return 0;
}
int main(void) {
int n;
int ctrlNum;
int cmd;
P cards[256];
scanf("%d", &n);
for (int i = 0; i < 2 * n; i++) {
cards[i] = P(i, i + 1);
}
scanf("%d", &ctrlNum);
for (int i = 0; i < ctrlNum; i++) {
scanf("%d", &cmd);
switch (cmd) {
case 0:
for (int j = 0; j < 2 * n; j++) {
if (cards[j].first < n) {
cards[j].first *= 2;
} else if (cards[j].first >= n) {
cards[j].first -= n;
cards[j].first *= 2;
cards[j].first++;
}
}
break;
default:
for (int j = 0; j < 2 * n; j++) {
cards[j].first = ((cards[j].first + 2 * n - cmd) % (2 * n));
}
break;
}
}
bSort(cards, cards + 2 * n);
for (int i = 0; i < 2 * n; i++) {
printf("%d\n", cards[i].second);
}
return 0;
}
|
[["+", 31, 23, 0, 16, 31, 16, 12, 16, 31, 13], ["+", 31, 23, 0, 16, 31, 16, 12, 16, 17, 48], ["+", 31, 23, 0, 16, 31, 16, 12, 16, 12, 22], ["+", 12, 23, 0, 16, 31, 23, 0, 16, 17, 33]]
| 1
| 429
|
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
//#include <windows.h>
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
using namespace std;
typedef unsigned int uint;
typedef long long int llint;
typedef pair<llint, llint> pii;
#define mpq(T) priority_queue<T, vector<T>, greater<T>>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) for (int i = 0; i < (a); i++)
class BIT {
private:
int s;
llint *d;
public:
BIT(int size) {
s = size;
d = (llint *)malloc(sizeof(llint) * s);
for (int i = 0; i < s; i++) {
d[i] = 0;
}
}
void add(int b, int x) {
for (int i = b + 1; i <= s; i += (i & -i)) {
d[i - 1] += x;
}
}
llint sum(int b) {
llint all = 0;
for (int i = b + 1; i > 0; i -= (i & -i)) {
all += d[i - 1];
}
return all;
}
~BIT() { free(d); }
};
class unionfind {
private:
int s;
int *o;
int *r;
public:
unionfind(int dsize) {
s = dsize;
o = (int *)malloc(sizeof(int) * s);
r = (int *)malloc(sizeof(int) * s);
for (int i = 0; i < s; i++) {
o[i] = i;
r[i] = 0;
}
}
int mfind(int b) {
if (o[b] != b) {
o[b] = mfind(o[b]);
}
return o[b];
}
void munion(int a, int b) {
int aw = mfind(a);
int bw = mfind(b);
if (aw == bw) {
return;
}
if (r[aw] > r[bw]) {
o[bw] = a;
} else if (r[aw] < r[bw]) {
o[aw] = bw;
} else {
o[bw] = aw;
r[aw]++;
}
s--;
}
int size() { return s; }
~unionfind() {
free(o);
free(r);
}
};
template <class T> int lbound(T *d, T key, int s, int e) {
s--;
while (e - s > 1) {
int m = (s + e) / 2;
if (d[m] < key) {
s = m;
} else {
e = m;
}
}
return e;
}
template <class T> int ubound(T *d, T key, int s, int e) {
s--;
while (e - s > 1) {
int m = (s + e) / 2;
if (key < d[m]) {
e = m;
} else {
s = m;
}
}
return e;
}
class zpress {
private:
int ms;
pii *md;
int n;
int s;
llint *d;
int *t;
public:
zpress(int dsize = 1000000) {
int ms = dsize;
md = (pii *)malloc(sizeof(pii) * ms);
d = (llint *)malloc(sizeof(llint) * ms);
t = (int *)malloc(sizeof(int) * ms);
n = 0;
}
void in(llint x) {
in2(x, n);
n++;
}
void in2(llint x, int b) { md[b] = make_pair(x, b); }
void syori() { syori2(n); }
void syori2(int k) {
sort(md, md + k);
llint mae = LLONG_MIN;
s = 0;
REP(i, k) {
if (md[i].first != mae) {
d[s] = md[i].first;
s++;
mae = md[i].first;
}
t[md[i].second] = s - 1;
}
}
llint iti(int b) { return t[b]; }
int size() { return s; }
int first(llint x) { return lbound(d, x, 0, s); }
int end(llint x) {
return ubound(d, x, 0, s);
;
}
~zpress() {
free(md);
free(d);
free(t);
}
};
class xorshift {
private:
unsigned int a, b, c, d;
public:
xorshift(unsigned int aw = 123456789, unsigned int bw = 362436069,
unsigned int cw = 521288629, unsigned int dw = 88675123,
unsigned int e = 97) {
a = aw;
b = bw;
c = cw;
d = dw;
for (unsigned int i = 0; i < e; i++) {
operator()();
}
}
unsigned int operator()() {
unsigned int w = a ^ (a << 11);
a = b;
b = c;
c = d;
d = (d ^ (d >> 19)) ^ (w ^ (w >> 8));
return d;
}
};
llint gcd(llint a, llint b) {
while (1) {
llint w = a % b;
if (w == 0) {
return b;
}
a = b;
b = w;
}
}
llint sei(llint d, llint p) {
if (d < 0) {
d -= ((d + 1) / p - 1) * p;
} else {
d %= p;
}
return d;
}
llint inv(llint a, llint p) {
llint r0 = sei(a, p);
llint r1 = p;
llint a0 = 1;
llint b0 = 0;
llint a1 = 0;
llint b1 = 1;
while (1) {
llint q = r0 / r1;
llint w = r0 - q * r1;
if (w == 0) {
break;
}
r0 = r1;
r1 = w;
w = a0 - q * a1;
a0 = a1;
a1 = w;
}
return sei(a1, p);
}
template <llint P> class mod {
private:
llint d;
public:
mod(llint a = 0) {
d = a;
d = sei(d, P);
}
mod operator-() const { return mod(P - d); }
mod operator+=(const mod &a) {
d = d + a.d;
d = sei(d, P);
return *this;
}
mod operator-=(const mod &a) { return operator+=(-a); }
mod operator*=(const mod &a) {
d = d * a.d;
d = sei(d, P);
return *this;
}
mod operator/=(const mod &a) { return a * mod(inv(d, P)); }
mod operator+(const mod &a) const {
mod w = *this;
return (w += a);
}
mod operator-(const mod &a) const {
mod w = *this;
return (w -= a);
}
mod operator*(const mod &a) const {
mod w = *this;
return (w *= a);
}
mod operator/(const mod &a) const {
mod w = *this;
return (w /= a);
}
bool operator==(const mod &a) const { return (d == a.d); }
bool operator!=(const mod &a) const { return (d != a.d); }
operator llint() const { return d; }
};
/////////////////////////////////////////////////////
FILE *fi;
FILE *fo;
void err(char *a) {
printf("%s\n", a);
getchar();
}
llint in() {
llint w;
fscanf(fi, "%lld", &w);
return w;
}
void ins(char *a) { fscanf(fi, "%s", a); }
void out(llint a) { fprintf(fo, "%lld\n", a); }
void outs(char *a) { fprintf(fo, "%s\n", a); }
void func();
int main() {
fi = stdin;
fo = stdout;
func();
return 0;
}
int now[200];
int nex[200];
void func() {
int n = in();
int m = in();
REP(i, n * 2) { now[i] = i + 1; }
REP(k, m) {
int w = in();
if (w == 0) {
REP(i, n) {
nex[i * 2] = now[i];
nex[i * 2 + 1] = now[i + n];
}
} else {
int b = 0;
FOR(i, k, n * 2) {
nex[b] = now[i];
b++;
}
REP(i, k) {
nex[b] = now[i];
b++;
}
}
REP(i, n * 2) { now[i] = nex[i]; }
}
REP(i, n * 2) { out(now[i]); }
}
|
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
//#include <windows.h>
#include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <set>
using namespace std;
typedef unsigned int uint;
typedef long long int llint;
typedef pair<llint, llint> pii;
#define mpq(T) priority_queue<T, vector<T>, greater<T>>
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, a) for (int i = 0; i < (a); i++)
class BIT {
private:
int s;
llint *d;
public:
BIT(int size) {
s = size;
d = (llint *)malloc(sizeof(llint) * s);
for (int i = 0; i < s; i++) {
d[i] = 0;
}
}
void add(int b, int x) {
for (int i = b + 1; i <= s; i += (i & -i)) {
d[i - 1] += x;
}
}
llint sum(int b) {
llint all = 0;
for (int i = b + 1; i > 0; i -= (i & -i)) {
all += d[i - 1];
}
return all;
}
~BIT() { free(d); }
};
class unionfind {
private:
int s;
int *o;
int *r;
public:
unionfind(int dsize) {
s = dsize;
o = (int *)malloc(sizeof(int) * s);
r = (int *)malloc(sizeof(int) * s);
for (int i = 0; i < s; i++) {
o[i] = i;
r[i] = 0;
}
}
int mfind(int b) {
if (o[b] != b) {
o[b] = mfind(o[b]);
}
return o[b];
}
void munion(int a, int b) {
int aw = mfind(a);
int bw = mfind(b);
if (aw == bw) {
return;
}
if (r[aw] > r[bw]) {
o[bw] = a;
} else if (r[aw] < r[bw]) {
o[aw] = bw;
} else {
o[bw] = aw;
r[aw]++;
}
s--;
}
int size() { return s; }
~unionfind() {
free(o);
free(r);
}
};
template <class T> int lbound(T *d, T key, int s, int e) {
s--;
while (e - s > 1) {
int m = (s + e) / 2;
if (d[m] < key) {
s = m;
} else {
e = m;
}
}
return e;
}
template <class T> int ubound(T *d, T key, int s, int e) {
s--;
while (e - s > 1) {
int m = (s + e) / 2;
if (key < d[m]) {
e = m;
} else {
s = m;
}
}
return e;
}
class zpress {
private:
int ms;
pii *md;
int n;
int s;
llint *d;
int *t;
public:
zpress(int dsize = 1000000) {
int ms = dsize;
md = (pii *)malloc(sizeof(pii) * ms);
d = (llint *)malloc(sizeof(llint) * ms);
t = (int *)malloc(sizeof(int) * ms);
n = 0;
}
void in(llint x) {
in2(x, n);
n++;
}
void in2(llint x, int b) { md[b] = make_pair(x, b); }
void syori() { syori2(n); }
void syori2(int k) {
sort(md, md + k);
llint mae = LLONG_MIN;
s = 0;
REP(i, k) {
if (md[i].first != mae) {
d[s] = md[i].first;
s++;
mae = md[i].first;
}
t[md[i].second] = s - 1;
}
}
llint iti(int b) { return t[b]; }
int size() { return s; }
int first(llint x) { return lbound(d, x, 0, s); }
int end(llint x) {
return ubound(d, x, 0, s);
;
}
~zpress() {
free(md);
free(d);
free(t);
}
};
class xorshift {
private:
unsigned int a, b, c, d;
public:
xorshift(unsigned int aw = 123456789, unsigned int bw = 362436069,
unsigned int cw = 521288629, unsigned int dw = 88675123,
unsigned int e = 97) {
a = aw;
b = bw;
c = cw;
d = dw;
for (unsigned int i = 0; i < e; i++) {
operator()();
}
}
unsigned int operator()() {
unsigned int w = a ^ (a << 11);
a = b;
b = c;
c = d;
d = (d ^ (d >> 19)) ^ (w ^ (w >> 8));
return d;
}
};
llint gcd(llint a, llint b) {
while (1) {
llint w = a % b;
if (w == 0) {
return b;
}
a = b;
b = w;
}
}
llint sei(llint d, llint p) {
if (d < 0) {
d -= ((d + 1) / p - 1) * p;
} else {
d %= p;
}
return d;
}
llint inv(llint a, llint p) {
llint r0 = sei(a, p);
llint r1 = p;
llint a0 = 1;
llint b0 = 0;
llint a1 = 0;
llint b1 = 1;
while (1) {
llint q = r0 / r1;
llint w = r0 - q * r1;
if (w == 0) {
break;
}
r0 = r1;
r1 = w;
w = a0 - q * a1;
a0 = a1;
a1 = w;
}
return sei(a1, p);
}
template <llint P> class mod {
private:
llint d;
public:
mod(llint a = 0) {
d = a;
d = sei(d, P);
}
mod operator-() const { return mod(P - d); }
mod operator+=(const mod &a) {
d = d + a.d;
d = sei(d, P);
return *this;
}
mod operator-=(const mod &a) { return operator+=(-a); }
mod operator*=(const mod &a) {
d = d * a.d;
d = sei(d, P);
return *this;
}
mod operator/=(const mod &a) { return a * mod(inv(d, P)); }
mod operator+(const mod &a) const {
mod w = *this;
return (w += a);
}
mod operator-(const mod &a) const {
mod w = *this;
return (w -= a);
}
mod operator*(const mod &a) const {
mod w = *this;
return (w *= a);
}
mod operator/(const mod &a) const {
mod w = *this;
return (w /= a);
}
bool operator==(const mod &a) const { return (d == a.d); }
bool operator!=(const mod &a) const { return (d != a.d); }
operator llint() const { return d; }
};
/////////////////////////////////////////////////////
FILE *fi;
FILE *fo;
void err(char *a) {
printf("%s\n", a);
getchar();
}
llint in() {
llint w;
fscanf(fi, "%lld", &w);
return w;
}
void ins(char *a) { fscanf(fi, "%s", a); }
void out(llint a) { fprintf(fo, "%lld\n", a); }
void outs(char *a) { fprintf(fo, "%s\n", a); }
void func();
int main() {
fi = stdin;
fo = stdout;
func();
return 0;
}
int now[200];
int nex[200];
void func() {
int n = in();
int m = in();
REP(i, n * 2) { now[i] = i + 1; }
REP(k, m) {
int w = in();
if (w == 0) {
REP(i, n) {
nex[i * 2] = now[i];
nex[i * 2 + 1] = now[i + n];
}
} else {
int b = 0;
FOR(i, w, n * 2) {
nex[b] = now[i];
b++;
}
REP(i, w) {
nex[b] = now[i];
b++;
}
}
REP(i, n * 2) { now[i] = nex[i]; }
}
REP(i, n * 2) { out(now[i]); }
}
|
[["-", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["+", 0, 9, 0, 1, 0, 2, 3, 4, 0, 22], ["-", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78], ["+", 0, 14, 49, 53, 54, 55, 0, 56, 39, 78]]
| 1
| 1,967
|
#include "stdio.h"
int c[200];
int c2[200];
int main() {
int n;
scanf("%d", &n);
int m;
scanf("%d", &m);
for (int i = 0; i < 2 * n; i++) {
c[i] = i + 1;
}
for (int i = 0; i < m; i++) {
int w;
scanf("%d", &w);
if (w == 0) {
for (int i = 0; i < n; i++) {
c2[i * 2] = c[i];
c2[i * 2 + 1] = c[n + i];
}
} else {
int h = 0;
for (int i = w; i < 2 * n; i++) {
c2[h] = c[i];
h++;
}
for (int i = 0; i < w; i++) {
c2[h] = c[i];
}
}
for (int i = 0; i < 2 * n; i++) {
c[i] = c2[i];
}
}
for (int i = 0; i < 2 * n; i++) {
printf("%d\n", c[i]);
}
return 0;
}
|
#include "stdio.h"
int c[200];
int c2[200];
int main() {
int n;
scanf("%d", &n);
int m;
scanf("%d", &m);
for (int i = 0; i < 2 * n; i++) {
c[i] = i + 1;
}
for (int i = 0; i < m; i++) {
int w;
scanf("%d", &w);
if (w == 0) {
for (int i = 0; i < n; i++) {
c2[i * 2] = c[i];
c2[i * 2 + 1] = c[n + i];
}
} else {
int h = 0;
for (int i = w; i < 2 * n; i++) {
c2[h] = c[i];
h++;
}
for (int i = 0; i < w; i++) {
c2[h] = c[i];
h++;
}
}
for (int i = 0; i < 2 * n; i++) {
c[i] = c2[i];
}
}
for (int i = 0; i < 2 * n; i++) {
printf("%d\n", c[i]);
}
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 1, 0, 27, 28, 22], ["+", 0, 7, 8, 9, 0, 1, 0, 27, 17, 29], ["+", 0, 9, 0, 7, 8, 9, 0, 1, 0, 35]]
| 1
| 283
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> prev(N * 2);
for (int i = 0; i < N * 2; i++)
prev[i] = i + 1;
while (M--) {
int t;
cin >> t;
vector<int> next(N * 2);
if (t) {
for (int i = t; i < N * 2; i++)
next[i - t] = prev[i];
for (int i = 0; i < t; i++)
next[N * 2 - t] = prev[i];
prev = next;
} else {
for (int i = 0; i < N; i++) {
next[i * 2] = prev[i];
next[i * 2 + 1] = prev[i + N];
}
prev = next;
}
}
for (int i = 0; i < N * 2; i++)
cout << prev[i] << endl;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> prev(N * 2);
for (int i = 0; i < N * 2; i++)
prev[i] = i + 1;
while (M--) {
int t;
cin >> t;
vector<int> next(N * 2);
if (t) {
for (int i = t; i < N * 2; i++)
next[i - t] = prev[i];
for (int i = 0; i < t; i++)
next[N * 2 - t + i] = prev[i];
prev = next;
} else {
for (int i = 0; i < N; i++) {
next[i * 2] = prev[i];
next[i * 2 + 1] = prev[i + N];
}
prev = next;
}
}
for (int i = 0; i < N * 2; i++)
cout << prev[i] << endl;
return 0;
}
|
[["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 22]]
| 1
| 229
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int n, m, k;
cin >> n >> m;
int a[2 * n], b[2 * n];
for (int i = 0; i < 2 * n; i++)
a[i] = i + 1;
for (int i = 0; i < m; i++) {
cin >> k;
if (k == 0) {
for (int j = 0; j < n; j++) {
b[2 * j] = a[j];
b[2 * j + 1] = a[n + j];
}
} else {
for (int j = 0; j < 2 * n; j++)
b[j] = j + 1;
for (int j = 0; j < 2 * n - k; j++)
b[j] = a[j + k];
for (int j = 0; j < k; j++)
b[2 * n - k] = a[j];
}
for (int j = 0; j < 2 * n; j++)
a[j] = b[j];
}
for (int i = 0; i < 2 * n; i++)
cout << a[i] << endl;
return 0;
}
|
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int n, m, k;
cin >> n >> m;
int a[2 * n], b[2 * n];
for (int i = 0; i < 2 * n; i++)
a[i] = i + 1;
for (int i = 0; i < m; i++) {
cin >> k;
if (k == 0) {
for (int j = 0; j < n; j++) {
b[2 * j] = a[j];
b[2 * j + 1] = a[n + j];
}
} else {
for (int j = 0; j < 2 * n; j++)
b[j] = j + 1;
for (int j = 0; j < 2 * n - k; j++)
b[j] = a[j + k];
for (int j = 0; j < k; j++)
b[j + 2 * n - k] = a[j];
}
for (int j = 0; j < 2 * n; j++)
a[j] = b[j];
}
for (int i = 0; i < 2 * n; i++)
cout << a[i] << endl;
return 0;
}
|
[["+", 31, 69, 341, 342, 0, 16, 31, 16, 31, 22], ["+", 31, 69, 341, 342, 0, 16, 31, 16, 17, 72]]
| 1
| 297
|
#include <iostream>
using namespace std;
int n;
int temp1[1000], temp2[1000];
void k_cut(int card[], int k) {
int i, j, l, m;
for (i = 0; i < k; i++)
temp1[i] = card[i];
for (j = i, m = 0; j < 2 * n; j++, m++)
temp2[m] = card[j];
for (i = 0; i < m; i++)
card[i] = temp2[i];
for (j = i, l = 0; j < i + k; j++)
card[j] = temp1[l++];
}
void riffle_shuffle(int card[]) {
int i, j, l;
for (i = 0; i < n; i++)
temp1[i] = card[i];
for (j = i, l = 0; j < 2 * n; j++, l++)
temp2[l] = card[j];
for (i = 0, j = 0; i < 2 * n; i += 2, j++) {
card[i] = temp1[j];
card[i + 1] = temp2[j];
}
}
int main() {
int m, k;
int card[1000];
cin >> n >> m;
for (int i = 0; i < 2 * n; i++)
card[i] = i + 1;
for (int i = 0; i < m; i++) {
cin >> k;
k > 0 ? k_cut(card, k) : riffle_shuffle(card);
}
for (int i = 0; i < 2 * n; i++)
cout << card[i];
return 0;
}
|
#include <iostream>
using namespace std;
int n;
int temp1[1000], temp2[1000];
void k_cut(int card[], int k) {
int i, j, l, m;
for (i = 0; i < k; i++)
temp1[i] = card[i];
for (j = i, m = 0; j < 2 * n; j++, m++)
temp2[m] = card[j];
for (i = 0; i < m; i++)
card[i] = temp2[i];
for (j = i, l = 0; j < i + k; j++)
card[j] = temp1[l++];
}
void riffle_shuffle(int card[]) {
int i, j, l;
for (i = 0; i < n; i++)
temp1[i] = card[i];
for (j = i, l = 0; j < 2 * n; j++, l++)
temp2[l] = card[j];
for (i = 0, j = 0; i < 2 * n; i += 2, j++) {
card[i] = temp1[j];
card[i + 1] = temp2[j];
}
}
int main() {
int m, k;
int card[1000];
cin >> n >> m;
for (int i = 0; i < 2 * n; i++)
card[i] = i + 1;
for (int i = 0; i < m; i++) {
cin >> k;
k > 0 ? k_cut(card, k) : riffle_shuffle(card);
}
for (int i = 0; i < 2 * n; i++)
cout << card[i] << endl;
return 0;
}
|
[["+", 8, 9, 0, 7, 8, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 7, 8, 1, 0, 16, 12, 22]]
| 1
| 379
|
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int card1[201], card2[201];
for (int i = 1; i <= 200; i++) {
card1[i] = i;
card2[i] = i;
}
int k;
for (int i = 0; i < m; i++) {
cin >> k;
if (k == 0) {
for (int o = 1; o <= n; o++) {
card2[2 * o - 1] = card1[o];
}
for (int o = 1; o <= n; o++) {
card2[2 * o] = card1[n + o];
}
} else {
for (int o = 1; o <= 2 * n; o++) {
if (k >= o) {
card2[2 * n - k + o] = card1[o];
} else {
card2[o - k] = card1[o];
}
}
}
for (int o = 1; o <= 2 * n; o++) {
card1[o] = card2[o];
}
for (int i = 1; i <= 2 * n; i++) {
cout << card1[i] << endl;
}
}
}
|
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int card1[201], card2[201];
for (int i = 1; i <= 200; i++) {
card1[i] = i;
card2[i] = i;
}
int k;
for (int i = 0; i < m; i++) {
cin >> k;
if (k == 0) {
for (int o = 1; o <= n; o++) {
card2[2 * o - 1] = card1[o];
}
for (int o = 1; o <= n; o++) {
card2[2 * o] = card1[n + o];
}
} else {
for (int o = 1; o <= 2 * n; o++) {
if (k >= o) {
card2[2 * n - k + o] = card1[o];
} else {
card2[o - k] = card1[o];
}
}
}
for (int o = 1; o <= 2 * n; o++) {
card1[o] = card2[o];
}
}
for (int i = 1; i <= 2 * n; i++) {
cout << card1[i] << endl;
}
}
|
[["+", 0, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 282
|
#include <iostream>
#include <vector>
using namespace std;
vector<int> card(200);
int m, n, k;
void shuffle() {
vector<int> temp(card);
if (k == 0) {
for (int i = 0; i < n; i++) {
card[2 * i] = temp[i];
}
for (int i = n; i < 2 * n; i++) {
card[2 * (i - n) + 1] = temp[i];
}
} else {
for (int i = 0; i < 2 * n; i++) {
card[(i + k) % (2 * n)] = temp[i];
}
}
return;
}
int main() {
for (int i = 0; i < 200; i++) {
card[i] = i + 1;
}
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k;
shuffle();
}
for (int i = 0; i < 2 * n; i++) {
cout << card[i] << endl;
}
return 0;
}
|
#include <iostream>
#include <vector>
using namespace std;
vector<int> card(200);
int m, n, k;
void shuffle() {
vector<int> temp(card);
if (k == 0) {
for (int i = 0; i < n; i++) {
card[2 * i] = temp[i];
}
for (int i = n; i < 2 * n; i++) {
card[2 * (i - n) + 1] = temp[i];
}
} else {
for (int i = 0; i < 2 * n; i++) {
card[(2 * n + i - k) % (2 * n)] = temp[i];
}
}
return;
}
int main() {
for (int i = 0; i < 200; i++) {
card[i] = i + 1;
}
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> k;
shuffle();
}
for (int i = 0; i < 2 * n; i++) {
cout << card[i] << endl;
}
return 0;
}
|
[["-", 341, 342, 0, 16, 31, 23, 0, 16, 31, 22], ["+", 31, 23, 0, 16, 31, 16, 31, 16, 31, 13], ["+", 31, 23, 0, 16, 31, 16, 31, 16, 17, 48], ["+", 31, 23, 0, 16, 31, 16, 31, 16, 12, 22], ["+", 0, 16, 31, 23, 0, 16, 31, 16, 12, 22], ["+", 341, 342, 0, 16, 31, 23, 0, 16, 17, 33]]
| 1
| 245
|
#include <iostream>
using namespace std;
int main() {
int n, m;
int card[2][200];
while (cin >> n >> m) {
for (int i = 0; i < 2 * n; i++)
card[0][i] = i + 1;
for (int i = 0; i < m; i++) {
int cur = i % 2, next = 1 - i % 2;
int K;
cin >> K;
if (K > 0) {
for (int i = 0; i < 2 * n; i++)
card[next][i] = card[cur][(i + K) % (2 * n)];
} else {
for (int i = 0; i < n; i++)
card[next][2 * i] = card[cur][i];
for (int i = 0; i < n; i++)
card[next][2 * i + 1] = card[cur][i + K];
}
}
for (int i = 0; i < 2 * n; i++)
cout << card[m % 2][i] << endl;
}
}
|
#include <iostream>
using namespace std;
int main() {
int n, m;
int card[2][200];
while (cin >> n >> m) {
for (int i = 0; i < 2 * n; i++)
card[0][i] = i + 1;
for (int k = 0; k < m; k++) {
int cur = k % 2, next = 1 - k % 2;
int K;
cin >> K;
if (K > 0) {
for (int i = 0; i < 2 * n; i++)
card[next][i] = card[cur][(i + K) % (2 * n)];
} else {
for (int i = 0; i < n; i++)
card[next][2 * i] = card[cur][i];
for (int i = 0; i < n; i++)
card[next][2 * i + 1] = card[cur][i + n];
}
}
for (int i = 0; i < 2 * n; i++)
cout << card[m % 2][i] << endl;
}
}
|
[["-", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["+", 8, 9, 0, 7, 10, 43, 49, 50, 49, 22], ["-", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["+", 0, 52, 8, 9, 0, 7, 15, 16, 31, 22], ["-", 0, 52, 8, 9, 0, 7, 26, 27, 28, 22], ["+", 0, 52, 8, 9, 0, 7, 26, 27, 28, 22], ["-", 8, 9, 0, 43, 49, 50, 51, 16, 31, 22], ["+", 8, 9, 0, 43, 49, 50, 51, 16, 31, 22], ["-", 0, 43, 49, 50, 51, 16, 12, 16, 31, 22], ["+", 0, 43, 49, 50, 51, 16, 12, 16, 31, 22], ["-", 0, 11, 12, 69, 341, 342, 0, 16, 12, 22], ["+", 0, 11, 12, 69, 341, 342, 0, 16, 12, 22]]
| 1
| 253
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m;
vector<int> v;
for (int i = 1; i <= 2 * n; i++) {
v.push_back(i);
}
for (int i = 0; i < m; i++) {
vector<int> t(2 * n);
cin >> k;
if (k > 0) {
for (int j = 0; j < k; j++) {
t[2 * n - k + j] = v[j];
}
for (int j = k; j < 2 * n; j++) {
t[j - k + 1] = v[j];
}
} else {
for (int j = 0; j < 2 * n; j += 2) {
t[j] = v[j / 2];
t[j + 1] = v[n + j / 2];
}
}
v = t;
}
for (int i = 0; i < v.size(); i++) {
cout << v[i] << endl;
}
}
|
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m, k;
cin >> n >> m;
vector<int> v;
for (int i = 1; i <= 2 * n; i++) {
v.push_back(i);
}
for (int i = 0; i < m; i++) {
vector<int> t(2 * n);
cin >> k;
if (k > 0) {
for (int j = 0; j < k; j++) {
t[2 * n - k + j] = v[j];
}
for (int j = k; j < 2 * n; j++) {
t[j - k] = v[j];
}
} else {
for (int j = 0; j < 2 * n; j += 2) {
t[j] = v[j / 2];
t[j + 1] = v[n + j / 2];
}
}
v = t;
}
for (int i = 0; i < v.size(); i++) {
cout << v[i] << endl;
}
}
|
[["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]]
| 1
| 244
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
void riful(int[], int);
void cut(int[], int, int);
int main() {
int n, m, i;
int card[200];
for (i = 0; i < 200; i++) {
card[i] = -1;
}
cin >> n >> m;
for (i = 0; i < 200; i++) {
if (i < n * 2)
card[i] = i;
else
card[i] = -1;
}
for (i = 0; i < m + 1; i++) {
int k;
cin >> k;
if (k == 0)
riful(card, n);
else
cut(card, n, k);
}
for (i = 0; i < n * 2; i++) {
printf("%d\n", card[i] + 1);
}
return 0;
}
void riful(int card[], int n) {
int A[100], B[100], i;
for (i = 0; i < 100; i++) {
A[i] = B[i] = -1;
}
for (i = 0; i < n; i++) {
A[i] = card[i];
B[i] = card[n + i];
}
for (i = 0; i < n; i++) {
card[i * 2] = A[i];
card[i * 2] = B[i];
}
}
void cut(int card[], int n, int k) {
int A[100], B[100], i;
for (i = 0; i < n * 2; i++) {
if (i < k)
A[i] = card[i];
else
B[i - k] = card[i];
}
for (i = 0; i < n * 2; i++) {
if (i < n * 2 - k)
card[i] = B[i];
else
card[i] = A[i - (n * 2 - k)];
}
}
|
#include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
void riful(int[], int);
void cut(int[], int, int);
int main() {
int n, m, i;
int card[200];
for (i = 0; i < 200; i++) {
card[i] = -1;
}
cin >> n >> m;
for (i = 0; i < 200; i++) {
if (i < n * 2)
card[i] = i;
else
card[i] = -1;
}
for (i = 0; i < m; i++) {
int k;
cin >> k;
if (k == 0)
riful(card, n);
else
cut(card, n, k);
}
for (i = 0; i < n * 2; i++) {
printf("%d\n", card[i] + 1);
}
return 0;
}
void riful(int card[], int n) {
int A[100], B[100], i;
for (i = 0; i < 100; i++) {
A[i] = B[i] = -1;
}
for (i = 0; i < n; i++) {
A[i] = card[i];
B[i] = card[n + i];
}
for (i = 0; i < n; i++) {
card[i * 2] = A[i];
card[i * 2 + 1] = B[i];
}
}
void cut(int card[], int n, int k) {
int A[200], B[200], i;
for (i = 0; i < n * 2; i++) {
if (i < k)
A[i] = card[i];
else
B[i - k] = card[i];
}
for (i = 0; i < n * 2; i++) {
if (i < n * 2 - k)
card[i] = B[i];
else
card[i] = A[i - (n * 2 - k)];
}
}
|
[["-", 8, 9, 0, 7, 15, 16, 12, 16, 17, 72], ["-", 8, 9, 0, 7, 15, 16, 12, 16, 12, 13], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13], ["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]]
| 1
| 461
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define exist(s, e) ((s).find(e) != (s).end())
#define range(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) range(i, 0, n)
#define clr(a, b) memset((a), (b), sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
const double eps = 1e-10;
const double pi = acos(-1.0);
const ll INF = 1LL << 62;
const int inf = 1 << 29;
void shufful(vi &cur, int q) {
vi next;
int n = cur.size();
next.resize(n);
if (q) {
rep(i, n - q) next[i] = cur[i + q];
rep(i, q) next[n - q + i] = cur[i];
} else {
rep(i, n / 2) next[2 * i] = cur[i];
rep(i, n / 2) next[2 * i + 1] = cur[n / 2 + i];
}
rep(i, 2 * n) cur[i] = next[i];
return;
}
int main(void) {
int n;
cin >> n;
vi cur;
rep(i, 2 * n) cur.pb(i + 1);
int m;
cin >> m;
rep(i, m) {
int q;
cin >> q;
shufful(cur, q);
}
rep(i, 2 * n) cout << cur[i] << endl;
return 0;
}
|
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> inline T sqr(T x) { return x * x; }
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;
typedef pair<int, int> pii;
typedef long long ll;
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define pb push_back
#define mp make_pair
#define each(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define exist(s, e) ((s).find(e) != (s).end())
#define range(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) range(i, 0, n)
#define clr(a, b) memset((a), (b), sizeof(a))
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
const double eps = 1e-10;
const double pi = acos(-1.0);
const ll INF = 1LL << 62;
const int inf = 1 << 29;
void shufful(vi &cur, int q) {
vi next;
int n = cur.size();
next.resize(n);
if (q) {
rep(i, n - q) next[i] = cur[i + q];
rep(i, q) next[n - q + i] = cur[i];
} else {
rep(i, n / 2) next[2 * i] = cur[i];
rep(i, n / 2) next[2 * i + 1] = cur[n / 2 + i];
}
rep(i, n) cur[i] = next[i];
return;
}
int main(void) {
int n;
cin >> n;
vi cur;
rep(i, 2 * n) cur.pb(i + 1);
int m;
cin >> m;
rep(i, m) {
int q;
cin >> q;
shufful(cur, q);
}
rep(i, 2 * n) cout << cur[i] << endl;
return 0;
}
|
[["-", 31, 69, 28, 2, 3, 4, 0, 16, 31, 13], ["-", 31, 69, 28, 2, 3, 4, 0, 16, 17, 48]]
| 1
| 492
|
n = gets.to_i
m = gets.to_i
cards = (1..2*n).to_a
m.times do
k = gets.to_i
if k == 0
new_cards = Array.new
n.times do |i|
new_cards << cards[i] << cards[n+i]
end
cards = new_cards
else
cards = cards[k...2*n] + cards[0...k]
end
p k, cards
end
puts cards
|
n = gets.to_i
m = gets.to_i
cards = (1..2*n).to_a
m.times do
k = gets.to_i
if k == 0
new_cards = Array.new
n.times do |i|
new_cards << cards[i] << cards[n+i]
end
cards = new_cards
else
cards = cards[k...2*n] + cards[0...k]
end
end
puts cards
|
[["-", 0, 652, 196, 737, 8, 736, 0, 652, 735, 22], ["-", 196, 737, 8, 736, 0, 652, 3, 4, 0, 22], ["-", 196, 737, 8, 736, 0, 652, 3, 4, 0, 21]]
| 4
| 89
|
n=int(input())
c=list(range(1,1+2*n))
for _ in[0]*int(input()):
k=int(input())
if k:c=c[k:]+c[:k]
else:
for a,b in zip(c[:n],c[n:]):
c+=[a,b]
c=c[2*n:]
print(*c,sep='')
|
n=int(input())
c=list(range(1,1+2*n))
for _ in[0]*int(input()):
k=int(input())
if k:c=c[k:]+c[:k]
else:
for a,b in zip(c[:n],c[n:]):
c+=[a,b]
c=c[2*n:]
print(*c,sep='\n')
|
[["+", 3, 4, 0, 653, 51, 557, 0, 6, 0, 44]]
| 5
| 109
|
#include <stdio.h>
int a[1111], b[1111], c[1111], d[1111], p[333], x, y, z, i, j;
int main() {
while (scanf("%d %d %d", &a[0], &b[0], &c[0]) & (*a += *b + *c)) {
for (i = 332; i;)
p[i--] = 2;
scanf("%d", &p[0]);
for (i = 0; i++ < *p;)
scanf("%d %d %d %d", &a[i], &b[i], &c[i], &d[i]);
for (i = 0; i++ < *p;) {
for (j = 0; j++ < *p;) {
if (d[j])
p[a[j]] = p[b[j]] = p[c[j]] = 1;
else {
if ((x = p[a[j]] & 1) & (y = p[b[j]] & 1))
p[c[j]] = 0;
else if (x & (z = p[c[j]] & 1))
p[b[j]] = 0;
else if (y & z)
p[a[j]] = 0;
}
}
}
for (i = 0; i < *a;)
printf("%d\n", p[++i]);
}
}
|
#include <stdio.h>
int a[1111], b[1111], c[1111], d[1111], p[333], x, y, z, i, j;
int main() {
while (scanf("%d %d %d", &a[0], &b[0], &c[0]) && (*a += *b + *c)) {
for (i = 332; i;)
p[i--] = 2;
scanf("%d", &p[0]);
for (i = 0; i++ < *p;)
scanf("%d %d %d %d", &a[i], &b[i], &c[i], &d[i]);
for (i = 0; i++ < *p;) {
for (j = 0; j++ < *p;) {
if (d[j])
p[a[j]] = p[b[j]] = p[c[j]] = 1;
else {
if ((x = p[a[j]] & 1) & (y = p[b[j]] & 1))
p[c[j]] = 0;
else if (x & (z = p[c[j]] & 1))
p[b[j]] = 0;
else if (y & z)
p[a[j]] = 0;
}
}
}
for (i = 0; i < *a;)
printf("%d\n", p[++i]);
}
return 0;
}
|
[["-", 8, 9, 0, 52, 15, 23, 0, 16, 17, 67], ["+", 8, 9, 0, 52, 15, 23, 0, 16, 17, 98], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 38], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 13], ["+", 0, 30, 0, 14, 8, 9, 0, 37, 0, 35]]
| 0
| 336
|
#include <stdio.h>
int main() {
int a, b, e, n;
int c[301], i, d[100], m[100], k[100], r[100];
while (1) {
scanf("%d %d %d", &a, &b, &e);
if (!(a || b || e))
break;
scanf("%d", &n);
for (i = 1; i <= a + b + e; i++)
c[i] = 2;
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &d[i], &m[i], &k[i], &r[i]);
if (r[i]) {
c[d[i]] = 1;
c[m[i]] = 1;
c[k[i]] = 1;
}
}
for (i = 0; i < n; i++) {
if (r[i])
continue;
if (c[d[i]] * c[m[i]] * c[k[i]] == 2) {
if (c[d[i]] == 2)
c[d[i]] = 0;
if (c[m[i]] == 2)
c[m[i]] = 0;
if (c[k[i]] == 2)
c[k[i]] = 0;
}
}
for (i = 1; i <= a + b + e; i++)
printf("%d\n", c[i]);
}
return 0;
}
|
#include <stdio.h>
int main() {
int a, b, e, n;
int c[301], i, d[1000], m[1000], k[1000], r[1000];
while (1) {
scanf("%d %d %d", &a, &b, &e);
if (!(a || b || e))
break;
scanf("%d", &n);
for (i = 1; i <= a + b + e; i++)
c[i] = 2;
for (i = 0; i < n; i++) {
scanf("%d %d %d %d", &d[i], &m[i], &k[i], &r[i]);
if (r[i]) {
c[d[i]] = 1;
c[m[i]] = 1;
c[k[i]] = 1;
}
}
for (i = 0; i < n; i++) {
if (r[i])
continue;
if (c[d[i]] * c[m[i]] * c[k[i]] == 2) {
if (c[d[i]] == 2)
c[d[i]] = 0;
if (c[m[i]] == 2)
c[m[i]] = 0;
if (c[k[i]] == 2)
c[k[i]] = 0;
}
}
for (i = 1; i <= a + b + e; i++)
printf("%d\n", c[i]);
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]]
| 0
| 352
|
#include <iostream>
using namespace std;
#define MAX 1000
struct S {
int i, j, k, r;
};
int main() {
int a, b, c, N;
S check[MAX];
int res[100 + 100 + 100 + 1];
int cnt;
while (1) {
cin >> a >> b >> c;
if (a == 0 && b == 0 && c == 0)
break;
for (int i = 1; i <= a + b + c; i++) {
res[i] = -1;
}
cin >> N;
for (int i = 0; i < N; i++) {
cin >> check[i].i >> check[i].j >> check[i].k >> check[i].r;
if (check[i].r == 1) {
res[check[i].i] = 1;
res[check[i].j] = 1;
res[check[i].k] = 1;
}
}
for (int i = 0; i < N; i++) {
cnt = 0;
if (check[i].r == 0) {
if (res[check[i].i] != 1)
cnt++;
if (res[check[i].j] != 1)
cnt++;
if (res[check[i].k] != 1)
cnt++;
if (cnt == 1) {
if (res[check[i].i] == -1)
res[check[i].i] = 0;
if (res[check[i].j] == -1)
res[check[i].j] = 0;
if (res[check[i].k] == -1)
res[check[i].k] = 0;
} else {
if (res[check[i].i] == -1)
res[check[i].i] = 2;
if (res[check[i].j] == -1)
res[check[i].j] = 2;
if (res[check[i].k] == -1)
res[check[i].k] = 2;
}
}
}
for (int i = 1; i <= a + b + c; i++) {
if (res[i] != -1)
cout << res[i] << endl;
else
cout << "2" << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
#define MAX 1000
struct S {
int i, j, k, r;
};
int main() {
int a, b, c, N;
S check[MAX];
int res[100 + 100 + 100 + 1];
int cnt;
while (1) {
cin >> a >> b >> c;
if (a == 0 && b == 0 && c == 0)
break;
for (int i = 1; i <= a + b + c; i++) {
res[i] = -1;
}
cin >> N;
for (int i = 0; i < N; i++) {
cin >> check[i].i >> check[i].j >> check[i].k >> check[i].r;
if (check[i].r == 1) {
res[check[i].i] = 1;
res[check[i].j] = 1;
res[check[i].k] = 1;
}
}
for (int i = 0; i < N; i++) {
cnt = 0;
if (check[i].r == 0) {
if (res[check[i].i] != 1)
cnt++;
if (res[check[i].j] != 1)
cnt++;
if (res[check[i].k] != 1)
cnt++;
if (cnt == 1) {
if (res[check[i].i] != 1)
res[check[i].i] = 0;
if (res[check[i].j] != 1)
res[check[i].j] = 0;
if (res[check[i].k] != 1)
res[check[i].k] = 0;
} else {
if (res[check[i].i] == -1)
res[check[i].i] = 2;
if (res[check[i].j] == -1)
res[check[i].j] = 2;
if (res[check[i].k] == -1)
res[check[i].k] = 2;
}
}
}
for (int i = 1; i <= a + b + c; i++) {
if (res[i] != -1)
cout << res[i] << endl;
else
cout << "2" << endl;
}
}
return 0;
}
|
[["-", 64, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["-", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 17, 79], ["+", 64, 9, 0, 57, 15, 339, 51, 16, 12, 13]]
| 1
| 516
|
#include <iostream>
using namespace std;
int ans[500];
int a, b, c, N;
int r[1000], x[1000], y[1000], z[1000];
void init() {
for (int i = 0; i < 2000; i++)
ans[i] = 2;
}
int main() {
while (cin >> a >> b >> c && a && b && c) {
init();
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> z[i] >> r[i];
if (r[i] == 1)
ans[x[i]] = 1, ans[y[i]] = 1, ans[z[i]] = 1;
}
for (int i = 0; i < N; i++) {
if (r[i] == 1)
continue;
if (ans[x[i]] == 1 && ans[y[i]] == 1)
ans[z[i]] = 0;
if (ans[y[i]] == 1 && ans[z[i]] == 1)
ans[x[i]] = 0;
if (ans[z[i]] == 1 && ans[x[i]] == 1)
ans[y[i]] = 0;
}
for (int i = 1; i <= a + b + c; i++) {
cout << ans[i] << endl;
}
}
return 0;
}
|
#include <iostream>
using namespace std;
int ans[500];
int a, b, c, N;
int r[1000], x[1000], y[1000], z[1000];
void init() {
for (int i = 0; i < 500; i++)
ans[i] = 2;
}
int main() {
while (cin >> a >> b >> c && a && b && c) {
init();
cin >> N;
for (int i = 0; i < N; i++) {
cin >> x[i] >> y[i] >> z[i] >> r[i];
if (r[i] == 1)
ans[x[i]] = 1, ans[y[i]] = 1, ans[z[i]] = 1;
}
for (int i = 0; i < N; i++) {
if (r[i] == 1)
continue;
if (ans[x[i]] == 1 && ans[y[i]] == 1)
ans[z[i]] = 0;
if (ans[y[i]] == 1 && ans[z[i]] == 1)
ans[x[i]] = 0;
if (ans[z[i]] == 1 && ans[x[i]] == 1)
ans[y[i]] = 0;
}
for (int i = 1; i <= a + b + c; i++) {
cout << ans[i] << endl;
}
}
return 0;
}
|
[["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]]
| 1
| 333
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, n;
int buhin[301], list[1000][4], cnt;
while (cin >> a >> b >> c && a || b || c) {
fill_n(buhin, 301, 2);
cin >> n;
cnt = 0;
for (int i = 0; i < n; i++, cnt++) {
for (int j = 0; j < 4; j++) {
cin >> list[cnt][j];
}
if (list[i][3] == 1) {
for (int k = 0; k < 3; k++)
buhin[list[cnt][k]] = 1;
cnt--;
}
}
for (int i = 0; i < cnt; i++) {
for (int j = 0; j < 3; j++) {
if (buhin[list[i][j]] == 1 && buhin[list[i][(j + 1) % 3]] == 1) {
buhin[list[i][(j + 2) % 3]] = 0;
}
}
}
for (int i = 1; i <= a + b + c; i++)
cout << buhin[i] << endl;
}
}
|
#include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b, c, n;
int buhin[301], list[1000][4], cnt;
while (cin >> a >> b >> c && a || b || c) {
fill_n(buhin, 301, 2);
cin >> n;
cnt = 0;
for (int i = 0; i < n; i++, cnt++) {
for (int j = 0; j < 4; j++) {
cin >> list[cnt][j];
}
if (list[cnt][3] == 1) {
for (int k = 0; k < 3; k++)
buhin[list[cnt][k]] = 1;
cnt--;
}
}
for (int i = 0; i < cnt; i++) {
for (int j = 0; j < 3; j++) {
if (buhin[list[i][j]] == 1 && buhin[list[i][(j + 1) % 3]] == 1) {
buhin[list[i][(j + 2) % 3]] = 0;
}
}
}
for (int i = 1; i <= a + b + c; i++)
cout << buhin[i] << endl;
}
}
|
[["-", 51, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 69, 28, 69, 341, 342, 0, 22]]
| 1
| 277
|
#include <iostream>
int main() {
int a, b, c;
int ans[301];
while (1) {
for (int l = 1; l < 301; l++) {
ans[l] = 2;
}
std::cin >> a;
std::cin >> b;
std::cin >> c;
if (!a && !b && !c)
break;
int N;
std::cin >> N;
int i[100] = {0}, j[100] = {0}, k[100] = {0}, r[100] = {0};
for (int l = 0; l < N; l++) {
std::cin >> i[l];
std::cin >> j[l];
std::cin >> k[l];
std::cin >> r[l];
if (r[l]) {
ans[i[l]] = 1;
ans[j[l]] = 1;
ans[k[l]] = 1;
}
}
for (int l = 0; l < N; l++) {
if (r[l])
continue;
if (ans[i[l]] == 1 && ans[j[l]] == 1)
ans[k[l]] = 0;
else if (ans[i[l]] == 1 && ans[k[l]] == 1)
ans[j[l]] = 0;
else if (ans[k[l]] == 1 && ans[j[l]] == 1)
ans[i[l]] = 0;
}
for (int l = 1; l <= a + b + c; l++)
std::cout << ans[l] << std::endl;
}
}
|
#include <iostream>
int main() {
int a, b, c;
int ans[301];
while (1) {
for (int l = 1; l < 301; l++) {
ans[l] = 2;
}
std::cin >> a;
std::cin >> b;
std::cin >> c;
if (!a && !b && !c)
break;
int N;
std::cin >> N;
int i[1000] = {0}, j[1000] = {0}, k[1000] = {0}, r[1000] = {0};
for (int l = 0; l < N; l++) {
std::cin >> i[l];
std::cin >> j[l];
std::cin >> k[l];
std::cin >> r[l];
if (r[l]) {
ans[i[l]] = 1;
ans[j[l]] = 1;
ans[k[l]] = 1;
}
}
for (int l = 0; l < N; l++) {
if (r[l])
continue;
if (ans[i[l]] == 1 && ans[j[l]] == 1)
ans[k[l]] = 0;
else if (ans[i[l]] == 1 && ans[k[l]] == 1)
ans[j[l]] = 0;
else if (ans[k[l]] == 1 && ans[j[l]] == 1)
ans[i[l]] = 0;
}
for (int l = 1; l <= a + b + c; l++)
std::cout << ans[l] << std::endl;
}
}
|
[["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13]]
| 1
| 372
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int a, b, c, N;
cin >> a >> b >> c;
if (a == 0 && b == 0 && c == 0)
break;
int data[1002][5], cmp[303];
for (int i = 1; i <= a + b + c; i++) {
cmp[i] = 2;
}
cin >> N;
for (int i = 0; i < N; i++) {
for (int j = 0; j < 4; j++) {
cin >> data[i][j];
if (data[i][3] == 1) {
for (int k = 0; k < 3; k++) {
cmp[data[i][j]] = 1;
}
}
}
}
for (int i = 0; i < N; i++) {
if (data[i][3] == 0) {
int cnt = 0;
for (int j = 0; j < 3; j++) {
if (cmp[data[i][j]] == 1)
cnt++;
}
if (cnt == 2) {
for (int j = 0; j < 3; j++) {
if (cmp[data[i][j]] != 1)
cmp[data[i][j]] = 0;
}
}
}
}
for (int i = 1; i <= a + b + c; i++) {
cout << cmp[i] << endl;
}
}
return 0;
}
|
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
while (1) {
int a, b, c, N;
cin >> a >> b >> c;
if (a == 0 && b == 0 && c == 0)
break;
int data[1002][5], cmp[303];
for (int i = 1; i <= a + b + c; i++) {
cmp[i] = 2;
}
cin >> N;
for (int i = 0; i < N; i++) {
for (int j = 0; j < 4; j++) {
cin >> data[i][j];
}
if (data[i][3] == 1) {
for (int k = 0; k < 3; k++) {
cmp[data[i][k]] = 1;
}
}
}
for (int i = 0; i < N; i++) {
if (data[i][3] == 0) {
int cnt = 0;
for (int j = 0; j < 3; j++) {
if (cmp[data[i][j]] == 1)
cnt++;
}
if (cnt == 2) {
for (int j = 0; j < 3; j++) {
if (cmp[data[i][j]] != 1)
cmp[data[i][j]] = 0;
}
}
}
}
for (int i = 1; i <= a + b + c; i++) {
cout << cmp[i] << endl;
}
}
return 0;
}
|
[["+", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 31, 69, 341, 342, 0, 69, 341, 342, 0, 22], ["+", 31, 69, 341, 342, 0, 69, 341, 342, 0, 22], ["-", 0, 57, 64, 9, 0, 7, 8, 9, 0, 46]]
| 1
| 338
|
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; \
}
#define dumpc(o) \
if (DBG) { \
cerr << #o; \
for (auto &e : (o)) \
cerr << " " << e; \
cerr << endl; \
}
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define each(it, c) for (auto it = (c).begin(); it != (c).end(); it++)
#define all(c) c.begin(), c.end()
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);
const double EPS = 1e-10;
signed main() {
int a, b, c;
while (cin >> a >> b >> c, a || b || c) {
int n;
cin >> n;
vector<int> i, j, k, ans(a + b + c + 1, 2);
rep(x, 0, n) {
int e, f, g, h;
cin >> e >> f >> g >> h;
if (h) {
ans[e] = ans[f] = ans[g] = 1;
} else {
i.push_back(e);
j.push_back(f);
k.push_back(g);
}
}
int m = i.size();
for (int x = 0; x < m; x++) {
int p(i[x]), q(j[x]), r(k[x]);
if (ans[p] == 1 && ans[q] == 1 && ans[r] == 2) {
ans[r] = 0;
} else if (ans[p] == 1 && ans[q] == 2 && ans[r] == 1) {
ans[q] = 0;
} else if (ans[p] == 2 && ans[q] == 1 && ans[r] == 1) {
ans[r] = 0;
}
}
rep(x, 1, ans.size()) cout << ans[x] << endl;
}
return 0;
}
|
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
using namespace std;
//#define int long long
#define DBG 1
#define dump(o) \
if (DBG) { \
cerr << #o << " " << o << endl; \
}
#define dumpc(o) \
if (DBG) { \
cerr << #o; \
for (auto &e : (o)) \
cerr << " " << e; \
cerr << endl; \
}
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define each(it, c) for (auto it = (c).begin(); it != (c).end(); it++)
#define all(c) c.begin(), c.end()
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)(1e9 + 7);
const double EPS = 1e-10;
signed main() {
int a, b, c;
while (cin >> a >> b >> c, a || b || c) {
int n;
cin >> n;
vector<int> i, j, k, ans(a + b + c + 1, 2);
rep(x, 0, n) {
int e, f, g, h;
cin >> e >> f >> g >> h;
if (h) {
ans[e] = ans[f] = ans[g] = 1;
} else {
i.push_back(e);
j.push_back(f);
k.push_back(g);
}
}
int m = i.size();
for (int x = 0; x < m; x++) {
int p(i[x]), q(j[x]), r(k[x]);
if (ans[p] == 1 && ans[q] == 1 && ans[r] == 2) {
ans[r] = 0;
} else if (ans[p] == 1 && ans[q] == 2 && ans[r] == 1) {
ans[q] = 0;
} else if (ans[p] == 2 && ans[q] == 1 && ans[r] == 1) {
ans[p] = 0;
}
}
rep(x, 1, ans.size()) cout << ans[x] << endl;
}
return 0;
}
|
[["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]]
| 1
| 410
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.