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 | change_count int64 0 100 |
|---|---|---|---|---|---|
#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 | 2 |
#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... | #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;
}
... | [["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 12, 147]] | 1 | 95 | 2 |
#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 | 4 |
#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 | 2 |
#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 | 4 |
#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 | 4 |
#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;
}
}
retur... | [["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 33], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 109 | 2 |
#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 | 5 |
#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 = ... | #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 = ... | [["-", 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 | 3 |
#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 | 1 |
#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 | 4 |
#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) {... | #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) {... | [["-", 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 | 4 |
#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 | 3 |
#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;
}
r... | #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;... | [["+", 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 | 4 |
#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 | 2 |
#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 | 3 |
#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 | 2 |
#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 | 2 |
#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 | 2 |
#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 | 14 |
#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 | 3 |
// 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... | [["+", 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 | 4 |
#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,... | 1 | 120 | 8 |
#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) {
... | #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) {
... | [["-", 8, 9, 0, 57, 15, 339, 51, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 339, 51, 16, 17, 60]] | 1 | 167 | 2 |
#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) ... | #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) ... | [["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13]] | 1 | 117 | 1 |
#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 | 4 |
#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 | 2 |
#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];
}
... | #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];
}
... | [["+", 0, 1, 0, 2, 3, 4, 0, 66, 17, 67]] | 1 | 143 | 1 |
// 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, in... | // 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, in... | [["-", 12, 2, 3, 4, 0, 2, 3, 4, 0, 22], ["+", 12, 2, 3, 4, 0, 2, 3, 4, 0, 22]] | 1 | 370 | 2 |
#!/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... | #!/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):
... | [["-", 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 | 6 |
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 | 6 |
// 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... | // 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... | [["+", 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 | 4 |
#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("%... | #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("%... | [["-", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22], ["+", 0, 57, 64, 9, 0, 1, 0, 11, 12, 22]] | 0 | 253 | 2 |
#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);
... | #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);
... | [["+", 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 | 4 |
#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;... | #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;... | [["-", 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 | 4 |
#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] > Bsc... | #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] > Bsc... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 0 | 166 | 4 |
#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... | #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 < ... | [["-", 8, 9, 0, 57, 15, 23, 0, 11, 17, 32], ["+", 8, 9, 0, 57, 15, 23, 0, 16, 17, 60]] | 0 | 146 | 2 |
#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);
re... | #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 | 4 |
#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 | 4 |
#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);
... | #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);... | [["-", 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 | 4 |
#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 | 6 |
#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... | #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... | [["-", 75, 76, 0, 57, 15, 23, 0, 16, 17, 18], ["+", 75, 76, 0, 57, 15, 23, 0, 16, 17, 47]] | 0 | 141 | 2 |
#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... | #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... | [["-", 0, 2, 3, 4, 0, 66, 28, 69, 71, 22], ["+", 0, 2, 3, 4, 0, 66, 28, 69, 71, 22]] | 0 | 163 | 2 |
#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 {
prin... | #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 {
prin... | [["-", 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 | 4 |
#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 | 4 |
#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... | #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);
re... | [["-", 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 | 4 |
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 | 5 |
#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 | 2 |
#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 | 2 |
#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 <... | #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 <... | [["-", 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], ["+",... | 1 | 122 | 8 |
#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 | 2 |
#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 <... | #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 <... | [["-", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6], ["+", 8, 9, 0, 43, 49, 50, 51, 5, 0, 6]] | 1 | 96 | 2 |
#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_pai... | #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_pai... | [["-", 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,... | 1 | 140 | 8 |
#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 | 2 |
#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... | #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... | [["-", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125], ["+", 0, 57, 15, 339, 51, 16, 12, 103, 0, 125]] | 1 | 468 | 4 |
#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,... | 1 | 83 | 8 |
#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("... | #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("%... | [["-", 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,... | 1 | 111 | 8 |
#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 | 1 |
#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,... | 1 | 82 | 10 |
#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... | #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... | [["+", 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 | 4 |
#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>
#def... | #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>
#def... | [["-", 0, 9, 0, 57, 15, 339, 51, 16, 17, 19], ["+", 0, 9, 0, 57, 15, 339, 51, 16, 17, 18]] | 1 | 175 | 2 |
#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... |
#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... | [["-", 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, 1... | 1 | 118 | 8 |
#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, 6... | 1 | 80 | 8 |
#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 | 2 |
#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 << end... | [["-", 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 | 6 |
#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];
}
}
cou... | #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];
}
}
co... | [["+", 0, 7, 8, 9, 0, 57, 75, 76, 0, 95]] | 1 | 125 | 1 |
#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 ... | #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 ... | [["+", 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 | 6 |
#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 | 4 |
#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], ["... | 1 | 88 | 10 |
#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,... | 1 | 89 | 8 |
#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], ["... | 1 | 96 | 8 |
#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';
... | #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';... | [["+", 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 | 4 |
#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 | 2 |
#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 | 4 |
#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] - ... | #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] - ... | [["-", 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... | 1 | 112 | 8 |
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 | 4 |
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 | 2 |
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;
}
... | 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;
}
... | [["-", 0, 195, 8, 196, 0, 503, 49, 200, 51, 499], ["+", 0, 195, 8, 196, 0, 503, 49, 200, 51, 499]] | 3 | 365 | 2 |
#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++)... | #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++)... | [["+", 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 | 4 |
#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 ... | #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 ... | [["-", 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 | 4 |
#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];
... | #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];
... | [["+", 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 | 3 |
#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... | #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... | [["+", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["+", 0, 11, 31, 69, 341, 342, 0, 16, 12, 22]] | 1 | 229 | 2 |
#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... | #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... | [["+", 31, 69, 341, 342, 0, 16, 31, 16, 31, 22], ["+", 31, 69, 341, 342, 0, 16, 31, 16, 17, 72]] | 1 | 297 | 2 |
#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; ... | #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; ... | [["+", 8, 9, 0, 7, 8, 1, 0, 16, 17, 151], ["+", 8, 9, 0, 7, 8, 1, 0, 16, 12, 22]] | 1 | 379 | 2 |
#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 = ... |
#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, 14, 8, 9, 0, 7, 8, 9, 0, 46], ["-", 0, 7, 8, 9, 0, 7, 8, 9, 0, 46]] | 1 | 282 | 2 |
#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 {
... | #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 {
... | [["-", 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 | 6 |
#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 = ... | #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 = ... | [["-", 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... | 1 | 253 | 12 |
#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[... | #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[... | [["-", 0, 11, 31, 69, 341, 342, 0, 16, 17, 72], ["-", 0, 11, 31, 69, 341, 342, 0, 16, 12, 13]] | 1 | 244 | 2 |
#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)
... | #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)
... | [["-", 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 | 8 |
#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 ... | #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 ... | [["-", 31, 69, 28, 2, 3, 4, 0, 16, 31, 13], ["-", 31, 69, 28, 2, 3, 4, 0, 16, 17, 48]] | 1 | 492 | 2 |
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 | 4 |
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 | 1 |
#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]);
... | #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]);
... | [["-", 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 | 5 |
#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... | #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", ... | [["-", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13], ["+", 0, 14, 8, 9, 0, 43, 49, 80, 81, 13]] | 0 | 352 | 8 |
#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++) {
... | #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++) {
... | [["-", 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 | 12 |
#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]... | #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] ... | [["-", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13], ["+", 0, 14, 8, 9, 0, 7, 15, 16, 12, 13]] | 1 | 333 | 2 |
#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++) {
ci... | #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++) {
ci... | [["-", 51, 16, 31, 69, 28, 69, 341, 342, 0, 22], ["+", 51, 16, 31, 69, 28, 69, 341, 342, 0, 22]] | 1 | 277 | 2 |
#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... | #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[... | [["-", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13], ["+", 8, 9, 0, 43, 49, 50, 49, 80, 81, 13]] | 1 | 372 | 8 |
#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;
... | #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;
... | [["+", 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 | 4 |
#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 _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; ... | [["-", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22], ["+", 0, 1, 0, 11, 31, 69, 341, 342, 0, 22]] | 1 | 410 | 2 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.