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 <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
in... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
#define INF 1e9
#define LLINF 1e18
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
in... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,364,284 | 1,364,285 | u845995224 | cpp |
p03695 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb() {
fact[0] = fact[1] = 1;
f... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <unordered_map>
#include <vector>
const int mod = 1e9 + 7;
const int kmax = 510000;
long long fact[kmax], fact_inv[kmax], inv[kmax];
void init_comb() {
fact[0] = fact[1] = 1;
f... | [
"misc.opposites",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 1,364,302 | 1,364,303 | u083910207 | cpp |
p03695 | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
// here!!!
// define int long long !!!!!
... | /*
* じょえチャンネル
* 高評価・チャンネル登録よろしくおねがいします！
* https://www.youtube.com/channel/UCRXsI3FL_kvaVL9zoolBfbQ
*/
#include <bits/stdc++.h>
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#define f(i, n) for (int i = 0; i < (n); i++)
// here!!!
// define int long long !!!!!
... | [
"io.output.change",
"call.remove"
] | 1,364,304 | 1,364,305 | u943070796 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(9, 0);
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (x < 400)
a[0]++;
else if (x < 800)
a[1]++;
else if (x < 1200)
a[2]++;
else if (x < 1600)
a[3]++;
else if (x < 2... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(9, 0);
for (int i = 0; i < N; i++) {
int x;
cin >> x;
if (x < 400)
a[0]++;
else if (x < 800)
a[1]++;
else if (x < 1200)
a[2]++;
else if (x < 1600)
a[3]++;
else if (x < 2... | [
"call.remove",
"call.arguments.change"
] | 1,364,308 | 1,364,309 | u336145516 | cpp |
p03695 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using ... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using ... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,364,317 | 1,364,318 | u919867411 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll, ll>;
int64_t INF = 10010010010;
// int64_t INF = 1000000007;
// int64_t INF = 9223372036854775807;
... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int64_t i = 0; i < (int64_t)(n); i++)
using vi = vector<int64_t>;
using vvi = vector<vi>;
using ll = int64_t;
using P = pair<ll, ll>;
int64_t INF = 10010010010;
// int64_t INF = 1000000007;
// int64_t INF = 9223372036854775807;
... | [
"variable_declaration.value.change"
] | 1,364,319 | 1,364,320 | u702462808 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> a;
int mini = 0;
rep(i, N) {
int tmp;
cin >> tmp;
if (tmp >= 3200) {
mini++;
} else {
a[tmp / 400]++;
}
}
int Min ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> a;
int mini = 0;
rep(i, N) {
int tmp;
cin >> tmp;
if (tmp >= 3200) {
mini++;
} else {
a[tmp / 400]++;
}
}
int Min ... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,364,323 | 1,364,324 | u636018568 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> a;
int mini = 0;
rep(i, N) {
int tmp;
cin >> tmp;
if (tmp >= 3200) {
mini++;
} else {
a[tmp / 400]++;
}
}
int Min ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> a;
int mini = 0;
rep(i, N) {
int tmp;
cin >> tmp;
if (tmp >= 3200) {
mini++;
} else {
a[tmp / 400]++;
}
}
int Min ... | [
"expression.operation.binary.change",
"call.add",
"identifier.change"
] | 1,364,325 | 1,364,324 | u636018568 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(8, 0);
int count = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 400)
v[0]++;
else if (a < 800)
v[1]++;
else if (a < 1200)
v[2]++;
else if (a < 1600)
v[3]++;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(8, 0);
int count = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 400)
v[0]++;
else if (a < 800)
v[1]++;
else if (a < 1200)
v[2]++;
else if (a < 1600)
v[3]++;
... | [] | 1,364,328 | 1,364,329 | u515923980 | cpp |
p03695 | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdi... | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdi... | [
"call.remove",
"call.arguments.change"
] | 1,364,334 | 1,364,335 | u018713014 | cpp |
p03695 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
bool colors[8];
for (int i = 0; i < 8; i++)
colors[i] = false;
int free = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a <= 399)
colors[0] = true;
else if (a <= 799)
colors[... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
bool colors[8];
for (int i = 0; i < 8; i++)
colors[i] = false;
int free = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a <= 399)
colors[0] = true;
else if (a <= 799)
colors[... | [
"call.remove",
"call.arguments.change"
] | 1,364,370 | 1,364,371 | u016119075 | cpp |
p03695 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
bool colors[8];
for (int i = 0; i < 8; i++)
colors[i] = false;
int free = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a <= 399)
colors[0] = true;
else if (a <= 799)
colors[... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
bool colors[8];
for (int i = 0; i < 8; i++)
colors[i] = false;
int free = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a <= 399)
colors[0] = true;
else if (a <= 799)
colors[... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.remove",
"call.arguments.change"
] | 1,364,372 | 1,364,371 | u016119075 | cpp |
p03695 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep2(i, s, n) for (int i... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep2(i, s, n) for (int i... | [
"call.remove",
"call.arguments.change"
] | 1,364,375 | 1,364,376 | u942085302 | cpp |
p03695 | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG // FOR THE DEBUG! COMMENT OUT THIS WHEN SUBMITTING!
#endif
/* I REALLY HOPE MY WISH REACH YOU , ATCODER'S ONLINE JUDGE */
#define WOULD
#define YOU
#define... | /*~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=
*$* WRITER:kakitamasziru/OxOmisosiru *$*
~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=~=*/
#ifdef LOCAL_JUDGE
#define _GLIBCXX_DEBUG // FOR THE DEBUG! COMMENT OUT THIS WHEN SUBMITTING!
#endif
/* I REALLY HOPE MY WISH REACH YOU , ATCODER'S ONLINE JUDGE */
#define WOULD
#define YOU
#define... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,364,385 | 1,364,386 | u590927341 | cpp |
p03695 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define np next_permutation
#define fi first
#define se second
#define all(x) (... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define np next_permutation
#define fi first
#define se second
#define all(x) (... | [
"expression.unary.arithmetic.add"
] | 1,364,395 | 1,364,396 | u604329931 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
using P = pair<int, int>;
using ll = long long;
static const int INF = 1000000000;
static const ll MOD = 1000000007;
ll gcd(ll a, ll b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b... | [
"call.remove",
"call.arguments.change"
] | 1,364,405 | 1,364,406 | u741815956 | cpp |
p03695 | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
int n;
cin >> n;
int color[9];
for (int i = 0; i < 9; i++)
color[i] = 0;
for (int j = 0; j < n; j++) {
int a;
cin >> a;
if (a <= 399)
... | #include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> llP;
int main() {
int n;
cin >> n;
int color[9];
for (int i = 0; i < 9; i++)
color[i] = 0;
for (int j = 0; j < n; j++) {
int a;
cin >> a;
if (a <= 399)
... | [
"variable_declaration.value.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,364,407 | 1,364,408 | u201553784 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int a[101];
int cnt[8], diff;
int main() {
#ifdef DEBUG
freopen("in.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 400)
cn... | #include <bits/stdc++.h>
using namespace std;
int a[101];
int cnt[8], diff;
int main() {
#ifdef DEBUG
freopen("in.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 400)
cn... | [
"call.arguments.change",
"call.arguments.add"
] | 1,364,415 | 1,364,416 | u517309493 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int a[101];
int cnt[8], diff;
int main() {
#ifdef DEBUG
freopen("in.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 400)
cn... | #include <bits/stdc++.h>
using namespace std;
int a[101];
int cnt[8], diff;
int main() {
#ifdef DEBUG
freopen("in.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 400)
cn... | [
"call.add",
"call.arguments.add"
] | 1,364,417 | 1,364,416 | u517309493 | cpp |
p03695 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 1,364,418 | 1,364,419 | u128572736 | cpp |
p03695 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <functional>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
using ... | [
"call.add",
"call.arguments.add"
] | 1,364,420 | 1,364,419 | u128572736 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int countover = 0;
vector<bool> flg(9, false);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (1 <= x && x < 400)
flg[0] = t... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int countover = 0;
vector<bool> flg(9, false);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (1 <= x && x < 400)
flg[0] = t... | [
"call.remove",
"call.arguments.change"
] | 1,364,421 | 1,364,422 | u537835158 | cpp |
p03695 | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// @@ !! LIM()
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
vector<ll> vec(8);
ll free = 0;
ll N;
cin >> N;
for (ll i = 0; i < N; i++) {
l... | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// @@ !! LIM()
int main(int argc, char *argv[]) {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout << setprecision(20);
vector<ll> vec(8);
ll free = 0;
ll N;
cin >> N;
for (ll i = 0; i < N; i++) {
l... | [
"call.add",
"call.arguments.add"
] | 1,364,423 | 1,364,424 | u588093355 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int c[9] = {};
for (int i = 0; i < N; i++) {
if (1 <= a[i] && a[i] <= 399) {
c[0] = c[0] + 1;
}
if (400 <= a[i] && a[i... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int c[9] = {};
for (int i = 0; i < N; i++) {
if (1 <= a[i] && a[i] <= 399) {
c[0] = c[0] + 1;
}
if (400 <= a[i] && a[i... | [
"call.remove",
"call.arguments.change"
] | 1,364,425 | 1,364,426 | u969618034 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
void main_() {
ll N;
vector<ll> as;
cin >> N;
copy_n(istream_iterator<ll>(cin), N, back_inserter(as));
set<int> colors;
ll over3200_num = 0;
for (auto &&a : as) {
if (a < 3200) {
colors.insert(a / 400);
} else {
over32... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
void main_() {
ll N;
vector<ll> as;
cin >> N;
copy_n(istream_iterator<ll>(cin), N, back_inserter(as));
set<int> colors;
ll over3200_num = 0;
for (auto &&a : as) {
if (a < 3200) {
colors.insert(a / 400);
} else {
over32... | [
"call.remove",
"call.arguments.change"
] | 1,364,429 | 1,364,430 | u182326544 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int color[8];
int dobby;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
if (x < 400)
color[0] = 1;
if (x > 399 && x < 800)
color[1] = 1;
if (... | #include <bits/stdc++.h>
using namespace std;
int color[8];
int dobby;
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
int x;
cin >> x;
if (x < 400)
color[0] = 1;
if (x > 399 && x < 800)
color[1] = 1;
if (... | [
"call.add",
"call.arguments.change"
] | 1,364,437 | 1,364,438 | u280517956 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, k, n) for (int i = k; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> A(n);
rep(i, 0, n) { cin >> A.at(i); }
int cnt = 0;
set<int> color;
for (auto ai : A) {
int thr = 399;
bool add = 0;
rep(i, 0, ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, k, n) for (int i = k; i < (int)(n); i++)
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> A(n);
rep(i, 0, n) { cin >> A.at(i); }
int cnt = 0;
set<int> color;
for (auto ai : A) {
int thr = 399;
bool add = 0;
rep(i, 0, ... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"identifier.change"
] | 1,364,445 | 1,364,446 | u436733497 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
int N;
cin >> N;
vector<int> vec(8);
int op = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 400)
vec.at(0) = 1;
else if (a < 800)
vec.at(1) = 1;
else if (a < 1200)
vec.at(... | #include <bits/stdc++.h>
using namespace std;
const int INF = 1001001001;
int main() {
int N;
cin >> N;
vector<int> vec(8);
int op = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 400)
vec.at(0) = 1;
else if (a < 800)
vec.at(1) = 1;
else if (a < 1200)
vec.at(... | [
"expression.operation.binary.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,364,452 | 1,364,453 | u574626823 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes \
cout << "Yes" << endl; \
return 0;
#define No ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define Yes \
cout << "Yes" << endl; \
return 0;
#define No ... | [
"identifier.change",
"io.output.change"
] | 1,364,454 | 1,364,455 | u286623856 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define sz(s) (int)s.size()
int main() {
int n;
cin >> n;
vector<int> a(10, 0);
rep(i, 0, n) {
int x;
cin >> x;
if (x >= 3200) {
++a[0];
continue;
}
if (x >= 2800) {
++a[1]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define sz(s) (int)s.size()
int main() {
int n;
cin >> n;
vector<int> a(10, 0);
rep(i, 0, n) {
int x;
cin >> x;
if (x >= 3200) {
++a[0];
continue;
}
if (x >= 2800) {
++a[1]... | [
"call.remove",
"call.arguments.change"
] | 1,364,469 | 1,364,470 | u193561474 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define sz(s) (int)s.size()
int main() {
int n;
cin >> n;
vector<int> a(10, 0);
rep(i, 0, n) {
int x;
cin >> x;
if (x >= 3200) {
++a[0];
continue;
}
if (x >= 2800) {
++a[1]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define sz(s) (int)s.size()
int main() {
int n;
cin >> n;
vector<int> a(10, 0);
rep(i, 0, n) {
int x;
cin >> x;
if (x >= 3200) {
++a[0];
continue;
}
if (x >= 2800) {
++a[1]... | [
"call.remove",
"call.arguments.change"
] | 1,364,471 | 1,364,470 | u193561474 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
map<string, long> mp;
int main() {
long i, j, t, a, b, n, c, temp;
t = 1;
// cin>>t;
while (t--) {
cin >> n;
long arr[n];
for (i = 0; i < n; i++)
cin >> arr[i];
for (i = 0; i < n; i++) {
temp = arr[i];
if (tem... | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
map<string, long> mp;
int main() {
long i, j, t, a, b, n, c, temp;
t = 1;
// cin>>t;
while (t--) {
cin >> n;
long arr[n];
for (i = 0; i < n; i++)
cin >> arr[i];
for (i = 0; i < n; i++) {
temp = arr[i];
if (tem... | [
"call.arguments.change"
] | 1,364,480 | 1,364,481 | u335756132 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c[9] = {}, ans = 0;
cin >> n;
while (cin >> i) {
i /= 400;
if (i >= 8)
c[8]++;
else
c[i] |= 1;
}
for (i = 0; i < 8; i++)
ans += c[i];
cout << ((c[8]) ? max(ans, 1) : ans) << " " << min(8, ans + c[8]) << "\n";
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, c[9] = {}, ans = 0;
cin >> n;
while (cin >> i) {
i /= 400;
if (i >= 8)
c[8]++;
else
c[i] |= 1;
}
for (i = 0; i < 8; i++)
ans += c[i];
cout << ((c[8]) ? max(ans, 1) : ans) << " " << ans + c[8] << "\n";
} | [
"call.remove",
"call.arguments.change"
] | 1,364,482 | 1,364,483 | u881116515 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
map<int, int> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a <= 399)
m[1]++;
else if (a <= 799)
... | #include <bits/stdc++.h>
using namespace std;
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
map<int, int> m;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a <= 399)
m[1]++;
else if (a <= 799)
... | [
"control_flow.branch.if.condition.change",
"control_flow.branch.if.add"
] | 1,364,484 | 1,364,485 | u651235280 | cpp |
p03695 | // bad_bat
#include <bits/stdc++.h>
using namespace std;
#define Fast \
ios_base::sync_with_stdio(0); \
cin.tie(0), cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w"... | // bad_bat
#include <bits/stdc++.h>
using namespace std;
#define Fast \
ios_base::sync_with_stdio(0); \
cin.tie(0), cout.tie(0)
#define FO freopen("in.txt", "r", stdin)
#define FC freopen("out.txt", "w"... | [
"call.remove",
"call.arguments.change"
] | 1,364,490 | 1,364,491 | u568082675 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> mark(9);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
int A = a.at(i);
if (A / 400 < 8) {
if (mark.at(A / 400) == 0) {
mark.at(A / 400) = 1;
}
} else {
mark.at(8... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> mark(9);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
int A = a.at(i);
if (A / 400 < 8) {
if (mark.at(A / 400) == 0) {
mark.at(A / 400) = 1;
}
} else {
mark.at(8... | [
"call.add",
"call.arguments.change"
] | 1,364,492 | 1,364,493 | u028061225 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
const int MOD = 1e9 + 7;
const int INF = 1e15;
signed main() {
int N;
cin >> N;
int a, b, c, d, e, f, g, h, x;
a = b = c = d = e = f = g = h = x = 0;
R... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, l, r) for (long long i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define int long long
const int MOD = 1e9 + 7;
const int INF = 1e15;
signed main() {
int N;
cin >> N;
int a, b, c, d, e, f, g, h, x;
a = b = c = d = e = f = g = h = x = 0;
R... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,364,500 | 1,364,501 | u342075214 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int cnt[10];
int... | #include <algorithm>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
const int mod = 1000000007;
const ll INF = 1000000000000000000;
int cnt[10];
int... | [
"call.add",
"call.arguments.add"
] | 1,364,502 | 1,364,503 | u475843109 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> people(N);
vector<ll> rate(9, 0);
ll minrate = 0, maxrate = 0;
for (ll i = 0; i < N; i++) {
cin >> people[i];
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
using namespace std;
using ll = long long;
int main() {
ll N;
cin >> N;
vector<ll> people(N);
vector<ll> rate(9, 0);
ll minrate = 0, maxrate = 0;
for (ll i = 0; i < N; i++) {
cin >> people[i];
... | [
"call.remove",
"call.arguments.change"
] | 1,364,511 | 1,364,512 | u378155378 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(0);
}
} fast;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj)... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(0);
}
} fast;
using intpair = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define ALL(obj)... | [
"call.add",
"call.arguments.change"
] | 1,364,519 | 1,364,520 | u979852867 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using VI = vector<ll>;
using VD = vector<ld>;
using VVI = vector<VI>;
using VC = vector<char>;
using VVC = vector<VC>;
using VS = vector<string>;
using PLL = pair<ll, ll>;
using PLD = pair<ld, ld>;
using VPLL = vector<PLL>;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
using VI = vector<ll>;
using VD = vector<ld>;
using VVI = vector<VI>;
using VC = vector<char>;
using VVC = vector<VC>;
using VS = vector<string>;
using PLL = pair<ll, ll>;
using PLD = pair<ld, ld>;
using VPLL = vector<PLL>;... | [
"control_flow.break.add"
] | 1,364,521 | 1,364,522 | u170054586 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0, i##_len = (n); i < i##_len; ++i)
void solve(long long N, std::vector<long long> a) {
vector<long long> vec;
long long legend = 0;
REP(i, N) {
if (a[i] >= 3200)
legend++;
}
for (int i = 1; i <= 8; i++) {
long ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (long long i = 0, i##_len = (n); i < i##_len; ++i)
void solve(long long N, std::vector<long long> a) {
vector<long long> vec;
long long legend = 0;
REP(i, N) {
if (a[i] >= 3200)
legend++;
}
for (int i = 1; i <= 8; i++) {
long ... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"call.arguments.change"
] | 1,364,523 | 1,364,524 | u019151685 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,364,525 | 1,364,526 | u041513069 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ID... | #include <bits/stdc++.h>
using namespace std;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ID... | [
"call.remove",
"call.arguments.change"
] | 1,364,529 | 1,364,530 | u024383312 | cpp |
p03695 | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int colors[8] = {};
int above_3200 = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a <= 399)
colors[0] = 1;
else if (a >= 400 && a <= 799)
colors[1] = 1;
else if (a >= 800 && a <... | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int colors[8] = {};
int above_3200 = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a <= 399)
colors[0] = 1;
else if (a >= 400 && a <= 799)
colors[1] = 1;
else if (a >= 800 && a <... | [
"call.remove",
"call.arguments.change"
] | 1,364,541 | 1,364,542 | u963055157 | cpp |
p03695 | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int colors[8] = {};
int above_3200 = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a <= 399)
colors[0] = 1;
else if (a >= 400 && a <= 799)
colors[1] = 1;
else if (a >= 800 && a <... | #include <cstdlib>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int colors[8] = {};
int above_3200 = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a <= 399)
colors[0] = 1;
else if (a >= 400 && a <= 799)
colors[1] = 1;
else if (a >= 800 && a <... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.remove",
"call.arguments.change"
] | 1,364,543 | 1,364,542 | u963055157 | cpp |
p03695 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.... | [
"call.add",
"call.arguments.change"
] | 1,364,544 | 1,364,545 | u783675879 | cpp |
p03695 | #include <bits/stdc++.h>
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
const double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) ... | #include <bits/stdc++.h>
const long long INF = 1LL << 60;
const long long MOD = 1000000007;
const double PI = acos(-1.0);
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) ... | [
"call.add",
"call.arguments.add"
] | 1,364,546 | 1,364,547 | u281168735 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define rep1(i, n) for (ll i = 1; i <= (n); ++i)
#define rrep(i, n) for (ll i = (n - 1); i >= 0; --i)
#define perm(c) \
sort(ALL(c)); ... | [
"call.remove",
"call.arguments.change"
] | 1,364,548 | 1,364,549 | u281168735 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define repi(i, a, b) for (int i = a; i <= (b); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define mp make_pair
#define sz(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep1(i, n) for (int i = 1; i <= (n); ++i)
#define repi(i, a, b) for (int i = a; i <= (b); ++i)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define pb push_back
#define mp make_pair
#define sz(... | [
"call.remove",
"call.arguments.change"
] | 1,364,550 | 1,364,551 | u281168735 | cpp |
p03695 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
// ceil() 切り上げ, floor() 切り捨て
// next_permutation(all(x))
int main(void) {
... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
using namespace std;
using ll = long long;
using vpii = vector<pair<int, int>>;
using vpll = vector<pair<ll, ll>>;
// ceil() 切り上げ, floor() 切り捨て
// next_permutation(all(x))
int main(void) {
... | [
"call.add",
"call.arguments.change"
] | 1,364,552 | 1,364,553 | u675042710 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
bitset<8> C;
int O = 0;
for (int i = 0; i < N; i++) {
int score;
cin >> score;
if (score < 400)
C.set(0);
else if (score < 800)
C.set(1);
else if (score < 1200)
C.set(2);
else if (sco... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
bitset<8> C;
int O = 0;
for (int i = 0; i < N; i++) {
int score;
cin >> score;
if (score < 400)
C.set(0);
else if (score < 800)
C.set(1);
else if (score < 1200)
C.set(2);
else if (sco... | [
"call.add",
"call.arguments.change"
] | 1,364,554 | 1,364,555 | u675042710 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x <<... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i < n; ++i)
#define exrep(i, a, b) for (ll i = a; i < b; i++)
#define out(x) cout << x <<... | [
"call.remove",
"call.arguments.change"
] | 1,364,556 | 1,364,557 | u929582923 | cpp |
p03695 | #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 <... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 1,364,561 | 1,364,562 | u221285045 | cpp |
p03695 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a;
cin >> n;
vector<bool> b(8);
int rest = 0;
REP(i, n) {
cin >> a;
int s = a / 400;
if (s >= 8) {
rest++;
} ... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
using ll = long long;
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, a;
cin >> n;
vector<bool> b(8);
int rest = 0;
REP(i, n) {
cin >> a;
int s = a / 400;
if (s >= 8) {
rest++;
} ... | [
"call.remove",
"call.arguments.change"
] | 1,364,563 | 1,364,564 | u908318580 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); i++... | [
"io.output.change"
] | 1,364,578 | 1,364,579 | u809967037 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rREP(i, m, n) for (int(i) = (n)-1; (i) >= (m); --(i))
#define all(x) (x).begin(), (x).end()
#define out(y, x, h, w) (y) < 0 || (x) < 0 || (y) >= (... | [
"call.remove",
"call.arguments.change"
] | 1,364,589 | 1,364,590 | u813559924 | cpp |
p03695 | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<VVI> VVVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_A... | [
"call.remove",
"call.arguments.change"
] | 1,364,591 | 1,364,592 | u637983859 | cpp |
p03695 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define invrepr(i, a, b) for (int i = b - 1; i >= a; i--)
#define invrep(i, n) invrepr(i, 0, n)
#define repitr(itr, a) for (auto itr = a.begin(); itr != a.en... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
#define repr(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define invrepr(i, a, b) for (int i = b - 1; i >= a; i--)
#define invrep(i, n) invrepr(i, 0, n)
#define repitr(itr, a) for (auto itr = a.begin(); itr != a.en... | [
"call.remove",
"call.arguments.change"
] | 1,364,593 | 1,364,594 | u012298376 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
long long gcd(long x, long y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
long long lcm(long x, long y) { return x * y / gcd(x, y); }
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main() {
int N, A[110] = {}, r[1... | #include <bits/stdc++.h>
using namespace std;
long long gcd(long x, long y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
long long lcm(long x, long y) { return x * y / gcd(x, y); }
int ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main() {
int N, A[110] = {}, r[1... | [
"call.remove",
"call.arguments.change"
] | 1,364,595 | 1,364,596 | u097396733 | cpp |
p03695 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define pb push_back
#def... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define pb push_back
#def... | [
"call.remove",
"call.arguments.change"
] | 1,364,601 | 1,364,602 | u891346638 | cpp |
p03695 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define pb push_back
#def... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#define pb push_back
#def... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"call.remove",
"call.arguments.change"
] | 1,364,603 | 1,364,602 | u891346638 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int cnt[9];
int main() {
int n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int cnt[9];
int main() {
int n;
cin >> n;
... | [
"call.add",
"call.arguments.add"
] | 1,364,618 | 1,364,619 | u729337236 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int cnt[9];
int main() {
int n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
int cnt[9];
int main() {
int n;
cin >> n;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.add"
] | 1,364,620 | 1,364,619 | u729337236 | cpp |
p03695 | #include <algorithm>
#include <iostream>
using namespace std;
constexpr int MaxN = 100;
int Color(int rate) { return rate / 400; }
int main() {
int N;
cin >> N;
int check = 0;
int num_rainbow = 0;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
int k = Color(a);
if (k > 7) {
++num_... | #include <algorithm>
#include <iostream>
using namespace std;
constexpr int MaxN = 100;
int Color(int rate) { return rate / 400; }
int main() {
int N;
cin >> N;
int check = 0;
int num_rainbow = 0;
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
int k = Color(a);
if (k > 7) {
++num_... | [
"call.remove",
"call.arguments.change"
] | 1,364,637 | 1,364,638 | u873336868 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, tmp = 0, iro = 0;
cin >> n;
vector<int> a(n);
vector<bool> rate(8, false);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
for (int j = 0; j < 8; j++) {
if (400 * j <= a.at(i) && 400 * (j + 1) > a.at(i))
rate.at(j) = true;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, tmp = 0, iro = 0;
cin >> n;
vector<int> a(n);
vector<bool> rate(8, false);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
for (int j = 0; j < 8; j++) {
if (400 * j <= a.at(i) && 400 * (j + 1) > a.at(i))
rate.at(j) = true;
... | [
"call.remove",
"call.arguments.change"
] | 1,364,639 | 1,364,640 | u526179183 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> rate(9, 0);
for (int x : a) {
int ite = 0, b = 400;
while (ite < 8) {
if (x < b) {
rate[ite] = 1;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<int> a(n, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> rate(9, 0);
for (int x : a) {
int ite = 0, b = 400;
while (ite < 8) {
if (x < b) {
rate[ite] = 1;
... | [
"call.remove",
"call.arguments.change"
] | 1,364,647 | 1,364,648 | u130492706 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt[9] = {0};
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 400) {
cnt[1]++;
} else if (a < 800) {
cnt[2]++;
} else if (a < 1200) {
cnt[3]++;
} else if (a < 1600) {
cnt[4]++;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int cnt[9] = {0};
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 400) {
cnt[1]++;
} else if (a < 800) {
cnt[2]++;
} else if (a < 1200) {
cnt[3]++;
} else if (a < 1600) {
cnt[4]++;... | [
"call.add",
"call.arguments.add"
] | 1,364,649 | 1,364,650 | u010931653 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim ... | #include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<c>(0) x 1, debug &>::type operator<<( \
c i) {
sim ... | [
"call.add",
"call.arguments.change"
] | 1,364,652 | 1,364,653 | u956252692 | cpp |
p03695 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9 + 7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inlin... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define vi vector<int>
using namespace std;
const int INF = 1001001001;
const int MOD = 1e9 + 7;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
template <class T> inlin... | [
"call.remove",
"call.arguments.change"
] | 1,364,663 | 1,364,664 | u667375816 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
//入力
template <typename T> istream &operator>>(istream &is, vector<T> &a) {
for (int i = 0; i < a.size(); i++)
is >> a[i];
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
... | #include <bits/stdc++.h>
using namespace std;
//入力
template <typename T> istream &operator>>(istream &is, vector<T> &a) {
for (int i = 0; i < a.size(); i++)
is >> a[i];
return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
... | [
"call.add",
"call.arguments.add"
] | 1,364,665 | 1,364,666 | u190580703 | cpp |
p03695 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
// input
int n;
cin >> n;
vector<int> a(n);
vector<int> c(100);
for (int i = 0; i < 100; i++)
c[i] = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
// compute
... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
// input
int n;
cin >> n;
vector<int> a(n);
vector<int> c(100);
for (int i = 0; i < 100; i++)
c[i] = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
// compute
... | [
"call.add",
"call.arguments.add"
] | 1,364,667 | 1,364,668 | u831314901 | cpp |
p03695 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
// input
int n;
cin >> n;
vector<int> a(n);
vector<int> c(100);
for (int i = 0; i < n; i++)
c[i] = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
// compute
in... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
// input
int n;
cin >> n;
vector<int> a(n);
vector<int> c(100);
for (int i = 0; i < 100; i++)
c[i] = 0;
for (int i = 0; i < n; i++)
cin >> a[i];
// compute
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.add"
] | 1,364,669 | 1,364,668 | u831314901 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int a[n];
set<int> s;
int ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
using ll = long long;
using pii = pair<int, int>;
const int mod = 1e9 + 7;
int main() {
int n;
cin >> n;
int a[n];
set<int> s;
int ... | [
"misc.opposites",
"identifier.change",
"call.function.change"
] | 1,364,672 | 1,364,673 | u915582296 | cpp |
p03695 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n, m = 0;
cin >> n;
vector<bool> cnt(13, false);
int ans = 0;
REP(i, n) {
int a;
cin >> a;
... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPS(I, a, b) for (int i = (a); i < (b); ++i)
using namespace std;
using ll = long long;
int main() {
int n, m = 0;
cin >> n;
vector<bool> cnt(13, false);
int ans = 0;
REP(i, n) {
int a;
cin >> a;
... | [] | 1,364,678 | 1,364,679 | u514896542 | cpp |
p03695 | // main関数は一番下にあります
#include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using S = string;
using vs = vector<string>;
using P = pair<int... | // main関数は一番下にあります
#include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vb = vector<bool>;
using S = string;
using vs = vector<string>;
using P = pair<int... | [
"expression.unary.arithmetic.add"
] | 1,364,691 | 1,364,692 | u616794313 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
set<int> color;
int f_count = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 400)
color.insert(1);
else if (a < 800)
color.insert(2);
else if (a < 1200)
color.in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
set<int> color;
int f_count = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 400)
color.insert(1);
else if (a < 800)
color.insert(2);
else if (a < 1200)
color.in... | [
"call.remove",
"call.arguments.change"
] | 1,364,693 | 1,364,694 | u418892821 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
/*
レート 1-399：灰色
レート 400-799：茶色
レート 800-1199：緑色
レート 1200-1599：水色
レート 1600-1999：青色
レート 2000-2399：黄色
レート 2400-2799：橙色
レート 2800-3199：赤色
*/
int main() {
int N;
cin >> N;
vector<int> iro(8);
int kami = 0;
vector<int> vec(N, 0);
for (int i = 0; i < N; i++) {
cin >... | #include <bits/stdc++.h>
using namespace std;
/*
レート 1-399：灰色
レート 400-799：茶色
レート 800-1199：緑色
レート 1200-1599：水色
レート 1600-1999：青色
レート 2000-2399：黄色
レート 2400-2799：橙色
レート 2800-3199：赤色
*/
int main() {
int N;
cin >> N;
vector<int> iro(8);
int kami = 0;
vector<int> vec(N, 0);
for (int i = 0; i < N; i++) {
cin >... | [
"call.add",
"call.arguments.add"
] | 1,364,699 | 1,364,700 | u187772564 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> count(9, 0);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
if (a.at(i) >= 3200) {
count.at(8)++;
} else {
count.at(a.at(i) / 400)++;
}
}
int M = 0;
for (int i = 0; i < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<int> count(9, 0);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
if (a.at(i) >= 3200) {
count.at(8)++;
} else {
count.at(a.at(i) / 400)++;
}
}
int M = 0;
for (int i = 0; i < ... | [
"call.remove",
"call.arguments.change"
] | 1,364,716 | 1,364,717 | u710877960 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(9, 0);
for (int i = 0; i < n; i++) ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> v(9, 0);
for (int i = 0; i < n; i++) ... | [
"call.remove",
"call.arguments.change"
] | 1,364,722 | 1,364,723 | u495704746 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, ans = 0;
cin >> n;
vector<long> rate(n);
vector<long> color(9);
for (long i = 0; i < n; i++)
cin >> rate[i];
for (long i = 0; i < n; i++)
color[min(8L, rate[i] / 400)]++;
for (long i = 0; i < 8; i++)
if (color[i] > 0)
an... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, ans = 0;
cin >> n;
vector<long> rate(n);
vector<long> color(9);
for (long i = 0; i < n; i++)
cin >> rate[i];
for (long i = 0; i < n; i++)
color[min(8L, rate[i] / 400)]++;
for (long i = 0; i < 8; i++)
if (color[i] > 0)
an... | [
"call.add",
"call.arguments.change"
] | 1,364,724 | 1,364,725 | u966257731 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
const int p = 8;
vector<int> num(p + 1, 0);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 3200)
num[a / 400]++;
else
num[p]++;
}
int minCnt = 0;
for (int i = 0; i < p;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
const int p = 8;
vector<int> num(p + 1, 0);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 3200)
num[a / 400]++;
else
num[p]++;
}
int minCnt = 0;
for (int i = 0; i < p;... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,364,726 | 1,364,727 | u221391729 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
const int p = 8;
int n;
cin >> n;
vector<int> num(p, 0);
int free = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
for (int j = 0; j < p; j++) {
if (400 * j <= a && a < 400 * (j + 1)) {
num[j] = 1... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
const int p = 8;
int n;
cin >> n;
vector<int> num(p, 0);
int free = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
for (int j = 0; j < p; j++) {
if (400 * j <= a && a < 400 * (j + 1)) {
num[j] = 1... | [
"expression.operation.binary.remove"
] | 1,364,728 | 1,364,729 | u221391729 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
const int m = 9;
vector<int> c(m);
for (int i = 0; i < n; i++) {
int tmp_a;
cin >> tmp_a;
if (tmp_a < 3200)
c[tmp_a / 400] = 1;
else
c[m - 2]++;
}
int ans = 0;
for (int i = 0; i < m - 1; i++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
const int m = 9;
vector<int> c(m, 0);
for (int i = 0; i < n; i++) {
int tmp_a;
cin >> tmp_a;
if (tmp_a < 3200)
c[tmp_a / 400] = 1;
else
c[m - 1]++;
}
int ans = 0;
for (int i = 0; i < m - 1; i++)
... | [
"call.arguments.add",
"literal.number.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,364,730 | 1,364,731 | u221391729 | cpp |
p03695 | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout << ((f) ? "Yes" : "No") << endl;
#define YORN(f) cout << ((f) ? "YES" : "NO") << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).... | #include <bits/stdc++.h>
#define ll long long int
#define ld long double
#define yorn(f) cout << ((f) ? "Yes" : "No") << endl;
#define YORN(f) cout << ((f) ? "YES" : "NO") << endl;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repi(i, n) for (int i = 1; i < (int)(n); i++)
#define all(x) (x).begin(), (x).... | [
"call.remove",
"call.arguments.change"
] | 1,364,732 | 1,364,733 | u570601094 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pi;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define rep3(i, i0, n) for (int i = i0; i < (n); i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
templ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pi;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define rep3(i, i0, n) for (int i = i0; i < (n); i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
templ... | [
"call.add",
"call.arguments.add"
] | 1,364,734 | 1,364,735 | u222188267 | cpp |
p03695 | #include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define F first
#define S second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define all(x) x.begin(), x.end()
#define pqueue priority_queue
#define mset multiset
#define umap unordered_map
#define Speed() ... | #include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define F first
#define S second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define all(x) x.begin(), x.end()
#define pqueue priority_queue
#define mset multiset
#define umap unordered_map
#define Speed() ... | [
"call.remove",
"call.arguments.change"
] | 1,364,747 | 1,364,748 | u002627851 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
int n;
ci... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(v) v.begin(), v.end()
#define len(x) (ll)(x).length()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
int main() {
int n;
ci... | [
"call.remove",
"call.arguments.change"
] | 1,364,753 | 1,364,754 | u818755983 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, m, n) for (ll i = m; i > n; i--)
#define Rep(i, m, n) for (ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, m, n) for (ll i = m; i > n; i--)
#define Rep(i, m, n) for (ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmi... | [
"call.remove",
"call.arguments.change"
] | 1,364,757 | 1,364,758 | u535010493 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, m, n) for (ll i = m; i > n; i--)
#define Rep(i, m, n) for (ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmi... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
using pll = pair<ll, ll>;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, m, n) for (ll i = m; i > n; i--)
#define Rep(i, m, n) for (ll i = m; i < n; i++)
#define all(vec) vec.begin(), vec.end()
#define lmax(x, y) max<ll>(x, y)
#define lmi... | [
"call.remove",
"call.arguments.change"
] | 1,364,759 | 1,364,758 | u535010493 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll, ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll, ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v... | [
"call.remove",
"call.arguments.change"
] | 1,364,764 | 1,364,765 | u768347697 | cpp |
p03695 | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <... | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iomanip>
#include <... | [
"literal.number.change",
"io.output.change"
] | 1,364,770 | 1,364,771 | u927801748 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
typedef string str;
const double pi = 3.14159265358979323846;
const long long inf = 1LL << 60;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
ret... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (int)(b); ++i)
#define endl "\n"
typedef long long ll;
typedef string str;
const double pi = 3.14159265358979323846;
const long long inf = 1LL << 60;
int ctoi(const char c) {
if ('0' <= c && c <= '9')
return (c - '0');
ret... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 1,364,774 | 1,364,775 | u492660436 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int Cnt, n, t, add, cnt[10];
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
#define DEBUG freopen("in.txt", "r", stdin);
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
int Cnt, n, t, add, cnt[10];
i... | [
"call.add",
"call.arguments.change"
] | 1,364,776 | 1,364,777 | u063318293 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.ti... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.ti... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"variable_access.subscript.index.change"
] | 1,364,781 | 1,364,782 | u239240712 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.ti... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.ti... | [
"call.add",
"call.arguments.change"
] | 1,364,783 | 1,364,782 | u239240712 | cpp |
p03695 | #include <iostream>
#include <map>
using namespace std;
int main() {
int N;
cin >> N;
map<string, bool> seen;
seen["gray"] = false;
seen["brown"] = false;
seen["green"] = false;
seen["skyblue"] = false;
seen["blue"] = false;
seen["yellow"] = false;
seen["orange"] = false;
seen["red"] = false;
s... | #include <iostream>
#include <map>
using namespace std;
int main() {
int N;
cin >> N;
map<string, bool> seen;
seen["gray"] = false;
seen["brown"] = false;
seen["green"] = false;
seen["skyblue"] = false;
seen["blue"] = false;
seen["yellow"] = false;
seen["orange"] = false;
seen["red"] = false;
s... | [
"call.remove",
"call.arguments.change"
] | 1,364,794 | 1,364,795 | u074220993 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<"... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<"... | [
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 1,364,803 | 1,364,804 | u517348254 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<"... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<"... | [] | 1,364,805 | 1,364,804 | u517348254 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<"... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
/* clang-format off */
#define MOD 1000000007
#define INF 1000000000
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(a) (a).begin(), (a).end()
#define __DEBUG__
#ifdef __DEBUG__
#define CH_P(a) cout <<"check_point("<<#a<<"... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,364,806 | 1,364,804 | u517348254 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.