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;
#define all(a) (a).begin(), (a).end()
typedef long long ll;
ll mod = 1000000007;
string s;
int main() {
int n;
cin >> n;
vector<int> v(9, 0);
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (a <= 399) {
v[0] += 1;
} else if (a >= 400 && a <=... | #include <bits/stdc++.h>
using namespace std;
#define all(a) (a).begin(), (a).end()
typedef long long ll;
ll mod = 1000000007;
string s;
int main() {
int n;
cin >> n;
vector<int> v(9, 0);
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (a <= 399) {
v[0] += 1;
} else if (a >= 400 && a <=... | [
"call.remove",
"call.arguments.change"
] | 1,366,254 | 1,366,255 | u960687982 | cpp |
p03695 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> M;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
a = a / 400;
M[a]++;
}
int min = 0;
for (int i = 0; i < 8; i++) {
if (M[i] != 0) {
min++;
}
}
int ... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
map<int, int> M;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
a = a / 400;
M[a]++;
}
int min = 0;
for (int i = 0; i < 8; i++) {
if (M[i] != 0) {
min++;
}
}
int ... | [
"misc.opposites",
"assignment.variable.change",
"identifier.change",
"literal.number.change",
"assignment.value.change"
] | 1,366,256 | 1,366,257 | u280096880 | cpp |
p03695 | // includes
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
// macros an... | // includes
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
// macros an... | [
"call.remove",
"call.arguments.change"
] | 1,366,268 | 1,366,269 | u193690465 | cpp |
p03695 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
const int MOD = 100... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
const int MOD = 100... | [
"call.add",
"call.arguments.add"
] | 1,366,272 | 1,366,273 | u755589905 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> S(9);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 400)
S[0] = 1;
else if (a < 800)
S[1] = 1;
else if (a < 1200)
S[2] = 1;
else if (a < 1600)
S[3] = 1;
else if ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> S(9);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 400)
S[0] = 1;
else if (a < 800)
S[1] = 1;
else if (a < 1200)
S[2] = 1;
else if (a < 1600)
S[3] = 1;
else if ... | [
"call.remove",
"call.arguments.change"
] | 1,366,278 | 1,366,279 | u133391510 | cpp |
p03695 | #include <algorithm>
#include <array>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Rep(i, a, b) for (int i = a; i < b; i++... | #include <algorithm>
#include <array>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define Rep(i, a, b) for (int i = a; i < b; i++... | [
"call.remove",
"call.arguments.change"
] | 1,366,285 | 1,366,286 | u725458677 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
auto cnt = vector<int>(9);
for (auto i = 0; i < n; ++i) {
int a;
cin >> a;
if (a < 400)
++cnt[0];
else if (a < 800)
++cnt[1];
else if (a < 1200)
++cnt[2];
else... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
auto cnt = vector<int>(9);
for (auto i = 0; i < n; ++i) {
int a;
cin >> a;
if (a < 400)
++cnt[0];
else if (a < 800)
++cnt[1];
else if (a < 1200)
++cnt[2];
else... | [
"call.remove",
"call.arguments.change"
] | 1,366,287 | 1,366,288 | u338550320 | cpp |
p03695 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int count[9] = {0};
for (int i = 0; i < n; i++) {
int t = min(8, a[i] / 400);
count[t]++;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (cou... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++)
cin >> a[i];
int count[9] = {0};
for (int i = 0; i < n; i++) {
int t = min(8, a[i] / 400);
count[t]++;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (cou... | [
"call.add",
"call.arguments.add"
] | 1,366,289 | 1,366,290 | u179970156 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cont = 0, max = 0, min = 0, ex = 0;
int a[200];
cin >> N;
for (int t = 0; t < N; t++)
cin >> a[t];
bool co[30];
fill(co, co + 30, false);
for (int t = 0; t < N; t++) {
if ((a[t] / 400) >= 8) {
ex++;
continue;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, cont = 0, max = 0, min = 0, ex = 0;
int a[200];
cin >> N;
for (int t = 0; t < N; t++)
cin >> a[t];
bool co[30];
fill(co, co + 30, false);
for (int t = 0; t < N; t++) {
if ((a[t] / 400) >= 8) {
ex++;
continue;
}
... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,366,299 | 1,366,300 | u876978301 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
/* メモリ食い過ぎ注意 */
#define int long long
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
gcd(b, a);
if (b == 0)
return a;
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
/* define const */
const ll INF = (1ll << 60);
const ll MOD ... | #include <bits/stdc++.h>
using namespace std;
/* メモリ食い過ぎ注意 */
#define int long long
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
gcd(b, a);
if (b == 0)
return a;
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
/* define const */
const ll INF = (1ll << 60);
const ll MOD ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 1,366,301 | 1,366,302 | u218759384 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
/* メモリ食い過ぎ注意 */
#define int long long
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
gcd(b, a);
if (b == 0)
return a;
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
/* define const */
const ll INF = (1ll << 60);
const ll MOD ... | #include <bits/stdc++.h>
using namespace std;
/* メモリ食い過ぎ注意 */
#define int long long
typedef long long ll;
ll gcd(ll a, ll b) {
if (a < b)
gcd(b, a);
if (b == 0)
return a;
int r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
/* define const */
const ll INF = (1ll << 60);
const ll MOD ... | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 1,366,301 | 1,366,303 | u218759384 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a;
cin >> N;
vector<int> num(9, 0);
for (int i = 0; i < N; i++) {
cin >> a;
num[min(a / 400, 8)]++;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (num[i] != 0) {
ans++;
}
}
cout << ans << ' ' << ans + num[8] << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, a;
cin >> N;
vector<int> num(9, 0);
for (int i = 0; i < N; i++) {
cin >> a;
num[min(a / 400, 8)]++;
}
int ans = 0;
for (int i = 0; i < 8; i++) {
if (num[i] != 0) {
ans++;
}
}
cout << max(ans, 1) << ' ' << ans + nu... | [
"call.add",
"call.arguments.add"
] | 1,366,308 | 1,366,309 | u912534104 | cpp |
p03695 | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | #ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#includ... | [
"call.remove",
"call.arguments.change"
] | 1,366,312 | 1,366,313 | u900727536 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdlib.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a... | [
"call.add",
"call.arguments.change"
] | 1,366,314 | 1,366,315 | u227379863 | cpp |
p03695 | // {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <u... | // {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <u... | [
"literal.string.change",
"literal.string.case.change",
"variable_access.subscript.index.change"
] | 1,366,316 | 1,366,317 | u186294233 | cpp |
p03695 | // {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <u... | // {{{
#include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <u... | [
"literal.string.change",
"literal.string.case.change",
"variable_access.subscript.index.change"
] | 1,366,318 | 1,366,317 | u186294233 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> color(8);
int more = 0;
int val;
for (int i = 0; i < n; i++) {
cin >> val;
val = val / 400;
if (val < 8)
color[val] = 1;
if ... | #include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> color(8);
int more = 0;
int val;
for (int i = 0; i < n; i++) {
cin >> val;
val = val / 400;
if (val < 8)
color[val] = 1;
if ... | [
"call.arguments.change"
] | 1,366,319 | 1,366,320 | u412550879 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
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;
}
return false... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); ++i)
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;
}
return false... | [
"call.remove",
"call.arguments.change"
] | 1,366,328 | 1,366,329 | u843175622 | cpp |
p03695 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define lol long long
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<bool> T(8, false);
int T1 = 0;
int T2 = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define lol long long
int main() {
int N;
cin >> N;
vector<int> a(N);
vector<bool> T(8, false);
int T1 = 0;
int T2 = 0;
for (int i = 0; i < N; i++) {
cin >> a[i];
... | [
"call.add",
"call.arguments.add"
] | 1,366,330 | 1,366,331 | u086366728 | cpp |
p03695 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
... | [
"call.add",
"call.arguments.change"
] | 1,366,335 | 1,366,336 | u407614884 | cpp |
p03695 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"call.add",
"call.arguments.change"
] | 1,366,337 | 1,366,336 | u407614884 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
template <class T> inline T gcd(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, n) for (int i = 0; i < n; i++)
template <class T> inline T gcd(T a, T b) {
T c;
while (b != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
} else {
... | [
"call.remove",
"call.arguments.change"
] | 1,366,338 | 1,366,339 | u962104148 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define ll long long
#define P pair<int, int>
#define FOR(i, N) for (int i = 0; i < (int)N; i++... | [
"call.remove",
"call.arguments.change"
] | 1,366,340 | 1,366,341 | u656771711 | cpp |
p03695 | /*include*/
#include <bits/stdc++.h>
/*alias*/
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
using ll = long long;
using namespace std;
/*input*/
int n;
int a[101];
/*funcs*/
/*main*/
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int c... | /*include*/
#include <bits/stdc++.h>
/*alias*/
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end()
using ll = long long;
using namespace std;
/*input*/
int n;
int a[101];
/*funcs*/
/*main*/
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
int c... | [
"literal.number.change",
"assignment.value.change"
] | 1,366,342 | 1,366,343 | u629194491 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,366,344 | 1,366,345 | u846813901 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,366,346 | 1,366,345 | u846813901 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repb(i, n) for (int i = (int)n; i >= 0; i--)
#define reps(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define repsb(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v... | [
"literal.number.change",
"call.arguments.change",
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,366,347 | 1,366,345 | u846813901 | cpp |
p03695 | #include <iostream>
using namespace std;
int main(void) {
int n;
int a[101];
int flag[9] = {};
int count = 0;
int maxi, mini;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
if (a[i] / 400 >= 8) {
flag[8]++;
} else {
flag[a[i] / 400]++;... | #include <iostream>
using namespace std;
int main(void) {
int n;
int a[101];
int flag[9] = {};
int count = 0;
int maxi, mini;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
if (a[i] / 400 >= 8) {
flag[8]++;
} else {
flag[a[i] / 400]++;... | [
"call.add",
"call.arguments.change"
] | 1,366,348 | 1,366,349 | u057611820 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int fr = 0;
int cnt[10];
memset(cnt, 0, sizeof(cnt));
int cc = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a >=... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int fr = 0;
int cnt[10];
memset(cnt, 0, sizeof(cnt));
int cc = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a >=... | [
"call.remove",
"call.arguments.change"
] | 1,366,350 | 1,366,351 | u140450365 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
int mi = 0;
int mx = 0;
vector<int> arr(9, 0);
int cur;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> cur;
if (cur >= 1 && cur <= 399 && arr[0] == 0) {
arr[0]++;
sum++;
}
... | #include <bits/stdc++.h>
using namespace std;
int main(int argc, char *argv[]) {
int N;
cin >> N;
int mi = 0;
int mx = 0;
vector<int> arr(9, 0);
int cur;
int sum = 0;
for (int i = 0; i < N; i++) {
cin >> cur;
if (cur >= 1 && cur <= 399 && arr[0] == 0) {
arr[0]++;
sum++;
}
... | [
"call.remove",
"call.arguments.change"
] | 1,366,356 | 1,366,357 | u725109307 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], c[8] = {}, pro = 0, count = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
if (a[i] >= 3200) {
pro++;
} else {
c[a[i] / 400]++;
}
}
for (int i = 0; i < 8; ++i)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n], c[8] = {}, pro = 0, count = 0;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
for (int i = 0; i < n; ++i) {
if (a[i] >= 3200) {
pro++;
} else {
c[a[i] / 400]++;
}
}
for (int i = 0; i < 8; ++i)... | [
"call.add",
"call.arguments.change"
] | 1,366,358 | 1,366,359 | u010344022 | cpp |
p03695 | #include <iostream>
#include <set>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "1 1" << endl;
} else {
set<int> st;
int tmp, over_red = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (tmp >= 3200) {
over_red++;
} else {
st.insert(... | #include <iostream>
#include <set>
using namespace std;
int main() {
int n;
cin >> n;
if (n == 1) {
cout << "1 1" << endl;
} else {
set<int> st;
int tmp, over_red = 0;
for (int i = 0; i < n; i++) {
cin >> tmp;
if (tmp >= 3200) {
over_red++;
} else {
st.insert(... | [
"call.remove",
"call.arguments.change"
] | 1,366,360 | 1,366,361 | u039805629 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 2e9;
int clr[10];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200) {
clr[8]++;
continue;
}
for (int j = 1; j <= 8; j++) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int INF = 2e9;
int clr[10];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200) {
clr[8]++;
continue;
}
for (int j = 1; j <= 8; j++) {
... | [
"call.add",
"call.arguments.change"
] | 1,366,364 | 1,366,365 | u708258059 | cpp |
p03695 |
#include <bits/stdc++.h>
using namespace std;
#define mod 1e+9
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[n], color[9];
memset(color, 0, sizeof(color));
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 400) {
color[0]++;
} else if (a[i] < 800) {
color[1]++;
} el... |
#include <bits/stdc++.h>
using namespace std;
#define mod 1e+9
typedef long long ll;
int main() {
ll n;
cin >> n;
ll a[n], color[9];
memset(color, 0, sizeof(color));
for (int i = 0; i < n; i++) {
cin >> a[i];
if (a[i] < 400) {
color[0]++;
} else if (a[i] < 800) {
color[1]++;
} el... | [
"expression.operation.binary.remove"
] | 1,366,371 | 1,366,372 | u876784108 | cpp |
p03695 | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (n); i++)
#define For(i, n1, n2) for (int i = (n1); i < (n2); i++)
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n - 1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (n1); i < (n2); i++)
#define put(... | #include "bits/stdc++.h"
using namespace std;
#define Rep(i, n) for (int i = 0; i < (n); i++)
#define For(i, n1, n2) for (int i = (n1); i < (n2); i++)
#define REP(i, n) for (ll i = 0; i < (n); i++)
#define RREP(i, n) for (ll i = (n - 1); i >= 0; i--)
#define FOR(i, n1, n2) for (ll i = (n1); i < (n2); i++)
#define put(... | [
"call.add",
"call.arguments.change"
] | 1,366,373 | 1,366,374 | u030685402 | cpp |
p03695 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int i = (m); (i) < (n); (i)++)
typedef long long ll;
int mai... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int i = (m); (i) < (n); (i)++)
typedef long long ll;
int mai... | [
"call.remove",
"call.arguments.change"
] | 1,366,378 | 1,366,379 | u917282863 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef vector<pair<ll, ll>> Q;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n... | [
"call.remove",
"call.arguments.change"
] | 1,366,382 | 1,366,383 | u620242073 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int b[9]{};
for (int i : a) {
int idx = i / 400;
if (idx >= 8) {
idx = 8;
b[idx]++;
} else {
b[... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int a[N];
for (int i = 0; i < N; i++) {
cin >> a[i];
}
int b[9]{};
for (int i : a) {
int idx = i / 400;
if (idx >= 8) {
idx = 8;
b[idx]++;
} else {
b[... | [
"call.remove",
"call.arguments.change"
] | 1,366,388 | 1,366,389 | u634209474 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <set>
#include <sstream>
#include <string>
#include <unordered_set>
#include <vector>
using na... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <set>
#include <sstream>
#include <string>
#include <unordered_set>
#include <vector>
using na... | [
"call.remove",
"call.arguments.change"
] | 1,366,395 | 1,366,396 | u385617244 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, r = 0;
cin >> n;
map<int, int> m;
for (int i = 0; i < n; ++i) {
cin >> c;
if ((c /= 400) >= 8)
r++;
else
m[c]++;
}
cout << max((int)m.size(), r) << " " << m.size() + r << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, c, r = 0;
cin >> n;
map<int, int> m;
for (int i = 0; i < n; ++i) {
cin >> c;
if ((c /= 400) >= 8)
r++;
else
m[c]++;
}
cout << max((int)m.size(), 1) << " " << m.size() + r << endl;
return 0;
} | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,366,397 | 1,366,398 | u756659922 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int Free = 0;
set<int> st;
int main() {
// cout.precision(10);
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 3200) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
int Free = 0;
set<int> st;
int main() {
// cout.precision(10);
int N;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 3200) {... | [
"call.remove",
"call.arguments.change"
] | 1,366,402 | 1,366,403 | u980655160 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define REP_REV(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define REPN_REV(i, m, n) for (int(i) = (int)(n)-1; (i) >= m; --(i))
#define INF 2e9
#d... | [
"literal.string.change",
"io.output.change"
] | 1,366,409 | 1,366,410 | u127768253 | cpp |
p03695 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#defin... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#defin... | [
"call.add",
"call.arguments.add"
] | 1,366,411 | 1,366,412 | u340293807 | 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 vector<int> vi;
int main() {
int color[8];
int any = 0;
rep(i, 8) { color[i] = 0; }
int n;
cin >> n;
vi a(n);
rep(i, n) { cin >> a[i]; }
rep(i, n) {
if (a[i] >= 3200)
a... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
int main() {
int color[8];
int any = 0;
rep(i, 8) { color[i] = 0; }
int n;
cin >> n;
vi a(n);
rep(i, n) { cin >> a[i]; }
rep(i, n) {
if (a[i] >= 3200)
a... | [
"call.remove",
"call.arguments.change"
] | 1,366,415 | 1,366,416 | u814715203 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
using namespace std;
int n, a[105], ans = 0, red = 0, t[105];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] >= 3200)
red++;
else
t[a[i] / 400] = 1;
}
for (int i = 0; i < 8; i++)
if (t[i])
ans++;
... | #include <algorithm>
#include <cstdio>
using namespace std;
int n, a[105], ans = 0, red = 0, t[105];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] >= 3200)
red++;
else
t[a[i] / 400] = 1;
}
for (int i = 0; i < 8; i++)
if (t[i])
ans++;
... | [
"call.add",
"call.arguments.add"
] | 1,366,419 | 1,366,420 | u734549230 | cpp |
p03695 | #include <bits/stdc++.h>
#include <bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for (int i = st; i < ed; i++)
#define repn(i, st, ed) for (int i = st; i <= ed; i++)
#define repb(i, ed, st) for (int i = ed; i >= st; i--)
typedef long lo... | #include <bits/stdc++.h>
#include <bitset>
using namespace std;
#define M 1000000007
#define pb push_back
#define f first
#define s second
#define rep(i, st, ed) for (int i = st; i < ed; i++)
#define repn(i, st, ed) for (int i = st; i <= ed; i++)
#define repb(i, ed, st) for (int i = ed; i >= st; i--)
typedef long lo... | [] | 1,366,421 | 1,366,422 | u230147738 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
int arb = 0;
bool color[8] = {};
rep(i, n) {
int a;
cin >> a;
if (a < 400)
color[0] = true;
else if (a < 800)
color[1] = true;
else if (a < 1200)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
int main() {
int n;
cin >> n;
int arb = 0;
bool color[8] = {};
rep(i, n) {
int a;
cin >> a;
if (a < 400)
color[0] = true;
else if (a < 800)
color[1] = true;
else if (a < 1200)
... | [
"call.add",
"call.arguments.add"
] | 1,366,423 | 1,366,424 | u781095600 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, s, e) for (int i = s; i >= e; i--)
#define reps(i, s, e) for (int i = s; i <= e; i++)
#define inf 1e18
#define all(v) v.begin(), v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, s, e) for (int i = s; i >= e; i--)
#define reps(i, s, e) for (int i = s; i <= e; i++)
#define inf 1e18
#define all(v) v.begin(), v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>... | [
"call.remove",
"call.arguments.change"
] | 1,366,435 | 1,366,436 | u026620445 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, s, e) for (int i = s; i >= e; i--)
#define reps(i, s, e) for (int i = s; i <= e; i++)
#define inf 1e18
#define all(v) v.begin(), v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repr(i, s, e) for (int i = s; i >= e; i--)
#define reps(i, s, e) for (int i = s; i <= e; i++)
#define inf 1e18
#define all(v) v.begin(), v.end()
#define vsort(v) sort(v.begin(), v.end())
#define vsortr(v) sort(v.begin(), v.end(), greater<ll>... | [
"variable_declaration.value.change",
"call.arguments.change"
] | 1,366,437 | 1,366,436 | u026620445 | cpp |
p03695 | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n, a[9], b, count = 0;
r(i, 9) a[i] = 0;
cin >> n;
r(i, n) {
cin >> b;
if (b < 3200)
a[b / 400]++;
else
a[8]++;
}
r(i, 8) if (a[i] > 0) count++;
cout <<... | #include <bits/stdc++.h>
#define r(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
using namespace std;
int main() {
int n, a[9], b, count = 0;
r(i, 9) a[i] = 0;
cin >> n;
r(i, n) {
cin >> b;
if (b < 3200)
a[b / 400]++;
else
a[8]++;
}
r(i, 8) if (a[i] > 0) count++;
cout <<... | [
"call.remove",
"call.arguments.change"
] | 1,366,446 | 1,366,447 | u192280767 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repc(i, s, n) for (int i = (s); i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1;... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repc(i, s, n) for (int i = (s); i <= (n); i++)
#define rrep(i, n) for (int i = (n)-1;... | [
"call.add",
"call.arguments.change"
] | 1,366,448 | 1,366,449 | u547448704 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for... | [
"literal.number.change",
"io.output.change"
] | 1,366,450 | 1,366,451 | u834415466 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#defin... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define loop(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#defin... | [
"expression.operation.binary.add"
] | 1,366,454 | 1,366,455 | u614063956 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define dup(x, y) (((x) + (y)-1) / (y)) //整数型のまま切り上げ演算する
#define PI 3.14159265359
typedef long long LL;
template <c... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, m, n) for (int i = m; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define dup(x, y) (((x) + (y)-1) / (y)) //整数型のまま切り上げ演算する
#define PI 3.14159265359
typedef long long LL;
template <c... | [
"call.add",
"call.arguments.add"
] | 1,366,456 | 1,366,457 | u139235669 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long int gcd(long long int a, long long int b) {
long long int tmp;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
long long int r;
r = a %... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
long long int gcd(long long int a, long long int b) {
long long int tmp;
if (a < b) {
tmp = a;
a = b;
b = tmp;
}
long long int r;
r = a %... | [
"call.remove",
"call.arguments.change"
] | 1,366,458 | 1,366,459 | u845284573 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
vector<int> a... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, a, b) for (int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define INF 2e9
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
vector<int> a... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,366,471 | 1,366,472 | u291873788 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007;
int main() {
int n;
cin >> n;
int type[9] = {};
rep(i, n) {
int rate;
cin >> rate;
rate /= 400;
if (rate >= 8)
rate = 8;
type[ra... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast")
#define rep(i, n) for (int i = 0; i < n; i++)
const long long MOD = 1000000007;
int main() {
int n;
cin >> n;
int type[9] = {};
rep(i, n) {
int rate;
cin >> rate;
rate /= 400;
if (rate >= 8)
rate = 8;
type[ra... | [
"call.remove",
"call.arguments.change"
] | 1,366,478 | 1,366,479 | u974214237 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool col[8];
int zyougen[8] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
int rnd;
void categrize_color(int rate) {
for (int i = 0; i < 8; ++i) {
if (rate < zyougen[i]) {
col[i] = true;
return;
}
}
++rnd;
return;
}
in... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
bool col[8];
int zyougen[8] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
int rnd;
void categrize_color(int rate) {
for (int i = 0; i < 8; ++i) {
if (rate < zyougen[i]) {
col[i] = true;
return;
}
}
++rnd;
return;
}
in... | [
"call.remove",
"call.arguments.change"
] | 1,366,480 | 1,366,481 | u816645498 | cpp |
p03695 | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <deque>
using namespace std;
typedef long long ll;
const int INF = 1e9 + 1;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <c... | #include <cstdio>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <deque>
using namespace std;
typedef long long ll;
const int INF = 1e9 + 1;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <c... | [
"call.remove",
"call.arguments.change"
] | 1,366,486 | 1,366,487 | u026537738 | cpp |
p03695 | #include <cstdio>
int dist[9];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
int a;
scanf("%d", &a);
if (a >= 3200)
dist[8]++;
else
dist[a / 400]++;
}
int c = 0;
for (int i = 0; i < 8; ++i) {
if (dist[i] > 0)
++c;
}
printf("%d %d\n", c, c + di... | #include <cstdio>
int dist[9];
int main() {
int n;
scanf("%d", &n);
for (int i = 0; i < n; ++i) {
int a;
scanf("%d", &a);
if (a >= 3200)
dist[8]++;
else
dist[a / 400]++;
}
int c = 0;
for (int i = 0; i < 8; ++i) {
if (dist[i] > 0)
++c;
}
printf("%d %d\n", c ? c : 1... | [] | 1,366,490 | 1,366,491 | u931819817 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, tmp, ans = 0;
cin >> N;
vector<int> a(9, 0);
for (int i = 0; i < N; i++) {
cin >> tmp;
tmp /= 400;
if (tmp >= 8)
a[8]++;
else
a[tmp] = 1;
}
for (int i = 0; i < 8; i++) {
if (a[i] == 1)
ans++;
}
cou... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, tmp, ans = 0;
cin >> N;
vector<int> a(9, 0);
for (int i = 0; i < N; i++) {
cin >> tmp;
tmp /= 400;
if (tmp >= 8)
a[8]++;
else
a[tmp] = 1;
}
for (int i = 0; i < 8; i++) {
if (a[i] == 1)
ans++;
}
co... | [
"call.remove",
"call.arguments.change"
] | 1,366,492 | 1,366,493 | u074306398 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
int flagCheck(int A[], bool flag[], int N) {
int num = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 400)
flag[0] = true;
else if (A[i] < 800 && A[i] >= 400)
flag[1] = true;
else if (A[i] < 1200 && A[i] >= 800)
flag[2] = true;
else if (A[i] < 1... | #include <algorithm>
#include <cstdio>
int flagCheck(int A[], bool flag[], int N) {
int num = 0;
for (int i = 0; i < N; i++) {
if (A[i] < 400)
flag[0] = true;
else if (A[i] < 800 && A[i] >= 400)
flag[1] = true;
else if (A[i] < 1200 && A[i] >= 800)
flag[2] = true;
else if (A[i] < 1... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,366,506 | 1,366,507 | u721269623 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
int... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vec;
typedef vector<vector<int>> mat;
int... | [
"call.remove",
"call.arguments.change"
] | 1,366,523 | 1,366,524 | u215268883 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
int a[100], v[10] = {0}, count = 0;
rep(i, n) {
cin >> a[i];
if (a[i] < 3200) {
v[(a[i]) / 400]++;
} else {
count++;
}
}
int min = 0, max;
rep(i, 8) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
int main() {
int n;
cin >> n;
int a[100], v[10] = {0}, count = 0;
rep(i, n) {
cin >> a[i];
if (a[i] < 3200) {
v[(a[i]) / 400]++;
} else {
count++;
}
}
int min = 0, max;
rep(i, 8) {
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,366,525 | 1,366,526 | u561143568 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
int sup[] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
int fre = 0;
int cnt[8] = {};
for (int _ = 0; _ < n; _++) {
int x;
cin >> x;
for (int i = 0; i <= 8; i++) {
if (i < 8 && x < sup[i]) {
cnt[i]+... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
int sup[] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
int fre = 0;
int cnt[8] = {};
for (int _ = 0; _ < n; _++) {
int x;
cin >> x;
for (int i = 0; i <= 8; i++) {
if (i < 8 && x < sup[i]) {
cnt[i]+... | [
"call.arguments.change"
] | 1,366,527 | 1,366,528 | u031986221 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
int sup[] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
int fre = 0;
int cnt[8] = {};
for (int _ = 0; _ < n; _++) {
int x;
cin >> x;
for (int i = 0; i <= 8; i++) {
if (i < 8 && x < sup[i]) {
cnt[i]+... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int n;
cin >> n;
int sup[] = {400, 800, 1200, 1600, 2000, 2400, 2800, 3200};
int fre = 0;
int cnt[8] = {};
for (int _ = 0; _ < n; _++) {
int x;
cin >> x;
for (int i = 0; i <= 8; i++) {
if (i < 8 && x < sup[i]) {
cnt[i]+... | [
"call.arguments.change"
] | 1,366,529 | 1,366,528 | u031986221 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> rate(8, 0);
int free = 0;
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (a[i] < 3200) {
if (a[i] < 40... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
vector<int> rate(8, 0);
int free = 0;
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
if (a[i] < 3200) {
if (a[i] < 40... | [
"call.remove",
"call.arguments.change"
] | 1,366,532 | 1,366,533 | u770009793 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int color[8] = {0};
int cnt = 0;
int super = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (a < 3200) {
color[a / 400]++;
if (color[a / 400] == 1)
cnt++;
} else
super++;
}
if (cnt + su... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int color[8] = {0};
int cnt = 0;
int super = 0;
for (int i = 0; i < n; ++i) {
int a;
cin >> a;
if (a < 3200) {
color[a / 400]++;
if (color[a / 400] == 1)
cnt++;
} else
super++;
}
if (cnt == 0... | [
"expression.operation.binary.remove",
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 1,366,534 | 1,366,535 | u277556971 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#d... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define reps(i, s, n) for (int i = (s), i##_len = (n); i < i##_len; i++)
#define rrep(i, n) for (int i = (n)-1; i >= 0; i--)
#define rreps(i, e, n) for (int i = (n)-1; i >= (e); i--)
#d... | [
"call.remove",
"call.arguments.change"
] | 1,366,536 | 1,366,537 | u225581241 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int INF = numeric_limits<int>::max();
const int MOD = (1e9 + 7);
int main() {
int N, cnt = 0;
cin >> N;
int C[N];
rep(i, N) {... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
const int INF = numeric_limits<int>::max();
const int MOD = (1e9 + 7);
int main() {
int N, cnt = 0;
cin >> N;
int C[N];
rep(i, N) {... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.replace.add",
"literal.replace.remove"
] | 1,366,540 | 1,366,541 | u841131859 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
bool kind[8] = {false};
int n;
cin >> n;
int tmp = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200) {
tmp++;
} else {
kind[a / 400] = true;
}
}
int ans = 0;
for (int i = 0; i < 8; i++) {
ans... | #include <bits/stdc++.h>
using namespace std;
int main() {
bool kind[8] = {false};
int n;
cin >> n;
int tmp = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200) {
tmp++;
} else {
kind[a / 400] = true;
}
}
int ans = 0;
for (int i = 0; i < 8; i++) {
ans... | [
"call.add",
"call.arguments.change"
] | 1,366,542 | 1,366,543 | u055447809 | cpp |
p03695 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using ll = long long;
int MOD = 1e9 + 7;
using namespace std;
ll GCD(ll x, ll y) {
if (y == 0) {
return x;
} else ... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using ll = long long;
int MOD = 1e9 + 7;
using namespace std;
ll GCD(ll x, ll y) {
if (y == 0) {
return x;
} else ... | [
"call.remove",
"call.arguments.change"
] | 1,366,546 | 1,366,547 | u759162415 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
bool a[10];
int n, x, ans, temp;
int main() {
scanf("%d", &n);
while (n--) {
scanf("%d", &x);
if (x < 400 && !a[1])
a[1] = true, ans++;
if (x >= 400 && x < 800 && !a[2])
a[2] = true, ans++;
if (x >= 800 && x < 1200 && !a[3])
a[3] = tr... | #include <bits/stdc++.h>
using namespace std;
bool a[10];
int n, x, ans, temp;
int main() {
scanf("%d", &n);
while (n--) {
scanf("%d", &x);
if (x < 400 && !a[1])
a[1] = true, ans++;
if (x >= 400 && x < 800 && !a[2])
a[2] = true, ans++;
if (x >= 800 && x < 1200 && !a[3])
a[3] = tr... | [
"call.add",
"call.arguments.add"
] | 1,366,570 | 1,366,571 | u622572344 | cpp |
p03695 | // c++include
#include <algorithm>
#include <iostream>
// cinclude
#include <math.h>
#include <stdio.h>
#include <string.h>
// c++標準ライブラリ
#include <string>
#include <vector>
// std使用<-namespace
using namespace std;
// define, typedef
#define rpt(i, n) for (ll i = 0; i < (n); i++)
typedef long long ll;
int score(int e... | // c++include
#include <algorithm>
#include <iostream>
// cinclude
#include <math.h>
#include <stdio.h>
#include <string.h>
// c++標準ライブラリ
#include <string>
#include <vector>
// std使用<-namespace
using namespace std;
// define, typedef
#define rpt(i, n) for (ll i = 0; i < (n); i++)
typedef long long ll;
int score(int e... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,366,576 | 1,366,577 | u991152356 | cpp |
p03695 | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, i, ovr = 0, rate, mi = 0;
cin >> n;
vector<int> a(8, 0);
for (i = 0; i < n; i++) {
cin >> rate;
if (rate / 400 >= 8)
ovr++;
else {
if (a.at(rate / 400) == 0)
a.at(rate / 400) = 1;
}
}
for (i = 0; i < 8; i+... | #include "bits/stdc++.h"
using namespace std;
int main() {
int n, i, ovr = 0, rate, mi = 0;
cin >> n;
vector<int> a(8, 0);
for (i = 0; i < n; i++) {
cin >> rate;
if (rate / 400 >= 8)
ovr++;
else {
if (a.at(rate / 400) == 0)
a.at(rate / 400) = 1;
}
}
for (i = 0; i < 8; i+... | [
"call.add",
"call.arguments.change"
] | 1,366,580 | 1,366,581 | u885134476 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF (ll)2e9
#define MOD ((ll)1e9 + 7)
#define ALL... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define INF (ll)2e9
#define MOD ((ll)1e9 + 7)
#define ALL... | [
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change"
] | 1,366,587 | 1,366,588 | u951672936 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
/*@@@@@@@@@@@@@@@@@@@@O:8:O@@@@@@@@@c cCCCco@@@C o@@@@@@@@@@@@@@@... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
/*@@@@@@@@@@@@@@@@@@@@O:8:O@@@@@@@@@c cCCCco@@@C o@@@@@@@@@@@@@@@... | [
"call.remove",
"call.arguments.change"
] | 1,366,601 | 1,366,602 | u641145334 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
/*@@@@@@@@@@@@@@@@@@@@O:8:O@@@@@@@@@c cCCCco@@@C o@@@@@@@@@@@@@@@... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
/*@@@@@@@@@@@@@@@@@@@@O:8:O@@@@@@@@@c cCCCco@@@C o@@@@@@@@@@@@@@@... | [
"call.remove",
"call.arguments.change"
] | 1,366,603 | 1,366,602 | u641145334 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, a, b[9] = {}, z = 0;
cin >> n;
while (n--) {
cin >> a;
if (a < 3200)
b[a / 400] = 1;
else
b[8]++;
}
for (int i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int mod = 1000000007;
int main() {
ios::sync_with_stdio(false);
int n, a, b[9] = {}, z = 0;
cin >> n;
while (n--) {
cin >> a;
if (a < 3200)
b[a / 400] = 1;
else
b[8]++;
}
for (int i... | [
"call.add",
"call.arguments.add"
] | 1,366,606 | 1,366,607 | u151855078 | cpp |
p03695 | #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | #include <algorithm>
#include <cfloat>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <unordered_map>
#include <vector>
using namespace s... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 1,366,611 | 1,366,612 | u714724786 | cpp |
p03695 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1 << 29);
int color(int a) {
int b = a / 400;
if (a >= 320... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const ll INF = MOD * MOD;
const int inf = (1 << 29);
int color(int a) {
int b = a / 400;
if (a >= 320... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,366,620 | 1,366,621 | u538125576 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
int rate[n];
rep(i, n) cin >> rate[i];
vector<bool> color;
color.assign(8, false);
int count = 0; // rate >= 3200
rep(i, n) {
rep(j, 9) {
if ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
int n;
cin >> n;
int rate[n];
rep(i, n) cin >> rate[i];
vector<bool> color;
color.assign(8, false);
int count = 0; // rate >= 3200
rep(i, n) {
rep(j, 9) {
if ... | [
"call.remove",
"call.arguments.change"
] | 1,366,622 | 1,366,623 | u104057163 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n); i >= 0; i--)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define REVSORT(c) ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n); i >= 0; i--)
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define REVSORT(c) ... | [
"call.remove",
"call.arguments.change"
] | 1,366,630 | 1,366,631 | u615258936 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
int main() {
int N, cnt = 0;
cin >> N;
set<int> s;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
if (tmp >= 3200) {
cnt++;
continue;
}
s.insert(tmp / 400);
}
cout << min(1, int(s.s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll MOD = 1000000007;
int main() {
int N, cnt = 0;
cin >> N;
set<int> s;
for (int i = 0; i < N; i++) {
int tmp;
cin >> tmp;
if (tmp >= 3200) {
cnt++;
continue;
}
s.insert(tmp / 400);
}
cout << max(1, int(s.s... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,366,636 | 1,366,637 | u831873811 | cpp |
p03695 |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, a;
cin >> N;
//
vector<int> colors(8, 0);
int free = 0;
for (int i = 0; i < N; ++i) {
cin >> a;
if... |
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, a;
cin >> N;
//
vector<int> colors(8, 0);
int free = 0;
for (int i = 0; i < N; ++i) {
cin >> a;
if... | [
"call.remove",
"call.arguments.change"
] | 1,366,640 | 1,366,641 | u556799364 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int b = 0;
vector<int> C(8);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
a /= 400;
if (a < 8) {
C[a]++;
} else {
b++;
}
}
int cnt = 0;
for (in... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
int b = 0;
vector<int> C(8);
for (int i = 0; i < N; i++) {
int a;
cin >> a;
a /= 400;
if (a < 8) {
C[a]++;
} else {
b++;
}
}
int cnt = 0;
for (in... | [
"call.remove",
"call.arguments.change"
] | 1,366,654 | 1,366,655 | u782098901 | cpp |
p03695 | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
ll inf = 1ll << 60;
int main() {
// freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, i, a[100], b[8] = {0}, t = 0, s = 0;
cin >> n;
for (i = 0; i... | #include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
ll inf = 1ll << 60;
int main() {
// freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
ios_base::sync_with_stdio(false);
cin.tie(0);
int n, i, a[100], b[8] = {0}, t = 0, s = 0;
cin >> n;
for (i = 0; i... | [
"call.remove",
"call.arguments.change"
] | 1,366,669 | 1,366,670 | u162126904 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<bool> a(8);
int p = 0;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
if (m >= 3200) {
p++;
} else if (m >= 2800) {
a.at(7) = true;
} else if (m >= 2400) {
a.at(6) = true;
} else if (m... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<bool> a(8);
int p = 0;
for (int i = 0; i < n; i++) {
int m;
cin >> m;
if (m >= 3200) {
p++;
} else if (m >= 2800) {
a.at(7) = true;
} else if (m >= 2400) {
a.at(6) = true;
} else if (m... | [
"call.add",
"call.arguments.add"
] | 1,366,673 | 1,366,674 | u166378830 | cpp |
p03695 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD ... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF (1ll << 60)
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int MOD ... | [
"call.remove",
"call.arguments.change"
] | 1,366,675 | 1,366,676 | u824337972 | cpp |
p03695 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
const int MOD = 1000000007, INF = 1111111111;
using namespace std;
using lint = long long;
template <class T> ostream &operator<<(ostrea... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
const int MOD = 1000000007, INF = 1111111111;
using namespace std;
using lint = long long;
template <class T> ostream &operator<<(ostrea... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,366,677 | 1,366,678 | u532573979 | cpp |
p03695 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
const int MOD = 1000000007, INF = 1111111111;
using namespace std;
using lint = long long;
template <class T> ostream &operator<<(ostrea... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
const int MOD = 1000000007, INF = 1111111111;
using namespace std;
using lint = long long;
template <class T> ostream &operator<<(ostrea... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,366,679 | 1,366,678 | u532573979 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
bool color[8];
int ra = 0;
for (int i = 0; i < 8; i++) {
color[i] = false;
}
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 3200) {
color[a / 400] =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
bool color[8];
int ra = 0;
for (int i = 0; i < 8; i++) {
color[i] = false;
}
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a < 3200) {
color[a / 400] =... | [
"call.remove",
"call.arguments.change"
] | 1,366,682 | 1,366,683 | u160754729 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int boja(int x) {
if (x <= 399)
return 1;
if (x <= 799)
return 2;
if (x <= 1199)
return 3;
if (x <= 1599)
return 4;
if (x <= 1999)
return 5;
if (x <= 2399)
return 6;
if (x <= 2799)
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int boja(int x) {
if (x <= 399)
return 1;
if (x <= 799)
return 2;
if (x <= 1199)
return 3;
if (x <= 1599)
return 4;
if (x <= 1999)
return 5;
if (x <= 2399)
return 6;
if (x <= 2799)
ret... | [
"call.remove",
"call.arguments.change"
] | 1,366,685 | 1,366,686 | u320923811 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int boja(int x) {
if (x <= 399)
return 1;
if (x <= 799)
return 2;
if (x <= 1199)
return 3;
if (x <= 1599)
return 4;
if (x <= 1999)
return 5;
if (x <= 2399)
return 6;
if (x <= 2799)
ret... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
int boja(int x) {
if (x <= 399)
return 1;
if (x <= 799)
return 2;
if (x <= 1199)
return 3;
if (x <= 1599)
return 4;
if (x <= 1999)
return 5;
if (x <= 2399)
return 6;
if (x <= 2799)
ret... | [
"call.remove",
"call.arguments.change"
] | 1,366,687 | 1,366,686 | u320923811 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> T;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#def... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef pair<P, int> T;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000
#define sz(x) ((int)(x).size())
#define fi first
#define sec second
#def... | [
"call.add",
"call.arguments.change"
] | 1,366,690 | 1,366,691 | u379947938 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
bool gray = false;
bool brown = false;
bool green = false;
bool sky = false;
bool blue = false;
bool yellow = false;
bool orange = false;
bool... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
bool gray = false;
bool brown = false;
bool green = false;
bool sky = false;
bool blue = false;
bool yellow = false;
bool orange = false;
bool... | [
"call.remove",
"call.arguments.change"
] | 1,366,694 | 1,366,695 | u835534008 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
bool gray = false;
bool brown = false;
bool green = false;
bool sky = false;
bool blue = false;
bool yellow = false;
bool orange = false;
bool... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
bool gray = false;
bool brown = false;
bool green = false;
bool sky = false;
bool blue = false;
bool yellow = false;
bool orange = false;
bool... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.remove",
"call.arguments.change"
] | 1,366,696 | 1,366,695 | u835534008 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
bool color[8] = {};
int any_color = 0;
int num_color = 0;
;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200) {
any_color++;
} else {
color[a / 400] = true;
}
}
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
bool color[8] = {};
int any_color = 0;
int num_color = 0;
;
cin >> n;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200) {
any_color++;
} else {
color[a / 400] = true;
}
}
for (int i = 0; i... | [
"call.remove",
"call.arguments.change"
] | 1,366,707 | 1,366,708 | u200526653 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, N, colour[9] = {}, ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
colour[min(a / 400, 8)]++;
}
for (int i = 0; i < 8; i++) {
if (colour[i] > 0) {
ans += 1;
}
}
cout << max(ans, 1) << " " << min(ans + col... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, N, colour[9] = {}, ans = 0;
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
colour[min(a / 400, 8)]++;
}
for (int i = 0; i < 8; i++) {
if (colour[i] > 0) {
ans += 1;
}
}
cout << max(ans, 1) << " " << ans + colour... | [
"call.remove",
"call.arguments.change"
] | 1,366,709 | 1,366,710 | u170324846 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int hai = 0, cha = 0, midori = 0, mizu = 0, ao = 0, ki = 0, orange = 0,
aka = 0, ran... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int hai = 0, cha = 0, midori = 0, mizu = 0, ao = 0, ki = 0, orange = 0,
aka = 0, ran... | [] | 1,366,713 | 1,366,714 | u591779169 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.