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;
int b;
int c;
tie(a, b, c) = p.at(i);
cout << c << endl;
}
} | #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;
int b;
int c;
tie(a, b, c) = p.at(i);
cout << c << endl;
}
} | [
"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 b;
int c;
tie(a, b, c) = p.at(i);
cout << c << endl;
}
} | #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;
int b;
int c;
tie(a, b, c) = p.at(i);
cout << c << endl;
}
} | [
"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++) {
string a;
int b;
int c;
tie(a, b, c) = p.at(i); // b, a の順であることに注意
cout << c << endl;
}
} | #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;
int b;
int c;
tie(a, b, c) = p.at(i);
cout << c << endl;
}
} | [
"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 + 1);
vec.push_back(tup);
}
sort(vec.begin(), vec.end());
rep(i, N) {
int ans;
tie(ignore, ignore, ans) = (vec[i]);
cout << ans << endl;
}
} | #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);
vec.push_back(tup);
}
sort(vec.begin(), vec.end());
rep(i, N) {
int ans;
tie(ignore, ignore, ans) = (vec[i]);
cout << ans << endl;
}
} | [] | 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, c;
tie(a, b, c) = p.at(i);
cout << c << endl;
}
} | #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;
int b, c;
tie(a, b, c) = p.at(i);
cout << c << endl;
}
} | [
"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;
int p;
cin >> s >> p;
dic.push_back(tie(s, p, i));
}
sort(all(dic));
for (int i = 0; i < n; i++) {
cout << get<2>(dic[i]) << endl;
}
} | #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;
int p;
cin >> s >> p;
p *= -1;
dic.push_back(tie(s, p, i));
}
sort(all(dic));
for (int i = 0; i < n; i++) {
cout << get<2>(dic[i]) << endl;
}
}
| [
"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;
int p;
cin >> s >> p;
dic.push_back(tie(s, p, i));
}
sort(all(dic));
for (int i = 0; i < n; i++) {
cout << get<2>(dic[i]) << endl;
}
} | #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;
int p;
cin >> s >> p;
p *= -1;
dic.push_back(tie(s, p, i));
}
sort(all(dic));
for (int i = 0; i < n; i++) {
cout << get<2>(dic[i]) << endl;
}
} | [
"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 (int i = 0; i < N; i++) {
cout << p[i].second << endl;
}
} | #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);
for (int i = 0; i < N; i++) {
cout << p[i].second << endl;
}
} | [
"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<string> VS;
int main() {
int N;
cin >> N;
string s;
int p;
vector<tuple<string, int, int>> book(N);
REP(i, N) {
cin >> s >> p;
book[i] = make_tuple(s, (-1) * p, i);
}
sort(ALL(book));
REP(i, N) cout << get<2>(book[i]) << endl;
}
| #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<string> VS;
int main() {
int N;
cin >> N;
string s;
int p;
vector<tuple<string, int, int>> book(N);
REP(i, N) {
cin >> s >> p;
book[i] = make_tuple(s, (-1) * p, i);
}
sort(ALL(book));
REP(i, N) cout << get<2>(book[i]) + 1 << endl;
}
| [
"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;
int b, c;
tie(a, b, c) = p.at(i);
cout << c << endl;
}
}
| #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;
int b, c;
tie(a, b, c) = p.at(i);
cout << c << endl;
}
}
| [
"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 b, c;
tie(a, b, c) = p.at(i);
cout << c << endl;
}
} | #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;
int b, c;
tie(a, b, c) = p.at(i);
cout << c << endl;
}
}
| [
"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) = X.at(i);
cout << b << endl;
}
} | #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) = X.at(i);
cout << b << endl;
}
} | [
"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.at(i);
cout << b << endl;
}
} | #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) = X.at(i);
cout << b << endl;
}
} | [
"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] = make_tuple(s, a, i);
}
sort(p.begin(), p.end());
string tmp = get<0>(p[0]);
vector<int> A;
for (int i = 0; i < n; i++) {
int x = get<2>(p[i]);
cout << (x + 1) << endl;
}
return 0;
} | #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] = make_tuple(s, (-1) * a, i);
}
sort(p.begin(), p.end());
string tmp = get<0>(p[0]);
vector<int> A;
for (int i = 0; i < n; i++) {
int x = get<2>(p[i]);
cout << (x + 1) << endl;
}
return 0;
}
| [
"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<2>(X.at(i)) << endl;
}
return 0;
}
| #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>(X.at(i)) << endl;
}
return 0;
}
| [] | 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).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SORT(x) std::sort(ALL(x))
#define RSORT(x, T) std::sort(ALL(x), greater<T>())
#define REVERCE(x) std::reverce(ALL(x))
#define ACM(x, y) std::accumulate(ALL(x), y)
#define INT_POW(x, y) \
[](int a, int b) -> int { \
int c = a; \
REP(i, b - 1) { c *= a; } \
return c; \
}(x, y)
#define INT_POWM(x, y, m) \
[](int a, int b, int m) -> int { \
int c = a; \
REP(i, b - 1) { \
c *= a; \
c %= m; \
} \
return c; \
}(x, y, m)
itn main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
vector<pair<pair<string, int>, int>> a;
REP(i, n) {
cin >> a[i].first.first >> a[i].first.second;
a[i].first.second *= -1;
a[i].second = i + 1;
}
SORT(a);
REP(i, n) { cout << a[i].second << '\n'; }
return 0;
} | #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).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SORT(x) std::sort(ALL(x))
#define RSORT(x, T) std::sort(ALL(x), greater<T>())
#define REVERCE(x) std::reverce(ALL(x))
#define ACM(x, y) std::accumulate(ALL(x), y)
#define INT_POW(x, y) \
[](int a, int b) -> int { \
int c = a; \
REP(i, b - 1) { c *= a; } \
return c; \
}(x, y)
#define INT_POWM(x, y, m) \
[](int a, int b, int m) -> int { \
int c = a; \
REP(i, b - 1) { \
c *= a; \
c %= m; \
} \
return c; \
}(x, y, m)
itn main() {
std::ios::sync_with_stdio(false);
int n;
cin >> n;
vector<pair<pair<string, int>, int>> a(n);
REP(i, n) {
cin >> a[i].first.first >> a[i].first.second;
a[i].first.second *= -1;
a[i].second = i + 1;
}
SORT(a);
REP(i, n) { cout << a[i].second << '\n'; }
return 0;
} | [] | 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.end());
for (int i = 0; i < N; i++) {
cout << get<2>(vec.at(N - i - 1)) << endl;
}
} | #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(), vec.end());
for (int i = 0; i < N; i++) {
cout << get<2>(vec.at(i)) << endl;
}
} | [
"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 >> n;
vector<tuple<string, int, int>> a(n);
rep(i, n) {
string s;
int p;
cin >> s >> p;
a[i] = make_tuple(s, p, i + 1);
}
sort(a.begin(), a.end());
stack<int> st;
rep(i, n) {
st.push(get<2>(a[i]));
if (i != n - 1 && get<0>(a[i]) == get<0>(a[i + 1]))
continue;
else {
while (st.empty()) {
cout << st.top() << endl;
st.pop();
}
}
}
return 0;
}
| #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 >> n;
vector<tuple<string, int, int>> a(n);
rep(i, n) {
string s;
int p;
cin >> s >> p;
a[i] = make_tuple(s, p, i + 1);
}
sort(a.begin(), a.end());
stack<int> st;
rep(i, n) {
st.push(get<2>(a[i]));
if (i != n - 1 && get<0>(a[i]) == get<0>(a[i + 1]))
continue;
else {
while (!st.empty()) {
cout << st.top() << endl;
st.pop();
}
}
}
return 0;
}
| [
"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]) << endl;
}
} | #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]) << endl;
}
} | [
"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));
}
sort(C.begin(), C.end());
for (int i = 0; i < N - 1; i++) {
for (int j = N - 1; j >= i - 1; j--) {
if (C[j].first == C[j - 1].first) {
if (C[j].second > C[j - 1].second) {
guide tmp = C[j];
C[j] = C[j - 1];
C[j - 1] = tmp;
}
}
}
}
for (int i = 0; i < N; i++) {
guide c = C[i];
for (int j = 0; j < N; j++) {
if (c == G[j])
cout << j + 1 << endl;
}
}
return 0;
}
| #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));
}
sort(C.begin(), C.end());
for (int i = 0; i < N - 1; i++) {
for (int j = N - 1; j >= i + 1; j--) {
if (C[j].first == C[j - 1].first) {
if (C[j].second > C[j - 1].second) {
guide tmp = C[j];
C[j] = C[j - 1];
C[j - 1] = tmp;
}
}
}
}
for (int i = 0; i < N; i++) {
guide c = C[i];
for (int j = 0; j < N; j++) {
if (c == G[j])
cout << j + 1 << endl;
}
}
return 0;
}
| [
"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));
}
sort(C.begin(), C.end());
for (int i = 0; i < N - 1; i++) {
for (int j = N - 1; j >= i - 1; j--) {
if (C[j].first == C[j - 1].first) {
if (C[j].second > C[j - 1].second) {
guide tmp = C[j];
C[j] = C[j - 1];
C[j - 1] = tmp;
}
}
}
}
for (int i = 0; i < N; i++) {
guide c = C[i];
for (int j = 0; j < N; j++) {
if (c == G[j])
cout << j + 1 << endl;
}
}
return 0;
}
| #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));
}
sort(C.begin(), C.end());
for (int i = 0; i < N - 1; i++) {
for (int j = N - 1; j >= i + 1; j--) {
if (C[j].first == C[j - 1].first) {
if (C[j].second > C[j - 1].second) {
guide tmp = C[j];
C[j] = C[j - 1];
C[j - 1] = tmp;
}
}
}
}
for (int i = 0; i < N; i++) {
guide c = C[i];
for (int j = 0; j < N; j++) {
if (c == G[j])
cout << j + 1 << endl;
}
}
return 0;
}
| [
"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(make_pair(s, -x), i);
}
sort(p.begin(), p.end());
REP(i, n) { cout << p[i].second << endl; }
}
| #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(make_pair(s, -x), i);
}
sort(p.begin(), p.end());
rep(i, n) { cout << p[i].second + 1 << endl; }
}
| [
"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 double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
#define MOD 1000000007
#define MAX_V 100010
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N] = {0};
ll fib(ll a) {
if (fibl[a] != 0)
return fibl[a];
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
}
return fibl[a] = fib(a - 1) + fib(a - 2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i = 0; i <= n; ++i)
x[i] = true;
x[0] = x[1] = false;
for (int i = 2; i <= n; ++i) {
if (x[i]) {
p++;
for (int j = 2 * i; j <= n; j += i)
x[j] = false;
}
num[i] = p;
}
return p;
}
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll junnretu(ll n) {
ll ans = 1;
for (ll i = 1; i <= n; i++) {
ans *= i;
}
return ans;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> mp;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n != 1)
mp[n] = 1;
return mp;
}
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
int main() {
ll n;
cin >> n;
pair<pair<string, ll>, int> x[110];
for (ll i = 0; i < n; i++) {
ll p;
string s;
cin >> s >> p;
auto z = make_pair(s, p);
x[i] = make_pair(z, i + 1);
}
sort(x, x + n);
for (ll i = 0; i < n; i++) {
cout << x[i].second << endl;
}
return 0;
}
| #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 double ld;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1LL << 60;
#define MOD 1000000007
#define MAX_V 100010
#define MAX_N 1000100
bool x[MAX_N];
ll num[MAX_N];
ll fibl[MAX_N] = {0};
ll fib(ll a) {
if (fibl[a] != 0)
return fibl[a];
if (a == 0) {
return 0;
} else if (a == 1) {
return 1;
}
return fibl[a] = fib(a - 1) + fib(a - 2);
}
ll eratosthenes(ll n) {
int p = 0;
for (ll i = 0; i <= n; ++i)
x[i] = true;
x[0] = x[1] = false;
for (int i = 2; i <= n; ++i) {
if (x[i]) {
p++;
for (int j = 2 * i; j <= n; j += i)
x[j] = false;
}
num[i] = p;
}
return p;
}
bool pairCompare(const pair<double, ll> &firstElof,
const pair<double, ll> &secondElof) {
return firstElof.first < secondElof.first;
}
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
ll junnretu(ll n) {
ll ans = 1;
for (ll i = 1; i <= n; i++) {
ans *= i;
}
return ans;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> mp;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
mp[i]++;
n /= i;
}
}
if (n != 1)
mp[n] = 1;
return mp;
}
ll keta(ll N) {
int tmp{};
while (N > 0) {
tmp += (N % 10);
N /= 10;
}
N = tmp;
return N;
}
int main() {
ll n;
cin >> n;
pair<pair<string, ll>, int> x[110];
for (ll i = 0; i < n; i++) {
ll p;
string s;
cin >> s >> p;
auto z = make_pair(s, -p);
x[i] = make_pair(z, i + 1);
}
sort(x, x + n);
for (ll i = 0; i < n; i++) {
cout << x[i].second << endl;
}
return 0;
}
| [
"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 = 0; i < n; i++) {
cout << (K[i].second) + 1 << endl;
}
return 0;
}
| #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 = 0; i < n; i++) {
cout << (K[i].second) + 1 << endl;
}
return 0;
} | [
"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 << get<2>(a[i]) << endl;
}
}
| #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<2>(a[i]) << endl;
}
}
| [
"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("%d", &N);
for (int i = 0; i < N; ++i) {
cin >> t >> t2;
rest.push_back((struct apair){t, t2, i});
}
sort(rest.begin(), rest.end(), &cmp);
for (int i = 0; i < rest.size(); ++i)
printf("%d\n", rest[i].id);
return 0;
}
bool cmp(struct apair first, struct apair second) {
if (first.first != second.first)
return first.first < second.first;
return first.second > second.second;
}
| #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("%d", &N);
for (int i = 0; i < N; ++i) {
cin >> t >> t2;
rest.push_back((struct apair){t, t2, i});
}
sort(rest.begin(), rest.end(), &cmp);
for (int i = 0; i < rest.size(); ++i)
printf("%d\n", rest[i].id + 1);
return 0;
}
bool cmp(struct apair first, struct apair second) {
if (first.first != second.first)
return first.first < second.first;
return first.second > second.second;
}
| [
"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(i)) = 100 - get<1>(assessment.at(i));
}
sort(assessment.begin(), assessment.end());
rep(i, N) { cout << get<2>(assessment.at(i)) << endl; }
} | #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(i)) = 100 - get<1>(assessment.at(i));
}
sort(assessment.begin(), assessment.end());
rep(i, N) { cout << get<2>(assessment.at(i)) + 1 << endl; }
} | [
"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<string>>;
#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++)
#define _GLIBCXX_DEBUG
int main() {
int n;
cin >> n;
vstr s(n);
vstr p(n);
rep(i, n) cin >> s[i] >> p[i];
vvstr a(n, vstr(3));
rep(i, n) {
a[i][0] = s[i];
a[i][1] = p[i];
a[i][2] = to_string(i + 1);
}
rep(i, n - 1) {
rep2(j, i + 1, n) {
if (a[i][0] > a[j][0]) {
vstr tmp = {a[i][0], a[i][1], a[i][2]};
a[i][0] = a[j][0];
a[i][1] = a[j][1];
a[i][2] = a[j][2];
a[j][0] = tmp[0];
a[j][1] = tmp[2];
a[j][2] = tmp[2];
} else if (a[i][0] == a[j][0]) {
if (a[i][1].size() == a[j][1].size()) {
if (a[i][1] < a[j][1]) {
vstr tmp = {a[i][0], a[i][1], a[i][2]};
a[i][0] = a[j][0];
a[i][1] = a[j][1];
a[i][2] = a[j][2];
a[j][0] = tmp[0];
a[j][1] = tmp[2];
a[j][2] = tmp[2];
}
}
if (a[i][1].size() < a[j][1].size()) {
vstr tmp = {a[i][0], a[i][1], a[i][2]};
a[i][0] = a[j][0];
a[i][1] = a[j][1];
a[i][2] = a[j][2];
a[j][0] = tmp[0];
a[j][1] = tmp[2];
a[j][2] = tmp[2];
}
}
}
}
rep(i, n) cout << a[i][2] << endl;
} | #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<string>>;
#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++)
#define _GLIBCXX_DEBUG
int main() {
int n;
cin >> n;
vstr s(n);
vstr p(n);
rep(i, n) cin >> s[i] >> p[i];
vvstr a(n, vstr(3));
rep(i, n) {
a[i][0] = s[i];
a[i][1] = p[i];
a[i][2] = to_string(i + 1);
}
rep(i, n - 1) {
rep2(j, i + 1, n) {
if (a[i][0] > a[j][0]) {
vstr tmp = {a[i][0], a[i][1], a[i][2]};
a[i][0] = a[j][0];
a[i][1] = a[j][1];
a[i][2] = a[j][2];
a[j][0] = tmp[0];
a[j][1] = tmp[1];
a[j][2] = tmp[2];
} else if (a[i][0] == a[j][0]) {
if (a[i][1].size() == a[j][1].size()) {
if (a[i][1] < a[j][1]) {
vstr tmp = {a[i][0], a[i][1], a[i][2]};
a[i][0] = a[j][0];
a[i][1] = a[j][1];
a[i][2] = a[j][2];
a[j][0] = tmp[0];
a[j][1] = tmp[1];
a[j][2] = tmp[2];
}
}
if (a[i][1].size() < a[j][1].size()) {
vstr tmp = {a[i][0], a[i][1], a[i][2]};
a[i][0] = a[j][0];
a[i][1] = a[j][1];
a[i][2] = a[j][2];
a[j][0] = tmp[0];
a[j][1] = tmp[1];
a[j][2] = tmp[2];
}
}
}
}
rep(i, n) cout << a[i][2] << endl;
} | [
"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) {
string s;
int a;
cin >> s >> a;
vec[i] = make_tuple(s, (-1) * a, i);
}
sort(vec.begin(), vec.end());
rep(i, N) { cout << get<2>(vec[i]) << endl; }
}
| #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) {
string s;
int a;
cin >> s >> a;
vec[i] = make_tuple(s, (-1) * a, i);
}
sort(vec.begin(), vec.end());
rep(i, N) { cout << get<2>(vec[i]) + 1 << endl; }
}
| [
"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(I, 0, N)
#define For(I, N) for (int I = 1; I <= (N); I++)
#define ALL(A) ((A).begin(), (A).end())
#define set0(ar) memset(ar, 0, sizeof ar)
#define vsort(v) sort(v.begin(), v.end())
#define setinf(ar) memset(ar, 126, sizeof ar)
#define SZ(X) ((int)(X.size()))
#define LG(X) ((int)(X.length()))
#define CL(X) (X).clear()
#define MAXEL(A, B) (*max_element(A, B))
#define MINEL(A, B) (*min_element(A, B))
#define ROPEN(X) freopen(X, "r", stdin)
#define WOPEN(X) freopen(X, "w", stdout)
#define BG(X) (X.begin())
#define EN(X) (X.end())
#define VI vector<int>
#define PII pair<int, int>
// cout << fixed << setprecision(20) << p << endl;
template <class T> inline T bigmod(T p, T e, T M) {
LL ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<tuple<string, int, int>> v(n);
For(i, n) {
string s;
int p;
cin >> s >> p;
v[i] = make_tuple(s, -p, i);
}
vsort(v);
For(i, n) { cout << get<2>(v[i]) << endl; }
return 0;
}
| #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(I, 0, N)
#define For(I, N) for (int I = 1; I <= (N); I++)
#define ALL(A) ((A).begin(), (A).end())
#define set0(ar) memset(ar, 0, sizeof ar)
#define vsort(v) sort(v.begin(), v.end())
#define setinf(ar) memset(ar, 126, sizeof ar)
#define SZ(X) ((int)(X.size()))
#define LG(X) ((int)(X.length()))
#define CL(X) (X).clear()
#define MAXEL(A, B) (*max_element(A, B))
#define MINEL(A, B) (*min_element(A, B))
#define ROPEN(X) freopen(X, "r", stdin)
#define WOPEN(X) freopen(X, "w", stdout)
#define BG(X) (X.begin())
#define EN(X) (X.end())
#define VI vector<int>
#define PII pair<int, int>
// cout << fixed << setprecision(20) << p << endl;
template <class T> inline T bigmod(T p, T e, T M) {
LL ret = 1;
for (; e > 0; e >>= 1) {
if (e & 1)
ret = (ret * p) % M;
p = (p * p) % M;
}
return (T)ret;
}
template <class T> inline T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <class T> inline T modinverse(T a, T M) { return bigmod(a, M - 2, M); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<tuple<string, int, int>> v(n);
REP(i, n) {
string s;
int p;
cin >> s >> p;
v[i] = make_tuple(s, -p, i + 1);
}
vsort(v);
REP(i, n) { cout << get<2>(v[i]) << endl; }
return 0;
}
| [
"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 < num + 1; i++) {
for (j = 2; j < num + 1; j++) {
if (strcmp(moji[j - 1], moji[j]) > 0) {
strcpy(tmp, moji[j - 1]);
strcpy(moji[j - 1], moji[j]);
strcpy(moji[j], tmp);
test = score[j - 1];
score[j - 1] = score[j];
score[j] = test;
test = sort[j - 1];
sort[j - 1] = sort[j];
sort[j] = test;
} else if (strcmp(moji[j - 1], moji[j]) == 0) {
if (score[j - 1] < score[j]) {
strcpy(tmp, moji[j - 1]);
strcpy(moji[j - 1], moji[j]);
strcpy(moji[j], tmp);
test = score[j - 1];
score[j - 1] = score[j];
score[j] = test;
test = sort[j - 1];
sort[j - 1] = sort[j];
sort[j] = test;
}
}
}
}
for (i = 1; i < num + 1; i++) {
printf("%d\n", sort[i]);
}
return 0;
} | #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 < num + 1; i++) {
for (j = 2; j < num + 1; j++) {
if (strcmp(moji[j - 1], moji[j]) > 0) {
strcpy(tmp, moji[j - 1]);
strcpy(moji[j - 1], moji[j]);
strcpy(moji[j], tmp);
test = score[j - 1];
score[j - 1] = score[j];
score[j] = test;
test = sort[j - 1];
sort[j - 1] = sort[j];
sort[j] = test;
} else if (strcmp(moji[j - 1], moji[j]) == 0) {
if (score[j - 1] < score[j]) {
strcpy(tmp, moji[j - 1]);
strcpy(moji[j - 1], moji[j]);
strcpy(moji[j], tmp);
test = score[j - 1];
score[j - 1] = score[j];
score[j] = test;
test = sort[j - 1];
sort[j - 1] = sort[j];
sort[j] = test;
}
}
}
}
for (i = 1; i < num + 1; i++) {
printf("%d\n", sort[i]);
}
return 0;
} | [
"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 < num + 1; i++) {
for (j = 2; j < num + 1; j++) {
if (strcmp(moji[j - 1], moji[j]) > 0) {
strcpy(tmp, moji[j - 1]);
strcpy(moji[j - 1], moji[j]);
strcpy(moji[j], tmp);
test = score[j - 1];
score[j - 1] = score[j];
score[j] = test;
test = sort[j - 1];
sort[j - 1] = sort[j];
sort[j] = test;
} else if (strcmp(moji[j - 1], moji[j]) == 0) {
if (score[j - 1] < score[j]) {
strcpy(tmp, moji[j - 1]);
strcpy(moji[j - 1], moji[j]);
strcpy(moji[j], tmp);
test = score[j - 1];
score[j - 1] = score[j];
score[j] = test;
test = sort[j - 1];
sort[j - 1] = sort[j];
sort[j] = test;
}
}
}
}
for (i = 1; i < num + 1; i++)
printf("%d\n", sort[i]);
return 0;
} | #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 < num + 1; i++) {
for (j = 2; j < num + 1; j++) {
if (strcmp(moji[j - 1], moji[j]) > 0) {
strcpy(tmp, moji[j - 1]);
strcpy(moji[j - 1], moji[j]);
strcpy(moji[j], tmp);
test = score[j - 1];
score[j - 1] = score[j];
score[j] = test;
test = sort[j - 1];
sort[j - 1] = sort[j];
sort[j] = test;
} else if (strcmp(moji[j - 1], moji[j]) == 0) {
if (score[j - 1] < score[j]) {
strcpy(tmp, moji[j - 1]);
strcpy(moji[j - 1], moji[j]);
strcpy(moji[j], tmp);
test = score[j - 1];
score[j - 1] = score[j];
score[j] = test;
test = sort[j - 1];
sort[j - 1] = sort[j];
sort[j] = test;
}
}
}
}
for (i = 1; i < num + 1; i++) {
printf("%d\n", sort[i]);
}
return 0;
} | [
"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)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n)-1; i > 0; --i)
#define rrepeq(i, n) for (int i = (int)(n); i >= 0; --i)
#define rrep1eq(i, n) for (int i = (int)(n); i > 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template <typename T> using Graph = vector<vector<T>>;
template <typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T> struct is_pair : false_type {};
template <typename T1, typename T2> struct is_pair<pair<T1, T2>> : true_type {};
template <typename T> struct is_vector : false_type {};
template <typename T> struct is_vector<vector<T>> : true_type {};
template <typename T1, typename T2>
istream &operator>>(istream &istr, pair<T1, T2> &p) {
istr >> p.first >> p.second;
return istr;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &ostr, const pair<T1, T2> &p) {
ostr << p.first << " " << p.second;
return ostr;
}
template <typename T> istream &operator>>(istream &istr, vector<T> &vec) {
for (auto itr = vec.begin(); itr != vec.end(); ++itr) {
istr >> *itr;
}
return istr;
}
template <typename T> ostream &operator<<(ostream &ostr, const vector<T> &vec) {
if (vec.empty())
return ostr;
bool vp = is_vector<T>() || is_pair<T>();
ostr << vec.front();
for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) {
ostr << (vp ? "\n" : " ") << *itr;
}
return ostr;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
int modpow(int a, long long n, int mod = MOD) {
int ret = 1;
do {
if (n & 1)
ret = 1LL * ret * a % mod;
a = 1LL * a * a % mod;
} while (n >>= 1);
return ret;
}
template <typename T> T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template <typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }
template <typename T1, typename T2>
bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) {
return a.second != b.second ? a.second < b.second : a.first < b.first;
}
template <typename T> bool CompareBySlope(pair<T, T> a, pair<T, T> b) {
// counterclockwise from 12 o'clock direction
if (a.first * b.first < 0)
return a.first < b.first;
if (a.first == 0)
return a.second >= 0 || b.first > 0;
if (b.first == 0)
return b.second < 0 && a.first < 0;
return a.second * b.first < a.first * b.second;
}
/* -------- <templates end> -------- */
#define pspii pair<string, pii>
bool mycomp(pspii a, pspii b) {
return a.first != b.first ? a.first < b.first
: a.second.first > b.second.first;
}
void solve() {
int n;
cin >> n;
vector<pspii> arr(n);
rep1eq(i, n) {
cin >> arr[i].first >> arr[i].second.first;
arr[i].second.second = i;
}
sort(ALL(arr), mycomp);
rep(i, n) cout << arr[i].second.second << "\n";
}
/* -------- <programs end> -------- */
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
solve();
return 0;
}
| #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)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rrep1(i, n) for (int i = (int)(n)-1; i > 0; --i)
#define rrepeq(i, n) for (int i = (int)(n); i >= 0; --i)
#define rrep1eq(i, n) for (int i = (int)(n); i > 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
template <typename T> using Graph = vector<vector<T>>;
template <typename T> using Spacial = vector<vector<vector<T>>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int MOD = 1e9 + 7;
const int MOD2 = 998244353;
const double EPS = 1e-9;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <typename T> struct is_pair : false_type {};
template <typename T1, typename T2> struct is_pair<pair<T1, T2>> : true_type {};
template <typename T> struct is_vector : false_type {};
template <typename T> struct is_vector<vector<T>> : true_type {};
template <typename T1, typename T2>
istream &operator>>(istream &istr, pair<T1, T2> &p) {
istr >> p.first >> p.second;
return istr;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &ostr, const pair<T1, T2> &p) {
ostr << p.first << " " << p.second;
return ostr;
}
template <typename T> istream &operator>>(istream &istr, vector<T> &vec) {
for (auto itr = vec.begin(); itr != vec.end(); ++itr) {
istr >> *itr;
}
return istr;
}
template <typename T> ostream &operator<<(ostream &ostr, const vector<T> &vec) {
if (vec.empty())
return ostr;
bool vp = is_vector<T>() || is_pair<T>();
ostr << vec.front();
for (auto itr = ++vec.begin(); itr != vec.end(); ++itr) {
ostr << (vp ? "\n" : " ") << *itr;
}
return ostr;
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
int modpow(int a, long long n, int mod = MOD) {
int ret = 1;
do {
if (n & 1)
ret = 1LL * ret * a % mod;
a = 1LL * a * a % mod;
} while (n >>= 1);
return ret;
}
template <typename T> T GCD(T a, T b) { return b ? GCD(b, a % b) : a; }
template <typename T> T LCM(T a, T b) { return a / GCD(a, b) * b; }
template <typename T1, typename T2>
bool CompareBySecond(pair<T1, T2> a, pair<T1, T2> b) {
return a.second != b.second ? a.second < b.second : a.first < b.first;
}
template <typename T> bool CompareBySlope(pair<T, T> a, pair<T, T> b) {
// counterclockwise from 12 o'clock direction
if (a.first * b.first < 0)
return a.first < b.first;
if (a.first == 0)
return a.second >= 0 || b.first > 0;
if (b.first == 0)
return b.second < 0 && a.first < 0;
return a.second * b.first < a.first * b.second;
}
/* -------- <templates end> -------- */
#define pspii pair<string, pii>
bool mycomp(pspii a, pspii b) {
return a.first != b.first ? a.first < b.first
: a.second.first > b.second.first;
}
void solve() {
int n;
cin >> n;
vector<pspii> arr(n);
rep(i, n) {
cin >> arr[i].first >> arr[i].second.first;
arr[i].second.second = i + 1;
}
sort(ALL(arr), mycomp);
rep(i, n) cout << arr[i].second.second << "\n";
}
/* -------- <programs end> -------- */
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
solve();
return 0;
}
| [
"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;
int p, id;
tie(s, p, id) = a[i];
cout << id << endl;
}
return 0;
} | #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, id;
tie(s, p, id) = a[i];
cout << id << endl;
}
return 0;
} | [
"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);
string S;
ll P;
for (i = 0; i < N; i++) {
cin >> S >> P;
v.push_back(make_pair(make_pair(S, -P), i + 1));
}
sort(v.begin(), v.end());
for (auto itr = v.begin(); itr != v.end(); ++itr) {
cout << itr->second << endl;
}
return 0;
} | #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;
string S;
ll P;
for (i = 0; i < N; i++) {
cin >> S >> P;
v.push_back(make_pair(make_pair(S, -P), i + 1));
}
sort(v.begin(), v.end());
for (auto itr = v.begin(); itr != v.end(); ++itr) {
cout << itr->second << endl;
}
return 0;
} | [] | 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++) {
cout << m[i].second + 1 << endl;
}
}
| #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++) {
cout << m[i].second + 1 << endl;
}
}
| [
"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 cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll a, b, n;
string s;
in(n);
vector<pair<pair<string, ll>, ll>> c(n);
rep(i, n) {
in2(s, a);
c[i].first.first = s;
c[i].first.second = 100 - a;
c[i].second = i + 1;
}
sort(all(c));
rep(i, n) out(c[i].second);
memi;
} | #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 cout << ' '
#define in(n) cin >> n
#define in2(n, m) cin >> n >> m
#define in3(n, m, l) cin >> n >> m >> l
#define out(n) cout << n
const ll mei = (ll)1e9 + 7;
int main() {
ll a, b, n;
string s;
in(n);
vector<pair<pair<string, ll>, ll>> c(n);
rep(i, n) {
in2(s, a);
c[i].first.first = s;
c[i].first.second = 100 - a;
c[i].second = i + 1;
}
sort(all(c));
rep(i, n) {
out(c[i].second);
memi;
}
}
| [] | 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_pair(make_pair(in, -t), i);
}
sort(p, p + n);
rep(i, 0, n) cout << p[i].second + 1 << endl;
}
| #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] = make_pair(make_pair(in, -t), i);
}
sort(p, p + n);
rep(i, 0, n) cout << p[i].second + 1 << endl;
}
| [
"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).first = S;
restaurants_copy.at(i).second = P;
}
sort(restaurants.begin(), restaurants.end());
for (int i = 0; i < N; i++) {
restaurants.at(i).second = 100 - restaurants.at(i).second;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (restaurants.at(j) == restaurants_copy.at(i)) {
cout << j + 1 << endl;
}
}
}
}
| #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).first = S;
restaurants_copy.at(i).second = P;
}
sort(restaurants.begin(), restaurants.end());
for (int i = 0; i < N; i++) {
restaurants.at(i).second = 100 - restaurants.at(i).second;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (restaurants.at(i) == restaurants_copy.at(j)) {
cout << j + 1 << endl;
}
}
}
}
| [
"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 >> N;
vector<pair<string, int>> p(N), q(N);
for (auto i = 0; i < N; i++) {
cin >> p[i].first >> p[i].second;
q[i] = p[i];
}
// cout << endl;
sort(p.begin(), p.end(), cmp);
/*
for (auto i = 0; i < N; i++) {
cout << p[i].first << p[i].second << endl;;
}
*/
for (auto i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (q[i] == p[j]) {
cout << j + 1 << endl;
break;
}
}
}
}
| #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 >> N;
vector<pair<string, int>> p(N), q(N);
for (auto i = 0; i < N; i++) {
cin >> p[i].first >> p[i].second;
q[i] = p[i];
}
sort(p.begin(), p.end(), cmp);
for (auto i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (p[i] == q[j]) {
cout << j + 1 << endl;
break;
}
}
}
} | [
"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.begin(), v.end())
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
char in[120];
pair<pair<string, int>, int> p[110];
int a;
for (int i = 0; i < a; i++) {
int t;
cin >> in >> t;
string tmp = in;
p[i] = make_pair(make_pair(in, -t), i);
}
sort(p, p + a);
for (int i = 0; i < a; i++) {
cout << p[i].second + 1 << endl;
}
return 0;
} | #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.begin(), v.end())
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
char in[120];
pair<pair<string, int>, int> p[110];
int a;
cin >> a;
for (int i = 0; i < a; i++) {
int t;
cin >> in >> t;
string tmp = in;
p[i] = make_pair(make_pair(in, -t), i);
}
sort(p, p + a);
for (int i = 0; i < a; i++) {
cout << p[i].second + 1 << endl;
}
return 0;
} | [] | 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 = 0; i < n; i++) {
cout << get<2>(v[i]) + 1 << endl;
}
} | #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 = 0; i < n; i++) {
cout << get<2>(v[i]) + 1 << endl;
}
} | [
"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 (int i = 0; i < N; i++)
cout << get<2>(vec.at(i)) << endl;
}
| #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());
for (int i = 0; i < N; i++)
cout << get<2>(vec.at(i)) << endl;
}
| [
"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;
cin >> s >> point;
restaurant[i] = make_pair(make_pair(s, point), i + 1);
}
sort(restaurant.begin(), restaurant.end());
for (int i = 0; i < N; ++i) {
cout << restaurant[i].second << "\n";
}
} | #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;
cin >> s >> point;
restaurant[i] = make_pair(make_pair(s, -point), i + 1);
}
sort(restaurant.begin(), restaurant.end());
for (int i = 0; i < N; ++i) {
cout << restaurant[i].second << "\n";
}
} | [
"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>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#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>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
//ここまで毎回include
//以下プログラム
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> data(n);
for (int i = 0; i < n; i++) {
string S;
int I;
cin >> S >> I;
data.at(i) = make_pair(make_pair(S, i), I);
}
sort(data.begin(), data.end());
for (int i = 0; i < n; i++) {
cout << data.at(i).first.second + 1 << endl;
}
}
| // 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>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#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>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
//ここまで毎回include
//以下プログラム
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> data(n);
for (int i = 0; i < n; i++) {
string S;
int I;
cin >> S >> I;
data.at(i) = make_pair(make_pair(S, 100 - I), i);
}
sort(data.begin(), data.end());
for (int i = 0; i < n; i++) {
cout << data.at(i).second + 1 << endl;
}
}
| [
"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>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#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>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
//ここまで毎回include
//以下プログラム
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> data(n);
for (int i = 0; i < n; i++) {
string S;
int I;
cin >> S >> I;
data.at(i) = make_pair(make_pair(S, I), i);
}
sort(data.begin(), data.end());
for (int i = 0; i < n; i++) {
cout << data.at(i).second + 1 << endl;
}
}
| // 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>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#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>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
//ここまで毎回include
//以下プログラム
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> data(n);
for (int i = 0; i < n; i++) {
string S;
int I;
cin >> S >> I;
data.at(i) = make_pair(make_pair(S, 100 - I), i);
}
sort(data.begin(), data.end());
for (int i = 0; i < n; i++) {
cout << data.at(i).second + 1 << endl;
}
}
| [
"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 < n; i++)
v[i].prank = i;
np = v;
sort(v.begin(), v.end(), cmp);
for (int i = 0; i < n; i++)
np[v[i].prank].rank = i;
for (auto i : np)
cout << i.rank + 1 << "\n";
return 0;
} | #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 < n; i++)
v[i].prank = i;
np = v;
sort(v.begin(), v.end(), cmp);
for (int i = 0; i < n; i++)
np[v[i].prank].rank = i;
for (auto i : v)
cout << i.prank + 1 << "\n";
return 0;
}
| [
"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++) {
cout << List[i].second << endl;
}
} | #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++) {
cout << List[i].second << endl;
}
} | [
"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++) {
cout << List[i].second << endl;
}
} | #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++) {
cout << List[i].second << endl;
}
} | [
"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;
tie(ignore, ignore, id) = p.at(i);
cout << id << endl;
}
} | #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;
tie(ignore, ignore, id) = p.at(i);
cout << id << endl;
}
} | [
"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);
// int k=finder.size();
for (int z = 0; z < t; z++) {
cout << finder[z].second + 1 << "\n";
}
return 0;
} | #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);
// int k=finder.size();
for (int z = 0; z < t; z++) {
cout << finder[z].second + 1 << "\n";
}
return 0;
} | [
"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;
auto solve1 = [&] {
vector<tuple<int, string, int>> res(n);
for (int i = 0; i < n; ++i) {
string s;
int p;
cin >> s >> p;
res[i] = make_tuple(i + 1, s, p);
}
sort(res.begin(), res.end(), compare);
for (int i = 0; i < n; ++i) {
cout << get<0>(res[i]) << endl;
}
};
auto solve2 = [&] {
vector<pair<pair<string, int>, int>> res(n);
for (int i = 0; i < n; ++i) {
string s;
int p;
cin >> s >> p;
res[i] = make_pair(make_pair(s, p), i + 1);
}
sort(res.begin(), res.end());
for (int i = 0; i < n; ++i) {
cout << res[i].second << endl;
}
};
solve2();
return 0;
}
| #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;
auto solve1 = [&] {
vector<tuple<int, string, int>> res(n);
for (int i = 0; i < n; ++i) {
string s;
int p;
cin >> s >> p;
res[i] = make_tuple(i + 1, s, p);
}
sort(res.begin(), res.end(), compare);
for (int i = 0; i < n; ++i) {
cout << get<0>(res[i]) << endl;
}
};
auto solve2 = [&] {
vector<pair<pair<string, int>, int>> res(n);
for (int i = 0; i < n; ++i) {
string s;
int p;
cin >> s >> p;
res[i] = make_pair(make_pair(s, p * -1), i + 1);
}
sort(res.begin(), res.end());
for (int i = 0; i < n; ++i) {
cout << res[i].second << endl;
}
};
solve2();
return 0;
}
| [
"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 (int i = 0; i < n; i++) {
cout << get<2>(v[i]) << endl;
}
return 0;
}
| #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());
for (int i = 0; i < n; i++) {
cout << get<2>(v[i]) << endl;
}
return 0;
}
| [
"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 = long long;
using lli = long long int;
using pii = pair<int, int>;
int main() {
int N, b;
string s;
cin >> N;
pair<pair<string, int>, int> a[110];
rep(i, N) {
cin >> s >> b;
a[i] = make_pair(make_pair(s, -b), i + 1);
}
sort(a, a + N);
rep(i, N) { cout << a[i].second; }
} | #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 = long long;
using lli = long long int;
using pii = pair<int, int>;
int main() {
int N, b;
string s;
cin >> N;
pair<pair<string, int>, int> a[110];
rep(i, N) {
cin >> s >> b;
a[i] = make_pair(make_pair(s, -b), i + 1);
}
sort(a, a + N);
rep(i, N) { cout << a[i].second << endl; }
} | [
"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 ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> r(n);
rep(i, n) {
string s;
int p;
cin >> s >> p;
r[i].first.first = s;
r[i].first.second = p;
r[i].second = i + 1;
}
sort(r.begin(), r.end());
rep(i, n) { cout << r[i].second << endl; }
return 0;
}
| #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 ll;
using namespace std;
int main() {
int n;
cin >> n;
vector<pair<pair<string, int>, int>> r(n);
rep(i, n) {
string s;
int p;
cin >> s >> p;
r[i].first.first = s;
r[i].first.second = -p;
r[i].second = i + 1;
}
sort(r.begin(), r.end());
rep(i, n) { cout << r[i].second << endl; }
return 0;
}
| [
"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 = 0; k < j; k++) {
if (s[j] < s[k] || (s[j] == s[k] && p[j] > p[k])) {
q1 = p[j];
p[j] = p[k];
p[k] = q1;
q2 = s[j];
s[j] = s[k];
s[k] = q2;
q1 = t[j];
t[j] = t[k];
t[k] = q1;
}
}
}
}
for (i = 0; i < n; i++) {
cout << t[i] << endl;
}
} | #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++) {
for (k = 0; k < j; k++) {
if (s[j] < s[k] || (s[j] == s[k] && p[j] > p[k])) {
q1 = p[j];
p[j] = p[k];
p[k] = q1;
q2 = s[j];
s[j] = s[k];
s[k] = q2;
q1 = t[j];
t[j] = t[k];
t[k] = q1;
}
}
}
}
for (i = 0; i < n; i++) {
cout << t[i] << endl;
}
} | [] | 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) \
int a; \
int b; \
cin >> a >> b;
#define inputInt3(a, b, c) \
int a; \
int b; \
int c; \
cin >> a >> b >> c;
#define inputLong(a) \
long a; \
cin >> a;
#define inputIntArray(a, N) \
int a[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i]; \
}
#define inputLongArray(a, N) \
long a[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i]; \
}
#define inputIntArray2(a, b, N) \
int a[N]; \
int b[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i] >> b[i]; \
}
#define output(answer) cout << answer << endl;
#define fN(i, N) for (int i = 0; i < N; i++)
#define fSE(i, s, e) for (int i = s; i <= e; i++)
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define FOR(i, N) for (int i = 0; i < N; i++)
#define cinv(v, N) \
vector<int> v(N); \
for (int i = 0; i < N; i++) { \
cin >> v[i]; \
}
const ll MOD2 = 998244353;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
bool comp(const tuple<int, string, int> &a, const tuple<int, string, int> &b) {
if (get<1>(a) != get<1>(b)) {
return get<1>(a) < get<1>(b);
} else {
return get<2>(a) > get<2>(b);
}
}
int main() {
// input
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<tuple<int, string, int>> v(N);
for (int i = 0; i < N; i++) {
string s;
int p;
cin >> s >> p;
v[i] = mt(i, s, p);
}
// main
sort(v.begin(), v.end(), comp);
// output
for (int i = 0; i < N; i++) {
cout << get<0>(v[i]) << endl;
}
return 0;
} | #include <bits/stdc++.h>
#include <stdio.h>
using namespace std;
#define inputInt(a) \
int a; \
cin >> a;
#define inputInt2(a, b) \
int a; \
int b; \
cin >> a >> b;
#define inputInt3(a, b, c) \
int a; \
int b; \
int c; \
cin >> a >> b >> c;
#define inputLong(a) \
long a; \
cin >> a;
#define inputIntArray(a, N) \
int a[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i]; \
}
#define inputLongArray(a, N) \
long a[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i]; \
}
#define inputIntArray2(a, b, N) \
int a[N]; \
int b[N]; \
for (int i = 0; i < N; i++) { \
cin >> a[i] >> b[i]; \
}
#define output(answer) cout << answer << endl;
#define fN(i, N) for (int i = 0; i < N; i++)
#define fSE(i, s, e) for (int i = s; i <= e; i++)
#define ll long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define FOR(i, N) for (int i = 0; i < N; i++)
#define cinv(v, N) \
vector<int> v(N); \
for (int i = 0; i < N; i++) { \
cin >> v[i]; \
}
const ll MOD2 = 998244353;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
bool comp(const tuple<int, string, int> &a, const tuple<int, string, int> &b) {
if (get<1>(a) != get<1>(b)) {
return get<1>(a) < get<1>(b);
} else {
return get<2>(a) > get<2>(b);
}
}
int main() {
// input
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<tuple<int, string, int>> v(N);
for (int i = 0; i < N; i++) {
string s;
int p;
cin >> s >> p;
v[i] = mt(i, s, p);
}
// main
sort(v.begin(), v.end(), comp);
// output
for (int i = 0; i < N; i++) {
cout << get<0>(v[i]) + 1 << endl;
}
return 0;
} | [
"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 x;
int y, z;
tie(x, y, z) = t;
cout << z << endl;
}
}
| #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) {
string x;
int y, z;
tie(x, y, z) = t;
cout << z << endl;
}
}
| [
"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 chmin(x, y) \
if (x > y) \
x = y
#define chmax(x, y) \
if (x < y) \
x = y
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef tuple<ll, ll, ll, ll> PPP;
typedef priority_queue<ll> PQ;
typedef priority_queue<ll, vector<ll>, greater<ll>> SPQ;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const ll inf = 100100100100;
const int Inf = 1001001001;
const int mod = 1000000007;
const double pi = 3.141592653589793;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> v;
rep(i, n) {
string s;
int a;
cin >> s >> a;
v.eb(s, a, i + 1);
}
sort(all(v));
rep(i, n) { cout << get<2>(v[i]) << endl; }
}
| #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 chmin(x, y) \
if (x > y) \
x = y
#define chmax(x, y) \
if (x < y) \
x = y
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> PP;
typedef tuple<ll, ll, ll, ll> PPP;
typedef priority_queue<ll> PQ;
typedef priority_queue<ll, vector<ll>, greater<ll>> SPQ;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const ll inf = 100100100100;
const int Inf = 1001001001;
const int mod = 1000000007;
const double pi = 3.141592653589793;
int main() {
int n;
cin >> n;
vector<tuple<string, int, int>> v;
rep(i, n) {
string s;
int a;
cin >> s >> a;
v.eb(s, -a, i + 1);
}
sort(all(v));
rep(i, n) { cout << get<2>(v[i]) << endl; }
}
| [
"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 rbuf;
int p;
cin >> rbuf >> p;
res.at(i) = make_tuple(rbuf, p, i);
}
sort(res.begin(), res.end());
rep(i, N) {
int rnum;
tie(ignore, ignore, rnum) = res.at(i);
cout << rnum + 1 << endl;
}
return 0;
}
| #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 rbuf;
int p;
cin >> rbuf >> p;
res.at(i) = make_tuple(rbuf, -p, i);
}
sort(res.begin(), res.end());
rep(i, N) {
int rnum;
tie(ignore, ignore, rnum) = res.at(i);
cout << rnum + 1 << endl;
}
return 0;
}
| [
"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_pair(t_name, -po), i);
}
sort(SP.begin(), SP.end());
for (int i = 0; i < N; i++) {
std::cout << SP[i].second << std::endl;
}
} | #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_pair(t_name, -po), i);
}
sort(SP.begin(), SP.end());
for (int i = 0; i < N; i++) {
std::cout << SP[i].second + 1 << std::endl;
}
} | [
"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 << endl;
}
return 0;
} | #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 << endl;
}
return 0;
} | [
"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 << endl;
}
return 0;
} | #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 << endl;
}
return 0;
} | [
"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_back(a)
#define int(a) stoi(a)
#define str(a) to_string(a)
#define bisect_left(vector, a) lower_bound(vector.begin(), vector.end(), a)
#define bisect_right(vector, a) upper_bound(vector.begin(), vector.end(), a)
bool lambda0(const vector<long long> &v1, const vector<long long> &v2) {
return v1[0] < v2[0];
}
int main(void) {
int n, p;
cin >> n;
string town;
vector<pair<pair<string, int>, int>> sp;
for (int i = 0; i < n; i++) {
cin >> town >> p;
sp.push_back(pair<pair<string, int>, int>{{town, p}, i});
}
sort(sp.begin(), sp.begin() + n);
for (int i = 0; i < n; i++) {
cout << sp[i].second + 1 << endl;
}
} | #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_back(a)
#define int(a) stoi(a)
#define str(a) to_string(a)
#define bisect_left(vector, a) lower_bound(vector.begin(), vector.end(), a)
#define bisect_right(vector, a) upper_bound(vector.begin(), vector.end(), a)
bool lambda0(const vector<long long> &v1, const vector<long long> &v2) {
return v1[0] < v2[0];
}
int main(void) {
int n, p;
cin >> n;
string town;
vector<pair<pair<string, int>, int>> sp;
for (int i = 0; i < n; i++) {
cin >> town >> p;
sp.push_back(pair<pair<string, int>, int>{{town, -p}, i});
}
sort(sp.begin(), sp.begin() + n);
for (int i = 0; i < n; i++) {
cout << sp[i].second + 1 << endl;
}
} | [
"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()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
//#define min min<int>
//#define max max<int>
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
int gcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return f;
}*/
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
int gcm(int a, int b) {
if (b == 0)
return a;
return gcm(b, a % b);
}
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
signed main() {
int a;
cin >> a;
V<P<string, P<int, int>>> b(a);
fo(i, a) {
cin >> b[i].fi >> b[i].se.fi;
b[i].se.se = i;
b[i].se.fi = 100 - b[i].se.fi;
}
V<int> c(a);
Sort(b);
fo(i, a) { cout << b[i].se.se << endl; }
} | #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()
#define pb(a) push_back(a)
#define pp() pop_back()
#define V vector
#define P pair
#define V2(a, b, c) V<V<int>> a(b, V<int>(c))
#define V2a(a, b, c, d) V<V<int>> a(b, V<int>(c, d))
#define incin(a) \
int a; \
cin >> a
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
//#define min min<int>
//#define max max<int>
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
/*template<>
void cou(vector<vector<char>> a){
int b=a.size();
int c=a[0].size();
fo(i,b){
fo(j,c){
cout<<a[i][j];
if(j==c-1)
cout<<endl;
else
cout<<' ';
}
}
}*/
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
/*int lcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return d*e/f;
}
int gcm(int a,int b){
int d=a,e=b,f;
if(a<b)
swap(a,b);
int c,m=1;
while(m){
c=a%b;
if(c==0){
f=b;
m--;
}
else{
a=b;
b=c;
}
}
return f;
}*/
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
double b = sqrt(a);
for (int i = 3; i <= b; i += 2) {
if (a % i == 0) {
return false;
}
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
int gcm(int a, int b) {
if (b == 0)
return a;
return gcm(b, a % b);
}
int lcm(int a, int b) { return a / gcm(a, b) * b; }
/*struct aa{
vector<int> gt;
aa(int n){
gt= vector<int>(n, 1);
}
void c(V<int> d,int b){
if(d[b]==0){
gt[d[b]-1]++;
gt[gt.sz-1]++;
}
else{
gt[d[b]-1]++;
c(d,d[d[b]]-1);
}
}
void cok(int a){
cout<<gt[a-1]<<endl;
fo(i,a-1)
cout<<gt[i]<<endl;
}
};
*/
/*struct dfs(){
}*/
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
signed main() {
int a;
cin >> a;
V<P<string, P<int, int>>> b(a);
fo(i, a) {
cin >> b[i].fi >> b[i].se.fi;
b[i].se.se = i;
b[i].se.fi = 100 - b[i].se.fi;
}
V<int> c(a);
Sort(b);
fo(i, a) { cout << b[i].se.se + 1 << endl; }
} | [
"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_back(tie(s, x, i)); // tieで一気に突っ込めるっぽい？
}
sort(a.begin(), a.end());
for (int i = 1; i <= n; i++) {
cout << get<2>(a[i])
<< endl; // get<2> はstring int int の0,1,２の2番目を呼び出すため物
}
return 0;
}
| #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_back(tie(s, x, i)); // tieで一気に突っ込めるっぽい？
}
sort(a.begin(), a.end());
for (int i = 0; i < n; i++) {
cout << get<2>(a[i])
<< endl; // get<2> はstring int int の0,1,２の2番目を呼び出すため物
}
return 0;
}
| [
"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].second << endl;
} | #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].second + 1 << endl;
} | [
"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);
REP(i, n) cout << p[i].second << endl;
} | #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);
REP(i, n) cout << p[i].second << endl;
} | [
"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番目の要素にインデックスの代わりを入れる
}
//市名順にソート
sort(
v.begin(), v.end(),
[](const tuple<string, int, int> &t1, const tuple<string, int, int> &t2) {
if (get<0>(t1) != get<0>(t2)) {
return get<0>(t1) < get<0>(t2);
} else {
get<1>(t1) > get<1>(t2);
}
});
//ソートしたものを出力
for (tuple<string, int, int> i : v) {
string s;
int x = 0, y = 0;
tie(s, x, y) = i;
// cout << s << " " << x << " " << y << endl;
// //入っている要素を確かめるためのcout
cout << y << endl;
}
}
| #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番目の要素にインデックスの代わりを入れる
}
//市名順にソート
sort(
v.begin(), v.end(),
[](const tuple<string, int, int> &t1, const tuple<string, int, int> &t2) {
if (get<0>(t1) != get<0>(t2)) {
return get<0>(t1) < get<0>(t2);
} else {
return get<1>(t1) > get<1>(t2);
}
});
//ソートしたものを出力
for (tuple<string, int, int> i : v) {
string s;
int x = 0, y = 0;
tie(s, x, y) = i;
// cout << s << " " << x << " " << y << endl;
// //入っている要素を確かめるためのcout
cout << y << endl;
}
}
| [
"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.end());
for (int i = 0; i < N; i++) {
cout << get<2>(data.at(i)) << endl;
}
} | #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(), data.end());
for (int i = 0; i < N; i++) {
cout << get<2>(data.at(i)) << endl;
}
} | [
"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
#define pq priority_queue
#define ipair pair<int, int>
#define spair pair<string, string>
#define lpair pair<LL, LL>
#define MP make_pair
#define INF 2147483647
#define _INF -2147483647
#define MM multimap
#define PB push_back
#define MAXN 100004
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
pair<pair<string, int>, int> p[110];
rep(i, 0, N) {
string a;
int b;
cin >> a >> b;
p[i] = MP(MP(a, b), i);
}
sort(p, p + N);
rep(i, 0, N) { cout << p[i].ss + 1 << endl; }
return 0;
} | #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
#define pq priority_queue
#define ipair pair<int, int>
#define spair pair<string, string>
#define lpair pair<LL, LL>
#define MP make_pair
#define INF 2147483647
#define _INF -2147483647
#define MM multimap
#define PB push_back
#define MAXN 100004
using namespace std;
typedef long long ll;
int main() {
int N;
cin >> N;
pair<pair<string, int>, int> p[110];
rep(i, 0, N) {
string a;
int b;
cin >> a >> b;
p[i] = MP(MP(a, -b), i); // 点数が高い順にするため
} // -1倍を入れる
sort(p, p + N);
rep(i, 0, N) { cout << p[i].ss + 1 << endl; }
return 0;
} | [
"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 = 0; i < N; i++) {
cout << p[i].second << endl;
}
return 0;
} | #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 i = 0; i < N; i++) {
cout << p[i].second << endl;
}
return 0;
} | [
"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 = 0; i < N; i++) {
cout << p[i].second << endl;
}
return 0;
} | #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 i = 0; i < N; i++) {
cout << p[i].second << endl;
}
return 0;
} | [
"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;
int p;
int id;
tie(s, p, id) = a[i];
cout << id << endl;
}
return 0;
} | #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;
int p;
int id;
tie(s, p, id) = a[i];
cout << id << endl;
}
return 0;
} | [
"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.at(i).second;
}
sort(data.begin(), data.end());
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (sub.at(i).first == sub.at(j).first &&
sub.at(i).second == sub.at(j).second) {
cout << j + 1 << endl;
break;
}
}
}
return 0;
} | #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.at(i).second;
}
sort(data.begin(), data.end());
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
if (data.at(i).first == sub.at(j).first &&
data.at(i).second == sub.at(j).second) {
cout << j + 1 << endl;
break;
}
}
}
return 0;
}
| [
"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<unsigned int> vec;
typedef vector<vec> mat;
typedef vector<vector<int>> Graph;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const ll MOD = 1000000007;
const double PI = acos(-1.0);
const double EPS = 1e-10;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> S(N), P(N);
REP(i, N) cin >> S[i] >> P[i];
vector<int> idx(N);
iota(idx.begin(), idx.end(), 0);
sort(idx.begin(), idx.end(),
[&](int x, int y) { return S[x] == S[y] ? P[x] > P[y] : S[x] < S[y]; });
REP(i, N) cout << idx[i] + 1 << endl;
}
| #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<unsigned int> vec;
typedef vector<vec> mat;
typedef vector<vector<int>> Graph;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000; // 1e18
const ll MOD = 1000000007;
const double PI = acos(-1.0);
const double EPS = 1e-10;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline void add(T &a, T b) {
a = ((a + b) % MOD + MOD) % MOD;
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
vector<string> S(N);
vector<int> P(N);
REP(i, N) cin >> S[i] >> P[i];
vector<int> idx(N);
iota(idx.begin(), idx.end(), 0);
sort(idx.begin(), idx.end(),
[&](int x, int y) { return S[x] == S[y] ? P[x] > P[y] : S[x] < S[y]; });
REP(i, N) cout << idx[i] + 1 << endl;
}
| [] | 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];
sort(vt.begin(), vt.end());
for (int i = 0; i < n; i++) {
cout << get<2>(vt.at(i)) << endl;
}
}
| #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.at(i) = t[i];
sort(vt.begin(), vt.end());
for (int i = 0; i < n; i++) {
cout << get<2>(vt.at(i)) << endl;
}
}
| [
"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).second = i;
}
sort(rank.begin(), rank.end());
for (int i = 0; i < N; i++) {
cout << rank.at(i).second << endl;
}
}
| #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).second = i + 1;
}
sort(rank.begin(), rank.end());
for (int i = 0; i < N; i++) {
cout << rank.at(i).second << endl;
}
} | [
"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, int, int> x : AAA) {
int i;
tie(ignore, ignore, i) = x;
cout << i << endl;
}
} | #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, int> x : AAA) {
int i;
tie(ignore, ignore, i) = x;
cout << i << endl;
}
} | [] | 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;
}
for (int i = 0; i < N; i++)
for (int j = i + 1; j < N; j++) {
if (s[i].compare(s[j]) == 1) {
swap(s[i], s[j]);
swap(p[i], p[j]);
swap(a[i], a[j]);
} else if (s[i].compare(s[j]) == 0) {
if (p[i] < p[j]) {
swap(p[i], p[j]);
swap(a[i], a[j]);
}
}
}
for (int i = 0; i < N; i++) {
cout << a[i] << endl;
}
} | #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;
}
for (int i = 0; i < N; i++)
for (int j = i + 1; j < N; j++) {
if (s[i].compare(s[j]) > 0) {
swap(s[i], s[j]);
swap(p[i], p[j]);
swap(a[i], a[j]);
} else if (s[i].compare(s[j]) == 0) {
if (p[i] < p[j]) {
swap(p[i], p[j]);
swap(a[i], a[j]);
}
}
}
for (int i = 0; i < N; i++) {
cout << a[i] << endl;
}
} | [
"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){return
// x.first < y.first;});
sort(begin(SP), end(SP));
for (int i = 0; i < N; i++) {
cout << get<2>(SP[i]) << endl;
}
return 0;
}
| #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){return
// x.first < y.first;});
sort(begin(SP), end(SP));
for (int i = 0; i < N; i++) {
cout << get<2>(SP[i]) << endl;
}
return 0;
}
| [
"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());
for (int i = 0; i < N; i++) {
int a;
tie(ignore, ignore, a) = v[i];
cout << a << endl;
}
} | #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());
for (int i = 0; i < N; i++) {
int a;
tie(ignore, ignore, a) = v[i];
cout << a << endl;
}
} | [
"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);
for (int i = 0; i < n; i++)
cout << a[i].second << endl;
return 0;
} | #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);
for (int i = 0; i < n; i++)
cout << a[i].second << endl;
return 0;
} | [
"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 (int i = 0; i < n; i++)
cout << a[i].second << endl;
return 0;
} | #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);
for (int i = 0; i < n; i++)
cout << a[i].second << endl;
return 0;
} | [
"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>> rec;
string name;
int rate;
for (int i = 0; i < n; ++i) {
cin >> name >> rate;
rec.push_back({{name, rate}, i + 1});
}
sort(rec.begin(), rec.end(), cmp);
for (int i = 0; i < n; ++i) {
cout << rec[i].second << endl;
}
return 0;
}
| #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>> rec;
string name;
int rate;
for (int i = 0; i < n; ++i) {
cin >> name >> rate;
rec.push_back({{name, rate}, i + 1});
}
sort(rec.begin(), rec.end(), cmp);
for (int i = 0; i < n; ++i) {
cout << rec[i].second << endl;
}
return 0;
}
| [
"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>> rec;
string name;
int rate;
for (int i = 0; i < n; ++i) {
cin >> name >> rate;
rec.push_back({{name, rate}, i + 1});
}
sort(rec.begin(), rec.end(), cmp);
for (int i = 0; i < n; ++i) {
cout << rec[i].second;
}
return 0;
}
| #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>> rec;
string name;
int rate;
for (int i = 0; i < n; ++i) {
cin >> name >> rate;
rec.push_back({{name, rate}, i + 1});
}
sort(rec.begin(), rec.end(), cmp);
for (int i = 0; i < n; ++i) {
cout << rec[i].second << endl;
}
return 0;
}
| [
"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;
int p;
int id;
tie(s, p, id) = x[i];
cout << id << endl;
}
} | #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;
int p;
int id;
tie(s, p, id) = x[i];
cout << id << endl;
}
} | [] | 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 (int i = 0; i < N; i++)
cout << get<2>(a.at(i)) << endl;
} | #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());
for (int i = 0; i < N; i++)
cout << get<2>(a.at(i)) << endl;
}
| [
"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; i < a; i++) {
cin >> pl >> t;
p[i] = make_pair(make_pair(pl, -t), i);
}
sort(p, p + a);
for (int i = 0; i < a; i++) {
cout << p[i].second + 1;
}
} | #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), i);
}
sort(p, p + a);
for (int i = 0; i < a; i++) {
cout << p[i].second + 1 << endl;
}
} | [
"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の中に構造体(型) 宣言時にサイズは指定しておく
for (int i = 0; i < N; i++) {
d[i].ex_pos = i;
cin >> d[i].name >> d[i].point;
}
sort(d.begin(), d.end(), [](const Data &x, const Data &y) {
if (x.name == y.name) {
return x.point < y.point;
}
return x.name < y.name;
});
//(始点,終点, )
// cout << d;
for (int j = 0; j < N; j++) {
cout << d[j].ex_pos + 1;
}
;
return 0;
} | #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の中に構造体(型) 宣言時にサイズは指定しておく
for (int i = 0; i < N; i++) {
d[i].ex_pos = i;
cin >> d[i].name >> d[i].point;
}
sort(d.begin(), d.end(), [](const Data &x, const Data &y) {
if (x.name == y.name) {
return x.point > y.point;
}
return x.name < y.name;
});
//(始点,終点, )
// cout << d;
for (int j = 0; j < N; j++) {
cout << d[j].ex_pos + 1 << endl;
}
;
return 0;
}
| [
"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++)
printf("%d\n", p[i].second + 1);
} | #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; i++)
printf("%d\n", p[i].second + 1);
} | [
"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++)
printf("%d\n", p[i].second + 1);
}
| #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; i++)
printf("%d\n", p[i].second + 1);
} | [
"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]);
cout << a + 1 << endl;
}
} | #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]);
cout << a + 1 << endl;
}
} | [
"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);
guide[i].second = i;
}
sort(guide.begin(), guide.end());
for (int i = 0; i < n; i++) {
cout << guide[i].second << endl;
}
return 0;
}
| #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);
guide[i].second = i;
}
sort(guide.begin(), guide.end());
for (int i = 0; i < n; i++) {
cout << guide[i].second + 1 << endl;
}
return 0;
}
| [
"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 + 1] == '#')
res = false;
}
if (c > d && res) {
bool ok = false;
rep(i, d - b) {
if (s[b + i - 1] == '.' && s[b + i] == '.' && s[b + i + 1] == '.')
ok = true;
}
res = ok;
}
if (res)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| #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] == '#')
res = false;
}
if (c > d && res) {
bool ok = false;
rep(i, d - b + 1) {
if (s[b + i - 1] == '.' && s[b + i] == '.' && s[b + i + 1] == '.')
ok = true;
}
res = ok;
}
if (res)
cout << "Yes" << endl;
else
cout << "No" << endl;
return 0;
}
| [
"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] == '#') {
cout << "No" << endl;
return 0;
}
}
//(B, D)に2マス連続で岩があればNG
for (int i = B + 1; i <= D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
// 2マス連続で岩がないとき
// C < Dなら上手く移動できる
if (C < D) {
cout << "Yes" << endl;
return 0;
}
// D < Cのとき，どこかで追い越す必要がある
else {
for (int i = B - 1; i <= D - 2; i++)
// 3マス連続で空白があればOK
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
//上のループを抜けるならダメ
cout << "No" << endl;
return 0;
}
| #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] == '#') {
cout << "No" << endl;
return 0;
}
}
//(B, D)に2マス連続で岩があればNG
for (int i = B + 1; i <= D - 1; i++) {
if (S[i] == '#' && S[i + 1] == '#') {
cout << "No" << endl;
return 0;
}
}
// 2マス連続で岩がないとき
// C < Dなら上手く移動できる
if (C < D) {
cout << "Yes" << endl;
return 0;
}
// D < Cのとき，どこかで追い越す必要がある
else {
for (int i = B - 1; i <= D - 1; i++)
// 3マス連続で空白があればOK
if (S[i] == '.' && S[i + 1] == '.' && S[i + 2] == '.') {
cout << "Yes" << endl;
return 0;
}
}
//上のループを抜けるならダメ
cout << "No" << endl;
return 0;
}
| [
"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 < min(max(c, d), n - 1); i++)
if (s[i] == '#' && s[i + 1] == '#')
w = false;
cout << (w ? "Yes" : "No") << endl;
} | #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 < min(max(c, d), n - 1); i++)
if (s[i] == '#' && s[i + 1] == '#')
w = false;
cout << (w ? "Yes" : "No") << endl;
} | [
"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 ans = 0;
while (n > 0) {
n /= 10;
ans++;
}
return ans;
}
ll _pow(ll a, ll b) {
ll ans = 1;
rep(i, b) { ans *= a; }
return ans;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool flag = false;
int count = 0;
// if(s[0] == '.')count++;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b - 2; i < d; i++) {
if (s[i] == '.') {
count++;
} else {
count = 0;
}
if (count == 3) {
flag = true;
}
}
if (c < d) {
cout << "Yes" << endl;
return false;
} else {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| #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 ans = 0;
while (n > 0) {
n /= 10;
ans++;
}
return ans;
}
ll _pow(ll a, ll b) {
ll ans = 1;
rep(i, b) { ans *= a; }
return ans;
}
int main() {
int n, a, b, c, d;
cin >> n >> a >> b >> c >> d;
string s;
cin >> s;
bool flag = false;
int count = 0;
// if(s[0] == '.')count++;
for (int i = a; i < c; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b; i < d; i++) {
if (s[i] == '#' && s[i - 1] == '#') {
cout << "No" << endl;
return 0;
}
}
for (int i = b - 2; i <= d; i++) {
if (s[i] == '.') {
count++;
} else {
count = 0;
}
if (count == 3) {
flag = true;
}
}
if (c < d) {
cout << "Yes" << endl;
return false;
} else {
if (flag) {
cout << "Yes" << endl;
} else {
cout << "No" << endl;
}
}
return 0;
}
| [
"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.