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 | #pragma region template
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace bmp = boost::multiprecision;
// using Lint = bmp::cpp_int;
// using Real = bmp::number<bmp::cpp_dec_float<1024>>;
#define all(a) (a).... | #pragma region template
#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace bmp = boost::multiprecision;
// using Lint = bmp::cpp_int;
// using Real = bmp::number<bmp::cpp_dec_float<1024>>;
#define all(a) (a).... | [
"io.output.change"
] | 1,364,807 | 1,364,808 | u368735320 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -21474... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
long long MOD = 1000000007LL;
const double PI = 3.14159265358979323846;
#undef INT_MIN
#undef INT_MAX
#define INT_MIN -21474... | [
"call.add",
"call.arguments.change"
] | 1,364,814 | 1,364,815 | u055685044 | cpp |
p03695 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, color = 0, cool = 0, num;
cin >> n;
vector<int> seen(8);
for (int i = 0; i < n; i++) {
cin >> num;
if (num < 3200) {
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, color = 0, cool = 0, num;
cin >> n;
vector<int> seen(8);
for (int i = 0; i < n; i++) {
cin >> num;
if (num < 3200) {
... | [
"call.add",
"call.arguments.add"
] | 1,364,816 | 1,364,817 | u448598378 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
// const int mod = 998244353;
const int INF = 1001001001;
const int di[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dj[] = {0, -1, 0, 1, -1, 1, -1, 1}... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
// const int mod = 998244353;
const int INF = 1001001001;
const int di[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dj[] = {0, -1, 0, 1, -1, 1, -1, 1}... | [
"call.remove",
"call.arguments.change"
] | 1,364,826 | 1,364,827 | u602267597 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
// const int mod = 998244353;
const int INF = 1001001001;
const int di[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dj[] = {0, -1, 0, 1, -1, 1, -1, 1}... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
// const int mod = 998244353;
const int INF = 1001001001;
const int di[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dj[] = {0, -1, 0, 1, -1, 1, -1, 1}... | [
"call.remove",
"call.arguments.change"
] | 1,364,828 | 1,364,827 | u602267597 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int c[9];
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
int num = min(a / 400, 8);
c[num]++;
}
int ans = 0;
for (int i = 0; i < 8; i++)
if (c[i] > 0)
ans++;
... | #include <bits/stdc++.h>
using namespace std;
int c[9];
int main() {
cin.tie(0);
ios::sync_with_stdio(0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
int num = min(a / 400, 8);
c[num]++;
}
int ans = 0;
for (int i = 0; i < 8; i++)
if (c[i] > 0)
ans++;
... | [
"call.add",
"call.arguments.add"
] | 1,364,829 | 1,364,830 | u288035794 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int isColor(int rate) {
if (rate <= 399)
return 0;
else if (rate <= 799)
return 1;
else if (rate <= 1199)
return 2;
else if (rate <= 1599)
return 3;
else if (rate <= 1999)
retu... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
#include <vector>
using namespace std;
int isColor(int rate) {
if (rate <= 399)
return 0;
else if (rate <= 799)
return 1;
else if (rate <= 1199)
return 2;
else if (rate <= 1599)
return 3;
else if (rate <= 1999)
retu... | [
"call.remove",
"call.arguments.change"
] | 1,364,839 | 1,364,840 | u684448032 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
vector<int> rate(9);
rep(i, n) {
int s = a.at(i) / 400;
rate.at(s)++;
}
int f... | #include <bits/stdc++.h>
using namespace std;
#include <cstdlib>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
vector<int> rate(9);
rep(i, n) {
int s = min(a.at(i) / 400, 8);
rate.at(s)++;
}
... | [
"call.add",
"call.arguments.add"
] | 1,364,847 | 1,364,848 | u748819456 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] >= 3200)
a[i] = 3200;
mp[(a[i] / 400)]++;
}
int ans = 0;
for (int i = 0; i < 8; i++)
ans += (mp[i] > 0);
cout << ans << " " ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] > 3200)
a[i] = 3200;
mp[(a[i] / 400)]++;
}
int ans = 0;
for (int i = 0; i < 8; i++)
ans += (mp[i] > 0);
cout << max(ans, 1) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.add"
] | 1,364,849 | 1,364,850 | u983681697 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int m, oth = 0;
vector<int> iro(8, 0);
for (int i = 0; i < n; i++) {
cin >> m;
if (m < 3200) {
iro.at(m / 400)++;
} else {
oth++;
}
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (iro.at(i) > 0)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int m, oth = 0;
vector<int> iro(8, 0);
for (int i = 0; i < n; i++) {
cin >> m;
if (m < 3200) {
iro.at(m / 400)++;
} else {
oth++;
}
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (iro.at(i) > 0)... | [
"call.remove",
"call.arguments.change"
] | 1,364,853 | 1,364,854 | u380491044 | cpp |
p03695 | // Template Headers {{{
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vll = vector<long long>;
using vvll = vector<vll>;
template <class ... | // Template Headers {{{
#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
using vvi = vector<vi>;
using ll = long long;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using vll = vector<long long>;
using vvll = vector<vll>;
template <class ... | [
"call.remove",
"call.arguments.change"
] | 1,364,866 | 1,364,867 | u357289011 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
int tuyoi = 0;
vector<int> C(8);
rep(i, N) {
int a;
cin >> a;
int x = a / 400;
if (x < 8) {
C[x]++;
} else {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N;
cin >> N;
int tuyoi = 0;
vector<int> C(8);
rep(i, N) {
int a;
cin >> a;
int x = a / 400;
if (x < 8) {
C[x]++;
} else {
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,364,868 | 1,364,869 | u859566721 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> color(8);
int over = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200)
over++;
else
color.at(a / 400) = 1;
}
int tot = 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;
vector<int> color(8);
int over = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200)
over++;
else
color.at(a / 400) = 1;
}
int tot = 0;
for (int i = 0; i < 8; i++) ... | [
"call.remove",
"call.arguments.change"
] | 1,364,870 | 1,364,871 | u536916602 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::vector<long long> a) {
vector<int> score(9, 0);
int kami_cnt = 0;
for (auto i : a) {
if (i < 400)
score[0] = 1;
else if (i >= 400 && i < 800)
score[1] = 1;
else if (i >= 800 && i < 1200)
score[2] = 1;
els... | #include <bits/stdc++.h>
using namespace std;
void solve(long long N, std::vector<long long> a) {
vector<int> score(9, 0);
int kami_cnt = 0;
for (auto i : a) {
if (i < 400)
score[0] = 1;
else if (i >= 400 && i < 800)
score[1] = 1;
else if (i >= 800 && i < 1200)
score[2] = 1;
els... | [
"call.remove",
"call.arguments.change"
] | 1,364,872 | 1,364,873 | u972398652 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
int n, kind = 0, allman = 0;
bool all =... | #include <bits/stdc++.h>
#define rep3(i, s, n, a) for (int i = (s); i < (int)(n); i += a)
#define rep2(i, s, n) rep3(i, s, n, 1)
#define rep(i, n) rep2(i, 0, n)
using namespace std;
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
int main() {
int n, kind = 0, allman = 0;
bool all =... | [
"call.remove",
"call.arguments.change"
] | 1,364,876 | 1,364,877 | u398221039 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
set<int> s;
int num = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i) >= 3200) {
num++;
} else {
int div;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
set<int> s;
int num = 0;
for (int i = 0; i < N; i++) {
if (vec.at(i) >= 3200) {
num++;
} else {
int div;
... | [
"call.remove",
"call.arguments.change"
] | 1,364,880 | 1,364,881 | u199783079 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for (int i = a; i < b; i++)
#define all(x) (x).begin(), (x).end() // 昇順ソート
#define rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define FastIO ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
ty... | [
"call.remove",
"call.arguments.change"
] | 1,364,886 | 1,364,887 | u084949493 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,364,892 | 1,364,893 | u876953939 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
... | [
"call.add",
"call.arguments.add"
] | 1,364,894 | 1,364,893 | u876953939 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int L = 0;
int H = 0;
cin >> N;
vector<int> A(8);
for (int X = 0; X < N; X++) {
int S;
cin >> S;
if (S < 3200 && A[S / 400] == 0)
A[S / 400] = 1;
if (S > 3199)
L++;
}
cout << max(1, A[0] + A[1] + A[2] + A[3] + ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
int L = 0;
int H = 0;
cin >> N;
vector<int> A(8);
for (int X = 0; X < N; X++) {
int S;
cin >> S;
if (S < 3200 && A[S / 400] == 0)
A[S / 400] = 1;
if (S > 3199)
L++;
}
cout << max(1, A[0] + A[1] + A[2] + A[3] + ... | [
"call.remove",
"call.arguments.change"
] | 1,364,895 | 1,364,896 | u740002394 | cpp |
p03695 | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ll long long
#define all(a) a.begin(), a.end()
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> mp;
int free = 0;
rep(i, n) {
int a;
cin >> a;
if (a >= 3200)
++free;
else
... | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ll long long
#define all(a) a.begin(), a.end()
using namespace std;
int main() {
int n;
cin >> n;
map<int, int> mp;
int free = 0;
rep(i, n) {
int a;
cin >> a;
if (a >= 3200)
++free;
else
... | [
"call.remove",
"call.arguments.change"
] | 1,364,897 | 1,364,898 | u912766486 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<bool> color(8, false);
int rate, cnt = 0;
for (int i = 0; i < N; i++) {
cin >> rate;
if (rate < 400)
color[0] = true;
else if (rate < 800... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int N;
cin >> N;
vector<bool> color(8, false);
int rate, cnt = 0;
for (int i = 0; i < N; i++) {
cin >> rate;
if (rate < 400)
color[0] = true;
else if (rate < 800... | [
"call.remove",
"call.arguments.change"
] | 1,364,905 | 1,364,906 | u534661831 | cpp |
p03695 | #include <bits/stdc++.h>
#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(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const double PI = acos(-1);
static const int INF... | #include <bits/stdc++.h>
#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(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
using namespace std;
using ll = long long;
using P = pair<int, int>;
static const double PI = acos(-1);
static const int INF... | [
"call.remove",
"call.arguments.change"
] | 1,364,909 | 1,364,910 | u849151695 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<db, db> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<db, db> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<db> vd;
typedef vector<str> vs;
typedef vector... | [] | 1,364,917 | 1,364,918 | u448439063 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> flag(8, 0);
int N;
int master = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 400)
flag.at(0) = 1;
else if (a < 800)
flag.at(1) = 1;
else if (a < 1200)
flag.at(2) = 1;
else i... | #include <bits/stdc++.h>
using namespace std;
int main() {
vector<int> flag(8, 0);
int N;
int master = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 400)
flag.at(0) = 1;
else if (a < 800)
flag.at(1) = 1;
else if (a < 1200)
flag.at(2) = 1;
else i... | [
"call.add",
"call.arguments.change"
] | 1,364,919 | 1,364,920 | u548601871 | cpp |
p03695 | /*#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
*/
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>... | /*#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
*/
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>... | [
"call.remove",
"call.arguments.change"
] | 1,364,953 | 1,364,954 | u901282405 | cpp |
p03695 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define ull unsigned long long
#define make(type, x) \
type x; ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <math.h>
#include <numeric>
#include <string>
#include <utility>
#include <vector>
#define ll long long
#define ull unsigned long long
#define make(type, x) \
type x; ... | [
"control_flow.branch.if.condition.change"
] | 1,364,955 | 1,364,956 | u695019278 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(9);
for (int i = 0, a; i < N && cin >> a; i++) {
if (a < 400)
A.at(0)++;
if (400 <= a && a < 800)
A.at(1)++;
if (800 <= a && a < 1200)
A.at(2)++;
if (1200 <= a && a < 1600)
A.at(3)+... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> A(9);
for (int i = 0, a; i < N && cin >> a; i++) {
if (a < 400)
A.at(0)++;
if (400 <= a && a < 800)
A.at(1)++;
if (800 <= a && a < 1200)
A.at(2)++;
if (1200 <= a && a < 1600)
A.at(3)+... | [
"expression.operation.binary.add"
] | 1,364,964 | 1,364,965 | u045289115 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | [
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change"
] | 1,364,970 | 1,364,971 | u947236878 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | #include <algorithm>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#inc... | [
"literal.number.change",
"assignment.value.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.add"
] | 1,364,972 | 1,364,971 | u947236878 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<vector<int>> Graph;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
#define pi 3.14159265359
#define inf 2147483647
#define INF 9223372036854775807
#define mod 1000000007
#define mod2 998244353
... | [
"literal.number.change",
"io.output.change"
] | 1,364,993 | 1,364,994 | u160347785 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
vector<int> va(n);
for (int i = 0; i < n; ++i) {
cin >> va[i];
}
vector<int> cnts(8, 0);
int other = 0;
for (int i = 0; i < n; ++i) {
int a = va[i];
if (a < 400) {
cnts[0]++;
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
vector<int> va(n);
for (int i = 0; i < n; ++i) {
cin >> va[i];
}
vector<int> cnts(8, 0);
int other = 0;
for (int i = 0; i < n; ++i) {
int a = va[i];
if (a < 400) {
cnts[0]++;
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,365,002 | 1,365,003 | u289545075 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
vector<int> va(n);
for (int i = 0; i < n; ++i) {
cin >> va[i];
}
vector<int> cnts(8, 0);
int other = 0;
for (int i = 0; i < n; ++i) {
int a = va[i];
if (a < 400) {
cnts[0]++;
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, const char *argv[]) {
int n;
cin >> n;
vector<int> va(n);
for (int i = 0; i < n; ++i) {
cin >> va[i];
}
vector<int> cnts(8, 0);
int other = 0;
for (int i = 0; i < n; ++i) {
int a = va[i];
if (a < 400) {
cnts[0]++;
... | [
"call.add",
"call.arguments.change"
] | 1,365,004 | 1,365,003 | u289545075 | cpp |
p03695 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define pll pair<ll, ll>
#define pq priority_queue
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define ios ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#d... | [
"call.remove",
"call.arguments.change"
] | 1,365,025 | 1,365,026 | u882039496 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans, free, ai;
ans = 0;
free = 0;
scanf("%d", &n);
vector<int> color(8);
for (int i = 0; i < n; i++) {
scanf("%d", &ai);
for (int j = 0; j < 8; j++) {
if (400 * j <= ai && ai < 400 * (j + 1)) {
color.at(j) = 1;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans, free, ai;
ans = 0;
free = 0;
scanf("%d", &n);
vector<int> color(8);
for (int i = 0; i < n; i++) {
scanf("%d", &ai);
for (int j = 0; j < 8; j++) {
if (400 * j <= ai && ai < 400 * (j + 1)) {
color.at(j) = 1;
}
... | [
"call.remove",
"call.arguments.change"
] | 1,365,035 | 1,365,036 | u392029857 | cpp |
p03695 | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int N;
int table[8];
int main() {
for (int i = 0; i < 8; i++) {
table[i] = 0;
}
int tm... | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
int N;
int table[8];
int main() {
for (int i = 0; i < 8; i++) {
table[i] = 0;
}
int tm... | [
"call.add",
"call.arguments.change"
] | 1,365,039 | 1,365,040 | u000022466 | cpp |
p03695 | // Standard Stuff
#include <bits/stdc++.h>
using namespace std;
// Macros
#define F first
#define S second
#define PB push_back
// Rename Datatypes
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
// Common Functions
ll fastpow(ll a, ll ex) {
ll res = 1;
while (ex) {
if (ex & 1)
... | // Standard Stuff
#include <bits/stdc++.h>
using namespace std;
// Macros
#define F first
#define S second
#define PB push_back
// Rename Datatypes
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
// Common Functions
ll fastpow(ll a, ll ex) {
ll res = 1;
while (ex) {
if (ex & 1)
... | [
"call.remove",
"call.arguments.change"
] | 1,365,041 | 1,365,042 | u339347910 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
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 free = 0;
for (int i = 0; i < n; i++) {
if (a[i] < 400)
color[0]++;
else if (a[i] < 800)
color... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
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 free = 0;
for (int i = 0; i < n; i++) {
if (a[i] < 400)
color[0]++;
else if (a[i] < 800)
color... | [
"call.add",
"call.arguments.add"
] | 1,365,045 | 1,365,046 | u619273584 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) <... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (ll)(n); ++i)
#define rep2(i, s, n) for (ll i = s; i < (ll)(n); i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define fi first
#define sc second
#define pb push_back
#define COUT(x) cout << (x) << "\n"
#define COUTF(x) cout << setprecision(15) << (x) <... | [
"call.remove",
"call.arguments.change"
] | 1,365,055 | 1,365,056 | u297738015 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main() {
vector<bool> classes(8, false);... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using LLONG = long long;
const LLONG MOD = 1000000007;
int main() {
vector<bool> classes(8, false);... | [
"call.remove",
"call.arguments.change"
] | 1,365,057 | 1,365,058 | u214685595 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vv... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
using vi = vector<int>; // intの1次元の型に vi という別名をつける
using vvi = vector<vi>; // intの2次元の型に vv... | [
"call.remove",
"call.arguments.change"
] | 1,365,063 | 1,365,064 | u081293028 | cpp |
p03695 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi =... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi =... | [
"call.add",
"call.arguments.change"
] | 1,365,070 | 1,365,071 | u802434195 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> col(9, 0);
int nh = 0;
vector<int> nos(n, 0);
for (int i = 0; i < n; i++)
cin >> nos[i];
for (int i = 0; i < n; i++) {
if (nos[i] >= 3200) {
nh++;
continue;
}
for (int j = 1; j <= 8; j++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> col(9, 0);
int nh = 0;
vector<int> nos(n, 0);
for (int i = 0; i < n; i++)
cin >> nos[i];
for (int i = 0; i < n; i++) {
if (nos[i] >= 3200) {
nh++;
continue;
}
for (int j = 1; j <= 8; j++)
... | [
"assignment.change"
] | 1,365,072 | 1,365,073 | u004676431 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> col(9, 0);
int nh = 0;
vector<int> nos(n, 0);
for (int i = 0; i < n; i++)
cin >> nos[i];
for (int i = 0; i < n; i++) {
if (nos[i] >= 3200) {
nh++;
continue;
}
for (int j = 1; j <= 8; j++)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> col(9, 0);
int nh = 0;
vector<int> nos(n, 0);
for (int i = 0; i < n; i++)
cin >> nos[i];
for (int i = 0; i < n; i++) {
if (nos[i] >= 3200) {
nh++;
continue;
}
for (int j = 1; j <= 8; j++)
... | [
"call.remove",
"call.arguments.change"
] | 1,365,074 | 1,365,073 | u004676431 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define sws \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long ... | #include <bits/stdc++.h>
using namespace std;
#define sws \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long ... | [
"literal.string.change"
] | 1,365,080 | 1,365,081 | u202699008 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
constexpr long long MOD = 1000000007;
constexpr long long INF = 1LL << 60;
const long double PI = acosl(-1.0);
constexpr long double EPS = 1e-11;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return ... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,365,090 | 1,365,091 | u371051907 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], reg[9] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 400)
reg[0] = 1;
else if (a[i] < 800)
reg[1] = 1;
else if (a[i] < 1200)
reg[2] = 1;
else if (a[i] < 1600)
reg[3] ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], reg[9] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 400)
reg[0] = 1;
else if (a[i] < 800)
reg[1] = 1;
else if (a[i] < 1200)
reg[2] = 1;
else if (a[i] < 1600)
reg[3] ... | [
"call.remove",
"call.arguments.change"
] | 1,365,092 | 1,365,093 | u603958124 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0, anyColor = 0;
vector<bool> vec(8, false);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
int tmp = a / 400;
if (tmp < 8)
vec[tmp] = true;
else
anyColor++;
}
for (bool flag : ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int count = 0, anyColor = 0;
vector<bool> vec(8, false);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
int tmp = a / 400;
if (tmp < 8)
vec[tmp] = true;
else
anyColor++;
}
for (bool flag : ... | [
"call.add",
"call.arguments.add"
] | 1,365,094 | 1,365,095 | u735528230 | cpp |
p03695 | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int x[8];
int main() {
int n;
cin >> n;
int tourist = 0;
rep(i, n) {
int a;
cin >> a;
if (... | #include <bits/stdc++.h>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
using P = pair<ll, ll>;
int x[8];
int main() {
int n;
cin >> n;
int tourist = 0;
rep(i, n) {
int a;
cin >> a;
if (... | [
"call.remove",
"call.arguments.change"
] | 1,365,100 | 1,365,101 | u547099897 | cpp |
p03695 | #include <bits/stdc++.h>
#include <cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007 // //100000000 998244353 //
#define inf 1000000000000000000
#define ll long long
//#define M_PI 3.141592653589793238463
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define ... | #include <bits/stdc++.h>
#include <cmath>
#define N 100005
#define A 1000005
#define MOD 1000000007 // //100000000 998244353 //
#define inf 1000000000000000000
#define ll long long
//#define M_PI 3.141592653589793238463
using namespace std;
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define ft first
#define ... | [
"call.add",
"call.arguments.add"
] | 1,365,104 | 1,365,105 | u448570453 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <string>
... | [
"call.remove",
"call.arguments.change"
] | 1,365,110 | 1,365,111 | u275797573 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UI... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <numeric>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_set>
#include <vector>
using namespace std;
using INT = long long;
using UI... | [
"call.remove",
"call.arguments.change"
] | 1,365,112 | 1,365,113 | u275797573 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<bool> flg(8, false);
int a... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++i)
int main() {
int n;
cin >> n;
vector<bool> flg(8, false);
int a... | [
"call.remove",
"call.arguments.change"
] | 1,365,119 | 1,365,120 | u596311864 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int N;
cin >> N;
ma... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int N;
cin >> N;
ma... | [
"call.remove",
"call.arguments.change"
] | 1,365,121 | 1,365,122 | u893239355 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int N;
cin >> N;
ma... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
int main() {
int N;
cin >> N;
ma... | [
"literal.number.change",
"call.arguments.change",
"call.remove"
] | 1,365,123 | 1,365,122 | u893239355 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
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 = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
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 = ... | [
"call.remove",
"call.arguments.change"
] | 1,365,124 | 1,365,125 | u740054550 | cpp |
p03695 | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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) {
... | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
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) {
... | [
"call.add",
"call.arguments.change"
] | 1,365,128 | 1,365,129 | u415325136 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<bool> col(8, false);
int cnt = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 400)
col[0] = true;
else if (400 <= a && a < 800)
col[1] = true;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<bool> col(8, false);
int cnt = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 400)
col[0] = true;
else if (400 <= a && a < 800)
col[1] = true;
... | [
"call.remove",
"call.arguments.change"
] | 1,365,130 | 1,365,131 | u415325136 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(9);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.at(min(x / 400, 8))++;
}
int p = 0, q = a.at(8);
for (int i = 0; i < 8; i++) {
p += (a.at(i) > 0);
}
cout << p << " " << p + q << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(9);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
a.at(min(x / 400, 8))++;
}
int p = 0, q = a.at(8);
for (int i = 0; i < 8; i++) {
p += (a.at(i) > 0);
}
cout << max(p, 1) << " " << p + q << end... | [
"call.add",
"call.arguments.add"
] | 1,365,132 | 1,365,133 | u247123590 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
set<int> A;
int k = 0;
for (int i = 0; i < N; i++) {
int j;
cin >> j;
if (j < 3200)
A.insert(j / 400);
else
k++;
}
cout << max(1, (int)A.size()) << ' ' << min(8, (int)A.size() + k) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
set<int> A;
int k = 0;
for (int i = 0; i < N; i++) {
int j;
cin >> j;
if (j < 3200)
A.insert(j / 400);
else
k++;
}
cout << max(1, (int)A.size()) << ' ' << (int)A.size() + k << endl;
} | [
"call.remove",
"call.arguments.change"
] | 1,365,134 | 1,365,135 | u306482197 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
cout << setprecision(10);
map<int, int> m;
int N;
cin >> N;
int free = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
tmp /= 400;
if (tmp >... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
long long MOD = 1000000000 + 7;
int main() {
cout << setprecision(10);
map<int, int> m;
int N;
cin >> N;
int free = 0;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
tmp /= 400;
if (tmp >... | [
"call.add",
"call.arguments.change"
] | 1,365,136 | 1,365,137 | u190875453 | cpp |
p03695 | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int c[9];
int main() {
i... | #include <algorithm>
#include <cassert>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int c[9];
int main() {
i... | [
"call.remove",
"call.arguments.change"
] | 1,365,138 | 1,365,139 | u519759783 | cpp |
p03695 | using namespace std;
#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include... | using namespace std;
#include <algorithm>
#include <bitset>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string>
#include... | [
"call.add",
"call.arguments.add"
] | 1,365,140 | 1,365,141 | u586052522 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define bg begin()
#define ed end()
#define all(x) x.bg, x.ed
#defi... | [
"call.remove",
"call.arguments.change"
] | 1,365,146 | 1,365,147 | u319279308 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define repk(i, k, n... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change",
"assignment.value.change",
"expression.operation.binary.remove"
] | 1,365,148 | 1,365,149 | u296160120 | cpp |
p03695 | // AnkitCode99 here....
// every ups and downs matter!
#include <bits/stdc++.h>
#define endl "\n"
#define Ryuga \
ios_base::sync_with_stdio(0); \
cin.tie(nullptr); ... | // AnkitCode99 here....
// every ups and downs matter!
#include <bits/stdc++.h>
#define endl "\n"
#define Ryuga \
ios_base::sync_with_stdio(0); \
cin.tie(nullptr); ... | [
"expression.operation.binary.add"
] | 1,365,166 | 1,365,167 | u336130820 | cpp |
p03695 | // AnkitCode99 here....
// every ups and downs matter!
#include <bits/stdc++.h>
#define endl "\n"
#define Ryuga \
ios_base::sync_with_stdio(0); \
cin.tie(nullptr); ... | // AnkitCode99 here....
// every ups and downs matter!
#include <bits/stdc++.h>
#define endl "\n"
#define Ryuga \
ios_base::sync_with_stdio(0); \
cin.tie(nullptr); ... | [
"expression.operation.binary.add"
] | 1,365,166 | 1,365,168 | u336130820 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define sizeOf(A) (sizeof(A)) / (sizeof(A[0]))
#define odd(x) ((x) % (2))
#define fastio ios_base::sync_with_stdio(false), cin.tie(0);
int main() {
fastio;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define sizeOf(A) (sizeof(A)) / (sizeof(A[0]))
#define odd(x) ((x) % (2))
#define fastio ios_base::sync_with_stdio(false), cin.tie(0);
int main() {
fastio;
... | [
"call.add",
"call.arguments.change"
] | 1,365,178 | 1,365,179 | u660641716 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#define f first
#define s second
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define pb push_back
#... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change"
] | 1,365,180 | 1,365,181 | u867529352 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int c = 0, d = 0;
bool b[8] = {};
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200)
c++;
else {
b[a / 400] = 1;
}
}
for (int i = 0; i < 8; i++) {
if (b[i])
d++;
}
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int c = 0, d = 0;
bool b[8] = {};
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200)
c++;
else {
b[a / 400] = 1;
}
}
for (int i = 0; i < 8; i++) {
if (b[i])
d++;
}
cout << ... | [
"call.add",
"call.arguments.change"
] | 1,365,184 | 1,365,185 | u385825353 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int c[200];
for (int i = 0; i < n; i++)
cin >> c[i];
bool d[11];
for (int i = 0; i < 9; i++)
d[i] = 0;
int red = 0;
for (int i = 0; i < n; i++) {
if (c[i] >= 3200)
red++;
else if (c[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
int c[200];
for (int i = 0; i < n; i++)
cin >> c[i];
bool d[11];
for (int i = 0; i < 9; i++)
d[i] = 0;
int red = 0;
for (int i = 0; i < n; i++) {
if (c[i] >= 3200)
red++;
else if (c[... | [
"call.remove",
"call.arguments.change"
] | 1,365,186 | 1,365,187 | u889173297 | cpp |
p03695 | #include <iomanip>
#include <iostream>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int n;
cin >> n;
int c[9] = {0};
repi(i, n, 0) {
int a;
cin >> a;
if (a >= 3200) {
c[8]++;
} ... | #include <iomanip>
#include <iostream>
typedef long long ll;
using namespace std;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
#define repi(i, n, init) for (ll i = init; i < (n); i++)
int main() {
int n;
cin >> n;
int c[9] = {0};
repi(i, n, 0) {
int a;
cin >> a;
if (a >= 3200) {
c[8]++;
} ... | [
"call.remove",
"call.arguments.change"
] | 1,365,197 | 1,365,198 | u187013893 | cpp |
p03695 | // median time 65
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto i = m.begi... | // median time 65
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
#define all(v) v.begin(), v.end()
#define repi(i, n, init) for (ll i = init; i < (n); i++)
#define repd(i, n, init) for (ll i = (n); i >= init; i--)
#define repm(i, m) for (auto i = m.begi... | [
"call.remove",
"call.arguments.change"
] | 1,365,199 | 1,365,200 | u187013893 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric> // accumulate(v.begin(), v.end(), 0)
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<bool> rate(8, false);
int free = 0;
for (int i = 0; i < N;... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <numeric> // accumulate(v.begin(), v.end(), 0)
#include <vector>
using namespace std;
#define ll long long
int main() {
int N;
cin >> N;
vector<int> A(N);
vector<bool> rate(8, false);
int free = 0;
for (int i = 0; i < N;... | [
"call.remove",
"call.arguments.change"
] | 1,365,201 | 1,365,202 | u137747137 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) stable_sort(a.begin(), a.end())
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define sum(a) accumulate(a.begin(), a.end(), 0)
#define join(a, d) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) stable_sort(a.begin(), a.end())
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define sum(a) accumulate(a.begin(), a.end(), 0)
#define join(a, d) ... | [
"call.add",
"call.arguments.change"
] | 1,365,203 | 1,365,204 | u125205981 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) stable_sort(a.begin(), a.end())
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define sum(a) accumulate(a.begin(), a.end(), 0)
#define join(a, d) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) stable_sort(a.begin(), a.end())
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define sum(a) accumulate(a.begin(), a.end(), 0)
#define join(a, d) ... | [
"call.arguments.add",
"call.arguments.change"
] | 1,365,205 | 1,365,204 | u125205981 | cpp |
p03695 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"variable_access.subscript.index.change"
] | 1,365,210 | 1,365,211 | u700484101 | cpp |
p03695 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | [
"call.add",
"call.arguments.add"
] | 1,365,212 | 1,365,211 | u700484101 | cpp |
p03695 | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | #include <bits/stdc++.h>
#include <type_traits>
using namespace std;
using ll = long long;
#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 ddrep(i, n) for (int i = n; i > 0; --i)
#define srep(i, s, t) for (in... | [
"call.add",
"call.arguments.change"
] | 1,365,213 | 1,365,214 | u700484101 | cpp |
p03695 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(), (x).end()
#define re... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(), (x).end()
#define re... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,365,221 | 1,365,222 | u062736195 | cpp |
p03695 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(), (x).end()
#define re... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(), (x).end()
#define re... | [
"literal.number.change",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,365,223 | 1,365,222 | u062736195 | cpp |
p03695 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(), (x).end()
#define re... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(), (x).end()
#define re... | [
"literal.number.change",
"call.arguments.change",
"call.arguments.add",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,365,224 | 1,365,222 | u062736195 | 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 rep2(i, x, n) for (int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for (int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = ... | [
"call.remove",
"call.arguments.change"
] | 1,365,236 | 1,365,237 | u134678977 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll S[10];
int main() {
cin.tie(0);
io... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pll;
#define FOR(i, n, m) for (ll(i) = (m); (i) < (n); ++(i))
#define REP(i, n) FOR(i, n, 0)
#define OF64 std::setprecision(10)
const ll MOD = 1000000007;
const ll INF = (ll)1e15;
ll S[10];
int main() {
cin.tie(0);
io... | [
"misc.opposites",
"identifier.change",
"io.output.change"
] | 1,365,240 | 1,365,241 | u340980616 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int color[9] = {0};
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
if (a >= 3200) {
a = 3200;
}
color[a / 400]++;
}
int colorNum = 0;
for (int i = 0;... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
int color[9] = {0};
for (int i = 0; i < N; ++i) {
int a;
cin >> a;
if (a >= 3200) {
a = 3200;
}
color[a / 400]++;
}
int colorNum = 0;
for (int i = 0;... | [
"literal.number.change",
"io.output.change",
"call.remove",
"call.arguments.change"
] | 1,365,242 | 1,365,243 | u340980616 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef pair<int, int> Pi;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define fi first
#define se second
#define endl "\n"
template <typename T> inline b... | [
"call.remove",
"call.arguments.change"
] | 1,365,248 | 1,365,249 | u340010271 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int a[N];
int count[8];
int count3200 = 0;
int ans = 0;
for (int i = 0; i < 8; i++) {
count[i] = 0;
}
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < 8; j++) ... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int a[N];
int count[8];
int count3200 = 0;
int ans = 0;
for (int i = 0; i < 8; i++) {
count[i] = 0;
}
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < 8; j++) ... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,365,250 | 1,365,251 | u965730380 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int a[N];
int count[8];
int count3200 = 0;
int ans = 0;
for (int i = 0; i < 8; i++) {
count[i] = 0;
}
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < 8; j++)... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N;
cin >> N;
int a[N];
int count[8];
int count3200 = 0;
int ans = 0;
for (int i = 0; i < 8; i++) {
count[i] = 0;
}
for (int i = 0; i < N; i++) {
cin >> a[i];
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < 8; j++) ... | [
"call.add",
"call.arguments.add"
] | 1,365,252 | 1,365,251 | u965730380 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int colo[9] = {};
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= 7; j++) {
if (400 * j <= arr[i] && arr[i] < 400 * (j + 1))
colo[j]++;
}
if (... | #include <iostream>
using namespace std;
int main() {
int colo[9] = {};
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
for (int i = 0; i < n; i++) {
for (int j = 0; j <= 7; j++) {
if (400 * j <= arr[i] && arr[i] < 400 * (j + 1))
colo[j]++;
}
if (... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,365,256 | 1,365,257 | u793829136 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int N;
int a[100];
int main() {
cin >> N;
rep(i, N) cin >> a[i];
map<string, int> mp;
int free = 0;
rep(i, N) {
if (a[i] <= 399) {
mp["gray"]++;
} else if (a[i] <= 799) {... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
int N;
int a[100];
int main() {
cin >> N;
rep(i, N) cin >> a[i];
map<string, int> mp;
int free = 0;
rep(i, N) {
if (a[i] <= 399) {
mp["gray"]++;
} else if (a[i] <= 799) {... | [
"call.remove",
"call.arguments.change"
] | 1,365,263 | 1,365,264 | u455366471 | cpp |
p03695 | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<bool> a(8, 0);
int cnt = 0;
for (int i = 0; i < n; i++) {
int b;
cin >> b;
if (b <= 399)
a.at(0) = 1;
else if (b <= 799)
a.at(1) = 1;
else if (b <= 1199)
a.at(2) = 1;
... | #include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<bool> a(8, 0);
int cnt = 0;
for (int i = 0; i < n; i++) {
int b;
cin >> b;
if (b <= 399)
a.at(0) = 1;
else if (b <= 799)
a.at(1) = 1;
else if (b <= 1199)
a.at(2) = 1;
... | [
"expression.operation.binary.remove"
] | 1,365,265 | 1,365,266 | u886613668 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
int main(void) {
int n;
std::cin >> n;
std::vector<int> a(n); // rate
std::cin >> a;
/**
* [0]~399 ... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
int main(void) {
int n;
std::cin >> n;
std::vector<int> a(n); // rate
std::cin >> a;
/**
* [0]~399 ... | [
"misc.opposites",
"assignment.value.change",
"identifier.change"
] | 1,365,269 | 1,365,270 | u356069145 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) {
cin >> v.at(i);
v.at(i) /= 400;
}
set<int> s;
int c = 0;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using pii = pair<int, int>;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
vector<int> v(n);
rep(i, n) {
cin >> v.at(i);
v.at(i) /= 400;
}
set<int> s;
int c = 0;
... | [
"call.add",
"call.arguments.change"
] | 1,365,271 | 1,365,272 | u007463213 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, pair<int, int>> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<bool> b(8);
int o = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a >= 3200) {
o++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, pair<int, int>> p;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<bool> b(8);
int o = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a >= 3200) {
o++;
... | [
"call.remove",
"call.arguments.change"
] | 1,365,273 | 1,365,274 | u412039195 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(a, n) for (ll a = 0; a < (n); ++a)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<vector<ll>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class ... | #include <bits/stdc++.h>
#define rep(a, n) for (ll a = 0; a < (n); ++a)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<vector<ll>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class ... | [
"call.remove",
"call.arguments.change"
] | 1,365,275 | 1,365,276 | u045408189 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int col[8];
for (int i = 0; i < 8; i++) {
col[i] = 0;
}
int fre = 0;
for (int i = 0; i < n; i++) {
int rate;
cin >> rate;
int cnt = 0;
if (rate >= 3200) {
fre++;
} else {
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
int col[8];
for (int i = 0; i < 8; i++) {
col[i] = 0;
}
int fre = 0;
for (int i = 0; i < n; i++) {
int rate;
cin >> rate;
int cnt = 0;
if (rate >= 3200) {
fre++;
} else {
... | [
"call.remove",
"call.arguments.change"
] | 1,365,279 | 1,365,280 | u902387200 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// container util
#define SORT(c) sort((c).begin(), (c).end())
#define all(a) (a).begin(), (a).end()
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// print
#define pv(val) cerr << #val << '=' << (... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
// container util
#define SORT(c) sort((c).begin(), (c).end())
#define all(a) (a).begin(), (a).end()
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
// print
#define pv(val) cerr << #val << '=' << (... | [
"call.add",
"call.arguments.add"
] | 1,365,283 | 1,365,284 | u594140666 | cpp |
p03695 | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int32_t N;
cin >> N;
constexpr int32_t kMaxNu... | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int32_t N;
cin >> N;
constexpr int32_t kMaxNu... | [
"call.remove",
"call.arguments.change"
] | 1,365,285 | 1,365,286 | u394961950 | cpp |
p03695 | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int32_t N;
cin >> N;
constexpr int32_t kMaxNu... | /**
* @copyright (c) 2020 Daisuke Hashimoto
*/
#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Pair = pair<int32_t, int32_t>;
// std::cout << std::setprecision(20) << 1.1 << endl;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int32_t N;
cin >> N;
constexpr int32_t kMaxNu... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change",
"call.remove",
"call.arguments.change"
] | 1,365,287 | 1,365,286 | u394961950 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define per(i, n, s) for (int i = (n - 1); i >= (int)(s); i--)
#define all(x) (x).begin(), (x).end()
// #define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll LINF = LLONG_MAX... | #include <bits/stdc++.h>
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define per(i, n, s) for (int i = (n - 1); i >= (int)(s); i--)
#define all(x) (x).begin(), (x).end()
// #define debug(x) cout<<#x<<": "<<x<<endl
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll LINF = LLONG_MAX... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,365,288 | 1,365,289 | u646962247 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.