problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03242 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | [
"control_flow.branch.if.condition.change",
"call.add"
] | 1,030,327 | 1,030,328 | u947236878 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == 1)
cout << '9';
else
cout << '1';
}
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '1')
cout << '9';
else
cout << '1';
}
}
| [
"control_flow.branch.if.condition.change"
] | 1,030,329 | 1,030,330 | u713574885 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == 1)
n[i] = '9';
else
n[i] = '1';
}
cout << n << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == '1')
n[i] = '9';
else
n[i] = '1';
}
cout << n << endl;
} | [
"control_flow.branch.if.condition.change"
] | 1,030,331 | 1,030,332 | u528258842 | cpp |
p03231 | #include <iostream>
using namespace std;
typedef long long ll;
ll N, M;
string S, T;
ll gcd(ll n, ll m) {
if (n % m == 0)
return m;
else
return gcd(m, n % m);
}
int main() {
cin >> N >> M >> S >> T;
ll L = N / gcd(N, M) * M, n = N / gcd(N, M), m = M / gcd(N, M);
ll i = 0, j = 0;
bool judge = true;... | #include <iostream>
using namespace std;
typedef long long ll;
ll N, M;
string S, T;
ll gcd(ll n, ll m) {
if (n % m == 0)
return m;
else
return gcd(m, n % m);
}
int main() {
cin >> N >> M >> S >> T;
ll L = N / gcd(N, M) * M, n = N / gcd(N, M), m = M / gcd(N, M);
ll i = 0, j = 0;
bool judge = true;... | [
"expression.operation.binary.remove"
] | 1,030,339 | 1,030,340 | u623954643 | cpp |
p03231 | #include <cstdio>
#include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
long long t = 1;
while (b) {
t = b;
b = a % b;
a = t;
}
return t;
}
int main() {
long long n, m;
string s, t;
while (scanf("%lld%lld", &n, &m) != EOF) {
cin >> s >> t;
long long L = n *... | #include <cstdio>
#include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
long long t = 1;
while (b) {
t = b;
b = a % b;
a = t;
}
return t;
}
int main() {
long long n, m;
string s, t;
while (scanf("%lld%lld", &n, &m) != EOF) {
cin >> s >> t;
long long L = n *... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,030,353 | 1,030,354 | u249302712 | cpp |
p03231 | #include <cstdio>
#include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
long long t = 1;
while (b) {
t = b;
b = a % b;
a = t;
}
return t;
}
int main() {
long long n, m;
string s, t;
while (scanf("%lld%lld", &n, &m) != EOF) {
cin >> s >> t;
long long L = n *... | #include <cstdio>
#include <iostream>
using namespace std;
long long gcd(long long a, long long b) {
long long t = 1;
while (b) {
t = b;
b = a % b;
a = t;
}
return t;
}
int main() {
long long n, m;
string s, t;
while (scanf("%lld%lld", &n, &m) != EOF) {
cin >> s >> t;
long long L = n *... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 1,030,355 | 1,030,354 | u249302712 | cpp |
p03231 | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
#define MOD 1000000007
//... | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
#define MOD 1000000007
//... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,030,358 | 1,030,359 | u863279562 | cpp |
p03231 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int tmp;
while (b != 0) {
if (b < a) {
tmp = a;
a = b;
b = tmp;
}
b = b % a;
}
return a;
}
int main(void)... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int tmp;
while (b != 0) {
if (b < a) {
tmp = a;
a = b;
b = tmp;
}
b = b % a;
}
return a;
}
int main(void)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,030,370 | 1,030,371 | u122365993 | cpp |
p03231 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int tmp;
while (b != 0) {
if (b < a) {
tmp = a;
a = b;
b = tmp;
}
b = b % a;
}
return a;
}
int main(void)... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int tmp;
while (b != 0) {
if (b < a) {
tmp = a;
a = b;
b = tmp;
}
b = b % a;
}
return a;
}
int main(void)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change"
] | 1,030,373 | 1,030,371 | u122365993 | cpp |
p03231 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int tmp;
while (b != 0) {
if (b < a) {
tmp = a;
a = b;
b = tmp;
}
b = b % a;
}
return a;
}
int main(void)... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int gcd(int a, int b) {
int tmp;
while (b != 0) {
if (b < a) {
tmp = a;
a = b;
b = tmp;
}
b = b % a;
}
return a;
}
int main(void)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,030,375 | 1,030,371 | u122365993 | cpp |
p03231 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
using namespace std;
int main() {
uint64_t n, m;
string s, t;
cin >> n >> m;
cin >> s >> t;
uint64_t d = __gcd(n, m);
uint64_t ans = n * m / d;
map<uint64_t, char> map;
for (auto i = 0; i < n; i++) {
map.insert(make_pair(i ... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
using namespace std;
int main() {
int64_t n, m;
string s, t;
cin >> n >> m;
cin >> s >> t;
int64_t d = __gcd(n, m);
int64_t ans = n * m / d;
map<int64_t, char> map;
for (auto i = 0; i < n; i++) {
map.insert(make_pair(i * m ... | [
"variable_declaration.type.primitive.change"
] | 1,030,394 | 1,030,395 | u081445141 | cpp |
p03231 | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) { return b == 0 ? a : gcd(b, a % b); }
int64_t lcm(int64_t a, int64_t b) { return a * b / gcd(a, b); }
int main() {
int64_t i, j, k;
int64_t N, M;
string S, T;
cin >> N >> M >> S >> T;
int64_t L = lcm(N, M);
int64_t l = lcm(L ... | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) { return b == 0 ? a : gcd(b, a % b); }
int64_t lcm(int64_t a, int64_t b) { return a * b / gcd(a, b); }
int main() {
int64_t i, j, k;
int64_t N, M;
string S, T;
cin >> N >> M >> S >> T;
int64_t L = lcm(N, M);
int64_t l = lcm(L ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,030,396 | 1,030,397 | u314396879 | cpp |
p03231 | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) { return b == 0 ? a : gcd(b, a % b); }
int64_t lcm(int64_t a, int64_t b) { return a * b / gcd(a, b); }
int main() {
int64_t i, j, k;
int64_t N, M;
string S, T;
cin >> N >> M >> S >> T;
int64_t L = lcm(N, M);
int64_t l = lcm(L ... | #include <bits/stdc++.h>
using namespace std;
int64_t gcd(int64_t a, int64_t b) { return b == 0 ? a : gcd(b, a % b); }
int64_t lcm(int64_t a, int64_t b) { return a * b / gcd(a, b); }
int main() {
int64_t i, j, k;
int64_t N, M;
string S, T;
cin >> N >> M >> S >> T;
int64_t L = lcm(N, M);
int64_t l = lcm(L ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,030,398 | 1,030,397 | u314396879 | cpp |
p03231 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SZ(x) ((int)(x).size()) // unsignedのサイズをint型に変換
#define dump(x) cerr << #x <<... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SZ(x) ((int)(x).size()) // unsignedのサイズをint型に変換
#define dump(x) cerr << #x <<... | [
"variable_declaration.type.change",
"literal.number.change",
"call.arguments.change",
"call.add"
] | 1,030,408 | 1,030,407 | u077025302 | cpp |
p03231 | #include <algorithm>
#include <cstdio>
#include <iostream>
#define ll long long
using namespace std;
ll M(ll a, ll b) {
if (a < b)
swap(a, b);
while (a % b != 0) {
ll t = a % b;
a = b;
b = t;
}
return b;
}
int main() {
ll n, m;
string a, b;
scanf("%lld%lld", &n, &m);
cin >> a >> b;
if ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#define ll long long
using namespace std;
ll M(ll a, ll b) {
if (a < b)
swap(a, b);
while (a % b != 0) {
ll t = a % b;
a = b;
b = t;
}
return b;
}
int main() {
ll n, m;
string a, b;
scanf("%lld%lld", &n, &m);
cin >> a >> b;
if ... | [
"expression.operation.binary.remove"
] | 1,030,414 | 1,030,415 | u676323984 | cpp |
p03231 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define INF 2000000000000000000LL
#define EPS 1e-8
#define debug(a) cerr << #a << "=" << (a) << "\n"
#define FastSlowInput \
ios_base::s... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define INF 2000000000000000000LL
#define EPS 1e-8
#define debug(a) cerr << #a << "=" << (a) << "\n"
#define FastSlowInput \
ios_base::s... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,030,442 | 1,030,443 | u069951049 | cpp |
p03231 | #include <iostream>
#include <string>
using namespace std;
long long gcd(long long a, long long b) {
if (a < b) {
long long temp = a;
a = b;
b = temp;
}
long long r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
long long n, m;
cin >> n >> m;
stri... | #include <iostream>
#include <string>
using namespace std;
long long gcd(long long a, long long b) {
if (a < b) {
long long temp = a;
a = b;
b = temp;
}
long long r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
long long n, m;
cin >> n >> m;
stri... | [
"control_flow.branch.if.condition.change",
"expression.operation.unary.logical.remove"
] | 1,030,444 | 1,030,445 | u330689597 | cpp |
p03231 | #include <stdio.h>
int main() {
int n, m, i, j, pi, pj, a, b, c, ans;
char s[111111], t[111111];
scanf("%d%d", &n, &m);
scanf("%s%s", s, t);
a = n;
b = m;
c = n % m;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
pi = n / b;
pj = m / b;
i = 0;
j = 0;
while (i < n) {
if (s[i] != ... | #include <stdio.h>
int main() {
long n, m, i, j, pi, pj, a, b, c, ans;
char s[111111], t[111111];
scanf("%ld%ld", &n, &m);
scanf("%s%s", s, t);
a = n;
b = m;
c = n % m;
while (c != 0) {
a = b;
b = c;
c = a % b;
}
pi = n / b;
pj = m / b;
i = 0;
j = 0;
while (i < n) {
if (s[i] ... | [
"variable_declaration.type.primitive.change",
"literal.string.change",
"call.arguments.change",
"io.output.change",
"call.arguments.add"
] | 1,030,448 | 1,030,447 | u933068010 | cpp |
p03231 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> pint;
ll gcd(ll m, ll n) {
while (n != 0) {
ll r = m % n;
m = n;
n = r;
}
return m;
}
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> pint;
ll gcd(ll m, ll n) {
while (n != 0) {
ll r = m % n;
m = n;
n = r;
}
return m;
}
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,030,485 | 1,030,486 | u639297580 | cpp |
p03231 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
#ifndef M_PI
const double M_PI = acos(-1.0);
#endif
int main() {
cin.sync_with_stdio(false);
int n, m;
string s, t;
cin >> n >> m;
cin >> s >> t;
int g = __gcd(n, m);
for (int i = 1; i < g; ++i) {
if (s[(ll)i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
#ifndef M_PI
const double M_PI = acos(-1.0);
#endif
int main() {
cin.sync_with_stdio(false);
int n, m;
string s, t;
cin >> n >> m;
cin >> s >> t;
int g = __gcd(n, m);
for (int i = 0; i < g; ++i) {
if (s[(ll)i... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,030,532 | 1,030,533 | u681972227 | cpp |
p03231 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
ll m, n;
cin >> m >> n;
string s, t;
cin >> s >> t;
if (m < n) {
string u = s;
s = t;
t = u;
ll o... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
ll m, n;
cin >> m >> n;
string s, t;
cin >> s >> t;
if (m < n) {
string u = s;
s = t;
t = u;
ll o... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,030,538 | 1,030,539 | u036561304 | cpp |
p03231 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
ll m, n;
cin >> m >> n;
string s, t;
cin >> s >> t;
if (m < n) {
string u = s;
s = t;
t = u;
ll o... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
ll m, n;
cin >> m >> n;
string s, t;
cin >> s >> t;
if (m < n) {
string u = s;
s = t;
t = u;
ll o... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,030,540 | 1,030,539 | u036561304 | cpp |
p03231 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
ll m, n;
cin >> m >> n;
string s, t;
cin >> s >> t;
if (m < n) {
string u = s;
s = t;
t = u;
ll o... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll gcd(ll a, ll b) {
ll r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
int main() {
ll m, n;
cin >> m >> n;
string s, t;
cin >> s >> t;
if (m < n) {
string u = s;
s = t;
t = u;
ll o... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 1,030,541 | 1,030,539 | u036561304 | cpp |
p03231 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int n, m;
char s[maxn], t[maxn];
int gcd(int a, int b);
int main() {
scanf("%d%d", &n, &m);
scanf("%s%s", s, t);
if (s[0] != t[0]) {
printf("-1\n");
return 0;
} else {
int tt = gcd(n, m);
int n1 = n / tt, m1 = m / tt;
in... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
int n, m;
char s[maxn], t[maxn];
int gcd(int a, int b);
int main() {
scanf("%d%d", &n, &m);
scanf("%s%s", s, t);
if (s[0] != t[0]) {
printf("-1\n");
return 0;
} else {
int tt = gcd(n, m);
int n1 = n / tt, m1 = m / tt;
in... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,030,552 | 1,030,553 | u734474517 | cpp |
p03242 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 2; i++) {
if (s[i] == '1')
s[i] = '9';
else if (s[i] == '9')
s[i] = '1';
}
cout << s << "\n";
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '1')
s[i] = '9';
else if (s[i] == '9')
s[i] = '1';
}
cout << s << "\n";
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,030,562 | 1,030,563 | u841702632 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == '1')
s.at(0) = '9';
if (s.at(0) == '9')
s.at(0) = '1';
if (s.at(1) == '1')
s.at(1) = '9';
if (s.at(1) == '9')
s.at(1) = '1';
if (s.at(2) == '1')
s.at(2) = '9';
if (s.at(2) == '9')
s.at(2) = ... | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
if (s.at(0) == '1')
s.at(0) = '9';
else if (s.at(0) == '9')
s.at(0) = '1';
if (s.at(1) == '1')
s.at(1) = '9';
else if (s.at(1) == '9')
s.at(1) = '1';
if (s.at(2) == '1')
s.at(2) = '9';
else if (s.at(2) == '9')... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,564 | 1,030,565 | u451954557 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
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();
}
// math
//--------... | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
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();
}
// math
//--------... | [
"call.add"
] | 1,030,570 | 1,030,571 | u276588887 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
int a;
int sum;
cin >> a;
for (int i = 0; i < 3; i++) {
int y = a % 10;
if (i == 0) {
if (y == 9) {
sum += 1;
a /= 10;
} else if (y == 1) {
sum += 9;
a /= 10;
}
} else if (i == 1) {
if (y ... | #include <iostream>
using namespace std;
int main() {
int a;
int sum = 0;
cin >> a;
for (int i = 0; i < 3; i++) {
int y = a % 10;
if (i == 0) {
if (y == 9) {
sum += 1;
a /= 10;
} else if (y == 1) {
sum += 9;
a /= 10;
}
} else if (i == 1) {
if... | [
"variable_declaration.value.change"
] | 1,030,572 | 1,030,573 | u746613804 | cpp |
p03242 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string S;
cin >> S;
rep(i, 3) {
if (S[i] == '1')
S[i] = '9';
if (S[i] == '9')
S[i] = '1';
}
cout << S << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
string S;
cin >> S;
rep(i, 3) {
if (S[i] == '1') {
S[i] = '9';
} else if (S[i] == '9')
S[i] = '1';
}
cout << S << endl;
return 0;
}
| [
"control_flow.branch.else.add"
] | 1,030,587 | 1,030,588 | u282657760 | cpp |
p03242 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
string s;
cin >> s;
rep(i, 3) {
if (s[i] == '9') {
s[i] = 1;
} else {
s[i]... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
using P = pair<int, int>;
using ll = long long;
int main() {
string s;
cin >> s;
rep(i, 3) {
if (s[i] == '9') {
s[i] = '1';
} else {
s[... | [] | 1,030,596 | 1,030,597 | u534923072 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin = vector<int>;
using vll = vector<ll>;
using P = pair<int, ... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, from, to) for (int i = from; i < (to); ++i)
#define mp(x, y) make_pair(x, y)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
using ll = long long;
using vin = vector<int>;
using vll = vector<ll>;
using P = pair<int, ... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,030,598 | 1,030,599 | u531461815 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
char n[3];
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == '1')
n[i] = 9;
else
n[i] = '1';
}
cout << n << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
char n[3];
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == '1')
n[i] = '9';
else
n[i] = '1';
}
cout << n << endl;
} | [] | 1,030,605 | 1,030,606 | u043707543 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (S[i] == '1')
cout << "9";
if (S[i] == '9')
cout << "1";
else
cout << S[i];
}
cout << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < S.length(); i++) {
if (S[i] == '1')
cout << "9";
else if (S[i] == '9')
cout << "1";
else
cout << S[i];
}
cout << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,607 | 1,030,608 | u016119075 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
string s;
cin >> s;
rep(i, 3) {
if (s.at(i) = '1')
s.at(i) = '9';
else
s.at(i) = '1';
}
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
int main() {
string s;
cin >> s;
rep(i, 3) {
if (s.at(i) == '1')
s.at(i) = '9';
else
s.at(i) = '1';
}
cout << s << endl;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,030,609 | 1,030,610 | u425086757 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using P = pair<int, int>;
#define debug(var) cerr << "[" << #var ... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,030,620 | 1,030,621 | u488493347 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (char c : n)
c == '1' ? 9 : 1;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (char c : n)
cout << (c == '1' ? 9 : 1);
} | [
"io.output.change"
] | 1,030,628 | 1,030,629 | u006472158 | cpp |
p03242 | #include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
// typedef long double ldouble;
using Graph = vector<vector<int>>;
// int ctoi(const char c){
// if('0' <= c && c <= '9') return (c-'0')... | #include <bits/stdc++.h>
#define INF 2e9
#define MOD 1000000007
#define MOD9 998244353
#define intMAX 51000;
#define PI 3.14159265359
using namespace std;
typedef long long llong;
// typedef long double ldouble;
using Graph = vector<vector<int>>;
// int ctoi(const char c){
// if('0' <= c && c <= '9') return (c-'0')... | [] | 1,030,630 | 1,030,631 | u108484707 | cpp |
p03242 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
constexpr char ln = '\n';
constexpr ... | [
"literal.number.change",
"io.output.change"
] | 1,030,632 | 1,030,633 | u486105630 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '1')
s[i] = '9';
if (s[i] == '9')
s[i] = '1';
}
cout << s << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '1')
s[i] = '9';
else if (s[i] == '9')
s[i] = '1';
}
cout << s << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,634 | 1,030,635 | u524568016 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << 1100 - N << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
cout << 1110 - N << endl;
} | [
"literal.number.change",
"io.output.change"
] | 1,030,636 | 1,030,637 | u045289115 | cpp |
p03242 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == 1)
cout << 9;
else if (n[i] == 9)
cout << 1;
else
cout << n[i];
}
cout << endl;
}
|
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == '1')
cout << 9;
else if (n[i] == '9')
cout << 1;
else
cout << n[i];
}
cout << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 1,030,638 | 1,030,639 | u922449177 | cpp |
p03242 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include... | [] | 1,030,642 | 1,030,643 | u396266329 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1') {
cout << 9 << flush;
} else if (s[i] == '9') {
cout << 1 << flush;
}
cout << s[i] << flush;
}
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1') {
cout << 9 << flush;
} else if (s[i] == '9') {
cout << 1 << flush;
} else {
cout << s[i] << flush;
}
}
cout << endl;
} | [
"control_flow.branch.else.add"
] | 1,030,644 | 1,030,645 | u225777148 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
cout << (s[i] == 1 ? 9 : 1);
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
cout << (s[i] == '1' ? 9 : 1);
}
return 0;
} | [] | 1,030,646 | 1,030,647 | u000770457 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S[i] == '1')
S[i] = '9';
if (S[i] == '9')
S[i] = '1';
}
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S[i] == '1')
S[i] = '9';
else if (S[i] == '9')
S[i] = '1';
}
cout << S << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,648 | 1,030,649 | u983681697 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S[i] == '0')
S[i] = '9';
if (S[i] == '9')
S[i] = '0';
}
cout << S << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S[i] == '1')
S[i] = '9';
else if (S[i] == '9')
S[i] = '1';
}
cout << S << endl;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"assignment.value.change"
] | 1,030,650 | 1,030,649 | u983681697 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main() {
string n;
cin >> n;
if (n[0] == '1')
n[0] = '9';
if (n[0] == '9')
n[0] = '1';
if (n[1] == '1')
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
#define VL vector<ll>
#define INF 100000000
typedef long long ll;
int main() {
string n;
cin >> n;
if (n[0] == '1')
n[0] = '9';
else if (n[0] == '9')
n[0] = '1';
if (n[1] == '1... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,653 | 1,030,654 | u829403090 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define rep11(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++... | [] | 1,030,659 | 1,030,660 | u338193317 | cpp |
p03242 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define PI 3.14159265359
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mp make_pair
#define all(v) v.begin... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
#define PI 3.14159265359
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define mp make_pair
#define all(v) v.begin... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 1,030,667 | 1,030,668 | u545938555 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
in... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define PI 3.14159265358979323846
constexpr int INF = numeric_limits<int>::max() / 2;
constexpr long long INFL = numeric_limits<long long>::max() / 2;
constexpr int MOD = 1000000007;
using Graph = vector<vector<int>>;
in... | [
"control_flow.branch.if.condition.change"
] | 1,030,669 | 1,030,670 | u093973314 | cpp |
p03242 | #include <iostream>
using namespace std;
void ABC110(void);
void ABC111(void);
void ABC112(void);
void ABC113(void);
void ABC114(void);
void ABC115(void);
void ABC116(void);
void ABC117(void);
void ABC118(void);
void ABC119(void);
int main(void) { ABC111(); }
void ABC111() {
string s;
cin >> s;
for (int i = 0; ... | #include <iostream>
using namespace std;
void ABC110(void);
void ABC111(void);
void ABC112(void);
void ABC113(void);
void ABC114(void);
void ABC115(void);
void ABC116(void);
void ABC117(void);
void ABC118(void);
void ABC119(void);
int main(void) { ABC111(); }
void ABC111() {
string s;
cin >> s;
for (int i = 0; ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,674 | 1,030,675 | u225660136 | cpp |
p03242 | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = long long;
#define pi 3.1415926
int a[3];
int main() {
int n;
cin >> n;
int j = n % 10;
int d = n / 10;
int s = n / 100;
if (j == 9)
j = 1;
else
j = 9;
if (d == 9)
d = 1;
else
d = 9;
if (s =... | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
using ll = long long;
#define pi 3.1415926
int a[3];
int main() {
int n;
cin >> n;
int j = n % 10;
int d = (n % 100) / 10;
int s = n / 100;
if (j == 9)
j = 1;
else
j = 9;
if (d == 9)
d = 1;
else
d = 9;
... | [] | 1,030,676 | 1,030,677 | u746310630 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
const int MOD = 1e9 + 7;
const int INF = 1e15;
signed main() {
string S;
cin >> S;
REP(i, 3) {
if (S[i] == '1')
S[i] = 9;
else
S[i] = 1... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
const int MOD = 1e9 + 7;
const int INF = 1e15;
signed main() {
string S;
cin >> S;
REP(i, 3) {
if (S[i] == '1')
S[i] = '9';
else
S[i] =... | [] | 1,030,678 | 1,030,679 | u342075214 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '1') {
s[i] == '9';
}
if (s[i] == '9') {
s[i] == '1';
}
}
cout << s << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '1') {
s[i] = '9';
} else if (s[i] == '9') {
s[i] = '1';
}
}
cout << s << endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,684 | 1,030,685 | u569361260 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int i;
string s;
cin >> s;
for (i = 0; i < 3; i++) {
if (s.at(i) == '9') {
s.at(i) = '1';
} else {
s.at(i) = '9';
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int i;
string s;
cin >> s;
for (i = 0; i < 3; i++) {
if (s.at(i) == '9') {
s.at(i) = '1';
} else {
s.at(i) = '9';
}
}
cout << s;
}
| [] | 1,030,686 | 1,030,687 | u130651752 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == 1) {
cout << '9';
} else {
cout << '1';
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '1') {
cout << '9';
} else {
cout << '1';
}
}
} | [
"control_flow.branch.if.condition.change"
] | 1,030,692 | 1,030,693 | u492660436 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << 1100 - n << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << 1110 - n << endl;
return 0;
} | [
"literal.number.change",
"io.output.change"
] | 1,030,700 | 1,030,701 | u933962236 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
type... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define fin(ans) cout << (ans) << endl;
#define blank(ans) cout << (ans) << " ";
#define mp(p, q) make_pair(p, q)
#define pb(n) push_back(n)
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef long long lli;
type... | [
"call.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"call.add"
] | 1,030,702 | 1,030,703 | u743889070 | cpp |
p03242 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
long long gcd(long long a, long long b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
if (n > 500... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
long long gcd(long long a, long long b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
if (n > 500... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,030,708 | 1,030,709 | u088751997 | cpp |
p03242 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
long long gcd(long long a, long long b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
if (n > 500... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
long long gcd(long long a, long long b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
int main() {
int n;
cin >> n;
if (n > 500... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,030,710 | 1,030,709 | u088751997 | cpp |
p03242 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef p... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef p... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,711 | 1,030,712 | u425758699 | cpp |
p03242 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef p... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
typedef long long ll;
typedef vector<vector<ll>> vvl;
typedef vector<ll> vl;
typedef vector<vector<char>> vvc;
typedef vector<char> vc;
typedef p... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,713 | 1,030,712 | u425758699 | cpp |
p03242 | // 失敗するからこそ
// そこから立ち向かって行く強さがあってそんな強さが本当の強さだと私は思うから
// ぜったいあきらめない
#if defined(DAIJOBU)
#include "/home/ichigo/includes.hpp"
#include "PP.hpp"
#define deb(x...) cerr << "[" << #x << "] = " << x << "\n";
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif
#define mp make_pair
#define mt make_tuple
#define fi first
#... | // 失敗するからこそ
// そこから立ち向かって行く強さがあってそんな強さが本当の強さだと私は思うから
// ぜったいあきらめない
#if defined(DAIJOBU)
#include "/home/ichigo/includes.hpp"
#include "PP.hpp"
#define deb(x...) cerr << "[" << #x << "] = " << x << "\n";
#else
#include <bits/stdc++.h>
#define deb(x...)
#endif
#define mp make_pair
#define mt make_tuple
#define fi first
#... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,030,728 | 1,030,729 | u461913494 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
string N;
cin >> N;
for (int i = 0; i < N.length(); i++) {
if (N[i] == '1')
N[i] = '9';
if (N[i] == '9')
N[i] = '1';
}
cout << N << endl;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string N;
cin >> N;
for (int i = 0; i < N.length(); i++) {
if (N[i] == '1')
N[i] = '9';
else if (N[i] == '9')
N[i] = '1';
}
cout << N << endl;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,734 | 1,030,735 | u057617112 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '9')
s.at(i) = '1';
else
s.at(i) = '9';
}
cout << s.at(0) << s.at(1) << s.at(2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '9')
s.at(i) = '1';
else
s.at(i) = '9';
}
cout << s.at(0) << s.at(1) << s.at(2) << endl;
}
| [] | 1,030,736 | 1,030,737 | u037563046 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vs = vector<string>;
using vb = vector<bool>;
using vl = vector<ll>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#def... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vd = vector<double>;
using vvd = vector<vd>;
using vc = vector<char>;
using vs = vector<string>;
using vb = vector<bool>;
using vl = vector<ll>;
#define rep(i, x, n) for (int i = x; i < n; i++)
#def... | [
"control_flow.branch.if.condition.change"
] | 1,030,739 | 1,030,740 | u688825490 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define P pair<ll, ll>
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
rep(i, 3) {
if (s[i] == '... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define lvector vector<ll>
#define P pair<ll, ll>
#define rep(i, n) for (ll(i) = 0; (i) < (n); ++(i))
#define print(a) cout << (a) << endl
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string s;
cin >> s;
rep(i, 3) {
if (s[i] == '... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,030,743 | 1,030,744 | u894339989 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '1') {
s.at(i) = '9';
}
if (s.at(i) == '9') {
s.at(i) = '1';
}
}
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s.at(i) == '1') {
s.at(i) = '9';
} else if (s.at(i) == '9') {
s.at(i) = '1';
}
}
cout << s << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,751 | 1,030,752 | u550374978 | cpp |
p03242 | #include <iostream>
using namespace std;
int main(void) {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == '1') {
n[i] = '9';
}
if (n[i] == '9') {
n[i] = '1';
}
}
cout << n << endl;
return 0;
} | #include <iostream>
using namespace std;
int main(void) {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == '1') {
n[i] = '9';
} else if (n[i] == '9') {
n[i] = '1';
}
}
cout << n << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,753 | 1,030,754 | u793856757 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == '1')
s[0] = '9';
else if (s[0] == '9')
s[0] == '1';
if (s[1] == '1')
s[1] = '9';
else if (s[1] == '9')
s[1] == '1';
if (s[2] == '1')
s[2] = '9';
else if (s[2] == '9')
s[2] == ... | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == '1')
s[0] = '9';
else if (s[0] == '9')
s[0] = '1';
if (s[1] == '1')
s[1] = '9';
else if (s[1] == '9')
s[1] = '1';
if (s[2] == '1')
s[2] = '9';
else if (s[2] == '9')
s[2] = '1'... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,030,757 | 1,030,758 | u180436681 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
for (int i = 0; i < 3; i++) {
if (a.at(i) == 1)
cout << 9;
else
cout << 1;
}
cout << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
for (int i = 0; i < 3; i++) {
if (a.at(i) == '1')
cout << 9;
else
cout << 1;
}
cout << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 1,030,761 | 1,030,762 | u811472478 | cpp |
p03242 | // author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long... | // author:luckYrat(twitter:@luckYrat_)
//#include <bits/stdc++.h>
// def
#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
// array
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
using ll = long... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,030,763 | 1,030,764 | u466161487 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
for (int i = 0; i < 3; i++) {
int n;
cin >> n;
if (n == '1') {
cout << 9;
} else {
cout << 1;
}
}
cout << endl;
}
| #include <iostream>
using namespace std;
int main() {
for (int i = 0; i < 3; i++) {
char n;
cin >> n;
if (n == '1') {
cout << 9;
} else {
cout << 1;
}
}
cout << endl;
}
| [
"variable_declaration.type.primitive.change"
] | 1,030,765 | 1,030,766 | u600215903 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
for (int i = 0; i < 3; i++) {
int n;
cin >> n;
if (n == '1') {
cout << 9;
} else {
cout << 1;
}
}
cout << endl;
}
| #include <iostream>
using namespace std;
int main() {
for (int i = 0; i < 3; i++) {
char n;
cin >> n;
if (n == '1') {
cout << 9;
} else {
cout << 1;
}
}
cout << endl;
} | [
"variable_declaration.type.primitive.change"
] | 1,030,765 | 1,030,767 | u600215903 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == 1)
n[i] = '9';
else
n[i] = '1';
}
cout << n << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == '1')
n[i] = '9';
else
n[i] = '1';
}
cout << n << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 1,030,770 | 1,030,771 | u105533331 | cpp |
p03242 | #include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string X;
cin >> X;
for (int i = 0; i < 3; i++) {
if (X[i] = '1')
X[i] = '9';
else if (X[i] = '9')
X[i] = '1';
}
cout << X << endl;
return 0;
}
| #include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string X;
cin >> X;
for (int i = 0; i < 3; i++) {
if (X[i] == '1')
X[i] = '9';
else if (X[i] == '9')
X[i] = '1';
}
cout << X << endl;
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,030,773 | 1,030,774 | u563743611 | cpp |
p03242 | #include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string X;
cin >> X;
for (int i = 0; i < 3; i++) {
if (X[i] = '1')
X[i] = '9';
if (X[i] = '9')
X[i] = '1';
}
cout << X << endl;
return 0;
}
| #include <iomanip>
#include <iostream>
#include <string>
using namespace std;
int main(void) {
string X;
cin >> X;
for (int i = 0; i < 3; i++) {
if (X[i] == '1')
X[i] = '9';
else if (X[i] == '9')
X[i] = '1';
}
cout << X << endl;
return 0;
}
| [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,775 | 1,030,774 | u563743611 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> v;
while (n != 0) {
if (n % 10 == 1)
v.push_back(9);
else if (n % 10 == 9)
v.push_back(1);
else
v.push_back(n % 10);
}
int i, s = v.size();
for (i = s - 1; i >= 0; --i)
pri... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<int> v;
while (n != 0) {
if (n % 10 == 1)
v.push_back(9);
else if (n % 10 == 9)
v.push_back(1);
else
v.push_back(n % 10);
n /= 10;
}
int i, s = v.size();
for (i = s - 1; i >= 0... | [
"assignment.add"
] | 1,030,778 | 1,030,779 | u033208015 | cpp |
p03242 | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using na... | #include <algorithm>
#include <cctype>
#include <cstdlib>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using na... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,786 | 1,030,787 | u000113982 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c = 0;
a = n % 10;
n = n / 10;
b = n % 10;
n = n / 10;
c = n % 10;
if (a == 1) {
a = 9;
}
if (a == 9) {
a = 1;
}
if (b == 1) {
b = 9;
}
if (b == 9) {
b = 1;
}
if (c == 1) {
c = 9;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a, b, c = 0;
a = n % 10;
n = n / 10;
b = n % 10;
n = n / 10;
c = n % 10;
if (a == 1) {
a = 9;
} else if (a == 9) {
a = 1;
}
if (b == 1) {
b = 9;
} else if (b == 9) {
b = 1;
}
if (c == 1) {
c... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,788 | 1,030,789 | u231455327 | cpp |
p03242 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
char a[3];
scanf("%s", a);
for (int i = 0; i < 3; i++) {
if (a[i] == '1')
a[i] == '9';
else
a[i] == '1';
}
printf("%s", a);
return 0;
}
| #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
int main() {
char a[4];
scanf("%s", a);
for (int i = 0; i < 3; i++) {
if (a[i] == '1')
a[i] = '9';
else
a[i] = '1';
}
printf("%s", a);
return 0;
}
| [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,030,792 | 1,030,793 | u201553784 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
for (int i = 0; i < 3; i++) {
int a;
cin >> a;
if (a == 1)
cout << 9;
else
cout << 1;
}
cout << endl;
} | #include <iostream>
using namespace std;
int main() {
for (int i = 0; i < 3; i++) {
char a;
cin >> a;
if (a == '1')
cout << 9;
else
cout << 1;
}
cout << endl;
} | [
"variable_declaration.type.primitive.change",
"control_flow.branch.if.condition.change"
] | 1,030,806 | 1,030,807 | u438313904 | cpp |
p03242 | #include <iostream>
#include <map>
#include <string>
int main(void) {
std::string s;
std::cin >> s;
std::map<char, int> m;
m['1'] = 9;
m['9'] = 1;
for (auto c : s) {
std::cout << m[c] << std::endl;
}
return 0;
}
| #include <iostream>
#include <map>
#include <string>
int main(void) {
std::string s;
std::cin >> s;
std::map<char, int> m;
m['1'] = 9;
m['9'] = 1;
for (auto c : s) {
std::cout << m[c];
}
std::cout << std::endl;
return 0;
}
| [] | 1,030,808 | 1,030,809 | u242680486 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string n;
cin >> n;
rep(i, n.length()) {
if (n[i] == '1')
n[i] = '9';
if (n[i] == '9')
n[i] = '1';
}
cout << n << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
string n;
cin >> n;
rep(i, n.length()) {
if (n[i] == '1')
n[i] = '9';
else if (n[i] == '9')
n[i] = '1';
}
cout << n << endl;
return 0;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,817 | 1,030,818 | u561143568 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define PB push_back
#define _SAD() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define SZ(s) s.size()
#define SRT(x, y) sort(x, x + y)
#define REV(a, b) reverse(a, a + b)
#define VSRT(x) sort(x.begin(), x.end())
#define VREV(x) re... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define nl "\n"
#define PB push_back
#define _SAD() ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define SZ(s) s.size()
#define SRT(x, y) sort(x, x + y)
#define REV(a, b) reverse(a, a + b)
#define VSRT(x) sort(x.begin(), x.end())
#define VREV(x) re... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.add",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,821 | 1,030,822 | u351012095 | cpp |
p03242 | #include <bits/stdc++.h>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S.at(i) == '1') {
S.at(i) = '9';
continue;
}
if (S.at(i) == '1') {
S.at(i) =... | #include <bits/stdc++.h>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S.at(i) == '1') {
S.at(i) = '9';
continue;
}
if (S.at(i) == '9') {
S.at(i) =... | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,030,831 | 1,030,832 | u590927341 | cpp |
p03242 | #include <bits/stdc++.h>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S.at(i) == '1') {
S.at(i) = '9';
}
if (S.at(i) == '9') {
S.at(i) = '1';
}
}
... | #include <bits/stdc++.h>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
string S;
cin >> S;
for (int i = 0; i < 3; i++) {
if (S.at(i) == '1') {
S.at(i) = '9';
continue;
}
if (S.at(i) == '9') {
S.at(i) =... | [] | 1,030,833 | 1,030,832 | u590927341 | cpp |
p03242 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,030,834 | 1,030,835 | u552122040 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n.at(i) == '1')
n.at(i) = '9';
if (n.at(i) == '9')
n.at(i) = '1';
}
cout << n << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n.at(i) == '1')
n.at(i) = '9';
else if (n.at(i) == '9')
n.at(i) = '1';
}
cout << n << endl;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,838 | 1,030,839 | u113298224 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
#define INF (int)(1e9)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, start, end) for (int i = (start); i <= (end); i++)
#define all(n) begin(n), end(n)... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
#define INF (int)(1e9)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, start, end) for (int i = (start); i <= (end); i++)
#define all(n) begin(n), end(n)... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,849 | 1,030,850 | u959682820 | cpp |
p03242 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 111) {
cout << 999;
} else if (n == 119) {
cout << 991;
} else if (191) {
cout << 919;
} else if (911) {
cout << 199;
} else if (n == 991) {
cout << 119;
} else if (n == 919) {
cout <... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 111) {
cout << 999;
} else if (n == 119) {
cout << 991;
} else if (n == 191) {
cout << 919;
} else if (n == 911) {
cout << 199;
} else if (n == 991) {
cout << 119;
} else if (n == 919) {
... | [
"control_flow.branch.if.condition.change"
] | 1,030,863 | 1,030,864 | u596970915 | cpp |
p03242 | #include <cstdio>
#include <cstring>
char a[10];
int main() {
scanf("%s", a + 1);
for (int i = 1; i <= strlen(a); i++) {
if (a[i] == '1')
printf("9");
else
printf("1");
}
printf("\n");
return 0;
} | #include <cstdio>
#include <cstring>
char a[10];
int main() {
scanf("%s", a + 1);
for (int i = 1; i <= strlen(a + 1); i++) {
if (a[i] == '1')
printf("9");
else
printf("1");
}
printf("\n");
return 0;
} | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,030,867 | 1,030,868 | u235218622 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
string s;
int a[] = {9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
int main() {
cin >> s;
cout << a[s[2] - '0'] << a[s[1] - '0'] << a[s[0] - '0'] << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string s;
int a[] = {9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
int main() {
cin >> s;
cout << a[s[0] - '0'] << a[s[1] - '0'] << a[s[2] - '0'] << '\n';
return 0;
} | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,030,869 | 1,030,870 | u699904147 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
string s;
char a[] = {9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
int main() {
cin >> s;
cout << a[s[2] - '0'] << a[s[1] - '0'] << a[s[0] - '0'] << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
string s;
int a[] = {9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1};
int main() {
cin >> s;
cout << a[s[0] - '0'] << a[s[1] - '0'] << a[s[2] - '0'] << '\n';
return 0;
} | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,030,871 | 1,030,870 | u699904147 | cpp |
p03242 | // shara's here
#include <bits/stdc++.h>
using namespace std;
typedef int q;
typedef double w;
typedef string s;
typedef long long ll;
q main() {
q a;
cin >> a;
q s[2];
s[0] = a % 10;
s[1] = (a / 10) % 10;
s[2] = (a / 100 % 10);
q x = 0;
for (x; x <= 2; x++) {
if (s[x] == 9) {
s[x] = 1;
} ... | // shara's here
#include <bits/stdc++.h>
using namespace std;
typedef int q;
typedef double w;
typedef string s;
typedef long long ll;
q main() {
q a;
cin >> a;
q s[3];
s[0] = a % 10;
s[1] = (a / 10) % 10;
s[2] = (a / 100 % 10);
q x = 0;
for (x; x <= 2; x++) {
if (s[x] == 9) {
s[x] = 1;
} ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 1,030,872 | 1,030,873 | u470490204 | cpp |
p03242 | #include <bits/stdc++.h>
#define rep(var, cnt) for (int(var) = 0; (var) < (int)(cnt); ++(var))
#define Rep(var, init, cnt) for (int(var) = (init); (var) < (int)(cnt); ++(var))
#define ran(var, vec) for (auto &(var) : (vec))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define SORT(v) s... | #include <bits/stdc++.h>
#define rep(var, cnt) for (int(var) = 0; (var) < (int)(cnt); ++(var))
#define Rep(var, init, cnt) for (int(var) = (init); (var) < (int)(cnt); ++(var))
#define ran(var, vec) for (auto &(var) : (vec))
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define SORT(v) s... | [
"io.output.change"
] | 1,030,878 | 1,030,879 | u143572112 | cpp |
p03242 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
int main() {
string N;
cin >> N;
for (int i = 0; i < N.size(); i++) {
if (N[i] == '1')
N[i] == '9';
else if (N[i] == '9')
N[i] == '1';
}
cout << N << e... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <stdexcept>
#include <string>
#include <vector>
using namespace std;
int main() {
string N;
cin >> N;
for (int i = 0; i < N.size(); i++) {
if (N[i] == '1')
N[i] = '9';
else if (N[i] == '9')
N[i] = '1';
}
cout << N << end... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,030,880 | 1,030,881 | u163149221 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | #include <bits/stdc++.h>
using namespace std;
#define ll long long // long long省略
#define pb push_back // push_back省略
#define mp make_pair // make_pair省略
#define fi first // first省略
#define se second // second省略
#define itn int // int誤字保険
#define count cout // cout誤字保険
#define vecotr vector // vect... | [
"literal.number.change",
"io.output.change"
] | 1,030,886 | 1,030,887 | u547754910 | cpp |
p03242 | #include <bits/stdc++.h>
#define repeat(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string n;
cin >> n;
repeat(i, 3) n[i] == 1 ? n[i] = 9 : n[i] = 1;
string ans = n;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define repeat(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string n;
cin >> n;
repeat(i, 3) n[i] == '1' ? n[i] = '9' : n[i] = '1';
string ans = n;
cout << ans << endl;
}
| [] | 1,030,903 | 1,030,904 | u726060136 | cpp |
p03242 | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, l... | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <iomanip>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, l... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,030,917 | 1,030,918 | u422558819 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.