problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03695 | #include <bits/stdc++.h>
using namespace std;
int N;
int main() {
bool r[8];
int s = 0;
memset(r, false, sizeof(r));
cin >> N;
for (int i = 0; i < N; i++) {
int val;
cin >> val;
if (val > 3199)
s++;
else if (val > 2799)
r[7] = true;
else if (val > 2399)
r[6] = true;
... | #include <bits/stdc++.h>
using namespace std;
int N;
int main() {
bool r[8];
int s = 0;
memset(r, false, sizeof(r));
cin >> N;
for (int i = 0; i < N; i++) {
int val;
cin >> val;
if (val > 3199)
s++;
else if (val > 2799)
r[7] = true;
else if (val > 2399)
r[6] = true;
... | [
"call.remove",
"call.arguments.change"
] | 1,366,715 | 1,366,716 | u027479217 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
//#define int long long
using pii = pair<int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0;
signed main() {
int n;
cin >> n;
int a;
int cnt = 0, ans = 0, c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(), (x).end()
//#define int long long
using pii = pair<int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0;
signed main() {
int n;
cin >> n;
int a;
int cnt = 0, ans = 0, c... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,366,725 | 1,366,726 | u803754262 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
int N;
cin >> N;
int a;
set<int> s;
int ex = 0;
rep(i, N) {
cin >> a;
int t... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
int main() {
int N;
cin >> N;
int a;
set<int> s;
int ex = 0;
rep(i, N) {
cin >> a;
int t... | [
"call.remove",
"call.arguments.change"
] | 1,366,727 | 1,366,728 | u949755084 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
int main(void) {
int n;
cin >> n;
int cnt[9] = {... | #include <bits/stdc++.h>
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
int main(void) {
int n;
cin >> n;
int cnt[9] = {... | [
"call.add",
"call.arguments.add"
] | 1,366,739 | 1,366,740 | u076566148 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_r(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#define all(x) (x).begin(), (x).end()
#define ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep_r(i, n) for (int i = ((int)(n)-1); i >= 0; --i)
#define FOR(i, m, n) for (int i = ((int)(m)); i < (int)(n); ++i)
#define FOR_R(i, m, n) for (int i = ((int)(m)-1); i >= (int)(n); --i)
#define all(x) (x).begin(), (x).end()
#define ... | [
"call.remove",
"call.arguments.change"
] | 1,366,741 | 1,366,742 | u619535866 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ALL(a) (a).begin(), (a).end()
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, ... | [
"call.add",
"call.arguments.change"
] | 1,366,747 | 1,366,748 | u969116807 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define debug(x) cerr << #x << " = " << x << "\n"
#define debugv(x) \
rep(i, x.size()) cerr << x[i] << (i == x.size() - 1 ? "\n" : " ")
using namespace std;
#define int long long
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define debug(x) cerr << #x << " = " << x << "\n"
#define debugv(x) \
rep(i, x.size()) cerr << x[i] << (i == x.size() - 1 ? "\n" : " ")
using namespace std;
#define int long long
... | [
"call.remove",
"call.arguments.change"
] | 1,366,753 | 1,366,754 | u265065462 | cpp |
p03695 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, a, C[8] = {0}, color = 0, tourist = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
for (int j = 0; j < 8; j++) {
if (400 * j <= a && a < 400 * (j + 1) && C[j] == 0) {
C[j] = 1;
color++;
}
}
if (320... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, a, C[8] = {0}, color = 0, tourist = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
for (int j = 0; j < 8; j++) {
if (400 * j <= a && a < 400 * (j + 1) && C[j] == 0) {
C[j] = 1;
color++;
}
}
if (320... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"identifier.change"
] | 1,366,771 | 1,366,772 | u454087021 | cpp |
p03695 | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, a, C[8] = {0}, color = 0, tourist = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
for (int j = 0; j < 8; j++) {
if (400 * j <= a && a < 400 * (j + 1) && C[j] == 0) {
C[j] = 1;
color++;
}
}
if (320... | #include "bits/stdc++.h"
using namespace std;
int main() {
int N, a, C[8] = {0}, color = 0, tourist = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
for (int j = 0; j < 8; j++) {
if (400 * j <= a && a < 400 * (j + 1) && C[j] == 0) {
C[j] = 1;
color++;
}
}
if (320... | [
"call.add",
"call.arguments.change"
] | 1,366,773 | 1,366,772 | u454087021 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N] = {0};
for (int i = 0; i < N; i++)
cin >> a[i];
int colors[9];
for (int i = 0; i < 9; i++)
colors[i] = 0;
for (int i = 0; i < N; i++) {
if (0 < a[i] and a[i] < 400) //灰色
{
colors[0]++;
} else if (... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int a[N] = {0};
for (int i = 0; i < N; i++)
cin >> a[i];
int colors[9];
for (int i = 0; i < 9; i++)
colors[i] = 0;
for (int i = 0; i < N; i++) {
if (0 < a[i] and a[i] < 400) //灰色
{
colors[0]++;
} else if (... | [
"call.add",
"call.arguments.change"
] | 1,366,774 | 1,366,775 | u523303964 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
bool occupied[8];
fill(occupied, occupied + 8, false);
int... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
bool occupied[8];
fill(occupied, occupied + 8, false);
int... | [
"call.add",
"call.arguments.change"
] | 1,366,783 | 1,366,784 | u780950519 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | #include <bits/stdc++.h>
using namespace std;
using VS = vector<string>;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
using VL = vector<LL>;
using VVL = vector<VL>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) (a).rbegin(), (a).rend... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,366,789 | 1,366,790 | u788341294 | cpp |
p03695 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int rate[9]{0};
int a[101];
for (int i = 0; i < n; i++) {
cin >> a[i];
rate[min(a[i] / 400, 8)]++;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (rate[i] != 0) {
ans++;
}
}
cout << ma... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int rate[9]{0};
int a[101];
for (int i = 0; i < n; i++) {
cin >> a[i];
rate[min(a[i] / 400, 8)]++;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (rate[i] != 0) {
ans++;
}
}
cout << ma... | [
"call.remove",
"call.arguments.change"
] | 1,366,791 | 1,366,792 | u681557252 | cpp |
p03695 | #include <iostream>
using namespace std;
int color(int rate) { return rate / 400; }
int main() {
int n;
cin >> n;
int colors[] = {0, 0, 0, 0, 0, 0, 0, 0};
int fn = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (color(a) <= 7)
colors[color(a)]++;
else
fn++;
}
int ans... | #include <iostream>
using namespace std;
int color(int rate) { return rate / 400; }
int main() {
int n;
cin >> n;
int colors[] = {0, 0, 0, 0, 0, 0, 0, 0};
int fn = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (color(a) <= 7)
colors[color(a)]++;
else
fn++;
}
int ans... | [
"call.remove",
"call.arguments.change"
] | 1,366,799 | 1,366,800 | u865590787 | cpp |
p03695 | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#i... | #include <algorithm>
#include <chrono>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#i... | [
"call.add",
"call.arguments.add"
] | 1,366,803 | 1,366,804 | u376103660 | cpp |
p03695 | #include <bits/stdc++.h>
#define inf 1000000000 // 1E+9
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int over = 0;
bitset<8> c(0);
for (int i = 0; i < n; i++) {
if (a[i] < 400)
c.set(0);
else if (a[i] < 800)
c.set(1);
e... | #include <bits/stdc++.h>
#define inf 1000000000 // 1E+9
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int over = 0;
bitset<8> c(0);
for (int i = 0; i < n; i++) {
if (a[i] < 400)
c.set(0);
else if (a[i] < 800)
c.set(1);
e... | [
"call.remove",
"call.arguments.change"
] | 1,366,805 | 1,366,806 | u819160021 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(9);
int a;
for (int i = 0; i < N; i++) {
cin >> a;
if (a <= 399)
data.at(0)++;
else if (a <= 799)
data.at(1)++;
else if (a <= 1199)
data.at(2)++;
else if (a <= 1599)
data.at... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> data(9);
int a;
for (int i = 0; i < N; i++) {
cin >> a;
if (a <= 399)
data.at(0)++;
else if (a <= 799)
data.at(1)++;
else if (a <= 1199)
data.at(2)++;
else if (a <= 1599)
data.at... | [
"call.remove",
"call.arguments.change"
] | 1,366,809 | 1,366,810 | u239087789 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int d[8] = {0};
int count = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a >= 3200)
count++;
else {
d[a / 400]++;
}
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (d[i] > 0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int d[8] = {0};
int count = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a >= 3200)
count++;
else {
d[a / 400]++;
}
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (d[i] > 0)
... | [
"call.remove",
"call.arguments.change"
] | 1,366,811 | 1,366,812 | u413492096 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const ll INF = 1LL << 60;
#define rep(i, a, n) for (ll i = (a); i < (n); i++)
#define debug(x) cerr << #x << ": " << x << endl;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
templ... | [
"call.remove",
"call.arguments.change"
] | 1,366,813 | 1,366,814 | u318785595 | cpp |
p03695 | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF LLONG_MAX
#define eps LDBL_EPSILON
#define moder 1000000007
#define pie 3.141592653589793238462643383279
#define P std::pair<int, int>
#define prique priority_queue
using namespace std;
int n, a... | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF LLONG_MAX
#define eps LDBL_EPSILON
#define moder 1000000007
#define pie 3.141592653589793238462643383279
#define P std::pair<int, int>
#define prique priority_queue
using namespace std;
int n, a... | [
"call.arguments.add",
"io.output.change",
"call.arguments.change"
] | 1,366,819 | 1,366,820 | u379822620 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
bool b[8];
int main() {
int n;
cin >> n;
int c = 0, b[8] = {};
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200)
c++;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
bool b[8];
int main() {
int n;
cin >> n;
int c = 0, b[8] = {};
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200)
c++;
... | [
"call.add",
"call.arguments.change"
] | 1,366,821 | 1,366,822 | u379822620 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int ansmin = 0, ansmax = 0;
int n;
cin >> n;
bool b[10];
for (int i = 0; i < 10; i++)
b[i] = false;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 400)
b[0] = true;
else if (a < 800... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int ansmin = 0, ansmax = 0;
int n;
cin >> n;
bool b[10];
for (int i = 0; i < 10; i++)
b[i] = false;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 400)
b[0] = true;
else if (a < 800... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,366,823 | 1,366,824 | u141968173 | cpp |
p03695 | #include <iostream>
using namespace std;
int n;
int a[5000];
int rate[9];
int rateToIndex(int x) {
if (x < 400) {
return 0;
} else if (x < 800) {
return 1;
} else if (x < 1200) {
return 2;
} else if (x < 1600) {
return 3;
} else if (x < 2000) {
return 4;
} else if (x < 2400) {
ret... | #include <iostream>
using namespace std;
int n;
int a[5000];
int rate[9];
int rateToIndex(int x) {
if (x < 400) {
return 0;
} else if (x < 800) {
return 1;
} else if (x < 1200) {
return 2;
} else if (x < 1600) {
return 3;
} else if (x < 2000) {
return 4;
} else if (x < 2400) {
ret... | [
"call.add",
"call.arguments.change"
] | 1,366,825 | 1,366,826 | u550178285 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)
#define Fr(i, n) for (int i = 0; i++ < n;)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
#define iFr(i, n) for (int i = n; i > 0; i--)
int main() {
int n, a, b... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
#define pb push_back
#define fr(i, n) for (int i = 0; i < n; i++)
#define Fr(i, n) for (int i = 0; i++ < n;)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
#define iFr(i, n) for (int i = n; i > 0; i--)
int main() {
int n, a, b... | [
"call.remove",
"call.arguments.change"
] | 1,366,829 | 1,366,830 | u434208140 | cpp |
p03695 | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
typedef... | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
typedef... | [
"call.remove",
"call.arguments.change"
] | 1,366,831 | 1,366,832 | u863279562 | cpp |
p03695 | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
typedef... | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
typedef... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.remove",
"call.arguments.change"
] | 1,366,833 | 1,366,832 | u863279562 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i... | [
"call.add",
"call.arguments.add"
] | 1,366,834 | 1,366,835 | u196497077 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#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 ... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#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 ... | [
"call.remove",
"call.arguments.change"
] | 1,366,836 | 1,366,837 | u196497077 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
bool color[8] = {false};
int fre = 0, res = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < 400)
color[0] = true;
else if (a[i] < 800)
color[1] = true;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
bool color[8] = {false};
int fre = 0, res = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < 400)
color[0] = true;
else if (a[i] < 800)
color[1] = true;... | [
"call.add",
"call.arguments.change"
] | 1,366,838 | 1,366,839 | u423624748 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
bool color[8] = {false};
int fre = 0, res = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < 400)
color[0] = true;
else if (a[i] < 800)
color[1] = true;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
bool color[8] = {false};
int fre = 0, res = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < 400)
color[0] = true;
else if (a[i] < 800)
color[1] = true;... | [
"call.arguments.change"
] | 1,366,840 | 1,366,839 | u423624748 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
bool color[8] = {false};
int free = 0, res = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < 400)
color[0] = true;
else if (a[i] < 800)
color[1] = true... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; ++i)
cin >> a[i];
bool color[8] = {false};
int fre = 0, res = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < 400)
color[0] = true;
else if (a[i] < 800)
color[1] = true;... | [
"variable_declaration.name.change",
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 1,366,841 | 1,366,839 | u423624748 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define LL long long
int main() {
int n;
bool hf = false, cf = false, mf = false, sf = false, af = false;
bool kf = false, of = false, akaf = false;
LL ans = 0;
int mincnt = 0;
int maxcnt = 0;
cin >> n;
vector<LL> a(n), b(... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define LL long long
int main() {
int n;
bool hf = false, cf = false, mf = false, sf = false, af = false;
bool kf = false, of = false, akaf = false;
LL ans = 0;
int mincnt = 0;
int maxcnt = 0;
cin >> n;
vector<LL> a(n), b(... | [
"call.add",
"call.arguments.add"
] | 1,366,842 | 1,366,843 | u503052349 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans1 = 0, ans2 = 0;
cin >> n;
int a[n];
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[a[i] / 400]++;
}
for (int i = 0; i < 8; i++) {
if (mp[i] > 0) {
ans1++;
ans2++;
}
}
if (ans1 == 0) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ans1 = 0, ans2 = 0;
cin >> n;
int a[n];
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> a[i];
mp[min(8, a[i] / 400)]++;
}
for (int i = 0; i < 8; i++) {
if (mp[i] > 0) {
ans1++;
ans2++;
}
}
if (ans1 == ... | [
"call.add",
"call.arguments.change"
] | 1,366,844 | 1,366,845 | u710232726 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0, c = 0;
cin >> n;
long long a[n], b[10] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 400) {
b[0]++;
} else if (a[i] >= 400 && a[i] < 800) {
b[1]++;
} else if (a[i] >= 800 && a[i] < 1200) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, ans = 0, c = 0;
cin >> n;
long long a[n], b[10] = {};
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 400) {
b[0]++;
} else if (a[i] >= 400 && a[i] < 800) {
b[1]++;
} else if (a[i] >= 800 && a[i] < 1200) {
... | [
"expression.unary.arithmetic.remove",
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"identifier.change"
] | 1,366,846 | 1,366,847 | u710232726 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
int main(void) {
ll n, a;
cin >> n;
vector<ll> v;
rep(i, 0, n) {
cin >> a;
if (a < 3200)
v.at(a / 400) = 1;
else
v.at(8)++;
}
rep(i, 1, 8) v.at(0) += v.at(i);
cout... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
int main(void) {
ll n, a;
cin >> n;
vector<ll> v(9);
rep(i, 0, n) {
cin >> a;
if (a < 3200)
v.at(a / 400) = 1;
else
v.at(8)++;
}
rep(i, 1, 8) v.at(0) += v.at(i);
c... | [
"call.arguments.add"
] | 1,366,848 | 1,366,849 | u874644572 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
int main(void) {
ll n, a;
cin >> n;
vector<ll> v(9);
rep(i, 0, n) {
cin >> a;
if (a < 3200)
v.at(a / 400) = 1;
else
v.at(8)++;
}
rep(i, 1, 8) v.at(0) += v.at(i);
c... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, l, r) for (ll i = (l); i < (r); i++)
int main(void) {
ll n, a;
cin >> n;
vector<ll> v(9);
rep(i, 0, n) {
cin >> a;
if (a < 3200)
v.at(a / 400) = 1;
else
v.at(8)++;
}
rep(i, 1, 8) v.at(0) += v.at(i);
c... | [
"call.arguments.change"
] | 1,366,850 | 1,366,849 | u874644572 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (long long int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (long long int i = (a); i > (b); i--)
long long int n, cnt = 0, ans = 0, a[100000], b = 0, c = 0, tmp = 0;
string... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (long long int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (long long int i = (a); i > (b); i--)
long long int n, cnt = 0, ans = 0, a[100000], b = 0, c = 0, tmp = 0;
string... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,366,853 | 1,366,854 | u876335718 | cpp |
p03695 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 30;
const LL MOD = 1000000007;
LL gcd(LL a, LL b) ... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 30;
const LL MOD = 1000000007;
LL gcd(LL a, LL b) ... | [
"call.remove",
"call.arguments.change"
] | 1,366,857 | 1,366,858 | u999803454 | cpp |
p03695 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 30;
const LL MOD = 1000000007;
LL gcd(LL a, LL b) ... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long LL;
const LL INF = 1 << 30;
const LL MOD = 1000000007;
LL gcd(LL a, LL b) ... | [
"call.remove",
"call.arguments.change"
] | 1,366,859 | 1,366,858 | u999803454 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
//#define int long long
signed main() {
int n, a;
cin >> n;
int iro[9] = {};
for (int i = 0; i < n; i++) {
cin >> a;
if (a >= 3200)
iro[8]++;
else
iro[a / 400]++;
}
int ans1 = 0;
for (int i = 0; i < 8; i++) {
if (iro[i] != 0) {
... | #include <bits/stdc++.h>
using namespace std;
//#define int long long
signed main() {
int n, a;
cin >> n;
int iro[9] = {};
for (int i = 0; i < n; i++) {
cin >> a;
if (a >= 3200)
iro[8]++;
else
iro[a / 400]++;
}
int ans1 = 0;
for (int i = 0; i < 8; i++) {
if (iro[i] != 0) {
... | [
"call.add",
"call.arguments.add"
] | 1,366,860 | 1,366,861 | u651317892 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<bool> c(8);
int ansmax = 0;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
if (k < 3200)
c[k / 400] = true;
else
ansmax++;
}
int ans = 0, ansmin;
for (int i = 0; i < 8... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
vector<bool> c(8);
int ansmax = 0;
for (int i = 0; i < n; i++) {
int k;
cin >> k;
if (k < 3200)
c[k / 400] = true;
else
ansmax++;
}
int ans = 0, ansmin;
for (int i = 0; i < 8... | [
"identifier.change",
"io.output.change"
] | 1,366,862 | 1,366,863 | u374929478 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
bool c[8];
int temp;
int count = 0;
for (int i = 0; i < 8; i++)
c[i] = false;
for (int i = 0; i < n; i++) {
cin >> temp;
temp /= 400;
if (temp < 8)
c[te... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
bool c[8];
int temp;
int count = 0;
for (int i = 0; i < 8; i++)
c[i] = false;
for (int i = 0; i < n; i++) {
cin >> temp;
temp /= 400;
if (temp < 8)
c[te... | [
"call.remove",
"call.arguments.change"
] | 1,366,866 | 1,366,867 | u183866833 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T>
constexpr T INF = numeric_limits<T>::has_infinity
? numeric_limits<T>::infinity()
: numeric_limits<T>::max() / 2;
#define REP(i, stop) FOR(i, 0,... | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T>
constexpr T INF = numeric_limits<T>::has_infinity
? numeric_limits<T>::infinity()
: numeric_limits<T>::max() / 2;
#define REP(i, stop) FOR(i, 0,... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,366,868 | 1,366,869 | u019489252 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T>
constexpr T INF = numeric_limits<T>::has_infinity
? numeric_limits<T>::infinity()
: numeric_limits<T>::max() / 2;
#define REP(i, stop) FOR(i, 0,... | #include <bits/stdc++.h>
using namespace std;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
template <typename T>
constexpr T INF = numeric_limits<T>::has_infinity
? numeric_limits<T>::infinity()
: numeric_limits<T>::max() / 2;
#define REP(i, stop) FOR(i, 0,... | [
"call.add",
"call.arguments.add"
] | 1,366,870 | 1,366,869 | u019489252 | cpp |
p03695 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int N, rate[8] = {}, rainbow = 0, r;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> r;
if (r <= 399) {
rate... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string>
using namespace std;
int main() {
int N, rate[8] = {}, rainbow = 0, r;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> r;
if (r <= 399) {
rate... | [
"io.output.change"
] | 1,366,871 | 1,366,872 | u371535422 | cpp |
p03695 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / ... | [
"call.remove",
"call.arguments.change"
] | 1,366,875 | 1,366,876 | u635484372 | cpp |
p03695 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define RUP(a, b) ((a + b - 1) / ... | [
"call.remove",
"call.arguments.change",
"assignment.value.change"
] | 1,366,877 | 1,366,876 | u635484372 | 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];
bool color[8];
int max = 0;
for (int i = 0; i < 8; i++)
color[i] = false;
for (int i = 0; i < n; i++) {
if (a[i] < 400)
color[0] = true;
else if (a[i] < 800... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
bool color[8];
int max = 0;
for (int i = 0; i < 8; i++)
color[i] = false;
for (int i = 0; i < n; i++) {
if (a[i] < 400)
color[0] = true;
else if (a[i] < 800... | [] | 1,366,885 | 1,366,886 | u461415203 | cpp |
p03695 | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REVERS... | #include <algorithm>
#include <climits>
#include <complex>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
// using
using namespace std;
// typedef
typedef long long ll;
// define
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REVERS... | [
"call.remove",
"call.arguments.change"
] | 1,366,889 | 1,366,890 | u164300951 | cpp |
p03695 | #include <algorithm>
#include <cstring>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) ... | #include <algorithm>
#include <cstring>
#include <iterator>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) ... | [] | 1,366,891 | 1,366,892 | u209713918 | cpp |
p03695 | #include <algorithm>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using ... | #include <algorithm>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using ll = long long;
using ... | [
"call.remove",
"call.arguments.change"
] | 1,366,896 | 1,366,897 | u181719868 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vp;
typedef map<ll, ll> mll;
typedef map<string, ll> mstrll;
#defin... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<string> vstr;
typedef pair<ll, ll> pll;
typedef vector<pll> vp;
typedef map<ll, ll> mll;
typedef map<string, ll> mstrll;
#defin... | [
"call.add",
"call.arguments.change"
] | 1,366,898 | 1,366,899 | u303059352 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
bitset<8> s;
int num_free = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
int c = a / 400;
if (c >= 8)
++num_free;
else
s.set(c);
}
int ans_min = max((int)s.c... | #include <algorithm>
#include <bitset>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
bitset<8> s;
int num_free = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
int c = a / 400;
if (c >= 8)
++num_free;
else
s.set(c);
}
int ans_min = max((int)s.c... | [
"call.remove",
"call.arguments.change"
] | 1,366,902 | 1,366,903 | u303356821 | cpp |
p03695 | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int N, a;
int arr[9] = {};
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
arr[a / 400]++;
}
int ans = 0;
for (int i = 0; i < 8; ++i) {
if (arr[i] > 0) {
ans++;
}
}
cout << max(ans, 1) << ' ' ... | #include <iostream>
using namespace std;
int main(int argc, const char *argv[]) {
int N, a;
int arr[9] = {};
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
arr[min(a / 400, 8)]++;
}
int ans = 0;
for (int i = 0; i < 8; ++i) {
if (arr[i] > 0) {
ans++;
}
}
cout << max(ans, 1)... | [
"call.add",
"call.arguments.add"
] | 1,366,904 | 1,366,905 | u551373727 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
bool color[8] = {};
int free = 0;
rep(i, n) {
int a;
cin >> a;
if (a >= 3200)
free++;
else
colo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
bool color[8] = {};
int free = 0;
rep(i, n) {
int a;
cin >> a;
if (a >= 3200)
free++;
else
colo... | [
"call.remove",
"call.arguments.change"
] | 1,366,906 | 1,366,907 | u214304095 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
bool color[8] = {};
int free = 0;
rep(i, n) {
int a;
cin >> a;
if (a >= 3200)
free++;
else
colo... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
int main() {
int n;
cin >> n;
bool color[8] = {};
int free = 0;
rep(i, n) {
int a;
cin >> a;
if (a >= 3200)
free++;
else
colo... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 1,366,906 | 1,366,908 | u214304095 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int color_box[9];
int main() {
int n, hoge, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> hoge;
for (int j = 1; j < 10; j++) {
if (j == 9) {
color_box[j - 1]++;
break;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int color_box[9];
int main() {
int n, hoge, ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> hoge;
for (int j = 1; j < 10; j++) {
if (j == 9) {
color_box[j - 1]++;
break;
... | [
"call.remove",
"call.arguments.change"
] | 1,366,911 | 1,366,912 | u952437626 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
// g++ -std=c++14 -O3 -fsyntax-only -o main main.cpp
using ll = long long int;
const int MOD = 1e9 + 7;
#define MAX(a, b) ((a > b) ? a : b)
#define MIN(a, b) ((a > b) ? b : a)
template <class T> class my_array {
private:
int n;
vector<T> A;
public:
my_array(int k... | #include <bits/stdc++.h>
using namespace std;
// g++ -std=c++14 -O3 -fsyntax-only -o main main.cpp
using ll = long long int;
const int MOD = 1e9 + 7;
#define MAX(a, b) ((a > b) ? a : b)
#define MIN(a, b) ((a > b) ? b : a)
template <class T> class my_array {
private:
int n;
vector<T> A;
public:
my_array(int k... | [
"identifier.change",
"io.output.change"
] | 1,366,923 | 1,366,924 | u394853232 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int k[10], t, N, a;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
if (1 <= a && a <= 399)
k[0]++;
else if (400 <= a && a <= 799)
k[1]++;
else if (800 <= a && a <= 1199)
k[2]++;
else if (1200 <= a && a <= 1599)
... | #include <bits/stdc++.h>
using namespace std;
int k[10], t, N, a;
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
if (1 <= a && a <= 399)
k[0]++;
else if (400 <= a && a <= 799)
k[1]++;
else if (800 <= a && a <= 1199)
k[2]++;
else if (1200 <= a && a <= 1599)
... | [
"call.remove",
"call.arguments.change"
] | 1,366,939 | 1,366,940 | u211018720 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define mp... | [
"call.add",
"call.arguments.change"
] | 1,366,941 | 1,366,942 | u745250049 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define int long long
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define int long long
#define rep(i, a, n) for (int(i) = (a); (i) < (n); (i)++)... | [
"call.add",
"call.arguments.add"
] | 1,366,951 | 1,366,952 | u811004127 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int col[9];
rep(i, 9) col[i] = 0;
int n;
cin >> n;
rep(i, n) {
int t;
cin >> t;
if (t >= 3200)
col[8]++;
else
col[t / 400]++;
}
int ans = 0, ansmax, ansmin;
rep(i, 8) i... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int col[9];
rep(i, 9) col[i] = 0;
int n;
cin >> n;
rep(i, n) {
int t;
cin >> t;
if (t >= 3200)
col[8]++;
else
col[t / 400]++;
}
int ans = 0, ansmax, ansmin;
rep(i, 8) i... | [
"call.remove",
"call.arguments.change"
] | 1,366,953 | 1,366,954 | u174404613 | cpp |
p03695 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, b[10] = {0}, cnt = 0, i, x = 0;
cin >> n;
for (i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 3200) {
b[a / 400] = 1;
} else {
cnt++;
}
}
for (i = 0; i < 10; i++) {
if (b[i]) {
x++;
... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n, b[10] = {0}, cnt = 0, i, x = 0;
cin >> n;
for (i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 3200) {
b[a / 400] = 1;
} else {
cnt++;
}
}
for (i = 0; i < 10; i++) {
if (b[i]) {
x++;
... | [
"call.remove",
"call.arguments.change"
] | 1,366,959 | 1,366,960 | u621509943 | cpp |
p03695 | #include <bits/stdc++.h>
// statics
using namespace std;
using int64 = long long;
using PAIR = pair<int, int>;
constexpr int INF = 1 << 30;
constexpr int64 LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 1e5 + 1;
// init/input
#define int int64
#define INIT ... | #include <bits/stdc++.h>
// statics
using namespace std;
using int64 = long long;
using PAIR = pair<int, int>;
constexpr int INF = 1 << 30;
constexpr int64 LINF = 1LL << 60;
constexpr int MOD = 1e9 + 7;
constexpr int MAX_N = 1e5 + 1;
// init/input
#define int int64
#define INIT ... | [
"call.remove",
"call.arguments.change"
] | 1,366,963 | 1,366,964 | u258009780 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define EACH(i, a) for (auto &i : a)
#define FOR(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RFOR(i, a, b) for (int i = (int)b - 1; i >= (int)a; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define d... | #include <bits/stdc++.h>
using namespace std;
#define EACH(i, a) for (auto &i : a)
#define FOR(i, a, b) for (int i = (int)a; i < (int)b; ++i)
#define RFOR(i, a, b) for (int i = (int)b - 1; i >= (int)a; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define d... | [
"call.remove",
"call.arguments.change"
] | 1,366,965 | 1,366,966 | u258009780 | cpp |
p03695 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
... | [
"call.arguments.change"
] | 1,366,969 | 1,366,970 | u548624367 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <vector>
#define REP(i, n) for (long(i) = 0; (i) < (n); (i)++)
#define REPI(i, a, b) for (long(i) = (a); (i) < (b); (i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
usi... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <vector>
#define REP(i, n) for (long(i) = 0; (i) < (n); (i)++)
#define REPI(i, a, b) for (long(i) = (a); (i) < (b); (i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
usi... | [
"call.add",
"call.arguments.change"
] | 1,366,971 | 1,366,972 | u210718367 | cpp |
p03695 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define lint long long
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, ... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
#define lint long long
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, ... | [
"call.remove",
"call.arguments.change"
] | 1,366,973 | 1,366,974 | u895641117 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<bool> v(8);
int col[] = {1, 399, 400, 799, 800, 1199, 1200, 1599, 1600,
1999, 2000, 2399, 2400, 2799, 2800, 3199, 3200};
int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<bool> v(8);
int col[] = {1, 399, 400, 799, 800, 1199, 1200, 1599, 1600,
1999, 2000, 2399, 2400, 2799, 2800, 3199, 3200};
int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,366,975 | 1,366,976 | u817760251 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<bool> v(8);
int col[] = {1, 399, 400, 799, 800, 1199, 1200, 1599, 1600,
1999, 2000, 2399, 2400, 2799, 2800, 3199, 3200};
int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
vector<bool> v(8);
int col[] = {1, 399, 400, 799, 800, 1199, 1200, 1599, 1600,
1999, 2000, 2399, 2400, 2799, 2800, 3199, 3200};
int s = 0;
for (int i = 0; i < n; i++) {
cin >> a[i];
... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,366,977 | 1,366,976 | u817760251 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | [
"call.add",
"call.arguments.change"
] | 1,366,978 | 1,366,979 | u472675932 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i, a, b) for (... | [
"call.remove",
"call.arguments.change"
] | 1,366,980 | 1,366,979 | u472675932 | cpp |
p03695 | #include <bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef int32_t i32;
typedef uint32_t u32;
typedef int64_t i64;
typedef uint64_t u64;
typedef pair<int, int> pii;
typedef pair<i64, int> pli;
typedef pair<int, i64> pil;
typedef pair<i64, i64> pll;
typedef vector<int> vi;
typedef vector<i64> vl;
tem... | #include <bits/stdc++.h>
#define mp make_pair
using namespace std;
typedef int32_t i32;
typedef uint32_t u32;
typedef int64_t i64;
typedef uint64_t u64;
typedef pair<int, int> pii;
typedef pair<i64, int> pli;
typedef pair<int, i64> pil;
typedef pair<i64, i64> pll;
typedef vector<int> vi;
typedef vector<i64> vl;
tem... | [
"call.remove",
"call.arguments.change"
] | 1,366,981 | 1,366,982 | u806601169 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
bool flg[9];
int ans1 = 0, ans2 = 0, cnt = 0;
for (int i = 0; i < 9; i++)
flg[i] = false;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] <= 399)
flg[0] = true;
else if (a[i] <= 799)
flg[... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
bool flg[9];
int ans1 = 0, ans2 = 0, cnt = 0;
for (int i = 0; i < 9; i++)
flg[i] = false;
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] <= 399)
flg[0] = true;
else if (a[i] <= 799)
flg[... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 1,366,983 | 1,366,984 | u633967774 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define inf 1 << 30
#define pqueue priority_queue
#define mp make_pair
#define pb push_back
#define fn fill_n
typedef long long llong;
typedef unsigned long long ullong;
typedef pair<int, int> P;
int main() {
int N;
int rate[9] = {};
cin >> N;
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
#define inf 1 << 30
#define pqueue priority_queue
#define mp make_pair
#define pb push_back
#define fn fill_n
typedef long long llong;
typedef unsigned long long ullong;
typedef pair<int, int> P;
int main() {
int N;
int rate[9] = {};
cin >> N;
for (int i = 0; i <... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,366,987 | 1,366,988 | u341957179 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define inf 1 << 30
#define pqueue priority_queue
#define mp make_pair
#define pb push_back
#define fn fill_n
typedef long long llong;
typedef unsigned long long ullong;
typedef pair<int, int> P;
int main() {
int N;
int rate[9] = {};
cin >> N;
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
#define inf 1 << 30
#define pqueue priority_queue
#define mp make_pair
#define pb push_back
#define fn fill_n
typedef long long llong;
typedef unsigned long long ullong;
typedef pair<int, int> P;
int main() {
int N;
int rate[9] = {};
cin >> N;
for (int i = 0; i <... | [
"call.add",
"call.arguments.change",
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,366,989 | 1,366,988 | u341957179 | cpp |
p03695 | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i) = (n)-1, (i) >= 0; (i)--)
#define ios() cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
ll const MOD = 1e9 + 7;
ll const INF = ... | #include <bits/stdc++.h>
#define all(a) (a).begin(), (a).end()
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define RREP(i, n) for (int(i) = (n)-1, (i) >= 0; (i)--)
#define ios() cin.tie(0), ios::sync_with_stdio(false)
typedef long long ll;
typedef unsigned long long ull;
ll const MOD = 1e9 + 7;
ll const INF = ... | [
"call.add",
"call.arguments.change"
] | 1,366,990 | 1,366,991 | u994831328 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
... | [
"call.remove",
"call.arguments.change"
] | 1,366,999 | 1,367,000 | u618649215 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#de... | [
"call.add",
"call.arguments.add"
] | 1,367,001 | 1,367,002 | u355254193 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#de... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#de... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,367,003 | 1,367,004 | u355254193 | cpp |
p03695 | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#... | #include <algorithm>
#include <cassert>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#... | [
"call.add",
"call.arguments.add"
] | 1,367,009 | 1,367,010 | u628047647 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
vector<bool> b(8, false);
int count = 0;
for (int i = 0; i < N; i++) {
if (a.at(i) < 400)
b.at(0) = true;
else if (a.at(i) < 800)
b.at(1)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a.at(i);
}
vector<bool> b(8, false);
int count = 0;
for (int i = 0; i < N; i++) {
if (a.at(i) < 400)
b.at(0) = true;
else if (a.at(i) < 800)
b.at(1)... | [
"call.add",
"call.arguments.add"
] | 1,367,025 | 1,367,026 | u774261627 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, t) for (int i = 0; i < t; i++)
int main() {
int rates[9] = {0}, N, a, ans;
cin >> N;
REP(i, N) cin >> a, a < 3200 ? rates[a / 400]++ : rates[8]++;
ans = count_if(&rates[0], &rates[8], [](int x) { return 0 < x; });
cout << ans + bool(rates[8]) << " ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, t) for (int i = 0; i < t; i++)
int main() {
int rates[9] = {0}, N, a, ans;
cin >> N;
REP(i, N) cin >> a, a < 3200 ? rates[a / 400]++ : rates[8]++;
ans = count_if(&rates[0], &rates[8], [](int x) { return 0 < x; });
cout << ans + bool(rates[8]) * !bo... | [
"expression.operation.binary.add"
] | 1,367,027 | 1,367,028 | u977855674 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define rrep(i, a) for (int i = a; i >= 0; i--)
#define loop3(i, j, k, a) ... | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <vector>
using namespace std;
#define rep(i, a) for (int i = 0; i < a; i++)
#define rrep(i, a) for (int i = a; i >= 0; i--)
#define loop3(i, j, k, a) ... | [
"call.remove",
"call.arguments.change"
] | 1,367,037 | 1,367,038 | u415041731 | cpp |
p03695 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#de... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <time.h>
#include <tuple>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < b; i++)
#de... | [
"call.remove",
"call.arguments.change"
] | 1,367,039 | 1,367,040 | u243196226 | cpp |
p03695 | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
//#include<deque>
#include <iomanip>
#include <map>
#include <set>
#include <tuple>
using namespace ... | // inlclude before define
#define _USE_MATH_DEFINES
// include
#include <algorithm>
#include <assert.h>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <type_traits>
#include <vector>
//#include<deque>
#include <iomanip>
#include <map>
#include <set>
#include <tuple>
using namespace ... | [
"call.arguments.add",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 1,367,042 | 1,367,043 | u226951654 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define itrfor(itr, A) for (auto itr = A.begin(); itr != A.end(); itr++)
typedef int64_t llong;
char moji[26] = {'a', 'b', 'c', 'd'... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define itrfor(itr, A) for (auto itr = A.begin(); itr != A.end(); itr++)
typedef int64_t llong;
char moji[26] = {'a', 'b', 'c', 'd'... | [
"call.add",
"call.arguments.change"
] | 1,367,052 | 1,367,053 | u920299620 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int n;
int color[8] = {};
int cnt = 0;
int ans = 0;
int x;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x >= 3200) {
cnt++;
} else if (color[x / 400] == 0) {
ans++;
color[x / 400] = 1;
}
}
if (ans == 0) {
... | #include <iostream>
using namespace std;
int main() {
int n;
int color[8] = {};
int cnt = 0;
int ans = 0;
int x;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> x;
if (x >= 3200) {
cnt++;
} else if (color[x / 400] == 0) {
ans++;
color[x / 400] = 1;
}
}
if (ans == 0) {
... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,367,070 | 1,367,071 | u376082984 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; ... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
#define rrep(i, n) for (int i = n - 1; i >= 0; --i)
#define yesno(flg) \
if (flg) { \
cout << "YES" << endl; ... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,367,074 | 1,367,075 | u591824072 | cpp |
p03695 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,367,078 | 1,367,079 | u874996917 | cpp |
p03695 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#inclu... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"io.output.change"
] | 1,367,080 | 1,367,079 | u874996917 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
typedef long long ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin ... | [
"call.remove",
"call.arguments.change"
] | 1,367,085 | 1,367,086 | u904097134 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
signed main() {
long long i = 0, j = 0, k = 0, ans = 0;
long long n, a[200], color[9] = {0};
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 3200)
color[a[i] / 400]++;
else
color[8]++;
}
for (i = 0; i < 8; i++) {
if (co... | #include <bits/stdc++.h>
using namespace std;
signed main() {
long long i = 0, j = 0, k = 0, ans = 0;
long long n, a[200], color[9] = {0};
cin >> n;
for (i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 3200)
color[a[i] / 400]++;
else
color[8]++;
}
for (i = 0; i < 8; i++) {
if (co... | [
"call.remove",
"call.arguments.change"
] | 1,367,088 | 1,367,089 | u932175579 | cpp |
p03695 | #include "bits/stdc++.h"
#include <iostream>
using namespace std;
#define print(x) cout << x << endl;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a) for (int i = 0; i < a; i++)
#define jkl int debug = 0;
#define RREP(i, a) for (int i = a - 1; i >= 0; i--)
#define rrep(i, a, b) for (int i = a - 1; i ... | #include "bits/stdc++.h"
#include <iostream>
using namespace std;
#define print(x) cout << x << endl;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a) for (int i = 0; i < a; i++)
#define jkl int debug = 0;
#define RREP(i, a) for (int i = a - 1; i >= 0; i--)
#define rrep(i, a, b) for (int i = a - 1; i ... | [
"call.add",
"call.arguments.add"
] | 1,367,090 | 1,367,091 | u009275459 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
bool color[8] = {};
int high_rate = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 3200) {
color[a / 400] = true;
} else {
high_rate++;
}
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
bool color[8] = {};
int high_rate = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 3200) {
color[a / 400] = true;
} else {
high_rate++;
}
... | [
"call.remove",
"call.arguments.change"
] | 1,367,109 | 1,367,110 | u118797367 | cpp |
p03695 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define ll long long
#define int ll
#define INF (1LL << 60)
#define mod 1000... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> P;
#define ll long long
#define int ll
#define INF (1LL << 60)
#define mod 1000... | [
"call.remove",
"call.arguments.change"
] | 1,367,116 | 1,367,117 | u592610268 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int N;
int a[110];
int b[9];
for (int i = 0; i < 9; ++i) {
b[i] = 0;
}
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> a[i];
for (int j = 0; j < 8; ++j) {
if (j * 400 <= a[i] && a[i] < (j + 1) * 400)
b[j]++;
}
if (3200 ... | #include <iostream>
using namespace std;
int main() {
int N;
int a[110];
int b[9];
for (int i = 0; i < 9; ++i) {
b[i] = 0;
}
cin >> N;
for (int i = 0; i < N; ++i) {
cin >> a[i];
for (int j = 0; j < 8; ++j) {
if (j * 400 <= a[i] && a[i] < (j + 1) * 400)
b[j]++;
}
if (3200 ... | [
"variable_declaration.type.change"
] | 1,367,121 | 1,367,122 | u406158207 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pii;
typedef pair<llint, llint> pll;
typedef vector<int> vi;
typedef vector<llint> vli;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define I cin
#define O cout
#define EN endl
#define ln cout << endl
#define pb... | #include <bits/stdc++.h>
using namespace std;
typedef long long int llint;
typedef pair<int, int> pii;
typedef pair<llint, llint> pll;
typedef vector<int> vi;
typedef vector<llint> vli;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
#define I cin
#define O cout
#define EN endl
#define ln cout << endl
#define pb... | [
"call.remove",
"call.arguments.change"
] | 1,367,123 | 1,367,124 | u966921248 | cpp |
p03695 | #include <algorithm>
#include <iostream>
using namespace std;
#define int long long
signed main() {
int rate[9];
for (int i = 0; i < 9; i++) {
rate[i] = 400 * i;
}
int count[9];
fill(count, count + 9, 0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
for (int i = 0; i ... | #include <algorithm>
#include <iostream>
using namespace std;
#define int long long
signed main() {
int rate[9];
for (int i = 0; i < 9; i++) {
rate[i] = 400 * i;
}
int count[9];
fill(count, count + 9, 0);
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
for (int i = 0; i ... | [
"call.add",
"call.arguments.change"
] | 1,367,125 | 1,367,126 | u184659204 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int color[9] = {};
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a <= 399)
color[0]++;
else if (a <= 799)
color[1]++;
else if (a <= 1199)
color[2]++;
else if (a <= 1599)
color[3]++;
el... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int color[9] = {};
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a <= 399)
color[0]++;
else if (a <= 799)
color[1]++;
else if (a <= 1199)
color[2]++;
else if (a <= 1599)
color[3]++;
el... | [
"call.remove",
"call.arguments.change"
] | 1,367,133 | 1,367,134 | u687548330 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.