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 |
|---|---|---|---|---|---|---|---|
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 10)
cout << "error";
else
cout << a + b;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error";
else
cout << a + b;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,716 | 1,368,717 | u798851723 | cpp |
p03697 | #include <iostream>
using namespace std;
main() {
int a, b;
cin >> a >> b;
if (a + b > 10)
cout << "error" << endl;
else
cout << a + b << endl;
return 0;
} | #include <iostream>
using namespace std;
main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
else
cout << a + b << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,720 | 1,368,721 | u305018585 | cpp |
p03697 | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << "error";
else
cout << a + b;
} | #include <algorithm>
#include <fstream>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error";
else
cout << a + b;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,722 | 1,368,723 | u724012411 | cpp |
p03697 | #include <bits/stdc++.h>
#include <numeric>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o... | #include <bits/stdc++.h>
#include <numeric>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define repone(i, n) for (int i = 1; i < (int)(n); ++i)
#define repo(i, o, n) for (int i = o; i < (int)(n); ++i)
#define Rep(j, n) for (int j = 0; j < (int)(n); ++j)
#define Repo(j, o... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,368,739 | 1,368,740 | u893330446 | cpp |
p03697 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, x) for (int i{0}; i < (int)(x); i++)
#define REPC(i, x) for (int i{0}; i <= (int)(x); i++)
#define RR... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <numeric>
#include <queue>
#include <sstream>
#include <string.h>
#include <string>
#include <tuple>
#include <vector>
#define REP(i, x) for (int i{0}; i < (int)(x); i++)
#define REPC(i, x) for (int i{0}; i <= (int)(x); i++)
#define RR... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,743 | 1,368,744 | u815659544 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << a + b << endl;
else
cout << "errer" << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << a + b << endl;
else
cout << "error" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,368,745 | 1,368,746 | u219041750 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll a, b;
cin >> a >> b;
if (a + b > 10) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int main() {
ll a, b;
cin >> a >> b;
if (a + b >= 10) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,758 | 1,368,759 | u753615299 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int a;
int b;
int main() {
cin >> a;
cin >> b;
int n = a + b;
if (n > 10) {
cout << "error" << endl;
return 0;
}
cout << n << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int a;
int b;
int main() {
cin >> a;
cin >> b;
int n = a + b;
if (n >= 10) {
cout << "error" << endl;
return 0;
}
cout << n << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,774 | 1,368,775 | u686824077 | cpp |
p03697 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
int main() {
int a, b;
cin >> a >> b;
if (a + b <= 10)
cout << a + ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << a + b... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,778 | 1,368,779 | u538125576 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, num;
cin >> a >> b;
num = a + b;
if (num <= 10) {
cout << num << endl;
} else {
cout << "error" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, num;
cin >> a >> b;
num = a + b;
if (num < 10) {
cout << num << endl;
} else {
cout << "error" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,798 | 1,368,799 | u223133214 | cpp |
p03697 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
if (a + b < 9)
cout << a + b << endl;
else
cout << "error";
}
| #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << a + b << endl;
else
cout << "error";
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,368,800 | 1,368,801 | u341447450 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B > 10) {
cout << "error";
} else {
cout << A + B;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B >= 10) {
cout << "error";
} else {
cout << A + B;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,813 | 1,368,814 | u653388379 | cpp |
p03697 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vect... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vect... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,368,815 | 1,368,816 | u622585907 | cpp |
p03697 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b;
cin >> a >> b;
if (a + b > 10) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
// Your code here!
int a, b;
cin >> a >> b;
if (a + b >= 10) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,817 | 1,368,818 | u452180488 | cpp |
p03696 | #include <iostream>
using namespace std;
int main(void) {
int n;
string s;
cin >> n >> s;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
cnt++;
else
cnt--;
if (cnt < 0) {
s.insert(s.begin(), '(');
i++;
cnt++;
}
}
for (int i = s.size() - 1; ... | #include <iostream>
using namespace std;
int main(void) {
int n;
string s;
cin >> n >> s;
int cnt = 0;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(')
cnt++;
else
cnt--;
if (cnt < 0) {
s.insert(s.begin(), '(');
i++;
cnt++;
}
}
cnt = 0;
for (int i = s.s... | [
"assignment.add"
] | 1,368,821 | 1,368,822 | u038299200 | cpp |
p03696 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(void) {
int n;
string s;
cin >> n >> s;
int it = 0;
int cnt = 0;
while (it != s.size()) {
if (s[it] == ')')
cnt--;
else if (s[it] == '(')
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main(void) {
int n;
string s;
cin >> n >> s;
int it = 0;
int cnt = 0;
while (it != s.size()) {
if (s[it] == ')')
cnt--;
else if (s[it] == '(')
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,368,823 | 1,368,824 | u320354968 | cpp |
p03696 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb emplace_back
#define INF (1e9 + 1)
int main() {
int n;
cin >> n;
string s;
cin >> s;
int mini = INF, goal;
in... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define all(a) (a).begin(), (a).end()
#define pb emplace_back
#define INF (1e9 + 1)
int main() {
int n;
cin >> n;
string s;
cin >> s;
int mini = INF, goal;
in... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 1,368,825 | 1,368,826 | u864550097 | cpp |
p03696 | #include <bits/stdc++.h>
#define maxs 202020
#define mme(i, j) mememset(i, j, sizeof(i))
using namespace std;
char s[maxs];
string res;
int main() {
int n;
while (~scanf("%d", &n)) {
res.clear();
scanf("%s", s);
int len = strlen(s), lef = 0;
for (int i = 0; i < len; i++) {
if (s[i] == ')') {
... | #include <bits/stdc++.h>
#define maxs 202020
#define mme(i, j) mememset(i, j, sizeof(i))
using namespace std;
char s[maxs];
string res;
int main() {
int n;
while (~scanf("%d", &n)) {
res.clear();
scanf("%s", s);
int len = strlen(s), lef = 0;
for (int i = 0; i < len; i++) {
if (s[i] == ')') {
... | [
"assignment.change"
] | 1,368,831 | 1,368,832 | u103408532 | cpp |
p03696 | #include <algorithm>
#include <iostream>
#include <iterator>
#include <sstream>
#include <vector>
using namespace std;
#define LEFT '('
#define RIGHT ')'
int main(void) {
int N;
cin >> N;
string S;
cin >> S;
int cnt = 0;
vector<int> table(N, 0);
for (int i = 0; i < N; i++) {
if (S[i] == LEFT)
... | #include <algorithm>
#include <iostream>
#include <iterator>
#include <sstream>
#include <vector>
using namespace std;
#define LEFT '('
#define RIGHT ')'
int main(void) {
int N;
cin >> N;
string S;
cin >> S;
int cnt = 0;
vector<int> table(N, 0);
for (int i = 0; i < N; i++) {
if (S[i] == LEFT)
... | [
"call.add",
"call.arguments.change"
] | 1,368,833 | 1,368,834 | u013936801 | cpp |
p03696 | #include <iostream>
#include <stack>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
string s, ans;
stack<char> st;
pair<int, int> cnt;
//初期化
cnt.first = cnt.second = 0;
//入力
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
st.push(s[i]);
}... |
#include <iostream>
#include <stack>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
string s, ans;
stack<char> st;
pair<int, int> cnt;
//初期化
cnt.first = cnt.second = 0;
//入力
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
st.push(s[i]);
... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 1,368,835 | 1,368,836 | u493080913 | cpp |
p03696 | // If you are reading this then you are at wrong place.
#include <bits/stdc++.h>
#define mod 1000000007
#define lli long long int
using namespace std;
bool prime[1000001];
void debug(lli a) { cout << a << endl; }
lli sieve(lli a) {
memset(prime, true, sizeof(prime));
lli p, i;
for (p = 2; p * p <= a; p++) {
i... | // If you are reading this then you are at wrong place.
#include <bits/stdc++.h>
#define mod 1000000007
#define lli long long int
using namespace std;
bool prime[1000001];
void debug(lli a) { cout << a << endl; }
lli sieve(lli a) {
memset(prime, true, sizeof(prime));
lli p, i;
for (p = 2; p * p <= a; p++) {
i... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,368,840 | 1,368,841 | u639274969 | cpp |
p03696 | //
// main.cpp
// ABC 064 Insertion
//
// Created by Shuangyi Zhang on 2017/6/24.
// Copyright © 2017年 Shuangyi Zhang. All rights reserved.
//
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, p, q, l;
string s, ans;
cin >> n >> s;
p = 0, q = 0;
for (int i = 0; i <= n - 1; i+... | //
// main.cpp
// ABC 064 Insertion
//
// Created by Shuangyi Zhang on 2017/6/24.
// Copyright © 2017年 Shuangyi Zhang. All rights reserved.
//
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, p, q, l;
string s, ans;
cin >> n >> s;
p = 0, q = 0, l = 0;
for (int i = 0; i <= n ... | [] | 1,368,842 | 1,368,843 | u237209510 | cpp |
p03696 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define foreach(c, itr) \
for (__typeof((c).begin()) itr = (c).begin(); itr != (c)... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, a, n) for (int(i) = (a); (i) < (int)(n); (i)++)
#define foreach(c, itr) \
for (__typeof((c).begin()) itr = (c).begin(); itr != (c)... | [
"assignment.add"
] | 1,368,856 | 1,368,857 | u576018050 | cpp |
p03696 | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int l = 0;
int r = 0;
int n;
scanf("%d", &n);
while (getchar() != '\n')
;
vector<char> str;
str.resize(n);
for (int i = 0; i < n; i++) {
scanf("%c", &str[i], 2);
if (str[i] == '(') {
r++;
} else {
if (r >... | #include <cstdio>
#include <vector>
using namespace std;
int main() {
int l = 0;
int r = 0;
int n;
scanf("%d", &n);
while (getchar() != '\n')
;
vector<char> str;
str.resize(n);
for (int i = 0; i < n; i++) {
scanf("%c", &str[i], 2);
if (str[i] == '(') {
r++;
} else {
if (r >... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,864 | 1,368,865 | u620059302 | cpp |
p03696 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | [
"call.remove",
"call.add"
] | 1,368,866 | 1,368,867 | u026730198 | cpp |
p03696 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define INF (INT_MAX / 3)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
using namespace std;
int main(void) {
int N;
cin >> N;
string str, str2;
cin >> str;
str2 = str;
aut... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) (a).begin(), (a).end()
#define INF (INT_MAX / 3)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
using namespace std;
int main(void) {
int N;
cin >> N;
string str, str2;
cin >> str;
str2 = str;
aut... | [
"expression.operation.binary.remove"
] | 1,368,877 | 1,368,878 | u105290167 | cpp |
p03696 | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | // clang-format off
#include <bits/stdc++.h>
#define int long long
#define main signed main()
// #define main int main()
#define loop(i, a, n) for (int i = (a); i < (n); i++)
#define rep(i, n) loop(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define prec(n) fixed << setprecis... | [
"control_flow.loop.for.condition.change"
] | 1,368,879 | 1,368,880 | u014237950 | cpp |
p03696 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int cnt = 0;
for (int i = N - 1; i > 0; i--) {
if (S[i] == ')') {
cnt++;
} else {
... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int cnt = 0;
for (int i = N - 1; i >= 0; i--) {
if (S[i] == ')') {
cnt++;
} else {
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,368,881 | 1,368,882 | u274615057 | cpp |
p03696 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
int main() {
string moji;
int n;
cin >> n;
vector<int> a(10000);
REP(i, 1000) { a[i] = ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
int main() {
string moji;
int n;
cin >> n;
vector<int> a(10000);
REP(i, 1000) { a[i] = ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.string.change",
"assignment.value.change"
] | 1,368,885 | 1,368,886 | u451610133 | cpp |
p03696 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
int main() {
string moji;
int n;
cin >> n;
vector<int> a(10000);
REP(i, 1000) { a[i] = ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
int main() {
string moji;
int n;
cin >> n;
vector<int> a(10000);
REP(i, 1000) { a[i] = ... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,368,887 | 1,368,886 | u451610133 | cpp |
p03696 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
int main() {
string moji;
int n;
cin >> n;
vector<int> a(10000);
REP(i, 1000) { a[i] = ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
using namespace std;
typedef long long ll;
int main() {
string moji;
int n;
cin >> n;
vector<int> a(10000);
REP(i, 1000) { a[i] =... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,368,885 | 1,368,888 | u451610133 | cpp |
p03696 | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long longlong;
typedef long long LL;
int main(void) {
int i, j = 0, n, ans, l = 0, r = 0, s = ... | #include <algorithm>
#include <array>
#include <cmath>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long longlong;
typedef long long LL;
int main(void) {
int i, j = 0, n, ans, l = 0, r = 0, s = ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,368,893 | 1,368,892 | u501289321 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout << #x " = " << ((x)) << endl
template <class T, class U>
ostream &operator<<(ost... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout << #x " = " << ((x)) << endl
template <class T, class U>
ostream &operator<<(ost... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,368,896 | 1,368,897 | u696805736 | cpp |
p03696 | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 100005;
int main() {
string s;
int n;
scanf("%... | #include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#define all(v) (v).begin(), (v).end()
using namespace std;
typedef pair<int, int> P;
const int MAX_N = 100005;
int main() {
string s;
int n;
scanf("%... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,368,898 | 1,368,899 | u509674552 | cpp |
p03696 | #include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "math.h"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "utility"
using namespace std;
const long long int... | #include "algorithm"
#include "climits"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "math.h"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "unordered_map"
#include "utility"
using namespace std;
const long long int... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,368,902 | 1,368,903 | u468700753 | cpp |
p03696 | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ---------------------
// repetition
#define FOR(i, a, b) for (... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ---------------------
// repetition
#define FOR(i, a, b) for (... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,368,904 | 1,368,905 | u430622110 | cpp |
p03696 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int main() {
int N;
scanf("%d", &N);
char s[128];
scanf("%s", s);
int d[100];
int left = 0;
int right = 0;
for (int i = 0; i < N; i++) {
char buf = s[i];
if ('(' == buf)
left++;
if (... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int main() {
int N;
scanf("%d", &N);
char s[128];
scanf("%s", s);
int d[100];
int left = 0;
int right = 0;
for (int i = 0; i < N; i++) {
char buf = s[i];
if ('(' == buf)
left++;
if (... | [] | 1,368,906 | 1,368,907 | u790614328 | cpp |
p03696 | #pragma region ヘッダー
#define _CRT_SECURE_NO_WARNINGS
#ifdef _____MY_DEBUG_____
#define VS_ENDPAUSE() (system("pause"))
#else
#define VS_ENDPAUSE()
#endif
#include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespa... | #pragma region ヘッダー
#define _CRT_SECURE_NO_WARNINGS
#ifdef _____MY_DEBUG_____
#define VS_ENDPAUSE() (system("pause"))
#else
#define VS_ENDPAUSE()
#endif
#include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespa... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 1,368,918 | 1,368,919 | u314341898 | cpp |
p03696 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string N;
int S;
cin >> S;
cin >> N;
string ls = "", rs = "";
string NN = N;
string::size_type pos(N.find("()"));
while (pos != string::npos) {
N.replace(pos, 2, "");
pos = N.find("()", pos);
S -= 2;
}
int l ... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
string N;
int S;
cin >> S;
cin >> N;
string ls = "", rs = "";
string NN = N;
string::size_type pos(N.find("()"));
while (pos != string::npos) {
N.replace(pos, 2, "");
pos = N.find("()");
S -= 2;
}
int l = 0, ... | [
"call.arguments.change"
] | 1,368,920 | 1,368,921 | u423794261 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B < 10)
cout << A + B << endl;
else
cout << "erroe" << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B < 10)
cout << A + B << endl;
else
cout << "error" << endl;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,368,932 | 1,368,933 | u701589684 | cpp |
p03697 | #include <cstdio>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (a + b > 10) {
printf("error");
} else {
printf("%d", a + b);
}
return 0;
} | #include <cstdio>
int main() {
int a, b;
scanf("%d %d", &a, &b);
if (a + b >= 10) {
printf("error");
} else {
printf("%d", a + b);
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,934 | 1,368,935 | u480043922 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, N, ans = 0;
vector<int> V(3);
char tmp;
string S;
cin >> V[0] >> V[1];
tmp = V[0] + V[1];
if (tmp >= 10)
puts("error");
else
cout << tmp << endl;
// cout <<ans<<endl;
// string S;
// cin >>S;
// cout << S + "pp"... | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B, C, D, N, ans = 0;
vector<int> V(3);
char tmp;
string S;
cin >> V[0] >> V[1];
ans = V[0] + V[1];
if (ans >= 10)
puts("error");
else
cout << ans << endl;
// cout <<ans<<endl;
// string S;
// cin >>S;
// cout << S + "pp... | [
"assignment.variable.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 1,368,940 | 1,368,941 | u074306398 | cpp |
p03697 | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int d = a + b;
if (d > 0)
cout << "error";
else
cout << d;
return 0;
} | #include <iostream>
#include <stdio.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
int d = a + b;
if (d >= 10)
cout << "error";
else
cout << d;
return 0;
} | [] | 1,368,942 | 1,368,943 | u369980487 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B < 9) {
cout << A + B << endl;
} else {
cout << "error" << endl;
}
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B < 10) {
cout << A + B << endl;
} else {
cout << "error" << endl;
}
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,368,947 | 1,368,948 | u015187377 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B > 10) {
cout << "error" << endl;
} else {
cout << A + B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B >= 10) {
cout << "error" << endl;
} else {
cout << A + B << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,951 | 1,368,952 | u363713811 | cpp |
p03697 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int INF = numeric_limits<int>::max() / 2;
ll LINF = numeric_limits<ll>::max() / 2;
int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "eroor" << endl;
else
co... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
int INF = numeric_limits<int>::max() / 2;
ll LINF = numeric_limits<ll>::max() / 2;
int MOD = 1e9 + 7;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
else
co... | [
"literal.string.change",
"io.output.change"
] | 1,368,957 | 1,368,958 | u487641373 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
((a + b) > 10) ? cout << "error" << endl : cout << a + b << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
((a + b) >= 10) ? cout << "error" << endl : cout << a + b << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,368,963 | 1,368,964 | u118452388 | cpp |
p03697 | #define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
int a,... | #define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
int a,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,965 | 1,368,966 | u992287017 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a + b > 10)
cout << "error" << endl;
else
cout << a + b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
else
cout << a + b << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,967 | 1,368,968 | u079470909 | cpp |
p03697 | #import <bits/stdc++.h>
#define sorted(vector) sort(vector.begin(), vector.end())
#define append(a) push_back(a)
#define int(a) stoi(a)
#define str(a) to_string(a)
using namespace std;
int a, b, c, x, g;
string s, t, r;
int main(void) {
cin >> a >> b >> c;
if ((a + b) > 10) {
cout << "error" << endl;
} else... | #import <bits/stdc++.h>
#define sorted(vector) sort(vector.begin(), vector.end())
#define append(a) push_back(a)
#define int(a) stoi(a)
#define str(a) to_string(a)
using namespace std;
int a, b, c, x, g;
string s, t, r;
int main(void) {
cin >> a >> b >> c;
if ((a + b) >= 10) {
cout << "error" << endl;
} els... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,974 | 1,368,975 | u367130284 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b <= 10)
cout << a + b << endl;
else
cout << "error" << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << a + b << endl;
else
cout << "error" << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,976 | 1,368,977 | u881647420 | cpp |
p03697 | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A + B <= 10) {
cout << "error" << endl;
} else {
cout << A + B << endl;
}
} | #include <iostream>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A + B >= 10) {
cout << "error" << endl;
} else {
cout << A + B << endl;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,980 | 1,368,981 | u846813901 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 10)
cout << "error" << endl;
else
cout << a + b << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
else
cout << a + b << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,982 | 1,368,983 | u539199630 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 109)
cout << a + b;
else
cout << "error";
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << a + b;
else
cout << "error";
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,368,992 | 1,368,993 | u859897687 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 9)
cout << a + b;
else
cout << "error";
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << a + b;
else
cout << "error";
} | [] | 1,368,994 | 1,368,993 | u859897687 | cpp |
p03697 | #include <bits/stdc++.h>
// statics
using namespace std;
using int64 = long long;
using PAIR = pair<int64, int64>;
constexpr int INF = 1 << 30;
constexpr int64 LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 3e5 + 1;
// init/input
#define int int64
#define INIT ... | #include <bits/stdc++.h>
// statics
using namespace std;
using int64 = long long;
using PAIR = pair<int64, int64>;
constexpr int INF = 1 << 30;
constexpr int64 LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 3e5 + 1;
// init/input
#define int int64
#define INIT ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 1,369,007 | 1,369,008 | u258009780 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = a + b;
if (sum > 10) {
cout << "error" << endl;
} else {
cout << sum << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int sum = a + b;
if (sum > 9) {
cout << "error" << endl;
} else {
cout << sum << endl;
}
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,369,016 | 1,369,017 | u270626454 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B > 10) {
cout << "error" << endl;
} else {
cout << A + B << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B >= 10) {
cout << "error" << endl;
} else {
cout << A + B << endl;
}
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,018 | 1,369,019 | u618697411 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B > 0) {
cout << "error" << endl;
} else {
cout << A + B << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B >= 10) {
cout << "error" << endl;
} else {
cout << A + B << endl;
}
}
| [] | 1,369,020 | 1,369,019 | u618697411 | cpp |
p03697 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B > 10) {
cout << "error";
} else {
cout << A + B;
}
cout << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B >= 10) {
cout << "error";
} else {
cout << A + B;
}
cout << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,021 | 1,369,022 | u684056175 | cpp |
p03697 | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << "error" << endl;
else
cout << a + b << endl;
} | #include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
else
cout << a + b << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,027 | 1,369,028 | u845620905 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b + a < 10) {
cout << b + a;
} else {
cout << "No";
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (b + a < 10) {
cout << b + a;
} else {
cout << "error";
}
}
| [
"literal.string.change",
"io.output.change"
] | 1,369,031 | 1,369,032 | u083040810 | cpp |
p03697 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B <= 10) {
cout << A + B << endl;
} else {
cout << "error" << endl;
}
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B < 10) {
cout << A + B << endl;
} else {
cout << "error" << endl;
}
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,035 | 1,369,036 | u086366728 | cpp |
p03697 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
templ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
template <class T> void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
templ... | [
"literal.string.change",
"io.output.change"
] | 1,369,039 | 1,369,040 | u635484372 | cpp |
p03697 | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <map> // pair
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a, b;
if (a + b < 10) {
cout << a + b << endl;
} else {
cout << "error" << endl;
}
} | #include <algorithm> // sort
#include <bits/stdc++.h>
#include <ctype.h>
#include <map> // pair
#include <math.h>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 10) {
cout << a + b << endl;
} else {
cout << "error" << endl;
}
}
| [] | 1,369,047 | 1,369,048 | u132284673 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 10)
cout << "error" << endl;
else
cout << a + b << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
else
cout << a + b << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,051 | 1,369,052 | u461415203 | cpp |
p03697 | #include <algorithm>
#include <cstring>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) ... | #include <algorithm>
#include <cstring>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,053 | 1,369,054 | u209713918 | cpp |
p03697 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x + y < 9)
cout << x + y << endl;
else
cout << "error" << endl;
} | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x + y < 10)
cout << x + y << endl;
else
cout << "error" << endl;
} | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,369,057 | 1,369,058 | u317177661 | cpp |
p03697 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,369,065 | 1,369,066 | u472675932 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
int a, b;
cin >> a >> b;
if (a + b < 9) {
cout << a + b << endl;
} else {
cout << "error" << endl;
}
re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int main() {
// cout.precision(10);
int a, b;
cin >> a >> b;
if (a + b < 10) {
cout << a + b << endl;
} else {
cout << "error" << endl;
}
r... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,369,069 | 1,369,070 | u980655160 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
a + b <= 10 ? cout << a + b : cout << "error";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
a + b < 10 ? cout << a + b : cout << "error";
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,369,075 | 1,369,076 | u977855674 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error";
cout << a + b;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error";
else
cout << a + b;
return 0;
} | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,369,087 | 1,369,088 | u384124931 | cpp |
p03697 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b == 10)
cout << "error" << endl;
else
cout << a + b << endl;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
else
cout << a + b << endl;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,092 | 1,369,093 | u214304095 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define m0(x) memset(x, 0, sizeof(x))
int dx4[4] = {1, 0, -1, 0}, dy4[4] = {0, 1, 0, -1};
i... | [] | 1,369,094 | 1,369,095 | u773916255 | cpp |
p03697 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if (c = a + b >= 10)
cout << "error" << endl;
else
cout << c << endl;
}
| #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b, c;
cin >> a >> b;
if ((c = a + b) >= 10)
cout << "error" << endl;
else
cout << c << endl;
}
| [
"control_flow.branch.if.condition.change"
] | 1,369,096 | 1,369,097 | u949798495 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if ((a + b) > 10) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if ((a + b) >= 10) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,104 | 1,369,105 | u856232850 | cpp |
p03697 | #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int a, b;
cin >> a >> b;
if (a + b <= 10)
cout << a + b;
else
cout << "error";
cout << endl;
return 0;
}
| #include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int main(int argc, char *argv[]) {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << a + b;
else
cout << "error";
cout << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,113 | 1,369,114 | u202813867 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
(a + b <= 10) ? cout << a + b << endl : cout << "error" << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
(a + b < 10) ? cout << a + b << endl : cout << "error" << endl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,369,117 | 1,369,118 | u594221936 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a + b == 10)
puts("error");
else
cout << a + b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a + b >= 10)
puts("error");
else
cout << a + b << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,123 | 1,369,124 | u817240026 | cpp |
p03697 | #include <algorithm>
#include <bits/stdc++.h>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (o... | #include <algorithm>
#include <bits/stdc++.h>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <utility>
#include <vector>
#define ALL(obj) (o... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,125 | 1,369,126 | u789417951 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b <= 10)
cout << "error" << endl;
else
cout << a + b << endl;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
else
cout << a + b << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,141 | 1,369,142 | u843842420 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b <= 10)
cout << "error" << endl;
else
cout << a + b << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
else
cout << a + b << endl;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,143 | 1,369,142 | u843842420 | cpp |
p03697 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
const int MOD = (int)1e9 + 7;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 10)
cout << a + b << endl;
else
cout << "error" << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
const int MOD = (int)1e9 + 7;
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << a + b << endl;
else
cout << "error" << endl;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,153 | 1,369,154 | u441078173 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x + y <= 10) {
cout << x + y << endl;
} else {
cout << "error" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int x, y;
cin >> x >> y;
if (x + y < 10) {
cout << x + y << endl;
} else {
cout << "error" << endl;
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,158 | 1,369,159 | u671765585 | cpp |
p03697 | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a + b <= 10 ? to_string(a + b) : "error") << endl;
return 0;
} | #include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << (a + b < 10 ? to_string(a + b) : "error") << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"io.output.change"
] | 1,369,160 | 1,369,161 | u355798276 | cpp |
p03697 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 10)
cout << a + b << endl;
else
cout << "error" << endl;
return 0;
} |
#include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b < 10)
cout << a + b << endl;
else
cout << "error" << endl;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,162 | 1,369,163 | u154672915 | cpp |
p03697 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int x, a, b;
cin >> x >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
if (a + b < 10)
cout << a + b << endl;
}
| #include <algorithm>
#include <iostream>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
if (a + b < 10)
cout << a + b << endl;
}
| [
"variable_declaration.remove",
"expression.operation.binary.remove"
] | 1,369,166 | 1,369,167 | u546943614 | cpp |
p03697 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b <= 10)
cout << "error" << endl;
else
cout << a + b << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
else
cout << a + b << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,180 | 1,369,181 | u006686215 | cpp |
p03697 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10) {
cout << "erroe" << endl;
} else
cout << a + b << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10) {
cout << "error" << endl;
} else
cout << a + b << endl;
} | [
"literal.string.change",
"io.output.change"
] | 1,369,182 | 1,369,183 | u592099403 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B >= 10) {
cout << "erorr" << endl;
} else {
cout << A + B << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
if (A + B >= 10) {
cout << "error" << endl;
} else {
cout << A + B << endl;
}
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,369,184 | 1,369,185 | u870998252 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = A + B;
if (ans < 10) {
cout << ans << endl;
} else {
cout << "'error'" << endl;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int A, B;
cin >> A >> B;
int ans = A + B;
if (ans < 10) {
cout << ans << endl;
} else {
cout << "error" << endl;
}
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 1,369,187 | 1,369,188 | u319491032 | cpp |
p03697 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ok1 printf("ok1\n");
#define ok2 printf("ok2\n");
#defin... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ok1 printf("ok1\n");
#define ok2 printf("ok2\n");
#defin... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,195 | 1,369,196 | u373958718 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> A;
cin >> B;
if (A + B >= 0)
cout << "error" << endl;
else
cout << A + B << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int A;
int B;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> A;
cin >> B;
if (A + B >= 10)
cout << "error" << endl;
else
cout << A + B << endl;
return 0;
}
| [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,369,197 | 1,369,198 | u197246729 | cpp |
p03697 | #include "bits/stdc++.h"
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << ((a + b) < 10 ? to_string(a + b) : "No");
} | #include "bits/stdc++.h"
using namespace std;
int main() {
int a, b;
cin >> a >> b;
cout << ((a + b) < 10 ? to_string(a + b) : "error") << endl;
} | [
"literal.string.change",
"io.output.change",
"io.output.newline.add"
] | 1,369,201 | 1,369,202 | u076134576 | cpp |
p03697 |
#include <algorithm>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <sys/timeb.h>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (i... |
#include <algorithm>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <sys/timeb.h>
#include <vector>
using namespace std;
#define repr(i, a, b) for (int i = (int)(a); i < (i... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,210 | 1,369,211 | u702133921 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 10) {
cout << "error" << endl;
}
else
cout << a + b << endl;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10) {
cout << "error" << endl;
}
else
cout << a + b << endl;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,212 | 1,369,213 | u226223646 | cpp |
p03697 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "eroor" << endl;
else
cout << a + b << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "error" << endl;
else
cout << a + b << endl;
return 0;
}
| [
"literal.string.change",
"io.output.change"
] | 1,369,214 | 1,369,215 | u418810472 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 10) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10) {
cout << "error" << endl;
} else {
cout << a + b << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,223 | 1,369,224 | u780122303 | cpp |
p03697 | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | #include "bits/stdc++.h"
using namespace std;
#ifdef _DEBUG
#include "dump.hpp"
#else
#define dump(...)
#endif
//#define int long long
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
const int INF =
sizeof(int) == sizeof(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,369,227 | 1,369,228 | u631007830 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
int a, b;
int main(int argc, char const *argv[]) {
ios_base::sync_with_st... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < (n); i++)
#define MEM(a, x) memset(a, x, sizeof(a))
#define ALL(a) a.begin(), a.end()
#define UNIQUE(a) a.erase(unique(ALL(a)), a.end())
typedef long long ll;
int a, b;
int main(int argc, char const *argv[]) {
ios_base::sync_with_st... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,369,231 | 1,369,232 | u950925609 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.