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 | #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",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,919 | 1,030,918 | u422558819 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = (int)(0); i < (int)(n); ++i)
#define reps(i, n) for (int i = (int)(1); i <= (int)(n); ++i)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i > 0; i--)
#define irep(i, m, n) for (int i = ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change"
] | 1,030,925 | 1,030,926 | u530107518 | cpp |
p03242 | #include <bits/stdc++.h>
#define debug(x) cerr << "\n" << #x << " = " << x << ".\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define print(xx) cout << (xx) << endl
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vint;
const int INF = ((1LL << ... | #include <bits/stdc++.h>
#define debug(x) cerr << "\n" << #x << " = " << x << ".\n"
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define print(xx) cout << (xx) << endl
using namespace std;
#define int long long
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vint;
const int INF = ((1LL << ... | [
"call.add",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,030,947 | 1,030,948 | u265065462 | 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) {
a.at(i) = '9';
} else {
a.at(i) = '1';
}
}
cout << a << 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') {
a.at(i) = '9';
} else {
a.at(i) = '1';
}
}
cout << a << endl;
} | [
"control_flow.branch.if.condition.change"
] | 1,030,957 | 1,030,958 | u330025192 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
int buff = 0;
for (int i = 0; i < 3; i++) {
buff = n % 10;
n = n % 10;
if (buff == 1) {
buff = 9;
} else {
buff = 1;
}
ans += buff * pow(10, i);
}
cout << ans << endl;
return 0;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
int buff = 0;
for (int i = 0; i < 3; i++) {
buff = n % 10;
n = n / 10;
if (buff == 1) {
buff = 9;
} else {
buff = 1;
}
ans += buff * pow(10, i);
}
cout << ans << endl;
return 0;... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,030,964 | 1,030,965 | u084069244 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
int buff = 0;
for (int i = 0; i < 3; i++) {
buff = n % 10;
if (buff == 1) {
buff = 9;
} else {
buff = 1;
}
ans += buff * pow(10, i);
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int ans = 0;
int buff = 0;
for (int i = 0; i < 3; i++) {
buff = n % 10;
n = n / 10;
if (buff == 1) {
buff = 9;
} else {
buff = 1;
}
ans += buff * pow(10, i);
}
cout << ans << endl;
return 0;... | [
"assignment.add"
] | 1,030,966 | 1,030,965 | u084069244 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a[5];
scanf("%s", a);
for (int i = 0; i != '\0'; i++) {
if (a[i] == '1') {
a[i] = '9';
} else if (a[i] == '9') {
a[i] = '1';
}
}
printf("%s\n", a);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
char a[5];
scanf("%s", a);
for (int i = 0; a[i] != '\0'; i++) {
if (a[i] == '1') {
a[i] = '9';
} else if (a[i] == '9') {
a[i] = '1';
}
}
printf("%s\n", a);
return 0;
}
| [
"control_flow.loop.for.condition.change"
] | 1,030,967 | 1,030,968 | u264471505 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int i;
string s;
cin >> s;
for (i = 0; i < 3; i++) {
if (s.at(i) == '1')
s.at(i) = 9;
else
s.at(i) = 1;
}
cout << s << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int i;
string s;
cin >> s;
for (i = 0; i < 3; i++) {
if (s.at(i) == '1')
s.at(i) = '9';
else
s.at(i) = '1';
}
cout << s << endl;
return 0;
} | [] | 1,030,976 | 1,030,977 | u088895504 | cpp |
p03242 | #include <bits/stdc++.h>
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define sort(a) sort((a).begin(), (a).end())
#define rev(a) reverse((a).begin(), (a).end())
using db = double;
using namespace std;
typedef long long ll;
int main(... | #include <bits/stdc++.h>
#define fi first
#define se second
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define sort(a) sort((a).begin(), (a).end())
#define rev(a) reverse((a).begin(), (a).end())
using db = double;
using namespace std;
typedef long long ll;
int main(... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,030,980 | 1,030,981 | u702457163 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i <= 2; i++) {
if (n.at(i) == 1) {
cout << 9;
} else {
cout << 1;
}
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i <= 2; i++) {
if (n.at(i) == '1') {
cout << 9;
} else {
cout << 1;
}
}
} | [
"control_flow.branch.if.condition.change"
] | 1,030,984 | 1,030,985 | u910900288 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
for (int i = 0; i < a.size(); i++) {
if (a.at(i) == '9')
a.at(i) = 1;
else
a.at(i) = 9;
}
cout << a << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
for (int i = 0; i < a.size(); i++) {
if (a.at(i) == '9')
a.at(i) = '1';
else
a.at(i) = '9';
}
cout << a << endl;
}
| [] | 1,030,986 | 1,030,987 | u298768617 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (char c : s) {
cout << ('1' + '9' - c);
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (char c : s) {
cout << (char)('1' + '9' - c);
}
return 0;
} | [
"type_conversion.add"
] | 1,030,990 | 1,030,991 | u207460172 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[0] == '1')
n[0] = '9';
else
n[0] = '1';
}
cout << n << endl;
return 0;
} | #include <iostream>
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;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 1,030,994 | 1,030,995 | u204523044 | cpp |
p03242 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
string n;
cin >> n;
rep(i, n.length()) {
if (n[i] == '1') {
cout << 9;
} else {
cout << 0;
}
}
cout << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
string n;
cin >> n;
rep(i, n.length()) {
if (n[i] == '1') {
cout << 9;
} else {
cout << 1;
}
}
cout << endl;
return 0;
}
| [
"literal.number.change",
"io.output.change"
] | 1,030,996 | 1,030,997 | u905170328 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int hun = n / 100;
int ten = (n - hun * 100) / 10;
int one = (n - hun * 100) % 10;
// cout << hun <<ten << one;
if (hun == 1) {
hun = 9;
} else if (hun == 9) {
hun == 1;
}
if (ten == 1) {
ten = 9;
} else if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int hun = n / 100;
int ten = (n - hun * 100) / 10;
int one = (n - hun * 100) % 10;
// cout << hun <<ten << one;
if (hun == 1) {
hun = 9;
} else if (hun == 9) {
hun = 1;
}
if (ten == 1) {
ten = 9;
} else if (t... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,030,998 | 1,030,999 | u154453349 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int hun = n / 100;
int ten = (n - hun * 100) / 10;
int one = (n - hun * 100) % 10;
// cout << hun <<ten << one;
if (hun == 1) {
hun = 9;
} else if (hun == 9) {
hun == 1;
}
if (ten == 1) {
ten = 9;
} else if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int hun = n / 100;
int ten = (n - hun * 100) / 10;
int one = (n - hun * 100) % 10;
// cout << hun <<ten << one;
if (hun == 1) {
hun = 9;
} else if (hun == 9) {
hun = 1;
}
if (ten == 1) {
ten = 9;
} else if (t... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,031,000 | 1,030,999 | u154453349 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << 1100 - N << endl;
} | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
cout << 1110 - N << endl;
} | [
"literal.number.change",
"io.output.change"
] | 1,031,001 | 1,031,002 | u083980875 | cpp |
p03242 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#includ... | [] | 1,031,007 | 1,031,008 | u132033278 | cpp |
p03242 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
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;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
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;
} | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,031,009 | 1,031,010 | u009870106 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i;
for (i = 0; i < 2; i++) {
if (s[i] == '1') {
s[i] = '9';
} else if (s[i] == '9') {
s[i] = '1';
}
}
cout << s << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i;
for (i = 0; i < 3; i++) {
if (s[i] == '1') {
s[i] = '9';
} else if (s[i] == '9') {
s[i] = '1';
}
}
cout << s << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,031,015 | 1,031,016 | u738164318 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i;
for (i = 0; i < 3; i++) {
if (s[i] == '1') {
s[i] = '9';
} else if (s[i] == '9') {
s[i] == '1';
}
}
cout << s << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i;
for (i = 0; i < 3; i++) {
if (s[i] == '1') {
s[i] = '9';
} else if (s[i] == '9') {
s[i] = '1';
}
}
cout << s << endl;
return 0;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,031,017 | 1,031,016 | u738164318 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i;
for (i = 0; i <= 2; ++i) {
if (s[i] == '1') {
s[i] = '9';
} else if (s[i] == '9') {
s[i] == '1';
}
}
cout << s << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i;
for (i = 0; i < 3; i++) {
if (s[i] == '1') {
s[i] = '9';
} else if (s[i] == '9') {
s[i] = '1';
}
}
cout << s << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,031,018 | 1,031,016 | u738164318 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i;
for (i = 0; i <= 2; i++) {
if (s[i] == '1') {
s[i] = '9';
} else if (s[i] == '9') {
s[i] == '1';
}
}
cout << s << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i;
for (i = 0; i < 3; i++) {
if (s[i] == '1') {
s[i] = '9';
} else if (s[i] == '9') {
s[i] = '1';
}
}
cout << s << endl;
return 0;
}
| [
"control_flow.loop.for.condition.change",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,031,019 | 1,031,016 | u738164318 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i;
for (i = 0; i < 2; i++) {
if (s[i] == '1') {
s[i] = '9';
} else if (s[i] == '9') {
s[i] == '1';
}
}
cout << s << endl;
return 0;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
int i;
for (i = 0; i < 3; i++) {
if (s[i] == '1') {
s[i] = '9';
} else if (s[i] == '9') {
s[i] = '1';
}
}
cout << s << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,031,020 | 1,031,016 | u738164318 | 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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll mod2 = 998... | #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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
const ll mod2 = 998... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,022 | 1,031,023 | u759721333 | 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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define toInt(x) (x - '0')
#define vi... | #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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define toInt(x) (x - '0')
#define vi... | [
"control_flow.branch.if.condition.change"
] | 1,031,036 | 1,031,037 | u075520262 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == 9)
cout << 1;
else
cout << 9;
}
cout << 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] == '9')
cout << 1;
else
cout << 9;
}
cout << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 1,031,040 | 1,031,041 | u677400065 | 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;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,031,046 | 1,031,047 | u264265458 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
// char型から数値型に変換する関数（z.at(i)などに使用）
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
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') {
... | #include <bits/stdc++.h>
using namespace std;
// char型から数値型に変換する関数（z.at(i)などに使用）
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
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... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"control_flow.continue.add"
] | 1,031,048 | 1,031,049 | u607229598 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string n;
cin >> n;
for (char c : n) {
cout << '1' + '9' - c;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
string n;
cin >> n;
for (char c : n) {
cout << (char)('1' + '9' - c);
}
return 0;
}
| [
"type_conversion.add"
] | 1,031,052 | 1,031,053 | u319179101 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> a;
for (int i = 0; i < 3; i++) {
cin >> a.at(i);
}
for (int i = 0; i < 3; i++) {
if (a.at(i) == '1') {
cout << '9';
} else {
cout << '1';
}
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<char> a(3);
for (int i = 0; i < 3; i++) {
cin >> a.at(i);
}
for (int i = 0; i < 3; i++) {
if (a.at(i) == '1') {
cout << '9';
} else {
cout << '1';
}
}
cout << endl;
return 0;
} | [
"call.arguments.add"
] | 1,031,054 | 1,031,055 | u432194969 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (char c : n) {
cout << (c == 1 ? 9 : 1);
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (char c : n) {
cout << (c == '1' ? 9 : 1);
}
return 0;
} | [] | 1,031,060 | 1,031,061 | u653388379 | cpp |
p03242 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '1') {
s[i] = 9;
} else {
s[i] = 1;
}
}
cout << s << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '1') {
s[i] = '9';
} else {
s[i] = '1';
}
}
cout << s << endl;
}
| [] | 1,031,062 | 1,031,063 | u401900157 | 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')
s[i] == '9';
else
s[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 < s.size(); i++) {
if (s[i] == '1')
s[i] = '9';
else
s[i] = '1';
}
cout << s << endl;
return 0;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,031,064 | 1,031,065 | u371462599 | cpp |
p03242 | #include <cstdio>
int main() {
int n[4];
scanf("%s", n);
for (int i = 0; i < 3; i++) {
if (n[i] == '1')
n[i] = '9';
else
n[i] = '1';
}
printf("%s\n", n);
return 0;
} | #include <cstdio>
int main() {
char n[4];
scanf("%s", n);
for (int i = 0; i < 3; i++) {
if (n[i] == '1')
n[i] = '9';
else
n[i] = '1';
}
printf("%s\n", n);
return 0;
} | [
"variable_declaration.type.primitive.change"
] | 1,031,076 | 1,031,077 | u980205854 | cpp |
p03242 | #include <algorithm>
#include <assert.h>
#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 <memory>
#includ... | #include <algorithm>
#include <assert.h>
#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 <memory>
#includ... | [
"expression.operation.binary.remove"
] | 1,031,095 | 1,031,096 | u723512447 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int nh, nt, nm;
nh = n / 100;
nt = (n % 100) / 10;
nm = n % 10;
if (nh == 1)
nh = 9;
else
nh = 1;
if (nt == 1)
nt = 9;
else
nt == 1;
if (nm == 1)
nm = 9;
else
nm = 1;
cout << nh * 100 + nt * 10 ... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int nh, nt, nm;
nh = n / 100;
nt = (n % 100) / 10;
nm = n % 10;
if (nh == 1)
nh = 9;
else
nh = 1;
if (nt == 1)
nt = 9;
else
nt = 1;
if (nm == 1)
nm = 9;
else
nm = 1;
cout << nh * 100 + nt * 10 +... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,031,116 | 1,031,117 | u420421811 | 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;
} else {
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 {
n.at(i) = '1';
}
}
cout << n << endl;
}
| [] | 1,031,124 | 1,031,125 | u646051775 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == 1)
cout << "9";
else {
cout << "1";
}
}
cout << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < 3; i++) {
if (n[i] == '1')
cout << "9";
else {
cout << "1";
}
}
cout << endl;
return 0;
} | [
"control_flow.branch.if.condition.change"
] | 1,031,129 | 1,031,130 | u839397805 | cpp |
p03242 | #include <iostream>
using namespace std;
int main(void) {
int n, n1, n2, n3;
cin >> n;
n1 = n % 100 % 10;
n2 = n % 10 / 10;
n3 = n / 100;
if (n1 == 1) {
n1 = 9;
} else {
n1 = 1;
}
if (n2 == 1) {
n2 = 9;
} else {
n2 = 1;
}
if (n3 == 1) {
n3 = 9;
} else {
n3 = 1;
}
c... | #include <iostream>
using namespace std;
int main(void) {
int n, n1, n2, n3;
cin >> n;
n1 = n % 100 % 10;
n2 = n / 10 % 10;
n3 = n / 100;
if (n1 == 1) {
n1 = 9;
} else {
n1 = 1;
}
if (n2 == 1) {
n2 = 9;
} else {
n2 = 1;
}
if (n3 == 1) {
n3 = 9;
} else {
n3 = 1;
}
c... | [
"expression.operation.binary.remove",
"assignment.change"
] | 1,031,133 | 1,031,134 | u884336498 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,031,137 | 1,031,138 | u788341294 | cpp |
p03242 | // ABC111 A-ATCODER BEGINNER CONTEST 999
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
for (int i = 0; i < N.size(); i++) {
if (N.at(0) == '9') {
cout << 1;
} else {
cout << 9;
}
}
cout << endl;
return 0;
} | // ABC111 A-ATCODER BEGINNER CONTEST 999
#include <bits/stdc++.h>
using namespace std;
int main() {
string N;
cin >> N;
for (int i = 0; i < N.size(); i++) {
if (N.at(i) == '9') {
cout << 1;
} else {
cout << 9;
}
}
cout << endl;
return 0;
} | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,031,139 | 1,031,140 | u000598325 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string S;
for (int i = 0; i < 3; i = i + 1) {
if (S[i] == '1') {
S[i] = '9';
} else {
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 = i + 1) {
if (S[i] == '1') {
S[i] = '9';
} else {
S[i] = '1';
}
}
cout << S << endl;
} | [] | 1,031,143 | 1,031,144 | u598073939 | cpp |
p03242 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = int64_t;
#define int ll
#define FOR(i, a, b) for (int i = int(a); i < int(b); i++)
#define REP(i, b) FOR(i, 0, b)
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(x) x.begin(), x.end()
using pi = pair<int, in... | [
"literal.string.change",
"assignment.value.change"
] | 1,031,145 | 1,031,146 | u700484101 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string N;
for (int i = 0; i < 3; i++) {
if (N.at(i) == '1')
cout << 9;
else
cout << 1;
}
cout << 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')
cout << 9;
else
cout << 1;
}
cout << endl;
}
| [] | 1,031,150 | 1,031,151 | u964763428 | cpp |
p03242 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
char n[4];
int i, ans;
cin >> n;
for (i = 0; i < 4; i++) {
if (n[i] = '1')
n[i] = '9';
else
n[i] = '1';
}
ans = atoi(n);
cout << ans;
} | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <vector>
using namespace std;
int main() {
char n[4];
int i, ans;
cin >> n;
for (i = 0; i < 3; i++) {
if (n[i] == '1')
n[i] = '9';
else
n[i] = '1';
}
ans = atoi(n);
cout << ans;
} | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,031,152 | 1,031,153 | u450883456 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
string n;
cin >> n;
for (char c : n) {
if (c == 'i') {
cout << 9;
} else {
cout << 1;
}
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
string n;
cin >> n;
for (char c : n) {
if (c == '1') {
cout << '9';
} else {
cout << '1';
}
}
return 0;
}
| [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 1,031,157 | 1,031,158 | u260131566 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << 1100 - a;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
cout << 1110 - a;
} | [
"literal.number.change",
"io.output.change"
] | 1,031,161 | 1,031,162 | u959539771 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a1, a10, a100;
a1 = n % 10;
a10 = n % 100 - a1;
a100 = n % 1000 - a10 * 10 - a1;
int ans = 0;
if (a100 == 1)
ans += 900;
else
ans += 100;
if (a10 == 1)
ans += 90;
else
ans += 10;
if (a1 == 1)
ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a1, a10, a100;
a1 = n % 10;
a10 = n % 100 - a1;
a100 = n % 1000 - a10 - a1;
int ans = 0;
if (a100 == 100)
ans += 900;
else
ans += 100;
if (a10 == 10)
ans += 90;
else
ans += 10;
if (a1 == 1)
ans +... | [
"expression.operation.binary.remove",
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,031,171 | 1,031,172 | u778347695 | cpp |
p03242 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << 1000 - n << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
cout << 999 + 111 - n << endl;
} | [
"literal.number.change",
"io.output.change"
] | 1,031,179 | 1,031,180 | u317177661 | cpp |
p03242 | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
int n, ans[3];
cin >> n;
ans[0] = n / 100;
n %= 100;
ans[1] = n / 10;
n %= 10;
ans[2] = n;
rep(i, 3) {
if (ans[i] == 1)
ans[i] = 9;
if (ans[i] == 9)
ans[i] = 1;
... | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long
using namespace std;
int main() {
int n, ans[3];
cin >> n;
ans[0] = n / 100;
n %= 100;
ans[1] = n / 10;
n %= 10;
ans[2] = n;
rep(i, 3) {
if (ans[i] == 1)
ans[i] = 9;
else if (ans[i] == 9)
ans[i] ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,181 | 1,031,182 | u180262908 | cpp |
p03242 | #include <cmath>
#include <iostream>
using namespace std;
int rev(int dig, int num) {
if (num == 1)
return pow(10, dig) * 9;
else if (num == 9)
return pow(10, dig);
else
return pow(10, dig) * num;
}
int main() {
int a;
cin >> a;
int ans = 0;
int dig[3];
dig[0] = a % 100;
a /= 10;
dig[1... | #include <cmath>
#include <iostream>
using namespace std;
int rev(int dig, int num) {
if (num == 1)
return pow(10, dig) * 9;
else if (num == 9)
return pow(10, dig);
else
return pow(10, dig) * num;
}
int main() {
int a;
cin >> a;
int ans = 0;
int dig[3];
dig[0] = a % 100 % 10;
a /= 10;
... | [
"assignment.change"
] | 1,031,197 | 1,031,198 | u610253537 | cpp |
p03242 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
int main() {
int n;
cin >> n;
if (n % 10 == 1) {
n += 8;
} else if (n % 10 == 9) {
n -= 8;
}
if (n / 10 % 10 == 1) {
n += 80;
} else if (n ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, x) for (int i = 0; i < (int)(x); i++)
int main() {
int n;
cin >> n;
if (n % 10 == 1) {
n += 8;
} else if (n % 10 == 9) {
n -= 8;
}
if (n / 10 % 10 == 1) {
n += 80;
} else if (n ... | [
"control_flow.branch.if.condition.change"
] | 1,031,210 | 1,031,211 | u412550879 | cpp |
p03242 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (n); ++(i))
using namespace std;
string a;
int main() {
cin >> a;
REP(i, 3) {
if (a[i] = '1')
a[i] ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
#define REP(i, n) for (int i = 0; (i) < (n); ++(i))
using namespace std;
string a;
int main() {
cin >> a;
REP(i, 3) {
if (a[i] == '1')
a[i]... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,031,214 | 1,031,215 | u697232864 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
cout << 1000 - a;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a;
cin >> a;
cout << 1110 - a;
} | [
"literal.number.change",
"io.output.change"
] | 1,031,216 | 1,031,217 | u859897687 | cpp |
p03242 | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int i;
cin >> s;
for (i = 0; i < 3; i++) {
if (s[i] == '1')
s[i] = '9';
if (s[i] == '9')
s[i] = '1';
}
cout << s << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
int i;
cin >> s;
for (i = 0; i < 3; i++) {
if (s[i] == '1')
s[i] = '9';
else if (s[i] == '9')
s[i] = '1';
}
cout << s << endl;
return 0;
} | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,225 | 1,031,226 | u060467857 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define FORR(i, a, b) for (int i ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,239 | 1,031,240 | u239375815 | cpp |
p03242 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
const long long INF = 1LL << 60;
template <class T... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define ll long long
const long long INF = 1LL << 60;
template <class T... | [
"control_flow.branch.if.condition.change"
] | 1,031,251 | 1,031,252 | u051493691 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cout << 1110 - n << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
cout << 1110 - n << endl;
}
| [] | 1,031,253 | 1,031,254 | u057079894 | cpp |
p03242 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
string s;
cin >> s;
if (s[0] == '1') {
s[0] = '9';
}
if (s[0] == '9') {
s[0] = '1';
}
if (s[1] == '1') {
s[1] = '9';
}
if (s[1] == '9... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#define rep(i, n) for (int i = 0; i < n; i++)
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]... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,255 | 1,031,256 | u274962354 | cpp |
p03242 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
cout << 1000 - N << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
cout << 1110 - N << endl;
} | [
"literal.number.change",
"io.output.change"
] | 1,031,257 | 1,031,258 | u570417673 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
const LL LINF = 1e18;
const LL MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
int n100 = n / 100;
int n10 = n % 100 / 10;
int n1 = n % 10;
if (n100 == 9) {
n100 = 1;
} else if (n == 1) {
n100 = 9;
}
if (n10 == 9) {
n10 = 1... | #include <bits/stdc++.h>
using namespace std;
using LL = long long;
const LL LINF = 1e18;
const LL MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
int n100 = n / 100;
int n10 = n % 100 / 10;
int n1 = n % 10;
if (n100 == 9) {
n100 = 1;
} else if (n100 == 1) {
n100 = 9;
}
if (n10 == 9) {
n10 ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,031,265 | 1,031,266 | u580402951 | cpp |
p03242 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using name... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using name... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,272 | 1,031,273 | u802905102 | cpp |
p03242 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using name... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using name... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,274 | 1,031,273 | u802905102 | 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] == '0')
s[i] = '9';
else
s[i] = '0';
}
cout << s << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < 3; i++) {
if (s[i] == '1')
s[i] = '9';
else
s[i] = '1';
}
cout << s << endl;
return 0;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,031,275 | 1,031,276 | u070694244 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9 + 7;
const i64 INF = 1e18 + 7;
signed main() {
int a, b, c, d, n, x, y;
string s, t;
auto Yes = [&](bool t) { cout << (t ? "Yes" : "No") << endl; };
auto YES = [&](bool t) { cout << (t ? "YES" : "NO") << endl; };
auto... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9 + 7;
const i64 INF = 1e18 + 7;
signed main() {
int a, b, c, d, n, x, y;
string s, t;
auto Yes = [&](bool t) { cout << (t ? "Yes" : "No") << endl; };
auto YES = [&](bool t) { cout << (t ? "YES" : "NO") << endl; };
auto... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,031,295 | 1,031,296 | u705918648 | cpp |
p03242 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + 7;
const ll INF = 1e9;
const ll MAXN... | [] | 1,031,301 | 1,031,302 | u700986952 | cpp |
p03242 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
if (n / 100 == 1) {
n += 800;
} else {
n -= 800;
}
if (n % 100 / 10 == 1) {
n += 80;
} else {
n -= 80;
}
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
if (n / 100 == 1) {
n += 800;
} else {
n -= 800;
}
if (n % 100 / 10 == 1) {
n += 80;
} else {
n -= 80;
}
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,031,307 | 1,031,308 | u790502959 | cpp |
p03242 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
//素数判定
inline bool IsPrime(int p) {
if (p == 1)
return false;
for (int i = 2; i <= sqrt(p); i++) {
if (p % i == 0)
return false;
}
return true;
}... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
//素数判定
inline bool IsPrime(int p) {
if (p == 1)
return false;
for (int i = 2; i <= sqrt(p); i++) {
if (p % i == 0)
return false;
}
return true;
}... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,031,313 | 1,031,314 | u461044076 | cpp |
p03242 | #include <bits/stdc++.h>
#define INF INT_MAX / 2;
#define MOD 1000000007
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
string n;
cin >> n;
for (int i = 0; i < n.size(); i++) {
if (n[i] == '1')
n[i] = '9... | #include <bits/stdc++.h>
#define INF INT_MAX / 2;
#define MOD 1000000007
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
string n;
cin >> n;
for (int i = 0; i < n.size(); i++) {
if (n[i] == '1')
n[i] = '9... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,315 | 1,031,316 | u864171425 | cpp |
p03242 |
#include <bits/stdc++.h>
#define INF INT_MAX / 2;
#define MOD 1000000007
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
string n;
cin >> n;
for (int i = 0; i < n.size(); i++) {
if (n[i] == '1')
n[i] = '... | #include <bits/stdc++.h>
#define INF INT_MAX / 2;
#define MOD 1000000007
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
string n;
cin >> n;
for (int i = 0; i < n.size(); i++) {
if (n[i] == '1')
n[i] = '9... | [
"literal.string.change",
"assignment.value.change",
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,317 | 1,031,316 | u864171425 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n / 100 == 1)
cout << '9';
else
cout << '1';
if (n / 10 % 10 == 1)
cout << '9';
else
cout << '1';
if (n % 100 == 1)
cout << '9';
else
cout << '1';
cout << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n / 100 == 1)
cout << '9';
else
cout << '1';
if (n / 10 % 10 == 1)
cout << '9';
else
cout << '1';
if (n % 10 == 1)
cout << '9';
else
cout << '1';
cout << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,031,342 | 1,031,343 | u087361359 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n / 100 == 1)
cout << '9';
else
cout << '1';
if (n / 10 % 10 == 1)
cout << '9';
else
cout << '1';
if (n % 100 == 1)
cout << '9';
else
cout << '1';
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n / 100 == 1)
cout << '9';
else
cout << '1';
if (n / 10 % 10 == 1)
cout << '9';
else
cout << '1';
if (n % 10 == 1)
cout << '9';
else
cout << '1';
cout << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,031,344 | 1,031,343 | u087361359 | cpp |
p03242 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
using namespace std;
int main() {
string s;
for (char x : s) {
if (x == '1')
cout << '9';
else
cout << '1';
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
using namespace std;
int main() {
string s;
cin >> s;
for (char x : s) {
if (x == '1')
cout << '9';
else
cout << '1';
}
return 0;
} | [] | 1,031,346 | 1,031,347 | u511344501 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n / 100 == 1)
cout << '9';
else
cout << '1';
if (n / 10 % 10 == 1)
cout << '9';
else
cout << '1';
if (n % 10)
cout << '9' << endl;
else
cout << '1' << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
if (n / 100 == 1)
cout << '9';
else
cout << '1';
if (n / 10 % 10 == 1)
cout << '9';
else
cout << '1';
if (n % 10 == 1)
cout << '9' << endl;
else
cout << '1' << endl;
} | [
"control_flow.branch.if.condition.change"
] | 1,031,348 | 1,031,349 | u731922057 | cpp |
p03242 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
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;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
int main() {
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;
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,352 | 1,031,353 | u833064541 | cpp |
p03242 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1') {
s[i] == '9';
} else {
s[i] = '1';
}
}
cout << s << endl;
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '1') {
s[i] = '9';
} else {
s[i] = '1';
}
}
cout << s << endl;
}
| [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,031,360 | 1,031,361 | u546943614 | cpp |
p03242 | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repeat(i, s, n) for (int(i) = s; (i) < (n); (i)++)
#define revrep(i, n) for (int(i) = (n)-1; i >= 0; i--)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | #include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repeat(i, s, n) for (int(i) = s; (i) < (n); (i)++)
#define revrep(i, n) for (int(i) = (n)-1; i >= 0; i--)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,362 | 1,031,363 | u817142576 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
string n;
cin >> n;
for (char c : n) {
if (c == 1) {
cout << 9;
} else {
cout << 1;
}
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
string n;
cin >> n;
for (char c : n) {
if (c == '1') {
cout << 9;
} else {
cout << 1;
}
}
return 0;
}
| [
"control_flow.branch.if.condition.change"
] | 1,031,364 | 1,031,365 | u988940834 | cpp |
p03242 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
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;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
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;
}
| [] | 1,031,372 | 1,031,373 | u676578971 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n / 100 == 9)
n -= 800;
else if (n / 100 == 1)
n += 800;
if ((n % 100) / 10 == 9)
n -= 80;
else if ((n % 100) / 10 == 1)
n += 80;
if ((n / 100) % 10 == 9)
n -= 8;
else if ((n / 100) % 10 == 1)
n += 8;
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n / 100 == 9)
n -= 800;
else if (n / 100 == 1)
n += 800;
if ((n % 100) / 10 == 9)
n -= 80;
else if ((n % 100) / 10 == 1)
n += 80;
if ((n % 100) % 10 == 9)
n -= 8;
else if ((n % 100) % 10 == 1)
n += 8;
... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,031,380 | 1,031,381 | u985625318 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n / 100 == 9)
n -= 800;
else if (n / 100 == 1)
n += 800;
if ((n % 100) / 10 == 9)
n -= 80;
else if ((n / 100) / 10 == 1)
n += 80;
if ((n / 100) % 10 == 9)
n -= 8;
else if ((n / 100) % 10 == 1)
n += 8;
... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
if (n / 100 == 9)
n -= 800;
else if (n / 100 == 1)
n += 800;
if ((n % 100) / 10 == 9)
n -= 80;
else if ((n % 100) / 10 == 1)
n += 80;
if ((n % 100) % 10 == 9)
n -= 8;
else if ((n % 100) % 10 == 1)
n += 8;
... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,031,382 | 1,031,381 | u985625318 | 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,031,385 | 1,031,386 | u572077985 | cpp |
p03242 | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
char s[11];
int main() {
scanf("%s", s);
for (int i = 0; s[i]; ++i) {
if (s[i] == '9')
s[i] = '1';
if (s[i] == '1')
s[i] = '9';
}
printf("%s", s);
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long LL;
char s[11];
int main() {
scanf("%s", s);
for (int i = 0; s[i]; ++i) {
if (s[i] == '9')
s[i] = '1';
else if (s[i] == '1')
s[i] = '9';
}
printf("%s", s);
}
| [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,387 | 1,031,388 | u556644523 | cpp |
p03242 | #include <stdio.h>
int main(void) {
int n;
scanf("%d", n);
printf("%d\n", 1110 - n);
return 0;
} | #include <stdio.h>
int main(void) {
int n;
scanf("%d", &n);
printf("%d\n", 1110 - n);
return 0;
}
| [
"expression.operation.unary.reference.add"
] | 1,031,395 | 1,031,396 | u516922881 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
char s[10001];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
for (int i = 1; i <= n; i++)
if (s[i] != '1' && s[i] != '9')
printf("%c", s[i]);
else
printf("%c", '9' - s[i] + 1);
} | #include <bits/stdc++.h>
using namespace std;
char s[10001];
int main() {
scanf("%s", s + 1);
int n = strlen(s + 1);
for (int i = 1; i <= n; i++)
if (s[i] != '1' && s[i] != '9')
printf("%c", s[i]);
else
printf("%c", '9' - s[i] + '1');
} | [
"call.arguments.change"
] | 1,031,397 | 1,031,398 | u024273683 | cpp |
p03242 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,031,404 | 1,031,405 | u574045761 | cpp |
p03242 |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... |
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <uti... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,031,406 | 1,031,405 | u574045761 | cpp |
p03242 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string n;
cin >> n;
for (char c : n) {
if (c == '1') {
cout << 9;
} else {
cout << 1 << endl;
}
}
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
string n;
cin >> n;
for (char c : n) {
if (c == '1') {
cout << 9;
} else {
cout << 1;
}
}
cout << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 1,031,411 | 1,031,412 | u865767009 | cpp |
p03242 | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
... | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
... | [] | 1,031,415 | 1,031,416 | u713333397 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
return 1110 - a;
} | #include <iostream>
using namespace std;
int main() {
int a;
cin >> a;
cout << 1110 - a;
return 0;
} | [
"io.output.change",
"control_flow.return.add",
"control_flow.return.0.add"
] | 1,031,419 | 1,031,418 | u923676814 | cpp |
p03242 | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '0')
cout << 9;
else
cout << 1;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
string s;
cin >> s;
for (int i = 0; i < s.length(); i++) {
if (s[i] == '1')
cout << 9;
else
cout << 1;
}
return 0;
} | [
"literal.string.change",
"control_flow.branch.if.condition.change"
] | 1,031,420 | 1,031,421 | u250514558 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (char i : s) {
if (i == '1')
i = '9';
else if (i == '9')
i = '1';
}
cout << s << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
for (char &i : s) {
if (i == '1')
i = '9';
else if (i == '9')
i = '1';
}
cout << s << "\n";
}
| [] | 1,031,424 | 1,031,425 | u207036582 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < n.size(); i++) {
n[i] = ((n[i] == '0') ? '9' : '0');
}
cout << n << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string n;
cin >> n;
for (int i = 0; i < n.size(); i++) {
n[i] = ((n[i] == '1') ? '9' : '1');
}
cout << n << endl;
return 0;
} | [
"literal.string.change",
"assignment.value.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,031,426 | 1,031,427 | u521992338 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
for (int i = 0; i < a.size(); i++) {
if (a[i] == '1')
a[i] = 'x';
if (a[i] == '9')
a[i] = 'y';
}
for (int i = 0; i < a.size(); i++) {
if (a[i] == 'x')
a[i] = '9';
if (a[i == 'y'])
a[i] = '1';... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
cin >> a;
for (int i = 0; i < a.size(); i++) {
if (a[i] == '1')
a[i] = 'x';
if (a[i] == '9')
a[i] = 'y';
}
for (int i = 0; i < a.size(); i++) {
if (a[i] == 'x')
a[i] = '9';
if (a[i] == 'y')
a[i] = '1';... | [
"control_flow.branch.if.condition.change"
] | 1,031,430 | 1,031,431 | u084014087 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define lim 2e9
#define on 100005
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR for (int i = 1; i <= n; i++)
typedef long long int lo;
typedef pair<int, int> PII;
int n, m, cev, a[100005], vis[on], cevv;
char c;
string s;
stack<int... | #include <bits/stdc++.h>
using namespace std;
#define lim 2e9
#define on 100005
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define FOR for (int i = 1; i <= n; i++)
typedef long long int lo;
typedef pair<int, int> PII;
int n, m, cev, a[100005], vis[on], cevv;
char c;
string s;
stack<int... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,440 | 1,031,441 | u050607149 | cpp |
p03242 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
int main() {
string n;
cin ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
int main() {
string n;
cin ... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,031,446 | 1,031,447 | u003860320 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b;
if (a % 10 == 1) {
b = 9;
} else {
b = 1;
}
if ((a % 100 - a % 10) / 10 == 1) {
b = 90 + b;
} else {
b = 10 + b;
}
if ((a - a & 100) / 100 == 1) {
b = 900 + b;
} else {
b = 100 + b;
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
int b;
if (a % 10 == 1) {
b = 9;
} else {
b = 1;
}
if ((a % 100 - a % 10) / 10 == 1) {
b = 90 + b;
} else {
b = 10 + b;
}
if ((a - a % 100) / 100 == 1) {
b = 900 + b;
} else {
b = 100 + b;
}
cou... | [
"control_flow.branch.if.condition.change"
] | 1,031,452 | 1,031,453 | u664761370 | cpp |
p03242 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define aint(x) (x).begin(), (x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x, y, h, w) x >= 0 && x < h &&y >= 0 && y < w
#define int long lo... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define aint(x) (x).begin(), (x).end()
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define in(x, y, h, w) x >= 0 && x < h &&y >= 0 && y < w
#define int long lo... | [
"literal.string.change",
"assignment.value.change"
] | 1,031,461 | 1,031,462 | u456611841 | 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;
else
cout << 1;
}
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;
else
cout << 1;
}
cout << endl;
} | [
"control_flow.branch.if.condition.change"
] | 1,031,471 | 1,031,472 | u890465662 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.