problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p03221 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pa;
vector<vector<pair<int, int>>> c(n);
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
p--;
y--;
pa.emplace_back(p, y);
c[p].emplace_back(y, i);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pa;
vector<vector<pair<int, int>>> c(n);
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
p--;
y--;
pa.emplace_back(p, y);
c[p].emplace_back(y, i);
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,016,667 | 1,016,668 | u221391729 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pa;
vector<vector<pair<int, int>>> c(m);
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
p--;
y--;
pa.emplace_back(p, y);
c[p].emplace_back(y, i);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> pa;
vector<vector<pair<int, int>>> c(n);
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
p--;
y--;
pa.emplace_back(p, y);
c[p].emplace_back(y, i);
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,016,669 | 1,016,668 | u221391729 | cpp |
p03221 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, N) for (int i = 0; i < (N); i++)
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> P(M), Y(M);
rep(i, M) cin >> P[i] >> Y[i], --P[i];
vector<vector<long long>> city(N);
rep(i, M) cit... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, N) for (int i = 0; i < (N); i++)
using namespace std;
int main() {
long long N, M;
cin >> N >> M;
vector<long long> P(M), Y(M);
rep(i, M) cin >> P[i] >> Y[i], --P[i];
vector<vector<long long>> city(N);
rep(i, M) cit... | [
"expression.operation.binary.add"
] | 1,016,670 | 1,016,671 | u456283970 | cpp |
p03221 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> P(N), Y(N), ord[100010];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
ord[P[i]].push_back(Y[i]);
}
for (int i = 1; i <= N; i++)
sort(ord[i].begin(), ord[i].end... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> P(M), Y(M), ord[100010];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
ord[P[i]].push_back(Y[i]);
}
for (int i = 1; i <= N; i++)
sort(ord[i].begin(), ord[i].end... | [] | 1,016,672 | 1,016,673 | u098923136 | cpp |
p03221 | #include <bits/stdc++.h>
// #include <vector >
// #include <algorithm >
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int N, M;
int P[100000], Y[100000];
vector<int> yd[100001];
int main() {
scanf("%d%d", &N, &M);
rep(i, M) scanf("%d%d", &P[i], &Y[i]), yd[P[i]].push_back... | #include <bits/stdc++.h>
// #include <vector >
// #include <algorithm >
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
int N, M;
int P[100000], Y[100000];
vector<int> yd[100001];
int main() {
scanf("%d%d", &N, &M);
rep(i, M) scanf("%d%d", &P[i], &Y[i]), yd[P[i]].push_back... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,016,674 | 1,016,675 | u151251720 | cpp |
p03221 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MAXM 100001
int N, M;
bool sor(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
if (a.first.first == b.first.first)
return a.second < b.second;
r... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < n; i++)
#define MAXM 100001
int N, M;
bool sor(pair<pair<int, int>, int> a, pair<pair<int, int>, int> b) {
if (a.first.first == b.first.first)
return a.second < b.second;
r... | [
"expression.operation.binary.add"
] | 1,016,676 | 1,016,677 | u942850310 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
string to_id(int num) {
string s = to_string(num);
reverse(s.begin(), s.end());
while (s.size() < 6)
s += '0';
reverse(s.begin(), s.end());
return s;
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> cities(n + 10, vector<int>());
vector<int>... | #include <bits/stdc++.h>
using namespace std;
string to_id(int num) {
string s = to_string(num);
reverse(s.begin(), s.end());
while (s.size() < 6)
s += '0';
reverse(s.begin(), s.end());
return s;
}
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> cities(n + 10, vector<int>());
vector<int>... | [
"control_flow.loop.for.condition.change"
] | 1,016,680 | 1,016,681 | u833963136 | cpp |
p03221 | #include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define F first
#define S second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define all(x) x.begin(), x.end()
#define pqueue priority_queue
#define mset multiset
#define umap unordered_map
#define Speed() ... | #include <bits/stdc++.h>
#define sz(x) (int)((x).size())
#define F first
#define S second
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define all(x) x.begin(), x.end()
#define pqueue priority_queue
#define mset multiset
#define umap unordered_map
#define Speed() ... | [
"literal.number.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,016,682 | 1,016,683 | u002627851 | cpp |
p03221 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define put(i) cout << fixed << i << endl
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> p(m), y(m);
rep(i, m) cin >> p[i] >> y[i];
map... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define sum(a) accumulate(a.begin(), a.end(), 0LL)
#define put(i) cout << fixed << i << endl
using namespace std;
using ll = long long;
int main() {
ll n, m;
cin >> n >> m;
vector<ll> p(m), y(m);
rep(i, m) cin >> p[i] >> y[i];
map... | [
"identifier.change",
"call.arguments.change"
] | 1,016,688 | 1,016,689 | u185935459 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define Dcout(a) cout << setprecision(20) << a << endl
#defin... | #include <bits/stdc++.h>
using namespace std;
/******* All Required define Pre-Processors and typedef Constants *******/
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(cont) cont.begin(), cont.end()
#define rall(cont) cont.rbegin(), cont.rend()
#define Dcout(a) cout << setprecision(20) << a << endl
#defin... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,016,698 | 1,016,699 | u502312544 | cpp |
p03221 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int keta(int &n) {
string s = to_string(n);
return s.size();
}
int main() {
int N, M, tmp1, tmp2;
cin >> N >> M;
vector<vector<P>> p(M);
rep(i, M) {
cin >> tmp1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
int keta(int &n) {
string s = to_string(n);
return s.size();
}
int main() {
int N, M, tmp1, tmp2;
cin >> N >> M;
vector<vector<P>> p(N);
rep(i, M) {
cin >> tmp1... | [
"identifier.change",
"call.arguments.change"
] | 1,016,704 | 1,016,705 | u097161601 | cpp |
p03221 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using ll = long long;
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
vector<int> pre[100001];
int p[100000], y[100000];
for (int i = 0; i < m; i++)
cin >> p[i] >> y[i], pre[p[i]].push_back(y[i]);
... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
using ll = long long;
using namespace std;
void solve() {
int n, m;
cin >> n >> m;
vector<int> pre[100001];
int p[100000], y[100000];
for (int i = 0; i < m; i++)
cin >> p[i] >> y[i], pre[p[i]].push_back(y[i]);
... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,016,708 | 1,016,709 | u646017153 | cpp |
p03221 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 1,016,711 | 1,016,712 | u401139594 | cpp |
p03221 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 1,016,713 | 1,016,712 | u401139594 | cpp |
p03221 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | [
"expression.operation.binary.add"
] | 1,016,711 | 1,016,714 | u401139594 | cpp |
p03221 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <string>
#include <vector>
#define repl(i, l, r) for (ll i = l; i < r; i++)
#define rep(i, n) repl(i, 0, n)
using namespac... | [
"expression.operation.binary.add"
] | 1,016,713 | 1,016,714 | u401139594 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
int main() {
int M, N;
cin >> M >> N;
vector<pair<pair<int, int>, int>> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i].first.second >> A[i].first.first;
A[i].second = i;
}
sort(A.begin(), A.end());
vector<int> B(M, 1), C(N), D(N);
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
int main() {
int M, N;
cin >> M >> N;
vector<pair<pair<int, int>, int>> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i].first.second >> A[i].first.first;
A[i].second = i;
}
sort(A.begin(), A.end());
vector<int> B(M + 1, 1), C(N), D(N);
for (int i = 0... | [
"assignment.change"
] | 1,016,719 | 1,016,720 | u306482197 | cpp |
p03221 | #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, M;
cin >> N >> M;
vector<int> P(N + 1), city(N + 1);
vector<vector<int>> Ms(N + 1, vector<int>());
for (int i = 1; i <= M; i++) {
int x, y;
cin >> x >> y;
P[i] ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
vector<int> P(M + 1), city(M + 1);
vector<vector<int>> Ms(N + 1, vector<int>());
for (int i = 1; i <= M; i++) {
int x, y;
cin >> x >> y;
P[i] ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,721 | 1,016,722 | u801083963 | cpp |
p03221 | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
ll gcd(ll x, ll y);
int fac(ll n, vector<int> num);
template <class T> inline bool chmax(T &a, T... | #include "bits/stdc++.h"
#define rep(i, j) for (int i = 0; i < j; i++)
#define srep(i, j, k) for (int i = j; i < k; i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using ull = unsigned long long;
ll gcd(ll x, ll y);
int fac(ll n, vector<int> num);
template <class T> inline bool chmax(T &a, T... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,723 | 1,016,724 | u616794313 | cpp |
p03221 | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <st... | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <stack>
#include <st... | [
"expression.operation.binary.add"
] | 1,016,727 | 1,016,728 | u631558039 | cpp |
p03221 | /* 実行時間1s制限の場合10^6 1,000,000 : 余裕をもって間に合う10^7
10,000,000 : おそらく間に合う10^8 100,000,000 : 非常にシンプルな処理
でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long ... | /* 実行時間1s制限の場合10^6 1,000,000 : 余裕をもって間に合う10^7
10,000,000 : おそらく間に合う10^8 100,000,000 : 非常にシンプルな処理
でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long ... | [] | 1,016,738 | 1,016,739 | u234248338 | cpp |
p03221 | /* 実行時間1s制限の場合10^6 1,000,000 : 余裕をもって間に合う10^7
10,000,000 : おそらく間に合う10^8 100,000,000 : 非常にシンプルな処理
でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long ... | /* 実行時間1s制限の場合10^6 1,000,000 : 余裕をもって間に合う10^7
10,000,000 : おそらく間に合う10^8 100,000,000 : 非常にシンプルな処理
でないと厳しい
*/
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define repi(i, a, b) for (int i = int(a); i < int(b); ++i)
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
using namespace std;
typedef long ... | [] | 1,016,740 | 1,016,739 | u234248338 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
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;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
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;
... | [
"identifier.change",
"call.arguments.change"
] | 1,016,741 | 1,016,742 | u876953939 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
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;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
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;
... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change"
] | 1,016,743 | 1,016,742 | u876953939 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
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;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
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;
... | [
"identifier.change",
"call.arguments.change"
] | 1,016,744 | 1,016,742 | u876953939 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
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;
... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define ll long long
#define ld long double
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;
... | [
"identifier.change",
"call.arguments.change"
] | 1,016,745 | 1,016,742 | u876953939 | cpp |
p03221 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repr(i, a, n) for (int i = n - 1; i >= a; i--)
using namespace std;
using ll = long long;
using P = pair<int, int>;
template <typename T> void chmin(T &a, T b) { a = min(a, b); }
template <typename T> void chmax(T &a, T b) { a = max(a, b)... | [
"assignment.value.change",
"identifier.change"
] | 1,016,748 | 1,016,749 | u688789047 | cpp |
p03221 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using... | [
"literal.number.change",
"call.arguments.change"
] | 1,016,750 | 1,016,751 | u006717664 | cpp |
p03221 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <vector>
using... | [
"identifier.change",
"expression.operation.binary.change",
"literal.number.change",
"call.arguments.change"
] | 1,016,752 | 1,016,751 | u006717664 | cpp |
p03221 | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
// using namespace boost::multiprecision;
typedef long long int ll;
typedef long double ld;
#define MOD 1000000007
#define ALL(obj) (obj).begin(), (obj).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp>
using namespace std;
// using namespace boost::multiprecision;
typedef long long int ll;
typedef long double ld;
#define MOD 1000000007
#define ALL(obj) (obj).begin(), (obj).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
... | [
"expression.operation.binary.remove"
] | 1,016,753 | 1,016,754 | u273928723 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 100100100;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
struct Edge {
ll to;
ll cost;
};
... | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,016,757 | 1,016,758 | u893239355 | cpp |
p03221 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
class ID {
public:
int i;
int P;
long long Y;
int ans;
};
bool cmp0(const ID &a, const ID &b) { return a.i < b.i; }
bool cmp1(const ID &a, const ID &b) { return a.P < b.P; }
bool cmp2(const ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <sstream>
#include <vector>
using namespace std;
class ID {
public:
int i;
int P;
long long Y;
int ans;
};
bool cmp0(const ID &a, const ID &b) { return a.i < b.i; }
bool cmp1(const ID &a, const ID &b) { return a.P < b.P; }
bool cmp2(const ... | [
"identifier.change",
"call.function.change"
] | 1,016,762 | 1,016,763 | u945452839 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> p(M);
for (int i = 0; i < M; i++) {
int P, Y;
cin >> P >> Y;
P--;
p.at(i) = make_pair(Y, P);
}
vector<vector<int>> vals(N);
for (int i = 0; i < M; i++)
vals.at(p.at(i).second).... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> p(M);
for (int i = 0; i < M; i++) {
int P, Y;
cin >> P >> Y;
P--;
p.at(i) = make_pair(Y, P);
}
vector<vector<int>> vals(N);
for (int i = 0; i < M; i++)
vals.at(p.at(i).second).... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,779 | 1,016,780 | u533566373 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
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 int INF = 10010... | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
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 int INF = 10010... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 1,016,781 | 1,016,782 | u209457657 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
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 int INF = 10010... | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
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 int INF = 10010... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one"
] | 1,016,784 | 1,016,782 | u209457657 | cpp |
p03221 | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
using namespace std;
int main() {
const long long int kuni = 10000000000;
long long int n, m, p[300000], y[300000], so[300000], cou = 2;
map<long long int, long long int> mp;
cin >... | #include <algorithm>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <map>
#include <sstream>
#include <string>
using namespace std;
int main() {
const long long int kuni = 10000000000;
long long int n, m, p[300000], y[300000], so[300000], cou = 2;
map<long long int, long long int> mp;
cin >... | [] | 1,016,793 | 1,016,794 | u018872912 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, l, r) for (ll i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (ll i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define p... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, l, r) for (ll i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (ll i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define p... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,795 | 1,016,796 | u342075214 | cpp |
p03221 | typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n, m;
std::cin >> n >> m;
vector<pair<ll, ll>> yp(m);
map<pair<ll, ll>, ll> pi;
map<ll, pair<ll, ll>> ip;
for (int i = 0; i < m; i++) {
ll p, y;
std::cin >> p >> y;
yp[i] = {y, p};
p... | typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n, m;
std::cin >> n >> m;
vector<pair<ll, ll>> yp(m);
map<pair<ll, ll>, ll> pi;
map<ll, pair<ll, ll>> ip;
for (int i = 0; i < m; i++) {
ll p, y;
std::cin >> p >> y;
yp[i] = {y, p};
p... | [
"assignment.change"
] | 1,016,803 | 1,016,804 | u121794232 | cpp |
p03221 | typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n, m;
std::cin >> n >> m;
vector<pair<ll, ll>> yp(m);
map<pair<ll, ll>, ll> pi;
map<ll, pair<ll, ll>> ip;
for (int i = 0; i < m; i++) {
ll p, y;
std::cin >> p >> y;
yp[i] = {y, p};
p... | typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
int main() {
ll n, m;
std::cin >> n >> m;
vector<pair<ll, ll>> yp(m);
map<pair<ll, ll>, ll> pi;
map<ll, pair<ll, ll>> ip;
for (int i = 0; i < m; i++) {
ll p, y;
std::cin >> p >> y;
yp[i] = {y, p};
p... | [
"assignment.change"
] | 1,016,805 | 1,016,804 | u121794232 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 0
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #Var... | [
"expression.operation.binary.add"
] | 1,016,808 | 1,016,809 | u041513069 | cpp |
p03221 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))
#define vecll2(var, n, m) ve... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define vec2(var, n, m) vector<vector<int>> var(n, vector<int>(m, 0))
#define vecll2(var, n, m) ve... | [
"variable_declaration.type.change",
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,016,817 | 1,016,816 | u929977034 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T &... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T &... | [
"call.arguments.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,016,818 | 1,016,819 | u308463793 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
struct Edge {
long long to;
long long cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
const long long INF = 1LL << 60;
long ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const long double PI = (acos(-1));
const long long MOD = 1000000007;
struct Edge {
long long to;
long long cost;
};
using Graph = vector<vector<Edge>>;
using P = pair<ll, ll>;
const long long INF = 1LL << 60;
long ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,824 | 1,016,825 | u303297838 | cpp |
p03221 | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1000000000000000000
using namespace std;
string lltozeroume(ll a) {
if (a >= 100000) {
return to_string(a);
} else if (a >= 10000) {
return "0" + to_string(a);
} else if (a >= 1000) {
return "00" + to_string(a);
}... | #include <bits/stdc++.h>
#define ll long long int
#define MOD 1000000007
#define INF 1000000000000000000
using namespace std;
string lltozeroume(ll a) {
if (a >= 100000) {
return to_string(a);
} else if (a >= 10000) {
return "0" + to_string(a);
} else if (a >= 1000) {
return "00" + to_string(a);
}... | [
"variable_declaration.type.change"
] | 1,016,839 | 1,016,840 | u755121033 | cpp |
p03221 | #include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <limits>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep_init(i, init, n) for... | #include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <limits>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
#define rep_init(i, init, n) for... | [
"literal.number.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,854 | 1,016,855 | u873336868 | cpp |
p03221 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,016,858 | 1,016,859 | u781381862 | cpp |
p03221 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,016,860 | 1,016,859 | u781381862 | cpp |
p03221 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <s... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 1,016,861 | 1,016,859 | u781381862 | cpp |
p03221 | #include <algorithm>
#include <climits>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
vector<int> ans[100001];
int main() {
int N, M;
cin >> N >> M;
vector<int> P, Y;
for (int i = 0; i < M; i++) {
int sub;
cin >> sub;
P.push_back(sub);
cin >> sub;
Y.push_b... | #include <algorithm>
#include <climits>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
vector<int> ans[100001];
int main() {
int N, M;
cin >> N >> M;
vector<int> P, Y;
for (int i = 0; i < M; i++) {
int sub;
cin >> sub;
P.push_back(sub);
cin >> sub;
Y.push_b... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,016,864 | 1,016,865 | u190018920 | cpp |
p03221 | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); (i) < (n); i++)
#define repe(i, f, n) for (ll i = (f); (i) <= (n); i++)
using namespace std;
typedef long long ll;
ll INF = 1LL << 60;
ll MAX = 100010;
ll MOD = 2019;
int main() {
int N;
cin >> N;
int M;
cin >> M;
vector<vector<int>> arr(N + 1);... | #include <bits/stdc++.h>
#define rep(i, f, n) for (ll i = (f); (i) < (n); i++)
#define repe(i, f, n) for (ll i = (f); (i) <= (n); i++)
using namespace std;
typedef long long ll;
ll INF = 1LL << 60;
ll MAX = 100010;
ll MOD = 2019;
int main() {
int N;
cin >> N;
int M;
cin >> M;
vector<vector<int>> arr(N + 1);... | [
"identifier.change",
"call.function.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,016,871 | 1,016,872 | u873269440 | cpp |
p03221 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int digit(int x) {
int y = 0;
while (x > 0) {
y++;
x /= 10;
}
return y;
}
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, ll>> vec(m);
vector<pair<int, ll>> vecb(m);
for (int i = 0; i < m; i++) {
int j;
ll k;
... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int digit(int x) {
int y = 0;
while (x > 0) {
y++;
x /= 10;
}
return y;
}
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, ll>> vec(m);
vector<pair<int, ll>> vecb(m);
for (int i = 0; i < m; i++) {
int j;
ll k;
... | [
"variable_declaration.name.change",
"identifier.change",
"control_flow.loop.for.initializer.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,016,875 | 1,016,876 | u363369454 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m), y(m);
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
}
vector<int> py[n + 1];
for (int i = 0; i < m; i++) {
py[p[i]].push_back(y[i]);
}
for (int i = 0; i < n; i++) {
sort(py[i].begin... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<int> p(m), y(m);
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
}
vector<int> py[n + 1];
for (int i = 0; i < m; i++) {
py[p[i]].push_back(y[i]);
}
for (int i = 1; i <= n; i++) {
sort(py[i].begi... | [
"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",
"variable_declaration.type.primitive.change",
"vari... | 1,016,879 | 1,016,880 | u494609869 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
struct edge {
ll to, cost;
};
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define INF 1000000000000
#define ALL(a) (a).begin(), (a).end()
std::string rsubstr(std::string str, size_t pos,
size_t len ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
typedef pair<ll, ll> P;
struct edge {
ll to, cost;
};
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define INF 1000000000000
#define ALL(a) (a).begin(), (a).end()
std::string rsubstr(std::string str, size_t pos,
size_t len ... | [
"literal.number.change",
"io.output.change"
] | 1,016,885 | 1,016,886 | u364916333 | cpp |
p03221 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> cities(m);
vector<vector<int>> s(100001, vector<int>());
for (int i = 0; i < m; ++i) {
int p, y;
cin >> p >> y;
cities[i] = make_pair(p, ... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> cities(m);
vector<vector<int>> s(100001, vector<int>());
for (int i = 0; i < m; ++i) {
int p, y;
cin >> p >> y;
cities[i] = make_pair(p, ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,016,887 | 1,016,888 | u469612749 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> p(M, 0);
vector<int> yp(M, 0);
vector<vector<int>> y(N, vector<int>(0, 0));
for (int i = 0; i < M; ++i) {
int tmp_p, tmp_y;
cin >> tmp_p >> tmp_y;
--tmp_p;
p[i] = tmp_p;
yp[i] = tmp_y;
... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int N, M;
cin >> N >> M;
vector<int> p(M, 0);
vector<int> yp(M, 0);
vector<vector<int>> y(N, vector<int>(0, 0));
for (int i = 0; i < M; ++i) {
int tmp_p, tmp_y;
cin >> tmp_p >> tmp_y;
--tmp_p;
p[i] = tmp_p;
yp[i] = tmp_y;
... | [
"expression.operation.binary.add"
] | 1,016,894 | 1,016,895 | u150012595 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> P(m), Y(m);
rep(i, m) cin >> P[i] >> Y[i];
vector<vector<int>> vals(n + 1);
rep(i, m) vals[P[i]].push_back(... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const int MOD = 1000000007;
int main() {
int n, m;
cin >> n >> m;
vector<int> P(m), Y(m);
rep(i, m) cin >> P[i] >> Y[i];
vector<vector<int>> vals(n + 1);
rep(i, m) vals[P[i]].push_back(... | [
"expression.operation.binary.add"
] | 1,016,898 | 1,016,899 | u650236619 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<map<int, int>> py(m + 1);
vector<vector<int>> numm(m + 1, vector<int>(2));
int tmp1, tmp2;
for (int i = 1; i <= m; i++) {
cin >> tmp1 >> tmp2;
py[tmp1][tmp2] = 0;
numm[i][0] = tmp1;
numm[i][1] = tm... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<map<int, int>> py(n + 1);
vector<vector<int>> numm(m + 1, vector<int>(2));
int tmp1, tmp2;
for (int i = 1; i <= m; i++) {
cin >> tmp1 >> tmp2;
py[tmp1][tmp2] = 0;
numm[i][0] = tmp1;
numm[i][1] = tm... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,906 | 1,016,907 | u229596090 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
void solve() {
int N, M;
cin >> N >> M;
vector<int> P(M), Y(M);
vector<vector<int>> yd(M + 1, vector<int>(0));
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
yd[P[i]].push_back(Y[i]);
}
for (int i = 0; i < N; i++) {
sort(yd[i + 1].begin(), yd... | #include <bits/stdc++.h>
using namespace std;
void solve() {
int N, M;
cin >> N >> M;
vector<int> P(M), Y(M);
vector<vector<int>> yd(N + 1, vector<int>(0));
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
yd[P[i]].push_back(Y[i]);
}
for (int i = 0; i < N; i++) {
sort(yd[i + 1].begin(), yd... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,016,912 | 1,016,913 | u449922162 | cpp |
p03221 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
const double PI = 3.141592653589793238463;
using namespace std;
using ll = long long;
const ll INF = +10010010000;
typedef pair<ll, ll> P;
const int mod = 1e9 + 7;
struct... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i < (n + 1); ++i)
const double PI = 3.141592653589793238463;
using namespace std;
using ll = long long;
const ll INF = +10010010000;
typedef pair<ll, ll> P;
const int mod = 1e9 + 7;
struct... | [
"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"
] | 1,016,922 | 1,016,923 | u412659798 | cpp |
p03221 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cctype>
#include <climits>
#include <clocale>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <ioman... | [] | 1,016,926 | 1,016,927 | u803893892 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> A;
int N, M;
int P[100001], Y[100001];
int K[100001]; // K[i]: 市iが県で何番目
signed main() {
cin >> N >> M;
vector<A> vec[100001]; // vec[県i]: (y[市j], 市j)のvector
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
vec[P[i]].push_back(A(Y[i], i... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> A;
int N, M;
int P[100001], Y[100001];
int K[100001]; // K[市i]: 県の中で何番目か
signed main() {
cin >> N >> M;
vector<A> vec[100001]; // vec[県i]: (年, 市)のvector
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
vec[P[i]].push_back(A(Y[i], i));
... | [
"expression.operation.binary.add"
] | 1,016,937 | 1,016,938 | u331360010 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {... | [] | 1,016,950 | 1,016,951 | u808943968 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {... | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using ll = long long;
using pll = pair<ll, ll>;
#define fi first
#define se second
#define pb push_back
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define MOD 1000000007
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {... | [
"call.arguments.change"
] | 1,016,952 | 1,016,951 | u808943968 | cpp |
p03221 | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = LLONG_MAX, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W;
typedef long long ll;
typedef pair<ll, ll> Pa;... | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = LLONG_MAX, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W;
typedef long long ll;
typedef pair<ll, ll> Pa;... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 1,016,955 | 1,016,956 | u554988565 | cpp |
p03221 | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = LLONG_MAX, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W;
typedef long long ll;
typedef pair<ll, ll> Pa;... | #pragma region template
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const long long MOD = 1e9 + 7, MAX = LLONG_MAX, larg = 1e5, INF = -1e9;
long long A, B, C, D, E, F, G, H, I, J, K, L, N, M, O, P, Q, R, S, T, U, V, W;
typedef long long ll;
typedef pair<ll, ll> Pa;... | [
"expression.operation.binary.add"
] | 1,016,957 | 1,016,956 | u554988565 | cpp |
p03221 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
vector<int> V[100001];
int P[100001] = {};
int Y[100001] = {};
cin >> N >> M;
// cout << "c"<<endl;
for (int i = 0; i < M; i++) {
cin >> P[i] >>... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
vector<int> V[100001];
int P[100001] = {};
int Y[100001] = {};
cin >> N >> M;
// cout << "c"<<endl;
for (int i = 0; i < M; i++) {
cin >> P[i] >>... | [
"expression.operation.binary.add"
] | 1,016,961 | 1,016,962 | u601256797 | cpp |
p03221 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
vector<int> V[100001];
int P[100001] = {};
int Y[100001] = {};
cin >> N >> M;
// cout << "c"<<endl;
for (int i = 0; i < M; i++) {
cin >> P[i] >>... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int N, M;
vector<int> V[100001];
int P[100001] = {};
int Y[100001] = {};
cin >> N >> M;
// cout << "c"<<endl;
for (int i = 0; i < M; i++) {
cin >> P[i] >>... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,016,963 | 1,016,962 | u601256797 | cpp |
p03221 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using std::bitset;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vecto... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using std::bitset;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vecto... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,016,964 | 1,016,965 | u718048349 | cpp |
p03221 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using std::bitset;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vecto... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using std::bitset;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vecto... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,016,966 | 1,016,965 | u718048349 | cpp |
p03221 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> v(n);
vector<pair<int, int>> per(n);
rep(i, m) {
int x,... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n, m;
cin >> n >> m;
vector<vector<int>> v(n);
vector<pair<int, int>> per(m);
rep(i, m) {
int x,... | [] | 1,016,978 | 1,016,979 | u657208344 | cpp |
p03221 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 1,016,991 | 1,016,992 | u179778090 | cpp |
p03221 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; i++)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; i++)
#define rrep(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rreps(i, n) for (int i = ((int)(n)); i ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 1,016,993 | 1,016,992 | u179778090 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 1000000000;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> a(N + 1);
vector<pair<int, int>> info(M);
rep(i, M) {
cin >> info.at(i).first >> info.at(i).second;
a... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < n; i++)
const int INF = 1000000000;
int main() {
int N, M;
cin >> N >> M;
vector<vector<int>> a(N + 1);
vector<pair<int, int>> info(M);
rep(i, M) {
cin >> info.at(i).first >> info.at(i).second;
a... | [
"expression.operation.binary.add"
] | 1,017,005 | 1,017,006 | u936602931 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
};
} hoee;
//別名
#define int long long
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = ... | #include <bits/stdc++.h>
using namespace std;
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
};
} hoee;
//別名
#define int long long
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vs = vector<string>;
using vl = vector<ll>;
using vvl = vector<vl>;
using P = ... | [
"expression.operation.binary.add"
] | 1,017,007 | 1,017,008 | u986437843 | cpp |
p03221 | #include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define SORT(A) sort(A.begin(), A.end())
#define REV(A) reverse(A.begin(), A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vec... | #include <bits/stdc++.h>
#define cout16 cout << setprecision(16)
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep2(i, f, n) for (int i = f; i < n; i++)
#define SORT(A) sort(A.begin(), A.end())
#define REV(A) reverse(A.begin(), A.end())
typedef long long int ll;
using vi = std::vector<int>;
using vvi = std::vec... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,017,011 | 1,017,012 | u086672186 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<ll, ll>;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
using Graph = VV;
template <class T>... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using p = pair<ll, ll>;
using V = vector<int>;
using VV = vector<vector<int>>;
using VVV = vector<vector<vector<int>>>;
using VL = vector<ll>;
using VVL = vector<vector<ll>>;
using VVVL = vector<vector<vector<ll>>>;
using Graph = VV;
template <class T>... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,017,020 | 1,017,021 | u836743234 | cpp |
p03221 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<P> p, y;
rep(i, m) {
int a, b;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define zero_pad(num) setfill('0') << std::right << setw(num)
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
int main() {
int n, m;
cin >> n >> m;
vector<P> p, y;
rep(i, m) {
int a, b;
... | [
"identifier.change",
"call.arguments.change"
] | 1,017,022 | 1,017,023 | u068713120 | cpp |
p03221 | #include <bits/stdc++.h>
class index_sync_sort {
public:
int N;
std::vector<int> index;
std::vector<int> data;
std::vector<int> syncdata;
index_sync_sort(int N_in) {
N = N_in;
index.resize(N);
data.resize(N);
syncdata.resize(N);
for (int i = 0; i < N; i++) {
index[i] = i;
}
}... | #include <bits/stdc++.h>
class index_sync_sort {
public:
int N;
std::vector<int> index;
std::vector<int> data;
std::vector<int> syncdata;
index_sync_sort(int N_in) {
N = N_in;
index.resize(N);
data.resize(N);
syncdata.resize(N);
for (int i = 0; i < N; i++) {
index[i] = i;
}
}... | [
"identifier.change",
"call.arguments.change"
] | 1,017,024 | 1,017,025 | u672160971 | cpp |
p03220 | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
double n, t, a, minn = 999999999, mbh;
double h[1010];
int main() {
cin >> n >> t >> a;
cin >> h[1];
mbh = 1, minn = t - h[1] * 0.006;
for (int i = 2; i <= n; i++) {
cin >> h[i];
long long dq = t - h[i] * 0.00... | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
double n, t, a, minn = 999999999, mbh;
double h[1010];
int main() {
cin >> n >> t >> a;
cin >> h[1];
mbh = 1, minn = t - h[1] * 0.006;
for (int i = 2; i <= n; i++) {
cin >> h[i];
double dq = t - h[i] * 0.006;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 1,017,028 | 1,017,029 | u119047658 | cpp |
p03220 | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
long long n, t, a, minn = 999999999, mbh;
long long h[1010];
int main() {
cin >> n >> t >> a;
cin >> h[1];
mbh = 1, minn = t - h[1] * 0.006;
for (int i = 2; i <= n; i++) {
cin >> h[i];
long long dq = t - h[i] ... | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
double n, t, a, minn = 999999999, mbh;
double h[1010];
int main() {
cin >> n >> t >> a;
cin >> h[1];
mbh = 1, minn = t - h[1] * 0.006;
for (int i = 2; i <= n; i++) {
cin >> h[i];
double dq = t - h[i] * 0.006;
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.narrow.change"
] | 1,017,031 | 1,017,029 | u119047658 | cpp |
p03220 | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, t, a, minn = 999999999, mbh;
int h[1010];
int main() {
cin >> n >> t >> a;
cin >> h[1];
mbh = 1, minn = t - h[1] * 0.006;
for (int i = 2; i <= n; i++) {
cin >> h[i];
int dq = t - h[i] * 0.006;
if (a... | #include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
double n, t, a, minn = 999999999, mbh;
double h[1010];
int main() {
cin >> n >> t >> a;
cin >> h[1];
mbh = 1, minn = t - h[1] * 0.006;
for (int i = 2; i <= n; i++) {
cin >> h[i];
double dq = t - h[i] * 0.006;
... | [
"variable_declaration.type.primitive.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,017,032 | 1,017,029 | u119047658 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
int T, A;
int H[1002];
cin >> N;
cin >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H[i];
}
int near = 1;
double min = abs(A - (T - H[1] * 0.006));
for (int i = 2; i <= N; i++) {
if (abs(A - (T - H[i] * 0.006))... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
int T, A;
int H[1002];
cin >> N;
cin >> T >> A;
for (int i = 1; i <= N; i++) {
cin >> H[i];
}
int near = 1;
double min = abs(A - (T - H[1] * 0.006));
for (int i = 2; i <= N; i++) {
if (abs(A - (T - H[i] * 0.006))... | [
"call.add",
"call.arguments.change"
] | 1,017,039 | 1,017,040 | u277806686 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define MAXN 1000 + 20
int a[MAXN][MAXN] = {0};
bool cmp(string s1, string s2) {
return s1.length() < s2.length() ? true : false;
}
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int rst = 0x3f3f3f;
int b = 1;
for (int i = 1; i <= n; i++) {
doubl... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 1000 + 20
int a[MAXN][MAXN] = {0};
bool cmp(string s1, string s2) {
return s1.length() < s2.length() ? true : false;
}
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
double rst = 0x3f3f3f;
int b = 1;
for (int i = 1; i <= n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,017,041 | 1,017,042 | u624688258 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define MAXN 1000 + 20
int a[MAXN][MAXN] = {0};
bool cmp(string s1, string s2) {
return s1.length() < s2.length() ? true : false;
}
int main() {
int n;
cin >> n;
int t, a;
cin >> t >> a;
int rst = 0x3f3f3f;
int b = 1;
for (int i = 1; i <= n; i++) {
int x... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 1000 + 20
int a[MAXN][MAXN] = {0};
bool cmp(string s1, string s2) {
return s1.length() < s2.length() ? true : false;
}
int main() {
int n;
cin >> n;
double t, a;
cin >> t >> a;
double rst = 0x3f3f3f;
int b = 1;
for (int i = 1; i <= n; i++) {
... | [
"variable_declaration.type.primitive.change"
] | 1,017,043 | 1,017,042 | u624688258 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int n, t, a, m;
int h[1005], x[1005];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; i+... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define ll long long
using namespace std;
int n, t, a, m;
float h[1005], x[1005];
int main() {
cin >> n >> t >> a;
for (int i = 0; i < n; ... | [
"variable_declaration.type.primitive.change",
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 1,017,044 | 1,017,045 | u961611557 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MAX = 1000000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int T, A;
cin >> T >> A;
int H[2000];
for (int i = 0; i < N; i++) {
ci... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MAX = 1000000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int T, A;
cin >> T >> A;
int H[2000];
for (int i = 0; i < N; i++) {
c... | [
"variable_declaration.type.primitive.change"
] | 1,017,046 | 1,017,047 | u946090308 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MAX = 1000000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int T, A;
cin >> T >> A;
int H[1000];
for (int i = 0; i < N; i++) {
ci... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MAX = 1000000;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
int T, A;
cin >> T >> A;
int H[2000];
for (int i = 0; i < N; i++) {
c... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.type.primitive.change",
"variable_declaration.value.change"
] | 1,017,048 | 1,017,047 | u946090308 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
ll N;
ll T, A;
cin >> N;
cin >> T >> A;
pair<ll, ll> H[N];
for (in... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
int N;
double T, A;
cin >> N;
cin >> T >> A;
pair<double, double> H[N... | [
"variable_declaration.type.change"
] | 1,017,051 | 1,017,052 | u596912804 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
int N;
int T, A;
cin >> N;
cin >> T >> A;
pair<int, int> H[N];
for... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
using ll = long long int;
int main() {
int N;
double T, A;
cin >> N;
cin >> T >> A;
pair<double, double> H[N... | [
"variable_declaration.type.primitive.change"
] | 1,017,053 | 1,017,052 | u596912804 | cpp |
p03220 | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
double t, a, h, cha;
int n, ans;
int main() {
cin >> n >> t >> a;
cin >> h;
double k = t - h * 0.006;
cha = (a - k);
ans = 1;
for (int i = 1; i < n; i++) {
cin >> h;
double k = t - h * 0.006;... | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
double t, a, h, cha;
int n, ans;
int main() {
cin >> n >> t >> a;
cin >> h;
double k = t - h * 0.006;
cha = abs(a - k);
ans = 1;
for (int i = 1; i < n; i++) {
cin >> h;
double k = t - h * 0.0... | [
"call.add"
] | 1,017,056 | 1,017,057 | u878056971 | cpp |
p03220 | #include <stdio.h>
int main() {
int N = 0; //場所の個数
scanf("%d", &N);
int T = 0, A = 0; //平均気温と欲しい気温
scanf("%d %d", &T, &A);
float result = 10000;
int res_num = 0;
for (int i = 0; i < N; i++) {
int H = 0; //その地点での標高
scanf("%d", &H);
float ondo = T - (float)H * 0.006;
int a_2 = A - ond... | #include <stdio.h>
int main() {
int N = 0; //場所の個数
scanf("%d", &N);
int T = 0, A = 0; //平均気温と欲しい気温
scanf("%d %d", &T, &A);
float result = 10000;
int res_num = 0;
for (int i = 0; i < N; i++) {
int H = 0; //その地点での標高
scanf("%d", &H);
float ondo = T - (float)H * 0.006;
float a_2 = A - o... | [
"variable_declaration.type.primitive.change"
] | 1,017,058 | 1,017,059 | u457038726 | cpp |
p03220 | #include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ll long long
#define LEFT(a) ((a) << 1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a, b) ((a + b) >> 1)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
//#define temo
using na... | #include <bits/stdc++.h>
#define F first
#define S second
#define mp make_pair
#define pb push_back
#define ll long long
#define LEFT(a) ((a) << 1)
#define RIGHT(a) (LEFT(a) + 1)
#define MID(a, b) ((a + b) >> 1)
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MIN(a, b) ((a) < (b) ? (a) : (b))
//#define temo
using na... | [
"expression.unary.arithmetic.remove"
] | 1,017,060 | 1,017,061 | u704324882 | cpp |
p03220 | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
#define ESP 1e-8
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MI... | #include <algorithm>
#include <cstring>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define INF 0x3f3f3f3f
#define ESP 1e-8
#define MAX(a, b) ((a) > (b) ? (a) : (b))
#define MI... | [
"variable_declaration.type.primitive.change"
] | 1,017,062 | 1,017,063 | u145060727 | cpp |
p03220 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int min = 1000;
int place;
int N;
int T, A;
vector<int> v;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
int t;
cin >> t;
int m = abs(A - (T - t * 0.006));
if (min > m) {
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main() {
double min = 1000;
int place;
int N;
int T, A;
vector<int> v;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
int t;
cin >> t;
double m = abs(A - (T - t * 0.006));
if (min > m) ... | [
"variable_declaration.type.primitive.change"
] | 1,017,064 | 1,017,065 | u446436253 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
float nlist[1001] = {0};
int N, T, A;
int ansind = 0;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
nlist[i] = T - 0.006 * H;
}
float dist = 99999999;
for (int i = 0; i < N; i++) {
if (abs(nlist[i] - T)... | #include <bits/stdc++.h>
using namespace std;
int main() {
float nlist[1002] = {0};
int N, T, A;
int ansind = 0;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
nlist[i] = T - 0.006 * H;
}
float dist = 99999999;
for (int i = 0; i < N; i++) {
if (abs(nlist[i] - A)... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,017,074 | 1,017,075 | u180345531 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
int main() {
float nlist[1001] = {0};
int N, T, A;
int ansind = 0;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
nlist[i] = T - 0.006 * H;
}
float dist = 99999;
for (int i = 0; i < N; i++) {
if (abs(nlist[i] - T) < ... | #include <bits/stdc++.h>
using namespace std;
int main() {
float nlist[1002] = {0};
int N, T, A;
int ansind = 0;
cin >> N >> T >> A;
for (int i = 0; i < N; i++) {
int H;
cin >> H;
nlist[i] = T - 0.006 * H;
}
float dist = 99999999;
for (int i = 0; i < N; i++) {
if (abs(nlist[i] - A)... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"identifier.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,017,076 | 1,017,075 | u180345531 | cpp |
p03220 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, T, A, ans = 1;
int *H;
cin >> N;
cin >> T >> A;
H = new int[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 1; i < N; i++) {
long temp = ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int N, T, A, ans = 1;
int *H;
cin >> N;
cin >> T >> A;
H = new int[N];
for (int i = 0; i < N; i++) {
cin >> H[i];
}
for (int i = 1; i < N; i++) {
double temp = ... | [
"variable_declaration.type.primitive.change"
] | 1,017,080 | 1,017,081 | u650565403 | cpp |
p03220 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define fi first
#define se second... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, s, n) for (int i = s; i < n; i++)
#define repe(i, s, n) for (int i = s; i <= n; i++)
#define rrep(i, s, n) for (int i = (n)-1; i >= (s); i--)
#define all(v) (v).begin(), (v).end()
#define pb push_back
#define fi first
#define se second... | [
"variable_declaration.type.primitive.change"
] | 1,017,082 | 1,017,083 | u693027786 | cpp |
p03220 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
a *= 1000;
t *= 1000;
int ans0 = 0;
int ans1 = 1e9;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
h *= 1000;
int tmp = t - h * 6;
if (ans1... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, t, a;
cin >> n >> t >> a;
a *= 1000;
t *= 1000;
int ans0 = 0;
int ans1 = 1e9;
for (int i = 0; i < n; i++) {
int h;
cin >> h;
int tmp = t - h * 6;
if (ans1 > abs(tmp - a)... | [] | 1,017,085 | 1,017,086 | u006493569 | cpp |
p03220 | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
int H[N];
for (int i = 0; i < N; i++)
cin >> H[i];
double W[N];
for (int i = 0; i < N; i++)
W[i] = T - H[i] * 0.006;
int min = 1000000;
int ans;
for (int i = 0; i < N; i++... | #include <cmath>
#include <iostream>
using namespace std;
int main() {
int N;
cin >> N;
int T, A;
cin >> T >> A;
int H[N];
for (int i = 0; i < N; i++)
cin >> H[i];
double W[N];
for (int i = 0; i < N; i++)
W[i] = T - H[i] * 0.006;
double min = 1000000;
int ans;
for (int i = 0; i < N; ... | [
"variable_declaration.type.primitive.change"
] | 1,017,087 | 1,017,088 | u656527663 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.