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 |
|---|---|---|---|---|---|---|---|
p03222 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long int ll;
int h, w, k;
int p = 1000000007;
ll d[100005];
int interval[10];
int main() {
interval[0] = 1;
interval[1] = 2;
interval[2] = 3;
for (int i = 3; i <= 8; i++) {
interval[i] = interval[i - 1] + interval[i - 2];
}
cin >> h >> ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long int ll;
int h, w, k;
int p = 1000000007;
ll d[100005];
int interval[10];
int main() {
interval[0] = 1;
interval[1] = 2;
interval[2] = 3;
for (int i = 3; i <= 8; i++) {
interval[i] = interval[i - 1] + interval[i - 2];
}
cin >> h >> ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,018,942 | 1,018,943 | u515603926 | cpp |
p03222 | #include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
static ll imin = std::numeric_limits<ll>::min();
static ll imax = std::numeric_limits<ll>::max();
#... | #include <algorithm>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define ll long long
using namespace std;
static ll imin = std::numeric_limits<ll>::min();
static ll imax = std::numeric_limits<ll>::max();
#... | [] | 1,018,944 | 1,018,945 | u068362919 | cpp |
p03222 | #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const int mod = 1000000007;
int main() {
int h, w, kk;
cin >> h >> w >> kk;
int dp[105][10] = {};
dp[0][0] = 1;
rep(i, h) {
rep(j, w) {
rep(k, 1 << (w - 1)) {
bool ok = 1;
rep(l, w - 2) {
... | #include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
const int mod = 1000000007;
int main() {
int h, w, kk;
cin >> h >> w >> kk;
int dp[105][10] = {};
dp[0][0] = 1;
rep(i, h) {
rep(j, w) {
rep(k, 1 << (w - 1)) {
bool ok = 1;
rep(l, w - 2) {
... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 1,018,948 | 1,018,949 | u180262908 | cpp |
p03222 | #include <algorithm>
#include <iomanip> // std::setw(int), std::setfill(char)
#include <ios> // std::left, std::right
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int mod = 1000000007;
int H, W, ... | #include <algorithm>
#include <iomanip> // std::setw(int), std::setfill(char)
#include <ios> // std::left, std::right
#include <iostream>
#include <map>
#include <math.h>
#include <sstream>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main() {
int mod = 1000000007;
int H, W, ... | [] | 1,018,952 | 1,018,953 | u848504701 | cpp |
p03212 | #include <iostream>
using namespace std;
int S;
int ans;
void dfs(long long x, int mask) {
if (x >= S)
return;
if (mask == 7)
ans++;
dfs(x * 10 + 3, mask | 1);
dfs(x * 10 + 5, mask | 2);
dfs(x * 10 + 7, mask | 4);
}
int main() {
ans = 0;
cin >> S;
dfs(0, 0);
cout << ans << endl;
return 0;
} | #include <iostream>
using namespace std;
int S;
int ans;
void dfs(long long x, int mask) {
if (x > S)
return;
if (mask == 7)
ans++;
dfs(x * 10 + 3, mask | 1);
dfs(x * 10 + 5, mask | 2);
dfs(x * 10 + 7, mask | 4);
}
int main() {
ans = 0;
cin >> S;
dfs(0, 0);
cout << ans << endl;
return 0;
} | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,018,959 | 1,018,960 | u810978770 | cpp |
p03212 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <string>
#include <vector>
using namespace std;
#define REP(i, b, e) for (ll i = (ll)b; i < (ll)e; i++)
#define rep0(i, n) REP(i,... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <string>
#include <vector>
using namespace std;
#define REP(i, b, e) for (ll i = (ll)b; i < (ll)e; i++)
#define rep0(i, n) REP(i,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,018,969 | 1,018,970 | u297045966 | cpp |
p03212 | #include <iostream>
using namespace std;
int foo[30000];
int main() {
int n, k = 0, ans = 0;
int a, b, c, d, e, f, g, h, i;
const int data[4] = {0, 3, 5, 7};
int cnt[4] = {0, 0, 0, 0};
cin >> n;
for (a = 0; a < 4; a++) {
cnt[a]++;
for (b = a ? 1 : 0; b < 4; b++) {
cnt[b]++;
for (c = b ... | #include <iostream>
using namespace std;
int foo[30000];
int main() {
int n, k = 0, ans = 0;
int a, b, c, d, e, f, g, h, i;
const int data[4] = {0, 3, 5, 7};
int cnt[4] = {0, 0, 0, 0};
cin >> n;
for (a = 0; a < 4; a++) {
cnt[a]++;
for (b = a ? 1 : 0; b < 4; b++) {
cnt[b]++;
for (c = b ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,018,981 | 1,018,982 | u053360288 | cpp |
p03212 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
#define INF (1 << 30)
#define INFLL (1ll << 60)
typedef pair<int, int> P;
typedef pair<int, P> E;
#define MOD (1000000007ll)
#define l_ength size
void mul_mod(ll &a, ll b) {
a *= b;
a %= MOD;
}
void add_mod(ll &a, ll b) {
b += MOD;
a += b;
... | [
"literal.number.change",
"variable_declaration.value.change"
] | 1,018,985 | 1,018,986 | u548624367 | cpp |
p03212 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
vector<string> s;
void p(int d, string r) {
if (d == 9)
return;
s.push_back(r + "3");
p(d + 1, r + "3");
s.push_back(... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
vector<string> s;
void p(int d, string r) {
if (d == 9)
return;
s.push_back(r + "3");
p(d + 1, r + "3");
s.push_back(... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,018,987 | 1,018,988 | u458187055 | cpp |
p03212 | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, (n))
typedef long long ll;
using namespace std;
int n, ans;
bool is753(int x) {
bool is7 = false, is5 = false, is3 = false;
while (x) {
int num = x % 10;
if (num == 7)
is7 = true;
else if (n... | #include <bits/stdc++.h>
#define REP(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) REP(i, 0, (n))
typedef long long ll;
using namespace std;
int n, ans;
bool is753(int x) {
bool is7 = false, is5 = false, is3 = false;
while (x) {
int num = x % 10;
if (num == 7)
is7 = true;
else if (n... | [
"literal.number.change",
"assignment.value.change"
] | 1,018,993 | 1,018,994 | u658655325 | cpp |
p03212 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int dfs(long long n, string s, bool f3, bool f5, bool f7) {
if (n <= stoll(s))
return 0;
int ans = 0;
if (f3 && f5 && f7) {
ans++;
}
ans += dfs(n, "3" + s, true, f5, f7);
ans += dfs(n, "5" + s, f3, true, f7);
ans += dfs(n, "7" + s... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
int dfs(long long n, string s, bool f3, bool f5, bool f7) {
if (n < stoll(s))
return 0;
int ans = 0;
if (f3 && f5 && f7) {
ans++;
}
ans += dfs(n, "3" + s, true, f5, f7);
ans += dfs(n, "5" + s, f3, true, f7);
ans += dfs(n, "7" + s,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,018,995 | 1,018,996 | u330661451 | cpp |
p03212 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a; i >= b; i--)
#define fore(i, a) for (auto &i : a)
#define all(x) (x).begin(), (x).end()
#pragma GCC optimize("-O3")
using namespace std;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);... | [
"literal.number.change",
"call.arguments.change"
] | 1,018,999 | 1,019,000 | u141378465 | cpp |
p03212 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
bool check_753(ll x) {
string s;
s = to_string(x);
bool has7, has5, has3;
has3 = has5 = has7 = false;
for (ll i = 0; i < s.size(); ++i) {
if (s[i] == '3') {
has3 = true;
} else if (s[i] == '5') {
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
bool check_753(ll x) {
string s;
s = to_string(x);
bool has7, has5, has3;
has3 = has5 = has7 = false;
for (ll i = 0; i < s.size(); ++i) {
if (s[i] == '3') {
has3 = true;
} else if (s[i] == '5') {
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change",
"control_flow.branch.if.condition.change"
] | 1,019,007 | 1,019,008 | u642210599 | cpp |
p03212 | #define _USE_MATH_DEFINES // M_PI等のフラグ
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
string replace_with_str(string str, string str_... | #define _USE_MATH_DEFINES // M_PI等のフラグ
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <string>
#include <vector>
#define MOD 1000000007
#define COUNTOF(array) (sizeof(array) / sizeof(array[0]))
using namespace std;
string replace_with_str(string str, string str_... | [
"control_flow.return.add"
] | 1,019,009 | 1,019,010 | u687044304 | cpp |
p03212 | #include <bits/stdc++.h>
using namespace std;
int put_number(int number, int add, int times, int dp);
int n, th = 0, fi = 0, se = 0, depth, x;
int main(void) {
int count = 0;
int top;
cin >> n;
depth = 0;
x = n;
while (n != 0) {
depth++;
n /= 10;
}
for (int i = 1; i < depth - 1; i++) {
th =... | #include <bits/stdc++.h>
using namespace std;
int put_number(int number, int add, int times, int dp);
int n, th = 0, fi = 0, se = 0, depth, x;
int main(void) {
int count = 0;
int top;
cin >> n;
depth = 0;
x = n;
while (n != 0) {
depth++;
n /= 10;
}
for (int i = 1; i < depth; i++) {
th = 1;
... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,019,013 | 1,019,014 | u977360761 | cpp |
p03212 | #include <iostream>
#include <string>
using namespace std;
int check_num(int i) {
int n;
bool a, b, c;
a = b = c = false;
while (i > 0) {
n = i % 10;
i /= 10;
if (n == 3)
a = true;
else if (n == 5)
b = true;
else if (n == 7)
c = true;
else
return 0;
}
return ... | #include <iostream>
#include <string>
using namespace std;
int check_num(int i) {
int n;
bool a, b, c;
a = b = c = false;
while (i > 0) {
n = i % 10;
i /= 10;
if (n == 3)
a = true;
else if (n == 5)
b = true;
else if (n == 7)
c = true;
else
return 0;
}
return ... | [
"variable_declaration.type.primitive.change"
] | 1,019,015 | 1,019,016 | u031625092 | cpp |
p03212 | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool is753(int x) {
bool is3, is5, is7;
is3 = is5 = is7 = false;
while (x > 0) {
int t = x % 10;
if (t == 3)
is3 = true;
else if (t == 5)
is5 = true;
else if (t == 7)
is7 = true;
else
retu... | #include <algorithm>
#include <iostream>
#include <string>
using namespace std;
bool is753(int x) {
bool is3, is5, is7;
is3 = is5 = is7 = false;
while (x > 0) {
int t = x % 10;
if (t == 3)
is3 = true;
else if (t == 5)
is5 = true;
else if (t == 7)
is7 = true;
else
retu... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,019,023 | 1,019,024 | u869644355 | cpp |
p03212 |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define r... |
#include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define ll long long
#define ull unsigned long long
#define r... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,019,042 | 1,019,043 | u426855695 | cpp |
p03212 | #include <cmath>
#include <iostream>
using namespace std;
void addVal(int *digit, int index) {
switch (digit[index]) {
case 0:
digit[index] = 3;
break;
case 3:
digit[index] = 5;
break;
case 5:
digit[index] = 7;
break;
case 7:
digit[index] = 3;
addVal(digit, ++index);
break... | #include <cmath>
#include <iostream>
using namespace std;
void addVal(int *digit, int index) {
switch (digit[index]) {
case 0:
digit[index] = 3;
break;
case 3:
digit[index] = 5;
break;
case 5:
digit[index] = 7;
break;
case 7:
digit[index] = 3;
addVal(digit, ++index);
break... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,019,046 | 1,019,047 | u777853124 | cpp |
p03221 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define ALL(c) c.begin(), c.end()
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<pa... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
#define REP(i, n) for (int i = 0; i < (n); i++)
#define PB push_back
#define MP make_pair
#define FI first
#define SE second
#define ALL(c) c.begin(), c.end()
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<vector<pa... | [] | 1,019,048 | 1,019,049 | u973997867 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
struct city {
int num;
int pre;
int year;
bool operator<(const city &right) const { return num > right.num; }
};
int main() {
int N = 0, M = 0;
cin >> N >> M;
vector<city> c(M);
for (int m = 0; m < M; m++) {
int pr = 0, ye = 0;
cin >> pr >> ye;
... | #include <bits/stdc++.h>
using namespace std;
struct city {
int num;
int pre;
int year;
bool operator<(const city &right) const { return year < right.year; }
};
int main() {
int N = 0, M = 0;
cin >> N >> M;
vector<city> c(M);
for (int m = 0; m < M; m++) {
int pr = 0, ye = 0;
cin >> pr >> ye;
... | [
"function.return_value.change",
"expression.operation.binary.change"
] | 1,019,050 | 1,019,051 | u501148202 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
struct city {
int num;
int pre;
int year;
bool operator<(const city &right) const { return num < right.num; }
};
int main() {
int N = 0, M = 0;
cin >> N >> M;
vector<city> c(M);
for (int m = 0; m < M; m++) {
int pr = 0, ye = 0;
cin >> pr >> ye;
... | #include <bits/stdc++.h>
using namespace std;
struct city {
int num;
int pre;
int year;
bool operator<(const city &right) const { return year < right.year; }
};
int main() {
int N = 0, M = 0;
cin >> N >> M;
vector<city> c(M);
for (int m = 0; m < M; m++) {
int pr = 0, ye = 0;
cin >> pr >> ye;
... | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,019,052 | 1,019,051 | u501148202 | cpp |
p03221 | #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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | #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 FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long... | [
"expression.operation.binary.remove"
] | 1,019,057 | 1,019,058 | u559823804 | cpp |
p03221 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
int mod = 1e9 + 7;
signed main() {
int n, m;
cin >> n >> m;
int p[100000];
int y[100000];
vector<int> yd[100001];
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
yd[p[i]].push_back(y[i]);
}
for (int i = 0; ... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
int mod = 1e9 + 7;
signed main() {
int n, m;
cin >> n >> m;
int p[100000];
int y[100000];
vector<int> yd[100001];
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
yd[p[i]].push_back(y[i]);
}
for (int i = 0; ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,019,064 | 1,019,063 | u890465662 | cpp |
p03221 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
int mod = 1e9 + 7;
signed main() {
int n, m;
cin >> n >> m;
int p[100000];
int y[100000];
vector<int> yd[100001];
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
yd[p[i]].push_back(y[i]);
}
for (int i = 0; ... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define endl '\n'
int mod = 1e9 + 7;
signed main() {
int n, m;
cin >> n >> m;
int p[100000];
int y[100000];
vector<int> yd[100001];
for (int i = 0; i < m; i++) {
cin >> p[i] >> y[i];
yd[p[i]].push_back(y[i]);
}
for (int i = 0; ... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,019,065 | 1,019,063 | u890465662 | cpp |
p03221 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<long long>> v(m, vector<long long>(2));
vector<vector<long long>> w(n + 1);
for (int i = 0; i < m; i++) {
cin >> v[i][0] >> v[i][1];
w[v[i][0]].push_b... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<vector<long long>> v(m, vector<long long>(2));
vector<vector<long long>> w(n + 1);
for (int i = 0; i < m; i++) {
cin >> v[i][0] >> v[i][1];
w[v[i][0]].push_b... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,019,072 | 1,019,073 | u681557252 | cpp |
p03221 | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | //#include <bits/stdc++.h>
//#include <stdio.h>
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#... | [
"identifier.change",
"call.arguments.change"
] | 1,019,091 | 1,019,092 | u057611820 | cpp |
p03221 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define N 100005
int n, m, p[N],
y[N]; // n個の県にm個の市。市iはy[i]年に誕生していて県p[i]に属している
vector<int> vt[N];
int main() {
int i, k;
cin >> n >> m;
for (i = 0; i < m; i++) { //県ごとのvector
cin >> p[i] >> y[i];
vt[p[i... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
#define N 100005
int n, m, p[N],
y[N]; // n個の県にm個の市。市iはy[i]年に誕生していて県p[i]に属している
vector<int> vt[N];
int main() {
int i, k;
cin >> n >> m;
for (i = 0; i < m; i++) { //県ごとのvector
cin >> p[i] >> y[i];
vt[p[i... | [
"literal.number.change",
"assignment.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,019,095 | 1,019,096 | u467763786 | cpp |
p03221 | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
typedef long long ll;
typedef pair<int, int> P;
int main()... | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
typedef long long ll;
typedef pair<int, int> P;
int main()... | [] | 1,019,097 | 1,019,098 | u601825761 | cpp |
p03221 | #include <algorithm>
#include <cstdio>
#include <iostream>
#define f first
#define s second
using namespace std;
typedef pair<pair<int, int>, pair<int, int>> P;
bool PC(P &f, P &s) { return f.s.s < s.s.s; }
int main() {
int n, m, p, y;
P a[100010];
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> p >>... | #include <algorithm>
#include <cstdio>
#include <iostream>
#define f first
#define s second
using namespace std;
typedef pair<pair<int, int>, pair<int, int>> P;
bool PC(P &f, P &s) { return f.s.s < s.s.s; }
int main() {
int n, m, p, y;
P a[100010];
cin >> n >> m;
for (int i = 0; i < m; i++) {
cin >> p >>... | [
"call.arguments.change"
] | 1,019,099 | 1,019,100 | u601082779 | cpp |
p03221 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n)-1; i >= 0; i--)
#define... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 1,019,101 | 1,019,102 | u472675932 | cpp |
p03221 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
struct City {
int index;
int P;
int Y;
int id_suffix;
};
int main() {
int N, M, i;
cin >> N >> M;
int P_i, Y_i;
City cities[M];
for (i = 0; i < M; i++) {
cin >> cities[i].P >> cities[i].Y;
cit... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
struct City {
int index;
int P;
int Y;
int id_suffix;
};
int main() {
int N, M, i;
cin >> N >> M;
int P_i, Y_i;
City cities[M];
for (i = 0; i < M; i++) {
cin >> cities[i].P >> cities[i].Y;
cit... | [
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,019,113 | 1,019,114 | u891876603 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
int main() {
int N, M, x;
long long ans;
cin >> N >> M;
int P[M], Y[M];
vector<int> BY[N + 1];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
BY[P[i]].push_back(Y[i]);
}
for (int i = 1; i <= N; i++) {
so... | #include <bits/stdc++.h>
using namespace std;
#define ALL(a) (a).begin(), (a).end()
int main() {
int N, M, x;
long long ans;
cin >> N >> M;
int P[M], Y[M];
vector<int> BY[N + 1];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
BY[P[i]].push_back(Y[i]);
}
for (int i = 1; i <= N; i++) {
so... | [
"assignment.change"
] | 1,019,117 | 1,019,116 | u454145409 | 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>> arr[n];
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
p--;
arr[p].push_back(make_pair(y, i));
}
for (int i = 0; i < n; i++)
sort(arr[i].begin(), a... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> arr[n];
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
p--;
arr[p].push_back(make_pair(y, i));
}
for (int i = 0; i < n; i++)
sort(arr[i].begin(), a... | [
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 1,019,118 | 1,019,119 | u596047270 | cpp |
p03221 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define int long long
signed main() {
int n, m;
cin >> n >> m;
map<int, vector<int>> mp;
vector<pair<int, int>> pa;
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
mp[p].push_back(y);
pair<i... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define int long long
signed main() {
int n, m;
cin >> n >> m;
map<int, vector<int>> mp;
vector<pair<int, int>> pa;
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
mp[p].push_back(y);
pair<i... | [
"literal.string.change",
"call.arguments.change",
"io.output.change",
"literal.number.change",
"expression.operation.binary.change"
] | 1,019,122 | 1,019,123 | u612721349 | cpp |
p03221 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define int long long
signed main() {
int n, m;
cin >> n >> m;
map<int, vector<int>> mp;
vector<pair<int, int>> pa;
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
mp[p].push_back(y);
pair<i... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
#define int long long
signed main() {
int n, m;
cin >> n >> m;
map<int, vector<int>> mp;
vector<pair<int, int>> pa;
for (int i = 0; i < m; i++) {
int p, y;
cin >> p >> y;
mp[p].push_back(y);
pair<i... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 1,019,124 | 1,019,123 | u612721349 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
int P[100000], Y[100000];
vector<int> sortedY[100001];
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
sortedY[P[i]].push_back(Y[i]);
}
for (int i = 1; i < N; i++) {
sort(sortedY[i].begin(), sortedY[i].end()... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
int P[100000], Y[100000];
vector<int> sortedY[100001];
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
sortedY[P[i]].push_back(Y[i]);
}
for (int i = 1; i <= N; i++) {
sort(sortedY[i].begin(), sortedY[i].end(... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,019,129 | 1,019,130 | u005580749 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
int P[100000], Y[100000];
vector<int> sortedY[100001];
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
sortedY[P[i]].push_back(Y[i]);
}
for (int i = 1; i <= M; i++) {
sort(sortedY[i].begin(), sortedY[i].end(... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
int P[100000], Y[100000];
vector<int> sortedY[100001];
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
sortedY[P[i]].push_back(Y[i]);
}
for (int i = 1; i <= N; i++) {
sort(sortedY[i].begin(), sortedY[i].end(... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,019,131 | 1,019,130 | u005580749 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
int P[100000], Y[100000];
vector<int> sortedY[100000];
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
sortedY[P[i]].push_back(Y[i]);
}
for (int i = 0; i < M; i++) {
sort(sortedY[i].begin(), sortedY[i].end()... | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
int P[100000], Y[100000];
vector<int> sortedY[100001];
cin >> N >> M;
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
sortedY[P[i]].push_back(Y[i]);
}
for (int i = 1; i <= N; i++) {
sort(sortedY[i].begin(), sortedY[i].end(... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change"
] | 1,019,132 | 1,019,130 | u005580749 | cpp |
p03221 | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MAX 100000
using namespace std;
int main() {
int N, M;
int P[MAX];
int Y[MAX];
int YEAR[MAX];
cin >> N >> M;
vector<int> res[MAX];
rep(i, M) {
cin >> P[i] >> Y[i];
res[P[i]].push_back(Y[i]);
}
r... | #include <bits/stdc++.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
#define MAX 100000
using namespace std;
int main() {
int N, M;
int P[MAX];
int Y[MAX];
int YEAR[MAX];
cin >> N >> M;
vector<int> res[MAX + 1];
rep(i, M) {
cin >> P[i] >> Y[i];
res[P[i]].push_back(Y[i]);
}
... | [
"variable_declaration.array_dimensions.change",
"expression.operation.binary.add"
] | 1,019,145 | 1,019,146 | u498401785 | cpp |
p03221 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
int P[100000], Y[100000];
cin >> N >> M;
for (int i = 0; i < M; i++)
cin >> P[i] >> Y[i];
vector<int> name[100000];
for (int i = 0; i < M; i++)
name[P[i]].push_back(Y[i]);
... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
int P[100000], Y[100000];
cin >> N >> M;
for (int i = 0; i < M; i++)
cin >> P[i] >> Y[i];
vector<int> name[100001];
for (int i = 0; i < M; i++)
name[P[i]].push_back(Y[i]);
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,019,147 | 1,019,148 | u338225045 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = n - 1; i >= (0); i--)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define each(i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vint;
typedef pair<int, int> pint;
typedef vector<pint> vpint;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = n - 1; i >= (0); i--)
#define reps(i, f, n) for (int i = (f); i < (n); i++)
#define each(i... | [] | 1,019,153 | 1,019,154 | u029876051 | cpp |
p03221 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
int P[100000], Y[100000];
vector<ll> h[100001];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
h[P[i]].push_back(Y[i]);
}
for (int i = ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
int P[100000], Y[100000];
vector<ll> h[100001];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
h[P[i]].push_back(Y[i]);
}
for (int i = ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,019,163 | 1,019,164 | u155088988 | cpp |
p03221 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
int P[100000], Y[100000];
vector<ll> h[100001];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
h[P[i]].push_back(Y[i]);
}
for (int i = ... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
int main() {
int N, M;
cin >> N >> M;
int P[100000], Y[100000];
vector<ll> h[100001];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
h[P[i]].push_back(Y[i]);
}
for (int i = ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,019,165 | 1,019,164 | u155088988 | cpp |
p03221 | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef struct city {
int i;
int p;
int y;
int s;
} city;
int main() {
int n, m;
cin >> n >> m;
city c[m];
rep(i, m) {
int p, y;
cin >> p >> y;
c[i].i = i... | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef struct city {
int i;
int p;
int y;
int s;
} city;
int main() {
int n, m;
cin >> n >> m;
city c[m];
rep(i, m) {
int p, y;
cin >> p >> y;
c[i].i = i... | [
"assignment.change"
] | 1,019,173 | 1,019,174 | u431047462 | cpp |
p03221 | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef struct city {
int i;
int p;
int y;
int s;
} city;
int main() {
int n, m;
cin >> n >> m;
city c[m];
rep(i, m) {
int p, y;
cin >> p >> y;
c[i].i = i... | #include <algorithm>
#include <iomanip>
#include <iostream>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef struct city {
int i;
int p;
int y;
int s;
} city;
int main() {
int n, m;
cin >> n >> m;
city c[m];
rep(i, m) {
int p, y;
cin >> p >> y;
c[i].i = i... | [
"assignment.change"
] | 1,019,175 | 1,019,174 | u431047462 | cpp |
p03221 | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
// Pは所属する県の番号、Yは誕生年,indexは入力時の順番
// Count各県ごとの市をカウントするのに用いる。例えば、Count[0]は県1のためのスペースである。
int P[m], Y[m], Count[n + 1], Index[m];
for (int i = 0; i < m; i++)
scanf("%d %d", P + i, Y + i);
for (int... | #include <algorithm>
#include <stdio.h>
using namespace std;
int main() {
int n, m;
scanf("%d %d", &n, &m);
// Pは所属する県の番号、Yは誕生年,indexは入力時の順番
// Count各県ごとの市をカウントするのに用いる。例えば、Count[0]は県1のためのスペースである。
int P[m], Y[m], Count[n + 1] = {0}, Index[m];
for (int i = 0; i < m; i++)
scanf("%d %d", P + i, Y + i);
fo... | [
"variable_declaration.value.change"
] | 1,019,188 | 1,019,189 | u086752773 | cpp |
p03221 | #include <iomanip>
#include <iostream>
#include <list>
#include <sstream>
#include <string>
using namespace std;
class City {
public:
int index;
int prefecture;
long year;
string s;
City(int a, int b, long c) {
index = a;
prefecture = b;
year = c;
}
bool operator<(const City &ref) const { ... | #include <iomanip>
#include <iostream>
#include <list>
#include <sstream>
#include <string>
using namespace std;
class City {
public:
int index;
int prefecture;
long year;
string s;
City(int a, int b, long c) {
index = a;
prefecture = b;
year = c;
}
bool operator<(const City &ref) const { ... | [
"expression.operation.binary.remove"
] | 1,019,202 | 1,019,203 | u149945867 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
struct city {
int id1;
int id2;
int year;
int num;
};
city cities[10002];
bool cmp1(city a, city b) {
if (a.id1 != b.id1) {
return a.id1 < b.id1;
} else {
return a.year < b.year;
}
}
bool cmp2(city a, city b) { return a.num < b.num; }
void add0(int a) ... | #include <bits/stdc++.h>
using namespace std;
struct city {
int id1;
int id2;
int year;
int num;
};
city cities[100002];
bool cmp1(city a, city b) {
if (a.id1 != b.id1) {
return a.id1 < b.id1;
} else {
return a.year < b.year;
}
}
bool cmp2(city a, city b) { return a.num < b.num; }
void add0(int a)... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 1,019,209 | 1,019,208 | u547457320 | cpp |
p03221 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int P[M + 1];
int Y[M + 1];
vector<int> Y_num[M + 1];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
Y_num[P[i]].push_back(Y[i]);
}
for (int i = 0; i < N... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
int P[M + 1];
int Y[M + 1];
vector<int> Y_num[N + 1];
for (int i = 0; i < M; i++) {
cin >> P[i] >> Y[i];
Y_num[P[i]].push_back(Y[i]);
}
for (int i = 0; i < N... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,019,220 | 1,019,221 | u701098435 | cpp |
p03221 | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
int main() {
int a = 0, b = 0, c =... | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
typedef pair<int, int> pii;
int main() {
int a = 0, b = 0, c =... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,019,232 | 1,019,233 | u142996493 | cpp |
p03222 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p_int;
typedef pair<ll, ll> p_ll;
typedef tuple<ll, ll, ll> t3_ll;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> p_int;
typedef pair<ll, ll> p_ll;
typedef tuple<ll, ll, ll> t3_ll;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
int prime[] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41,
43, 47, 53, 59, 61, 67, 71, 73,... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,019,240 | 1,019,241 | u764234894 | cpp |
p03222 | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
#include <deque>
#i... | /* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
#include <random>
// container library
#include <array>
#include <bitset>
#include <deque>
#i... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,019,244 | 1,019,245 | u853132965 | cpp |
p03222 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, K;
cin >> h >> w >> K;
int dp[w + 1][h + 1];
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < h + 1; j++) {
dp[i][j] = 0;
}
}
dp[0][0] = 1;
f... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, K;
cin >> h >> w >> K;
int dp[w + 1][h + 1];
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < h + 1; j++) {
dp[i][j] = 0;
}
}
dp[0][0] = 1;
f... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove",
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,019,250 | 1,019,251 | u457198113 | cpp |
p03222 | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, K;
cin >> h >> w >> K;
int dp[w + 1][h + 1];
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < h + 1; j++) {
dp[i][j] = 0;
}
}
dp[0][0] = 1;
f... | #include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, K;
cin >> h >> w >> K;
int dp[w + 1][h + 1];
for (int i = 0; i < w + 1; i++) {
for (int j = 0; j < h + 1; j++) {
dp[i][j] = 0;
}
}
dp[0][0] = 1;
f... | [
"identifier.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,019,252 | 1,019,251 | u457198113 | cpp |
p03222 | #include <iostream>
using namespace std;
const long long MOD = 1000000007;
long long dp[110][10];
long long fib[110];
void make_fib(int n) {
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i <= n; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
}
int main() {
int h, w, k;
cin >> h >> w >> k;
dp[1][0] = 1;
mak... | #include <iostream>
using namespace std;
const long long MOD = 1000000007;
long long dp[10][110];
long long fib[10];
void make_fib(int n) {
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i <= n; i++) {
fib[i] = fib[i - 1] + fib[i - 2];
}
}
int main() {
int h, w, k;
cin >> h >> w >> k;
dp[1][0] = 1;
make... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 1,019,259 | 1,019,260 | u774622463 | cpp |
p03222 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORE(i, a, b) for (int i = (a); i <= (b); ++i)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repe(i, n) for (int i = 0; i <= (n); ++i)
#define ALL(v) (v).begin(), (v).end()
#defin... | [
"control_flow.branch.if.condition.change"
] | 1,019,261 | 1,019,262 | u995997203 | cpp |
p03222 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int bi(int n, int k) {
if (k == 1 && n % 2 == 0) {
return 0;
}
if (k == 1 && n % 2 == 1) {
return 1;
}
if (k >= 2) {
return bi(n / 2, k - 1);
}
}
int power(int n) {
if (n ==... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int bi(int n, int k) {
if (k == 1 && n % 2 == 0) {
return 0;
}
if (k == 1 && n % 2 == 1) {
return 1;
}
if (k >= 2) {
return bi(n / 2, k - 1);
}
}
int power(int n) {
if (n ==... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 1,019,272 | 1,019,273 | u139615757 | cpp |
p03222 | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int bi(int n, int k) {
if (k == 1 && n % 2 == 0) {
return 0;
}
if (k == 1 && n % 2 == 1) {
return 1;
}
if (k >= 2) {
return bi(n / 2, k - 1);
}
}
int power(int n) {
if (n ==... | #include <algorithm>
#include <cstdlib>
#include <iostream>
#include <string>
#include <utility>
using namespace std;
int bi(int n, int k) {
if (k == 1 && n % 2 == 0) {
return 0;
}
if (k == 1 && n % 2 == 1) {
return 1;
}
if (k >= 2) {
return bi(n / 2, k - 1);
}
}
int power(int n) {
if (n ==... | [
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 1,019,274 | 1,019,273 | u139615757 | cpp |
p03222 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define M 1000000007ULL
unsigned long long dp[201][10];
unsigned long long fibt[10];
int main() {
fibt[1] = 1;
fibt[2] = 1;
for (int i = 3; i < 10; i++) {
fibt[i] = fibt[i - 1] + fibt[i - 2]... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define M 1000000007ULL
unsigned long long dp[201][10];
unsigned long long fibt[10];
int main() {
fibt[1] = 1;
fibt[2] = 1;
for (int i = 3; i < 10; i++) {
fibt[i] = fibt[i - 1] + fibt[i - 2]... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,019,278 | 1,019,279 | u453764945 | cpp |
p03222 | #include <iostream>
#include <limits.h>
using namespace std;
int h, w, k;
long long dp[105][10][10];
int inf = 1000000007;
int F(int n) {
if (n <= 2)
return 1;
else
return F(n - 1) + F(n - 2);
}
int C(int a, int b) {
if (b == 0 || b == w + 1)
return 0;
else if (min(b - 1, w - b) >= 2)
return ... | #include <iostream>
#include <limits.h>
using namespace std;
int h, w, k;
long long dp[105][10][10];
int inf = 1000000007;
int F(int n) {
if (n <= 2)
return 1;
else
return F(n - 1) + F(n - 2);
}
long long C(int a, int b) {
if (b == 0 || b == w + 1)
return 0;
else if (min(b - 1, w - b) >= 2)
r... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"identifier.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,019,283 | 1,019,284 | u921168761 | cpp |
p03222 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, K;
cin >> h >> w >> K;
ll dp[10] = {}, nxt[10] = {};
dp[0] = 1;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++)
nxt[j] = ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int h, w, K;
cin >> h >> w >> K;
ll dp[10] = {}, nxt[10] = {};
dp[0] = 1;
for (int i = 0; i < h; i++) {
for (int j = 0; j < w; j++)
nxt[j] = ... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,019,288 | 1,019,289 | u869282786 | cpp |
p03222 | #include <iostream>
#include <map>
#include <tuple>
#include <vector>
using ull = unsigned long long;
static ull const Mod = 1000000007;
std::vector<ull> Fib;
std::map<std::tuple<int, int, int>, int> Memo;
ull Amida1(int W, int J, int K) {
if (J < 1 || K < 1 || J > W || K > W || std::abs(J - K) > 1) {
return 0... | #include <iostream>
#include <map>
#include <tuple>
#include <vector>
using ull = unsigned long long;
static ull const Mod = 1000000007;
std::vector<ull> Fib;
std::map<std::tuple<int, int, int>, int> Memo;
ull Amida1(int W, int J, int K) {
if (J < 1 || K < 1 || J > W || K > W || std::abs(J - K) > 1) {
return 0... | [
"expression.operation.binary.add"
] | 1,019,292 | 1,019,293 | u749907841 | cpp |
p03222 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int MAX_H = 1e3 + 10, MAX_W = 10;
ll fib[1000];
void calcFib() {
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i < 1000; ++i) {
fib[i] = fib[i - 1] + fib[i - 2] % MOD;
}
}
vector<vector<ll>> matmul... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int MAX_H = 1e3 + 10, MAX_W = 10;
ll fib[1000];
void calcFib() {
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i < 1000; ++i) {
fib[i] = fib[i - 1] + fib[i - 2] % MOD;
}
}
vector<vector<ll>> matmul... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 1,019,294 | 1,019,295 | u391752022 | cpp |
p03222 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int MAX_H = 1e3 + 10, MAX_W = 10;
ll fib[1000];
void calcFib() {
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i < 1000; ++i) {
fib[i] = fib[i - 1] + fib[i - 2] % MOD;
}
}
vector<vector<ll>> matmul... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int MAX_H = 1e3 + 10, MAX_W = 10;
ll fib[1000];
void calcFib() {
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i < 1000; ++i) {
fib[i] = fib[i - 1] + fib[i - 2] % MOD;
}
}
vector<vector<ll>> matmul... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"expression.operator.compare.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,019,296 | 1,019,295 | u391752022 | cpp |
p03222 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int MAX_H = 1e3 + 10, MAX_W = 10;
ll fib[1000];
void calcFib() {
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i < 1000; ++i) {
fib[i] = fib[i - 1] + fib[i - 2] % MOD;
}
}
vector<vector<ll>> matmul... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int MAX_H = 1e3 + 10, MAX_W = 10;
ll fib[1000];
void calcFib() {
fib[0] = 1;
fib[1] = 1;
for (int i = 2; i < 1000; ++i) {
fib[i] = fib[i - 1] + fib[i - 2] % MOD;
}
}
vector<vector<ll>> matmul... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,019,297 | 1,019,295 | u391752022 | cpp |
p03222 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,019,298 | 1,019,299 | u423143252 | cpp |
p03222 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define REP(i, n... | [
"identifier.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"io.output.change"
] | 1,019,300 | 1,019,299 | u423143252 | cpp |
p03222 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll fib(int x);
ll f[100] = {0};
int main() {
int H, W, K;
cin >> H >> W >> K;
int dp[H + 1][W + 1];
for (int i = 0; i <= H; i++) {
for (int j = 0; j <= W; j++) {
dp[i][j] = 0;
}
}
dp[0][1] = 1;
for (int i = 0; i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll fib(int x);
ll f[100] = {0};
int main() {
int H, W, K;
cin >> H >> W >> K;
ll dp[H + 1][W + 1];
for (int i = 0; i <= H; i++) {
for (int j = 0; j <= W; j++) {
dp[i][j] = 0;
}
}
dp[0][1] = 1;
for (int i = 0; i <... | [
"variable_declaration.type.change"
] | 1,019,303 | 1,019,304 | u888717396 | cpp |
p03222 | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
const ll INF = 5e15;
const ll MOD = 1e9 + 7;
ll dp[200][11];
int main() {
ll H, W, K;
cin >> H >> W >> K;
dp[0][0] = 1;
for (ll i = 1; i <= H; i++) {
for (ll now = 0; now < W; now++) {
for (ll b = 0; b < (1 << (W... | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using P = pair<ll, ll>;
const ll INF = 5e15;
const ll MOD = 1e9 + 7;
ll dp[200][11];
int main() {
ll H, W, K;
cin >> H >> W >> K;
dp[0][0] = 1;
for (ll i = 1; i <= H; i++) {
for (ll now = 0; now < W; now++) {
for (ll b = 0; b < (1 << (W... | [
"control_flow.branch.if.condition.change"
] | 1,019,320 | 1,019,321 | u216962796 | cpp |
p03222 | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 1,019,328 | 1,019,329 | u213143275 | cpp |
p03222 | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.change"
] | 1,019,330 | 1,019,329 | u213143275 | cpp |
p03223 | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
... | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
using namespace std;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
... | [
"expression.unary.arithmetic.add"
] | 1,019,354 | 1,019,355 | u168774513 | cpp |
p03223 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#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 rep_r(i, s, n) for (int i = n - 1;... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <vector>
#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 rep_r(i, s, n) for (int i = n - 1;... | [
"identifier.change"
] | 1,019,356 | 1,019,357 | u685009987 | cpp |
p03223 | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, a[100000];
long long ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
if (n % 2 == 0) {
ans = 0;
for (int i = 0; i < n / 2; i++) {
ans -= a[i] * 2;
}
ans += a[n / ... | #include <algorithm>
#include <iostream>
using namespace std;
int main(void) {
int n, a[100000];
long long ans = 0;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a, a + n);
if (n % 2 == 0) {
ans = 0;
for (int i = 0; i < n / 2; i++) {
ans -= a[i] * 2;
}
ans += a[n / ... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 1,019,358 | 1,019,359 | u024809932 | cpp |
p03223 | #include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
int N;
long A[1 << 17];
main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A, A + N);
int L = 0, R = N - 1;
deque<long> P;
long ans = 0, sum = 0;
int witch = 0;
while (R >= L) {
if (wit... | #include <algorithm>
#include <deque>
#include <iostream>
#include <vector>
using namespace std;
int N;
long A[1 << 17];
main() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> A[i];
sort(A, A + N);
int L = 0, R = N - 1;
deque<long> P;
long ans = 0, sum = 0;
int witch = 0;
while (R >= L) {
if (wit... | [
"call.add",
"call.arguments.change"
] | 1,019,363 | 1,019,364 | u657913472 | cpp |
p03223 | #include <bits/stdc++.h>
using namespace std;
#define int long long
int calc(vector<int> &a) {
int res = 0;
int N = a.size();
for (int i = 0; i < N - 1; i++) {
res += abs(a[i] - a[i + 1]);
}
return res;
}
signed main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >>... | #include <bits/stdc++.h>
using namespace std;
#define int long long
int calc(vector<int> &a) {
int res = 0;
int N = a.size();
for (int i = 0; i < N - 1; i++) {
res += abs(a[i] - a[i + 1]);
}
return res;
}
signed main() {
int N;
cin >> N;
vector<int> a(N);
for (int i = 0; i < N; i++) {
cin >>... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,019,367 | 1,019,368 | u738450435 | cpp |
p03223 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N;
cin >> N;
vector<int> V(N);
rep(i, 0, N) cin >> V[i];
sort(V.begin(), V.end());
ll maxi = 0, sum = 0;
if (N % 2) {
... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = int(a); i < int(b); ++i)
using namespace std;
typedef long long ll;
int INF = (1LL << 30) - 1;
int MOD = 1e9 + 7;
main() {
int N;
cin >> N;
vector<int> V(N);
rep(i, 0, N) cin >> V[i];
sort(V.begin(), V.end());
ll maxi = 0, sum = 0;
if (N % 2) {
... | [
"identifier.change",
"io.output.change"
] | 1,019,387 | 1,019,388 | u157322125 | cpp |
p03223 | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9 + 7;
const i64 INF = 1e18 + 7;
signed main() {
int n;
cin >> n;
vector<i64> a(n);
for (auto &x : a)
cin >> x;
sort(a.begin(), a.end());
i64 ans = 0;
if (n % 2 == 0) {
for (int i = 0; i < n / 2 - 1; ++i)
... | #include <bits/stdc++.h>
using namespace std;
using i64 = int64_t;
const i64 MOD = 1e9 + 7;
const i64 INF = 1e18 + 7;
signed main() {
int n;
cin >> n;
vector<i64> a(n);
for (auto &x : a)
cin >> x;
sort(a.begin(), a.end());
i64 ans = 0;
if (n % 2 == 0) {
for (int i = 0; i < n / 2 - 1; ++i)
... | [
"expression.operation.unary.add",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,019,389 | 1,019,390 | u705918648 | cpp |
p03221 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define endl '\n'
#define ll long long
#define mod 1000000007
#define NCONS 100001
#define... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_set>
#include <vector>
#define endl '\n'
#define ll long long
#define mod 1000000007
#define NCONS 100001
#define... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,019,399 | 1,019,400 | u285118720 | cpp |
p03221 | #include <bits/stdc++.h>
#define rep(i, k, n) for (int i = k; i <= n; i++)
#define fi first
#define se second
using namespace std;
const int maxn = 100005;
int n, m;
pair<int, pair<int, int>> c[maxn];
string ans[maxn];
int num[maxn];
int main() {
scanf("%d%d", &n, &m);
rep(i, 1, m) {
scanf("%d%d", &c[i].se.fi, ... | #include <bits/stdc++.h>
#define rep(i, k, n) for (int i = k; i <= n; i++)
#define fi first
#define se second
using namespace std;
const int maxn = 100005;
int n, m;
pair<int, pair<int, int>> c[maxn];
string ans[maxn];
int num[maxn];
int main() {
scanf("%d%d", &n, &m);
rep(i, 1, m) {
scanf("%d%d", &c[i].se.fi, ... | [
"literal.number.change",
"assignment.variable.change",
"call.arguments.change"
] | 1,019,412 | 1,019,413 | u052685836 | cpp |
p03221 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fir first
#define sec second
using namespace std;
struct city {
int id;
int year;
int pref;
int order;
};
bool compyear(city l, city r) { return l.year < r.year; }
bool compid(city l, city r) { return l.id < r.id; }
int main() {
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define fir first
#define sec second
using namespace std;
struct city {
int id;
int year;
int pref;
int order;
};
bool compyear(city l, city r) { return l.year < r.year; }
bool compid(city l, city r) { return l.id < r.id; }
int main() {
... | [
"variable_declaration.array_dimensions.change",
"assignment.change"
] | 1,019,416 | 1,019,417 | u174404613 | cpp |
p03221 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 1,019,424 | 1,019,425 | u899220667 | cpp |
p03221 | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, beg... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"variable_access.subscript.index.change"
] | 1,019,426 | 1,019,425 | u899220667 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define inf 999999999
#define loop(i, a, b) for (int i = (a), i##len = (b); i < i##len; ++i)
#define rep(i, n) loop(i, 0, n)
#define lin long long
#define lfl long double
struct City {
public:
lin i;
lin p;
lin y;
lin id;
};
lin n, m;
lin id[100001];
int main(voi... | #include <bits/stdc++.h>
using namespace std;
#define inf 999999999
#define loop(i, a, b) for (int i = (a), i##len = (b); i < i##len; ++i)
#define rep(i, n) loop(i, 0, n)
#define lin long long
#define lfl long double
struct City {
public:
lin i;
lin p;
lin y;
lin id;
};
lin n, m;
lin id[100001];
int main(voi... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 1,019,427 | 1,019,428 | u762193256 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define inf 999999999
#define loop(i, a, b) for (int i = (a), i##len = (b); i < i##len; ++i)
#define rep(i, n) loop(i, 0, n)
#define lin long long
#define lfl long double
struct City {
public:
lin i;
lin p;
lin y;
lin id;
};
lin n, m;
lin id[100001];
int main(voi... | #include <bits/stdc++.h>
using namespace std;
#define inf 999999999
#define loop(i, a, b) for (int i = (a), i##len = (b); i < i##len; ++i)
#define rep(i, n) loop(i, 0, n)
#define lin long long
#define lfl long double
struct City {
public:
lin i;
lin p;
lin y;
lin id;
};
lin n, m;
lin id[100001];
int main(voi... | [
"misc.opposites",
"expression.operator.compare.change",
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"literal.string.change",
"io.output.change"
] | 1,019,429 | 1,019,428 | u762193256 | cpp |
p03221 | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int n, m;
vector<pair<int, int>> p[100005];
// int y[100005];
string num[100005];
int main(int argc, char const *argv[]) {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int ken... | #include <algorithm>
#include <iostream>
#include <limits.h>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int n, m;
vector<pair<int, int>> p[100005];
// int y[100005];
string num[100005];
int main(int argc, char const *argv[]) {
cin >> n >> m;
for (int i = 0; i < m; i++) {
int ken... | [
"control_flow.loop.for.condition.change"
] | 1,019,430 | 1,019,431 | u945017646 | cpp |
p03221 | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// typedef pair<int, int> P;
#define ll long ... | #include <algorithm>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
// typedef pair<int, int> P;
#define ll long ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"call.arguments.change"
] | 1,019,444 | 1,019,445 | u592610268 | cpp |
p03221 | #include <bits/stdc++.h>
#define Tree int h, int l, int r, int L, int R
#define left 2 * h, l, (l + r) / 2, L, R
#define right 2 * h + 1, (l + r) / 2 + 1, r, L, R
#define F first
#define S second
#define Pb push_back
using namespace std;
int n, m, f[100005];
pair<pair<int, int>, int> p[100005];
string ANS[100005];
main... | #include <bits/stdc++.h>
#define Tree int h, int l, int r, int L, int R
#define left 2 * h, l, (l + r) / 2, L, R
#define right 2 * h + 1, (l + r) / 2 + 1, r, L, R
#define F first
#define S second
#define Pb push_back
using namespace std;
int n, m, f[100005];
pair<pair<int, int>, int> p[100005];
string ANS[100005];
main... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,019,468 | 1,019,469 | u898791488 | cpp |
p03221 | #include <bits/stdc++.h>
#define MAXN 100010
using namespace std;
struct city {
int p, y, pt;
bool operator<(const city &a) const { return y < a.y; }
};
vector<city> a[MAXN], b;
int n, m, x, y;
bool cmp(city a, city b) { return a.pt < b.pt; }
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= m; i++)... | #include <bits/stdc++.h>
#define MAXN 100010
using namespace std;
struct city {
int p, y, pt;
bool operator<(const city &a) const { return y < a.y; }
};
vector<city> a[MAXN], b;
int n, m, x, y;
bool cmp(city a, city b) { return a.pt < b.pt; }
int main() {
scanf("%d %d", &n, &m);
for (int i = 1; i <= m; i++)... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"call.remove"
] | 1,019,482 | 1,019,483 | u869819014 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for (int i = a; i <= (b); ++i)
#define F2(i, a, b) for (int i = a; i < (b); ++i)
#define dF(i, a, b) for (int i = a; i >= (b); --i)
#define dF2(i, a, b) for (int i = a; i > (b); --i)
#define eF(i, u) for (int i = h[u]; i; i = nxt[i])
#define SZ(x) ((int)(... | #include <bits/stdc++.h>
using namespace std;
#define F(i, a, b) for (int i = a; i <= (b); ++i)
#define F2(i, a, b) for (int i = a; i < (b); ++i)
#define dF(i, a, b) for (int i = a; i >= (b); --i)
#define dF2(i, a, b) for (int i = a; i > (b); --i)
#define eF(i, u) for (int i = h[u]; i; i = nxt[i])
#define SZ(x) ((int)(... | [
"assignment.variable.change",
"identifier.change",
"variable_access.subscript.index.change"
] | 1,019,486 | 1,019,485 | u095826906 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, n, m) for (int i = (n); i < (m); i++)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = (n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vv... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define FOR(i, n, m) for (int i = (n); i < (m); i++)
#define REP(i, n) FOR(i, 0, n)
#define REPR(i, n) for (int i = (n); i >= 0; i--)
#define all(vec) vec.begin(), vec.end()
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vv... | [
"expression.operation.binary.add"
] | 1,019,487 | 1,019,488 | u437391064 | cpp |
p03221 |
#include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp> namespace mp =
//boost::multiprecision; //mp::cpp_intで宣言
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9 + 7)
#define i_5 (ll)(1E9 + 5)
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
else
return c + i_7;
}
typed... | #include <bits/stdc++.h>
//#include <boost/multiprecision/cpp_int.hpp> namespace mp =
//boost::multiprecision; //mp::cpp_intで宣言
using namespace std;
typedef long long ll;
#define i_7 (ll)(1E9 + 7)
#define i_5 (ll)(1E9 + 5)
ll mod(ll a) {
ll c = a % i_7;
if (c >= 0)
return c;
else
return c + i_7;
}
typede... | [
"identifier.change",
"variable_declaration.array_dimensions.change"
] | 1,019,491 | 1,019,492 | u763881112 | cpp |
p03221 | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_... | [
"assignment.change"
] | 1,019,503 | 1,019,504 | u360980679 | cpp |
p03221 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
string zeropad(string s) {
while (s.size() < 6) {
s = '0' + s;
}
return s;
}
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> P... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
string zeropad(string s) {
while (s.size() < 6) {
s = '0' + s;
}
return s;
}
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> P... | [
"identifier.change",
"io.output.change"
] | 1,019,507 | 1,019,508 | u261886891 | cpp |
p03223 |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include ... |
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <set>
#include ... | [
"expression.operator.change"
] | 1,019,509 | 1,019,510 | u516353059 | cpp |
p03223 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int n;
ll arr[100100];
int main() {
int i;
scanf("%D", &n);
for (i = 0; i < n; i++)
scanf("%lld", &arr[i]);
sort(arr, arr + n);
ll mini =
min(arr[n / 2] - arr[n / 2 - 1], ar... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
int n;
ll arr[100100];
int main() {
int i;
scanf("%d", &n);
for (i = 0; i < n; i++)
scanf("%lld", &arr[i]);
sort(arr, arr + n);
ll mini =
min(arr[n / 2] - arr[n / 2 - 1], ar... | [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change"
] | 1,019,522 | 1,019,523 | u038972376 | cpp |
p03223 | #include <algorithm>
#include <cstdio>
#include <cstring>
using std::sort;
int Abs(int x) { return x > 0 ? x : (-x); }
int a[100100];
int b[100100], t1 = 50000, t2 = 50002;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
b[50001] = a[1];
for ... | #include <algorithm>
#include <cstdio>
#include <cstring>
using std::sort;
int Abs(int x) { return x > 0 ? x : (-x); }
int a[100100];
int b[100100], t1 = 50000, t2 = 50002;
int main() {
int n;
scanf("%d", &n);
for (int i = 1; i <= n; ++i)
scanf("%d", &a[i]);
sort(a + 1, a + 1 + n);
b[50001] = a[1];
for ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"literal.number.change",
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 1,019,543 | 1,019,544 | u045245883 | cpp |
p03223 | // raja1999
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// setbase - cout << setbase (16)a; cout << 100 << ... | // raja1999
#include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
// setbase - cout << setbase (16)a; cout << 100 << ... | [
"variable_declaration.type.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"assignment.change",
"literal.number.change"
] | 1,019,545 | 1,019,546 | u996658417 | cpp |
p03224 | #include <iostream>
using namespace std;
int main(void) {
int n, x = 2, y = 1, z[500][500];
cin >> n;
while (n > y) {
y += x;
x++;
}
if (n != y) {
cout << y << "No" << endl;
return 0;
}
int a = 0, c = 0;
for (int i = 1; i <= n; i++) {
z[a][a + c] = i;
z[1 + a + c][a] = i;
c+... | #include <iostream>
using namespace std;
int main(void) {
int n, x = 2, y = 1, z[500][500];
cin >> n;
while (n > y) {
y += x;
x++;
}
if (n != y) {
cout << "No" << endl;
return 0;
}
int a = 0, c = 0;
for (int i = 1; i <= n; i++) {
z[a][a + c] = i;
z[1 + a + c][a] = i;
c++;
... | [
"expression.operation.binary.remove"
] | 1,019,567 | 1,019,568 | u024809932 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.