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;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] >= 3200)
count++;
}
int ans = 0;
for (int i = 0; i <= 7; i++) {
for (int j = 0; j < N; j++) {
i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
vector<int> a(N);
int count = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
if (a[i] >= 3200)
count++;
}
int ans = 0;
for (int i = 0; i <= 7; i++) {
for (int j = 0; j < N; j++) {
i... | [
"call.add",
"io.output.change"
] | 1,365,376 | 1,365,377 | u115106582 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
int n, ans = 0, red = 0;
cin >> n;
vector<bool> color(8, false);
REP(i, n) {
int t;
cin >> t;
if (t < 3200)
color.at(t / 400) = true;
else
red++;
}
REP(i, 8) {
if (co... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
int n, ans = 0, red = 0;
cin >> n;
vector<bool> color(8, false);
REP(i, n) {
int t;
cin >> t;
if (t < 3200)
color.at(t / 400) = true;
else
red++;
}
REP(i, 8) {
if (co... | [
"call.remove",
"call.arguments.change"
] | 1,365,383 | 1,365,384 | u082801599 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> count(9);
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
count[min(a[i] / 400, 8)] += 1;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (count[i] >= 1)
ans += 1;
}
cout << min(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> count(9);
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
count[min(a[i] / 400, 8)] += 1;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (count[i] >= 1)
ans += 1;
}
cout << min(... | [
"call.remove",
"call.arguments.change"
] | 1,365,388 | 1,365,389 | u180716041 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long int lli;
#define rep(i, s, N) for (int i = s; i < N; i++)
using namespace std;
int main(void) {
vector<bool> judg... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long int lli;
#define rep(i, s, N) for (int i = s; i < N; i++)
using namespace std;
int main(void) {
vector<bool> judg... | [
"call.add",
"call.arguments.add"
] | 1,365,392 | 1,365,393 | u652760628 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> vec = {399, 799, 1199, 1599, 1999, 2399, 2799, 3199, 4800};
vector<int> mp(9, 0);
int a;
int add = 0;
for (int i = 0; i < n; i++) {
cin >> a;
for (int i = 0; i < 9; i++) {
if (i == 8) {
add+... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<int> vec = {399, 799, 1199, 1599, 1999, 2399, 2799, 3199, 4800};
vector<int> mp(9, 0);
int a;
int add = 0;
for (int i = 0; i < n; i++) {
cin >> a;
for (int i = 0; i < 9; i++) {
if (i == 8) {
add+... | [
"call.add",
"call.arguments.add"
] | 1,365,410 | 1,365,411 | u150659133 | cpp |
p03695 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define REPvec(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007 // 1e9+7
using namespace std;
typedef long long ll;
typedef vector<int> vecint;
typedef vector<ll> vecll;
typed... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (int)n; i++)
#define REPvec(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
#define all(x) x.begin(), x.end()
#define MOD 1000000007 // 1e9+7
using namespace std;
typedef long long ll;
typedef vector<int> vecint;
typedef vector<ll> vecll;
typed... | [
"call.remove",
"call.arguments.change"
] | 1,365,412 | 1,365,413 | u138062788 | cpp |
p03695 | using namespace std;
#include <bits/stdc++.h>
#define BEGIN \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define END return EXIT_SUCCESS
#define FOR(I, A, B) for ((I) = (A); (I) < (B); (I)++)
#define REP(... | using namespace std;
#include <bits/stdc++.h>
#define BEGIN \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define END return EXIT_SUCCESS
#define FOR(I, A, B) for ((I) = (A); (I) < (B); (I)++)
#define REP(... | [
"call.remove",
"call.arguments.change"
] | 1,365,416 | 1,365,417 | u743561048 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpll = vector<pll>... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpll = vector<pll>... | [
"call.remove",
"call.arguments.change"
] | 1,365,420 | 1,365,421 | u117348081 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#defi... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#defi... | [
"call.remove",
"call.arguments.change"
] | 1,365,424 | 1,365,425 | u954176652 | cpp |
p03695 |
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define dump(x) cerr << #x << " = " << (x) << endl
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" ... |
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define dump(x) cerr << #x << " = " << (x) << endl
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" ... | [
"call.remove",
"call.arguments.change"
] | 1,365,428 | 1,365,429 | u089177147 | cpp |
p03695 | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int any = 0;
set<int> colors;
REP(i, 0, N) {
int a;
cin >> a;
if (a < 400) {
colors.in... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int any = 0;
set<int> colors;
REP(i, 0, N) {
int a;
cin >> a;
if (a < 400) {
colors.in... | [
"call.remove",
"call.arguments.change"
] | 1,365,433 | 1,365,434 | u483992368 | cpp |
p03695 | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int any = 0;
set<int> colors;
REP(i, 0, N) {
int a;
cin >> a;
if (a < 400) {
colors.in... | #include <bits/stdc++.h>
#define REP(i, s, n) for (int i = s; i < n; i++)
#define ALL(a) a.begin(), a.end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int any = 0;
set<int> colors;
REP(i, 0, N) {
int a;
cin >> a;
if (a < 400) {
colors.in... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"call.remove",
"call.arguments.change"
] | 1,365,435 | 1,365,434 | u483992368 | 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> A(N);
rep(i, N) cin >> A[i];
int color[9] = {0};
for (int i = 0; i < N; i++) {
if (A[i] >= 3200)
color[8]++;
else
for (int j = 0; j < 8; j++) {
... | #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> A(N);
rep(i, N) cin >> A[i];
int color[9] = {0};
for (int i = 0; i < N; i++) {
if (A[i] >= 3200)
color[8]++;
else
for (int j = 0; j < 8; j++) {
... | [
"call.remove",
"call.arguments.change"
] | 1,365,436 | 1,365,437 | u480938608 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
//#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
//#include <boost/multiprecision/cpp_int.hpp>
// typedef boost::multiprecision::cpp_int ll;
typedef long double dd;
#define i_7 (ll)(1E9 + 7)
//#define i_7 998244353
#define i_5 i_7 - 2
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
ret... | [
"call.remove",
"call.arguments.change"
] | 1,365,449 | 1,365,450 | u541784678 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | [
"call.remove",
"call.arguments.change"
] | 1,365,456 | 1,365,457 | u258994590 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | [
"call.remove",
"call.arguments.change"
] | 1,365,458 | 1,365,457 | u258994590 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> rates(9);
for (int i = 0; i < N; i++) {
int rate;
cin >> rate;
if (rate < 400) {
rates.at(0)++;
} else if (rate < 800) {
rates.at(1)++;
} else if (rate < 1200) {
rates.at(2)++;
} el... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> rates(9);
for (int i = 0; i < N; i++) {
int rate;
cin >> rate;
if (rate < 400) {
rates.at(0)++;
} else if (rate < 800) {
rates.at(1)++;
} else if (rate < 1200) {
rates.at(2)++;
} el... | [
"call.remove",
"call.arguments.change"
] | 1,365,461 | 1,365,462 | u543466827 | cpp |
p03695 | //#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inclu... | //#include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#inclu... | [
"call.add",
"call.arguments.change"
] | 1,365,463 | 1,365,464 | u874947858 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int ctoi(char c) { return c - '0'; } // char to int
int gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } // MAX
int lcm(ll a, ll b) { return a * b / gcd(a, b); } // MIN
int main() {
vector<bool> a(8, false);
int che = 0;
int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int ctoi(char c) { return c - '0'; } // char to int
int gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } // MAX
int lcm(ll a, ll b) { return a * b / gcd(a, b); } // MIN
int main() {
vector<bool> a(8, false);
int che = 0;
int... | [
"call.add",
"call.arguments.add"
] | 1,365,473 | 1,365,474 | u157433024 | cpp |
p03695 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a;
vector<int> color(9);
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 400)
color[0]++;
else if (a < 800)
color[1]++;
else if (a < 1200)
color[2]++;
else if (a < 1600)
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a;
vector<int> color(9);
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 400)
color[0]++;
else if (a < 800)
color[1]++;
else if (a < 1200)
color[2]++;
else if (a < 1600)
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,365,477 | 1,365,478 | u240685518 | cpp |
p03695 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a;
vector<int> color(9);
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 400)
color[0]++;
else if (a < 800)
color[1]++;
else if (a < 1200)
color[2]++;
else if (a < 1600)
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a;
vector<int> color(9);
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 400)
color[0]++;
else if (a < 800)
color[1]++;
else if (a < 1200)
color[2]++;
else if (a < 1600)
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.remove",
"call.arguments.change"
] | 1,365,480 | 1,365,478 | u240685518 | cpp |
p03695 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a;
vector<int> color(9);
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 400)
color[0]++;
else if (a < 800)
color[1]++;
else if (a < 1200)
color[2]++;
else if (a < 1600)
... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int a;
vector<int> color(9);
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 400)
color[0]++;
else if (a < 800)
color[1]++;
else if (a < 1200)
color[2]++;
else if (a < 1600)
... | [
"call.remove",
"call.arguments.change"
] | 1,365,852 | 1,365,478 | u240685518 | 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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
c... | #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 FORR(i, m, n) for (int i = (m); i >= (n); --i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
using namespace std;
typedef long long ll;
c... | [
"call.remove",
"call.arguments.change"
] | 1,365,857 | 1,365,858 | u759721333 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool c... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1LL << 60;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool c... | [
"call.add",
"call.arguments.add"
] | 1,365,861 | 1,365,862 | u187878098 | cpp |
p03695 | #include "bits/stdc++.h"
#define fi first
#define se second
#define all(x) x.begin(), x.end()
using namespace std;
using ull = unsigned long long;
using ll = long long;
constexpr int I_INF = INT_MAX;
constexpr ll L_INF = LLONG_MAX;
const long double PI = (acos(-1));
const ull MOD = 1000000007;
struct __INIT {
__INI... | #include "bits/stdc++.h"
#define fi first
#define se second
#define all(x) x.begin(), x.end()
using namespace std;
using ull = unsigned long long;
using ll = long long;
constexpr int I_INF = INT_MAX;
constexpr ll L_INF = LLONG_MAX;
const long double PI = (acos(-1));
const ull MOD = 1000000007;
struct __INIT {
__INI... | [
"call.remove",
"call.arguments.change"
] | 1,365,868 | 1,365,869 | u102067593 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define FALSE printf("false\n");
#define TR... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
#define FALSE printf("false\n");
#define TR... | [
"call.remove",
"call.arguments.change"
] | 1,365,879 | 1,365,880 | u184572586 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> list(9, 0);
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
temp = min(8, temp / 400);
list.at(temp)++;
}
int count = 0;
for (int i = 0; i < 8; i++) {
if (list.at(i)) {
count++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> list(9, 0);
for (int i = 0; i < n; i++) {
int temp;
cin >> temp;
temp = min(8, temp / 400);
list.at(temp)++;
}
int count = 0;
for (int i = 0; i < 8; i++) {
if (list.at(i)) {
count++;
}
... | [
"call.add",
"call.arguments.change"
] | 1,365,881 | 1,365,882 | u718758485 | cpp |
p03695 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(b,... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
template <class T> using V = vector<T>;
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
const ll inf = (1e18);
const ll mod = 1000000007;
ll gcd(ll a, ll b) { return b ? gcd(b,... | [
"call.add",
"call.arguments.add"
] | 1,365,891 | 1,365,892 | u822169805 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define fi first
#define se second
set<string> c;
map<ll, ll> mp;
const ll inf = 100000000000000000;
const ll mod = 1000000007;
const ll mod2 = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
#define fi first
#define se second
set<string> c;
map<ll, ll> mp;
const ll inf = 100000000000000000;
const ll mod = 1000000007;
const ll mod2 = 998244353;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) {... | [
"call.add",
"call.arguments.add"
] | 1,365,893 | 1,365,894 | u822169805 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, atual, gray = 0, brown = 0, green = 0, cyan = 0, blue = 0, yellow = 0,
orange = 0, red = 0, any = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> atual;
if ((atual < 400) && (gray == 0)) {
gray++;
} else if (... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, atual, gray = 0, brown = 0, green = 0, cyan = 0, blue = 0, yellow = 0,
orange = 0, red = 0, any = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> atual;
if ((atual < 400) && (gray == 0)) {
gray++;
} else if (... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,365,895 | 1,365,896 | u977854742 | cpp |
p03695 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | [
"call.remove",
"call.arguments.change"
] | 1,365,900 | 1,365,901 | u421426760 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
int n, m;
cin >> n;
m = n;
int high = 0;
int gray = 0;
int brown = 0;
int green = 0;
int cyan = 0;
int blue = 0;
int yellow = 0;
int orange = 0;
int red = 0;
while (m--) {
int tmp;
cin >> tmp;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long int
int32_t main() {
int n, m;
cin >> n;
m = n;
int high = 0;
int gray = 0;
int brown = 0;
int green = 0;
int cyan = 0;
int blue = 0;
int yellow = 0;
int orange = 0;
int red = 0;
while (m--) {
int tmp;
cin >> tmp;
... | [
"call.add",
"call.arguments.add"
] | 1,365,902 | 1,365,903 | u472645805 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, x;
int vet[10];
scanf("%d", &N);
memset(vet, 0, sizeof(vet));
for (int i = 0; i < N; i++) {
scanf("%d", &x);
if (x < 400) {
vet[0] = 1;
} else if (x < 800) {
vet[1] = 1;
} else if (x < 1200) {
vet[2] = 1;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, x;
int vet[10];
scanf("%d", &N);
memset(vet, 0, sizeof(vet));
for (int i = 0; i < N; i++) {
scanf("%d", &x);
if (x < 400) {
vet[0] = 1;
} else if (x < 800) {
vet[1] = 1;
} else if (x < 1200) {
vet[2] = 1;
... | [] | 1,365,904 | 1,365,905 | u825924332 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int n, x, rating[8], topster = 0;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &x);
if (x <= 399)
rating[0] = 1;
if (x >= 400 && x <= 799)
rating[1] = 1;
if (x >= 800 && x <= 1199)
rating[2] = 1;
if (... | #include <bits/stdc++.h>
using namespace std;
int n, x, rating[8], topster = 0;
int main() {
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
scanf("%d", &x);
if (x <= 399)
rating[0] = 1;
if (x >= 400 && x <= 799)
rating[1] = 1;
if (x >= 800 && x <= 1199)
rating[2] = 1;
if (... | [
"call.remove",
"call.arguments.change"
] | 1,365,906 | 1,365,907 | u608935724 | cpp |
p03695 | //#pragma GCC optimize("O3")
//#pragma GCC target("avx")
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#inclu... | //#pragma GCC optimize("O3")
//#pragma GCC target("avx")
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#inclu... | [
"call.remove",
"call.arguments.change"
] | 1,365,908 | 1,365,909 | u465699806 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n)-1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define REP... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n)-1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define REP... | [
"call.add",
"call.arguments.change"
] | 1,365,914 | 1,365,915 | u540491484 | cpp |
p03695 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define rep(i, n) FOR(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define rep(i, n) FOR(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
... | [
"literal.number.change",
"call.arguments.change"
] | 1,365,916 | 1,365,917 | u850516963 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, i, c[9], k, ans = 0;
cin >> n;
int a[n];
for (i = 0; i < 9; i++)
c[i] = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
k = min(a[i] / 400, 8);
c[k]++;
}
for (i = 0; i < 8; i++) {
if (c[i] > 0)... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, i, c[9], k, ans = 0;
cin >> n;
int a[n];
for (i = 0; i < 9; i++)
c[i] = 0;
for (i = 0; i < n; i++) {
cin >> a[i];
k = min(a[i] / 400, 8);
c[k]++;
}
for (i = 0; i < 8; i++) {
if (c[i] > 0)... | [
"call.remove",
"call.arguments.change"
] | 1,365,922 | 1,365,923 | u340494803 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, _4, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, n) (int i = a; i < n; i++)
#define per(i, a, n, s) (int i = n - 1; i >= a; i--)
#define range(...) _overload3(__VA_ARGS__, per, repi, _rep, )(__VA_ARGS__)
#define all(x) (... | #include <bits/stdc++.h>
using namespace std;
#define _overload3(_1, _2, _3, _4, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, n) (int i = a; i < n; i++)
#define per(i, a, n, s) (int i = n - 1; i >= a; i--)
#define range(...) _overload3(__VA_ARGS__, per, repi, _rep, )(__VA_ARGS__)
#define all(x) (... | [
"call.remove",
"call.arguments.change"
] | 1,365,924 | 1,365,925 | u716530146 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [] | 1,365,933 | 1,365,934 | u347057617 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"call.remove",
"call.arguments.change"
] | 1,365,935 | 1,365,934 | u347057617 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"call.remove",
"call.arguments.change"
] | 1,365,936 | 1,365,934 | u347057617 | cpp |
p03695 | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ull> vu;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef... | #include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define pb push_back
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ull> vu;
typedef vector<vector<int>> vvi;
typedef pair<int, int> pi;
typedef... | [
"call.remove",
"call.arguments.change"
] | 1,365,937 | 1,365,938 | u519883882 | cpp |
p03695 | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A[i] = a;
}
int count = 0, uppred = 0;
bool hai = false, tya = false, midori = false, mizu = false, ao = false,
ki = false, ora = false,... | #include <iostream>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
int A[N];
for (int i = 0; i < N; i++) {
int a;
cin >> a;
A[i] = a;
}
int count = 0, uppred = 0;
bool hai = false, tya = false, midori = false, mizu = false, ao = false,
ki = false, ora = false,... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,365,939 | 1,365,940 | u973630705 | cpp |
p03695 | // ABC064C
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
set<int> x;
int num = 0;
fo... | // ABC064C
#include <bits/stdc++.h>
#include <cfloat>
#include <climits>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <numeric>
#include <stdio.h>
#include <string>
#include <unordered_map>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
set<int> x;
int num = 0;
fo... | [
"expression.operation.binary.change",
"call.add"
] | 1,365,943 | 1,365,944 | u733391043 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int c = 399;
int n;
cin >> n;
int *a = new int[n];
int *ans = new int[9];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
int j = 0;
int tmp = c;
while (j < 8) {
if (a[i] <= tmp) {
ans[j]++;
... | #include <iostream>
using namespace std;
int main() {
int c = 399;
int n;
cin >> n;
int *a = new int[n];
int *ans = new int[9];
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
int j = 0;
int tmp = c;
while (j < 8) {
if (a[i] <= tmp) {
ans[j]++;
... | [
"identifier.change",
"io.output.change"
] | 1,365,947 | 1,365,948 | u110383054 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
using namespace std;
int N;
int Count[9], A[101];
int Ansa, Ansb;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
scanf("%d", &A[i]);
if (A[i] < 400)
Count[0]++;
else if (A[i] < 800)
Count[1]++;
else if (A[i] < 1200)
Count[2]++;
... | #include <algorithm>
#include <cstdio>
using namespace std;
int N;
int Count[9], A[101];
int Ansa, Ansb;
int main() {
scanf("%d", &N);
for (int i = 1; i <= N; i++) {
scanf("%d", &A[i]);
if (A[i] < 400)
Count[0]++;
else if (A[i] < 800)
Count[1]++;
else if (A[i] < 1200)
Count[2]++;
... | [
"call.remove",
"call.arguments.change"
] | 1,365,951 | 1,365,952 | u165698252 | 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, S, Sum = 0;
vector<int> A(9);
cin >> N;
rep(i, N) {
cin >> S;
if (S < 400)
A.at(0)++;
else if (S < 800)
A.at(1)++;
else if (S < 1200)
A.at(2)++;
else if (... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N, S, Sum = 0;
vector<int> A(9);
cin >> N;
rep(i, N) {
cin >> S;
if (S < 400)
A.at(0)++;
else if (S < 800)
A.at(1)++;
else if (S < 1200)
A.at(2)++;
else if (... | [
"call.add",
"call.arguments.change"
] | 1,365,953 | 1,365,954 | u749022615 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long ll;
typedef pair<ll, ll> P;
const ll mod = 1000000007;
const ll LINF = 1LL << 60;
co... | [
"call.add",
"call.arguments.change"
] | 1,365,957 | 1,365,958 | u471212175 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
vector<int> border = {3200, 2800, 2400, 2000, 1600, 1200, 800, 400, 1};
int N;
cin >> N;
set<int> s;
int free_color = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
for (int j = 0; j < border.size(); j++) {
if (border[j] <=... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
vector<int> border = {3200, 2800, 2400, 2000, 1600, 1200, 800, 400, 1};
int N;
cin >> N;
set<int> s;
int free_color = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
for (int j = 0; j < border.size(); j++) {
if (border[j] <=... | [
"call.remove",
"call.arguments.change"
] | 1,365,961 | 1,365,962 | u615194706 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int N, mini = 0;
cin >> N;
vector<int> A(9);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
typedef pair<int, int> Pint;
typedef pair<int64_t, int64_t> Pll;
int main() {
int N, mini = 0;
cin >> N;
vector<int> A(9);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (... | [
"call.remove",
"call.arguments.change"
] | 1,365,985 | 1,365,986 | u028572059 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int c[10] = {};
for (int i = 0; i < n; i++) {
int s;
cin >> s;
c[min(s / 400, 8)]++;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (c[i])
ans++;
}
cout << max(ans, 1) << " " << min(ans + c[8], 8) << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int c[10] = {};
for (int i = 0; i < n; i++) {
int s;
cin >> s;
c[min(s / 400, 8)]++;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (c[i])
ans++;
}
cout << max(ans, 1) << " " << ans + c[8] << endl;
}
| [
"call.remove",
"call.arguments.change"
] | 1,365,989 | 1,365,990 | u813174766 | cpp |
p03695 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
#define itn int
#define co(ans) cout << ans << endl;
#define COYE cout << "YES" << endl;
#define COYe cout << "Yes" << endl;
#define COye cout <<... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
#define itn int
#define co(ans) cout << ans << endl;
#define COYE cout << "YES" << endl;
#define COYe cout << "Yes" << endl;
#define COye cout <<... | [
"call.add",
"call.arguments.change"
] | 1,365,995 | 1,365,996 | u041282550 | cpp |
p03695 | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
in... | #include <algorithm>
#include <array>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long int ll;
in... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,365,999 | 1,366,000 | u324139341 | cpp |
p03695 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | [
"expression.operation.binary.remove"
] | 1,366,003 | 1,366,004 | u528720841 | cpp |
p03695 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | [
"literal.number.change",
"call.arguments.change"
] | 1,366,005 | 1,366,004 | u528720841 | cpp |
p03695 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | [
"call.arguments.change"
] | 1,366,006 | 1,366,004 | u528720841 | cpp |
p03695 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | [
"call.arguments.change"
] | 1,366,007 | 1,366,004 | u528720841 | cpp |
p03695 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | [
"expression.operation.binary.remove",
"identifier.change",
"control_flow.loop.for.condition.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 1,366,008 | 1,366,004 | u528720841 | cpp |
p03695 | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | #include <bits/stdc++.h>
#include <numeric>
#include <vector>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i =... | [
"call.arguments.change"
] | 1,366,003 | 1,366,009 | u528720841 | cpp |
p03695 | //#define NDEBUG
#define _CRT_SECURE_NO_WARNINGS
#include <array>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <limits>
#include <memory>
#include <string>
#include <type_traits>
template <class Integral> class Rirange;
template <class Integral = std::size_t> class irange {
public:
using value_t... | //#define NDEBUG
#define _CRT_SECURE_NO_WARNINGS
#include <array>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <limits>
#include <memory>
#include <string>
#include <type_traits>
template <class Integral> class Rirange;
template <class Integral = std::size_t> class irange {
public:
using value_t... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change"
] | 1,366,026 | 1,366,027 | u708618797 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
#define int int64
#define rep(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define SORT(x) sort(x.begin(), x.end())
#define GSORT(x) sort(x.begin(), x.end(), greater<int>())
#define mk make_pair
#define fi first... | [
"call.add",
"call.arguments.add"
] | 1,366,031 | 1,366,032 | u703503553 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
const ll MO... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
const ll MO... | [
"call.add",
"call.arguments.add"
] | 1,366,037 | 1,366,038 | u803893892 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int cnt = 0, colors[8] = {};
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a >= 3200)
cnt++;
else {
colors[a / 400] = 1;
}
}
int ans = 0;
for (int i = 0; i < 8; i++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
int cnt = 0, colors[8] = {};
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a >= 3200)
cnt++;
else {
colors[a / 400] = 1;
}
}
int ans = 0;
for (int i = 0; i < 8; i++) {
... | [
"call.remove",
"call.arguments.change"
] | 1,366,039 | 1,366,040 | u810388173 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
set<int> st;
int tmp = 0;
rep(i, n) {
... | #include <algorithm>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a[i];
set<int> st;
int tmp = 0;
rep(i, n) {
... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,366,053 | 1,366,054 | u539199630 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue> // s.front()
#include <set>
#include <stack> // s.top()
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue> // s.front()
#include <set>
#include <stack> // s.top()
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P... | [
"call.remove",
"call.arguments.change"
] | 1,366,059 | 1,366,060 | u301893320 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
int main() {
int N;
std::cin >> N;
std::vector<int> a(9);
for (int i = 0; i < N; i++) {
int x;
std::cin >> x;
int in = std::min(8, (x / 400));
a[in]++;
}
int... | #include <algorithm>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
int main() {
int N;
std::cin >> N;
std::vector<int> a(9);
for (int i = 0; i < N; i++) {
int x;
std::cin >> x;
int in = std::min(8, (x / 400));
a[in]++;
}
int... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,366,067 | 1,366,068 | u303039933 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define For(i, a, b) for (i = a; i < b; i++)
#define rep(i, N) For(i, 0, N)
#define rep1(i, N) For(i, 1, N)
#define mod 1000000007
long mmid(long a, long b, long c) {
return a < b ? (b < c ? b : max(a, c)) : (b > c ? b : min(a, c));
}
ll modinv(ll ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define For(i, a, b) for (i = a; i < b; i++)
#define rep(i, N) For(i, 0, N)
#define rep1(i, N) For(i, 1, N)
#define mod 1000000007
long mmid(long a, long b, long c) {
return a < b ? (b < c ? b : max(a, c)) : (b > c ? b : min(a, c));
}
ll modinv(ll ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,366,069 | 1,366,070 | u251847465 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define For(i, a, b) for (i = a; i < b; i++)
#define rep(i, N) For(i, 0, N)
#define rep1(i, N) For(i, 1, N)
#define mod 1000000007
long mmid(long a, long b, long c) {
return a < b ? (b < c ? b : max(a, c)) : (b > c ? b : min(a, c));
}
ll modinv(ll ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define For(i, a, b) for (i = a; i < b; i++)
#define rep(i, N) For(i, 0, N)
#define rep1(i, N) For(i, 1, N)
#define mod 1000000007
long mmid(long a, long b, long c) {
return a < b ? (b < c ? b : max(a, c)) : (b > c ? b : min(a, c));
}
ll modinv(ll ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 1,366,071 | 1,366,070 | u251847465 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define For(i, a, b) for (i = a; i < b; i++)
#define rep(i, N) For(i, 0, N)
#define rep1(i, N) For(i, 1, N)
#define mod 1000000007
long mmid(long a, long b, long c) {
return a < b ? (b < c ? b : max(a, c)) : (b > c ? b : min(a, c));
}
ll modinv(ll ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define For(i, a, b) for (i = a; i < b; i++)
#define rep(i, N) For(i, 0, N)
#define rep1(i, N) For(i, 1, N)
#define mod 1000000007
long mmid(long a, long b, long c) {
return a < b ? (b < c ? b : max(a, c)) : (b > c ? b : min(a, c));
}
ll modinv(ll ... | [
"call.arguments.add",
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 1,366,072 | 1,366,070 | u251847465 | cpp |
p03695 | #include <iostream>
#include <map>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
map<int, int> ma;
for (int i = 0; i < N; i++) {
cin >> a[i];
for (int j = 1; j <= 8; j++) {
if (a[i] < 400 * j && a[i] >= 400 * (j - 1)) {
ma[j]++;
}
}
if (a[i] >= 3200)
m... | #include <iostream>
#include <map>
using namespace std;
int main() {
int N;
cin >> N;
int a[N];
map<int, int> ma;
for (int i = 0; i < N; i++) {
cin >> a[i];
for (int j = 1; j <= 8; j++) {
if (a[i] < 400 * j && a[i] >= 400 * (j - 1)) {
ma[j]++;
}
}
if (a[i] >= 3200)
m... | [
"call.add",
"call.arguments.add"
] | 1,366,073 | 1,366,074 | u660341491 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define mem(x, val) memset((x), (val), sizeof(x))
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define PI acos(-1.0)
#define N 111111
const int INF = 1 << 30;
typedef long long ll;
type... | #include <bits/stdc++.h>
using namespace std;
#define DEBUG(x) cout << '>' << #x << ':' << x << endl;
#define mem(x, val) memset((x), (val), sizeof(x))
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define PI acos(-1.0)
#define N 111111
const int INF = 1 << 30;
typedef long long ll;
type... | [
"call.add",
"call.arguments.add"
] | 1,366,075 | 1,366,076 | u317489134 | cpp |
p03695 | #include <iostream>
using namespace std;
int i, n, m, a, c[20];
int main() {
for (cin >> n; i++ < n; cin >> a, c[a / 400]++)
;
for (i = 0; i < 8; i++)
m += c[i] > 0;
cout << m << " " << m + c[8] + c[9] + c[10] + c[11] + c[12];
} | #include <iostream>
using namespace std;
int i, n, m, a, c[20];
int main() {
for (cin >> n; i++ < n; cin >> a, c[a / 400]++)
;
for (i = 0; i < 8; i++)
m += c[i] > 0;
cout << (m ? m : 1) << " " << m + c[8] + c[9] + c[10] + c[11] + c[12];
} | [] | 1,366,086 | 1,366,087 | u601082779 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define REPS(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; ++i)
#define ALL(obj) (obj).begin(), (obj).end()
typedef unsigned int uint;
typedef unsigned long long int ull;
typedef long long int l... | [] | 1,366,105 | 1,366,106 | u090325904 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt;
cin >> n;
vector<int> a(n), rate(9, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = min(a[i], 3200);
rate[a[i] / 400]++;
}
for (int i = 0; i < 8; i++) {
if (rate[i] > 0) {
c... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
vector<int> a(n), rate(9, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = min(a[i], 3200);
rate[a[i] / 400]++;
}
for (int i = 0; i < 8; i++) {
if (rate[i] > 0) {
... | [
"variable_declaration.value.change"
] | 1,366,107 | 1,366,108 | u172258329 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> arr(8);
int r8 = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
int r = a / 400;
if (r >= 8)
r8++;
else
arr[r]++;
}
int mn = 0... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> arr(8);
int r8 = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
int r = a / 400;
if (r >= 8)
r8++;
else
arr[r]++;
}
int mn = 0... | [
"call.remove",
"call.arguments.change"
] | 1,366,127 | 1,366,128 | u508729896 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#de... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define ub upper_bound
#define lb upper_bound
#define mp make_pair
#define F first
#define S second
#define FOR(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#de... | [
"call.remove",
"call.arguments.change"
] | 1,366,133 | 1,366,134 | u764234894 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); i++)
using namespace std;
typedef long long ll;
int idx(int x) {
if (x <= 399)
return 0;
if (x <= 799)
return 1;
if (x <= 1199)
return 2;
if (x <= 1599)
return 3;
if (x <= 1999)
return 4;
if (x <= 2399)
return 5... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); i++)
using namespace std;
typedef long long ll;
int idx(int x) {
if (x <= 399)
return 0;
if (x <= 799)
return 1;
if (x <= 1199)
return 2;
if (x <= 1599)
return 3;
if (x <= 1999)
return 4;
if (x <= 2399)
return 5... | [
"call.remove",
"call.arguments.change"
] | 1,366,137 | 1,366,138 | u755830696 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
int a[n], b[9] = {};
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 8; j++) {
if (400 * (j) <= a[i] && a[i] < 400 * (j + 1))
b[j]++;
}
if (3200 <= a[i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, cnt = 0;
cin >> n;
int a[n], b[9] = {};
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
for (int j = 0; j < 8; j++) {
if (400 * (j) <= a[i] && a[i] < 400 * (j + 1))
b[j]++;
}
if (3200 <= a[i... | [] | 1,366,139 | 1,366,140 | u298768617 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), c(9, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = min(a[i], 3200);
c[a[i] / 400]++;
}
int count = 0;
for (int i = 0; i < 8; i++) {
if (c[i] > 0)
count++;
}
cout << count << ' '... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n), c(9, 0);
for (int i = 0; i < n; i++) {
cin >> a[i];
a[i] = min(a[i], 3200);
c[a[i] / 400]++;
}
int count = 0;
for (int i = 0; i < 8; i++) {
if (c[i] > 0)
count++;
}
cout << max(count, 1... | [
"call.add",
"call.arguments.add"
] | 1,366,141 | 1,366,142 | u525974535 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
/*--- Macro ---*/
#define rep(i, n) for (int i = 0; i < (int)n... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using namespace std;
/*--- Macro ---*/
#define rep(i, n) for (int i = 0; i < (int)n... | [
"call.remove",
"call.arguments.change"
] | 1,366,151 | 1,366,152 | u704630096 | cpp |
p03695 | #include <algorithm>
#include <bits/stdc++.h>
#include <deque>
#include <numeric>
#include <utility>
#include <vector>
using namespace std;
void solve(long long N, std::vector<long long> A) {
set<long long> colors;
int ns = 0;
for (auto a : A) {
if (a / 400 < 8)
colors.insert(a / 400);
else
ns... | #include <algorithm>
#include <bits/stdc++.h>
#include <deque>
#include <numeric>
#include <utility>
#include <vector>
using namespace std;
void solve(long long N, std::vector<long long> A) {
set<long long> colors;
int ns = 0;
for (auto a : A) {
if (a / 400 < 8)
colors.insert(a / 400);
else
ns... | [
"call.remove",
"call.arguments.change"
] | 1,366,159 | 1,366,160 | u414425367 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long int llint;
typedef long long ll;
typedef long int lint;
typedef vector<char> vchar;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typedef vector<vector<int>> vvint;
typedef vector<vector<char>> vvchar;
#de... | #include <bits/stdc++.h>
using namespace std;
typedef long long int llint;
typedef long long ll;
typedef long int lint;
typedef vector<char> vchar;
typedef vector<int> vint;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
typedef vector<vector<int>> vvint;
typedef vector<vector<char>> vvchar;
#de... | [
"call.add",
"call.arguments.add"
] | 1,366,163 | 1,366,164 | u557138271 | cpp |
p03695 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"literal.number.change",
"call.arguments.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,366,170 | 1,366,171 | u633284019 | cpp |
p03695 | #include <bits/stdc++.h>
#define usecppio \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int color[9]... | #include <bits/stdc++.h>
#define usecppio \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
int color[9]... | [
"call.add",
"call.arguments.change"
] | 1,366,176 | 1,366,177 | u136930834 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> b(a);
for (int i = 0; i < a; i++)
cin >> b[i];
int a1 = 0, a2 = 0, a3 = 0, a4 = 0, a5 = 0, a6 = 0, a7 = 0, a8 = 0, all = 0;
for (int i = 0; i < a; i++) {
if (b[i] < 400)
a1 = 1;
else if (b[i] < 800)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> b(a);
for (int i = 0; i < a; i++)
cin >> b[i];
int a1 = 0, a2 = 0, a3 = 0, a4 = 0, a5 = 0, a6 = 0, a7 = 0, a8 = 0, all = 0;
for (int i = 0; i < a; i++) {
if (b[i] < 400)
a1 = 1;
else if (b[i] < 800)
... | [
"call.remove",
"call.arguments.change"
] | 1,366,183 | 1,366,184 | u191594139 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define F first
#define S second
int main() {
int n;
int a, ans = 0;
int free = 0;
int color[8] = {};
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if (a >= 3200)
free++;
els... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define F first
#define S second
int main() {
int n;
int a, ans = 0;
int free = 0;
int color[8] = {};
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &a);
if (a >= 3200)
free++;
els... | [
"call.remove",
"call.arguments.change"
] | 1,366,185 | 1,366,186 | u604928622 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n, min_val = 0, color[8], free_num = 0;
scanf("%d", &n);
fill(color, color + 8, 0);
for (int i = 0; i < n; i++) {
int a;
scanf... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int main() {
int n, min_val = 0, color[8], free_num = 0;
scanf("%d", &n);
fill(color, color + 8, 0);
for (int i = 0; i < n; i++) {
int a;
scanf... | [
"call.add",
"call.arguments.change"
] | 1,366,187 | 1,366,188 | u604928622 | cpp |
p03695 | //------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<s... | //------------------------------------------
// C++ templete
//------------------------------------------
#include <bits/stdc++.h>
using namespace std;
#define endl "\n"
// typedef
//------------------------------------------
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<s... | [
"call.remove",
"call.arguments.change"
] | 1,366,192 | 1,366,193 | u850266651 | cpp |
p03695 | #pragma region declaration
#include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <numeric>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
constexpr double INF{1e9};
constexpr int MOD{1000000000 + 7};
#define rep(i, n) for (int i = 0; i < n; ++i)
constexpr array... | #pragma region declaration
#include <algorithm>
#include <array>
#include <deque>
#include <iostream>
#include <numeric>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
constexpr double INF{1e9};
constexpr int MOD{1000000000 + 7};
#define rep(i, n) for (int i = 0; i < n; ++i)
constexpr array... | [
"call.add",
"call.arguments.add"
] | 1,366,197 | 1,366,198 | u076506345 | 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 bit = 0, cnt = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 400) {
bit |= (1 << 0);
} else if (a[i] < 800) {
bit |= (1 << 1);
} else if (a[i] < 1200) {
... | #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 bit = 0, cnt = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 400) {
bit |= (1 << 0);
} else if (a[i] < 800) {
bit |= (1 << 1);
} else if (a[i] < 1200) {
... | [
"call.remove",
"call.arguments.change"
] | 1,366,205 | 1,366,206 | u547844563 | 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 bit = 0, cnt = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 400) {
bit |= (1 << 0);
} else if (a[i] < 800) {
bit |= (1 << 1);
} else if (a[i] < 1200) {
... | #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 bit = 0, cnt = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 400) {
bit |= (1 << 0);
} else if (a[i] < 800) {
bit |= (1 << 1);
} else if (a[i] < 1200) {
... | [
"call.remove",
"call.arguments.change"
] | 1,366,207 | 1,366,206 | u547844563 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
bool color[8];
int free = 0;
for (int i = 0; i < 8; i++)
color[i] = false;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
bool color[8];
int free = 0;
for (int i = 0; i < 8; i++)
color[i] = false;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
... | [
"call.remove",
"call.arguments.change"
] | 1,366,218 | 1,366,219 | u797165415 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int colors[8] = {};
int other = 0;
int a;
int cnt = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 3200) {
colors[a / 400] = 1;
} else {
other++;
}
}
for (int i = 0; i < 8; i++) {
cnt +=... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int colors[8] = {};
int other = 0;
int a;
int cnt = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 3200) {
colors[a / 400] = 1;
} else {
other++;
}
}
for (int i = 0; i < 8; i++) {
cnt +=... | [
"call.remove",
"call.arguments.change"
] | 1,366,220 | 1,366,221 | u193598069 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, i, c = 0, co = 0;
int color[8] = {};
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
if (a < 3200) {
color[a / 400] = 1;
} else {
co++;
}
}
for (i = 0; i < 8; i++) {
c += color[i];
}
cout << max(1, c) << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, i, c = 0, co = 0;
int color[8] = {};
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
if (a < 3200) {
color[a / 400] = 1;
} else {
co++;
}
}
for (i = 0; i < 8; i++) {
c += color[i];
}
cout << max(1, c) << ... | [
"call.remove",
"call.arguments.change"
] | 1,366,223 | 1,366,224 | u058348416 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, i, c = 0, co = 0;
int color[8] = {};
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
if (a < 3200) {
color[a / 400] = 1;
} else {
co++;
}
}
for (i = 0; i < 8; i++) {
c += color[i];
}
cout << max(1, c) << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, i, c = 0, co = 0;
int color[8] = {};
cin >> n;
for (i = 0; i < n; i++) {
cin >> a;
if (a < 3200) {
color[a / 400] = 1;
} else {
co++;
}
}
for (i = 0; i < 8; i++) {
c += color[i];
}
cout << max(1, c) << ... | [
"call.arguments.change"
] | 1,366,225 | 1,366,224 | u058348416 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
set<int> st;
int f = 0;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
if (t <= 399)
st.insert(0);... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(int argc, char *argv[]) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
set<int> st;
int f = 0;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
if (t <= 399)
st.insert(0);... | [
"call.remove",
"call.arguments.change"
] | 1,366,233 | 1,366,234 | u440032761 | cpp |
p03695 | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define EPS (1e-7)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(9, 0);
int tempa, ans = 0, mina;
for (size_t i = 0; i < N; i++) {
cin >> t... | #include <algorithm>
#include <array>
#include <cmath>
#include <iostream>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define EPS (1e-7)
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(9, 0);
int tempa, ans = 0, mina;
for (size_t i = 0; i < N; i++) {
cin >> t... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,366,241 | 1,366,242 | u791411211 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int ... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#define cinf(n, x) \
for (int i = 0; i < (n); i++) \
cin >> x[i];
typedef long long int ll;
using namespace std;
int main() {
int ... | [
"call.add",
"call.arguments.change"
] | 1,366,248 | 1,366,249 | u928536113 | cpp |
p03695 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, rank[8] = {0, 0, 0, 0, 0, 0, 0, 0};
cin >> N;
int count = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
for (int j = 0; j < 8; j++) {
if (400 * j <= a && a < 400 * (j + 1))
rank[j] = 1;
}
if ... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, rank[8] = {0, 0, 0, 0, 0, 0, 0, 0};
cin >> N;
int count = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
for (int j = 0; j < 8; j++) {
if (400 * j <= a && a < 400 * (j + 1))
rank[j] = 1;
}
if ... | [
"call.add",
"call.arguments.change"
] | 1,366,250 | 1,366,251 | u203033720 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.