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 <algorithm>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
// 0 :レート 1-399：灰色
// 1 :レート 400-799：茶色
// 2 :レート 800-1199：緑色
// 3 :レート 1200-1599：水色
// 4 :レート 1600-1999：青色
// 5 :レート 2000-2399：黄色
// 6 :レート 2400-2799：橙色
// 7 :レート ... | // 0 :レート 1-399：灰色
// 1 :レート 400-799：茶色
// 2 :レート 800-1199：緑色
// 3 :レート 1200-1599：水色
// 4 :レート 1600-1999：青色
// 5 :レート 2000-2399：黄色
// 6 :レート 2400-2799：橙色
// 7 :レート 2800-3199：赤色
// 8 : 3200 Over
#include <algorithm>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <... | [
"call.add",
"call.arguments.change"
] | 1,367,511 | 1,367,512 | u262702665 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define... | [
"call.remove",
"call.arguments.change"
] | 1,367,516 | 1,367,517 | u196432341 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int n, a, r[9] = {0}, flag = 1, idx, sumv = 0, minv;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
idx = a / 400;
if (idx < 8) {
r[idx] = 1;
flag = 0;
} else {
r[idx]++;
}
}
for (int i = 0; i < 9; i++)
sumv... | #include <iostream>
using namespace std;
int main() {
int n, a, r[9] = {0}, flag = 1, idx, sumv = 0, minv;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
idx = a / 400;
if (idx < 8) {
r[idx] = 1;
flag = 0;
} else {
r[8]++;
}
}
for (int i = 0; i < 9; i++)
sumv +... | [
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change"
] | 1,367,518 | 1,367,519 | u126747509 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
#define lowbit(x) ((x) & (-x))
#define INF 0x3f3f3f3f
#define ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long LL;
#define lowbit(x) ((x) & (-x))
#define INF 0x3f3f3f3f
#define ... | [] | 1,367,522 | 1,367,523 | u094036798 | cpp |
p03695 | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n, min, max, i, a[100], flg[8];
for (i = 0; i < 8; i++)
flg[i] = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
min = 0;
max = 0;
for (i = 0; i < n; i++) {
if (a[i] <= 399 && flg[0] != 1) {
flg[0] = 1;
... | #include <cstdio>
#include <iostream>
using namespace std;
int main(void) {
int n, min, max, i, a[100], flg[8];
for (i = 0; i < 8; i++)
flg[i] = 0;
cin >> n;
for (i = 0; i < n; i++)
cin >> a[i];
min = 0;
max = 0;
for (i = 0; i < n; i++) {
if (a[i] <= 399 && flg[0] != 1) {
flg[0] = 1;
... | [
"assignment.change"
] | 1,367,532 | 1,367,533 | u833944274 | cpp |
p03695 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define sz 205
using namespace std;
ll frq[10];
ll fun(ll x) {
if (x >= 1 && x <= 399)
frq[1... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
#define sz 205
using namespace std;
ll frq[10];
ll fun(ll x) {
if (x >= 1 && x <= 399)
frq[1... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,367,534 | 1,367,535 | u255500469 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int a[1001];
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
int ans = 0, cnt = 0, c = 0, b = 0;
for (int i = 0; i < n; ++i) {
if (a[i] < 3200) {
b = a[i] / 400;
... | #include <bits/stdc++.h>
using namespace std;
int a[1001];
int main() {
ios_base::sync_with_stdio(false);
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
sort(a, a + n);
int ans = 0, cnt = 0, c = -1, b = -1;
for (int i = 0; i < n; ++i) {
if (a[i] < 3200) {
b = a[i] / 400;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,367,536 | 1,367,537 | u987309835 | cpp |
p03695 | #include <iostream>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
set<int> color;
int rating, free = 0;
for (int i = 0; i < N; ++i) {
cin >> rating;
if (rating < 3200) {
color.insert(rating / 400);
} else {
free += 1;
}
}
cout << (color.size() == 0 ? 1 ... | #include <iostream>
#include <set>
using namespace std;
int main() {
int N;
cin >> N;
set<int> color;
int rating, free = 0;
for (int i = 0; i < N; ++i) {
cin >> rating;
if (rating < 3200) {
color.insert(rating / 400);
} else {
free += 1;
}
}
cout << (color.size() == 0 ? 1 ... | [
"call.remove",
"call.arguments.change"
] | 1,367,540 | 1,367,541 | u638057737 | cpp |
p03695 | /*input
4
2100 2500 2700 2700
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define MOD 1000000007
#define MODSET(d) \
if ((d) >= MOD) ... | /*input
4
2100 2500 2700 2700
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define MOD 1000000007
#define MODSET(d) \
if ((d) >= MOD) ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,367,542 | 1,367,543 | u430162870 | cpp |
p03695 | /*input
4
2100 2500 2700 2700
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define MOD 1000000007
#define MODSET(d) \
if ((d) >= MOD) ... | /*input
4
2100 2500 2700 2700
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define MOD 1000000007
#define MODSET(d) \
if ((d) >= MOD) ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.variable.change",
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,367,544 | 1,367,543 | u430162870 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, i, j = 0, k = 0, x = 0,
y = 0, t;
cin >> a;
vector<int> v;
for (i = 0; i < a; i++) {
cin >> b;
v.push_back(b);
}
for (i = 0; i < a; i++) {
if (v[i] >= 1 && v[i] <= 399) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b, c = 0, d = 0, e = 0, f = 0, g = 0, h = 0, i, j = 0, k = 0, x = 0,
y = 0, t;
cin >> a;
vector<int> v;
for (i = 0; i < a; i++) {
cin >> b;
v.push_back(b);
}
for (i = 0; i < a; i++) {
if (v[i] >= 1 && v[i] <= 399) {
... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,367,545 | 1,367,546 | u086977829 | cpp |
p03695 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int a;
int max = 0, min = 0;
int color[9];
for (int i = 0; i < 9; i++) {
color[i] = 0;
}
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 400) ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
int a;
int max = 0, min = 0;
int color[9];
for (int i = 0; i < 9; i++) {
color[i] = 0;
}
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 400) ... | [
"misc.opposites",
"assignment.variable.change",
"identifier.change",
"literal.number.change",
"assignment.value.change"
] | 1,367,547 | 1,367,548 | u415907460 | cpp |
p03695 | #include <stdio.h>
int main() {
int x = 0;
int y = 0;
int n, z;
int a = 0;
int b = 0;
int c = 0;
int d = 0;
int e = 0;
int f = 0;
int g = 0;
int h = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &z);
if (400 > z && a == 0) {
x++;
a++;
}
if (z >= 400... | #include <stdio.h>
int main() {
int x = 0;
int y = 0;
int n, z;
int a = 0;
int b = 0;
int c = 0;
int d = 0;
int e = 0;
int f = 0;
int g = 0;
int h = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d", &z);
if (400 > z && a == 0) {
x++;
a++;
}
if (z >= 400... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 1,367,549 | 1,367,550 | u021416098 | cpp |
p03695 | // 7/4 Tuesday
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans, x = 0, kizon = 0;
int color[8] = {};
cin >> n;
vector<int> rate(n);
for (int i = 0; i < n; i++) {
cin >> rate[i];
}
for (int i = 0; i < n; i++) {
if (rate[i]... | // 7/4 Tuesday
#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ans, x = 0, kizon = 0;
int color[8] = {};
cin >> n;
vector<int> rate(n);
for (int i = 0; i < n; i++) {
cin >> rate[i];
}
for (int i = 0; i < n; i++) {
if (rate[i]... | [
"assignment.add"
] | 1,367,555 | 1,367,556 | u183464876 | cpp |
p03695 | #include <stdio.h>
int main(void) {
int n;
int i;
scanf("%d", &n);
int a[n];
int kind[8];
int master = 0;
int target;
for (i - 0; i < 8; i++) {
kind[i] = 0;
}
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
target = a[i] / 400;
switch (target) {
cas... | #include <stdio.h>
int main(void) {
int n;
int i;
scanf("%d", &n);
int a[n];
int kind[8];
int master = 0;
int target;
for (i - 0; i < 8; i++) {
kind[i] = 0;
}
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
}
for (i = 0; i < n; i++) {
target = a[i] / 400;
switch (target) {
cas... | [
"expression.unary.arithmetic.add"
] | 1,367,566 | 1,367,567 | u451983180 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int over_3200 = 0;
int flags = 0;
int ans_min = 0;
for (int i = 0; i < N; i++) {
int rate;
cin >> rate;
if (rate >= 3200) {
over_3200++;
} else {
int phase = rate / 400;
int color_bit = 1 << phase;
... | #include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int over_3200 = 0;
int flags = 0;
int ans_min = 0;
for (int i = 0; i < N; i++) {
int rate;
cin >> rate;
if (rate >= 3200) {
over_3200++;
} else {
int phase = rate / 400;
int color_bit = 1 << phase;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,367,568 | 1,367,569 | u767655833 | cpp |
p03695 | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, cnt[8] = {0}, more = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 3200)
cnt[a / 3200] = 1;
else
more++;
}
int sum = 0;
for (int i = 0; i < 8; i++)
sum += cnt[i];
cout <<... | #include <algorithm>
#include <iostream>
using namespace std;
int main() {
int N, cnt[8] = {0}, more = 0;
cin >> N;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
if (a < 3200)
cnt[a / 400] = 1;
else
more++;
}
int sum = 0;
for (int i = 0; i < 8; i++)
sum += cnt[i];
cout << ... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 1,367,570 | 1,367,571 | u243961437 | cpp |
p03695 | #include <iostream>
using namespace std;
const int gray = 399, brown = 799, green = 1199, lb = 1599, blue = 1999,
yell = 2399, dai = 2799, red = 3199;
int n, col[9] = {};
int getmax() {
int max = 0;
for (int i = 0; i < 8; i++) {
if (col[i])
max++;
}
max += col[8];
return max > 8 ? 8 : ma... | #include <iostream>
using namespace std;
const int gray = 399, brown = 799, green = 1199, lb = 1599, blue = 1999,
yell = 2399, dai = 2799, red = 3199;
int n, col[9] = {};
int getmax() {
int max = 0;
for (int i = 0; i < 8; i++) {
if (col[i])
max++;
}
max += col[8];
return max;
}
int getm... | [] | 1,367,584 | 1,367,585 | u608007782 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
int b = 0, cnt = 0, dif = 0;
cin >> n;
while (n--) {
int x;
cin >> x;
x /= 400;
if (x >= 8)
++cnt;
else {
if (b & (1 << x))
continue;
++dif;
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n;
int b = 0, cnt = 0, dif = 0;
cin >> n;
while (n--) {
int x;
cin >> x;
x /= 400;
if (x >= 8)
++cnt;
else {
if (b & (1 << x))
continue;
++dif;
... | [
"call.remove",
"call.arguments.change"
] | 1,367,588 | 1,367,589 | u898012740 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int N;
bool Count[8] = {};
int color(int rate) { return rate / 400; }
int main() {
cin >> N;
int countEx = 0;
int rate;
for (int i = 0; i < N; i++) {
cin >> rate;
if ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
int N;
bool Count[8] = {};
int color(int rate) { return rate / 400; }
int main() {
cin >> N;
int countEx = 0;
int rate;
for (int i = 0; i < N; i++) {
cin >> rate;
if ... | [
"call.remove",
"call.arguments.change"
] | 1,367,594 | 1,367,595 | u655122274 | cpp |
p03695 | #include <algorithm>
#include <iostream>
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 rate[] = {0, 0, 0, 0, 0, 0, 0, 0};
int top = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 400)
rate... | #include <algorithm>
#include <iostream>
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 rate[] = {0, 0, 0, 0, 0, 0, 0, 0};
int top = 0;
for (int i = 0; i < N; i++) {
if (a[i] < 400)
rate... | [
"call.remove",
"call.arguments.change"
] | 1,367,598 | 1,367,599 | u875246225 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[10] = {0}, x, ans = 0;
for (cin >> n; n--; a[min(8, x / 400)]++)
cin >> x;
for (int i = 0; i < 8; ans += !!a[i++])
;
cout << max(ans, 1) << " " << min(8, ans + a[8]);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a[10] = {0}, x, ans = 0;
for (cin >> n; n--; a[min(8, x / 400)]++)
cin >> x;
for (int i = 0; i < 8; ans += !!a[i++])
;
cout << max(ans, 1) << " " << ans + a[8];
} | [
"call.remove",
"call.arguments.change"
] | 1,367,604 | 1,367,605 | u893242457 | cpp |
p03695 | #include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#ifdef _MSC_VER
#include <Windows.h>
#else
#include <unistd.h>
#endif
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T... | #include <bits/stdc++.h>
#include <cstdio>
#include <cstdlib>
#ifdef _MSC_VER
#include <Windows.h>
#else
#include <unistd.h>
#endif
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T... | [
"call.add",
"call.arguments.add"
] | 1,367,611 | 1,367,612 | u771306245 | cpp |
p03695 | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include ... | [
"identifier.replace.add",
"literal.replace.remove",
"io.output.change"
] | 1,367,613 | 1,367,614 | u026730198 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include ... | [
"call.remove",
"call.arguments.change"
] | 1,367,619 | 1,367,620 | u221758210 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N, a, ans = 0;
int color[9] = {0};
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 3200)
color[a / 400] = 1;
else
color[8]++;
}
for (int i = 0; i < 8; i++) {
if (color[i] == 1)... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int N, a, ans = 0;
int color[9] = {0};
int main() {
cin >> N;
for (int i = 0; i < N; i++) {
cin >> a;
if (a < 3200)
color[a / 400] = 1;
else
color[8]++;
}
for (int i = 0; i < 8; i++) {
if (color[i] == 1)... | [
"call.add",
"call.arguments.add"
] | 1,367,625 | 1,367,626 | u132681722 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int N;
int mem[10] = {0};
int ans = 0;
int sum = 0;
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int a;
scanf("%d", &a);
if (a >= 3200) {
sum++;
} else if (mem[a / 400] == 0) {
ans++;
mem[a / 400] = 1;
}
}
print... | #include <bits/stdc++.h>
using namespace std;
int N;
int mem[10] = {0};
int ans = 0;
int sum = 0;
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
int a;
scanf("%d", &a);
if (a >= 3200) {
sum++;
} else if (mem[a / 400] == 0) {
ans++;
mem[a / 400] = 1;
}
}
print... | [
"call.remove",
"call.arguments.change"
] | 1,367,629 | 1,367,630 | u205655980 | cpp |
p03695 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
/*
レート 1-399：灰色
レート 400-799：茶色
レート 800-1199：緑色
レート 1200-1599：水色
レート 1600-1999：青色
レート 2000-2399：黄色
レート 2400-2799：橙色
レート 2800-3199：赤色
*/
int result[9] = {};
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int ... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
/*
レート 1-399：灰色
レート 400-799：茶色
レート 800-1199：緑色
レート 1200-1599：水色
レート 1600-1999：青色
レート 2000-2399：黄色
レート 2400-2799：橙色
レート 2800-3199：赤色
*/
int result[9] = {};
int n;
cin >> n;
for (int i = 0; i < n; i++) {
int ... | [
"call.remove",
"call.arguments.change"
] | 1,367,645 | 1,367,646 | u155216115 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> rate(8, 0);
int in;
int over = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> in;
if (in >= 3200)
over++;
else
rate[in / 400]++;
}
for (int i = 0; i < n; i++)
if (rate[i] > 0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> rate(8, 0);
int in;
int over = 0; // 3200以上をカウント
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> in;
if (in >= 3200)
over++; // 3200以上をカウント
else
rate[in / 400]++; //表埋め
}
for (int i = 0;... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,367,649 | 1,367,650 | u088764266 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> rate(8, 0);
int in;
int over = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> in;
if (in >= 3200)
over++;
else
rate[in / 400]++;
}
for (int i = 0; i < n; i++)
if (rate[i] > 0)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> rate(8, 0);
int in;
int over = 0;
int cnt = 0;
for (int i = 0; i < n; i++) {
cin >> in;
if (in >= 3200)
over++;
else
rate[in / 400]++;
}
for (int i = 0; i < 8; i++)
if (rate[i] > 0)
... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,367,649 | 1,367,651 | u088764266 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int n, cnt, a, x;
bool vis[10];
void update(int x) {
if (x < 400) {
vis[0] = 1;
} else if (x < 800) {
vis[1] = 1;
} else if (x < 1200) {
vis[2] = 1;
} else if (x < 1600) {
vis[3] = 1;
} else if (x < 2000) {
vis[4] = 1;
} else if (x < 2400) ... | #include <bits/stdc++.h>
using namespace std;
int n, cnt, a, x;
bool vis[10];
void update(int x) {
if (x < 400) {
vis[0] = 1;
} else if (x < 800) {
vis[1] = 1;
} else if (x < 1200) {
vis[2] = 1;
} else if (x < 1600) {
vis[3] = 1;
} else if (x < 2000) {
vis[4] = 1;
} else if (x < 2400) ... | [
"call.remove",
"call.arguments.change"
] | 1,367,659 | 1,367,660 | u454658584 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int col[9] = {};
for (int i = 0, a; i < n; ++i) {
cin >> a;
if (a < 3200)
col[a / 400]++;
else
col[8]++;
}
int maxn = 0, minn = 0;
for (int i = 0; i < 8; ++i)
if (col[i])
minn++;
maxn = minn;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int col[9] = {};
for (int i = 0, a; i < n; ++i) {
cin >> a;
if (a < 3200)
col[a / 400]++;
else
col[8]++;
}
int maxn = 0, minn = 0;
for (int i = 0; i < 8; ++i)
if (col[i])
minn++;
maxn = minn;
... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,367,663 | 1,367,664 | u265077879 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int col[9] = {};
for (int i = 0, a; i < n; ++i) {
cin >> a;
if (a < 3200)
col[a / 400]++;
else
col[8]++;
}
int maxn = 0, minn = 0;
for (int i = 0; i < 8; ++i)
if (col[i])
minn++;
maxn = minn;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int col[9] = {};
for (int i = 0, a; i < n; ++i) {
cin >> a;
if (a < 3200)
col[a / 400]++;
else
col[8]++;
}
int maxn = 0, minn = 0;
for (int i = 0; i < 8; ++i)
if (col[i])
minn++;
maxn = minn;
... | [
"call.add",
"call.arguments.add"
] | 1,367,665 | 1,367,664 | u265077879 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int n;
bool color[8];
for (int i = 0; i < 8; i++) {
color[i] = false;
}
int free = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int rate;
cin >> rate;
if (rate < 3200) {
color[rate / 400] = true;
} else {
free++;
}
... | #include <iostream>
using namespace std;
int main() {
int n;
bool color[8];
for (int i = 0; i < 8; i++) {
color[i] = false;
}
int free = 0;
cin >> n;
for (int i = 0; i < n; i++) {
int rate;
cin >> rate;
if (rate < 3200) {
color[rate / 400] = true;
} else {
free++;
}
... | [
"call.remove",
"call.arguments.change"
] | 1,367,666 | 1,367,667 | u852113235 | cpp |
p03695 | #include <iostream>
using namespace std;
bool ary[8];
int main() {
int N, sum = 0;
cin >> N;
int tmp;
for (int i = 1; i <= N; i++) {
cin >> tmp;
if (tmp < 3200)
ary[(tmp - 1) / 400] |= true;
else
sum++;
}
int num = 0;
for (int i = 0; i < 8; i++)
if (ary[i])
num++;
if ... | #include <iostream>
using namespace std;
bool ary[8];
int main() {
int N, sum = 0;
cin >> N;
int tmp;
for (int i = 1; i <= N; i++) {
cin >> tmp;
if (tmp < 3200)
ary[(tmp) / 400] |= true;
else
sum++;
}
int num = 0;
for (int i = 0; i < 8; i++)
if (ary[i])
num++;
if (!nu... | [
"expression.operation.binary.remove"
] | 1,367,668 | 1,367,669 | u598462304 | cpp |
p03695 | #include <cstdio>
using namespace std;
int main() {
int n, scan, i;
int cnt_max;
scan = scanf("%d", &n);
int a[n];
for (i = 0; i < n && scan; i++) {
scan = scanf("%d", &a[i]);
}
int k;
int b[9];
for (i = 0; i < 9; i++) {
b[i] = 0;
}
for (i = 0; i < n; i++) {
k = a[i] / 400;
if (k >... | #include <cstdio>
using namespace std;
int main() {
int n, scan, i;
int cnt_max;
scan = scanf("%d", &n);
int a[n];
for (i = 0; i < n && scan; i++) {
scan = scanf("%d", &a[i]);
}
int k;
int b[9];
for (i = 0; i < 9; i++) {
b[i] = 0;
}
for (i = 0; i < n; i++) {
k = a[i] / 400;
if (k >... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,367,676 | 1,367,677 | u608297208 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <vector>
int main(void) {
int N;
std::cin >> N;
// ただし便宜的に色が9色あることにする。
// 最後の色は、実は色ではなくて、「好きな色を使える」ことなので注意。
std::vector<bool> color_used =
std::vector<bool>(8, false); // 8色あって、初期値はfalseです。と言う指定
// 自由な色を使って良いメンバーが何人いるか
// 基本的に、みんな自由な色を使えることにしてしまう。... | #include <algorithm>
#include <iostream>
#include <vector>
int main(void) {
int N;
std::cin >> N;
// ただし便宜的に色が9色あることにする。
// 最後の色は、実は色ではなくて、「好きな色を使える」ことなので注意。
std::vector<bool> color_used =
std::vector<bool>(8, false); // 8色あって、初期値はfalseです。と言う指定
// 自由な色を使って良いメンバーが何人いるか
// 基本的に、みんな自由な色を使えることにしてしまう。... | [
"expression.operation.binary.add"
] | 1,367,678 | 1,367,679 | u457912018 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll, ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
using pll = pair<ll, ll>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v... | [
"call.remove"
] | 1,367,684 | 1,367,685 | u768347697 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
// ----------- define --------------
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int, int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(), (x).end()
#define get_bit(x, k) ((x >> k) & 1)
// ---------... | #include <bits/stdc++.h>
using namespace std;
// ----------- define --------------
#define int long long
#define vi vector<int>
#define vc vector<char>
#define ii pair<int, int>
#define fi first
#define sc second
#define stoi stoll
#define all(x) (x).begin(), (x).end()
#define get_bit(x, k) ((x >> k) & 1)
// ---------... | [
"assignment.value.change",
"assignment.change"
] | 1,367,686 | 1,367,687 | u450179832 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pi;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define rep3(i, i0, n) for (int i = i0; i < (n); i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
templ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> Pi;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, n) for (int i = 1; i <= (n); i++)
#define rep3(i, i0, n) for (int i = i0; i < (n); i++)
#define pb push_back
#define mod 1000000007
const ll INF = 1LL << 60;
templ... | [
"expression.unary.arithmetic.add"
] | 1,367,692 | 1,367,693 | u222188267 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ar array
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define F_OR(i, a, b, s) \
for (int i = (a); (s) > 0 ? i < (b) : i > ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ar array
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define F_OR(i, a, b, s) \
for (int i = (a); (s) > 0 ? i < (b) : i > ... | [
"assignment.add"
] | 1,367,698 | 1,367,699 | u141580535 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ar array
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define F_OR(i, a, b, s) \
for (int i = (a); (s) > 0 ? i < (b) : i > ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ar array
#define vt vector
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define sz(x) (int)(x).size()
#define F_OR(i, a, b, s) \
for (int i = (a); (s) > 0 ? i < (b) : i > ... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 1,367,700 | 1,367,701 | u141580535 | cpp |
p03696 | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | #include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n; i >= 0; i--)
#define REP(i, s, t) for (int i = s; i <= t; i++)
#define RREP(i, s, t) for (int i = s; i >= t; i--)
#define dump(x) cerr << #x << " = " << (x) << endl;
#d... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,367,712 | 1,367,713 | u965730380 | cpp |
p03696 | #ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
#define pf push_front
#define eb emplace_back
#define SZ(x) ((ll)(x).si... | #ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
#define pf push_front
#define eb emplace_back
#define SZ(x) ((ll)(x).si... | [
"identifier.change",
"call.arguments.change"
] | 1,367,714 | 1,367,715 | u614128939 | cpp |
p03696 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define printVec(v) \
printf("{"); \
for (const auto &i : v) { \
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define printVec(v) \
printf("{"); \
for (const auto &i : v) { \
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,367,716 | 1,367,717 | u945554850 | cpp |
p03696 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
const int maxn = 101000;
int n, m, x;
int lt, rt, dis[maxn];
string S, S1, S2;
ll read() {
ll s = 0, f = 1;
char ch = getchar();
while (ch ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
const int maxn = 101000;
int n, m, x;
int lt, rt, dis[maxn];
string S, S1, S2;
ll read() {
ll s = 0, f = 1;
char ch = getchar();
while (ch ... | [
"call.arguments.change"
] | 1,367,720 | 1,367,721 | u296592121 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define idfc \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
//:/
#define pb push_back
#define mp make_pair
#define nt _ll128
#define ld long double
long... | #include <bits/stdc++.h>
using namespace std;
using namespace std::chrono;
#define idfc \
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr)
//:/
#define pb push_back
#define mp make_pair
#define nt _ll128
#define ld long double
long... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 1,367,724 | 1,367,725 | u793715260 | cpp |
p03696 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#in... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <utility>
#in... | [
"call.remove"
] | 1,367,726 | 1,367,727 | u006717664 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VI vector<int>
#define VLL vector<ll>
#define PII pair<int, int>
#define mp make_pair
#define pb push_back
#define PI acos(-1)
#define double long double
const int MxN = 200005;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
int v;
vector<PI... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define VI vector<int>
#define VLL vector<ll>
#define PII pair<int, int>
#define mp make_pair
#define pb push_back
#define PI acos(-1)
#define double long double
const int MxN = 200005;
#define FOR(i, a, b) for (int i = a; i < b; ++i)
int v;
vector<PI... | [
"expression.unary.arithmetic.add"
] | 1,367,730 | 1,367,731 | u507638984 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(con... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(con... | [
"assignment.add"
] | 1,367,740 | 1,367,741 | u305824645 | cpp |
p03696 | #include <bits/stdc++.h>
#include <cassert>
#include <numeric>
using namespace std;
typedef long long ll;
typedef long double ld;
using graph = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using qi = queue<int>;
using qpii = queue<pii>;
using pqi = priority_queue<int>;
using pqr = priorit... | #include <bits/stdc++.h>
#include <cassert>
#include <numeric>
using namespace std;
typedef long long ll;
typedef long double ld;
using graph = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using qi = queue<int>;
using qpii = queue<pii>;
using pqi = priority_queue<int>;
using pqr = priorit... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,367,746 | 1,367,747 | u425848474 | cpp |
p03696 | #include <bits/stdc++.h>
#include <cassert>
#include <numeric>
using namespace std;
typedef long long ll;
typedef long double ld;
using graph = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using qi = queue<int>;
using qpii = queue<pii>;
using pqi = priority_queue<int>;
using pqr = priorit... | #include <bits/stdc++.h>
#include <cassert>
#include <numeric>
using namespace std;
typedef long long ll;
typedef long double ld;
using graph = vector<vector<int>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using qi = queue<int>;
using qpii = queue<pii>;
using pqi = priority_queue<int>;
using pqr = priorit... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,367,748 | 1,367,747 | u425848474 | cpp |
p03696 | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using na... | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using na... | [
"call.add",
"call.arguments.add"
] | 1,367,749 | 1,367,750 | u767543103 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
string buf = s;
string target = "()";
if (!buf.empty()) {
string::size_type pos = 0;
while ((pos = buf.find(target, 0)) != string::npos) {
buf.replace(pos, target.length(), "");
}
}
int len = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
string buf = s;
string target = "()";
if (!buf.empty()) {
string::size_type pos = 0;
while ((pos = buf.find(target, 0)) != string::npos) {
buf.replace(pos, target.length(), "");
}
}
int len = ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,367,751 | 1,367,752 | u494609869 | cpp |
p03696 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
... | [
"assignment.add"
] | 1,367,753 | 1,367,754 | u314543767 | cpp |
p03696 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#def... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define what_is(x) cerr << #x << " is " << x << endl;
#define MT make_tuple
#define eb emplace_back
#def... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 1,367,755 | 1,367,756 | u106922076 | cpp |
p03696 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) ... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = a; i < b; ++i)
#define rep(N) for (int i = 0; i < N; ++i)
#define Rep(a, b) for (int i = a; i < b; ++i)
#define For(i, N) for (int i = 0; i < N; ++i)
#define all(v) v.begin(), v.end()
#define rev(v) v.rbegin(), v.rend()
#define makei(N) ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,367,759 | 1,367,760 | u698760125 | cpp |
p03696 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-06-05 17:38:28
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 1,367,761 | 1,367,762 | u095266283 | cpp |
p03696 | /**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <fstream>
#include <iostream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#inclu... | #pragma region kyomukyomupurin
/**
* author : 𝒌𝒚𝒐𝒎𝒖𝒌𝒚𝒐𝒎𝒖𝒑𝒖𝒓𝒊𝒏
* created : 2020-06-05 17:38:28
**/
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <iomanip>
#include <iostream>
#include ... | [] | 1,367,763 | 1,367,762 | u095266283 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int l = 0, mi = 1000000;
string t = "";
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
l++;
} else {
l--;
}
mi = min(mi, l);
}
if (mi < 0) {
for (int i = 0; i < -mi; i++) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int l = 0, mi = 1000000;
string t = "";
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
l++;
} else {
l--;
}
mi = min(mi, l);
}
if (mi < 0) {
for (int i = 0; i < -mi; i++) ... | [
"control_flow.branch.if.add"
] | 1,367,766 | 1,367,767 | u385825353 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repm(i, a, n) for (ll i = a; i >= n; i--)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define mod (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define repm(i, a, n) for (ll i = a; i >= n; i--)
#define INF 1e9
#define LINF 1e17
#define MOD (int)(1e9 + 7)
#define mod (int)(1e9 + 7)
#define pi 3.141592653589
#define pii pair<int, int>
#define p... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,367,768 | 1,367,769 | u705296057 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM \
cin.tie(0); \
ios::sync_with_std... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
#define _GLIBCXX_DEBUG
#define IO_STREAM \
cin.tie(0); \
ios::sync_with_std... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 1,367,772 | 1,367,773 | u855838587 | cpp |
p03696 | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main(... | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, n) for (ll i = n; i >= 0; i--)
#define reprr(i, m, n) for (ll i = m; i < n; i++)
#define inf 2e9
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
int main(... | [
"control_flow.branch.if.condition.change"
] | 1,367,780 | 1,367,781 | u552122040 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 2e9;
// const ll INF = 9e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int mn = INF;
int last = 0;
int x = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int INF = 2e9;
// const ll INF = 9e18;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
string s;
cin >> s;
int mn = 0;
int last = 0;
int x = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,367,782 | 1,367,783 | u904131021 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, a, b) for (int i = (a); i < (b); ++i)
template <class T> inline void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <class T> inline void chmax(T &a, T b) {
if (a < b)
a = b;
}... | [
"identifier.change",
"io.output.change"
] | 1,367,793 | 1,367,794 | u335278042 | cpp |
p03696 | #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;
const LL MOD = 1e9 + 7;
cons... | #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;
const LL MOD = 1e9 + 7;
cons... | [
"expression.operation.binary.remove"
] | 1,367,801 | 1,367,802 | u139235669 | cpp |
p03696 | #include <bits/stdc++.h>
#define PI 3.14159265359
#define EPS 1e-16
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i, n) for (int i = 0; i < n; i++)
#define irep2(i, a, n) for (int i = (a); i <= (int)(n); i++)
#define lrep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lrep2(i, a,... | #include <bits/stdc++.h>
#define PI 3.14159265359
#define EPS 1e-16
#define INF 1e9
#define LINF 1e18
#define IMOD 1000000007
#define irep(i, n) for (int i = 0; i < n; i++)
#define irep2(i, a, n) for (int i = (a); i <= (int)(n); i++)
#define lrep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define lrep2(i, a,... | [
"literal.string.change",
"io.output.change"
] | 1,367,805 | 1,367,806 | u829260400 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) { /* {{{ */
if (a < b) {
a = b;
return true;
}
return false;
} /* }}} */
int main() {
int N;
string S;
cin >> N >> S;
int cnt = 0;
int pre = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '(') {
... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) { /* {{{ */
if (a < b) {
a = b;
return true;
}
return false;
} /* }}} */
int main() {
int N;
string S;
cin >> N >> S;
int cnt = 0;
int pre = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '(') {
... | [
"control_flow.loop.for.condition.change"
] | 1,367,807 | 1,367,808 | u942915776 | cpp |
p03696 | #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 rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S sec... | #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 rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define INF 1LL << 60
typedef long long int LL;
typedef long long int ll;
#define pll pair<ll, ll>
#define F first
#define S sec... | [] | 1,367,809 | 1,367,810 | u587857074 | cpp |
p03696 | #include <bits/stdc++.h>
// #define fi first
// #define se second
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
tem... | #include <bits/stdc++.h>
// #define fi first
// #define se second
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define ALL(v) (v).begin(), (v).end()
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
tem... | [
"expression.unary.arithmetic.remove",
"control_flow.branch.else.remove",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add",
"expression.unary.arithmetic.add"
] | 1,367,811 | 1,367,812 | u442810826 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, now = 0, out = 0;
cin >> N;
string S, ans;
cin >> S;
stack<char> st;
ans = S;
for (int i = 0; i < N; i++) {
if (S[i] == '(') {
now = i;
st.push('(');
} else {
if (st.empty()) {
ans.insert(now, "(");
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, now = 0, out = 0;
cin >> N;
string S, ans;
cin >> S;
stack<char> st;
ans = S;
for (int i = 0; i < N; i++) {
if (S[i] == '(') {
st.push('(');
} else {
if (st.empty()) {
ans.insert(now, "(");
} else {
... | [] | 1,367,823 | 1,367,824 | u926416331 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<char> S(N);
int count_f = 0, count_b = 0;
int count = 0;
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
for (int i = 0; i < N; i++) {
char x = S.at(i);
if (x == '(') {
if (count < 0)
count = 0;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<char> S(N);
int count_f = 0, count_b = 0;
int count = 0;
for (int i = 0; i < N; i++) {
cin >> S.at(i);
}
for (int i = 0; i < N; i++) {
char x = S.at(i);
if (x == '(') {
if (count < 0)
count = 0;
... | [
"assignment.add"
] | 1,367,825 | 1,367,826 | u462451018 | cpp |
p03696 | #include <algorithm>
#include <bitset>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000... | #include <algorithm>
#include <bitset>
#include <cstdint>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const long long mod = 1000000... | [
"assignment.add"
] | 1,367,827 | 1,367,828 | u702051956 | cpp |
p03696 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
string s, ans;
cin >> ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int n;
cin >> n;
string s, ans;
cin >> ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,367,829 | 1,367,830 | u199184624 | cpp |
p03696 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; i++)
... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, p, q) for (int i = p; i < q; i++)
... | [
"expression.operation.compare.replace.remove",
"assignment.replace.add",
"misc.typo"
] | 1,367,838 | 1,367,839 | u693569496 | cpp |
p03696 | #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... | [
"expression.unary.arithmetic.add"
] | 1,367,844 | 1,367,845 | u633284019 | cpp |
p03696 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#define pii pair<int, int>
#defin... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#define pii pair<int, int>
#defin... | [
"control_flow.break.add"
] | 1,367,846 | 1,367,847 | u241367243 | cpp |
p03696 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#define pii pair<int, int>
#defin... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ll long long
#define pii pair<int, int>
#defin... | [
"control_flow.break.add"
] | 1,367,848 | 1,367,847 | u241367243 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
int n;
const int maxn = 105;
string st;
bool used[maxn];
void solve_c() {
cin >> n;
cin >> st;
int ri = 0;
for (int le = 1; le <= n; le++) {
if (st[le - 1] == ')')
continue;
for (ri = max(ri, le); ri <= n; ri++) {
if (st[ri - 1] == ')') {
... | #include <bits/stdc++.h>
using namespace std;
int n;
const int maxn = 105;
string st;
bool used[maxn];
void solve_c() {
cin >> n;
cin >> st;
int ri = 0;
for (int le = 1; le <= n; le++) {
if (st[le - 1] == ')')
continue;
for (ri = max(ri + 1, le); ri <= n; ri++) {
// cout << le << ' ' << ri... | [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 1,367,852 | 1,367,853 | u452118336 | cpp |
p03696 | #include <bits/stdc++.h>
#define fo(i, w, n) for (int i = (int)w; i < (int)n; i++)
#define qi queue<int>
#define vi vector<int>
#define ll long long
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pii pair<int, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define fi first
#... | #include <bits/stdc++.h>
#define fo(i, w, n) for (int i = (int)w; i < (int)n; i++)
#define qi queue<int>
#define vi vector<int>
#define ll long long
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define pii pair<int, int>
#define mp make_pair
#define all(a) (a).begin(), (a).end()
#define fi first
#... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,367,854 | 1,367,855 | u535589138 | cpp |
p03696 | #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;
deque<char> que;
for (int i = 0; i < N; i++) {
char c;
cin >> c;
que.push_back(c);
}
int cnt = 0;
int idx = 0;
for (in... | #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;
deque<char> que;
for (int i = 0; i < N; i++) {
char c;
cin >> c;
que.push_back(c);
}
int cnt = 0;
int idx = 0;
for (in... | [
"control_flow.branch.else.add"
] | 1,367,862 | 1,367,863 | u140450365 | cpp |
p03696 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define lp(n) for (int i = 0; i < n; i++)
#define LP(n, i) for (int i = 0; i < n; i++)
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define intmin -2147483637
#define llmax 922337203685477... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
#define lp(n) for (int i = 0; i < n; i++)
#define LP(n, i) for (int i = 0; i < n; i++)
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define intmin -2147483637
#define llmax 922337203685477... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.change"
] | 1,367,864 | 1,367,865 | u015514760 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) FOR(i, n, 0);
signed main() {
cin.tie(0);
cout << setprecision(10)... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a); i >= (b); i--)
#define RREP(i, n) FOR(i, n, 0);
signed main() {
cin.tie(0);
cout << setprecision(10)... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,367,866 | 1,367,867 | u334351654 | cpp |
p03696 | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <un... | [
"literal.string.change",
"assignment.value.change"
] | 1,367,872 | 1,367,873 | u318334550 | cpp |
p03696 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend()) // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace s... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend()) // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define MOD 1000000007
using namespace s... | [
"assignment.add"
] | 1,367,878 | 1,367,879 | u493750228 | cpp |
p03696 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<bool> flag(100, false);
int left = 0, right = 0;
for (int i = 0; i < n; i++) {
if (flag[i])
continue;
bool ok = false;
if (s[i] == '(') {
for (int j = i + 1; j < n; ... | #include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
vector<bool> flag(100, false);
int left = 0, right = 0;
for (int i = 0; i < n; i++) {
if (flag[i])
continue;
bool ok = false;
if (s[i] == '(') {
for (int j = i + 1; j < n; ... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,367,886 | 1,367,887 | u633402865 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
template <class T> using lim = numeric_limits<T>;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
char s[n];
string ans = "";
int tracker = 0;
for (int i = 0; i < n; i++) {
c... | #include <bits/stdc++.h>
using namespace std;
template <class T> using lim = numeric_limits<T>;
typedef long long ll;
typedef long double ld;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
char s[n];
string ans = "";
int tracker = 0;
for (int i = 0; i < n; i++) {
c... | [
"assignment.value.change",
"assignment.change"
] | 1,367,888 | 1,367,889 | u712768978 | cpp |
p03696 | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int left = 0;
int right = 0;
int l = 0;
int r = 0;
for (int i = 0; i < N; i++) {
if (S[i] == ')') {
l++;
} else {
l--;
}
left = max(left, l);
... | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int left = 0;
int right = 0;
int l = 0;
int r = 0;
for (int i = 0; i < N; i++) {
if (S[i] == ')') {
l++;
} else {
l--;
}
left = max(left, l);
... | [
"assignment.change",
"expression.operation.binary.remove"
] | 1,367,892 | 1,367,893 | u904123392 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
string Scopy = S;
bool exist = true;
while (exist) {
exist = false;
if (Scopy.size() == 1)
break;
for (int i = 0; i < Scopy.size() - 1; i++) {
if (Scopy.at(i) == '(' && Scopy.at(i + 1) ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
string Scopy = S;
bool exist = true;
while (exist) {
exist = false;
if (Scopy.size() <= 1)
break;
for (int i = 0; i < Scopy.size() - 1; i++) {
if (Scopy.at(i) == '(' && Scopy.at(i + 1) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,367,896 | 1,367,897 | u642120132 | cpp |
p03696 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
template <typename T> bool chmax(T &a, const T &b) {
if (a <= b) {
a = b;
return (true);
} else {
return... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
template <typename T> bool chmax(T &a, const T &b) {
if (a <= b) {
a = b;
return (true);
} else {
return... | [
"expression.operation.binary.add"
] | 1,367,898 | 1,367,899 | u408910484 | cpp |
p03696 | #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
string s1 = s;
int R_count = 0, L_count = 0;
for (int i = 0; i < s1.size(); i++) {
if (s1[i] == '(') {
bool flag = true;
for (int j = i; j < s1.size(); j++) {
if (s1[j] == ')') {
s1[i] = '... | #include <iostream>
using namespace std;
int main() {
int n;
string s;
cin >> n >> s;
string s1 = s;
int R_count = 0, L_count = 0;
for (int i = 0; i < s1.size(); i++) {
if (s1[i] == '(') {
bool flag = true;
for (int j = i; j < s1.size(); j++) {
if (s1[j] == ')') {
s1[i] = '... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,367,900 | 1,367,901 | u094746828 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF (1000000000)
#define MOD (1000000007)
#define MAX (100000)
#define pii pair<int, int>
/////////////////////////////////////////////////////////
class XY... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (ll i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define INF (1000000000)
#define MOD (1000000007)
#define MAX (100000)
#define pii pair<int, int>
/////////////////////////////////////////////////////////
class XY... | [
"control_flow.branch.if.condition.change"
] | 1,367,909 | 1,367,910 | u855985627 | cpp |
p03696 | #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) ... | #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,367,912 | 1,367,913 | u561443723 | cpp |
p03696 | #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) ... | #include <bits/stdc++.h>
#include <math.h>
#include <stdlib.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) ... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change"
] | 1,367,914 | 1,367,913 | u561443723 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
string S;
int main() {
cin >> N >> S;
string ans = "";
bool f = false;
int a = 0, b = 0;
int j = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '(') {
if (f) {
if (b > a) {
ans = string(b - a, '(') + ans;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int N;
string S;
int main() {
cin >> N >> S;
string ans = "";
bool f = false;
int a = 0, b = 0;
int j = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '(') {
if (f) {
if (b > a) {
ans = string(b - a, '(') + ans;... | [
"assignment.change"
] | 1,367,917 | 1,367,918 | u488352661 | cpp |
p03696 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
string s;
int x = 0, mi = 0;
rep(i, n) {
if (s[i] == '(')
x++;
if (s[i] == ')')
x--;
mi = min(mi, x);
}
rep(i, -mi) s = "(" + s;
rep(... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
int main() {
int n;
cin >> n;
string s;
cin >> s;
int x = 0, mi = 0;
rep(i, n) {
if (s[i] == '(')
x++;
if (s[i] == ')')
x--;
mi = min(mi, x);
}
rep(i, -mi) s = "("... | [] | 1,367,919 | 1,367,920 | u747390421 | cpp |
p03696 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, cnt = 10000, c = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
c++;
} else {
c--;
}
cnt = min(cnt, c);
}
for (int i ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, cnt = 0, c = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
c++;
} else {
c--;
}
cnt = min(cnt, c);
}
for (int i = 0;... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,367,925 | 1,367,926 | u401900157 | cpp |
p03696 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, cnt = 1000, c = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
c++;
} else {
c--;
}
cnt = min(cnt, c);
}
for (int i =... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, cnt = 0, c = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
c++;
} else {
c--;
}
cnt = min(cnt, c);
}
for (int i = 0;... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,367,927 | 1,367,926 | u401900157 | cpp |
p03696 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, cnt = 1000, c = 0;
string s;
cin >> n >> s;
for (int i = 0; i < s.size(); i++) {
if (s[i] == '(') {
c++;
} else {
c--;
}
cnt = min(cnt, c);
}
for (... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, cnt = 0, c = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
c++;
} else {
c--;
}
cnt = min(cnt, c);
}
for (int i = 0;... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.remove"
] | 1,367,928 | 1,367,926 | u401900157 | cpp |
p03696 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, cnt = 1000, c = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
c++;
} else {
c--;
}
cnt = min(cnt, c);
}
for (int i =... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
using namespace std;
int main() {
int n, cnt = 0, c = 0;
string s;
cin >> n >> s;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
c++;
} else {
c--;
}
cnt = min(cnt, c);
}
for (int i = 0;... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,367,929 | 1,367,926 | u401900157 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.