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 |
|---|---|---|---|---|---|---|---|
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, -1 * b, i);
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
string a;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, -1 * b, i + 1);
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
string a... | [
"assignment.change"
] | 838,835 | 838,836 | u946082956 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, -b, i);
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
string a;
int... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, -1 * b, i + 1);
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
string a... | [
"assignment.change"
] | 838,837 | 838,836 | u946082956 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, b, i); // b, a の順でペアにする
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
s... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, -1 * b, i + 1);
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
string a... | [
"assignment.change"
] | 838,838 | 838,836 | u946082956 | cpp |
p03030 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> vec(N);
rep(i, N) {
string st = "";
cin >> st;
int a = 0;
cin >> a;
tuple<string, int, int> tup(st, (-1) * a, i +... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> vec;
rep(i, N) {
string st = "";
cin >> st;
int a = 0;
cin >> a;
tuple<string, int, int> tup(st, (-1) * a, i + 1)... | [] | 838,841 | 838,842 | u922449177 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, -b, i);
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
string a;
int b... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, -b, i + 1);
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
string a;
i... | [
"assignment.change"
] | 838,849 | 838,850 | u729119068 | cpp |
p03030 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> dic;
for (int i = 1; i <= n; i++) {
string s;... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> dic;
for (int i = 1; i <= n; i++) {
string s;... | [
"assignment.add"
] | 838,853 | 838,854 | u654240084 | cpp |
p03030 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> dic;
for (int i = 1; i <= n; i++) {
string s;... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> dic;
for (int i = 1; i <= n; i++) {
string s;... | [
"assignment.add"
] | 838,853 | 838,855 | u654240084 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int N;
string S;
int P;
pair<pair<string, int>, int> p[100];
cin >> 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 (i... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int N;
string S;
int P;
pair<pair<string, int>, int> p[100];
cin >> N;
for (int i = 0; i < N; i++) {
cin >> S >> P;
p[i] = make_pair(make_pair(S, -P), i + 1);
}
sort(p, p + N);
fo... | [
"assignment.change"
] | 838,869 | 838,870 | u600118696 | cpp |
p03030 | #include "bits/stdc++.h"
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1e9 + 7;
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector... | #include "bits/stdc++.h"
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define MOD 1e9 + 7;
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long LL;
typedef vector<int> VI;
typedef vector... | [
"expression.operation.binary.add"
] | 838,874 | 838,875 | u313403396 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, 100 - b, i);
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
string a;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, 100 - b, i + 1);
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
string a... | [
"assignment.change"
] | 838,878 | 838,879 | u817769480 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, b, i);
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
string a;
int ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, 100 - b, i + 1);
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
string a... | [
"assignment.change"
] | 838,880 | 838,879 | u817769480 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
int N, b;
cin >> N;
vector<tuple<char, int, int>> X(N);
for (int i = 0; i < N; i++) {
cin >> a >> b;
X.at(i) = make_tuple(a, 100 - b, i + 1);
}
sort(X.begin(), X.end());
for (int i = 0; i < N; i++) {
tie(ignore, ignore, b) = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int N, b;
cin >> N;
vector<tuple<string, int, int>> X(N);
for (int i = 0; i < N; i++) {
cin >> a >> b;
X.at(i) = make_tuple(a, 100 - b, i + 1);
}
sort(X.begin(), X.end());
for (int i = 0; i < N; i++) {
tie(ignore, ignore, b... | [
"variable_declaration.type.change"
] | 838,888 | 838,889 | u820224016 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
char a;
int N, b;
cin >> N;
vector<tuple<char, int, int>> X(N);
for (int i = 1; i <= N; i++) {
cin >> a >> b;
X.at(i) = make_tuple(a, 100 - b, i);
}
sort(X.begin(), X.end());
for (int i = 0; i < N; i++) {
tie(ignore, ignore, b) = X.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
string a;
int N, b;
cin >> N;
vector<tuple<string, int, int>> X(N);
for (int i = 0; i < N; i++) {
cin >> a >> b;
X.at(i) = make_tuple(a, 100 - b, i + 1);
}
sort(X.begin(), X.end());
for (int i = 0; i < N; i++) {
tie(ignore, ignore, b... | [
"variable_declaration.type.change",
"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",
"assignment.cha... | 838,891 | 838,889 | u820224016 | cpp |
p03030 | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<tuple<string, int, int>> p(n);
for (int i = 0; i < n; i++) {
string s;
int a;
cin >> s >> a;
p[i] = mak... | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
vector<tuple<string, int, int>> p(n);
for (int i = 0; i < n; i++) {
string s;
int a;
cin >> s >> a;
p[i] = mak... | [
"assignment.change"
] | 838,892 | 838,893 | u542670845 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> X(N);
for (int i = 1; i <= N; i++) {
string s;
int p;
cin >> s >> p;
p = -p;
X.push_back(tie(s, p, i));
}
sort(X.begin(), X.end());
for (int i = 0; i < N; i++) {
cout << get<... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> X;
for (int i = 1; i <= N; i++) {
string s;
int p;
cin >> s >> p;
p = -p;
X.push_back(tie(s, p, i));
}
sort(X.begin(), X.end());
for (int i = 0; i < N; i++) {
cout << get<2>(... | [] | 838,898 | 838,899 | u550374978 | cpp |
p03030 | #if defined(__GNUC__)
#include <bits/stdc++.h>
#define __int32 __int32_t
// __GNUC__
#else
#include "bits/stdc++.h"
#endif
using namespace std;
#define int long long
#define itn __int32
#define REP(i, n) for (itn(i) = 0; (i) < (n); ++(i))
#define REP2(i, x, n) for (itn(i) = x; (i) < (n); ++(i))
#define ALL(x) (x).beg... | #if defined(__GNUC__)
#include <bits/stdc++.h>
#define __int32 __int32_t
// __GNUC__
#else
#include "bits/stdc++.h"
#endif
using namespace std;
#define int long long
#define itn __int32
#define REP(i, n) for (itn(i) = 0; (i) < (n); ++(i))
#define REP2(i, x, n) for (itn(i) = x; (i) < (n); ++(i))
#define ALL(x) (x).beg... | [] | 838,900 | 838,901 | u126737379 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> vec;
string A;
int a, b;
tuple<string, int, int> tu;
for (int i = 0; i < N; i++) {
cin >> A >> a;
b = i + 1;
tu = make_tuple(A, a, b);
vec.push_back(tu);
}
sort(vec.begin(), vec... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> vec;
string A;
int a, b;
tuple<string, int, int> tu;
for (int i = 0; i < N; i++) {
cin >> A >> a;
b = i + 1;
tu = make_tuple(A, 100 - a, b);
vec.push_back(tu);
}
sort(vec.begin(... | [
"assignment.change",
"expression.operation.binary.remove"
] | 838,908 | 838,909 | u532815438 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define INF 1e9
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
int n;
cin >>... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n); i >= 0; i--)
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define INF 1e9
#define all(v) v.begin(), v.end()
typedef long long ll;
int main() {
int n;
cin >>... | [
"expression.operation.unary.add",
"control_flow.loop.condition.change"
] | 838,912 | 838,913 | u328179672 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> R(N);
string S;
int P;
for (int i = 0; i < N; i++) {
cin >> S >> P;
R[i] = make_tuple(S, -P, i);
}
sort(R.begin(), R.end());
for (int i = 0; i < N; i++) {
cout << get<2>(R[i]) << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> R(N);
string S;
int P;
for (int i = 0; i < N; i++) {
cin >> S >> P;
R[i] = make_tuple(S, -P, i + 1);
}
sort(R.begin(), R.end());
for (int i = 0; i < N; i++) {
cout << get<2>(R[i]) <<... | [
"assignment.change"
] | 838,918 | 838,919 | u424374375 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<string, int> guide;
int main() {
int N;
cin >> N;
vector<guide> G;
vector<guide> C;
for (int i = 0; i < N; i++) {
string s;
int p;
cin >> s >> p;
G.push_back(guide(s, p));
C.push_back(guide(s, p))... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<string, int> guide;
int main() {
int N;
cin >> N;
vector<guide> G;
vector<guide> C;
for (int i = 0; i < N; i++) {
string s;
int p;
cin >> s >> p;
G.push_back(guide(s, p));
C.push_back(guide(s, p))... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 838,922 | 838,923 | u329706129 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
using guide = pair<string, int>;
int main() {
int N;
cin >> N;
vector<guide> G;
vector<guide> C;
for (int i = 0; i < N; i++) {
string s;
int p;
cin >> s >> p;
G.push_back(guide(s, p));
C.push_back(guide(s, p))... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<string, int> guide;
int main() {
int N;
cin >> N;
vector<guide> G;
vector<guide> C;
for (int i = 0; i < N; i++) {
string s;
int p;
cin >> s >> p;
G.push_back(guide(s, p));
C.push_back(guide(s, p))... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 838,924 | 838,923 | u329706129 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> p(n);
REP(i, n) {
string s;
int x;
cin >> s >> x;
p[i] = make_pair... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> p(n);
rep(i, n) {
string s;
int x;
cin >> s >> x;
p[i] = make_pair... | [
"identifier.change"
] | 838,932 | 838,933 | u024191315 | cpp |
p03030 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// cout << << endl;
typedef long long int ll;
typedef long d... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdlib.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// cout << << endl;
typedef long long int ll;
typedef long d... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 838,934 | 838,935 | u273928723 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> K;
vector<int> p;
for (int i = 0; i < n; i++) {
string p;
cin >> p;
int s;
cin >> s;
K.push_back(make_pair(make_pair(p, s), i));
}
sort(K.begin(), K.end());
for (int i = ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> K;
vector<int> p;
for (int i = 0; i < n; i++) {
string p;
cin >> p;
int s;
cin >> s;
K.push_back(make_pair(make_pair(p, -s), i));
}
sort(K.begin(), K.end());
for (int i =... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 838,938 | 838,939 | u815587547 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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 - 1; i++) {
cout <<... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
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... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 838,942 | 838,943 | u934529721 | cpp |
p03030 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
struct apair {
string first;
int second;
int id;
};
int N, t2;
string t;
vector<struct apair> rest;
bool cmp(struct apair first, struct apair second);
int main(void) {
scanf... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
struct apair {
string first;
int second;
int id;
};
int N, t2;
string t;
vector<struct apair> rest;
bool cmp(struct apair first, struct apair second);
int main(void) {
scanf... | [
"expression.operation.binary.add"
] | 838,955 | 838,956 | u492706457 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> assessment(N);
rep(i, N) {
cin >> get<0>(assessment.at(i)) >> get<1>(assessment.at(i));
get<2>(assessment.at(i)) = i;
get<1>(assessment.at... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> assessment(N);
rep(i, N) {
cin >> get<0>(assessment.at(i)) >> get<1>(assessment.at(i));
get<2>(assessment.at(i)) = i;
get<1>(assessment.at... | [
"expression.operation.binary.add"
] | 838,966 | 838,967 | u188442768 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vdo = vector<double>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vvdo = vector<vector<double>>;
using vstr = vector<string>;
using vvstr = vector<vector<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vdo = vector<double>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vvdo = vector<vector<double>>;
using vstr = vector<string>;
using vvstr = vector<vector<... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 838,968 | 838,969 | u919867411 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
using tsii = tuple<string, int, int>;
using vsii = vector<tsii>;
int N;
cin >> N;
vsii vec(N);
rep(i, N) {
st... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
int main() {
using tsii = tuple<string, int, int>;
using vsii = vector<tsii>;
int N;
cin >> N;
vsii vec(N);
rep(i, N) {
st... | [
"expression.operation.binary.add"
] | 838,980 | 838,981 | u611659218 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define LL long long
#define inf INT_MAX / 3
#define mod 1000000007ll
#define PI acos(-1.0)
#define linf (1ll << 60) - 1
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define REP(I, N) FOR... | #include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define pb push_back
#define mp make_pair
#define LL long long
#define inf INT_MAX / 3
#define mod 1000000007ll
#define PI acos(-1.0)
#define linf (1ll << 60) - 1
#define FOR(I, A, B) for (int I = (A); I < (B); ++I)
#define REP(I, N) FOR... | [
"identifier.change",
"assignment.change"
] | 838,982 | 838,983 | u853580735 | cpp |
p03030 | #include <stdio.h>
#include <string.h>
int main() {
int i, j;
int num;
scanf("%d", &num);
/* 文字列 */
int score[101];
int sort[101];
char moji[101][10], tmp[10];
int test;
/* 3つの文字列を入力 */
for (i = 1; i < num + 1; i++) {
sort[i] = i;
scanf("%s %d", moji[i], &score[i]);
}
for (i = 2; i <... | #include <stdio.h>
#include <string.h>
int main() {
int i, j;
int num;
scanf("%d", &num);
/* 文字列 */
int score[101];
int sort[101];
char moji[101][20], tmp[20];
int test;
/* 3つの文字列を入力 */
for (i = 1; i < num + 1; i++) {
sort[i] = i;
scanf("%s %d", moji[i], &score[i]);
}
for (i = 2; i <... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 838,990 | 838,991 | u985524697 | cpp |
p03030 | #include <stdio.h>
#include <string.h>
int main() {
int i, j;
int num;
scanf("%d", &num);
/* 文字列 */
int score[101];
int sort[101];
char moji[101][10], tmp[10];
int test;
/* 3つの文字列を入力 */
for (i = 1; i < num + 1; i++) {
sort[i] = i;
scanf("%s %d", moji[i], &score[i]);
}
for (i = 2; i <... | #include <stdio.h>
#include <string.h>
int main() {
int i, j;
int num;
scanf("%d", &num);
/* 文字列 */
int score[101];
int sort[101];
char moji[101][20], tmp[20];
int test;
/* 3つの文字列を入力 */
for (i = 1; i < num + 1; i++) {
sort[i] = i;
scanf("%s %d", moji[i], &score[i]);
}
for (i = 2; i <... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 838,993 | 838,991 | u985524697 | cpp |
p03030 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)
#defin... | [
"identifier.change",
"assignment.change"
] | 838,994 | 838,995 | u104057163 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
cin >> n;
string s;
vector<tuple<string, int, int>> a;
for (int i = 1; i <= n; i++) {
cin >> s >> p;
p = -p;
a.emplace_back(tie(s, p, i));
}
sort(a.begin(), a.end());
for (int i = 0; i < n - 1; i++) {
string s;
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, p;
cin >> n;
string s;
vector<tuple<string, int, int>> a;
for (int i = 1; i <= n; i++) {
cin >> s >> p;
p = -p;
a.emplace_back(tie(s, p, i));
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
string s;
int p... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 839,001 | 839,002 | u411916435 | cpp |
p03030 | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll N, i;
cin >> N;
vector<pair<pair<string, ll>, ll>> v(N);
s... | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define ll long long
int main() {
ll N, i;
cin >> N;
vector<pair<pair<string, ll>, ll>> v;
stri... | [] | 839,005 | 839,006 | u770161743 | cpp |
p03030 | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
pair<pair<string, int>, int> m[110];
int a;
cin >> a;
for (int i = 0; i < a; i++) {
int t;
string city;
cin >> city >> t;
m[i] = make_pair(make_pair(city, t), i);
}
sort(m, m + a);
for (int i = 0; i < a; i++) ... | #include <bits/stdc++.h>
#include <string>
using namespace std;
int main() {
pair<pair<string, int>, int> m[110];
int a;
cin >> a;
for (int i = 0; i < a; i++) {
int t;
string city;
cin >> city >> t;
m[i] = make_pair(make_pair(city, -t), i);
}
sort(m, m + a);
for (int i = 0; i < a; i++)... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,011 | 839,012 | u123163437 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define memi cout << endl
#define kono(n) cout << fixed << setprecision(n)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define hina... | [] | 839,016 | 839,017 | u917049698 | cpp |
p03030 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
char in[120];
pair<pair<string, int>, int> p[110];
int n;
cin >> n;
rep(i, 0, n) {
int t;
cin >> t;
string tmp = in;
p[i] = make_pai... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < (int)(b); ++i)
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
char in[120];
pair<pair<string, int>, int> p[110];
int n;
cin >> n;
rep(i, 0, n) {
int t;
cin >> in >> t;
string tmp = in;
p[i] = ma... | [
"expression.operation.binary.add"
] | 839,018 | 839,019 | u709373021 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<string, int>> restaurants(N), restaurants_copy(N);
for (int i = 0; i < N; i++) {
string S;
int P;
cin >> S >> P;
restaurants.at(i).first = S;
restaurants.at(i).second = 100 - P;
restaurants_copy.at(i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<string, int>> restaurants(N), restaurants_copy(N);
for (int i = 0; i < N; i++) {
string S;
int P;
cin >> S >> P;
restaurants.at(i).first = S;
restaurants.at(i).second = 100 - P;
restaurants_copy.at(i... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 839,025 | 839,026 | u865889485 | cpp |
p03030 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool cmp(const pair<string, int> &a, const pair<string, int> &b) {
if (a.first != b.first)
return a.first < b.first;
else
return a.second >= b.second;
}
int main() {
int N;
cin >... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
bool cmp(const pair<string, int> &a, const pair<string, int> &b) {
if (a.first != b.first)
return a.first < b.first;
else
return a.second >= b.second;
}
int main() {
int N;
cin >... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 839,027 | 839,028 | u105100688 | cpp |
p03030 | #include <bits/stdc++.h>
#define INF 1e9
#define all(v) v.begin(), v.end()
#define rall(v) v.begin(), v.end(), std::greater<int>()
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define max(v) *max_element(v.begin(), v.end())
#define min(v) *min_element(v... | #include <bits/stdc++.h>
#define INF 1e9
#define all(v) v.begin(), v.end()
#define rall(v) v.begin(), v.end(), std::greater<int>()
#define rep(i, n) for (int i = 0; i < n; i++)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define max(v) *max_element(v.begin(), v.end())
#define min(v) *min_element(v... | [] | 839,031 | 839,032 | u054559808 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<tuple<string, int, int>> v(n);
for (int i = 0; i < n; i++) {
string s;
int a;
cin >> s >> a;
v[i] = make_tuple(s, a, i);
}
sort(v.begin(), v.end());
for (int i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<tuple<string, int, int>> v(n);
for (int i = 0; i < n; i++) {
string s;
int a;
cin >> s >> a;
v[i] = make_tuple(s, -a, i);
}
sort(v.begin(), v.end());
for (int i... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,035 | 839,036 | u787005274 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using tsi = tuple<string, int, int>;
int main() {
int N;
cin >> N;
vector<tsi> vec(N);
string s;
int p;
for (int i = 0; i < N; i++) {
cin >> s >> p;
vec.at(i) = make_tuple(s, -1 * p, i);
}
sort(vec.begin(), vec.end());
for (i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using tsi = tuple<string, int, int>;
int main() {
int N;
cin >> N;
vector<tsi> vec(N);
string s;
int p;
for (int i = 0; i < N; i++) {
cin >> s >> p;
vec.at(i) = make_tuple(s, -1 * p, i + 1);
}
sort(vec.begin(), vec.end());
fo... | [
"assignment.change"
] | 839,037 | 839,038 | u166218280 | cpp |
p03030 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<pair<string, int>, int>> restaurant(N);
for (int i = 0; i < N; ++i) {
string s;
int point;
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<pair<string, int>, int>> restaurant(N);
for (int i = 0; i < N; ++i) {
string s;
int point;
... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,039 | 839,040 | u323542775 | cpp |
p03030 | // C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#i... | // C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#i... | [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"assignment.change",
"identifier.change"
] | 839,056 | 839,057 | u685346012 | cpp |
p03030 | // C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#i... | // C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#i... | [
"assignment.change"
] | 839,058 | 839,057 | u685346012 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
class r {
public:
string s;
int p;
int rank;
int prank;
};
bool cmp(r a, r b) {
if (a.s == b.s)
return a.p > b.p;
return a.s < b.s;
}
int main() {
int n;
cin >> n;
vector<r> v(n), np(n);
for (auto &i : v)
cin >> i.s >> i.p;
for (int i = 0; i... | #include <bits/stdc++.h>
using namespace std;
class r {
public:
string s;
int p;
int rank;
int prank;
};
bool cmp(r a, r b) {
if (a.s == b.s)
return a.p > b.p;
return a.s < b.s;
}
int main() {
int n;
cin >> n;
vector<r> v(n), np(n);
for (auto &i : v)
cin >> i.s >> i.p;
for (int i = 0; i... | [
"identifier.change",
"io.output.change"
] | 839,059 | 839,060 | u767871438 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<pair<string, int>, int>> List(N);
for (int i = 0; i < N; i++) {
string S;
int A;
cin >> S >> A;
List[i] = make_pair(make_pair(S, A), i + 1);
}
sort(List.begin(), List.end());
for (int i = 0; i < N; i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<pair<string, int>, int>> List(N);
for (int i = 0; i < N; i++) {
string S;
int A;
cin >> S >> A;
List[i] = make_pair(make_pair(S, -A), i + 1);
}
sort(List.begin(), List.end());
for (int i = 0; i < N; ... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,067 | 839,068 | u615258936 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<pair<string, int>, int>> List;
for (int i = 0; i < N; i++) {
string S;
int A;
cin >> S >> A;
List[i] = make_pair(make_pair(S, A), i + 1);
}
sort(List.begin(), List.end());
for (int i = 0; i < N; i++)... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<pair<string, int>, int>> List(N);
for (int i = 0; i < N; i++) {
string S;
int A;
cin >> S >> A;
List[i] = make_pair(make_pair(S, -A), i + 1);
}
sort(List.begin(), List.end());
for (int i = 0; i < N; ... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,069 | 839,068 | u615258936 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, b * (-1), i);
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
int id;
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> p(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
p.at(i) = make_tuple(a, b * (-1), i + 1);
}
sort(p.begin(), p.end());
for (int i = 0; i < N; i++) {
int id;... | [
"assignment.change"
] | 839,070 | 839,071 | u335384647 | cpp |
p03030 | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
int main() {
char in[120];
int t;
cin >> t;
int num;
pair<pair<string, int>, int> finder[120];
for (int i = 0; i < t; i++) {
scanf("%s%d", &in, &num);
finder[i] = make_pair(make_pair(in, num), i);
}
sort(finder, finder + t);
// ... | #include <iostream>
using namespace std;
#include <bits/stdc++.h>
int main() {
char in[120];
int t;
cin >> t;
int num;
pair<pair<string, int>, int> finder[120];
for (int i = 0; i < t; i++) {
scanf("%s%d", &in, &num);
finder[i] = make_pair(make_pair(in, -num), i);
}
sort(finder, finder + t);
//... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,072 | 839,073 | u476054945 | cpp |
p03030 | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
bool compare(tuple<int, string, int> a, tuple<int, string, int> b) {
string s = get<1>(a);
if (get<1>(a) != get<1>(b)) {
return get<1>(a) < get<1>(b);
} else {
return get<2>(a) > get<2>(b);
}
}
int main() {
int n;
cin >> n;
au... | #include "bits/stdc++.h"
typedef long long ll;
using namespace std;
bool compare(tuple<int, string, int> a, tuple<int, string, int> b) {
string s = get<1>(a);
if (get<1>(a) != get<1>(b)) {
return get<1>(a) < get<1>(b);
} else {
return get<2>(a) > get<2>(b);
}
}
int main() {
int n;
cin >> n;
au... | [
"assignment.change"
] | 839,076 | 839,077 | u616461826 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> v(n, make_tuple(" ", 0, 0));
for (int i = 0; i < n; i++) {
cin >> get<0>(v[i]) >> get<1>(v[i]);
get<1>(v[i]) = -1 * (get<1>(v[i]));
get<2>(v[i]) = i;
}
sort(v.begin(), v.end());
for (i... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> v(n, make_tuple(" ", 0, 0));
for (int i = 0; i < n; i++) {
cin >> get<0>(v[i]) >> get<1>(v[i]);
get<1>(v[i]) = -1 * (get<1>(v[i]));
get<2>(v[i]) = i + 1;
}
sort(v.begin(), v.end());
fo... | [
"assignment.change"
] | 839,078 | 839,079 | u844640682 | cpp |
p03030 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <mutex>
#include <numeric>
#include <set>
#include <vector>
#define mod 1000000007
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = l... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <mutex>
#include <numeric>
#include <set>
#include <vector>
#define mod 1000000007
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define _GLIBCXX_DEBUG
using namespace std;
using ll = l... | [
"io.output.newline.add"
] | 839,080 | 839,081 | u690461923 | cpp |
p03030 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
#define INF 1001001001
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long... | [
"expression.operation.unary.add"
] | 839,096 | 839,097 | u971166345 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k;
int t[n];
for (i = 0; i < n; i++) {
t[i] = i + 1;
}
string s[n];
int p[n];
for (i = 0; i < n; i++) {
cin >> s[i] >> p[i];
}
int q1;
string q2;
for (i = 0; i < 101; i++) {
for (j = 0; j < n; j++) {
for (k ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, i, j, k;
cin >> n;
int t[n];
for (i = 0; i < n; i++) {
t[i] = i + 1;
}
string s[n];
int p[n];
for (i = 0; i < n; i++) {
cin >> s[i] >> p[i];
}
int q1;
string q2;
for (i = 0; i < 101; i++) {
for (j = 0; j < n; j++) {
... | [] | 839,098 | 839,099 | u952130512 | cpp |
p03030 | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) \
int a; \
cin >> a;
#define inputInt2(a, b) \... | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) \
int a; \
cin >> a;
#define inputInt2(a, b) \... | [
"expression.operation.binary.add"
] | 839,108 | 839,109 | u135358384 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a;
for (int i = 0; i < n; i++) {
string s;
int p;
cin >> s >> p;
a.push_back(make_tuple(s, p, i + 1));
}
sort(a.begin(), a.end());
for (tuple<string, int, int> t : a) {
string ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> a;
for (int i = 0; i < n; i++) {
string s;
int p;
cin >> s >> p;
a.push_back(make_tuple(s, 100 - p, i + 1));
}
sort(a.begin(), a.end());
for (tuple<string, int, int> t : a) {
s... | [
"expression.operation.binary.add"
] | 839,112 | 839,113 | u882039496 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
#define REP(i, k, n) for (long long i = k; i < (long long)(n); i++)
#define all(a) a.begin(), a.end()
#define eb emplace_back
#define pb push_back
#define lb(v, k) (lower_bound(all(v), k) - v.begin())
#define ... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,114 | 839,115 | u422633119 | cpp |
p03030 | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
int N;
cin >> N;
vector<tuple<string, int, int>> res(N);
rep(i, N) {
string rb... | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
int N;
cin >> N;
vector<tuple<string, int, int>> res(N);
rep(i, N) {
string rb... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,118 | 839,119 | u933497430 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
int main() {
int N, po;
std::string t_name;
std::cin >> N;
std::vector<std::pair<std::pair<std::string, int>, int>> SP(N);
for (int i = 0; i < N; i++) {
std::cin >> t_name >> po;
SP[i] = make_pair(make_pai... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
int main() {
int N, po;
std::string t_name;
std::cin >> N;
std::vector<std::pair<std::pair<std::string, int>, int>> SP(N);
for (int i = 0; i < N; i++) {
std::cin >> t_name >> po;
SP[i] = make_pair(make_pai... | [
"expression.operation.binary.add"
] | 839,120 | 839,121 | u456658814 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
pair<pair<string, int>, int> p[101];
string S;
int P;
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].second << en... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
pair<pair<string, int>, int> p[101];
string S;
int P;
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].second + 1 <... | [
"expression.operation.binary.add"
] | 839,131 | 839,132 | u635358463 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
pair<pair<string, int>, int> p[101];
string S;
int P;
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].second << end... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
pair<pair<string, int>, int> p[101];
string S;
int P;
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].second + 1 <... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,133 | 839,132 | u635358463 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define sorted(vector) sort(vector.begin(), vector.end())
#define vmin(vector) *min_element(vector.begin(), vector.end())
#define vmax(vector) *max_element(vector.begin(), vector.end())
#define vsum(vector) accumulate(vector.begin(), vector.end(), 0)
#define append(a) push_... | #include <bits/stdc++.h>
using namespace std;
#define sorted(vector) sort(vector.begin(), vector.end())
#define vmin(vector) *min_element(vector.begin(), vector.end())
#define vmax(vector) *max_element(vector.begin(), vector.end())
#define vsum(vector) accumulate(vector.begin(), vector.end(), 0)
#define append(a) push_... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,134 | 839,135 | u367130284 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define co(a) cout << a << endl
#define sz size()
#define bgn begin()
#define en end()
#... | [
"expression.operation.binary.add"
] | 839,144 | 839,145 | u322177979 | cpp |
p03030 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
int n;
cin >> n;
vector<tuple<string, int, int>> a; // tuple は複数を扱うことができる
for (int i = 1; i <= n; i++) {
string s;
int x;
cin >> s >> x;
x = -x;
a.push_ba... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
int main(void) {
int n;
cin >> n;
vector<tuple<string, int, int>> a; // tuple は複数を扱うことができる
for (int i = 1; i <= n; i++) {
string s;
int x;
cin >> s >> x;
x = -x;
a.push_ba... | [
"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"
] | 839,146 | 839,147 | u905170328 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
pair<pair<string, int>, int> P[110];
rep(i, N) {
string S;
int A;
cin >> S >> A;
P[i] = make_pair(make_pair(S, -A), i);
}
sort(P, P + N);
rep(i, N) cout << P[i]... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int N;
cin >> N;
pair<pair<string, int>, int> P[110];
rep(i, N) {
string S;
int A;
cin >> S >> A;
P[i] = make_pair(make_pair(S, -A), i);
}
sort(P, P + N);
rep(i, N) cout << P[i]... | [
"expression.operation.binary.add"
] | 839,148 | 839,149 | u749022615 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
int n;
cin >> n;
pair<pair<string, int>, int> p[100];
REP(i, n) {
string store;
int score;
cin >> store >> score;
p[i] = make_pair(make_pair(store, score), i + 1);
}
sort(p, p + n);
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int(i) = 0; i < (n); i++)
int main() {
int n;
cin >> n;
pair<pair<string, int>, int> p[100];
REP(i, n) {
string store;
int score;
cin >> store >> score;
p[i] = make_pair(make_pair(store, -score), i + 1);
}
sort(p, p + n);
... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,152 | 839,153 | u082801599 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int num_of_tuple = 0;
cin >> num_of_tuple;
string a;
int b = 0;
vector<tuple<string, int, int>> v(num_of_tuple);
for (int i = 0; i < num_of_tuple; ++i) {
cin >> a >> b;
v.at(i) =
make_tuple(a, b, 1 + i); // 3番目の要素にインデックスの代わりを入れる
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int num_of_tuple = 0;
cin >> num_of_tuple;
string a;
int b = 0;
vector<tuple<string, int, int>> v(num_of_tuple);
for (int i = 0; i < num_of_tuple; ++i) {
cin >> a >> b;
v.at(i) =
make_tuple(a, b, 1 + i); // 3番目の要素にインデックスの代わりを入れる
... | [
"control_flow.return.add"
] | 839,154 | 839,155 | u376041842 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
using tsii = tuple<string, int, int>;
int N;
cin >> N;
vector<tsii> data(N);
for (int i = 0; i < N; i++) {
string town;
int point;
cin >> town >> point;
data.at(i) = make_tuple(town, point, i + 1);
}
sort(data.begin(), data.e... | #include <bits/stdc++.h>
using namespace std;
int main() {
using tsii = tuple<string, int, int>;
int N;
cin >> N;
vector<tsii> data(N);
for (int i = 0; i < N; i++) {
string town;
int point;
cin >> town >> point;
data.at(i) = make_tuple(town, -1 * point, i + 1);
}
sort(data.begin(), d... | [
"assignment.change"
] | 839,171 | 839,172 | u537601250 | cpp |
p03030 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define vi vector<int>
#define vii vector<vi>
#define vs vector<string>
#define vss vector<vs>
#define all(x) x.begin(), x.end()
#define pi 3.1415926536
#define ff first
#define ss second
#defin... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define ifaxb(a, x, b) if (a < x && x < b) // 比較は昇順
#define vi vector<int>
#define vii vector<vi>
#define vs vector<string>
#define vss vector<vs>
#define all(x) x.begin(), x.end()
#define pi 3.1415926536
#define ff first
#define ss second
#defin... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,175 | 839,176 | u075520262 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int N, P;
cin >> N;
string s;
pair<pair<string, int>, int> p[110];
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 =... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int N, P;
cin >> N;
string s;
pair<pair<string, int>, int> p[110];
for (int i = 0; i < N; i++) {
cin >> s >> P;
p[i] = make_pair(make_pair(s, -P), i + 1);
}
sort(p, p + N);
for (int... | [
"assignment.change"
] | 839,177 | 839,178 | u047554023 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int N, P;
cin >> N;
string s;
pair<pair<string, int>, int> p[110];
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 = ... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int main() {
int N, P;
cin >> N;
string s;
pair<pair<string, int>, int> p[110];
for (int i = 0; i < N; i++) {
cin >> s >> P;
p[i] = make_pair(make_pair(s, -P), i + 1);
}
sort(p, p + N);
for (int... | [
"expression.operation.unary.add",
"call.arguments.change",
"assignment.change"
] | 839,179 | 839,178 | u047554023 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<pair<string, int>, int> mp;
for (int i = 0; i < n; i++) {
string s;
int p;
cin >> s >> p;
mp[{s, p}] = i + 1;
}
for (auto p : mp)
cout << p.second << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n;
cin >> n;
map<pair<string, int>, int> mp;
for (int i = 0; i < n; i++) {
string s;
int p;
cin >> s >> p;
mp[{s, -p}] = i + 1;
}
for (auto p : mp)
cout << p.second << endl;
return 0;
} | [
"expression.operation.unary.add"
] | 839,187 | 839,188 | u804999113 | 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 >> p;
p = -p;
a.push_back(tie(s, p, i));
}
sort(a.begin(), a.end());
for (int i = 0; i < N - 1; i++) {
string s;... | #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++) {
string s;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 839,194 | 839,195 | u120826790 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<string, int>> data(N), sub(N);
for (int i = 0; i < N; i++) {
cin >> data.at(i).first >> data.at(i).second;
data.at(i).second = -data.at(i).second;
sub.at(i).first = data.at(i).first;
sub.at(i).second = data.a... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<pair<string, int>> data(N), sub(N);
for (int i = 0; i < N; i++) {
cin >> data.at(i).first >> data.at(i).second;
data.at(i).second = -data.at(i).second;
sub.at(i).first = data.at(i).first;
sub.at(i).second = data.a... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 839,196 | 839,197 | u239087789 | cpp |
p03030 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<uns... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend())
#define ll long long
using namespace std;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
typedef vector<uns... | [] | 839,198 | 839,199 | u493750228 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
tuple<string, int, int> t[n];
vector<tuple<string, int, int>> vt(n);
for (int i = 1; i <= n; i++) {
string s;
int p;
cin >> s >> p;
t[i - 1] = make_tuple(s, p, i);
}
for (int i = 0; i < n; i++)
vt.at(i) = t[i]... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
tuple<string, int, int> t[n];
vector<tuple<string, int, int>> vt(n);
for (int i = 1; i <= n; i++) {
string s;
int p;
cin >> s >> p;
p *= -1;
t[i - 1] = make_tuple(s, p, i);
}
for (int i = 0; i < n; i++)
vt... | [
"assignment.add"
] | 839,230 | 839,231 | u757584836 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
using pii = pair<pair<string, int>, int>;
vector<pii> rank(N);
for (int i = 0; i < N; i++) {
cin >> rank.at(i).first.first >> rank.at(i).first.second;
rank.at(i).first.second = -rank.at(i).first.second;
rank.at(i).sec... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
using pii = pair<pair<string, int>, int>;
vector<pii> rank(N);
for (int i = 0; i < N; i++) {
cin >> rank.at(i).first.first >> rank.at(i).first.second;
rank.at(i).first.second = -rank.at(i).first.second;
rank.at(i).sec... | [
"assignment.change"
] | 839,236 | 839,237 | u408053928 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> AAA(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
b = b * (-1);
AAA.push_back(make_tuple(a, b, i + 1));
}
sort(AAA.begin(), AAA.end());
for (tuple<string, in... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> AAA;
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
b = b * (-1);
AAA.push_back(make_tuple(a, b, i + 1));
}
sort(AAA.begin(), AAA.end());
for (tuple<string, int, ... | [] | 839,241 | 839,242 | u804980376 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
long gcd(long n, long m) {
if (n == 0)
return m;
if (n < m)
swap(n, m);
return gcd(n % m, m);
}
int main() {
int N;
cin >> N;
string s[110];
int p[110];
int a[110];
for (int i = 0; i < N; i++) {
cin >> s[i] >> p[i];
a[i] = i + 1;
}
fo... | #include <bits/stdc++.h>
using namespace std;
long gcd(long n, long m) {
if (n == 0)
return m;
if (n < m)
swap(n, m);
return gcd(n % m, m);
}
int main() {
int N;
cin >> N;
string s[110];
int p[110];
int a[110];
for (int i = 0; i < N; i++) {
cin >> s[i] >> p[i];
a[i] = i + 1;
}
fo... | [
"control_flow.loop.for.condition.change"
] | 839,243 | 839,244 | u126833093 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> SP(N);
for (int i = 0; i < N; i++) {
string S;
int P;
cin >> S >> P;
SP[i] = make_tuple(S, P, i + 1);
}
// sort(SP.begin(),SP.end(),[](pair<string, int> x,pair<string, int> y){retur... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> SP(N);
for (int i = 0; i < N; i++) {
string S;
int P;
cin >> S >> P;
SP[i] = make_tuple(S, P * (-1), i + 1);
}
// sort(SP.begin(),SP.end(),[](pair<string, int> x,pair<string, int> y... | [
"assignment.change"
] | 839,259 | 839,260 | u582415761 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> v(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
v[i] = make_tuple(a, b, i + 1);
}
sort(v.begin(), v.end());
... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> v(N);
for (int i = 0; i < N; i++) {
string a;
int b;
cin >> a >> b;
v[i] = make_tuple(a, -1 * b, i + 1);
}
sort(v.begin(), v.end(... | [
"assignment.change"
] | 839,286 | 839,287 | u319817649 | cpp |
p03030 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, p;
cin >> n;
string s;
pair<pair<string, int>, int> a[114];
for (int i = 1; i <= n; i++) {
cin >> s >> p;
a[i].first.first = s;
a[i].first.second = -p;
a[i].second = i;
}
sort(a, a + n);
fo... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, p;
cin >> n;
string s;
pair<pair<string, int>, int> a[114];
for (int i = 0; i < n; i++) {
cin >> s >> p;
a[i].first.first = s;
a[i].first.second = -p;
a[i].second = i + 1;
}
sort(a, a + n);
... | [
"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",
"assignment.change"
] | 839,292 | 839,293 | u601082779 | cpp |
p03030 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, p;
cin >> n;
string s;
pair<pair<string, int>, int> a[114];
for (int i = 1; i <= n; i++) {
cin >> s >> p;
a[i].first.first = s;
a[i].first.second = p;
a[i].second = i;
}
sort(a, a + n);
for... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int main() {
int n, p;
cin >> n;
string s;
pair<pair<string, int>, int> a[114];
for (int i = 0; i < n; i++) {
cin >> s >> p;
a[i].first.first = s;
a[i].first.second = -p;
a[i].second = i + 1;
}
sort(a, a + n);
... | [
"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",
"expression.operation.unary.add",
"assignment.chang... | 839,294 | 839,293 | u601082779 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
bool cmp(pair<pair<string, int>, int> a, pair<pair<string, int>, int> b) {
if (a.first.first == b.first.first)
return a.first.second > b.first.second;
return a.first.first > b.first.first;
}
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> ... | #include <bits/stdc++.h>
using namespace std;
bool cmp(pair<pair<string, int>, int> a, pair<pair<string, int>, int> b) {
if (a.first.first == b.first.first)
return a.first.second > b.first.second;
return a.first.first < b.first.first;
}
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> ... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 839,315 | 839,316 | u676654593 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
bool cmp(pair<pair<string, int>, int> a, pair<pair<string, int>, int> b) {
if (a.first.first == b.first.first)
return a.first.second > b.first.second;
return a.first.first > b.first.first;
}
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> ... | #include <bits/stdc++.h>
using namespace std;
bool cmp(pair<pair<string, int>, int> a, pair<pair<string, int>, int> b) {
if (a.first.first == b.first.first)
return a.first.second > b.first.second;
return a.first.first < b.first.first;
}
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> ... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.newline.add"
] | 839,317 | 839,316 | u676654593 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> x(N);
for (int i = 1; i <= N; i++) {
string s;
int p;
cin >> s >> p;
p = -p;
x.push_back(tie(s, p, i));
}
sort(x.begin(), x.end());
for (int i = 0; i < N; i++) {
string s;... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> x;
for (int i = 1; i <= N; i++) {
string s;
int p;
cin >> s >> p;
p = -p;
x.push_back(tie(s, p, i));
}
sort(x.begin(), x.end());
for (int i = 0; i < N; i++) {
string s;
... | [] | 839,320 | 839,321 | u053990350 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
set<pair<pair<string, int>, int>> S;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
int r;
cin >> s >> r;
S.insert({{s, r}, i + 1});
}
for (auto r : S)
cout << r.second << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
set<pair<pair<string, int>, int>> S;
cin >> n;
for (int i = 0; i < n; i++) {
string s;
int r;
cin >> s >> r;
S.insert({{s, -r}, i + 1});
}
for (auto r : S)
cout << r.second << "\n";
}
| [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,330 | 839,331 | u394704810 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> a(0);
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
tuple<string, int, int> ato;
ato = make_tuple(x, 100 - y, i + 1);
a.push_back(ato);
}
sort(a.begin(), a.end());
for ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
vector<tuple<string, int, int>> a(0);
for (int i = 0; i < N; i++) {
string x;
int y;
cin >> x >> y;
tuple<string, int, int> ato;
ato = make_tuple(x, 100 - y, i + 1);
a.push_back(ato);
}
sort(a.begin(), a.end... | [
"variable_declaration.type.change"
] | 839,346 | 839,347 | u424602097 | cpp |
p03030 | // ABC128A.cpp : このファイルには 'main'
// 関数が含まれています。プログラム実行の開始と終了がそこで行われます。
//
#include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
pair<pair<string, int>, int> p[110];
int main() {
int a;
cin >> a;
string pl;
int t;
for (int i = 0;... | #include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
pair<pair<string, int>, int> p[110];
int main() {
int a;
cin >> a;
string pl;
int t;
for (int i = 0; i < a; i++) {
cin >> pl >> t;
p[i] = make_pair(make_pair(pl, -t),... | [
"io.output.newline.add"
] | 839,369 | 839,370 | u038582728 | cpp |
p03030 | #include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
const int Max = 100;
int N;
cin >> N;
struct Data {
int ex_pos; //番号
int point; //点数
string name;
};
vector<Data> d(N); // vectorの中に構造体(型) 宣言時にサ... | #include <algorithm>
#include <array>
#include <iostream>
#include <numeric>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
const int Max = 100;
int N;
cin >> N;
struct Data {
int ex_pos; //番号
int point; //点数
string name;
};
vector<Data> d(N); // vectorの中に構造体(型) 宣言時にサ... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"io.output.newline.add"
] | 839,371 | 839,372 | u038582728 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
char in[120];
pair<pair<string, int>, int> p[110];
int main() {
int a;
scanf("%d", &a);
for (int i = 0; i < a; i++) {
int t;
scanf("%s%d", &t);
string tmp = in;
p[i] = make_pair(make_pair(in, -t), i);
}
sort(p, p + a);
for (int i = 0; i < a; i++... | #include <bits/stdc++.h>
using namespace std;
char in[120];
pair<pair<string, int>, int> p[110];
int main() {
int a;
scanf("%d", &a);
for (int i = 0; i < a; i++) {
int t;
scanf("%s%d", in, &t);
string tmp = in;
p[i] = make_pair(make_pair(in, -t), i);
}
sort(p, p + a);
for (int i = 0; i < a;... | [
"call.arguments.add"
] | 839,381 | 839,382 | u835992439 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
char in[120];
pair<pair<string, int>, int> p[110];
int main() {
int a;
scanf("%d", &a);
for (int i = 0; i < a; i++) {
int t;
scanf("%s%d", &t);
string tmp = in;
p[i] = make_pair(make_pair(in, -t), i);
}
sort(p, p + a);
for (int i = 0; i < a; i++... | #include <bits/stdc++.h>
using namespace std;
char in[120];
pair<pair<string, int>, int> p[110];
int main() {
int a;
scanf("%d", &a);
for (int i = 0; i < a; i++) {
int t;
scanf("%s%d", in, &t);
string tmp = in;
p[i] = make_pair(make_pair(in, -t), i);
}
sort(p, p + a);
for (int i = 0; i < a;... | [
"call.arguments.add"
] | 839,383 | 839,382 | u835992439 | cpp |
p03030 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> v(n);
for (int i = 0; i < n; ++i) {
string a;
int b;
cin >> a >> b;
v[i] = make_tuple(a, b, i);
}
sort(v.begin(), v.end());
for (int i = 0; i < n; ++i) {
int a = get<2>(v[i]);
... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> v(n);
for (int i = 0; i < n; ++i) {
string a;
int b;
cin >> a >> b;
v[i] = make_tuple(a, -b, i);
}
sort(v.begin(), v.end());
for (int i = 0; i < n; ++i) {
int a = get<2>(v[i]);
... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 839,387 | 839,388 | u567252408 | cpp |
p03030 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<pair<string, int>, int> P;
int main() {
int n;
cin >> n;
vector<P> guide(n);
for (int i = 0; i < n; i++) {
cin >> guide[i].first.first;
cin >> guide[i].first.second;
guide[i].first.second *= (-1);
gu... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef pair<pair<string, int>, int> P;
int main() {
int n;
cin >> n;
vector<P> guide(n);
for (int i = 0; i < n; i++) {
cin >> guide[i].first.first;
cin >> guide[i].first.second;
guide[i].first.second *= (-1);
gu... | [
"expression.operation.binary.add"
] | 839,391 | 839,392 | u440276250 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
a--;
b--;
c--;
d--;
bool res = true;
rep(i, max(c, d) - a - 1) {
if (s[a + i] == '#' && s[a + i + ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
a--;
b--;
c--;
d--;
bool res = true;
rep(i, max(c, d) - a) {
if (s[a + i] == '#' && s[a + i + 1] =... | [
"expression.operation.binary.remove"
] | 839,407 | 839,408 | u315542000 | cpp |
p03017 | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
//入力終了
//(A, C)に2マス連続で岩があればNG
for (int i = A + 1; i <= C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '... | #include <iostream>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
int main() {
int N, A, B, C, D;
cin >> N >> A >> B >> C >> D;
A--;
B--;
C--;
D--;
string S;
cin >> S;
//入力終了
//(A, C)に2マス連続で岩があればNG
for (int i = A + 1; i <= C - 1; i++) {
if (S[i] == '#' && S[i + 1] == '... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 839,409 | 839,410 | u537852947 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
bool w = true;
cin >> n >> a >> b >> c >> d >> s;
if (c > d) {
w = false;
for (int i = b - 1; i < d - 1; i++)
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
w = true;
}
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b, c, d;
string s;
bool w = true;
cin >> n >> a >> b >> c >> d >> s;
if (c > d) {
w = false;
for (int i = b - 2; i < d - 1; i++)
if (s[i] == '.' && s[i + 1] == '.' && s[i + 2] == '.')
w = true;
}
for (int i = a; i ... | [
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operation.binary.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove"
] | 839,419 | 839,418 | u882098164 | cpp |
p03017 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
// cin.eof() 入力個数の問題
// int num = atoi(string.c_str()); 文字列の整数変換
int keta(ll n) {
int an... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define ll long long int
#define INF 1000000007
#define llINF 1000000000000000007
#define v(i) vector<i>
#define vv(i) vector<vector<i>>
// cin.eof() 入力個数の問題
// int num = atoi(string.c_str()); 文字列の整数変換
int keta(ll n) {
int an... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 839,422 | 839,423 | u776439373 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.