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 <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF (long)1e9
const int MOD = 1e9 + 7;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
using namespace std;
typedef... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define INF (long)1e9
const int MOD = 1e9 + 7;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
using namespace std;
typedef... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 1,367,135 | 1,367,136 | u952094438 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#in... | [
"call.remove",
"call.arguments.change"
] | 1,367,137 | 1,367,138 | u134810655 | cpp |
p03695 | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
bool color[8] = {false};
int rate;
int under_cnt = 0;
int over_cnt = 0;
int i;
for (i = 1; i <= n; i++) {
cin >> rate;
if (rate >= 3200) {
over_cnt++;
} else {
if (color[rate / 400] == false) {
u... | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
bool color[8] = {false};
int rate;
int under_cnt = 0;
int over_cnt = 0;
int i;
for (i = 1; i <= n; i++) {
cin >> rate;
if (rate >= 3200) {
over_cnt++;
} else {
if (color[rate / 400] == false) {
u... | [
"call.remove",
"call.arguments.change"
] | 1,367,141 | 1,367,142 | u178152729 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
bool col[8];
int main() {
int n;
cin >> n;
int a;
int artf = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < 400)
col[0] = true;
if (a >= 400 && a < 800)
col[1] = true;
if (a >= 800 && a < 1200)
col[2] = true;
if (a >= 120... | #include <bits/stdc++.h>
using namespace std;
bool col[8];
int main() {
int n;
cin >> n;
int a;
int artf = 0;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < 400)
col[0] = true;
if (a >= 400 && a < 800)
col[1] = true;
if (a >= 800 && a < 1200)
col[2] = true;
if (a >= 1200... | [
"call.remove",
"call.arguments.change"
] | 1,367,143 | 1,367,144 | u013628553 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
bool color[8];
int main() {
int N;
cin >> N;
int all = 0;
REP(i, N) {
... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <limits.h>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
bool color[8];
int main() {
int N;
cin >> N;
int all = 0;
REP(i, N) {
... | [
"call.remove",
"call.arguments.change"
] | 1,367,145 | 1,367,146 | u666394517 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
bool b[8] = {false};
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 8; j++) {
if (a[i] >= j * 400 && a[i] < (j + 1) * 400) {
b[j] = true;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
bool b[8] = {false};
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 8; j++) {
if (a[i] >= j * 400 && a[i] < (j + 1) * 400) {
b[j] = true;
... | [
"expression.operation.binary.remove"
] | 1,367,155 | 1,367,156 | u357265888 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
bool b[8] = {false};
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 8; j++) {
if (a[i] >= j * 400 && a[i] < (j + 1) * 400) {
b[j] = true;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
bool b[8] = {false};
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 8; j++) {
if (a[i] >= j * 400 && a[i] < (j + 1) * 400) {
b[j] = true;
... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,367,157 | 1,367,156 | u357265888 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
bool b[8] = {false};
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 8; j++) {
if (a[i] >= j * 400 && a[i] < (j + 1) * 400) {
b[j] = true;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
bool b[8] = {false};
int sum = 0;
for (int i = 0; i < n; i++) {
for (int j = 0; j < 8; j++) {
if (a[i] >= j * 400 && a[i] < (j + 1) * 400) {
b[j] = true;
... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,367,158 | 1,367,156 | u357265888 | cpp |
p03695 | #include <bits/stdc++.h>
#include <tuple>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &e : a)
cin >> e;
int color[8] = {};
int crown = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < 3200)
color[a[i] / 400]++;
else
crown++;
}
... | #include <bits/stdc++.h>
#include <tuple>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (auto &e : a)
cin >> e;
int color[8] = {};
int crown = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < 3200)
color[a[i] / 400]++;
else
crown++;
}
... | [
"call.remove",
"call.arguments.change"
] | 1,367,159 | 1,367,160 | u054652697 | cpp |
p03695 | #include "bits/stdc++.h"
using namespace std;
int chk(int a) {
if (a < 400)
return 0;
if (a < 800)
return 1;
if (a < 1200)
return 2;
if (a < 1600)
return 3;
if (a < 2000)
return 4;
if (a < 2400)
return 5;
if (a < 2800)
return 6;
if (a < 3200)
return 7;
return 8;
}
int... | #include "bits/stdc++.h"
using namespace std;
int chk(int a) {
if (a < 400)
return 0;
if (a < 800)
return 1;
if (a < 1200)
return 2;
if (a < 1600)
return 3;
if (a < 2000)
return 4;
if (a < 2400)
return 5;
if (a < 2800)
return 6;
if (a < 3200)
return 7;
return 8;
}
int... | [
"call.add",
"call.arguments.change"
] | 1,367,161 | 1,367,162 | u753391427 | cpp |
p03695 | #include <stdio.h>
int getBlock(int rating) {
if (rating < 400)
return 1;
else if (rating < 800)
return 2;
else if (rating < 1200)
return 3;
else if (rating < 1600)
return 4;
else if (rating < 2000)
return 5;
else if (rating < 2400)
return 6;
else if (rating < 2800)
return 7;
... | #include <stdio.h>
int getBlock(int rating) {
if (rating < 400)
return 1;
else if (rating < 800)
return 2;
else if (rating < 1200)
return 3;
else if (rating < 1600)
return 4;
else if (rating < 2000)
return 5;
else if (rating < 2400)
return 6;
else if (rating < 2800)
return 7;
... | [
"call.remove",
"call.arguments.change"
] | 1,367,167 | 1,367,168 | u164903062 | cpp |
p03695 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> rate = {0, 0, 0, 0, 0, 0, 0, 0, 0};
for (int i = 0; i < N; i++) {
if (a[i] < 3200) {
rate[a[i] / 400]++;
} else {
rate[8]++;
... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
vector<int> rate = {0, 0, 0, 0, 0, 0, 0, 0, 0};
for (int i = 0; i < N; i++) {
if (a[i] < 3200) {
rate[a[i] / 400]++;
} else {
rate[8]++;
... | [
"call.remove",
"call.arguments.change"
] | 1,367,174 | 1,367,175 | u365956698 | cpp |
p03695 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef long lon... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
typedef long lon... | [
"call.remove",
"call.arguments.change"
] | 1,367,182 | 1,367,183 | u484460274 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int n;
int a[110];
bool color[8] = {false};
int freecolor = 0, ans = 0;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i) {
int num = a[i] / 400;
if (num >= 8)
++freecolor;
else if (!color[num]) {
... | #include <iostream>
using namespace std;
int main() {
int n;
int a[110];
bool color[8] = {false};
int freecolor = 0, ans = 0;
cin >> n;
for (int i = 0; i < n; ++i)
cin >> a[i];
for (int i = 0; i < n; ++i) {
int num = a[i] / 400;
if (num >= 8)
++freecolor;
else if (!color[num]) {
... | [
"expression.unary.arithmetic.add"
] | 1,367,184 | 1,367,185 | u985281265 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#include <utility>
using namespace std;
int main() {
int n, a[100], f[8] = {}, sum = 0, cnt = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] < 3200)
f[a[i] / 400] = 1;
else
cnt++;
}
for (int i = 0; i < 8; i++)
s... | #include <algorithm>
#include <cstdio>
#include <utility>
using namespace std;
int main() {
int n, a[100], f[8] = {}, sum = 0, cnt = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a[i]);
if (a[i] < 3200)
f[a[i] / 400] = 1;
else
cnt++;
}
for (int i = 0; i < 8; i++)
s... | [
"call.remove",
"call.arguments.change"
] | 1,367,190 | 1,367,191 | u855429581 | cpp |
p03695 | #include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> clrs(9, 0);
rep(i, N) {
int tmp;
cin >> tmp;
int index = min(tmp / 400... | #include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <vector>
#define rep(i, N) for (int(i) = 0; (i) < (N); (i)++)
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
vector<int> clrs(9, 0);
rep(i, N) {
int tmp;
cin >> tmp;
int index = min(tmp / 400... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,367,196 | 1,367,197 | u426057057 | cpp |
p03695 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
static const int INF = 1000000007;
using ll = long long;
using namespace std;
int main() {
vector<int> v(9, 0);
int n, ans = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
v[m... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
static const int INF = 1000000007;
using ll = long long;
using namespace std;
int main() {
vector<int> v(9, 0);
int n, ans = 0;
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
v[m... | [
"call.add",
"call.arguments.add"
] | 1,367,198 | 1,367,199 | u915020369 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << endl
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> V;
int main() {
int n;
cin >> n;
int color[10] = {};
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
if (tmp >= 3200)
tmp = 3200;
color... | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << endl
typedef long long ll;
typedef pair<int, int> pi;
typedef vector<int> V;
int main() {
int n;
cin >> n;
int color[10] = {};
for (int i = 0; i < n; i++) {
int tmp;
cin >> tmp;
if (tmp >= 3200)
tmp = 3200;
color... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,367,200 | 1,367,201 | u572665222 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define euc_dis(x, y) sqrt(x *x + y * y)
#define pb push_back
#define mp make_pair
#define INF 999999999
#define MOD 1000000007
#define sp ' '
#define ALL(a... | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define euc_dis(x, y) sqrt(x *x + y * y)
#define pb push_back
#define mp make_pair
#define INF 999999999
#define MOD 1000000007
#define sp ' '
#define ALL(a... | [
"call.remove",
"call.arguments.change"
] | 1,367,202 | 1,367,203 | u306142032 | cpp |
p03695 | #include <cstdio>
int min(int a, int b) { return (a > b ? b : a); }
int max(int a, int b) { return (a > b ? a : b); }
int main() {
int n, t;
scanf("%d", &n);
int arr[9] = {0};
for (auto i = 0; i < n; i++) {
scanf("%d", &t);
arr[min(t / 400, 8)]++;
}
t = 0;
for (auto i = 0; i < 8; i++)
if (ar... | #include <cstdio>
int min(int a, int b) { return (a > b ? b : a); }
int max(int a, int b) { return (a > b ? a : b); }
int main() {
int n, t;
scanf("%d", &n);
int arr[9] = {0};
for (auto i = 0; i < n; i++) {
scanf("%d", &t);
arr[min(t / 400, 8)]++;
}
t = 0;
for (auto i = 0; i < 8; i++)
if (ar... | [
"call.remove",
"call.arguments.change"
] | 1,367,204 | 1,367,205 | u876875284 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (i = 0; i < n; i++)
#define REPR(i, n) for (i = n; i >= 0; i--)
#define FOR(i, m, n) for (i = m; i < n; i++)
#define max(a, b) ((a) > (b) ? (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (i = 0; i < n; i++)
#define REPR(i, n) for (i = n; i >= 0; i--)
#define FOR(i, m, n) for (i = m; i < n; i++)
#define max(a, b) ((a) > (b) ? (... | [
"call.remove",
"call.arguments.change"
] | 1,367,212 | 1,367,213 | u768152935 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (i = 0; i < n; i++)
#define REPR(i, n) for (i = n; i >= 0; i--)
#define FOR(i, m, n) for (i = m; i < n; i++)
#define max(a, b) ((a) > (b) ? (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define REP(i, n) for (i = 0; i < n; i++)
#define REPR(i, n) for (i = n; i >= 0; i--)
#define FOR(i, m, n) for (i = m; i < n; i++)
#define max(a, b) ((a) > (b) ? (... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"call.remove",
"call.arguments.change"
] | 1,367,214 | 1,367,213 | u768152935 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, fc = 0, N, mini = 0, mx = 0;
bool color[8] = {0, 0, 0, 0, 0, 0, 0, 0};
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 400) {
color[0] = true;
} else if (a < 800) {
color[1] = true;
} else if (a < 1200) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, fc = 0, N, mini = 0, mx = 0;
bool color[8] = {0, 0, 0, 0, 0, 0, 0, 0};
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 400) {
color[0] = true;
} else if (a < 800) {
color[1] = true;
} else if (a < 1200) {
... | [
"call.remove",
"call.arguments.change"
] | 1,367,217 | 1,367,218 | u988542029 | cpp |
p03695 | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define Nmax 200010
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define RFOR(i, a, b) for (long long i = (b - 1); i >= a; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ITR(itr, mp) for (auto itr = (mp).beg... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define Nmax 200010
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define RFOR(i, a, b) for (long long i = (b - 1); i >= a; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ITR(itr, mp) for (auto itr = (mp).beg... | [
"call.remove",
"call.arguments.change"
] | 1,367,221 | 1,367,222 | u969059993 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define itn long long
typedef long long ll;
typedef pair<ll, ll> p;
int main() {
// #define int long long
int n;
cin >> n;
vector... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define itn long long
typedef long long ll;
typedef pair<ll, ll> p;
int main() {
// #define int long long
int n;
cin >> n;
vector... | [] | 1,367,223 | 1,367,224 | u916743460 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int n, a[100], c[8] = {0, 0, 0, 0, 0, 0, 0, 0}, f = 0, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
if (a[i] < 400)
c[0]++;
if (a[i] >= 400 && a[i] < 800)
c[1]++;
if (a[i] >= 800 && a[i... | #include <iostream>
using namespace std;
int main() {
int n, a[100], c[8] = {0, 0, 0, 0, 0, 0, 0, 0}, f = 0, ans = 0;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
if (a[i] < 400)
c[0]++;
if (a[i] >= 400 && a[i] < 800)
c[1]++;
if (a[i] >= 800 && a[i... | [
"call.remove",
"call.arguments.change"
] | 1,367,229 | 1,367,230 | u006686215 | cpp |
p03695 | #include <bits/stdc++.h>
#include <cxxabi.h>
#include <typeinfo>
#ifdef LOCAL
#include "dbgtoki.hpp"
#define DUMP(i) \
dump((string)TOSTRING(i), demangle(typeid(i).name()), __LINE__, i)
#else
#define DUMP(i)
#endif
using namespace std;
#define TOSTRING(x... | #include <bits/stdc++.h>
#include <cxxabi.h>
#include <typeinfo>
#ifdef LOCAL
#include "dbgtoki.hpp"
#define DUMP(i) \
dump((string)TOSTRING(i), demangle(typeid(i).name()), __LINE__, i)
#else
#define DUMP(i)
#endif
using namespace std;
#define TOSTRING(x... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,367,231 | 1,367,232 | u137332130 | cpp |
p03695 | #include <bits/stdc++.h>
#include <cxxabi.h>
#include <typeinfo>
#ifdef LOCAL
#include "dbgtoki.hpp"
#define DUMP(i) \
dump((string)TOSTRING(i), demangle(typeid(i).name()), __LINE__, i)
#else
#define DUMP(i)
#endif
using namespace std;
#define TOSTRING(x... | #include <bits/stdc++.h>
#include <cxxabi.h>
#include <typeinfo>
#ifdef LOCAL
#include "dbgtoki.hpp"
#define DUMP(i) \
dump((string)TOSTRING(i), demangle(typeid(i).name()), __LINE__, i)
#else
#define DUMP(i)
#endif
using namespace std;
#define TOSTRING(x... | [
"call.add",
"call.arguments.change"
] | 1,367,233 | 1,367,232 | u137332130 | cpp |
p03695 | //
// main.cpp
// atcoderX
//
// Created by 村井真奈美 on 2018/06/16.
// Copyright © 2018年 村井真奈美. All rights reserved.
//
#include <iostream>
#include <vector>
using namespace std;
void min(int x) {
if (x == 0)
cout << 1 << " ";
else
cout << x << " ";
return;
}
void max(int x, int y) {
while (x < 8 &... | #include <iostream>
#include <vector>
using namespace std;
void min(int x) {
if (x == 0)
cout << 1 << " ";
else
cout << x << " ";
return;
}
void max(int x, int y) {
while (y > 0) {
x++;
y--;
}
cout << x << endl;
return;
}
int main() {
int N;
cin >> N;
int rate[N];
vector<int> ... | [
"expression.operation.binary.remove"
] | 1,367,236 | 1,367,237 | u381585104 | cpp |
p03695 | #include <iostream>
#include <vector>
using namespace std;
void min(int x) {
if (x == 0)
cout << 1 << " ";
else
cout << x << " ";
return;
}
void max(int x, int y) {
while (x < 8 && y > 0) {
x++;
y--;
}
cout << x << endl;
return;
}
int main() {
int N;
cin >> N;
int rate[N];
vec... | #include <iostream>
#include <vector>
using namespace std;
void min(int x) {
if (x == 0)
cout << 1 << " ";
else
cout << x << " ";
return;
}
void max(int x, int y) {
while (y > 0) {
x++;
y--;
}
cout << x << endl;
return;
}
int main() {
int N;
cin >> N;
int rate[N];
vector<int> ... | [
"expression.operation.binary.remove"
] | 1,367,238 | 1,367,237 | u381585104 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int INF = 1e9 + 7;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, a;
cin >> n;
vector... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int INF = 1e9 + 7;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int n, a;
cin >> n;
vector... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,367,251 | 1,367,252 | u049420296 | cpp |
p03695 | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define dump(x) cout << #x << " = " << (x) << endl;
#define debug(x) ... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define dump(x) cout << #x << " = " << (x) << endl;
#define debug(x) ... | [
"expression.unary.arithmetic.add"
] | 1,367,253 | 1,367,254 | u239493918 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int b[10] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 400) {
b[0]++;
} el... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
int b[10] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 400) {
b[0]++;
} el... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,367,257 | 1,367,258 | u646339490 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> color(9);
for (int i = 0; i < 9; i++) {
color[i] = 0;
}
for (int i = 0; i < n; i++) {
if (a[i] / 400 < 3200) {
color[(int)a[i]... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> color(9);
for (int i = 0; i < 9; i++) {
color[i] = 0;
}
for (int i = 0; i < n; i++) {
if (a[i] < 3200) {
color[(int)(a[i] / 40... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,367,264 | 1,367,265 | u833272463 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REAP(i, a, n) for (int i = (a); i < (n); i++)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define fr first
#define sc second
#define pb push_back
#define All(v) v.begin(), v.end()
typedef long lo... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REAP(i, a, n) for (int i = (a); i < (n); i++)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define fr first
#define sc second
#define pb push_back
#define All(v) v.begin(), v.end()
typedef long lo... | [
"call.add",
"call.arguments.change"
] | 1,367,268 | 1,367,269 | u207308907 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a;
int gray = 0, brown = 0, green = 0, light_blue = 0, blue = 0, yellow = 0,
orange = 0, red = 0;
int count = 0;
for (int i = 0; i < N; i++) {
cin >> a;
if (a <... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a;
int gray = 0, brown = 0, green = 0, light_blue = 0, blue = 0, yellow = 0,
orange = 0, red = 0;
int count = 0;
for (int i = 0; i < N; i++) {
cin >> a;
if (a <... | [
"identifier.change",
"io.output.change",
"expression.operation.binary.remove"
] | 1,367,270 | 1,367,271 | u281384315 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | [
"call.remove",
"call.arguments.change"
] | 1,367,281 | 1,367,282 | u745906650 | cpp |
p03695 |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i,... |
#include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i,... | [
"assignment.change"
] | 1,367,288 | 1,367,289 | u859396346 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0, c = 0;
cin >> n;
int a[n];
bool ex[8];
memset(ex, false, sizeof(ex));
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0, c = 0;
cin >> n;
int a[n];
bool ex[8];
memset(ex, false, sizeof(ex));
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, ... | [
"call.remove",
"call.arguments.change"
] | 1,367,290 | 1,367,291 | u080401828 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0, c = 0;
cin >> n;
int a[n];
bool ex[8];
memset(ex, false, sizeof(ex));
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0, c = 0;
cin >> n;
int a[n];
bool ex[8];
memset(ex, false, sizeof(ex));
for (int i = 0; i < n; i++)
cin >> a[i];
sort(a, ... | [
"literal.number.change",
"io.output.change",
"call.remove",
"call.arguments.change"
] | 1,367,292 | 1,367,291 | u080401828 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> A(n);
REP(i, n) cin >> A[i];
vector<int> B(8, 0);
int r = 0;
REP(i, n) {
if (A[i] < 3200)
B[A[i] / 400]++;
els... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> A(n);
REP(i, n) cin >> A[i];
vector<int> B(8, 0);
int r = 0;
REP(i, n) {
if (A[i] < 3200)
B[A[i] / 400]++;
els... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,367,297 | 1,367,298 | u136869985 | cpp |
p03695 | #include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
#define YES(condition) \
if (condition) \
cout << "YES" << endl; ... | #include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
#define YES(condition) \
if (condition) \
cout << "YES" << endl; ... | [
"call.remove",
"call.arguments.change"
] | 1,367,304 | 1,367,305 | u115888500 | cpp |
p03695 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
bool if_color[8];
int chameleon = 0;
for (int i = 0; i < 8; i++) {
if_color[i] = false;
}
for (int i = 0; i < N; i++) {
int rate;
cin >> rate;
bool if_chose = false;
for (int j = 0; j < 8; j++)... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
bool if_color[8];
int chameleon = 0;
for (int i = 0; i < 8; i++) {
if_color[i] = false;
}
for (int i = 0; i < N; i++) {
int rate;
cin >> rate;
bool if_chose = false;
for (int j = 0; j < 8; j++)... | [
"call.remove",
"call.arguments.change"
] | 1,367,306 | 1,367,307 | u115888500 | cpp |
p03695 | #include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout <<... | // G++ MACRO.CPP -STD=C++17
#include <bits/stdc++.h>
typedef long long ll;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl... | [
"expression.operation.binary.remove"
] | 1,367,312 | 1,367,313 | u705918648 | cpp |
p03695 | #include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
int main() {
int li[10] = {};
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
li[std::min(8, a / 400)]++;
}
int c = 0;
for (int i = 0; i < 8; i++)
if (li[i])
c++;
cout << c << " " << c + ... | #include <bits/stdc++.h>
using std::cin;
using std::cout;
using std::endl;
int main() {
int li[10] = {};
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
li[std::min(8, a / 400)]++;
}
int c = 0;
for (int i = 0; i < 8; i++)
if (li[i])
c++;
cout << (c ? c : 1) << "... | [] | 1,367,314 | 1,367,315 | u424655672 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<bool> v(8, false);
int cnt = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
for (int i = 1; i <= 8; i++) {
if (x < i * 400) {
v[i - 1] = true;
break;
}
}
if (x >= 3200) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<bool> v(8, false);
int cnt = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
for (int i = 1; i <= 8; i++) {
if (x < i * 400) {
v[i - 1] = true;
break;
}
}
if (x >= 3200) {
... | [
"call.add",
"call.arguments.add"
] | 1,367,322 | 1,367,323 | u219873012 | cpp |
p03695 | #include <cstdio>
#include <iostream>
using namespace std;
int a[10];
int main() {
int n;
cin >> n;
int t = 0;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
if (k < 3200)
a[k / 400]++;
else
t++;
}
int u = 0;
for (int i = 0; i < 8; i++) {
if (a[i] > 0)
u++;
}
co... | #include <cstdio>
#include <iostream>
using namespace std;
int a[10];
int main() {
int n;
cin >> n;
int t = 0;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
if (k < 3200)
a[k / 400]++;
else
t++;
}
int u = 0;
for (int i = 0; i < 8; i++) {
if (a[i] > 0)
u++;
}
co... | [
"call.add",
"call.arguments.add"
] | 1,367,337 | 1,367,338 | u521364030 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int rate[9] = {0};
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (a < 400)
rate[0]++;
else if (a < 800)
rate[1]++;
else if (a < 1200)
rate[2]++;
else if (a < 1600)
rate[3]++;
else ... | #include <bits/stdc++.h>
using namespace std;
int rate[9] = {0};
int main() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (a < 400)
rate[0]++;
else if (a < 800)
rate[1]++;
else if (a < 1200)
rate[2]++;
else if (a < 1600)
rate[3]++;
else ... | [
"call.remove",
"call.arguments.change"
] | 1,367,339 | 1,367,340 | u823112986 | cpp |
p03695 | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <cmath>
#include <cstdlib>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(8, 0);
int max = 0, ans = 0;
for... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <queue>
#include <stack>
#include <string>
#include <utility>
#include <vector>
//#include <cmath>
#include <cstdlib>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(8, 0);
int max = 0, ans = 0;
for... | [
"io.output.change"
] | 1,367,341 | 1,367,342 | u548768105 | cpp |
p03695 | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int color[9] = {};
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
color[min(8, a / 400)]++;
}
int n = 0;
for (int i = 0; i < 8; i++)
if (color[i] > 0)
n++;
if (n == 0 && color[8] > 0) ... | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int color[9] = {};
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
color[min(8, a / 400)]++;
}
int n = 0;
for (int i = 0; i < 8; i++)
if (color[i] > 0)
n++;
if (n == 0 && color[8] > 0) ... | [
"call.remove",
"call.arguments.change"
] | 1,367,343 | 1,367,344 | u437849630 | cpp |
p03695 | #include <bits/stdc++.h>
//---------------------------
using namespace std;
//---------------------------
#define REP(i, n) for (int i = 0; i < (n); i++)
#define P(x) cout << (x) << "\n"
#define MOD 1e9 + 7
#define PI acos(-1.0)
#define ll long long
#define INF 1000000001
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0,... | #include <bits/stdc++.h>
//---------------------------
using namespace std;
//---------------------------
#define REP(i, n) for (int i = 0; i < (n); i++)
#define P(x) cout << (x) << "\n"
#define MOD 1e9 + 7
#define PI acos(-1.0)
#define ll long long
#define INF 1000000001
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0,... | [
"call.add",
"call.arguments.change"
] | 1,367,345 | 1,367,346 | u421777980 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int n;
int c = 0;
int k = 0;
bool ra[8] = {0};
cin >> n;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
int r = s / 400;
if (r >= 8) {
k++;
} else {
if (!ra[r]) {
ra[r] = true;
c++;
}
}
}
cout... | #include <iostream>
using namespace std;
int main() {
int n;
int c = 0;
int k = 0;
bool ra[8] = {0};
cin >> n;
for (int i = 0; i < n; i++) {
int s;
cin >> s;
int r = s / 400;
if (r >= 8) {
k++;
} else {
if (!ra[r]) {
ra[r] = true;
c++;
}
}
}
cout... | [
"call.remove",
"call.arguments.change"
] | 1,367,350 | 1,367,351 | u258989125 | cpp |
p03695 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORq(i, m, n) for (int i = m; i <= n; i++)
#define SCD(n) scanf("%d", &n)
#define SCD2(m, n) scanf("%d%d", &m, &n)
#define PRINTD(n) printf("%d\n", n)
using namespa... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <iostream>
#include <map>
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORq(i, m, n) for (int i = m; i <= n; i++)
#define SCD(n) scanf("%d", &n)
#define SCD2(m, n) scanf("%d%d", &m, &n)
#define PRINTD(n) printf("%d\n", n)
using namespa... | [
"call.remove",
"call.arguments.change"
] | 1,367,354 | 1,367,355 | u236433947 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define EPS (1e-7)
#define INF (1 << 25)
#define PI (acos(-1))
#define FOR(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)
#define REP(i, n) FOR(i, 0, n)
#define whole(f, x, ...) \
([&](decltype((x)) who... | #include <bits/stdc++.h>
using namespace std;
#define EPS (1e-7)
#define INF (1 << 25)
#define PI (acos(-1))
#define FOR(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)
#define REP(i, n) FOR(i, 0, n)
#define whole(f, x, ...) \
([&](decltype((x)) who... | [
"call.add",
"call.arguments.change"
] | 1,367,356 | 1,367,357 | u142014975 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int n, cnt;
set<string> rate;
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (1 <= x && x <= 399)
rate.insert("gray");
else if (400 <= x && x <= 799)
rate.insert("brown");
else if (800 <= x && x <= 1199)
... | #include <bits/stdc++.h>
using namespace std;
int n, cnt;
set<string> rate;
int main(void) {
cin >> n;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (1 <= x && x <= 399)
rate.insert("gray");
else if (400 <= x && x <= 799)
rate.insert("brown");
else if (800 <= x && x <= 1199)
... | [] | 1,367,360 | 1,367,361 | u394919721 | cpp |
p03695 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vint = vector<int>;
int main() {
cin.tie(0);
ios::sync_with_... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
using vint = vector<int>;
int main() {
cin.tie(0);
ios::sync_with_... | [
"call.remove",
"call.arguments.change"
] | 1,367,365 | 1,367,366 | u299716553 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <random>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <fstream>
#include <functional>
#include <iostream>
#include <map>
#include <random>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0... | [
"call.add",
"call.arguments.change"
] | 1,367,374 | 1,367,375 | u698760125 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
bool flag[8] = {};
int N, v, a;
int other = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
for (int i = 0; i < 8; i++) {
if (a < 400 * (i + 1)) {
flag[i] = true;
break;
}
}
if (a >= 3200)
other++;
}... | #include <iostream>
using namespace std;
int main() {
bool flag[8] = {};
int N, v, a;
int other = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
for (int i = 0; i < 8; i++) {
if (a < 400 * (i + 1)) {
flag[i] = true;
break;
}
}
if (a >= 3200)
other++;
}... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,367,379 | 1,367,380 | u064359585 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int f[] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200, 100000};
int a[100], r[10];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 9; j++) {
if (a[i] < f[j]) {
... | #include <bits/stdc++.h>
using namespace std;
int f[] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200, 100000};
int a[100], r[10];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &a[i]);
for (int i = 0; i < n; i++) {
for (int j = 0; j < 9; j++) {
if (a[i] < f[j]) {
... | [
"call.remove",
"call.arguments.change"
] | 1,367,385 | 1,367,386 | u691493208 | cpp |
p03695 | // C++14 (Clang 3.8.0)
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#includ... | // C++14 (Clang 3.8.0)
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#includ... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,367,389 | 1,367,390 | u663371594 | cpp |
p03695 | // C++14 (Clang 3.8.0)
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#includ... | // C++14 (Clang 3.8.0)
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#includ... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"expression.operation.binary.remove"
] | 1,367,391 | 1,367,390 | u663371594 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define P(p) cout << (p) << endl
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (in... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define P(p) cout << (p) << endl
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (in... | [
"call.add",
"call.arguments.add"
] | 1,367,394 | 1,367,395 | u192442087 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define P(p) cout << (p) << endl
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (in... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define P(p) cout << (p) << endl
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (in... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,367,396 | 1,367,395 | u192442087 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define P(p) cout << (p) << endl
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (in... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define P(p) cout << (p) << endl
#define rep(i, m, n) for (int i = (m); i < (int)(n); i++)
#define rrep(i, m, n) for (in... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"call.remove",
"call.arguments.change"
] | 1,367,397 | 1,367,395 | u192442087 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int N, a;
bool colors[8];
int free_colors = 0;
void color_judge(int a) {
for (int i = 1; i <= 8; i++) {
if (a < i * 400) {
colors[i - 1] = true;
r... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int N, a;
bool colors[8];
int free_colors = 0;
void color_judge(int a) {
for (int i = 1; i <= 8; i++) {
if (a < i * 400) {
colors[i - 1] = true;
r... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,367,400 | 1,367,401 | u059727354 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int N, a;
bool colors[8];
int free_colors = 0;
void color_judge(int a) {
for (int i = 1; i <= 8; i++) {
if (a < i * 400) {
colors[i - 1] = true;
r... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <ios>
#include <iostream>
#include <vector>
#define ll long long
using namespace std;
int N, a;
bool colors[8];
int free_colors = 0;
void color_judge(int a) {
for (int i = 1; i <= 8; i++) {
if (a < i * 400) {
colors[i - 1] = true;
r... | [
"call.add",
"call.arguments.add"
] | 1,367,402 | 1,367,401 | u059727354 | cpp |
p03695 | #include <bits/stdc++.h>
#define INF 1 << 29
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
void gen_sosuu(int sosuu[]) {
REP(i, 100010) { sosuu[i] = true; }
sosuu[0] = fals... | #include <bits/stdc++.h>
#define INF 1 << 29
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, k, n) for (int i = (k); i < (int)(n); i++)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
void gen_sosuu(int sosuu[]) {
REP(i, 100010) { sosuu[i] = true; }
sosuu[0] = fals... | [
"call.arguments.change"
] | 1,367,403 | 1,367,404 | u195402105 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = 1e9;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = 1e9;
... | [
"call.remove",
"call.arguments.change"
] | 1,367,405 | 1,367,406 | u711985352 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = 1e9;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
using ll = long long;
const ll INF = 1e9;
... | [
"call.remove",
"call.arguments.change"
] | 1,367,407 | 1,367,406 | u711985352 | cpp |
p03695 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | [
"call.remove",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,367,414 | 1,367,415 | u969039414 | cpp |
p03695 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <condition_va... | [
"literal.number.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,367,416 | 1,367,415 | u969039414 | cpp |
p03695 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, fr = 0, total = 0;
vector<int> co(8, 0);
scanf("%d", &n);
for (int i = 0, j; i < n; ++i) {
scanf("%d", &j);
if (j < 3200) {
j /= 400;
co[j] = 1;
} else {
++fr;
}
}
total = accumulate(co.begin(), co.end(), 0);... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, fr = 0, total = 0;
vector<int> co(8, 0);
scanf("%d", &n);
for (int i = 0, j; i < n; ++i) {
scanf("%d", &j);
if (j < 3200) {
j /= 400;
co[j] = 1;
} else {
++fr;
}
}
total = accumulate(co.begin(), co.end(), 0);... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"io.output.change"
] | 1,367,417 | 1,367,418 | u676010686 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ROF(i, a, b) for (int i = b - 1; i >= a; i--)
#define FI first
#define SE second
#define MA(i, j) make_pair(i, j)
#define PA pair<int, in... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ROF(i, a, b) for (int i = b - 1; i >= a; i--)
#define FI first
#define SE second
#define MA(i, j) make_pair(i, j)
#define PA pair<int, in... | [
"call.add",
"call.arguments.add"
] | 1,367,419 | 1,367,420 | u587366956 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> c(9, 0);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
c[min(a / 400, 8)]++;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (c[i] != 0) {
ans++;
}
}
co... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> c(9, 0);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
c[min(a / 400, 8)]++;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (c[i] != 0) {
ans++;
}
}
co... | [
"call.remove",
"call.arguments.change"
] | 1,367,423 | 1,367,424 | u489536233 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#includ... | #include <algorithm>
#include <bitset>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>
#includ... | [
"assignment.variable.change",
"identifier.change",
"misc.opposites",
"assignment.value.change",
"call.function.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,367,425 | 1,367,426 | u108482030 | cpp |
p03695 | // g++ macro.cpp -std=c++14
#include <bits/stdc++.h> //STL include
typedef long long ll; // long long int
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std; // namespace
#define dump(x) cout << #x << " = " << (x) << endl; // debug cout
#define YES(n) cout << ((n) ? "YES" : "NO"... | // g++ macro.cpp -std=c++14
#include <bits/stdc++.h> //STL include
typedef long long ll; // long long int
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std; // namespace
#define dump(x) cout << #x << " = " << (x) << endl; // debug cout
#define YES(n) cout << ((n) ? "YES" : "NO"... | [
"call.remove",
"call.arguments.change"
] | 1,367,427 | 1,367,428 | u869112787 | cpp |
p03695 | #include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 50;
static const int NIL = -1;
static ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1LL << 50;
static const int NIL = -1;
static ... | [
"literal.number.change",
"assignment.value.change"
] | 1,367,429 | 1,367,430 | u866879589 | cpp |
p03695 | #include <cmath>
#include <iostream>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
int func(int n) {
int res;
if (n < 400)
res = 1;
else if (n < 800)
res = 2;
else if (n < 1200)
res = 3;
else if (n < 1600)
res = 4;
else if (n < 2000)
... | #include <cmath>
#include <iostream>
#define loop(i, a, b) for (int i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
using namespace std;
int func(int n) {
int res;
if (n < 400)
res = 1;
else if (n < 800)
res = 2;
else if (n < 1200)
res = 3;
else if (n < 1600)
res = 4;
else if (n < 2000)
... | [
"call.remove",
"call.arguments.change"
] | 1,367,431 | 1,367,432 | u021140967 | cpp |
p03695 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <str... | [
"call.remove",
"call.arguments.change"
] | 1,367,433 | 1,367,434 | u670220889 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> rate_count(9, 0);
for (int i = 0; i < N; i++) {
int ai_rate;
cin >> ai_rate;
rate_count[min(ai_rate / 400, 8)]++;
}
int exist_rate_count = 0;
for (int i = 0; i < 8; i++... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> rate_count(9, 0);
for (int i = 0; i < N; i++) {
int ai_rate;
cin >> ai_rate;
rate_count[min(ai_rate / 400, 8)]++;
}
int exist_rate_count = 0;
for (int i = 0; i < 8; i++... | [
"call.add",
"call.arguments.add"
] | 1,367,435 | 1,367,436 | u012694084 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
int n, all = 0, ans = 0;
cin >> n;
int color[8] = {};
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200) {
all++;
continue;
}
a /= 400;
if (color[a] ==... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
int main() {
int n, all = 0, ans = 0;
cin >> n;
int color[8] = {};
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200) {
all++;
continue;
}
a /= 400;
if (color[a] ==... | [
"expression.unary.arithmetic.add"
] | 1,367,442 | 1,367,443 | u046768272 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int f[8] = {}, c = 0;
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
if (a >= 3200)
c++;
else
f[a / 400] = 1;
}
int s = count(f, f + 8, 1);
printf("%d %d\... | #include <algorithm>
#include <cstdio>
#include <vector>
using namespace std;
int main() {
int n;
scanf("%d", &n);
int f[8] = {}, c = 0;
for (int i = 0; i < n; i++) {
int a;
scanf("%d", &a);
if (a >= 3200)
c++;
else
f[a / 400] = 1;
}
int s = count(f, f + 8, 1);
printf("%d %d\... | [
"call.remove",
"call.arguments.change"
] | 1,367,444 | 1,367,445 | u092916776 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define FOR(... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)
#define FOR(... | [
"call.remove",
"call.arguments.change"
] | 1,367,449 | 1,367,450 | u486104022 | cpp |
p03695 | #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) {
bool color[8] = {false};
int n;
int a;
int cnt = 0;
cin >> n;
REP(i, n) {
cin >> a;
if (a < 400)
color[0] = true;
else if (a < 800)
... | #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) {
bool color[8] = {false};
int n;
int a;
int cnt = 0;
cin >> n;
REP(i, n) {
cin >> a;
if (a < 400)
color[0] = true;
else if (a < 800)
... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,367,451 | 1,367,452 | u320354968 | cpp |
p03695 | #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;
vector<int> v(n);
rep(i, n) cin >> v[i];
vecto... | #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;
vector<int> v(n);
rep(i, n) cin >> v[i];
vecto... | [
"call.add",
"call.arguments.add"
] | 1,367,453 | 1,367,454 | u864550097 | cpp |
p03695 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include... | [
"call.remove",
"call.arguments.change"
] | 1,367,455 | 1,367,456 | u113268066 | cpp |
p03695 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include ... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include ... | [
"assignment.variable.change",
"identifier.change",
"misc.opposites",
"assignment.value.change",
"call.function.change",
"call.arguments.change",
"literal.number.change"
] | 1,367,468 | 1,367,469 | u098844816 | cpp |
p03695 | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include ... | #define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cctype>
#include <cstdio>
#include <ctype.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include ... | [
"assignment.variable.change",
"identifier.change",
"misc.opposites",
"assignment.value.change",
"call.function.change",
"call.arguments.change",
"literal.number.change"
] | 1,367,470 | 1,367,469 | u098844816 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, j, n) for (int i = (j); i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define pb(x)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, j, n) for (int i = (j); i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define pb(x)... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,367,473 | 1,367,474 | u871239364 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, j, n) for (int i = (j); i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define pb(x)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repp(i, j, n) for (int i = (j); i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define pb(x)... | [
"call.add",
"call.arguments.add"
] | 1,367,475 | 1,367,474 | u871239364 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
set<int> colors;
int libero = 0;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
if (a >= 3200) {
++libero;
} else {
colors.in... | #include <algorithm>
#include <iostream>
#include <set>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
set<int> colors;
int libero = 0;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
if (a >= 3200) {
++libero;
} else {
colors.in... | [
"call.remove",
"call.arguments.change"
] | 1,367,476 | 1,367,477 | u845674689 | cpp |
p03695 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, pro = 0;
int a[100], color[8] = {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= 3200) {
pro++;
} else {
color[a[i] / 400] = 1;
}
}... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, pro = 0;
int a[100], color[8] = {};
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= 3200) {
pro++;
} else {
color[a[i] / 400] = 1;
}
}... | [
"call.remove",
"call.arguments.change"
] | 1,367,478 | 1,367,479 | u479953984 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define PQ priority_queue
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) FOR(i, 0, n)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define PQ priority_queue
#define UM unordered_map
#define ALL(a) (a).begin(), (a).end()
typedef vector<ll... | [
"call.remove",
"call.arguments.change"
] | 1,367,485 | 1,367,486 | u845152373 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | [
"control_flow.branch.if.condition.change",
"call.add",
"literal.number.change"
] | 1,367,490 | 1,367,491 | u809665051 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define imfor(i, n) for ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define imfor(i, n) for ... | [
"call.add",
"call.arguments.add"
] | 1,367,494 | 1,367,495 | u921391957 | cpp |
p03695 | #include <cstdio>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
int n, ans, ansmin, ansmax, a;
ans = 0;
int rate[9] = {0};
scanf("%d", &n);
REP(i, n) {
scanf("%d", &a);
if (a <= 3200)
rate[a / 400]++;
... | #include <cstdio>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
int main() {
int n, ans, ansmin, ansmax, a;
ans = 0;
int rate[9] = {0};
scanf("%d", &n);
REP(i, n) {
scanf("%d", &a);
if (a <= 3200)
rate[a / 400]++;
... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,367,499 | 1,367,500 | u260638714 | cpp |
p03695 | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int rate[8] = {0};
int over_3200 = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= 3200)
over_3200++;
else
rate[a[i] / 400] = 1;
}
int min_color = 0;
fo... | #include <iostream>
using namespace std;
int main(void) {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int rate[8] = {0};
int over_3200 = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= 3200)
over_3200++;
else
rate[a[i] / 400] = 1;
}
int min_color = 0;
fo... | [
"call.remove",
"call.arguments.change"
] | 1,367,501 | 1,367,502 | u995997203 | cpp |
p03695 | #include <iostream>
int main() {
int color[8] = {0}; // 色は8色ある
int n;
std::cin >> n;
int tourist = 0;
for (int i = 0; i < n; i++) {
int rate;
std::cin >> rate;
if (rate >= 3200) {
tourist++;
} else {
color[rate / 400] = 1;
}
}
int ans = 0;
for (int i = 0; i < 8; i... | #include <iostream>
int main() {
int color[8] = {0}; // 色は8色ある
int n;
std::cin >> n;
int tourist = 0;
for (int i = 0; i < n; i++) {
int rate;
std::cin >> rate;
if (rate >= 3200) {
tourist++;
} else {
color[rate / 400] = 1;
}
}
int ans = 0;
for (int i = 0; i < 8; i... | [
"expression.unary.arithmetic.add"
] | 1,367,503 | 1,367,504 | u914739916 | cpp |
p03695 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (int)(n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define INF 2000000000
#ifdef LOCAL
#define eprintf(...) fprintf(stdout, __VA_ARGS__)
#else
#define eprintf(...) 0
#endif
using namespace std;
... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)(n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (int)(n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define INF 2000000000
#ifdef LOCAL
#define eprintf(...) fprintf(stdout, __VA_ARGS__)
#else
#define eprintf(...) 0
#endif
using namespace std;
... | [
"call.remove",
"call.arguments.change"
] | 1,367,505 | 1,367,506 | u370867568 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a;
int mx = 0;
int vis[8] = {};
for (int i = 0; i < n; i++) {
cin >> a;
if (a >= 3200)
mx++;
else if (a >= 1 && a <= 399)
vis[0] = 1;
else if (a >= 400 && a <= 799)
vis[1] = 1;
else if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a;
int mx = 0;
int vis[8] = {};
for (int i = 0; i < n; i++) {
cin >> a;
if (a >= 3200)
mx++;
else if (a >= 1 && a <= 399)
vis[0] = 1;
else if (a >= 400 && a <= 799)
vis[1] = 1;
else if ... | [
"call.remove",
"call.arguments.change"
] | 1,367,509 | 1,367,510 | u624778509 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.