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 |
|---|---|---|---|---|---|---|---|
p03696 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rrep(i, ... | [] | 1,367,930 | 1,367,931 | u277556971 | cpp |
p03696 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N;
string S;
cin >> N >> S;
/... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll N;
string S;
cin >> N >> S;
/... | [
"literal.string.change",
"variable_access.subscript.index.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,367,936 | 1,367,937 | u048791623 | cpp |
p03696 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define all_map(itr, mp) for (auto itr = mp.begin(); itr != mp.end(); itr++)
... | [] | 1,367,938 | 1,367,939 | u969116807 | cpp |
p03696 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
const ll MOD = 1e9 + 7;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
string prev = s;
whi... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <iostream>
#include <map>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
const ll MOD = 1e9 + 7;
int main() {
ll n;
cin >> n;
string s;
cin >> s;
string prev = s;
whi... | [
"identifier.change",
"call.arguments.change"
] | 1,367,942 | 1,367,943 | u789199225 | cpp |
p03696 | // #pragma GCC optimize("unroll-loops", "omit-frame-pointer", "inline")
// #pragma GCC option("arch=native", "tune=native", "no-zero-upper")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("tree-vectorize","openmp","predic... | // #pragma GCC optimize("unroll-loops", "omit-frame-pointer", "inline")
// #pragma GCC option("arch=native", "tune=native", "no-zero-upper")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("tree-vectorize","openmp","predic... | [
"call.add",
"call.arguments.change"
] | 1,367,944 | 1,367,945 | u379947938 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
string s, t;
ll n;
cin >> n >> s;
t = s;
bool ch = true;
;
while (ch) {
ch = false;
for (int i = 0; i < t.size() - 1; i++) {
if (t[i] == '(' && t[i + 1] == ')') {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
string s, t;
ll n;
cin >> n >> s;
t = s;
bool ch = true;
;
while (ch) {
ch = false;
for (int i = 0; i < ll(t.size() - 1); i++) {
if (t[i] == '(' && t[i + 1] == ')') ... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"call.add"
] | 1,367,948 | 1,367,949 | u166378830 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
string s, t;
ll n;
cin >> n >> s;
t = s;
bool ch = true;
;
while (ch) {
ch = false;
for (int i = 0; i < t.size() - 1; i++) {
if (t[i] == '(' && t[i + 1] == ')') {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
int main() {
string s, t;
ll n;
cin >> n >> s;
t = s;
bool ch = true;
;
while (ch) {
ch = false;
for (int i = 0; i < ll(t.size() - 1); i++) {
if (t[i] == '(' && t[i + 1] == ')') ... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"call.add",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,367,950 | 1,367,949 | u166378830 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define REPD(i, n) for (ll i = (ll)(n)-1; i >= 0; i--)
#define FOR(i, a, b) for (ll i = (a); i <= (b); i++)
#define FORD(i, a, b) for (ll i = (a); i >= (b); i--)
#define ALL(x) (x).begin(), (x).end()... | [
"expression.operation.unary.arithmetic.remove",
"call.arguments.change"
] | 1,367,960 | 1,367,961 | u704658587 | cpp |
p03696 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#defi... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#defi... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,367,964 | 1,367,965 | u103557284 | cpp |
p03696 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#defi... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#defi... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,367,966 | 1,367,965 | u103557284 | cpp |
p03696 | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
string s;
int t = 0;
cin >> n >> s;
string str = s;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
break;
} else {
str = '(' + str;
}
}
s = str;
for (int i = s.length() - 1; i >= 0; i--) {
if (... | #include <cstdio>
#include <iostream>
using namespace std;
int main() {
int n;
string s;
int t = 0;
cin >> n >> s;
string str = s;
for (int i = 0; i < n; i++) {
if (s[i] == '(') {
break;
} else {
str = '(' + str;
}
}
s = str;
for (int i = s.length() - 1; i >= 0; i--) {
if (... | [
"assignment.variable.change",
"identifier.change",
"assignment.add"
] | 1,367,969 | 1,367,970 | u089230684 | cpp |
p03696 | #include <bits/stdc++.h>
#define rep(i, n) for (long long int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (long long int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (long long int i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Abs(a, b) max(a, b) - m... | #include <bits/stdc++.h>
#define rep(i, n) for (long long int(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (long long int i = (a); i < (b); i++)
#define rrrep(i, a, b) for (long long int i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define pb(q) push_back(q)
#define Abs(a, b) max(a, b) - m... | [] | 1,367,971 | 1,367,972 | u876335718 | cpp |
p03696 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <queue>
#include <stack>
#include <vector>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPI(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
usi... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits>
#include <queue>
#include <stack>
#include <vector>
#define REP(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define REPI(i, a, b) for (int(i) = (a); (i) < (b); (i)++)
#define INF numeric_limits<double>::infinity()
constexpr long MOD = 1e9 + 7;
usi... | [] | 1,367,975 | 1,367,976 | u210718367 | cpp |
p03696 | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
string S;
cin >> N >> S;
string ans;
int l = 0, r = 0;
for (int i = N - 1; i >= 0; i--) {
if (S[i] == ')') {
r++;
} else if (r - l < 0) {
l++;
S += ')';
r++;
} else {
l++;
}
... | #include <iostream>
#include <string>
using namespace std;
int main(void) {
int N;
string S;
cin >> N >> S;
string ans;
int l = 0, r = 0;
for (int i = N - 1; i >= 0; i--) {
if (S[i] == ')') {
r++;
} else if (r - l <= 0) {
l++;
S += ')';
r++;
} else {
l++;
}
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,367,989 | 1,367,990 | u976833038 | cpp |
p03696 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#... | [
"identifier.change"
] | 1,367,991 | 1,367,992 | u537874719 | cpp |
p03696 |
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define dump(x) cerr << #x << " = " << (x) << endl
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" ... |
#include <bits/stdc++.h>
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define dump(x) cerr << #x << " = " << (x) << endl
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" ... | [
"variable_declaration.value.change"
] | 1,367,993 | 1,367,994 | u089177147 | cpp |
p03696 | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
cin >> n;
char s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
int min = 0;
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
count++;
if (s[i] == ')')
count--;
if (min > count)
... | #include <iostream>
#include <stdio.h>
using namespace std;
int main() {
int n;
cin >> n;
char s[n];
for (int i = 0; i < n; i++)
cin >> s[i];
int min = 0;
int count = 0;
for (int i = 0; i < n; i++) {
if (s[i] == '(')
count++;
if (s[i] == ')')
count--;
if (min > count)
... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,368,003 | 1,368,004 | u461415203 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define euc_dis(x, y) sqrt(x *x + y * y)
#define MOD 1e9 + 7
#define sp ' '
using ll = long long;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll... | #include <bits/stdc++.h>
using namespace std;
// repetition
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define euc_dis(x, y) sqrt(x *x + y * y)
#define MOD 1e9 + 7
#define sp ' '
using ll = long long;
ll mod(ll a, ll b) { return (a % b + b) % b; }
ll gcd(ll... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,368,005 | 1,368,006 | u306142032 | cpp |
p03696 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
... | [
"call.add"
] | 1,368,008 | 1,368,009 | u874996917 | cpp |
p03696 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int ... |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,368,010 | 1,368,011 | u874996917 | cpp |
p03696 |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int ... |
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,368,010 | 1,368,012 | u874996917 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int tmp = 0;
int rightclose = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '(') {
tmp++;
} else {
if (tmp == 0) {
rightclose++;
} else {
tmp--;
}
}
}
tmp... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
string S;
cin >> S;
int tmp = 0;
int rightclose = 0;
for (int i = 0; i < N; i++) {
if (S[i] == '(') {
tmp++;
} else {
if (tmp == 0) {
rightclose++;
} else {
tmp--;
}
}
}
tmp... | [] | 1,368,013 | 1,368,014 | u816742421 | cpp |
p03696 | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int max = 0, now = 0, mi = 0;
for (int i = 0; i < N; ++i) {
if (S[i] == '(')
--now;
else
++now;
if (max <= now) {
max = now;
mi = i;
}
}
now = 0;
for (int i = ... | #include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string S;
cin >> N >> S;
int max = 0, now = 0, mi = -1;
for (int i = 0; i < N; ++i) {
if (S[i] == '(')
--now;
else
++now;
if (max <= now) {
max = now;
mi = i;
}
}
now = 0;
for (int i =... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,368,019 | 1,368,020 | u297367372 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int main() {
string str;
int n;
cin >> n;
cin >> str;
string s;
s = str;
int count = 0;
int idx = 0;
while (idx = (int)str.find("()") + 1) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
int main() {
string str;
int n;
cin >> n;
cin >> str;
string s;
s = str;
int count = 0;
int idx = 0;
while (idx = (int)str.find("()") + 1) {
... | [
"literal.string.change",
"assignment.value.change",
"control_flow.loop.condition.change"
] | 1,368,024 | 1,368,025 | u310101703 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
int main() {
{
int n;
cin >> n;
}
string s;
cin >> s;
int_fast64_t cur(0), mn(9999);
for (auto i : s) {
cur += (i ^ '(') ? -1 : 1;
mn = min(cur, mn);
}
cur -= mn;
for (; ++mn <= 0; fputc('(', stdout))
;
cout << s;
for (; --cur >= 0... | #include <bits/stdc++.h>
using namespace std;
int main() {
{
int n;
cin >> n;
}
string s;
cin >> s;
int_fast64_t cur(0), mn(0);
for (auto i : s) {
cur += (i ^ '(') ? -1 : 1;
mn = min(cur, mn);
}
cur -= mn;
for (; ++mn <= 0; fputc('(', stdout))
;
cout << s;
for (; --cur >= 0; f... | [
"literal.number.change",
"call.arguments.change"
] | 1,368,028 | 1,368,029 | u462437857 | cpp |
p03696 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
... | [
"variable_declaration.value.change"
] | 1,368,036 | 1,368,037 | u548624367 | cpp |
p03696 | #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::string s;
char t = '!';
std::string s2 = "";
if (n != 1)
std::cin >> s;
else
std::cin >> t;
if (t != '!') {
std::cout << "()" << std::endl;
return 0;
}
int c = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '(')
... | #include <bits/stdc++.h>
int main() {
int n;
std::cin >> n;
std::string s;
char t = '!';
std::string s2 = "";
if (n != 1)
std::cin >> s;
else
std::cin >> t;
if (t != '!') {
std::cout << "()" << std::endl;
return 0;
}
int c = 0;
for (int i = 0; i < n; ++i) {
if (s[i] == '(')
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,368,040 | 1,368,041 | u604693716 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int n;
string s;
stack<char> a;
int main() {
cin >> n >> s;
rep(i, n) {
if (a.empty())
a.push(s[i]);
else if (a.top() = '(' && s[i] == ')')
a.pop();
else
a.push(s[i]);
}
int as = 0, ad = 0... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
int n;
string s;
stack<char> a;
int main() {
cin >> n >> s;
rep(i, n) {
if (a.empty())
a.push(s[i]);
else if (a.top() == '(' && s[i] == ')')
a.pop();
else
a.push(s[i]);
}
int as = 0, ad = ... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,368,042 | 1,368,043 | u006686215 | cpp |
p03696 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<long long> vll, vLL;
#define FOR(i, a, b) for (in... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef vector<vector<int>> vvint;
typedef vector<long long> vll, vLL;
typedef vector<long long> vll, vLL;
#define FOR(i, a, b) for (in... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,368,044 | 1,368,045 | u652420316 | cpp |
p03696 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define pb push_back
#define fi first
#define se second
typedef long ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define pb push_back
#define fi first
#define se second
typedef long ... | [
"literal.string.change",
"expression.operation.binary.change"
] | 1,368,048 | 1,368,049 | u693027786 | cpp |
p03696 | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define Nmax 200010
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define RFOR(i, a, b) for (long long i = (b - 1); i >= a; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ITR(itr, mp) for (auto itr = (mp).beg... | #include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
#define Nmax 200010
#define FOR(i, a, b) for (long long i = (a); i < (b); i++)
#define RFOR(i, a, b) for (long long i = (b - 1); i >= a; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ITR(itr, mp) for (auto itr = (mp).beg... | [] | 1,368,050 | 1,368,051 | u969059993 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define FOR(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)
#define REP(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
tem... | #include <bits/stdc++.h>
using namespace std;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
#define FOR(i, a, n) for (int i = (a), i##_len = (n); i < i##_len; ++i)
#define REP(i, n) FOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
tem... | [
"expression.operation.binary.remove"
] | 1,368,054 | 1,368,055 | u142014975 | cpp |
p03696 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string s;
cin >> N;
cin >> s;
int sum = 0;
int minv = 100100100;
for (int i = 0; i < N; i++) {
sum += s[i] == '(' ? 1 : -1;
if (minv > sum) {
minv = sum;
}
}
// cout << "minv = " ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
string s;
cin >> N;
cin >> s;
int sum = 0;
int minv = 0;
for (int i = 0; i < N; i++) {
sum += s[i] == '(' ? 1 : -1;
if (minv > sum) {
minv = sum;
}
}
// cout << "minv = " << minv ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,368,056 | 1,368,057 | u453764945 | cpp |
p03696 | #include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define ll long long int
#define MOD 1000000007LL
using namespace std;
int main() {
int n;
cin >> n;
string s;
... | #include <algorithm>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
#define ll long long int
#define MOD 1000000007LL
using namespace std;
int main() {
int n;
cin >> n;
string s;
... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,368,063 | 1,368,064 | u924339359 | cpp |
p03696 | #include <iostream>
#include <string>
using namespace std;
int n;
int D[110];
string S;
int main() {
cin >> n;
cin >> S;
int left = 0, right = 0, x = 100;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '(')
left++;
else
right++;
D[i] = left - right;
if (x > D[i])
x = D[i];
... | #include <iostream>
#include <string>
using namespace std;
int n;
int D[110];
string S;
int main() {
cin >> n;
cin >> S;
int left = 0, right = 0, x = 0;
for (int i = 0; i < S.size(); i++) {
if (S[i] == '(')
left++;
else
right++;
D[i] = left - right;
if (x > D[i])
x = D[i];
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,368,065 | 1,368,066 | u623954643 | cpp |
p03696 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>
//#include "util.k"
using namespace std;
//呪文
#define DUMPOUT cout
#define dump(...) \
DUMPOUT << " "; \
DUMPOUT << #... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>
//#include "util.k"
using namespace std;
//呪文
#define DUMPOUT cout
#define dump(...) \
DUMPOUT << " "; \
DUMPOUT << #... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change",
"control_flow.branch.while.replace.add",
"control_flow.loop.if.replace.remove"
] | 1,368,067 | 1,368,068 | u034865202 | cpp |
p03696 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define reps(i, s, n) for (int(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
using ll = long long;
int main() {
int n;
string s, ans;
cin >> n;
cin >> s;
ans = s;
int l = 0, r = 0;
rep(i, s.len... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define reps(i, s, n) for (int(i) = (s); (i) < (n); ++(i))
#define rep(i, n) reps(i, 0, n)
using ll = long long;
int main() {
int n;
string s, ans;
cin >> n;
cin >> s;
ans = s;
int l = 0, r = 0;
rep(i, s.len... | [
"identifier.change",
"io.output.change"
] | 1,368,069 | 1,368,070 | u704411633 | cpp |
p03696 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
char c[105];
int nl = 0, nr = 0;
scanf("%d%*c", &n);
for (int i = 0; i < n; ++i) {
scanf("%c", &c[i]);
if (c[i] == ')') {
++nr;
if (nl) {
--nr;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int main() {
int n;
char c[105] = {0};
int nl = 0, nr = 0;
scanf("%d%*c", &n);
for (int i = 0; i < n; ++i) {
scanf("%c", &c[i]);
if (c[i] == ')') {
++nr;
if (nl) {
-... | [
"variable_declaration.value.change"
] | 1,368,071 | 1,368,072 | u116009323 | cpp |
p03696 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a = 0, b = 0, flag = 0;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == ')') {
if (flag == 0)
++b;
else
--flag;
... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <string>
using namespace std;
int main() {
int n, a = 0, b = 0, flag = 0;
string s;
cin >> n;
cin >> s;
for (int i = 0; i < n; i++) {
if (s[i] == ')') {
if (flag == 0)
++a;
else
--flag;
}... | [
"identifier.change"
] | 1,368,073 | 1,368,074 | u805420484 | cpp |
p03696 |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
... |
#include "bits/stdc++.h"
using namespace std;
using ll = long long;
const double pi = acos(-1);
#define FOR(i, a, b) for (ll i = (a), __last_##i = (b); i < __last_##i; i++)
#define RFOR(i, a, b) for (ll i = (b)-1, __last_##i = (a); i >= __last_##i; i--)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
... | [
"expression.operation.binary.add"
] | 1,368,084 | 1,368,085 | u800551451 | cpp |
p03696 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (in... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < ((int)(n)); i++)
#define reg(i, a, b) for (in... | [
"variable_declaration.value.change"
] | 1,368,088 | 1,368,089 | u372786981 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
#define M 30005
#define N 105
int a[N];
int main() {
int ma = -100, mi = 1000, sum = 0, i, j, n, num = 0, n1 = 0;
string s;
char t;
cin >> n;
cin >> s;
for (i = 0; i < n; i++) {
if (s[i] == '(')
a[i] = 1;
else
a[i] = -1;
sum += a[i];
... | #include <bits/stdc++.h>
using namespace std;
#define M 30005
#define N 105
int a[N];
int main() {
int ma = 0, mi = 0, sum = 0, i, j, n, num = 0, n1 = 0;
string s;
char t;
cin >> n;
cin >> s;
for (i = 0; i < n; i++) {
if (s[i] == '(')
a[i] = 1;
else
a[i] = -1;
sum += a[i];
mi = m... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,368,094 | 1,368,095 | u242521956 | cpp |
p03696 | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int counter = 0;
int start = 0;
for (int i = 0; i < s.size(... | #include <algorithm>
#include <functional>
#include <iostream>
#include <numeric>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string s;
cin >> s;
int counter = 0;
int start = 0;
for (int i = 0; i < s.size(... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 1,368,096 | 1,368,097 | u456065785 | cpp |
p03696 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
string a;
// c1 => (
// c2 => )
int c = 0, c1 = 0, c2 = 0;
cin >> a;
for (int i = 0; i < N; i++) {
if (c == 0 && a[i] == ')')
c1++;
else if (a[i] == ')')
... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
string a;
// c1 => (
// c2 => )
int c = 0, c1 = 0, c2 = 0;
cin >> a;
for (int i = 0; i < N; i++) {
if (c == 0 && a[i] == ')')
c1++;
else if (a[i] == ')')
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,368,098 | 1,368,099 | u118951811 | cpp |
p03696 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define lowbit(x) ((x) & (-x))
#define pi acos(-1.0)
#define eps 1e-3
#define MOD 100... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
using namespace std;
#define lowbit(x) ((x) & (-x))
#define pi acos(-1.0)
#define eps 1e-3
#define MOD 100... | [] | 1,368,104 | 1,368,105 | u758675363 | cpp |
p03696 | //#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#defi... | //#define __USE_MINGW_ANSI_STDIO 0
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<int, int> PII;
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#defi... | [
"expression.operation.binary.add"
] | 1,368,106 | 1,368,107 | u333917945 | cpp |
p03697 | // Radhe Radhe
#include <bits/stdc++.h>
#define godspeed \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
... | // Radhe Radhe
#include <bits/stdc++.h>
#define godspeed \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,110 | 1,368,111 | u465068976 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
//#define f(i,a,n) for(ll i=a;i<n;i++)
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
//#define f(i,a,n) for(ll i=a;i<n;i++)
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,114 | 1,368,115 | u049892106 | cpp |
p03697 | /* #### #### # #### # ## # # # # ######
##### # # # # # # # # ## ## ## ## # # #
#### # # # #### # # # # ## # # ## # #####
# # # # # # # # # ###### # # # # # ##### #
# ... | /* #### #### # #### # ## # # # # ######
##### # # # # # # # # ## ## ## ## # # #
#### # # # #### # # # # ## # # ## # #####
# # # # # # # # # ###### # # # # # ##### #
# ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,129 | 1,368,130 | u605428783 | cpp |
p03697 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fast_io \
ios_base::sync_with_stdio(false); ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define fast_io \
ios_base::sync_with_stdio(false); ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,145 | 1,368,146 | u397886197 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
#define nl '\n'
int main() {
int x, y;
cin >> x >> y;
if (x + y > 10)
cout << "error";
else
cout << x + y;
cout << nl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define nl '\n'
int main() {
int x, y;
cin >> x >> y;
if (x + y >= 10)
cout << "error";
else
cout << x + y;
cout << nl;
return 0;
}
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,156 | 1,368,157 | u366204226 | cpp |
p03697 | #include <bits/stdc++.h>
#define rep(i, n) \
; \
for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
long double pi = acos(-1);
const... | #include <bits/stdc++.h>
#define rep(i, n) \
; \
for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
long double pi = acos(-1);
const... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,160 | 1,368,161 | u239316561 | cpp |
p03696 | #include <bits/stdc++.h>
using namespace std;
#pragma GCC diagnostic ignored "-Wmissing-declarations"
#define FINAL_OUT(x) \
{ \
cout << (x) << '\n'; ... | #include <bits/stdc++.h>
using namespace std;
#pragma GCC diagnostic ignored "-Wmissing-declarations"
#define FINAL_OUT(x) \
{ \
cout << (x) << '\n'; ... | [] | 1,368,168 | 1,368,169 | u063337050 | cpp |
p03696 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
#include <functional>
#define int long long
#define inf 1000000007
#define pa pai... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
// #include <boost/multiprecision/cpp_int.hpp>
#include <functional>
#define int long long
#define inf 1000000007
#define pa pai... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,368,172 | 1,368,173 | u834777932 | cpp |
p03696 |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include... |
#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,368,174 | 1,368,175 | u558671021 | cpp |
p03696 | #include "bits/stdc++.h"
#include <fstream>
#include <sys/timeb.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define replrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) replrev(i, 0, n)
#define repi(itr, ds) for ... | #include "bits/stdc++.h"
#include <fstream>
#include <sys/timeb.h>
using namespace std;
#define repl(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repl(i, 0, n)
#define replrev(i, a, b) for (int i = (int)(b)-1; i >= (int)(a); i--)
#define reprev(i, n) replrev(i, 0, n)
#define repi(itr, ds) for ... | [
"variable_declaration.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,368,178 | 1,368,179 | u366676780 | cpp |
p03697 | // C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free So... | // C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free So... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,190 | 1,368,191 | u502694307 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10) {
cout << "erorr" << endl;
} else
cout << a + b << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a, b;
cin >> a >> b;
if (a + b >= 10) {
cout << "error" << endl;
} else
cout << a + b << endl;
} | [
"literal.string.change",
"io.output.change"
] | 1,368,198 | 1,368,199 | u697858600 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define bn(n) (n).begin(), (n).end()
#define FOR(n) for (int i = 0; i < (int)n; i++)
void solve() {
int a, b;
cin >> a >> b;
if (a + b > 10) {
cout << "error\n";
} else {
cout << a + b << "\... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define bn(n) (n).begin(), (n).end()
#define FOR(n) for (int i = 0; i < (int)n; i++)
void solve() {
int a, b;
cin >> a >> b;
if (a + b >= 10) {
cout << "error\n";
} else {
cout << a + b << "... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,207 | 1,368,208 | u067412960 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
// type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first ... | #include <bits/stdc++.h>
using namespace std;
// type
#define ll long long
typedef pair<int, int> P;
//定数
#define INF 1000000000000 // 10^12:∞
#define MOD 1000000007 // 10^9+7:合同式の法
#define MAXR 100000 // 10^5:配列の最大のrange
//略記
#define PB push_back //挿入
#define MP make_pair // pairのコンストラクタ
#define F first ... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 1,368,224 | 1,368,225 | u506464494 | cpp |
p03697 | #include <cstdio>
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a + b < 10) {
printf("Yes\n");
} else {
printf("error\n");
}
return 0;
} | #include <cstdio>
int main() {
int a, b;
scanf("%d%d", &a, &b);
if (a + b < 10) {
printf("%d\n", a + b);
} else {
printf("error\n");
}
return 0;
} | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"call.arguments.add"
] | 1,368,230 | 1,368,231 | u089230684 | cpp |
p03697 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a + b < 10) {
cout << a + b << endl;
}
else if (a + b <= 10) {
cout << "error" << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int a, b;
cin >> a >> b;
if (a + b < 10) {
cout << a + b << endl;
}
else if (a + b >= 10) {
cout << "error" << endl;
}
return 0;
}
| [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,242 | 1,368,243 | u961453359 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
int main(void) {
int b[100000];
int c, d;
int k;
int n, m;
int x;
for (int i = 0; i < 10; i++)
b[i] = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d"... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <queue>
#include <vector>
using namespace std;
int main(void) {
int b[100000];
int c, d;
int k;
int n, m;
int x;
for (int i = 0; i < 10; i++)
b[i] = 0;
scanf("%d", &n);
for (int i = 0; i < n; i++) {
scanf("%d"... | [
"control_flow.branch.else.remove"
] | 1,368,250 | 1,368,251 | u510611356 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define MOD 1e9 + 7
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, a, mor = 0, ans = 0;
vector<bool> c(8);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a >= 3200)
mor++;
else if (a >= 2800)
c[... | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define MOD 1e9 + 7
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, a, mor = 0, ans = 0;
vector<bool> c(8);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a >= 3200)
mor++;
else if (a >= 2800)
c[... | [
"call.remove",
"call.arguments.change"
] | 1,368,252 | 1,368,253 | u139529968 | cpp |
p03695 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using vi = vector<int>;
main() {
int N;
cin >> N;
vi rate(9, 0);
rep(i, N) {
int a;
cin >> a;
a = (a < 3200) ? a / 400 : 8;
rate[a]++;
}
int cmin = 0, cmax = 0;
rep(i, 8) {
if (rate[i] > 0)
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
using vi = vector<int>;
main() {
int N;
cin >> N;
vi rate(9, 0);
rep(i, N) {
int a;
cin >> a;
a = (a < 3200) ? a / 400 : 8;
rate[a]++;
}
int cmin = 0, cmax = 0;
rep(i, 8) {
if (rate[i] > 0)
... | [
"call.remove",
"call.arguments.change"
] | 1,368,254 | 1,368,255 | u858748695 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int var[100005];
int main() {
int n, m = 0;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
int x;
scanf("%d", &x);
x /= 400;
if (x >= 8) {
++m;
} else {
++var[x];
}
}
int minVal = 0;
for (int i = 0; i < 8; ++i) {
if (v... | #include <bits/stdc++.h>
using namespace std;
int var[105];
int main() {
int n, m = 0;
scanf("%d", &n);
for (int i = 1; i <= n; ++i) {
int x;
scanf("%d", &x);
x /= 400;
if (x >= 8) {
++m;
} else {
++var[x];
}
}
int minVal = 0;
for (int i = 0; i < 8; ++i) {
if (var[... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.add",
"call.arguments.add"
] | 1,368,258 | 1,368,259 | u346222974 | cpp |
p03695 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#i... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cctype>
#include <cfloat>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#i... | [
"control_flow.branch.if.condition.change"
] | 1,368,260 | 1,368,261 | u782372423 | cpp |
p03695 | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ---------------------
// repetition
#define FOR(i, a, b) for (... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ---------------------
// repetition
#define FOR(i, a, b) for (... | [
"call.remove",
"call.arguments.change"
] | 1,368,262 | 1,368,263 | u430622110 | cpp |
p03695 | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ---------------------
// repetition
#define FOR(i, a, b) for (... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
// ---------------------
// repetition
#define FOR(i, a, b) for (... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.remove",
"call.arguments.change"
] | 1,368,265 | 1,368,263 | u430622110 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <iterator>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long llong;
typedef unsigned long long ullong... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <iostream>
#include <iterator>
#include <queue>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long llong;
typedef unsigned long long ullong... | [
"literal.number.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,368,270 | 1,368,271 | u409390792 | cpp |
p03695 | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
int main() {
int n;
cin >> n;
int a[10] = {0};
rep(i, n) {
int x;
... | #include <bits/stdc++.h>
#define range(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, b) for (int i = 0; i < (b); i++)
#define all(a) (a).begin(), (a).end()
#define show(x) cerr << #x << " = " << (x) << endl;
using namespace std;
int main() {
int n;
cin >> n;
int a[10] = {0};
rep(i, n) {
int x;
... | [
"call.remove",
"call.arguments.change"
] | 1,368,272 | 1,368,273 | u526532903 | cpp |
p03695 | #include <bits/stdc++.h>
#include <unordered_map>
/*
*▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀
* ▀▀ ▀▀▀▀▀▀ ▀ ▀▀▀▀▀▀ ▀ ▀
* ▀ ▀ ▀ ▀ ▀ ▀ ▀
* ▀ ▀ ▀ ▀ ▀ ▀ ▀ ▀ ▀ ▀
* ▀ ▀▀▀▀ ▀ ▀ ▀ ▀ ▀
*▀ ▀ ▀ ... | #include <bits/stdc++.h>
#include <unordered_map>
/*
*▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀▀
* ▀▀ ▀▀▀▀▀▀ ▀ ▀▀▀▀▀▀ ▀ ▀
* ▀ ▀ ▀ ▀ ▀ ▀ ▀
* ▀ ▀ ▀ ▀ ▀ ▀ ▀ ▀ ▀ ▀
* ▀ ▀▀▀▀ ▀ ▀ ▀ ▀ ▀
*▀ ▀ ▀ ... | [
"variable_declaration.type.change",
"call.add",
"call.arguments.add"
] | 1,368,274 | 1,368,275 | u654605759 | cpp |
p03695 | /*
ID:greenty2
LANG:C++
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
int a[105];
int book[10];
int pd(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... | /*
ID:greenty2
LANG:C++
TASK:
*/
#include <bits/stdc++.h>
using namespace std;
int a[105];
int book[10];
int pd(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... | [
"literal.number.change",
"assignment.value.change"
] | 1,368,276 | 1,368,277 | u327400871 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define ALL(g) (g).begin(), (g).end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#d... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define ALL(g) (g).begin(), (g).end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#d... | [
"call.remove",
"call.arguments.change"
] | 1,368,280 | 1,368,281 | u584355711 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define ALL(g) (g).begin(), (g).end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#d... | #include <algorithm>
#include <cmath>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
#define ALL(g) (g).begin(), (g).end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#d... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change",
"call.remove",
"call.arguments.change"
] | 1,368,282 | 1,368,281 | u584355711 | cpp |
p03695 | #include <bits/stdc++.h>
#ifdef JLOCAL
#include "stress.h"
#endif
using namespace std;
#define rep(i, z, n) for (int i = (z); i < int(n); ++i)
#define repr(i, n, z) for (int i = int(n) - 1; i >= (z); --i)
#define shl(n) (1 << (n))
#define hbit(n, i) (((n) >> (i)) & 1)
#define STRESS 0
using lint = long long;
void so... | #include <bits/stdc++.h>
#ifdef JLOCAL
#include "stress.h"
#endif
using namespace std;
#define rep(i, z, n) for (int i = (z); i < int(n); ++i)
#define repr(i, n, z) for (int i = int(n) - 1; i >= (z); --i)
#define shl(n) (1 << (n))
#define hbit(n, i) (((n) >> (i)) & 1)
#define STRESS 0
using lint = long long;
void so... | [
"literal.number.change",
"io.output.change"
] | 1,368,289 | 1,368,290 | u905053656 | cpp |
p03695 | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
struct edge {
int u, v;
ll w;
};
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int main() {
int N, sum = 0;
int a[100], table[9] = {0};
cin >... | #include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
struct edge {
int u, v;
ll w;
};
ll MOD = 1000000007;
ll _MOD = 1000000009;
double EPS = 1e-10;
int main() {
int N, sum = 0;
int a[100], table[9] = {0};
cin >... | [] | 1,368,291 | 1,368,292 | u112581208 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <limits.h>
using namespace std;
int n, a, m = 0, M = 0, exceed = 0;
bool exist[8] = {};
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < 3200) {
exist[a / 400] = true;
} else {
exceed++;
}
}
for (int i = 0; ... | #include <algorithm>
#include <iostream>
#include <limits.h>
using namespace std;
int n, a, m = 0, M = 0, exceed = 0;
bool exist[8] = {};
int main() {
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a;
if (a < 3200) {
exist[a / 400] = true;
} else {
exceed++;
}
}
for (int i = 0; ... | [
"call.remove",
"call.arguments.change"
] | 1,368,293 | 1,368,294 | u620929606 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define mp make_pair
using namespace std;
int n, a[105], lv[105], ans, mor;
int main() {
cin >> n;
for... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define mp make_pair
using namespace std;
int n, a[105], lv[105], ans, mor;
int main() {
cin >> n;
for... | [
"call.remove",
"call.arguments.change"
] | 1,368,295 | 1,368,296 | u926636247 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define mp make_pair
using namespace std;
int n, a[105], lv[105], ans, mor;
int main() {
cin >> n;
for... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define mp make_pair
using namespace std;
int n, a[105], lv[105], ans, mor;
int main() {
cin >> n;
for... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.remove",
"call.arguments.change"
] | 1,368,297 | 1,368,296 | u926636247 | cpp |
p03695 | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int s = 0;
int mask = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200)
s++;
else if (a >= 2800)
mask |= (1 << 0);
else if (a >= 2400)
mask |= (1 << 1);
else if (a >= 2000)
m... | #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int s = 0;
int mask = 0;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
if (a >= 3200)
s++;
else if (a >= 2800)
mask |= (1 << 0);
else if (a >= 2400)
mask |= (1 << 1);
else if (a >= 2000)
m... | [
"call.remove",
"call.arguments.change"
] | 1,368,300 | 1,368,301 | u511790074 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, bigCt(0);
cin >> n;
vector<bool> v(8, false);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x < 3200)
v[x / 400] = true;
else
bigCt+... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n, bigCt(0);
cin >> n;
vector<bool> v(8, false);
for (int i = 0; i < n; i++) {
int x;
cin >> x;
if (x < 3200)
v[x / 400] = true;
else
bigCt+... | [
"call.remove",
"call.arguments.change"
] | 1,368,304 | 1,368,305 | u190449731 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int n, a[105], sum = 0, num = 0, cnt = 0, vis[10];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] >= 1 && a[i] <= 399)
vis[1] = 1;
if (a[i]... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int n, a[105], sum = 0, num = 0, cnt = 0, vis[10];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] >= 1 && a[i] <= 399)
vis[1] = 1;
if (a[i]... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,368,306 | 1,368,307 | u154273313 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int n, a[105], sum = 0, num = 0, cnt = 0, vis[10];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] >= 1 && a[i] <= 399)
vis[1] = 1;
if (a[i]... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
using namespace std;
int n, a[105], sum = 0, num = 0, cnt = 0, vis[10];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d", &a[i]);
if (a[i] >= 1 && a[i] <= 399)
vis[1] = 1;
if (a[i]... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"identifier.change"
] | 1,368,308 | 1,368,307 | u154273313 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<bool> flags(8);
fill(flags.begin(), flags.end(), false);
int fcnt = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
int idx = a / 400;
if (idx >= 8) {
fcnt++;
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<bool> flags(8);
fill(flags.begin(), flags.end(), false);
int fcnt = 0;
for (int i = 0; i < N; i++) {
int a;
cin >> a;
int idx = a / 400;
if (idx >= 8) {
fcnt++;
... | [
"call.remove",
"call.arguments.change"
] | 1,368,312 | 1,368,313 | u265700560 | cpp |
p03695 | #include <algorithm>
#include <iostream>
#ifdef _MSC_VER
#include <conio.h>
#else
#define getch()
#endif
using namespace std;
int main() {
int n = 0;
bool ans[8] = {};
int res = 0;
int sp = 0;
int st[8] = {399, 799, 1199, 1599, 1999, 2399, 2799, 3199};
cin >> n;
for (int i = 0; i < n; i++) {
int tem... | #include <algorithm>
#include <iostream>
#ifdef _MSC_VER
#include <conio.h>
#else
#define getch()
#endif
using namespace std;
int main() {
int n = 0;
bool ans[8] = {};
int res = 0;
int sp = 0;
int st[8] = {399, 799, 1199, 1599, 1999, 2399, 2799, 3199};
cin >> n;
for (int i = 0; i < n; i++) {
int tem... | [
"call.remove",
"call.arguments.change"
] | 1,368,314 | 1,368,315 | u644856766 | cpp |
p03695 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
int main() {
c... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pdd pair<ld, ld>
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
int main() {
c... | [
"call.remove",
"call.arguments.change"
] | 1,368,316 | 1,368,317 | u797788527 | cpp |
p03695 | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + (ll)b) % mod
#define MUL(a, b) a = (a * (ll)b) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rer(i, a, b) for (int i = a - 1; i >= b; i--)
#define all(a) (a).begin(), (a).end()
#define se... | #include <bits/stdc++.h>
#define ADD(a, b) a = (a + (ll)b) % mod
#define MUL(a, b) a = (a * (ll)b) % mod
#define MAX(a, b) a = max(a, b)
#define MIN(a, b) a = min(a, b)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rer(i, a, b) for (int i = a - 1; i >= b; i--)
#define all(a) (a).begin(), (a).end()
#define se... | [
"call.remove",
"call.arguments.change"
] | 1,368,327 | 1,368,328 | u491153752 | cpp |
p03695 | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
using namespace std;
#define INF 1 << 21
#define DIV 1000000007
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {
int n, a, c, color[8];
int cnt = 0, ans1 = 0, ans2 = 0;
for (int i = ... | #include <algorithm>
#include <functional>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
using namespace std;
#define INF 1 << 21
#define DIV 1000000007
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int main() {
int n, a, c, color[8];
int cnt = 0, ans1 = 0, ans2 = 0;
for (int i = ... | [
"assignment.variable.change",
"identifier.change",
"literal.number.change",
"assignment.value.change"
] | 1,368,329 | 1,368,330 | u158635223 | cpp |
p03695 | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include ... | [
"call.add",
"call.arguments.change"
] | 1,368,331 | 1,368,332 | u764076797 | cpp |
p03695 | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
main() {
int extra = 0;
int arr[8];
for (int i = 0; i < 8; ++i)
arr[i] = 0;
in... | #include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef pair<int, int> pii;
main() {
int extra = 0;
int arr[8];
for (int i = 0; i < 8; ++i)
arr[i] = 0;
in... | [
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 1,368,340 | 1,368,341 | u562777854 | cpp |
p03695 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define re return
#define fi first
#define se s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define re return
#define fi first
#define se s... | [
"literal.number.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 1,368,344 | 1,368,345 | u870421181 | cpp |
p03695 | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ansmin = 0, ansmax = 0;
vector<int> a, b;
cin >> n;
a.resize(n);
b.resize(8);
for (... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ansmin = 0, ansmax = 0;
vector<int> a, b;
cin >> n;
a.resize(n);
b.resize(8);
for (... | [
"call.add",
"call.arguments.add"
] | 1,368,346 | 1,368,347 | u656572785 | cpp |
p03695 | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ansmin = 100, ansmax = 0;
vector<int> a, b;
cin >> n;
a.resize(n);
b.resize(8);
for... | #include <algorithm>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, ansmin = 0, ansmax = 0;
vector<int> a, b;
cin >> n;
a.resize(n);
b.resize(8);
for (... | [
"literal.number.change",
"variable_declaration.value.change",
"call.add",
"call.arguments.add"
] | 1,368,348 | 1,368,347 | u656572785 | cpp |
p03695 | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int MAXN = 2e5;
const int INF = 1e9 + 7;
int a[200];
int fre;
int main() {
int n;
scanf("%d", &n);
vector<int> v;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (x >= 3200) {
fre++;
} else if (x >... | #include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
const int MAXN = 2e5;
const int INF = 1e9 + 7;
int a[200];
int fre;
int main() {
int n;
scanf("%d", &n);
vector<int> v;
for (int i = 1; i <= n; i++) {
int x;
scanf("%d", &x);
if (x >= 3200) {
fre++;
} else if (x >... | [
"call.remove",
"call.arguments.change"
] | 1,368,349 | 1,368,350 | u284439541 | cpp |
p03695 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define MaxN 100
#define INF 2140000000
using namespace std;
int N, X, fr = 0, cool = 0;
bool v[MaxN];
int mai... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <vector>
#define MaxN 100
#define INF 2140000000
using namespace std;
int N, X, fr = 0, cool = 0;
bool v[MaxN];
int mai... | [
"call.add",
"call.arguments.change"
] | 1,368,351 | 1,368,352 | u083314595 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int sum = 0;
int a;
int gr = 0, br = 0, grr = 0, p = 0, d = 0, e = 0, j = 0, k = 0, f = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
a = arr[i] / 400;
if (a == 0)
gr = 1;
if (a >= 1 && a < 2)
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int arr[n];
int sum = 0;
int a;
int gr = 0, br = 0, grr = 0, p = 0, d = 0, e = 0, j = 0, k = 0, f = 0;
for (int i = 0; i < n; i++) {
cin >> arr[i];
a = arr[i] / 400;
if (a == 0)
gr = 1;
if (a >= 1 && a < 2)
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,368,353 | 1,368,354 | u816523040 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 29
#define LINF LLONG_MAX / 3
#define mp make_pair
#define pb push_back
#define EB emplace_back
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define sz(x) (int)(x)... | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 29
#define LINF LLONG_MAX / 3
#define mp make_pair
#define pb push_back
#define EB emplace_back
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define sz(x) (int)(x)... | [
"misc.opposites",
"identifier.change",
"call.function.change",
"io.output.change"
] | 1,368,355 | 1,368,356 | u013750540 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 29
#define LINF LLONG_MAX / 3
#define mp make_pair
#define pb push_back
#define EB emplace_back
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define sz(x) (int)(x)... | #include <bits/stdc++.h>
using namespace std;
/*{{{*/ // template
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1 << 29
#define LINF LLONG_MAX / 3
#define mp make_pair
#define pb push_back
#define EB emplace_back
#define fi first
#define se second
#define all(v) (v).begin(), (v).end()
#define sz(x) (int)(x)... | [
"call.add",
"call.arguments.change"
] | 1,368,357 | 1,368,356 | u013750540 | cpp |
p03695 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
int main() {
int n, l = 0, u = 0;
vector<int> used(8, 0);
cin >> n;
rep(i, n) {
int a;
cin >> a;
int r = a / 400;
if (r < 8 && !used[r]) {
used[r] = 1;
l++;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, N) for (int i = 0; i < (int)N; i++)
int main() {
int n, l = 0, u = 0;
vector<int> used(8, 0);
cin >> n;
rep(i, n) {
int a;
cin >> a;
int r = a / 400;
if (r < 8 && !used[r]) {
used[r] = 1;
l++;
... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 1,368,362 | 1,368,363 | u058252012 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.