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 9
values |
|---|---|---|---|---|---|---|---|
p03017 | #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>
... | [
"expression.unary.arithmetic.add"
] | 839,958 | 839,959 | u314543767 | cpp |
p03017 | // Kenken Race
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i, x, y) for (ll i = x; i < y; i++)
#define irep(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n, a) \
ll n; ... | // Kenken Race
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define int long long
#define rep(i, x, y) for (ll i = x; i < y; i++)
#define irep(i, a) for (auto i = a.begin(); i != a.end(); ++i)
#define nvarep(n, a) \
ll n; ... | [
"expression.operation.binary.remove",
"misc.opposites",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 839,960 | 839,961 | u663842230 | cpp |
p03017 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
string s;
bool can_reach(int l, int r) {
for (int i = l; i < r; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
return false;
}
}
return true;
}
void solve() ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
string s;
bool can_reach(int l, int r) {
for (int i = l; i < r; i++) {
if (s[i] == s[i + 1] && s[i] == '#') {
return false;
}
}
return true;
}
void solve() ... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 839,968 | 839,969 | u796269639 | cpp |
p03017 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 839,972 | 839,971 | u942085302 | cpp |
p03017 | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | #define _GLIBCXX_DEBUG
#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define r... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 839,973 | 839,971 | u942085302 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll gcd(ll x, ll y) { return (x % y) ? gcd(y, x % y) : y; }
int main() {
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
A--;
B--;
C--;
D--;
ll streak_p = 1;
bool flag_swap = false;
bool flag_A = true;
bool ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll gcd(ll x, ll y) { return (x % y) ? gcd(y, x % y) : y; }
int main() {
ll N, A, B, C, D;
string S;
cin >> N >> A >> B >> C >> D >> S;
A--;
B--;
C--;
D--;
ll streak_p = 1;
bool flag_swap = false;
bool flag_A = true;
bool ... | [
"control_flow.loop.for.initializer.change"
] | 840,000 | 840,001 | u000217193 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"expression.operation.binary.add"
] | 840,003 | 840,004 | u347057617 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, j, n) for (int i = (int)(j); i < (int)(n); i++)
#define REP(i, j, n) for (int i = (int)(j); i <= (int)(n); i++)
#define MOD 1000000007
#define int long long
#define ALL(a) (a).begin(), (a).end()
#define vi vector<int>
#define vii vector<vi>
#define pii pair<i... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 840,005 | 840,004 | u347057617 | cpp |
p03017 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 840,012 | 840,013 | u842939260 | cpp |
p03017 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const double PI = acos(-1);
const ll MOD = 1000000007;
template <class T> inline bool chmax(T ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
const double PI = acos(-1);
const ll MOD = 1000000007;
template <class T> inline bool chmax(T ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"literal.number.change"
] | 840,014 | 840,015 | u842939260 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define lb lower_bound
#define ub upper_bound
#define... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 840,026 | 840,027 | u604329931 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <tuple>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
tuple<string, int, int> a[n];
rep(i, n) {
string s;
int p;
cin >> s >> p;
a[i] = tuple<string, int, int>(s, p, i + 1);
}
sort(a... | #include <algorithm>
#include <iostream>
#include <tuple>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
tuple<string, int, int> a[n];
rep(i, n) {
string s;
int p;
cin >> s >> p;
a[i] = tuple<string, int, int>(s, -p, i + 1);
}
sort(... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 840,033 | 840,034 | u431047462 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
struct restraunt {
std::string name;
int score;
int num;
};
int main() {
using namespace std;
int n;
cin >> n;
vector<struct restraunt> s;
for (int i = 0; i < n; i++) {
struct restraunt tmp;
cin >> tmp.name >> tmp.sco... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
struct restraunt {
std::string name;
int score;
int num;
};
int main() {
using namespace std;
int n;
cin >> n;
vector<struct restraunt> s;
for (int i = 0; i < n; i++) {
struct restraunt tmp;
cin >> tmp.name >> tmp.sco... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 840,035 | 840,036 | u102334466 | cpp |
p03030 | #include <stdio.h>
#include <string.h>
struct shop {
int p;
int index;
char s[20];
};
int main(void) {
int n, ret;
ret = scanf("%d", &n);
struct shop shops[n], tmp;
for (int i = 0; i < n; i++) {
ret = scanf("%s %d", shops[i].s, &shops[i].p);
shops[i].index = i;
}
for (int i = 0; i < n; i... | #include <stdio.h>
#include <string.h>
struct shop {
int p;
int index;
char s[20];
};
int main(void) {
int n, ret;
ret = scanf("%d", &n);
struct shop shops[n], tmp;
for (int i = 0; i < n; i++) {
ret = scanf("%s %d", shops[i].s, &shops[i].p);
shops[i].index = i + 1;
}
for (int i = 0; i < ... | [
"assignment.change"
] | 840,062 | 840,063 | u106524514 | cpp |
p03030 | #include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
vector<string> s;
vector<int> p, idx;
cin >> n;
for (int i = 0; i < n; i++) {
string tmp1;
int tmp2;
cin >> tmp1 >> tmp2;
s.push_back(tmp1);
p.push_back(tmp2);
idx.pu... | #include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n;
vector<string> s;
vector<int> p, idx;
cin >> n;
for (int i = 0; i < n; i++) {
string tmp1;
int tmp2;
cin >> tmp1 >> tmp2;
s.push_back(tmp1);
p.push_back(tmp2);
idx.pu... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"misc.off_by_one"
] | 840,073 | 840,074 | u091454649 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
pair<pair<string, int>, int> p[110];
int main() {
int n, score;
char name;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> name >> score;
p[i] = make_pair(make_pair(name, -score), i);
}
sort(p, p + n);
for (int i = 0; i < n; i++) {
cout << p[i].sec... | #include <bits/stdc++.h>
using namespace std;
pair<pair<string, int>, int> p[110];
int main() {
int n, score;
char name[120];
cin >> n;
for (int i = 0; i < n; i++) {
cin >> name >> score;
p[i] = make_pair(make_pair(name, -score), i);
}
sort(p, p + n);
for (int i = 0; i < n; i++) {
cout << p[i... | [] | 840,115 | 840,116 | u818393512 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int N;
pair<string, pair<int, int>> sp[100];
cin >> N;
for (int i = 1; i <= N; i++) {
string str;
int p;
cin >> str >> p;
sp[i - 1].first = str;
sp[i - 1].second.first = p;
sp... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int N;
pair<string, pair<int, int>> sp[100];
cin >> N;
for (int i = 1; i <= N; i++) {
string str;
int p;
cin >> str >> p;
sp[i - 1].first = str;
sp[i - 1].second.first = -p;
s... | [
"expression.operation.unary.add"
] | 840,135 | 840,136 | u569272329 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <vector>
struct Info {
int seq;
std::string name;
int point;
Info(int _s, const std::string &_n, int _p) : seq(_s), name(_n), point(_p){};
};
struct Comp {
bool operator()(const Info &lhs, const Info &rhs) {
if (lhs.name == rhs.name)
return lhs.poi... | #include <algorithm>
#include <iostream>
#include <vector>
struct Info {
int seq;
std::string name;
int point;
Info(int _s, const std::string &_n, int _p) : seq(_s), name(_n), point(_p){};
};
struct Comp {
bool operator()(const Info &lhs, const Info &rhs) {
if (lhs.name == rhs.name)
return lhs.poi... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 840,138 | 840,139 | u481584122 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <vector>
struct Info {
int seq;
std::string name;
int point;
Info(int _s, const std::string &_n, int _p) : seq(_s), name(_n), point(_p){};
};
struct Comp {
bool operator()(const Info &lhs, const Info &rhs) {
if (lhs.name == rhs.name)
return lhs.poi... | #include <algorithm>
#include <iostream>
#include <vector>
struct Info {
int seq;
std::string name;
int point;
Info(int _s, const std::string &_n, int _p) : seq(_s), name(_n), point(_p){};
};
struct Comp {
bool operator()(const Info &lhs, const Info &rhs) {
if (lhs.name == rhs.name)
return lhs.poi... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 840,140 | 840,139 | u481584122 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool pointsort(pair<int, pair<string, int>> a, pair<int, pair<string, int>> b) {
if (a.second.first == b.second.first) {
return b.second.first < a.second.first;
} else {
return b.second.fir... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool pointsort(pair<int, pair<string, int>> a, pair<int, pair<string, int>> b) {
if (a.second.first == b.second.first) {
return b.second.second < a.second.second;
} else {
return b.second.f... | [
"function.return_value.change",
"expression.operation.binary.change"
] | 840,151 | 840,152 | u366651777 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool pointsort(pair<int, pair<string, int>> a, pair<int, pair<string, int>> b) {
if (a.second.first == b.second.first) {
return b.second.first > a.second.first;
} else {
return b.second.fir... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool pointsort(pair<int, pair<string, int>> a, pair<int, pair<string, int>> b) {
if (a.second.first == b.second.first) {
return b.second.second < a.second.second;
} else {
return b.second.f... | [
"control_flow.return.add",
"control_flow.branch.else.add"
] | 840,153 | 840,152 | u366651777 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool pointsort(pair<int, pair<string, int>> a, pair<int, pair<string, int>> b) {
if (a.second.first == b.second.first) {
return b.second.first > a.second.first;
} else {
return b.second.fir... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
bool pointsort(pair<int, pair<string, int>> a, pair<int, pair<string, int>> b) {
if (a.second.first == b.second.first) {
return b.second.second < a.second.second;
} else {
return b.second.f... | [
"function.return_value.change",
"expression.operation.binary.change"
] | 840,154 | 840,152 | u366651777 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, set<pair<int, int>>> mp;
string s;
int p;
for (int i = 1; i <= n; ++i) {
cin >> s >> p;
mp[s].insert(make_pair(p, i));
}
for (auto const &kv : mp) {
for (auto val : kv.second) {
cout << n - val.s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
map<string, set<pair<int, int>>> mp;
string s;
int p;
for (int i = 1; i <= n; ++i) {
cin >> s >> p;
mp[s].insert(make_pair(-p, i));
}
for (auto const &kv : mp) {
for (auto val : kv.second) {
cout << val.seco... | [
"expression.operation.unary.add",
"call.arguments.change",
"expression.operation.binary.remove"
] | 840,160 | 840,161 | u337959231 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
typedef pair<string, int> P;
typedef pair<P, int> data;
vector<data> v;
string S;
int p;
for (int i = 0; i < N; ++i) {
cin >> S >> p;
v.push... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main(void) {
int N;
cin >> N;
typedef pair<string, int> P;
typedef pair<P, int> data;
vector<data> v;
string S;
int p;
for (int i = 0; i < N; ++i) {
cin >> S >> p;
v.push... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 840,167 | 840,168 | u397847744 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <vector>
class element {
public:
int i;
std::string s;
int p;
};
int main() {
int N;
std::cin >> N;
std::vector<element *> resutoran;
resutoran.reserve(N);
for (int i = 0; i < N; i++) {
auto l = new element();
l->i = i + 1;
std::cin >> l-... | #include <algorithm>
#include <iostream>
#include <vector>
class element {
public:
int i;
std::string s;
int p;
};
int main() {
int N;
std::cin >> N;
std::vector<element *> resutoran;
resutoran.reserve(N);
for (int i = 0; i < N; i++) {
auto l = new element();
l->i = i + 1;
std::cin >> l-... | [
"expression.operation.binary.change"
] | 840,177 | 840,178 | u302955938 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
pair<pair<string, int>, int> p[110];
string S[110];
int P[110];
for (int i = 1; i <= N; i++) {
cin >> S[i];
cin >> P[i];
p[i] = make_pair(make_pair(S[i], -P[i]), i);
}
sort(p + ... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
int main() {
int N;
cin >> N;
pair<pair<string, int>, int> p[110];
string S[110];
int P[110];
for (int i = 1; i <= N; i++) {
cin >> S[i];
cin >> P[i];
p[i] = make_pair(make_pair(S[i], -P[i]), i);
}
sort(p + ... | [
"io.output.change"
] | 840,179 | 840,180 | u582357587 | cpp |
p03030 | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define MP make_pair
#define PB push_back
int main() {
vector<pair<string, pair<int, int>>> v;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
string S;
int P;
cin >> S >> P;
v.PB({S, {P, i + 1}});
}
sort(v.begin(), v.end());... | #include "bits/stdc++.h"
using namespace std;
#define LL long long
#define MP make_pair
#define PB push_back
int main() {
vector<pair<string, pair<int, int>>> v;
int N;
cin >> N;
for (int i = 0; i < N; i++) {
string S;
int P;
cin >> S >> P;
v.PB({S, {-P, i + 1}});
}
sort(v.begin(), v.end())... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 840,190 | 840,191 | u422592877 | cpp |
p03030 |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i) >> P.at(i);
}
vector<pair<string, int>> T(N);
vector<pair<string, int>> U(N);
for (int i = 0; i < N; i++) {
T.at(i) = make_pair(... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i) >> P.at(i);
}
vector<pair<string, int>> T(N);
vector<pair<string, int>> U(N);
for (int i = 0; i < N; i++) {
T.at(i) = make_pair... | [
"identifier.change",
"call.arguments.change"
] | 840,200 | 840,201 | u096717230 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i) >> P.at(i);
}
vector<pair<string, int>> T(N);
vector<pair<string, int>> U(N);
for (int i = 0; i < N; i++) {
T.at(i) = make_pair(S... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i) >> P.at(i);
}
vector<pair<string, int>> T(N);
vector<pair<string, int>> U(N);
for (int i = 0; i < N; i++) {
T.at(i) = make_pair... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 840,202 | 840,201 | u096717230 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> S(N);
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i) >> P.at(i);
}
vector<pair<string, int>> T(N);
vector<pair<string, int>> U(N);
for (int i = 0; i < N; i++) {
T.at(i) = make_pair(S.at... |
#include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
vector<int> P(N);
for (int i = 0; i < N; i++) {
cin >> S.at(i) >> P.at(i);
}
vector<pair<string, int>> T(N);
vector<pair<string, int>> U(N);
for (int i = 0; i < N; i++) {
T.at(i) = make_pair... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 840,203 | 840,201 | u096717230 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> a;
for (int i = 1; i <= N; i++) {
string s;
int p;
cin >> s;
cin >> p;
p = -p;
a.push_back(tie(s, p, i));
}
sort(a.begin(), a.end());
for (int i = 1; i <= N; i++) {
c... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> a;
for (int i = 1; i <= N; i++) {
string s;
int p;
cin >> s >> p;
p = -p;
a.push_back(tie(s, p, i));
}
sort(a.begin(), a.end());
for (int i = 0; i < N; i++) {
cout << get... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 840,217 | 840,218 | u800100718 | cpp |
p03030 | #include <bits/stdc++.h>
#include <string>
#include <tuple>
using namespace std;
/*
2019/05/26
*/
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a; // what tuple?
for (int i = 1; i <= n; i++) {
string s;
int p;
cin >> s >> p;
p = -p; //点数が高いほど小さくなる（上に）
a.emplace_back(tie(s, p,... | #include <bits/stdc++.h>
#include <string>
#include <tuple>
using namespace std;
/*
2019/05/26
*/
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a; // what tuple?
for (int i = 1; i <= n; i++) {
string s;
int p;
cin >> s >> p;
p = -p; //点数が高いほど小さくなる（上に）
a.emplace_back(tie(s, p,... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 840,229 | 840,230 | u538853954 | cpp |
p03030 | #include <bits/stdc++.h>
#include <string>
#include <tuple>
using namespace std;
/*
2019/05/26
*/
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a; // what tuple?
for (int i = 1; i < n; i++) {
string s;
int p;
cin >> s >> p;
p = -p; //点数が高いほど小さくなる（上に）
a.emplace_back(tie(s, p, ... | #include <bits/stdc++.h>
#include <string>
#include <tuple>
using namespace std;
/*
2019/05/26
*/
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a; // what tuple?
for (int i = 1; i <= n; i++) {
string s;
int p;
cin >> s >> p;
p = -p; //点数が高いほど小さくなる（上に）
a.emplace_back(tie(s, p,... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 840,231 | 840,230 | u538853954 | cpp |
p03030 | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | [
"expression.operation.binary.add"
] | 840,232 | 840,233 | u239493918 | cpp |
p03030 | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 840,234 | 840,233 | u239493918 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define For(i, n) for (long i = 0; i < (n); i++)
long gcd(long a, long b) { return b ? gcd(b, a % b) : a; }
long n, m, ans = 0;
int main() {
cin >> n;
vector<string> ato(n);
vector<string> mae(n);
For(i, n) {
string s;
int t;
cin >> s >> t;
mae.at(i)... | #include <bits/stdc++.h>
using namespace std;
#define For(i, n) for (long i = 0; i < (n); i++)
long gcd(long a, long b) { return b ? gcd(b, a % b) : a; }
long n, m, ans = 0;
int main() {
cin >> n;
vector<string> ato(n);
vector<string> mae(n);
For(i, n) {
string s;
int t;
cin >> s >> t;
mae.at(i)... | [
"expression.operation.binary.add"
] | 840,237 | 840,238 | u813174766 | cpp |
p03030 | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<string, int>> sp(n), nsp;
for (int i = 0; i < n; i++) {
string s;
int t;
cin >> s >> t;
t *= -1;
sp[i] = make_pair(s, t);
}
nsp = sp;
sort(nsp.begin(), nsp.end());
for (int... | #include <bits/stdc++.h>
typedef long long LL;
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<string, int>> sp(n), nsp;
for (int i = 0; i < n; i++) {
string s;
int t;
cin >> s >> t;
t *= -1;
sp[i] = make_pair(s, t);
}
nsp = sp;
sort(nsp.begin(), nsp.end());
for (int... | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 840,239 | 840,240 | u392423112 | cpp |
p03030 | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | #include <bits/stdc++.h>
using ll = long long;
#define int ll
#define rep(i, n) for (int i = 0; i < n; i++)
#define loop(i, s, n) for (int i = s; i < n; i++)
#define erep(e, v) for (auto &&e : v)
#define all(in) in.begin(), in.end()
#define MP make_pair
#define INF (sizeof(int) == 4 ? (int)1e9 : (int)1e18)
#define EPS ... | [] | 840,241 | 840,242 | u318334550 | cpp |
p03030 |
#include <algorithm>
#include <iostream>
#include <list>
#include <string>
using namespace std;
void swap(string &acity, string &aprice, int &anum, string &bcity,
string &bprice, int &bnum) {
string wk;
int iwk;
wk = acity;
acity = bcity;
bcity = wk;
wk = aprice;
aprice = bprice;
bprice =... |
#include <algorithm>
#include <iostream>
#include <list>
#include <string>
using namespace std;
void swap(string &acity, int &aprice, int &anum, string &bcity, int &bprice,
int &bnum) {
string wk;
int iwk;
wk = acity;
acity = bcity;
bcity = wk;
iwk = aprice;
aprice = bprice;
bprice = iwk;... | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"variable_declaration.type.change"
] | 840,253 | 840,254 | u845284573 | cpp |
p03030 | #include <cstring>
#include <iostream>
using namespace std;
void swp_i(int *N1, int *N2) {
int tmp = *N1;
*N1 = *N2;
*N2 = tmp;
}
void swp_c(char *S1, char *S2) {
char tmp[10];
strcpy(tmp, S1);
strcpy(S1, S2);
strcpy(S2, tmp);
}
int main() {
int N;
cin >> N;
char S[100][10];
int P[100], NUM[100];... | #include <cstring>
#include <iostream>
using namespace std;
void swp_i(int *N1, int *N2) {
int tmp = *N1;
*N1 = *N2;
*N2 = tmp;
}
void swp_c(char *S1, char *S2) {
char tmp[11];
strcpy(tmp, S1);
strcpy(S1, S2);
strcpy(S2, tmp);
}
int main() {
int N;
cin >> N;
char S[100][11];
int P[100], NUM[100];... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 840,297 | 840,298 | u145483532 | cpp |
p03030 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
struct p {
char s[20];
int score;
int num;
} a[200];
int cmp(p a, p b) {
if (strcmp(a.s, b.s) == 0) {
return a.score > b.score;
} else if (strcmp(a.s, b.s) == -1)
return 1;
return 0;
}
int main() {
int n;
scanf("%d", ... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
struct p {
char s[20];
int score;
int num;
} a[200];
int cmp(p a, p b) {
if (strcmp(a.s, b.s) == 0) {
return a.score > b.score;
} else if (strcmp(a.s, b.s) < 0)
return 1;
return 0;
}
int main() {
int n;
scanf("%d", &n... | [
"control_flow.branch.if.condition.change"
] | 840,299 | 840,300 | u725712446 | cpp |
p03030 | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
vector<int> P(N);
vector<int> K(N);
for (int i = 0; i < N; i++) {
cin >> S[i] >> P[i];
K[i] = i + 1;
}
string str;
/*
int j = N;
for(int i = 0; i < j-1;... | #include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<string> S(N);
vector<int> P(N);
vector<int> K(N);
for (int i = 0; i < N; i++) {
cin >> S[i] >> P[i];
K[i] = i + 1;
}
string str;
/*
int j = N;
for(int i = 0; i < j-1;... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 840,305 | 840,306 | u070471279 | cpp |
p03030 | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#in... | //#include <bits/stdc++.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#in... | [
"identifier.change",
"io.output.change"
] | 840,320 | 840,321 | u783861517 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef struct Restaurant {
string name;
int point;
int id;
Restaurant(string _name, int _p, int _id) {
name = _name;
point = _p;
id = _id;
}
} restaurant_t;
bool cmp(restaurant_t a, restaurant_t b) {
if (a.name ... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef struct Restaurant {
string name;
int point;
int id;
Restaurant(string _name, int _p, int _id) {
name = _name;
point = _p;
id = _id;
}
} restaurant_t;
bool cmp(restaurant_t a, restaurant_t b) {
if (a.name ... | [
"io.output.newline.add"
] | 840,344 | 840,345 | u810075828 | cpp |
p03030 |
// 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>
... | [] | 840,346 | 840,347 | u874996917 | cpp |
p03030 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#incl... | [
"control_flow.branch.if.condition.change"
] | 840,359 | 840,360 | u406225550 | cpp |
p03030 | #include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
void swa(pair<string, int> &a, pair<string, int> &b) {
pair<string, int> t = a;
a = b;
b = t;
}
void wap(int &a, int &b) {
int t = a;
a = b;
b = t;
}
int main() {
int N;
cin >> N;
vector<pair<string, int>> ... | #include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
void swa(pair<string, int> &a, pair<string, int> &b) {
pair<string, int> t = a;
a = b;
b = t;
}
void wap(int &a, int &b) {
int t = a;
a = b;
b = t;
}
int main() {
int N;
cin >> N;
vector<pair<string, int>> ... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 840,375 | 840,376 | u058186113 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n, p;
string s;
cin >> n;
vector<tuple<string, int, int>> sp;
for (int i = 0; i < n; ++i) {
cin >> s >> p;
sp.push_back(make_tuple(s, p, i + 1));
}
sort(sp.begin(), ... | #include <algorithm>
#include <iostream>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int n, p;
string s;
cin >> n;
vector<tuple<string, int, int>> sp;
for (int i = 0; i < n; ++i) {
cin >> s >> p;
sp.push_back(make_tuple(s, -p, i + 1));
}
sort(sp.begin(),... | [
"expression.operation.unary.add",
"call.arguments.change",
"expression.operation.binary.remove"
] | 840,381 | 840,382 | u021083776 | cpp |
p03030 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int n, m;
string s;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef tuple<string, int, int> TU;
bool comp(const TU ... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
int n, m;
string s;
typedef pair<int, int> P;
typedef vector<int> VI;
typedef tuple<string, int, int> TU;
bool comp(const TU ... | [] | 840,417 | 840,418 | u587724217 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<string, ll> P;
#define M 1000000007
int main() {
ll n, l;
cin >> n;
vector<P> p(n), q(n);
map<P, ll> m;
string s;
for (ll i = 0; i < n; i++) {
cin >> s >> l;
p[i] = P(s, -l);
q[i] = p[i];
m[p[i]] = i;
}
sort(... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<string, ll> P;
#define M 1000000007
int main() {
ll n, l;
cin >> n;
vector<P> p(n), q(n);
map<P, ll> m;
string s;
for (ll i = 0; i < n; i++) {
cin >> s >> l;
p[i] = P(s, -l);
q[i] = p[i];
m[p[i]] = i + 1;
}
s... | [
"assignment.change"
] | 840,419 | 840,420 | u987476436 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
bool cmp(pair<string, pair<int, int>> a, pair<string, pair<int, int>> b) {
if (a.fi == b.fi)
return a.se.fi > b.se.fi;
return a.fi < b.fi;
}
int main() {
int n;
cin >> n;
pair<string, pair<int, int>> p[n + 1];
for (int i... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
bool cmp(pair<string, pair<int, int>> a, pair<string, pair<int, int>> b) {
if (a.fi == b.fi)
return a.se.fi > b.se.fi;
return a.fi < b.fi;
}
int main() {
int n;
cin >> n;
pair<string, pair<int, int>> p[n + 1];
for (int ... | [
"call.arguments.add"
] | 840,421 | 840,422 | u576115185 | cpp |
p03030 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
ios::sync_with_stdio(false); ... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
ios::sync_with_stdio(false); ... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 840,429 | 840,430 | u722777218 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define REP(i, b) FOR(i, 0, b)
#define RFOR(i, a, b) for (int i = a - 1; i >= b; i--)
#define RREP(i, a) RFOR(i, a, 0)
#define REPALL(i, v) for (int i = 0; i < v.size(); i++)
#define RREPALL(i, v) for (int i = v.size() - 1; i... | [
"expression.operation.unary.add",
"expression.operation.binary.remove",
"assignment.change"
] | 840,431 | 840,432 | u007637377 | cpp |
p03030 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
bool func(const pair<pair<string, int>, int> &a,
const pair<pair<string, int>, int> &b) {
return a.first.first < b.first.first ||
a.first.second == b.fi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <map>
#include <queue>
#include <string>
#include <vector>
using namespace std;
bool func(const pair<pair<string, int>, int> &a,
const pair<pair<string, int>, int> &b) {
return a.first.first < b.first.first ||
a.first.first == b.fir... | [
"function.return_value.change",
"expression.operation.binary.change"
] | 840,437 | 840,438 | u619248223 | cpp |
p03030 | //----------ACCIDENTAL COMPETITIVE PROGRAMMER---------------------
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>
*/
using namespace ... | //----------ACCIDENTAL COMPETITIVE PROGRAMMER---------------------
#include <bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>,
rb_tree_tag,tree_order_statistics_node_update>
*/
using namespace ... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 840,441 | 840,442 | u109311178 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
bool sortbydesc(const pair<string, pair<int, int>> &a,
const pair<string, pair<int, int>> &b) {
return (a.second.first > b.second.first);
}
int main() {
int n;
cin >> n;
string s;
int p;
vector<pair<string, pair<int, int>>> sp;
for (int i =... | #include <bits/stdc++.h>
using namespace std;
bool sortbydesc(const pair<string, pair<int, int>> &a,
const pair<string, pair<int, int>> &b) {
return (a.second.first > b.second.first);
}
int main() {
int n;
cin >> n;
string s;
int p;
vector<pair<string, pair<int, int>>> sp;
for (int i =... | [] | 840,452 | 840,453 | u117783424 | cpp |
p03030 | #include <iostream>
#include <string>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#include <vector>
#include <algorithm>
#include <tuple>
typedef tuple<char, int, int> mytuple;
int main() {
int N;
cin >> N;
vector<mytuple> T; // S,P,index
rep(i, 0, N) {
string s_temp;
int... | #include <iostream>
#include <string>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#include <vector>
#include <algorithm>
#include <tuple>
typedef tuple<string, int, int> mytuple;
int main() {
int N;
cin >> N;
vector<mytuple> T; // S,P,index
rep(i, 0, N) {
string s_temp;
i... | [
"variable_declaration.type.change"
] | 840,454 | 840,455 | u291552830 | cpp |
p03030 | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
struct data_t {
string str;
int num;
int num2;
bool operator<(const data_t &right) const {
return str == right.str ? num > right.num : str < right.str;
}
};
int main() {
int N;
cin >> N;
vecto... | #include <algorithm>
#include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
struct data_t {
string str;
int num;
int num2;
bool operator<(const data_t &right) const {
return str == right.str ? num > right.num : str < right.str;
}
};
int main() {
int N;
cin >> N;
vecto... | [
"assignment.change"
] | 840,456 | 840,457 | u523548069 | cpp |
p03030 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<string, int> P;
int main() {... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <typeinfo>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<string, int> P;
int main() {... | [
"identifier.change",
"call.arguments.change"
] | 840,458 | 840,459 | u508492526 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | #include <bits/stdc++.h>
using namespace std;
/* #pragma */
/*
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
*/
/*alias*/
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define next asdnext
... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 840,473 | 840,474 | u509680664 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
struct dat {
int id, price;
string name;
};
int main(void) {
list<dat> lst;
int n, p, min;
string str;
auto itr = lst.begin();
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> str >> p;
dat d;
d.id = i + 1;
d.name = str;
d.price = p;
... | #include <bits/stdc++.h>
using namespace std;
struct dat {
int id, price;
string name;
};
int main(void) {
list<dat> lst;
int n, p, min;
string str;
auto itr = lst.begin();
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> str >> p;
dat d;
d.id = i + 1;
d.name = str;
d.price = p;
... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 840,485 | 840,486 | u528602057 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
bool smit(pair<string, int> v1, pair<string, int> v2) {
if (v1.first == v2.first)
return v1.second > v2.second;
else
return v1.first < v2.first;
}
int main() {
long long int n;
cin >> n;
vector<pair<string, int>> v;
string s;
int p;
for (int i = 1; i... | #include <bits/stdc++.h>
using namespace std;
bool smit(pair<string, int> v1, pair<string, int> v2) {
if (v1.first == v2.first)
return v1.second > v2.second;
else
return v1.first < v2.first;
}
int main() {
long long int n;
cin >> n;
vector<pair<string, int>> v;
string s;
int p;
for (int i = 1; i... | [
"identifier.change",
"call.arguments.change",
"control_flow.branch.if.condition.change"
] | 840,522 | 840,523 | u670919462 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int n, t;
vector<pair<pair<string, int>, int>> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str >> t;
v.push_back(make_pair(make_pair(str, t), i));
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
cout << ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string str;
int n, t;
vector<pair<pair<string, int>, int>> v;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> str >> t;
v.push_back(make_pair(make_pair(str, -t), i));
}
sort(v.begin(), v.end());
for (int i = 0; i < n; i++) {
cout << ... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 840,550 | 840,551 | u063608889 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) rep(i, 0, n)
#define RREP(i, n) rrep(i, n, 0)
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> all;
REP(i, n) {
string s;... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) rep(i, 0, n)
#define RREP(i, n) rrep(i, n, 0)
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> all;
REP(i, n) {
string s;... | [
"expression.operation.binary.remove"
] | 840,554 | 840,555 | u973991908 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) rep(i, 0, n)
#define RREP(i, n) rrep(i, n, 0)
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> all;
REP(i, n) {
stri... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define rrep(i, a, b) for (int i = (a); i >= (b); i--)
#define REP(i, n) rep(i, 0, n)
#define RREP(i, n) rrep(i, n, 0)
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> all;
REP(i, n) {
stri... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 840,556 | 840,557 | u973991908 | cpp |
p03030 | #pragma region include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i... | #pragma region include
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define REP(i... | [
"assignment.change"
] | 840,563 | 840,564 | u165374901 | cpp |
p03030 | // gauravsinghh
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define ld long double
#define db double
#define pii pair<int, int>
#define pll pair<long long, long long>
#define sii set<int>... | // gauravsinghh
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#define ll long long int
#define ld long double
#define db double
#define pii pair<int, int>
#define pll pair<long long, long long>
#define sii set<int>... | [
"variable_declaration.remove"
] | 840,565 | 840,566 | u480527921 | cpp |
p03030 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int N, P;
string S;
cin >> N;
pair<pair<string, int>, int> p[N];
for (int i = 0; i < N; i++) {
cin >> S >> P;
p[i] = make_pair(make_pair(S, P), i);
}
sort(p, p + N);
for (int i = 0; i < N; i++) {
cout << p[i].sec... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int N, P;
string S;
cin >> N;
pair<pair<string, int>, int> p[N];
for (int i = 0; i < N; i++) {
cin >> S >> P;
p[i] = make_pair(make_pair(S, -P), i);
}
sort(p, p + N);
for (int i = 0; i < N; i++) {
cout << p[i].se... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 840,577 | 840,578 | u657051080 | cpp |
p03030 | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <string.h>
using namespace std;
struct guide {
char name[10];
int point;
int idx;
};
bool compareguide(guide g1, guide g2) {
if (strcmp(g1.name, g2.name) < 0)
return true;
else if (strcmp(g1.name, g2.name) == 0)
return (g1.point... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <string.h>
using namespace std;
struct guide {
char name[15];
int point;
int idx;
};
bool compareguide(guide g1, guide g2) {
if (strcmp(g1.name, g2.name) < 0)
return true;
else if (strcmp(g1.name, g2.name) == 0)
return (g1.point... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 840,587 | 840,588 | u363251947 | cpp |
p03030 | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <string.h>
using namespace std;
struct guide {
char name[10];
int point;
int idx;
};
bool compareguide(guide g1, guide g2) {
if (strcmp(g1.name, g2.name) < 0)
return true;
else if (strcmp(g1.name, g2.name) == 0)
return (g1.point... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <string.h>
using namespace std;
struct guide {
char name[15];
int point;
int idx;
};
bool compareguide(guide g1, guide g2) {
if (strcmp(g1.name, g2.name) < 0)
return true;
else if (strcmp(g1.name, g2.name) == 0)
return (g1.point... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 840,589 | 840,588 | u363251947 | cpp |
p03030 | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <string.h>
using namespace std;
struct guide {
char name[15];
int point;
int idx;
};
bool compareguide(guide g1, guide g2) {
if (strcmp(g1.name, g2.name) < 0)
return true;
else if (strcmp(g1.name, g2.name) == 0)
return (g1.point... | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <string.h>
using namespace std;
struct guide {
char name[15];
int point;
int idx;
};
bool compareguide(guide g1, guide g2) {
if (strcmp(g1.name, g2.name) < 0)
return true;
else if (strcmp(g1.name, g2.name) == 0)
return (g1.point... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 840,590 | 840,588 | u363251947 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<string, int> P;
int main() {
int N;
cin >> N;
vector<string> S(N);
vector<int> T(N), ans(N);
vector<P> Q, judge;
for (int i = 0; i < N; i++) {
cin >> S.at(i) >> T.at(i);
Q.push_back(P(S.at(i), T.at(i)));
judge.push_b... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<string, int> P;
int main() {
int N;
cin >> N;
vector<string> S(N);
vector<int> T(N), ans(N);
vector<P> Q, judge;
for (int i = 0; i < N; i++) {
cin >> S.at(i) >> T.at(i);
Q.push_back(P(S.at(i), T.at(i)));
judge.push_b... | [
"assignment.variable.change",
"identifier.change",
"call.arguments.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 840,596 | 840,597 | u822169805 | cpp |
p03030 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <typeinfo>
#include <vector>
typedef long long int ll;
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
int P[N];
int n[N];
for (int i = 0; i < N; i++) {
n[i] = i;
}
for (int i = 0; i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <string>
#include <typeinfo>
#include <vector>
typedef long long int ll;
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
int P[N];
int n[N];
for (int i = 0; i < N; i++) {
n[i] = i + 1;
}
for (int i = ... | [
"assignment.change",
"assignment.variable.change",
"identifier.replace.remove",
"literal.replace.add",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 840,608 | 840,609 | u532154568 | cpp |
p03030 | #include <bits/stdc++.h>
#define ll long long
#define se second
#define vl vector<ll>
#define pb push_back
#define pi pair<int, int>
#define mp make_pair
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define YES(i) cout << (i ? "YES" : "NO") << endl
#define Yes(i)... | #include <bits/stdc++.h>
#define ll long long
#define se second
#define vl vector<ll>
#define pb push_back
#define pi pair<int, int>
#define mp make_pair
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define per(i, a, b) for (int i = b - 1; i >= a; i--)
#define YES(i) cout << (i ? "YES" : "NO") << endl
#define Yes(i)... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 840,610 | 840,611 | u782733831 | cpp |
p03030 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [
"assignment.variable.change"
] | 840,612 | 840,613 | u468700753 | cpp |
p03030 | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | #include "algorithm"
#include "bitset"
#include "cassert"
#include "climits"
#include "cmath"
#include "cstdio"
#include "functional"
#include "iomanip"
#include "iostream"
#include "list"
#include "map"
#include "numeric"
#include "queue"
#include "random"
#include "set"
#include "stack"
#include "string"
#include "un... | [
"assignment.variable.change",
"assignment.change"
] | 840,614 | 840,613 | u468700753 | cpp |
p03030 | #include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < (N); ++i)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll div_ceil(ll, ll);
int dx[4] = {0, 0, -1, 1};... | #include <bits/stdc++.h>
#define REP(i, N) for (int i = 0; i < (N); ++i)
#define ALL(x) (x).begin(), (x).end()
#define MOD 1000000007
#define PB push_back
#define MP make_pair
using namespace std;
typedef long long ll;
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll div_ceil(ll, ll);
int dx[4] = {0, 0, -1, 1};... | [
"expression.operation.binary.remove"
] | 840,623 | 840,624 | u408053343 | cpp |
p03030 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
int P[N];
for (int i = 0; i < N; i++)
cin >> S[i] >> P[i];
int swaped[N];
for (int i = 0; i < N; i++)
s... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
string S[N];
int P[N];
for (int i = 0; i < N; i++)
cin >> S[i] >> P[i];
int swaped[N];
for (int i = 0; i < N; i++)
s... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 840,629 | 840,630 | u911222357 | cpp |
p03030 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b)... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rept(i, a, b)... | [] | 840,633 | 840,634 | u569041543 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
map<std::string, vector<pair<int, int>>> sp;
for (int i = 0; i < N; i++) {
string s;
int p;
cin >> s >> p;
sp[s].push_back({i + 1, p});
}
for (auto &v : sp) {
... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
cin >> N;
map<std::string, vector<pair<int, int>>> sp;
for (int i = 0; i < N; i++) {
string s;
int p;
cin >> s >> p;
sp[s].push_back({i + 1, p});
}
for (auto &v : sp) {
... | [
"io.output.change"
] | 840,637 | 840,638 | u500092662 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
... | [
"expression.unary.arithmetic.add"
] | 840,677 | 840,678 | u005006157 | cpp |
p03031 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define chmax(x, y) x = max(x, y);
#define chmin(x, y) x = min(x, y);
const int di[] = {-1, 0, 1, 0};
const int dj[] = {0, -1, 0, 1};
const int INF = 1001001001;
int main() {
... | [
"expression.unary.arithmetic.add",
"expression.operator.change"
] | 840,679 | 840,678 | u005006157 | cpp |
p03031 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#define all(x) (x).begin(), (x).end()
#define PI 3.14159265358979323846264338327950L
using namespace std;
typedef long long ll;
typedef long double ld;
int main() {... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 840,691 | 840,692 | u151236434 | cpp |
p03031 | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[20], s[20][20], p[20];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; bit <... | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[m], s[m][20], p[m];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; bit < (1... | [
"identifier.replace.add",
"literal.replace.remove",
"variable_declaration.array_dimensions.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 840,693 | 840,694 | u056912761 | cpp |
p03031 | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[20], s[20][20], p[20];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; bit <... | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[20], s[20][20], p[20];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; bit <... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 840,693 | 840,695 | u056912761 | cpp |
p03031 | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[20], s[20][20], p[20];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; bit <... | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[20], s[20][20], p[20];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; bit <... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 840,696 | 840,695 | u056912761 | cpp |
p03031 | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[20], s[20][20], p[20];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; bit <... | #include <iostream>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[20], s[20][20], p[20];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; bit <... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.compare.change"
] | 840,697 | 840,695 | u056912761 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[20], s[20][20], p[20];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int k[20], s[20][20], p[20];
for (int i = 0; i < m; i++) {
cin >> k[i];
for (int j = 0; j < k[i]; j++) {
cin >> s[i][j];
}
}
for (int i = 0; i < m; i++)
cin >> p[i];
int ans = 0;
for (int bit = 0; ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 840,698 | 840,699 | u056912761 | cpp |
p03031 | //インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator>... | //インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator>... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 840,704 | 840,705 | u182012703 | cpp |
p03031 | //インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator>... | //インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> //入出力
#include <iterator>... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.remove"
] | 840,706 | 840,705 | u182012703 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-... | [] | 840,707 | 840,708 | u025469035 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (n); ++i)
#define ll long long
#define ld long double
#define P pair<ll, ll>
#define all(v) v.begin(), v.end()
const ll mod = 1e9 + 7;
const ll INF = 1e18;
const double pi = acos(-... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 840,709 | 840,708 | u025469035 | cpp |
p03031 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef... | [
"control_flow.branch.if.condition.change"
] | 840,710 | 840,711 | u950174376 | cpp |
p03031 |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
int P[100];
int main() {
int N, M;
cin >> N >> M;
vector<vector<ll>> S(N);
loop(0, M, i) {
ll k;
cin >> k;
loop(0, k, j) {
ll s;
... |
#include <bits/stdc++.h>
#define loop(s, e, i) for (int i = s; i < e; ++i)
#define print(s) cout << s << endl;
using namespace std;
using ll = long long;
int P[100];
int main() {
int N, M;
cin >> N >> M;
vector<vector<ll>> S(N);
loop(0, M, i) {
ll k;
cin >> k;
loop(0, k, j) {
ll s;
... | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 840,712 | 840,713 | u111653921 | cpp |
p03031 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
int main() {
int n, m;
cin >> n >> m;
vector<int> s[m];
rep(i, m) {
int k;
cin >> k;
rep(j, ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
int main() {
int n, m;
cin >> n >> m;
vector<int> s[m];
rep(i, m) {
int k;
cin >> k;
rep(j, ... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 840,725 | 840,726 | u416773418 | cpp |
p03031 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
int main() {
int n, m;
cin >> n >> m;
vector<int> s[m];
rep(i, m) {
int k;
cin >> k;
rep(j, ... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define P pair<int, int>
int main() {
int n, m;
cin >> n >> m;
vector<int> s[m];
rep(i, m) {
int k;
cin >> k;
rep(j, ... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 840,727 | 840,726 | u416773418 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
int n, m;
int k[100];
int s[100][100];
int p[100];
int a[100];
int ans;
int check() {
for (int i = 1; i <= m; i++) {
int cnt;
for (int j = 1; j <= k[i]; j++) {
cnt += a[s[i][j]];
}
if (cnt % 2 != p[i]) {
return 0;
}
}
return 1;
}
in... | #include <bits/stdc++.h>
using namespace std;
int n, m;
int k[100];
int s[100][100];
int p[100];
int a[100];
int ans;
int check() {
for (int i = 1; i <= m; i++) {
int cnt = 0;
for (int j = 1; j <= k[i]; j++) {
cnt += a[s[i][j]];
}
if (cnt % 2 != p[i]) {
return 0;
}
}
return 1;
}... | [
"variable_declaration.value.change"
] | 840,734 | 840,735 | u353919145 | cpp |
p03031 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ... | [
"control_flow.loop.condition.change"
] | 840,738 | 840,739 | u776194115 | cpp |
p03031 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<std::vector<int>> A(M);
for (auto i{0}; i < N; ++i) {
int k;
std::cin >> k;
for (auto j{0}; j < k; ++j) {
//予め各電球に対して対応するスイッチの組み合わせを2進数変数に変換しておく。
int a;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
int main() {
int N, M;
std::cin >> N >> M;
std::vector<std::vector<int>> s(M);
for (auto i{0}; i < M; ++i) {
int k;
std::cin >> k;
for (auto j{0}; j < k; ++j) {
//予め各電球に対して対応するスイッチの組み合わせを2進数変数に変換しておく。
int a;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 840,749 | 840,750 | u917678406 | cpp |
p03031 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<int>> s;
vector<int> p;
int N, M;
bool judge(int bit) {
int cnt = 0;
for (int i = 0; i < M; i++) {
int state = 0;
for (int j = 0; j < s[i].size(); j++) {
if (bit & (1 << s[i][j]))
state += 1;
}
if (p[i]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<vector<int>> s;
vector<int> p;
int N, M;
bool judge(int bit) {
int cnt = 0;
for (int i = 0; i < M; i++) {
int state = 0;
for (int j = 0; j < s[i].size(); j++) {
if (bit & (1 << s[i][j]))
state += 1;
}
if (p[i]... | [
"expression.operation.binary.add"
] | 840,753 | 840,754 | u810625173 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.