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 <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.at(i);
}
set<int> S;
int count = 0, count_8 = 0;
for (int i = 0; i < N; i++) {
a.at(i) /= 400;
if (a.at(i) >= 8) {
count_8++;
} else {
if (S.co... | #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.at(i);
}
set<int> S;
int count = 0, count_8 = 0;
for (int i = 0; i < N; i++) {
a.at(i) /= 400;
if (a.at(i) >= 8) {
count_8++;
} else {
if (S.co... | [
"call.remove",
"call.arguments.change"
] | 1,365,495 | 1,365,496 | u462451018 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> rate = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
vector<bool> c(8, false);
int over = 0;
int n;
cin >> n;
int ai;
for (int i = 0; i < n; i++) {
cin >> ai;
for (int j = 0; j < 8; j++) {
if (ai < rate.at(j)) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> rate = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
vector<bool> c(8, false);
int over = 0;
int n;
cin >> n;
int ai;
for (int i = 0; i < n; i++) {
cin >> ai;
for (int j = 0; j < 8; j++) {
if (ai < rate.at(j)) {
... | [
"call.add",
"call.arguments.add"
] | 1,365,499 | 1,365,500 | u181783949 | cpp |
p03695 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[110];
int b[13] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
for (int i = 0; i < n; i++) {
cin >> a[i];
b[a[i] / 400]++;
}
int max = 0, min = 0;
for (int i = 0; i < 13; i++) {
if (b[i] > 0 && i < ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
int a[110];
int b[13] = {0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};
for (int i = 0; i < n; i++) {
cin >> a[i];
b[a[i] / 400]++;
}
int max = 0, min = 0;
for (int i = 0; i < 13; i++) {
if (b[i] > 0 && i < ... | [
"misc.opposites",
"assignment.variable.change",
"identifier.change",
"literal.number.change",
"assignment.value.change"
] | 1,365,503 | 1,365,504 | u280728543 | cpp |
p03695 | #include <bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main() {
fast;
int n, a, i, j;
cin >> n;
int ex = 0, rank[8] = {0};
for (i = 0; i < n; i++) ... | #include <bits/stdc++.h>
#define fast ios::sync_with_stdio(false), cin.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
using namespace std;
main() {
fast;
int n, a, i, j;
cin >> n;
int ex = 0, rank[8] = {0};
for (i = 0; i < n; i++) ... | [
"call.add",
"call.arguments.change"
] | 1,365,517 | 1,365,518 | u041940198 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<bool> memo(8, false); // その色の人がすで... | #include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;
#define ll long long
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const int MAX = 510000;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++)
cin >> a[i];
vector<bool> memo(8, false); // その色の人がすで... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,365,519 | 1,365,520 | u852770206 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n, a, sum = 0;
set<int> S;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < 400)
S.insert(1);
else if (a < 800)
S.insert(2);
else if (a < 1200)
S.insert(3)... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
int main() {
int n, a, sum = 0;
set<int> S;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < 400)
S.insert(1);
else if (a < 800)
S.insert(2);
else if (a < 1200)
S.insert(3)... | [
"call.remove",
"call.arguments.change"
] | 1,365,523 | 1,365,524 | u282636125 | cpp |
p03695 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int color[9] = {0};
for (int i = 0; i < n; i++) {
if (a[i] < 400)
color[0]++;
else if (a[i] < 800)
color[1]++;
else if (a[i] < 1200... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++)
cin >> a[i];
int color[9] = {0};
for (int i = 0; i < n; i++) {
if (a[i] < 400)
color[0]++;
else if (a[i] < 800)
color[1]++;
else if (a[i] < 1200... | [] | 1,365,525 | 1,365,526 | u579644164 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define f(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define char_f(i, a) for (int i = (int)(a); (char)s[i] != '\0'; i++)
#define rf(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define llf(i, a, b) ... | #include <bits/stdc++.h>
using namespace std;
#define f(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define char_f(i, a) for (int i = (int)(a); (char)s[i] != '\0'; i++)
#define rf(i, a, b) for (int i = (int)(a); i >= (int)(b); i--)
#define llf(i, a, b) ... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,365,531 | 1,365,532 | u290402695 | 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 INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
ll n;
cin >> n;
vector<int> a(n, 0);
... | #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 INF 1e9
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n, 0);... | [
"variable_declaration.type.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,365,540 | 1,365,541 | u984873498 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return tr... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return tr... | [
"call.add",
"call.arguments.add"
] | 1,365,542 | 1,365,543 | u316322317 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> color(8, 0);
int variable = 0;
rep(i, N) {
int tmp;
cin >> tmp;
if (tmp < 3200)
color[tmp / 400] = 1;
else
variable += 1;
}
int cnt = 0;
rep(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> color(8, 0);
int variable = 0;
rep(i, N) {
int tmp;
cin >> tmp;
if (tmp < 3200)
color[tmp / 400] = 1;
else
variable += 1;
}
int cnt = 0;
rep(... | [
"call.remove",
"call.arguments.change"
] | 1,365,544 | 1,365,545 | u665598835 | 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];
int color[8];
for (int i = 0; i < 8; i++)
color[i] = 0;
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= 3199) {
color[a[i] / 400]++;
} else if (a... | #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];
int color[8];
for (int i = 0; i < 8; i++)
color[i] = 0;
int count = 0;
for (int i = 0; i < n; i++) {
if (a[i] <= 3199) {
color[a[i] / 400]++;
} else if (a... | [
"call.remove",
"call.arguments.change"
] | 1,365,549 | 1,365,550 | u955282280 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,365,564 | 1,365,565 | u987594251 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (int)s; i < (int)n; i++)
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define All(x) x.begin(), x.end()
#define Range(x, i, j) x.begin() + i, x.begin() + j
#define lbidx(x, y) lower_bound(x.begin... | [
"call.add",
"call.arguments.add"
] | 1,365,566 | 1,365,565 | u987594251 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, start, count) for (int i = (start); i < (int)(count); ++i)
#define rep(i, count) REP(i, 0, count)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int N;
vector<int> a;
int main(void) {
cin >> N;
a.assign(N... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, start, count) for (int i = (start); i < (int)(count); ++i)
#define rep(i, count) REP(i, 0, count)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
int N;
vector<int> a;
int main(void) {
cin >> N;
a.assign(N... | [
"call.remove",
"call.arguments.change"
] | 1,365,580 | 1,365,581 | u159231764 | cpp |
p03695 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> c(8, 0);
int god = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (1 <= a && a <= 399)
c[0] = 1;
if (400 <= a && a <= 799)
c[1] = 1;
if (800 <= a && a <= 1199)
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
vector<int> c(8, 0);
int god = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (1 <= a && a <= 399)
c[0] = 1;
if (400 <= a && a <= 799)
c[1] = 1;
if (800 <= a && a <= 1199)
... | [
"call.add",
"call.arguments.add"
] | 1,365,588 | 1,365,589 | u127194462 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I, A, B) for (ll I = (A); I < (B); ++I)
const ll INF = 1e9 + 7;
const ll N = 100002;
ll iro[8], ziyu = 0, n, saisyo = 0;
int main() {
cin >> n;
FOR(i, 0, 8) iro[i] = 0;
FOR(i, 0, n) {
ll a;
cin >> a;
if (a < 3200)
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I, A, B) for (ll I = (A); I < (B); ++I)
const ll INF = 1e9 + 7;
const ll N = 100002;
ll iro[8], ziyu = 0, n, saisyo = 0;
int main() {
cin >> n;
FOR(i, 0, 8) iro[i] = 0;
FOR(i, 0, n) {
ll a;
cin >> a;
if (a < 3200)
i... | [
"expression.unary.arithmetic.add"
] | 1,365,590 | 1,365,591 | u780122303 | cpp |
p03695 | #include "algorithm"
#include "iostream"
#include "string"
#include "vector"
using namespace std; // std::を省略して書くことができる
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int transparent = 0;
for (int i = 0; i < N; i++) {
if (a[i] >= 3200) {
transparent +=... | #include "algorithm"
#include "iostream"
#include "string"
#include "vector"
using namespace std; // std::を省略して書くことができる
int main() {
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int transparent = 0;
for (int i = 0; i < N; i++) {
if (a[i] >= 3200) {
transparent +=... | [
"call.remove",
"call.arguments.change"
] | 1,365,602 | 1,365,603 | u385244248 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
#define vecmin(A) *min_element(A.begin(), A.end())
#define vecmax(A) *max_element(A.begin... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define sort(A) sort(A.begin(), A.end())
#define reverse(A) reverse(A.begin(), A.end())
#define vecmin(A) *min_element(A.begin(), A.end())
#define vecmax(A) *max_element(A.begin... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,365,607 | 1,365,608 | u132364782 | cpp |
p03695 | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for (ll i = (k); i < (n); i++)
#define FORe(i, k, n) for (ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for (ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre... | #include <bits/stdc++.h>
using ll = long long;
#define FOR(i, k, n) for (ll i = (k); i < (n); i++)
#define FORe(i, k, n) for (ll i = (k); i <= (n); i++)
#define FORr(i, k, n) for (ll i = (k)-1; i > (n); i--)
#define FORre(i, k, n) for (ll i = (k)-1; i >= (n); i--)
#define REP(i, n) FOR(i, 0, n)
#define REPr(i, n) FORre... | [
"call.remove",
"call.arguments.change"
] | 1,365,609 | 1,365,610 | u961136005 | cpp |
p03695 |
#include <bits/stdc++.h>
using namespace std;
//#define rep(i,n) for (int i=0;i<(n);++i)
int main() {
// srandom((unsigned long)time(NULL));
int n;
cin >> n;
// vector<int> a;
vector<int> cont;
for (int i = 0; i < 9; i++) {
cont.emplace_back(0);
}
for (int i = 0; i < n; i++) {
int x;
cin ... |
#include <bits/stdc++.h>
using namespace std;
//#define rep(i,n) for (int i=0;i<(n);++i)
int main() {
// srandom((unsigned long)time(NULL));
int n;
cin >> n;
// vector<int> a;
vector<int> cont;
for (int i = 0; i < 9; i++) {
cont.emplace_back(0);
}
for (int i = 0; i < n; i++) {
int x;
cin ... | [
"call.remove",
"call.arguments.change"
] | 1,365,611 | 1,365,612 | u036401720 | cpp |
p03695 | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long l... | #include <bits/stdc++.h>
#include <cmath>
#include <stdio.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
// rep…「0からn-1まで」の繰り返し
#define rep2(i, s, n) for (long long i = s; i <= (long long)(n); i++)
// rep2…「sからnまで」の繰り返し
#define repr(i, s, n) for (long long i = s; i >= (long l... | [
"call.add",
"call.arguments.add"
] | 1,365,617 | 1,365,618 | u931071094 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rep2(i, n) for (int i = 1; i <= (n); ++i)
#define rrep2(i, n) for (int i ... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rep2(i, n) for (int i = 1; i <= (n); ++i)
#define rrep2(i, n) for (int i ... | [
"call.add",
"call.arguments.add"
] | 1,365,619 | 1,365,620 | u365512540 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int col[8];
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
x /= 400;
if (x < 8)
col[x] = 1;
else
ans++;
}
int an = 0;
for (int i = 0; i < 8; i++)
an += col[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int col[8];
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
x /= 400;
if (x < 8)
col[x] = 1;
else
ans++;
}
int an = 0;
for (int i = 0; i < 8; i++)
an += col[i... | [
"literal.number.change",
"io.output.change"
] | 1,365,621 | 1,365,622 | u184929210 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int col[8];
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
x /= 400;
if (x < 8)
col[x] = 1;
else
ans++;
}
int an = 0;
for (int i = 0; i < 8; i++)
an += col[i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int col[8];
int main() {
int n;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++) {
int x;
cin >> x;
x /= 400;
if (x < 8)
col[x] = 1;
else
ans++;
}
int an = 0;
for (int i = 0; i < 8; i++)
an += col[i... | [
"call.add",
"call.arguments.add"
] | 1,365,623 | 1,365,622 | u184929210 | cpp |
p03695 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(v) v.begin(), v.end... | [
"call.remove",
"call.arguments.change"
] | 1,365,624 | 1,365,625 | u184929210 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define show(x) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define show(x) \
{ ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,365,626 | 1,365,627 | u317715099 | cpp |
p03695 | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
int N, tmp1 = 0, tmp2 = 0;
cin >> N;
ve... | #include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) v.begin(), v.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
int main() {
int N, tmp1 = 0, tmp2 = 0;
cin >> N;
ve... | [
"expression.operation.binary.remove",
"literal.string.change",
"io.output.change"
] | 1,365,628 | 1,365,629 | u320211890 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> col(10, 0);
while (N--) {
int a;
cin >> a;
col[min(8, a / 400)]++;
}
int mi = 0;
for (int i = 0; i <= 7; i++) {
if (col[i] != 0)
mi++;
}
cout << min(1, mi) << ' ' << mi + col[8] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> col(10, 0);
while (N--) {
int a;
cin >> a;
col[min(8, a / 400)]++;
}
int mi = 0;
for (int i = 0; i <= 7; i++) {
if (col[i] != 0)
mi++;
}
cout << max(1, mi) << ' ' << mi + col[8] << endl;
}
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,365,635 | 1,365,636 | u858575800 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> col(10, 0);
while (N--) {
int a;
cin >> a;
col[min(8, a / 400)]++;
}
int mi = 0;
for (int i = 0; i <= 7; i++) {
if (col[i] != 0)
mi++;
}
cout << mi << ' ' << mi + col[8] << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> col(10, 0);
while (N--) {
int a;
cin >> a;
col[min(8, a / 400)]++;
}
int mi = 0;
for (int i = 0; i <= 7; i++) {
if (col[i] != 0)
mi++;
}
cout << max(1, mi) << ' ' << mi + col[8] << endl;
}
| [
"call.add",
"call.arguments.change"
] | 1,365,637 | 1,365,636 | u858575800 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int int_len(int n) {
int s = 0;
while (n != 0)
s++, n /= 10;
return s;
}
int int_sum(int n) {
int m = 0, s = 0, a = n;
while (a != 0)
s++, a /= 10;
for (int i = s - 1; i >= 0; i--)
m += n / ((int)pow(... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,365,638 | 1,365,639 | u264265458 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
#define dunk(a) cout << (a) << endl
#define rall(a) (a).rbegin(), (a).rend()
const int INF = 2e9;
using namespace std;
using Graph = vector<vector<int>>;
typedef pair<int, int> P;
typedef long long ll;
int mai... | [
"literal.number.change",
"io.output.change"
] | 1,365,640 | 1,365,641 | u454081619 | cpp |
p03695 | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(... | #include <bits/stdc++.h>
#define ALL(obj) begin(obj), end(obj)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace std;
template <class T> vector<T> make_vec(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vec(size_t a, Ts... ts) {
return vector<decltype(make_vec<T>(ts...))>(... | [
"call.remove",
"call.arguments.change"
] | 1,365,644 | 1,365,645 | u571173211 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int cnt[9] = {};
for (int i = 0; i < N; i++) {
int a;
cin >> a;
a /= 400;
if (a >= 8)
a = 8;
cnt[a]++;
}
int mn = 0;
for (int i = 0; i <= 7; i++) {
if (cnt[i])
mn++;
}
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int cnt[9] = {};
for (int i = 0; i < N; i++) {
int a;
cin >> a;
a /= 400;
if (a >= 8)
a = 8;
cnt[a]++;
}
int mn = 0;
for (int i = 0; i <= 7; i++) {
if (cnt[i])
mn++;
}
... | [
"assignment.change",
"assignment.add"
] | 1,365,652 | 1,365,653 | u756388720 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typ... | [
"call.add",
"call.arguments.add"
] | 1,365,654 | 1,365,655 | u828388155 | cpp |
p03695 | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <util... | #define DEBUG 1
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <util... | [
"call.add",
"call.arguments.change"
] | 1,365,660 | 1,365,661 | u426683236 | cpp |
p03695 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int N, a, ans = 0;
cin >> N;
vector<int> c(9, 0);
rep(i, N) {
cin >> a;
c[min(a / 400, 8)]++;
}
rep(i, 8) {
if (c[i] > 0)
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const int INF = 1e9;
int main() {
int N, a, ans = 0;
cin >> N;
vector<int> c(9, 0);
rep(i, N) {
cin >> a;
c[min(a / 400, 8)]++;
}
rep(i, 8) {
if (c[i] > 0)
... | [
"call.remove",
"call.arguments.change"
] | 1,365,664 | 1,365,665 | u555962250 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, r = 0, min = 0;
bool rate[8] = {};
cin >> n;
for (int i = 0; i != n; i++) {
int a;
cin >> a;
if (a < 3200)
rate[a / 400 - 1] = true;
else
r++;
}
for (int i = 0; i != 8; i++)
min += (int)rate[i];
if (min =... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n, r = 0, min = 0;
bool rate[8] = {};
cin >> n;
for (int i = 0; i != n; i++) {
int a;
cin >> a;
if (a < 3200)
rate[a / 400] = true;
else
r++;
}
for (int i = 0; i != 8; i++)
min += (int)rate[i];
if (min == 0)... | [
"expression.operation.binary.remove"
] | 1,365,666 | 1,365,667 | u617380180 | cpp |
p03695 | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N;
cin >> N;
set<int> que;
int max_ans = 0, min_ans = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
a /= 400;
if (a >= 8 and que.count(8))
max_ans++;
que.insert(min(a, 8LL));
}
min_ans = ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
signed main() {
int N;
cin >> N;
set<int> que;
int max_ans = 0, min_ans = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
a /= 400;
if (a >= 8 and que.count(8))
max_ans++;
que.insert(min(a, 8LL));
}
min_ans = ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"literal.number.change"
] | 1,365,684 | 1,365,685 | u176979814 | cpp |
p03695 | #include <cstdlib>
#include <iostream>
#include <vector>
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> color(8, 0);
int uppper8 = 0;
for (int i = 0; i < n; i++) {
int r = a[i] / 400;
if (r < 8) {
color[r] =... | #include <cstdlib>
#include <iostream>
#include <vector>
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> color(8, 0);
int uppper8 = 0;
for (int i = 0; i < n; i++) {
int r = a[i] / 400;
if (r < 8) {
color[r] =... | [
"call.remove",
"call.arguments.change"
] | 1,365,686 | 1,365,687 | u476027087 | cpp |
p03695 | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef... | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef... | [
"call.remove",
"call.arguments.change"
] | 1,365,688 | 1,365,689 | u455266724 | cpp |
p03695 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> people(n);
for (int i = 0; i < n; i++) {
cin >> people[i];
}
vector<int> rateMember(9, 0);
for (int i = 0; i < n; i++) {
int rate = min(people[i] / 400, 8);
rateMember[rate] += 1;
}
int w... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> people(n);
for (int i = 0; i < n; i++) {
cin >> people[i];
}
vector<int> rateMember(9, 0);
for (int i = 0; i < n; i++) {
int rate = min(people[i] / 400, 8);
rateMember[rate] += 1;
}
int w... | [
"call.remove",
"call.arguments.change"
] | 1,365,690 | 1,365,691 | u609981535 | cpp |
p03695 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> people(n);
for (int i = 0; i < n; i++) {
cin >> people[i];
}
vector<int> rateMember(9, 0);
for (int i = 0; i < n; i++) {
int rate = min(people[i] / 400, 8);
rateMember[rate] += 1;
}
int w... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> people(n);
for (int i = 0; i < n; i++) {
cin >> people[i];
}
vector<int> rateMember(9, 0);
for (int i = 0; i < n; i++) {
int rate = min(people[i] / 400, 8);
rateMember[rate] += 1;
}
int w... | [
"call.remove",
"call.arguments.change"
] | 1,365,692 | 1,365,691 | u609981535 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#defin... | #include <bits/stdc++.h>
using namespace std;
#define MOD (long long int)(1e9 + 7)
#define ll long long int
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define reps(i, n) for (int i = 1; i <= (int)(n); i++)
#define REP(i, n) for (int i = n - 1; i >= 0; i--)
#define REPS(i, n) for (int i = n; i > 0; i--)
#defin... | [
"call.arguments.change"
] | 1,365,693 | 1,365,694 | u050698451 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
ty... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,365,695 | 1,365,696 | u987913144 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPD(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define FILLl(n, first_dimension_size, value) ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Pl = pair<ll, ll>;
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define REPD(i, n) for (ll i = (ll)n - 1; i >= 0; i--)
#define ALL(x) (x).begin(), (x).end()
#define FILLl(n, first_dimension_size, value) ... | [
"call.remove",
"call.arguments.change"
] | 1,365,700 | 1,365,701 | u204536668 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
int sum = 0;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
int x = a / 400;
if (x >= 8) {
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <vector>
using namespace std;
void solve() {
int n;
cin >> n;
int sum = 0;
map<int, int> mp;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
int x = a / 400;
if (x >= 8) {
... | [
"call.remove",
"call.arguments.change"
] | 1,365,702 | 1,365,703 | u489302942 | 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];
}
int sum[8] = {};
int test = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= 3200)
test++;
else {
int num = a[i] / 400;
sum[num]++;
}
}... | #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];
}
int sum[8] = {};
int test = 0;
for (int i = 0; i < n; i++) {
if (a[i] >= 3200)
test++;
else {
int num = a[i] / 400;
sum[num]++;
}
}... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,365,704 | 1,365,705 | u459105164 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, color[9], x, mini = 0;
cin >> n;
for (int i = 0; i < 9; i++)
color[i] = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (3200 <= x)
color[8]++;
else if (color[x / 400] == 0) {
color[x / 400]++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, color[9], x, mini = 0;
cin >> n;
for (int i = 0; i < 9; i++)
color[i] = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (3200 <= x)
color[8]++;
else if (color[x / 400] == 0) {
color[x / 400]++;
... | [
"call.remove",
"call.arguments.change"
] | 1,365,706 | 1,365,707 | u050087249 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, color[9], x, mini = 0;
cin >> n;
for (int i = 0; i < 9; i++)
color[i] = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (3200 <= x)
color[8]++;
else if (color[x / 400] == 0) {
color[x / 400]++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, color[9], x, mini = 0;
cin >> n;
for (int i = 0; i < 9; i++)
color[i] = 0;
for (int i = 0; i < n; i++) {
cin >> x;
if (3200 <= x)
color[8]++;
else if (color[x / 400] == 0) {
color[x / 400]++;
... | [
"call.remove",
"call.arguments.change"
] | 1,365,708 | 1,365,707 | u050087249 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define PI acos(-1)
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define PI acos(-1)
#define fast_io \
ios_base::sync_with_stdio(false); \
cin.tie(0); ... | [
"call.remove",
"call.arguments.change"
] | 1,365,711 | 1,365,712 | u679159704 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, all = 0;
set<int> color;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < 400)
color.insert(1);
else if (a < 800)
color.insert(2);
else if (a < 1200)
color.insert(3);
else if (a < 1600)
colo... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, all = 0;
set<int> color;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < 400)
color.insert(1);
else if (a < 800)
color.insert(2);
else if (a < 1200)
color.insert(3);
else if (a < 1600)
colo... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,365,717 | 1,365,718 | u623759422 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
vector<ll> cnt(9, 0);
ll n;
cin >> n;
for (ll i = 0, x; i < n; i++) {
cin >> x;
if (x <= 399)
cnt[0]++;
else if (x <= 799)
cnt[1]++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
vector<ll> cnt(9, 0);
ll n;
cin >> n;
for (ll i = 0, x; i < n; i++) {
cin >> x;
if (x <= 399)
cnt[0]++;
else if (x <= 799)
cnt[1]++;
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,365,719 | 1,365,720 | u740916051 | cpp |
p03695 | #include <iostream>
#include <map>
using namespace std;
int main() {
map<int, int> mp;
int N;
cin >> N;
for (int n = 0; n < N; n++) {
int a;
cin >> a;
mp[a / 400]++;
}
int ans = 0;
int tans = 0;
for (auto itr = mp.begin(); itr != mp.end(); itr++) {
if (itr->first > 7) {
tans +... | #include <iostream>
#include <map>
using namespace std;
int main() {
map<int, int> mp;
int N;
cin >> N;
for (int n = 0; n < N; n++) {
int a;
cin >> a;
mp[a / 400]++;
}
int ans = 0;
int tans = 0;
for (auto itr = mp.begin(); itr != mp.end(); itr++) {
if (itr->first > 7) {
tans +... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,365,721 | 1,365,722 | u806657856 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
map<ll, ll> counts;
ll elsecount = 0;
ll N;
cin >> N;
for (ll i = 0; i < N; i++) {
ll tmp;
cin >> tmp;
if (tmp < 3200)
counts[tmp / 400]++;
else
elsecount++;
}
ll count = 0;
for (auto e : count... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
map<ll, ll> counts;
ll elsecount = 0;
ll N;
cin >> N;
for (ll i = 0; i < N; i++) {
ll tmp;
cin >> tmp;
if (tmp < 3200)
counts[tmp / 400]++;
else
elsecount++;
}
ll count = 0;
for (auto e : count... | [
"literal.number.change",
"io.output.change"
] | 1,365,744 | 1,365,745 | u868205915 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
int color[8];
rep(i, 8) color[i] = 0;
int rate;
int over = 0;
rep(i, n) {
cin >> rate;
if (rate >= 3200)
over++;
else
color[rate / 400]++;
}
int cnt... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
int color[8];
rep(i, 8) color[i] = 0;
int rate;
int over = 0;
rep(i, n) {
cin >> rate;
if (rate >= 3200)
over++;
else
color[rate / 400]++;
}
int cnt... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,365,746 | 1,365,747 | u253952966 | cpp |
p03695 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> R(8);
int O = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a >= 3200)
O++;
else
R.at(a / 400)++;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (R.at(i) ... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> R(8);
int O = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a >= 3200)
O++;
else
R.at(a / 400)++;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (R.at(i) ... | [
"call.add",
"call.arguments.add"
] | 1,365,748 | 1,365,749 | u127314985 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int color = 0;
int F = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 3200) {
color |= (1 << (a / 400));
} else {
F++;
}
}
cout << __builtin_popcount(color) << ' ' << __builtin_popcount(c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int color = 0;
int F = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 3200) {
color |= (1 << (a / 400));
} else {
F++;
}
}
cout << max(__builtin_popcount(color), 1) << ' '
<< __bui... | [
"call.add",
"call.arguments.add"
] | 1,365,763 | 1,365,764 | u424374375 | cpp |
p03695 | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); i++)
#define FOR(i, a, b) for (int(i) = a; (i) < (int)b; i++)
#define RREP(i, n) for (int(i) = ((int)(n)-1); (i) >= 0; i--)
#define RFOR(i, a, b) for (int(i) = ((int)(b)-1); (i) >= (int)a; i--)
#define ALL(v) (v).begin(), (v).end()
#define MOD ... | [
"call.remove",
"call.arguments.change"
] | 1,365,768 | 1,365,769 | u852449189 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define long ll
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
bitset<8> s;
ll m = 0;
for (ll i = 0; i < n; i++) {
ll a;
cin >> a;
if (3200 <= a)
m++;
else if (2800 <= a)
s[0] ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
#define long ll
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
bitset<8> s;
ll m = 0;
for (ll i = 0; i < n; i++) {
ll a;
cin >> a;
if (3200 <= a)
m++;
else if (2800 <= a)
s[0] ... | [
"call.arguments.change"
] | 1,365,772 | 1,365,773 | u056944756 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
sort(a, a + n);
int c = 1, cc = 0;
REP(i, n) {
if (a[i] < 3200 && a... | #include <algorithm>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
sort(a, a + n);
int c = 1, cc = 0;
REP(i, n) {
if (a[i] < 3200 && a... | [
"call.remove",
"call.arguments.change"
] | 1,365,775 | 1,365,776 | u841702632 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
sort(a, a + n);
int c = 0, cc = 0;
REP(i, n) {
if (a[i] < 3200 && a... | #include <algorithm>
#include <cmath>
#include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
rep(i, n) cin >> a[i];
sort(a, a + n);
int c = 1, cc = 0;
REP(i, n) {
if (a[i] < 3200 && a... | [
"literal.number.change",
"variable_declaration.value.change",
"call.remove",
"call.arguments.change"
] | 1,365,777 | 1,365,776 | u841702632 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
const ll LINF = 0x1fffffffffffffff;
const int INF = 0x3fffffff;
const int MOD = 1000000007;
#define VAR(type, ...) \
t... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
const ll LINF = 0x1fffffffffffffff;
const int INF = 0x3fffffff;
const int MOD = 1000000007;
#define VAR(type, ...) \
t... | [
"call.add",
"call.arguments.add"
] | 1,365,780 | 1,365,781 | u826998403 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fix(... | [
"call.remove",
"call.arguments.change"
] | 1,365,782 | 1,365,783 | u164316941 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << #var << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void solve() {
int n;
scanf("%d", &n);
int h[10] = {};
for (int t, i = 0; i < n; +... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << #var << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
void solve() {
int n;
scanf("%d", &n);
int h[10] = {};
for (int t, i = 0; i < n; +... | [
"control_flow.loop.for.update.change",
"call.add",
"call.arguments.add"
] | 1,365,790 | 1,365,791 | u953463534 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << #var << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int v[] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
void solve() {
int n;
scanf... | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#define debug(var) cerr << #var << " = " << (var) << endl;
#else
#define debug(var)
#endif
void init() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
int v[] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
void solve() {
int n;
scanf... | [
"identifier.change",
"call.function.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 1,365,792 | 1,365,793 | u953463534 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
cin >> n;
int bit = 0;
int a, ex = 0;
REP(i, n) {
cin >> a;
if (a <= 399)
bit |= (1 << 1);
else if (a <= 799)
bit |= (1 << 2);
else if (a <= 1199)... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
using ll = long long;
int main() {
int n;
cin >> n;
int bit = 0;
int a, ex = 0;
REP(i, n) {
cin >> a;
if (a <= 399)
bit |= (1 << 1);
else if (a <= 799)
bit |= (1 << 2);
else if (a <= 1199)... | [
"call.remove",
"call.arguments.change"
] | 1,365,794 | 1,365,795 | u303884911 | cpp |
p03695 | #include <iostream>
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 < 9; i++)
c[i] = 0;
for (int i = 0; i < n; i++) {
if (a[i] < 400) {
c[0]++;
continue;
}
if (a[i] < 800) {
c[1]++;
... | #include <iostream>
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 < 9; i++)
c[i] = 0;
for (int i = 0; i < n; i++) {
if (a[i] < 400) {
c[0]++;
continue;
}
if (a[i] < 800) {
c[1]++;
... | [
"call.add",
"call.arguments.change"
] | 1,365,798 | 1,365,799 | u633728454 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> v(9);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v[min(8, a / 40... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr int inf = 0x3f3f3f3f;
constexpr ll linf = 0x3f3f3f3f3f3f3f3fLL;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<int> v(9);
for (int i = 0; i < n; i++) {
int a;
cin >> a;
v[min(8, a / 40... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,365,803 | 1,365,804 | u394759653 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
int main() {
int n;
cin >> n;
vect... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using ll = long long;
using vi = vector<int>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
int main() {
int n;
cin >> n;
vect... | [
"call.remove",
"call.arguments.change"
] | 1,365,807 | 1,365,808 | u607594286 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int N;
int rate;
int A[9];
int color = 0;
cin >> N;
for (int i = 0; i < 9; i++) {
A[i] = 0;
}
for (int i = 0; i < N; i++) {
cin >> rate;
A[min(8, rate / 400)] += 1;
}
for (int i = 0; i < 8; i++) {
color += min(1, A[i]);
}
cout... | #include <iostream>
using namespace std;
int main() {
int N;
int rate;
int A[9];
int color = 0;
cin >> N;
for (int i = 0; i < 9; i++) {
A[i] = 0;
}
for (int i = 0; i < N; i++) {
cin >> rate;
A[min(8, rate / 400)] += 1;
}
for (int i = 0; i < 8; i++) {
color += min(1, A[i]);
}
cout... | [
"call.add",
"call.arguments.add"
] | 1,365,815 | 1,365,816 | u453683890 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).be... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).be... | [
"call.remove",
"call.arguments.change"
] | 1,365,825 | 1,365,826 | u682395093 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, P, G = 0, X = 0;
cin >> N;
vector<bool> C(8, false);
for (int i = 0; i < N; i++) {
cin >> P;
if (P < 400)
C.at(0) = true;
else if (P < 800)
C.at(1) = true;
else if (P < 1200)
C.at(2) = true;
else if (P < 1600... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, P, G = 0, X = 0;
cin >> N;
vector<bool> C(8, false);
for (int i = 0; i < N; i++) {
cin >> P;
if (P < 400)
C.at(0) = true;
else if (P < 800)
C.at(1) = true;
else if (P < 1200)
C.at(2) = true;
else if (P < 1600... | [
"call.remove",
"call.arguments.change"
] | 1,365,827 | 1,365,828 | u820224016 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, P, G = 0, X = 0;
cin >> N;
vector<bool> C(8, false);
for (int i = 0; i < N; i++) {
cin >> P;
if (P < 400)
C.at(0) = true;
else if (P < 800)
C.at(1) = true;
else if (P < 1200)
C.at(2) = true;
else if (P < 1600... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, P, G = 0, X = 0;
cin >> N;
vector<bool> C(8, false);
for (int i = 0; i < N; i++) {
cin >> P;
if (P < 400)
C.at(0) = true;
else if (P < 800)
C.at(1) = true;
else if (P < 1200)
C.at(2) = true;
else if (P < 1600... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"call.remove",
"call.arguments.change"
] | 1,365,829 | 1,365,828 | u820224016 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
... | #include <bits/stdc++.h>
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
using namespace std;
typedef long long ll;
... | [
"call.add",
"call.arguments.add"
] | 1,365,830 | 1,365,831 | u714564133 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef long long ll;... | #include <bits/stdc++.h>
using namespace std;
#define rep2(x, fr, to) for (int(x) = (fr); (x) < (to); (x)++)
#define rep(x, to) for (int(x) = 0; (x) < (to); (x)++)
#define repr(x, fr, to) for (int(x) = (fr); (x) >= (to); (x)--)
#define all(c) (c).begin(), (c).end()
#define sz(v) (int)(v).size()
typedef long long ll;... | [
"call.add",
"call.arguments.change"
] | 1,365,832 | 1,365,833 | u714564133 | cpp |
p03695 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<bool> color(8, false);
int c = 0, sub = 0;
for (int i = 0; i < n; ++i) {
if (a[i] >= 3200) {
++sub;
continue;
}
color[a[i]... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
vector<bool> color(8, false);
int c = 0, sub = 0;
for (int i = 0; i < n; ++i) {
if (a[i] >= 3200) {
++sub;
continue;
}
color[a[i]... | [
"expression.unary.arithmetic.add"
] | 1,365,842 | 1,365,843 | u698883164 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define LSOne(S) ((S) & (-S))
#define EPS 1e-6
#define MOD 1000000007
#define fi first
#define se second
#define pb push_back
#define ende '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mset(x, y) memset(&x, (y), sizeof(x))
... | #include <bits/stdc++.h>
using namespace std;
#define LSOne(S) ((S) & (-S))
#define EPS 1e-6
#define MOD 1000000007
#define fi first
#define se second
#define pb push_back
#define ende '\n'
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mset(x, y) memset(&x, (y), sizeof(x))
... | [
"call.add",
"call.arguments.change"
] | 1,365,844 | 1,365,845 | u842789193 | cpp |
p03695 | /*
＿＿
／＞ フ
| _ _ l
／` ミ＿xノ
/ | 見ちゃだめだよ！
/ ヽ ﾉ
│ | | |
／￣| | | |
| (￣ヽ＿_ヽ_)__)
＼二つ
*/
#include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) reverse((a).begin(), (a).end())
#define rep(i, n) for (int i = 0; i <... | /*
＿＿
／＞ フ
| _ _ l
／` ミ＿xノ
/ | 見ちゃだめだよ！
/ ヽ ﾉ
│ | | |
／￣| | | |
| (￣ヽ＿_ヽ_)__)
＼二つ
*/
#include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) reverse((a).begin(), (a).end())
#define rep(i, n) for (int i = 0; i <... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 1,365,850 | 1,365,851 | u251779460 | cpp |
p03695 | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define ll long long
using namespace std;
void fil... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define ll long long
using namespace std;
void fil... | [
"call.add",
"call.arguments.add"
] | 1,365,294 | 1,365,295 | u804831318 | cpp |
p03695 | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define ll long long
using namespace std;
void fil... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define ll long long
using namespace std;
void fil... | [
"call.add",
"call.arguments.change"
] | 1,365,296 | 1,365,295 | u804831318 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int r[9] = {0};
for (int i = 0; i < n; i++) {
if (arr[i] >=... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++)
cin >> arr[i];
int r[9] = {0};
for (int i = 0; i < n; i++) {
if (arr[i] >=... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,365,299 | 1,365,300 | u449065018 | cpp |
p03695 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef ... | [
"call.remove",
"call.arguments.change"
] | 1,365,301 | 1,365,302 | u239409893 | cpp |
p03695 | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <utility>
#include <vector>
using namespace std;
typedef ... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"call.remove",
"call.arguments.change"
] | 1,365,303 | 1,365,302 | u239409893 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
bool colours[8];
for (int i = 0; i < 8; i++)
colours[i] = false;
int N;
int free = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int r;
cin >> r;
int index = r / 400;
// cout << "index: " << index << endl;
if (index < 8)
c... | #include <iostream>
using namespace std;
int main() {
bool colours[8];
for (int i = 0; i < 8; i++)
colours[i] = false;
int N;
int free = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int r;
cin >> r;
int index = r / 400;
if (index < 8)
colours[index] = true;
else
free++... | [
"call.remove",
"call.arguments.change"
] | 1,365,307 | 1,365,308 | u687600654 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
... | [
"literal.number.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,365,311 | 1,365,312 | u094155508 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <utility>
#include <vector>
using namespace std;
struct aaa {
aaa() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
... | [
"call.add",
"call.arguments.change"
] | 1,365,313 | 1,365,312 | u094155508 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define lol long long
#define mp make_pair
#define fi first
#define se second
#define pu push_back
#define SYOU(x) setprecision(x + 1)
#define abs(x, y) (max(x, y) - min(x, y))
#define SUM(n) ((n)... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, n) for (int i = 1; i <= (n); i++)
#define lol long long
#define mp make_pair
#define fi first
#define se second
#define pu push_back
#define SYOU(x) setprecision(x + 1)
#define abs(x, y) (max(x, y) - min(x, y))
#define SUM(n) ((n)... | [
"expression.operation.binary.add"
] | 1,365,322 | 1,365,323 | u623468376 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include... | [
"call.remove",
"call.arguments.change"
] | 1,365,328 | 1,365,329 | u190018920 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include... | [
"assignment.change",
"call.arguments.change"
] | 1,365,330 | 1,365,329 | u190018920 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define RFOR(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define RITR(x, c) for (__typeof(c.... | [
"call.remove",
"call.arguments.change"
] | 1,365,333 | 1,365,334 | u682686221 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<bool> color(8, false);
int red = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 400) {
color[0] = true;
} else if (a[i] < 800) ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<bool> color(8, false);
int red = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] < 400) {
color[0] = true;
} else if (a[i] < 800) ... | [
"call.add",
"call.arguments.add"
] | 1,365,335 | 1,365,336 | u803481017 | cpp |
p03695 | #include <iostream>
#include <map>
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> ns;
int a;
int over8 = 0;
for (int i = 0; i < N; ++i) {
cin >> a;
auto idx = a / 400;
if (idx < 8) {
ns[idx]++;
} else {
over8++;
}
}
auto minv = over8 > 0 ? ns.size() : 1... | #include <iostream>
#include <map>
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> ns;
int a;
int over8 = 0;
for (int i = 0; i < N; ++i) {
cin >> a;
auto idx = a / 400;
if (idx < 8) {
ns[idx]++;
} else {
over8++;
}
}
auto minv = ns.size() > 0 ? ns.size()... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.add"
] | 1,365,339 | 1,365,340 | u231541008 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 2000... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 2000... | [
"call.remove",
"call.arguments.change"
] | 1,365,343 | 1,365,344 | u980909653 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
const int con = 8;
int N;
int ans;
bool flag[8];
int main(void) {
int CountA;
int Count;
CountA = 0;
Count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> ans;
ans = ans / 400;
if (ans >= con) {
CountA++;
} else {
flag[ans] = tru... | #include <bits/stdc++.h>
using namespace std;
const int con = 8;
int N;
int ans;
bool flag[8];
int main(void) {
int CountA;
int Count;
CountA = 0;
Count = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> ans;
ans = ans / 400;
if (ans >= con) {
CountA++;
} else {
flag[ans] = tru... | [
"control_flow.branch.else.add"
] | 1,365,351 | 1,365,352 | u935620673 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ai, i;
int arr[8];
for (i = 0; i < 8; i++) {
arr[i] = 0;
}
int cnt_clr = 0, cnt_over3200 = 0;
cin >> N;
for (i = 0; i < N; i++) {
cin >> ai;
if (ai < 400)
arr[0]++;
else if (ai < 800)
arr[1]++;
else if (ai... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, ai, i;
int arr[8];
for (i = 0; i < 8; i++) {
arr[i] = 0;
}
int cnt_clr = 0, cnt_over3200 = 0;
cin >> N;
for (i = 0; i < N; i++) {
cin >> ai;
if (ai < 400)
arr[0]++;
else if (ai < 800)
arr[1]++;
else if (ai... | [
"call.add",
"call.arguments.change"
] | 1,365,353 | 1,365,354 | u494249944 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FASTINOUT \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define endl '\n'
#define FASTINOUT \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); ... | [
"call.remove",
"call.arguments.change"
] | 1,365,358 | 1,365,359 | u257571179 | cpp |
p03695 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> lis(8, 0);
int count = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a <= 399) {
lis[0]++;
} else if (a <= 799) {
lis[1]++;
} else if (a <= 1199) {
lis[2... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<int> lis(8, 0);
int count = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a <= 399) {
lis[0]++;
} else if (a <= 799) {
lis[1]++;
} else if (a <= 1199) {
lis[2... | [
"call.remove",
"call.arguments.change"
] | 1,365,360 | 1,365,361 | u639426108 | cpp |
p03695 | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
typedef long long LL;
typedef pair<int, int> pii;
const int INTINF = 1e9;
const L... | #include "bits/stdc++.h"
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP0(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REP1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; ++i)
typedef long long LL;
typedef pair<int, int> pii;
const int INTINF = 1e9;
const L... | [
"call.add",
"call.arguments.add"
] | 1,365,362 | 1,365,363 | u938389536 | cpp |
p03695 | #include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute() {
int N;
cin >> N;
vector<bool> color(8, false);
int rainbow = 0;
int ans ... | #include <bits/stdc++.h>
typedef long long int lint;
#define PI acos(-1)
#define INF64 1LL << 60
#define INF32 1 << 29
#define all(a) (a).begin(), (a).end()
#define INV ((long long int)1000000007)
using namespace std;
void execute() {
int N;
cin >> N;
vector<bool> color(8, false);
int rainbow = 0;
int ans ... | [
"call.remove",
"call.arguments.change"
] | 1,365,374 | 1,365,375 | u874525170 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.