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 |
|---|---|---|---|---|---|---|---|
p03695 | #include <algorithm>
#include <cassert>
#include <cmath>
#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)
#define rep(i, n) FOR(i, 0, n)
#define DEBUG(x) cout << #x << ": " << x << endl
#define vint vector<int>
#define vdouble ve... | #include <algorithm>
#include <cassert>
#include <cmath>
#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)
#define rep(i, n) FOR(i, 0, n)
#define DEBUG(x) cout << #x << ": " << x << endl
#define vint vector<int>
#define vdouble ve... | [
"call.remove",
"call.arguments.change"
] | 1,368,364 | 1,368,365 | u429978706 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, o;
bool c[8];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
int r = a / 400;
if (r < 8) {
c[r] = true;
} else
o++;
}
int ct = 0;
for (int i = 0; i < 8;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int n, o;
bool c[8];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
int r = a / 400;
if (r < 8) {
c[r] = true;
} else
o++;
}
int ct = 0;
for (int i = 0; i < 8;... | [
"call.remove",
"call.arguments.change"
] | 1,368,366 | 1,368,367 | u884379688 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n, i, j;
int con[8];
for (j = 0; j < 8; j++)
con[j] = 0;
scanf("%d", &n);
int highnum = 0;
for (i = 0; i < n; i++) {
int x;
scanf("%d", &x);
bool whigh = tr... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <string.h>
using namespace std;
int main() {
int n, i, j;
int con[8];
for (j = 0; j < 8; j++)
con[j] = 0;
scanf("%d", &n);
int highnum = 0;
for (i = 0; i < n; i++) {
int x;
scanf("%d", &x);
bool whigh = tr... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,368,368 | 1,368,369 | u837244690 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
const ... | [
"io.output.change"
] | 1,368,370 | 1,368,371 | u089869622 | cpp |
p03695 |
#include <iostream>
using namespace std;
typedef unsigned long long u64;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
bool c[8];
for (int i = 0; i < 8; ++i) {
c[i] = false;
}
int N;
cin >> N;
int over = 0;
for (int i = 0; i < N; ++i) {
int rate;
cin >> rate;
if (rate >= ... | #include <iostream>
using namespace std;
typedef unsigned long long u64;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
bool c[8];
for (int i = 0; i < 8; ++i) {
c[i] = false;
}
int N;
cin >> N;
int over = 0;
for (int i = 0; i < N; ++i) {
int rate;
cin >> rate;
if (rate >= 3... | [
"call.remove",
"call.arguments.change"
] | 1,368,372 | 1,368,373 | u691764803 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl
#define BINARY(x) static_cast<bitset<16>>(x)
#define rep(i, n) for... | #include <bits/stdc++.h>
using namespace std;
#define DUMP(x) cerr << #x << "=" << x << endl
#define DUMP2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")" << endl
#define BINARY(x) static_cast<bitset<16>>(x)
#define rep(i, n) for... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,368,374 | 1,368,375 | u222745664 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef ... | [
"call.remove",
"call.arguments.change"
] | 1,368,382 | 1,368,383 | u129309615 | cpp |
p03695 |
#include <bits/stdc++.h>
using namespace std;
#define fill(a, val) memset(a, (val), sizeof a)
#define pb push_back
#define lli long long int
#define scantype int
#define endl "\n"
#define unique(x) x.erase(unique(x.begin(), x.end()), x.end())
#define debug(x) cerr << #x " = " << (x) << '\n'
#define what_is(x) cerr <... |
#include <bits/stdc++.h>
using namespace std;
#define fill(a, val) memset(a, (val), sizeof a)
#define pb push_back
#define lli long long int
#define scantype int
#define endl "\n"
#define unique(x) x.erase(unique(x.begin(), x.end()), x.end())
#define debug(x) cerr << #x " = " << (x) << '\n'
#define what_is(x) cerr <... | [
"call.add",
"call.arguments.change"
] | 1,368,387 | 1,368,388 | u615790403 | cpp |
p03695 | /*
ID: barish21
LANG: C++14
TASK: test
*/
/****Author: Barish Namazov****/
#include <bits/stdc++.h>
using namespace std;
/***TEMPLATE***/
#define intt long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define IO ... | /*
ID: barish21
LANG: C++14
TASK: test
*/
/****Author: Barish Namazov****/
#include <bits/stdc++.h>
using namespace std;
/***TEMPLATE***/
#define intt long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define F first
#define S second
#define pb push_back
#define IO ... | [
"call.remove",
"call.arguments.change"
] | 1,368,389 | 1,368,390 | u217568477 | cpp |
p03695 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <st... | [
"call.remove",
"call.arguments.change"
] | 1,368,391 | 1,368,392 | u545022164 | cpp |
p03695 | #include <iostream>
#include <stdio.h>
#define MAX(x, y) (((x) > (y)) ? (x) : (y))
#define MIN(x, y) (((x) < (y)) ? (x) : (y))
using namespace std;
int main(void) {
int N;
int a[101];
int color[9];
cin >> N;
for (int i = 0; i < N; i++)
cin >> a[i];
for (int i = 0; i < 9; i++)
color[i] = 0;
f... | #include <iostream>
#include <stdio.h>
#define MAX(x, y) (((x) > (y)) ? (x) : (y))
#define MIN(x, y) (((x) < (y)) ? (x) : (y))
using namespace std;
int main(void) {
int N;
int a[101];
int color[9];
cin >> N;
for (int i = 0; i < N; i++)
cin >> a[i];
for (int i = 0; i < 9; i++)
color[i] = 0;
f... | [
"call.remove",
"call.arguments.change"
] | 1,368,397 | 1,368,398 | u319282133 | cpp |
p03695 | #include <algorithm>
#include <iostream>
bool colored[8];
int main() {
int n;
std::cin >> n;
int color = 0;
int pro = 0;
for (int i = 0; i < n; ++i) {
int a;
std::cin >> a;
if (a < 3200) {
if (colored[a / 400])
continue;
colored[a / 400] = true;
++color;
} else
... | #include <algorithm>
#include <iostream>
bool colored[8];
int main() {
int n;
std::cin >> n;
int color = 0;
int pro = 0;
for (int i = 0; i < n; ++i) {
int a;
std::cin >> a;
if (a < 3200) {
if (colored[a / 400])
continue;
colored[a / 400] = true;
++color;
} else
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,368,399 | 1,368,400 | u492926158 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
bool a[8];
int main() {
int n;
scanf("%d", &n);
memset(a, false, sizeof(a));
int ans = 0;
for (int i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
if (temp < 400)
a[0] = true;
else if (temp < 800)
a[1] = true;
else if (temp < 12... | #include <bits/stdc++.h>
using namespace std;
bool a[8];
int main() {
int n;
scanf("%d", &n);
memset(a, false, sizeof(a));
int ans = 0;
for (int i = 0; i < n; i++) {
int temp;
scanf("%d", &temp);
if (temp < 400)
a[0] = true;
else if (temp < 800)
a[1] = true;
else if (temp < 12... | [
"expression.unary.arithmetic.add"
] | 1,368,401 | 1,368,402 | u551583448 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
// nichijou
#define REP(i, a, b) for (int i(a), _B(b); i < _B; ++i)
#define RP(i, n) REP(i, 0, n)
#define PER(i, a, b) for (int i((a)-1), _B(b); i >= _B; --i)
#define PR(i, n) PER(i, n, 0)
#define REP1(i, a, b) REP(i, a, (b) + 1)
#define RP1(i, n) REP1(i, 1, n)
#define PER1... | #include <bits/stdc++.h>
using namespace std;
// nichijou
#define REP(i, a, b) for (int i(a), _B(b); i < _B; ++i)
#define RP(i, n) REP(i, 0, n)
#define PER(i, a, b) for (int i((a)-1), _B(b); i >= _B; --i)
#define PR(i, n) PER(i, n, 0)
#define REP1(i, a, b) REP(i, a, (b) + 1)
#define RP1(i, n) REP1(i, 1, n)
#define PER1... | [
"call.remove",
"call.arguments.change"
] | 1,368,403 | 1,368,404 | u821608744 | cpp |
p03695 | #include <iostream>
using namespace std;
int frecv[10];
int main() {
int n, obligatoriu = 0, optional = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
x = x / 400;
x = min(x, 8);
frecv[x]++;
}
for (int i = 0; i < 8; ++i)
if (frecv[i])
++obligatoriu;
optional = fr... | #include <iostream>
using namespace std;
int frecv[10];
int main() {
int n, obligatoriu = 0, optional = 0;
cin >> n;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;
x = x / 400;
x = min(x, 8);
frecv[x]++;
}
for (int i = 0; i < 8; ++i)
if (frecv[i])
++obligatoriu;
optional = fr... | [
"call.remove",
"call.arguments.change"
] | 1,368,405 | 1,368,406 | u993905544 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, x[10], a, c;
int main() {
cin >> n;
while (n--) {
cin >> a;
if (a < 400)
x[0] = 1;
else if (a < 800)
x[1] = 1;
else if (a < 1200)
x[2] = 1;
else if (a < 1600)
x[3] = 1;
else if (a < 2000)
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n, x[10], a, c;
int main() {
cin >> n;
while (n--) {
cin >> a;
if (a < 400)
x[0] = 1;
else if (a < 800)
x[1] = 1;
else if (a < 1200)
x[2] = 1;
else if (a < 1600)
x[3] = 1;
else if (a < 2000)
... | [
"call.remove",
"call.arguments.change"
] | 1,368,407 | 1,368,408 | u223822757 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define ss(x) scanf("%s", x)
#define mod 1000000007
#define bitcount __builtin_popcountll
#define ll long long
#define pb push_back
#define pi pair<int, int>
#define pii pair<pi, int>
#define mp make_pair
int a... | #include <bits/stdc++.h>
using namespace std;
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define ss(x) scanf("%s", x)
#define mod 1000000007
#define bitcount __builtin_popcountll
#define ll long long
#define pb push_back
#define pi pair<int, int>
#define pii pair<pi, int>
#define mp make_pair
int a... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,409 | 1,368,410 | u613178900 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int const N = 100 * 1000 + 16;
int a[16];
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
x /= 400;
x = min(x, 8);
a[x]++;
}
int cnt = 8 - count(a,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int const N = 100 * 1000 + 16;
int a[16];
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
x /= 400;
x = min(x, 8);
a[x]++;
}
int cnt = 8 - count(a,... | [
"call.remove",
"call.arguments.change"
] | 1,368,411 | 1,368,412 | u003223716 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int a[1000];
int b[8];
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
if (temp >= 3200) {
cnt++;
} else {
b[temp / 400]++;
}
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (b... | #include <bits/stdc++.h>
using namespace std;
int a[1000];
int b[8];
int main() {
int n;
cin >> n;
int cnt = 0;
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
if (temp >= 3200) {
cnt++;
} else {
b[temp / 400]++;
}
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (b... | [
"call.remove",
"call.arguments.change"
] | 1,368,413 | 1,368,414 | u742493978 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
int n;
int a[110];
int cnt1 = 0, cnt2 = 0;
bool vis[10];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
if ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
int n;
int a[110];
int cnt1 = 0, cnt2 = 0;
bool vis[10];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
if ... | [
"call.add",
"call.arguments.add"
] | 1,368,415 | 1,368,416 | u413754920 | cpp |
p03695 | /*
_,add8ba,
,d888888888b,
d8888888888888b _,ad8ba,_
d888888888888888) ,d888888888b,
I8888888888888888 _________ ,8888888888888b
... | /*
_,add8ba,
,d888888888b,
d8888888888888b _,ad8ba,_
d888888888888888) ,d888888888b,
I8888888888888888 _________ ,8888888888888b
... | [
"call.add",
"call.arguments.add"
] | 1,368,417 | 1,368,418 | u249442645 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#define N 10000
using namespace std;
int cnt[10] = {0}, n, a[N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] /= 400;
if (a[i] > 8)
a[i] = 8;
cnt[a[i]]++;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#define N 10000
using namespace std;
int cnt[10] = {0}, n, a[N];
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
a[i] /= 400;
if (a[i] > 8)
a[i] = 8;
cnt[a[i]]++;
... | [
"call.add",
"call.arguments.add"
] | 1,368,419 | 1,368,420 | u571318591 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
bool vis[10];
int main() {
while (~scanf("%d", &n)) {
int cnt = 0;
for (int i = 1; i <= n; i++) {
int a;
scanf("%d", &a);
for (int i = 1; i <= 8; i++) {
if (a >= (i - 1) * 400 && ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
using namespace std;
int n;
bool vis[10];
int main() {
while (~scanf("%d", &n)) {
int cnt = 0;
for (int i = 1; i <= n; i++) {
int a;
scanf("%d", &a);
for (int i = 1; i <= 8; i++) {
if (a >= (i - 1) * 400 && ... | [
"call.remove",
"call.arguments.change"
] | 1,368,423 | 1,368,424 | u619903269 | cpp |
p03695 | #include <bits/stdc++.h>
#define LL long long
#define P pair<int, int>
#define P2 pair<LL, int>
#define ls(i) seg[i].lc
#define rs(i) seg[i].rc
using namespace std;
const int N = 18;
const int mod = 1e9 + 7;
int main() {
int cnt[20] = {0};
int n, res = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
... | #include <bits/stdc++.h>
#define LL long long
#define P pair<int, int>
#define P2 pair<LL, int>
#define ls(i) seg[i].lc
#define rs(i) seg[i].rc
using namespace std;
const int N = 18;
const int mod = 1e9 + 7;
int main() {
int cnt[20] = {0};
int n, res = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int x;
... | [
"literal.number.change",
"io.output.change"
] | 1,368,427 | 1,368,428 | u980487329 | cpp |
p03695 | #include <bits/stdc++.h>
#define INF 1000010000
#define nl '\n'
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
#define pdd pair<double, double>
#define all(c) (c).begin(), (c).end()
#define SORT(c) sort(all(c))
#define sz(c) (c).size()
#defi... | #include <bits/stdc++.h>
#define INF 1000010000
#define nl '\n'
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define fi first
#define se second
#define pii pair<int, int>
#define pdd pair<double, double>
#define all(c) (c).begin(), (c).end()
#define SORT(c) sort(all(c))
#define sz(c) (c).size()
#defi... | [
"identifier.change",
"io.output.change"
] | 1,368,429 | 1,368,430 | u029888376 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
template <typename A, ty... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,368,433 | 1,368,434 | u685892567 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#include <iostream>
#define INT long long int
using namespace std;
int n, a[1010], c[8], v[8] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200},
cnt, cnt2;
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i]... | #include <algorithm>
#include <cstdio>
#include <iostream>
#define INT long long int
using namespace std;
int n, a[1010], c[8], v[8] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200},
cnt, cnt2;
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i]... | [
"call.remove",
"call.arguments.change"
] | 1,368,439 | 1,368,440 | u405994273 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#include <iostream>
#define INT long long int
using namespace std;
int n, a[1010], c[8], v[8] = {400, 800, 1200, 1600, 2400, 2800, 3200}, cnt,
cnt2;
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#define INT long long int
using namespace std;
int n, a[1010], c[8], v[8] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200},
cnt, cnt2;
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i]... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,368,441 | 1,368,440 | u405994273 | cpp |
p03695 | #include <bits/stdc++.h>
#define pb push_back
#define S second
#define F first
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int vis[8];
int main() {
int n;
cin >> n;
int a;
int more = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (a >= 3200)
more++;
else if (a >=... | #include <bits/stdc++.h>
#define pb push_back
#define S second
#define F first
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int vis[8];
int main() {
int n;
cin >> n;
int a;
int more = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (a >= 3200)
more++;
else if (a >=... | [
"call.remove",
"call.arguments.change"
] | 1,368,442 | 1,368,443 | u910859532 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
#define Rep(i, x, y) for (int i = x; i <= y; i++)
#define Dwn(i, x, y) for (int i = x; i >= y; i--)
using namespace std;
typedef long long ll;
typedef double db;
int n, a[105]... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
#define Rep(i, x, y) for (int i = x; i <= y; i++)
#define Dwn(i, x, y) for (int i = x; i >= y; i--)
using namespace std;
typedef long long ll;
typedef double db;
int n, a[105]... | [
"call.remove",
"call.arguments.change"
] | 1,368,444 | 1,368,445 | u445305423 | cpp |
p03695 | #pragma region include
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <complex>
#include <sstream>
#include <bitset>
#include <cstring>
#include <string>
#include <tuple>
#include <vector>
#include <complex>
#include <list>
#include <map>
#include <queue>
#in... | #pragma region include
#include <iomanip>
#include <iostream>
#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <complex>
#include <sstream>
#include <bitset>
#include <cstring>
#include <string>
#include <tuple>
#include <vector>
#include <complex>
#include <list>
#include <map>
#include <queue>
#in... | [
"call.remove",
"call.arguments.change"
] | 1,368,446 | 1,368,447 | u870307668 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int a[10], n, t;
int calc(int x) {
if (x < 400)
return 1;
if (x < 800)
return 2;
if (x < 1200)
return 3;
if (x < 1600)
return 4;
if (x < 2000)
return 5;
if (x < 2400)
return 6;
if (x < 2800)
return 7;
if (x < 3200)
return 8;
... | #include <bits/stdc++.h>
using namespace std;
int a[10], n, t;
int calc(int x) {
if (x < 400)
return 1;
if (x < 800)
return 2;
if (x < 1200)
return 3;
if (x < 1600)
return 4;
if (x < 2000)
return 5;
if (x < 2400)
return 6;
if (x < 2800)
return 7;
if (x < 3200)
return 8;
... | [
"call.remove",
"call.arguments.change"
] | 1,368,448 | 1,368,449 | u804707427 | cpp |
p03695 | #include <iostream>
#define REP(i, a, n) for (int i = (a); i < (n); i++)
using namespace std;
int main(void) {
int N, A[100];
cin >> N;
REP(i, 0, N) cin >> A[i];
bool used[8];
REP(i, 0, 8) used[i] = false;
int cnt = 0;
REP(i, 0, N) {
if (1 <= A[i] && A[i] <= 399)
used[0] = 1;
if (400 <= A... | #include <iostream>
#define REP(i, a, n) for (int i = (a); i < (n); i++)
using namespace std;
int main(void) {
int N, A[100];
cin >> N;
REP(i, 0, N) cin >> A[i];
bool used[8];
REP(i, 0, 8) used[i] = false;
int cnt = 0;
REP(i, 0, N) {
if (1 <= A[i] && A[i] <= 399)
used[0] = 1;
if (400 <= A... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,368,450 | 1,368,451 | u981861542 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
vector<int> vec;
typedef long long ll;
typedef pair<ll, ll> pl;... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
vector<int> vec;
typedef long long ll;
typedef pair<ll, ll> pl;... | [
"call.add",
"call.arguments.change"
] | 1,368,452 | 1,368,453 | u188097174 | cpp |
p03695 | #include <algorithm>
#include <array>
#include <iostream>
using namespace std;
using ll = long long int;
int main() {
ll N;
array<ll, 100> A;
cin >> N;
for (ll i = 0; i < N; ++i) {
cin >> A[i];
}
ll map[9] = {0};
for (ll i = 0; i < N; ++i) {
if (A[i] < 400) {
map[0] += 1;
} else if... | #include <algorithm>
#include <array>
#include <iostream>
using namespace std;
using ll = long long int;
int main() {
ll N;
array<ll, 100> A;
cin >> N;
for (ll i = 0; i < N; ++i) {
cin >> A[i];
}
ll map[9] = {0};
for (ll i = 0; i < N; ++i) {
if (A[i] < 400) {
map[0] += 1;
} else if... | [
"call.remove",
"call.arguments.change"
] | 1,368,454 | 1,368,455 | u216914060 | cpp |
p03695 | #include <bits/stdc++.h> //written by thidailoc
using namespace std; // team three wolves
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pll;
#define fu(i, a, b) for (ll i = a; i < b; i++)
#define fd(i, b, a) for (ll i = b; i >= a; i--)
#define ms(a, x) memset(a, x, sizeof a)
#define prec(n) fixe... | #include <bits/stdc++.h> //written by thidailoc
using namespace std; // team three wolves
typedef long long ll;
typedef vector<ll> vi;
typedef pair<ll, ll> pll;
#define fu(i, a, b) for (ll i = a; i < b; i++)
#define fd(i, b, a) for (ll i = b; i >= a; i--)
#define ms(a, x) memset(a, x, sizeof a)
#define prec(n) fixe... | [
"call.add",
"call.arguments.change"
] | 1,368,456 | 1,368,457 | u104888333 | cpp |
p03695 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [
"misc.opposites",
"identifier.change",
"io.output.change"
] | 1,368,458 | 1,368,459 | u558671021 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
/*
ifstream cin ("input") ;
ofstream cout ("output") ;*/
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> fv(200, 0);
int distinct = 0;
int cate = 0;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
/*
ifstream cin ("input") ;
ofstream cout ("output") ;*/
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> fv(200, 0);
int distinct = 0;
int cate = 0;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;... | [
"call.add",
"call.arguments.change"
] | 1,368,460 | 1,368,461 | u513225093 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
/*
ifstream cin ("input") ;
ofstream cout ("output") ;*/
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> fv(200, 0);
int distinct = 0;
int cate = 0;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
/*
ifstream cin ("input") ;
ofstream cout ("output") ;*/
int main(int argc, char const *argv[]) {
int n;
cin >> n;
vector<int> fv(200, 0);
int distinct = 0;
int cate = 0;
for (int i = 1; i <= n; ++i) {
int x;
cin >> x;... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"identifier.change"
] | 1,368,462 | 1,368,461 | u513225093 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
set<int> s;
int big = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
if (v[i] < 400) {
s.insert(1);
} else if (v[i] < 800) {
... | #include <algorithm>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(n);
set<int> s;
int big = 0;
for (int i = 0; i < n; i++) {
cin >> v[i];
if (v[i] < 400) {
s.insert(1);
} else if (v[i] < 800) {
... | [
"call.remove",
"call.arguments.change"
] | 1,368,463 | 1,368,464 | u078907766 | cpp |
p03695 | #include <algorithm>
#include <array>
#include <climits>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespa... | #include <algorithm>
#include <array>
#include <climits>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
using namespa... | [
"call.remove",
"call.arguments.change"
] | 1,368,465 | 1,368,466 | u977652465 | cpp |
p03695 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> table(9);
fill(table.begin(), table.end(), 0);
for (int i = 0; i < n; i++) {
int v;
cin >> v;
v = min(v, 3200);
table[v / 400]++;
}
int mn = 0, mx = 0;
for (int... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> table(9);
fill(table.begin(), table.end(), 0);
for (int i = 0; i < n; i++) {
int v;
cin >> v;
v = min(v, 3200);
table[v / 400]++;
}
int mn = 0, mx = 0;
for (int... | [
"call.remove",
"call.arguments.change"
] | 1,368,467 | 1,368,468 | u537234062 | cpp |
p03695 | #include <climits>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int mask = 0;
int cnt = 0;
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
a /= 400;
if (a > 7) {
++cnt;
} else {
mask |= (1 << a);
}
}
int res... | #include <climits>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int mask = 0;
int cnt = 0;
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
a /= 400;
if (a > 7) {
++cnt;
} else {
mask |= (1 << a);
}
}
int res... | [
"call.add",
"call.arguments.change"
] | 1,368,469 | 1,368,470 | u660402389 | cpp |
p03695 | // need
#include <algorithm>
#include <iostream>
// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <array>
//#include <tuple>
//#include <unordered_map>
//#include <unordered_set>
#incl... | // need
#include <algorithm>
#include <iostream>
// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <array>
//#include <tuple>
//#include <unordered_map>
//#include <unordered_set>
#incl... | [
"literal.number.change",
"call.arguments.change"
] | 1,368,473 | 1,368,474 | u591343832 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
const int DIM = 1e2 + 5;
int arr[DIM];
int main(void) {
int n;
cin >> n;
int ans = 0, cnt = 0;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (x >= 3200)
cnt++;
else {
if (arr[x / 400] == 0)
ans++;
arr[x / 400] = 1... | #include <bits/stdc++.h>
using namespace std;
const int DIM = 1e2 + 5;
int arr[DIM];
int main(void) {
int n;
cin >> n;
int ans = 0, cnt = 0;
for (int i = 1; i <= n; i++) {
int x;
cin >> x;
if (x >= 3200)
cnt++;
else {
if (arr[x / 400] == 0)
ans++;
arr[x / 400] = 1... | [
"call.remove",
"call.arguments.change"
] | 1,368,475 | 1,368,476 | u741323508 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#define LL long long
#define MOD 1000000007
using namespace std;
int n, num, freee;
bool val[8];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
if (x >= 3200)
freee++;
else {
if (val[x / 400])
continue;... | #include <algorithm>
#include <cstdio>
#define LL long long
#define MOD 1000000007
using namespace std;
int n, num, freee;
bool val[8];
int main() {
scanf("%d", &n);
for (int i = 0; i < n; i++) {
int x;
scanf("%d", &x);
if (x >= 3200)
freee++;
else {
if (val[x / 400])
continue;... | [
"call.remove",
"call.arguments.change"
] | 1,368,477 | 1,368,478 | u512867527 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a, C[9];
for (int i = 0; i < 9; ++i)
C[i] = 0;
for (int i = 0; i < N; ++i) {
cin >> a;
++C[min(8, a / 400)];
}
int s = 0;
for (int i = 0; i < 8; ++i) {
if (C[i])
++s;
}
cout << s << " " << s + C[8] << en... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a, C[9];
for (int i = 0; i < 9; ++i)
C[i] = 0;
for (int i = 0; i < N; ++i) {
cin >> a;
++C[min(8, a / 400)];
}
int s = 0;
for (int i = 0; i < 8; ++i) {
if (C[i])
++s;
}
cout << max(s, 1) << " " << s + C[... | [
"call.add",
"call.arguments.add"
] | 1,368,481 | 1,368,482 | u107077660 | cpp |
p03695 | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
int rate(int r) {
for (int i = 0; i < 8; i++) {
if (400 * i <= r && r < 400 * (i + 1))
return i;
}
return 8;
}
int main() {
cin.t... | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <vector>
using namespace std;
int rate(int r) {
for (int i = 0; i < 8; i++) {
if (400 * i <= r && r < 400 * (i + 1))
return i;
}
return 8;
}
int main() {
cin.t... | [
"call.remove",
"call.arguments.change"
] | 1,368,485 | 1,368,486 | u261886891 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int cnt[9], a, n;
for (int i = 0; i < 9; i++)
cnt[i] = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < 3200) {
cnt[a / 400]++;
} else
cnt[8]++;
}
int ans = 0;
for (int i =... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int cnt[9], a, n;
for (int i = 0; i < 9; i++)
cnt[i] = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < 3200) {
cnt[a / 400]++;
} else
cnt[8]++;
}
int ans = 0;
for (int i =... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,368,487 | 1,368,488 | u924885571 | cpp |
p03695 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, N) for (ll i = 0; i < N; ++i)
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define ALL(a) (a).begin(), (a).end()
#define pb ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, N) for (ll i = 0; i < N; ++i)
#define FOR(i, a, b) for (ll i = a; i < b; ++i)
#define ALL(a) (a).begin(), (a).end()
#define pb ... | [
"call.remove",
"call.arguments.change"
] | 1,368,489 | 1,368,490 | u607034173 | cpp |
p03695 | // =====================================================================================
//
// Filename: C.cpp
// Created: 2017년 06월 10일 21시 02분 41초
// Compiler: g++ -O2 -std=c++14
// Author: baactree , bsj0206@naver.com
// Company: Chonnam National University
//
// =============... | // =====================================================================================
//
// Filename: C.cpp
// Created: 2017년 06월 10일 21시 02분 41초
// Compiler: g++ -O2 -std=c++14
// Author: baactree , bsj0206@naver.com
// Company: Chonnam National University
//
// =============... | [
"call.remove",
"call.arguments.change"
] | 1,368,491 | 1,368,492 | u626190773 | cpp |
p03695 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [] | 1,368,493 | 1,368,494 | u938924220 | cpp |
p03695 | #include <algorithm>
#include <iostream>
using namespace std;
int c(int a) {
if (a < 400)
return 0;
else if (a < 800)
return 1;
else if (a < 1200)
return 2;
else if (a < 1600)
return 3;
else if (a < 2000)
return 4;
else if (a < 2400)
return 5;
else if (a < 2800)
return 6;
els... | #include <algorithm>
#include <iostream>
using namespace std;
int c(int a) {
if (a < 400)
return 0;
else if (a < 800)
return 1;
else if (a < 1200)
return 2;
else if (a < 1600)
return 3;
else if (a < 2000)
return 4;
else if (a < 2400)
return 5;
else if (a < 2800)
return 6;
els... | [
"variable_declaration.add",
"identifier.change",
"io.output.change"
] | 1,368,495 | 1,368,496 | u657913472 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define pb emplace_back
using pii = pair<int, int>;
using vi = vector<int>;
using lint = long long;
const int inf = 1001001001;
const lint linf = 1001001001... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define se second
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define pb emplace_back
using pii = pair<int, int>;
using vi = vector<int>;
using lint = long long;
const int inf = 1001001001;
const lint linf = 1001001001... | [
"call.add",
"call.arguments.change"
] | 1,368,499 | 1,368,500 | u802071009 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC diagnostic ignored "-Wmissing-declarations"
#define FINAL_OUT(x) \
{ \
cout << (x) << '\n'; ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC diagnostic ignored "-Wmissing-declarations"
#define FINAL_OUT(x) \
{ \
cout << (x) << '\n'; ... | [
"call.remove",
"call.arguments.change"
] | 1,368,501 | 1,368,502 | u063337050 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
int cnt[8];
int main(void) {
sca... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define MOD 1000000007LL
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int n;
int cnt[10];
int main(void) {
sc... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.remove",
"call.arguments.change"
] | 1,368,503 | 1,368,504 | u854869949 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
bool flag[8];
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int c = 0;
rep(i, n) {
int t = a[i] / 400;
flag[t] = true;
if (t >= 8)
c++;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = (0); (i) < (int)(n); ++(i))
using ll = long long;
bool flag[8];
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
int c = 0;
rep(i, n) {
int t = a[i] / 400;
flag[t] = true;
if (t >= 8)
c++;... | [] | 1,368,505 | 1,368,506 | u482544950 | cpp |
p03695 | #include <stdio.h>
int cnt[8];
int max(int a, int b) { return a > b ? a : b; }
int min(int a, int b) { return a < b ? a : b; }
int main() {
int N;
scanf("%d", &N);
int free = 0;
for (int i = 0; i < N; i++) {
int x;
scanf("%d", &x);
if (x > 3199)
free++;
else
cnt[x / 400]++;
}
... | #include <stdio.h>
int cnt[8];
int max(int a, int b) { return a > b ? a : b; }
int min(int a, int b) { return a < b ? a : b; }
int main() {
int N;
scanf("%d", &N);
int free = 0;
for (int i = 0; i < N; i++) {
int x;
scanf("%d", &x);
if (x > 3199)
free++;
else
cnt[x / 400]++;
}
... | [
"call.remove",
"call.arguments.change"
] | 1,368,511 | 1,368,512 | u201623715 | cpp |
p03695 | #include "bits/stdc++.h"
using namespace std;
int getcolor(int value) {
if (value <= 399)
return 0;
if (value <= 799)
return 1;
if (value <= 1199)
return 2;
if (value <= 1599)
return 3;
if (value <= 1999)
return 4;
if (value <= 2399)
return 5;
if (value <= 2799)
return 6;
if ... | #include "bits/stdc++.h"
using namespace std;
int getcolor(int value) {
if (value <= 399)
return 0;
if (value <= 799)
return 1;
if (value <= 1199)
return 2;
if (value <= 1599)
return 3;
if (value <= 1999)
return 4;
if (value <= 2399)
return 5;
if (value <= 2799)
return 6;
if ... | [
"call.remove",
"call.arguments.change"
] | 1,368,515 | 1,368,516 | u251828455 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pi 3.14159265358979323846264
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vl vector<long long>
#define vpii vector<pair<int, int>>
#define ll long long
#define fi first
#define se second
i... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define pi 3.14159265358979323846264
#define pii pair<int, int>
#define pb push_back
#define mp make_pair
#define vi vector<int>
#define vl vector<long long>
#define vpii vector<pair<int, int>>
#define ll long long
#define fi first
#define se second
i... | [
"call.add",
"call.arguments.change"
] | 1,368,517 | 1,368,518 | u471585927 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef v... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) REP(i, 0, n)
#define REP(i, s, e) for (int i = (s); i < (int)(e); i++)
#define pb push_back
#define all(r) r.begin(), r.end()
#define rall(r) r.rbegin(), r.rend()
#define fi first
#define se second
typedef long long ll;
typedef vector<int> vi;
typedef v... | [
"assignment.change"
] | 1,368,519 | 1,368,520 | u912359563 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"call.arguments.change"
] | 1,368,523 | 1,368,524 | u452725238 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, a, b) ... | [
"call.add",
"call.arguments.add"
] | 1,368,525 | 1,368,526 | u016572066 | cpp |
p03697 | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus >= 201703L
#pragma GCC target("avx2")
#else
#pragma GCC target("avx")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFIN... | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus >= 201703L
#pragma GCC target("avx2")
#else
#pragma GCC target("avx")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFIN... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,540 | 1,368,541 | u261538386 | cpp |
p03697 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
int b;
int ans = 0;
cin >> a, b;
ans = a + b;
if (ans >= 10) {
cout << "error";
} else {
cout << ans;
}
} | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int a;
int b;
int ans = 0;
cin >> a >> b;
ans = a + b;
if (ans >= 10) {
cout << "error";
} else {
cout << ans;
}
} | [] | 1,368,555 | 1,368,556 | u713981799 | 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,368,557 | 1,368,558 | u432332916 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
#define dhoom \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | #include <bits/stdc++.h>
using namespace std;
#define dhoom \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
typedef long ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,582 | 1,368,583 | u708590262 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, B;
cin >> A, B;
if (A + B >= 10) {
cout << "error";
return 0;
}
cout << A + B;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int A, B;
cin >> A >> B;
if (A + B >= 10) {
cout << "error";
return 0;
}
cout << A + B;
return 0;
} | [] | 1,368,584 | 1,368,585 | u965730380 | cpp |
p03697 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
#define endl "\n"
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 <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <vector>
#define endl "\n"
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;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,586 | 1,368,587 | u345207975 | cpp |
p03697 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 1; i <= (int)(n); i++)
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 = 1; i <= (int)(n); i++)
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,593 | 1,368,594 | u431458875 | 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,368,595 | 1,368,596 | u513547482 | cpp |
p03697 | #include <bits/stdc++.h>
#include <cmath>
#include <assert.h> // LON
#include <math.h> // sqrt()
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
//#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
// typedef pair<int, int> P;
typedef pair<ll, ll> P;... | #include <bits/stdc++.h>
#include <cmath>
#include <assert.h> // LON
#include <math.h> // sqrt()
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
//#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) ll(x.size())
typedef long long ll;
// typedef pair<int, int> P;
typedef pair<ll, ll> P;... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,597 | 1,368,598 | u564182781 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const lo... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const lo... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,599 | 1,368,600 | u474551232 | 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;
} | #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;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,605 | 1,368,606 | u472645805 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int x, y, sum1;
cin >> x >> y;
sum1 = x + y;
if (sum1 <= 10)
cout << "error";
else
cout << sum1;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int x, y, sum1;
cin >> x >> y;
sum1 = x + y;
if (sum1 >= 10)
cout << "error";
else
cout << sum1;
return 0;
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,613 | 1,368,614 | u871166059 | cpp |
p03697 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int r;
if ((r = a + b) <= 10) {
cout << r;
} else {
cout << "error";
}
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int r;
if ((r = a + b) < 10) {
cout << r;
} else {
cout << "error";
}
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,623 | 1,368,624 | u021358975 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n + m > 10) {
cout << "error" << endl;
} else {
cout << n + m << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
if (n + m >= 10) {
cout << "error" << endl;
} else {
cout << n + m << endl;
}
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,629 | 1,368,630 | u682828614 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int n = a + b;
if (n < 10)
cout << n << endl;
else
cout << 'error' << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
int n = a + b;
if (n < 10)
cout << n << endl;
else
cout << "error" << endl;
}
| [
"io.output.change",
"literal.string.change"
] | 1,368,639 | 1,368,640 | u672611103 | 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;
}
} | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,641 | 1,368,642 | u357752130 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b == 10 || a + b > 10) {
cout << "Error";
} else {
cout << a + b;
}
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b == 10 || a + b > 10) {
cout << "error";
} else {
cout << a + b;
}
return 0;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,368,643 | 1,368,644 | u529551983 | cpp |
p03697 | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
const int... | #include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = m; i < (n); i++)
#define RFOR(i, m, n) for (int i = (m - 1); i >= 0; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, n, 0)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
typedef long long ll;
const int... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 1,368,653 | 1,368,654 | u576320075 | 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 << 10 << 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;
}
} | [
"io.output.change"
] | 1,368,655 | 1,368,656 | u191085802 | cpp |
p03697 | #include <bits/stdc++.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a + b > 10)
printf("error");
else
printf("%d", a + b);
} | #include <bits/stdc++.h>
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a + b >= 10)
printf("error");
else
printf("%d", a + b);
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,659 | 1,368,660 | u033208015 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 10 || a > 10 || b > 10)
cout << "error" << endl;
else
cout << a + b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10 || a > 10 || b > 10)
cout << "error" << endl; //如果a+b大于等于10，输出error
else
cout << a + b << endl; //否则输出a+b
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,669 | 1,368,670 | u263933075 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
int a, b;
cin >> a >> b;
if (a + b > 10 || a > 10 || b > 10)
cout << "error" << endl;
else
cout << a + b << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10 || a > 10 || b > 10)
cout << "error" << endl;
else
cout << a + b << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,669 | 1,368,671 | u263933075 | cpp |
p03697 | #include <iostream>
using namespace std;
int main(void) {
int a, b;
cin >> a >> b;
if ((a + b) <= 10) {
puts("error");
} 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) {
puts("error");
} else {
cout << a + b << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,672 | 1,368,673 | u793856757 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
long long a, b;
cin >> a >> b;
if (a + b > 10)
cout << "error";
else
cout << a + b;
return 0;
} | #include <iostream>
using namespace std;
int main() {
long long 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,674 | 1,368,675 | u582970594 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a + b >= 10)
cout << "errow";
else
cout << a + b;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a, b;
int main() {
cin >> a >> b;
if (a + b >= 10)
cout << "error";
else
cout << a + b;
return 0;
} | [
"literal.string.change",
"io.output.change"
] | 1,368,676 | 1,368,677 | u476418095 | cpp |
p03697 | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD1 = 998244353;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
int a, b;
cin >> ... | #include <bits/stdc++.h>
#define rep(i, n) for (long long i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD1 = 998244353;
ll gcd(ll x, ll y) {
if (y == 0)
return x;
else
return gcd(y, x % y);
}
int main() {
int a, b;
cin >> ... | [
"control_flow.branch.if.condition.change",
"literal.string.change",
"io.output.change"
] | 1,368,678 | 1,368,679 | u371149954 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
template <class T> i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define SORT(a) sort((a).begin(), (a).end())
#define rSORT(a) reverse((a).begin(), (a).end())
#define For(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
template <class T> i... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,368,680 | 1,368,681 | u298620933 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0... | [
"control_flow.branch.if.condition.change"
] | 1,368,682 | 1,368,683 | u427344224 | cpp |
p03697 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,684 | 1,368,685 | u221285045 | cpp |
p03697 | #include <bits/stdc++.h>
#include <iomanip>
#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 <bits/stdc++.h>
#include <iomanip>
#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;
}
} | [
"io.output.change",
"literal.string.change"
] | 1,368,688 | 1,368,689 | u353748264 | 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,368,692 | 1,368,693 | u608258653 | 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,696 | 1,368,697 | u936602931 | 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,696 | 1,368,698 | u936602931 | cpp |
p03697 | #include <iostream>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b <= 10)
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";
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,701 | 1,368,702 | u639300218 | 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;
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,368,705 | 1,368,706 | u619613160 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmin(T &a, const U ... | #include <bits/stdc++.h>
using namespace std;
#define INF 1001001001
#define LINF 1001001001001001001
#define MOD 1000000007
#define MOD2 998244353
template <class T, class U> bool chmax(T &a, const U &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T, class U> bool chmin(T &a, const U ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,707 | 1,368,708 | u355424600 | cpp |
p03697 | #include <bits/stdc++.h>
#define rep(i, n) for (long i = 0; i < n; i++)
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10)
cout << "erroe" << endl;
else
cout << a + b << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (long i = 0; i < n; i++)
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,368,709 | 1,368,710 | u548977290 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.