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 |
|---|---|---|---|---|---|---|---|
p03099 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 505, M = 50005, R = 100;
const ll inf = 0x3f3f3f3f3f3f3f3fll;
int read() {
int f = 1, g = 0;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
g = g ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 505, M = 50005, R = 100;
const ll inf = 0x3f3f3f3f3f3f3f3fll;
int read() {
int f = 1, g = 0;
char ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
f = -1;
for (; isdigit(ch); ch = getchar())
g = g ... | [
"identifier.change",
"call.arguments.change"
] | 910,854 | 910,855 | u933584582 | cpp |
p03099 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MV = 815;
const int ME = 1200006;
const ll oo = 1e18;
template <typename T> void cmin(T &x, const T &y) {
if (y < x)
x = y;
}
template <typename T> void cmax(T &x, const T &y) {
if (y > x)
x = y;
}
template <typename T> void... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MV = 815;
const int ME = 1200006;
const ll oo = 1e18;
template <typename T> void cmin(T &x, const T &y) {
if (y < x)
x = y;
}
template <typename T> void cmax(T &x, const T &y) {
if (y > x)
x = y;
}
template <typename T> void... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 910,862 | 910,863 | u781735900 | cpp |
p03099 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MV = 815;
const int ME = 1200006;
const ll oo = 1e18;
template <typename T> void cmin(T &x, const T &y) {
if (y < x)
x = y;
}
template <typename T> void cmax(T &x, const T &y) {
if (y > x)
x = y;
}
template <typename T> void... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MV = 815;
const int ME = 1200006;
const ll oo = 1e18;
template <typename T> void cmin(T &x, const T &y) {
if (y < x)
x = y;
}
template <typename T> void cmax(T &x, const T &y) {
if (y > x)
x = y;
}
template <typename T> void... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 910,864 | 910,863 | u781735900 | cpp |
p03099 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MV = 815;
const int ME = 1200006;
const ll oo = 1e18;
template <typename T> void cmin(T &x, const T &y) {
if (y < x)
x = y;
}
template <typename T> void cmax(T &x, const T &y) {
if (y > x)
x = y;
}
template <typename T> void... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MV = 815;
const int ME = 1200006;
const ll oo = 1e18;
template <typename T> void cmin(T &x, const T &y) {
if (y < x)
x = y;
}
template <typename T> void cmax(T &x, const T &y) {
if (y > x)
x = y;
}
template <typename T> void... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 910,864 | 910,865 | u781735900 | cpp |
p03099 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct edge {
int v, nxt, f;
ll c;
} e[2 * 80 * 80 * 8 + 10];
int head[410], tot, cur[410];
inline void init() {
tot = 1;
memset(head, 0, sizeof head);
}
inline void addedge(int u, int v, int f, ll c) {
e[++tot] = edge{v, head[u], f, c};
he... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
struct edge {
int v, nxt, f;
ll c;
} e[2 * 80 * 80 * 8 + 10];
int head[410], tot, cur[410];
inline void init() {
tot = 1;
memset(head, 0, sizeof head);
}
inline void addedge(int u, int v, int f, ll c) {
e[++tot] = edge{v, head[u], f, c};
he... | [
"call.arguments.add"
] | 910,866 | 910,867 | u462564510 | cpp |
p03099 | #include <bits/stdc++.h>
using namespace std;
const int N = 85 * 2 + 5;
const int M = N * N;
typedef long long LL;
const LL Base = 1e15, INF = 1e18;
int n, v, m, T[N], a[N], b[N], num, L[N], R[N], U[N], D[N];
char s[N];
long long ans = 0;
struct NODE {
int x, y;
long long v;
void input() {
scanf("%d%d", &... | #include <bits/stdc++.h>
using namespace std;
const int N = 85 * 4 + 5;
const int M = N * N;
typedef long long LL;
const LL Base = 1e15, INF = 1e18;
int n, v, m, T[N], a[N], b[N], num, L[N], R[N], U[N], D[N];
char s[N];
long long ans = 0;
struct NODE {
int x, y;
long long v;
void input() {
scanf("%d%d", &... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 910,876 | 910,877 | u016166866 | cpp |
p03099 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) ... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 910,891 | 910,892 | u382880969 | cpp |
p03099 | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define pb push_back
#define fir first
#define sec second
#define forto(_) for (int e = last[_], v = E[e].to; e; v = E[e = E[e].next].to)
#define forback(_) for (int _ = T; _ ^ S; _ = pre[_])
typedef long l... | #include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#define pb push_back
#define fir first
#define sec second
#define forto(_) for (int e = last[_], v = E[e].to; e; v = E[e = E[e].next].to)
#define forback(_) for (int _ = T; _ ^ S; _ = pre[_])
typedef long l... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 910,893 | 910,894 | u190597469 | cpp |
p03099 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int INF(0X3F3F3F3F);
typedef long long int LL;
namespace G {
const int Max_V(85 * 2);
const int Max_E(85 * 30);
int V, S, T, Head[Max_V], Total, To[Max_E], Next[Max_E], Cap[Max_E],
Flow[Max_E];
LL Weight[Max_E];... |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int INF(0X3F3F3F3F);
typedef long long int LL;
namespace G {
const int Max_V(85 * 2);
const int Max_E(85 * 30);
int V, S, T, Head[Max_V], Total, To[Max_E], Next[Max_E], Cap[Max_E],
Flow[Max_E];
LL Weight[Max_E];... | [
"assignment.change"
] | 910,899 | 910,900 | u710399266 | cpp |
p03099 |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int INF(0X3F3F3F3F);
typedef long long int LL;
namespace G {
const int Max_V(85 * 2);
const int Max_E(85 * 10);
int V, S, T, Head[Max_V], Total, To[Max_E], Next[Max_E], Cap[Max_E],
Flow[Max_E];
LL Weight[Max_E];... |
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <queue>
using namespace std;
const int INF(0X3F3F3F3F);
typedef long long int LL;
namespace G {
const int Max_V(85 * 2);
const int Max_E(85 * 30);
int V, S, T, Head[Max_V], Total, To[Max_E], Next[Max_E], Cap[Max_E],
Flow[Max_E];
LL Weight[Max_E];... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 910,901 | 910,900 | u710399266 | cpp |
p03100 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define fir first
#define sec second
#define Rep(x, y, z) for (int x = y; x <= z; ++x)
#define Red(x, y, z) for (int x = y; x >= z; --x)
using namespace std;
const int MAXN = 3e5 + 5;
char b... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define pint pair<int, int>
#define mk(x, y) make_pair(x, y)
#define fir first
#define sec second
#define Rep(x, y, z) for (int x = y; x <= z; ++x)
#define Red(x, y, z) for (int x = y; x >= z; --x)
using namespace std;
const int MAXN = 3e5 + 5;
char b... | [
"function.return_type.change",
"call.add",
"call.arguments.change"
] | 910,915 | 910,914 | u710376653 | cpp |
p03100 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define LL long long
#define fgx cerr << "--------------" << endl;
#define dgx cerr << "==============" << endl;
inline int read() {
int x = 0, f = 1;
char c = getchar();
for (; !isdigit(c); c =... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define LL long long
#define fgx cerr << "--------------" << endl;
#define dgx cerr << "==============" << endl;
inline int read() {
int x = 0, f = 1;
char c = getchar();
for (; !isdigit(c); c =... | [
"identifier.change",
"expression.operation.binary.change"
] | 910,916 | 910,917 | u702906763 | cpp |
p03100 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define LL long long
#define fgx cerr << "--------------" << endl;
#define dgx cerr << "==============" << endl;
inline int read() {
int x = 0, f = 1;
char c = getchar();
for (; !isdigit(c); c =... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
#define LL long long
#define fgx cerr << "--------------" << endl;
#define dgx cerr << "==============" << endl;
inline int read() {
int x = 0, f = 1;
char c = getchar();
for (; !isdigit(c); c =... | [
"identifier.change",
"expression.operation.binary.change",
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.initializer.change"
] | 910,919 | 910,917 | u702906763 | cpp |
p03100 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define fi first
#define se second
#define N 1000005
using namespace std;
typedef long long ll;
template <class T> inline void read(T &x) {
char ch;
bool flag = false;
while (!isdi... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#define fi first
#define se second
#define N 1000005
using namespace std;
typedef long long ll;
template <class T> inline void read(T &x) {
char ch;
bool flag = false;
while (!isdi... | [] | 910,922 | 910,923 | u018679195 | cpp |
p03100 | #include <bits/stdc++.h>
#define N 5000005
using namespace std;
int n, m, q;
int z, g, mod;
int u[N], v[N], w[N];
int fa[N * 6];
bool vis[2][N];
template <class T> inline void read(T &x) {
char c;
int sign = 1;
while ((c = getchar()) > '9' || c < '0')
if (c == '-')
sign = -1;
x = c - 48;
while ((c ... | #include <bits/stdc++.h>
#define N 1000005
using namespace std;
int n, m, q;
int z, g, mod;
int u[N], v[N], w[N];
int fa[N * 6];
bool vis[2][N];
template <class T> inline void read(T &x) {
char c;
int sign = 1;
while ((c = getchar()) > '9' || c < '0')
if (c == '-')
sign = -1;
x = c - 48;
while ((c ... | [
"preprocessor.define.value.change",
"literal.integer.change",
"call.add",
"call.arguments.change"
] | 910,927 | 910,928 | u996413591 | cpp |
p03100 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define N (100010)
#define M ()
#define inf (0x7f7f7f7f)
#define rg register int
#define Label puts("NAIVE")
#define spa print(' ')
#define en... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define N (500010)
#define M ()
#define inf (0x7f7f7f7f)
#define rg register int
#define Label puts("NAIVE")
#define spa print(' ')
#define en... | [
"preprocessor.define.value.change",
"literal.integer.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 910,933 | 910,932 | u293624543 | cpp |
p03100 | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 5;
const int MAXP = 1e6 + 5;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
x = 0;
int f = 1;
char c =... | #include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e5 + 5;
const int MAXP = 1e6 + 5;
typedef long long ll;
template <typename T> void chkmax(T &x, T y) { x = max(x, y); }
template <typename T> void chkmin(T &x, T y) { x = min(x, y); }
template <typename T> void read(T &x) {
x = 0;
int f = 1;
char c =... | [
"call.add",
"call.arguments.change"
] | 910,934 | 910,935 | u744755176 | cpp |
p03100 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int gcd(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
int n, m, q, mod, b[1000010][3], g, f[1000010], z;
int find(int x) {
if (x != f[x])
return f[x] = find(f[x]);
return x;
}
inline int id(int v, int p, int q) { ... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int gcd(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
int n, m, q, mod, b[50050][3], g, f[300030], z;
int find(int x) {
if (x != f[x])
return f[x] = find(f[x]);
return x;
}
inline int id(int v, int p, int q) { ret... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.add",
"call.arguments.change"
] | 910,939 | 910,940 | u361707943 | cpp |
p03100 | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int gcd(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
int n, m, q, mod, b[50050][3], g, f[300030], z;
int find(int x) {
if (x != f[x])
return f[x] = find(f[x]);
return x;
}
inline int id(int v, int p, int q) { ret... | #include <algorithm>
#include <cstdio>
#include <cstring>
using namespace std;
int gcd(int a, int b) {
if (!b)
return a;
return gcd(b, a % b);
}
int n, m, q, mod, b[50050][3], g, f[300030], z;
int find(int x) {
if (x != f[x])
return f[x] = find(f[x]);
return x;
}
inline int id(int v, int p, int q) { ret... | [
"call.arguments.add",
"call.arguments.change"
] | 910,941 | 910,940 | u361707943 | cpp |
p03100 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
struct Edge {
int fr, to, v;
} e[N << 1];
int n, m, q, mod, g, z;
int id[N][2][3], icnt, par[N * 6];
int can[2][1000010];
int find(int x) {
if (par[x] != x) {
return par[x] = find(par[x]);
}
return par[x];
}
void merge(int x, int y) {... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
struct Edge {
int fr, to, v;
} e[N << 1];
int n, m, q, mod, g, z;
int id[N][2][3], icnt, par[N * 6];
int can[2][1000010];
int find(int x) {
if (par[x] != x) {
return par[x] = find(par[x]);
}
return par[x];
}
void merge(int x, int y) {... | [
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 910,946 | 910,947 | u076784075 | cpp |
p03100 | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
struct Edge {
int fr, to, v;
} e[N << 1];
int n, m, q, mod, g, z;
int id[N][2][3], icnt, par[N * 6];
int can[2][1000010];
int find(int x) {
if (par[x] != x) {
return par[x] = find(par[x]);
}
return par[x];
}
void merge(int x, int y) {... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
struct Edge {
int fr, to, v;
} e[N << 1];
int n, m, q, mod, g, z;
int id[N][2][3], icnt, par[N * 6];
int can[2][1000010];
int find(int x) {
if (par[x] != x) {
return par[x] = find(par[x]);
}
return par[x];
}
void merge(int x, int y) {... | [
"assignment.value.change"
] | 910,948 | 910,947 | u076784075 | cpp |
p03100 | #include <bits/stdc++.h>
using namespace std;
const int N = 5e4 + 10;
struct Edge {
int fr, to, v;
} e[N << 1];
int n, m, q, mod, g, z;
int id[N][2][3], icnt, par[N * 6];
int can[2][1000010];
int find(int x) {
if (par[x] != x) {
return par[x] = find(par[x]);
}
return par[x];
}
void merge(int x, int y) {... | #include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
struct Edge {
int fr, to, v;
} e[N << 1];
int n, m, q, mod, g, z;
int id[N][2][3], icnt, par[N * 6];
int can[2][1000010];
int find(int x) {
if (par[x] != x) {
return par[x] = find(par[x]);
}
return par[x];
}
void merge(int x, int y) {... | [
"literal.number.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 910,949 | 910,947 | u076784075 | cpp |
p03100 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
const int Q = 1 << 19;
int fa[Q];
int gf(int x) { return fa[x] == x ? x : (fa[x] = gf(fa[x])); }
int X[Q], Y[Q], Z[Q];
int MOD;
int id(int x, int y, int z) { return (x - 1) * 6 + y * 2 + z; }
void Merge(int x, int y) {
x ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
using namespace std;
const int Q = 1 << 19;
int fa[Q];
int gf(int x) { return fa[x] == x ? x : (fa[x] = gf(fa[x])); }
int X[Q], Y[Q], Z[Q];
int MOD;
int id(int x, int y, int z) { return (x - 1) * 6 + y * 2 + z; }
void Merge(int x, int y) {
x ... | [
"assignment.value.change"
] | 910,953 | 910,954 | u140310696 | cpp |
p03100 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 910,955 | 910,956 | u845980916 | cpp |
p03100 | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template ... | #include <bits/stdc++.h>
#define fi first
#define se second
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define space putchar(' ')
#define enter putchar('\n')
#define eps 1e-10
//#define ivorysi
using namespace std;
typedef long long int64;
typedef unsigned int u32;
typedef double db;
template ... | [
"literal.number.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 910,957 | 910,956 | u845980916 | cpp |
p03100 | #include <algorithm>
#include <cstdio>
#include <cstring>
#define fo(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
const int N = 1e6 + 5;
int n, m, q, mod, s, t, r, u[N], v[N], c[N], g, fa[N];
bool can[2][N];
int Id(int x, int y, int z) { return (x - 1) *... | #include <algorithm>
#include <cstdio>
#include <cstring>
#define fo(i, a, b) for (int i = a; i <= b; i++)
#define fd(i, a, b) for (int i = a; i >= b; i--)
using namespace std;
const int N = 1e6 + 5;
int n, m, q, mod, s, t, r, u[N], v[N], c[N], g, fa[N];
bool can[2][N];
int Id(int x, int y, int z) { return (x - 1) *... | [
"call.add",
"call.arguments.change"
] | 910,960 | 910,961 | u924601814 | cpp |
p03100 | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fi first
#define se second
#define sz(a) int(a.size())
#define clr(a) memset(a, 0, sizeof(a))
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ... | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fi first
#define se second
#define sz(a) int(a.size())
#define clr(a) memset(a, 0, sizeof(a))
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ... | [
"call.add",
"call.arguments.change"
] | 910,962 | 910,963 | u030892114 | cpp |
p03100 | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fi first
#define se second
#define sz(a) int(a.size())
#define clr(a) memset(a, 0, sizeof(a))
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ... | #include <bits/stdc++.h>
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define fi first
#define se second
#define sz(a) int(a.size())
#define clr(a) memset(a, 0, sizeof(a))
#define all(a) a.begin(), a.end()
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ... | [
"call.add",
"call.arguments.change",
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 910,964 | 910,963 | u030892114 | cpp |
p03100 | #include <algorithm>
#include <cstdio>
using namespace std;
int gi() {
int x = 0, w = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-')
ch = getchar();
if (ch == '-')
w = 0, ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
retur... | #include <algorithm>
#include <cstdio>
using namespace std;
int gi() {
int x = 0, w = 1;
char ch = getchar();
while ((ch < '0' || ch > '9') && ch != '-')
ch = getchar();
if (ch == '-')
w = 0, ch = getchar();
while (ch >= '0' && ch <= '9')
x = (x << 3) + (x << 1) + ch - '0', ch = getchar();
retur... | [
"call.add",
"call.arguments.change"
] | 910,969 | 910,970 | u459210307 | cpp |
p03100 | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | #include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;
#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x, to) for (x = 0; x < (to); x++)
#define FORR(x, arr) for (auto &x : arr)
#define ITR(x, c) for (__typeof(c.begin()) x = c.begin(); x != c.end(); x++)
#define ALL(a) (a.begin()), ... | [
"expression.operation.binary.add"
] | 910,971 | 910,972 | u452725238 | cpp |
p03101 | #include <iostream>
#include <vector>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
cout << H * W - W * h - H * w + min(h, w) << endl;
} | #include <iostream>
#include <vector>
using namespace std;
int main() {
int H, W;
cin >> H >> W;
int h, w;
cin >> h >> w;
cout << H * W - W * h - H * w + h * w << endl;
} | [
"call.remove",
"io.output.change",
"call.arguments.change"
] | 910,977 | 910,978 | u503221936 | cpp |
p03101 | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int H, W;
cin >> H >> W;
int h,... | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits>
#include <numeric>
#include <sstream>
#include <string>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int H, W;
cin >> H >> W;
int h,... | [
"expression.operation.binary.add"
] | 910,987 | 910,988 | u557207741 | cpp |
p03101 | #include <iostream>
using namespace std;
int main() {
int a, b;
int c, d;
cin >> a >> b >> c >> d;
int k = a * b;
// kはマスの総数
k = k - b * c;
//これで行の分が引かれた。
k = k - a * d;
//これで重複している分を含む列の分が引かれた。
k = k + c;
cout << k;
return 0;
} | #include <iostream>
using namespace std;
int main() {
int a, b;
int c, d;
cin >> a >> b >> c >> d;
int k = a * b;
// kはマスの総数
k = k - b * c;
//これで行の分が引かれた。
k = k - a * d;
//これで重複している分を含む列の分が引かれた。
k = k + c * d;
cout << k;
return 0;
}
| [
"assignment.change"
] | 910,989 | 910,990 | u818967913 | cpp |
p03101 | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
int x = h * W + w * H - h + w;
cout << H * W - x << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int H, W, h, w;
cin >> H >> W >> h >> w;
int x = h * W + w * H - h * w;
cout << H * W - x << endl;
}
| [
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 910,991 | 910,992 | u758405447 | cpp |
p03101 | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unorder... | #include <algorithm>
#include <array>
#include <bitset>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <stdint.h>
#include <string>
#include <time.h>
#include <unorder... | [
"call.arguments.add",
"call.arguments.change"
] | 910,995 | 910,996 | u539145601 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
pair<unsigned int, unsigned int> a[100001];
int main(int, char **) {
ll n, m;
cin >> n >> m;
ll ans = 0;
ll x = 0;
for (int i = 0; i < n; ++i)
cin >> a[i].first >> a[i].second;
sort(a, a + n);
for (int i = 0; i < n; ++i) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
pair<ll, ll> a[100002];
int main(int, char **) {
ll n, m;
cin >> n >> m;
ll ans = 0;
ll x = 0;
for (int i = 0; i < n; ++i)
cin >> a[i].first >> a[i].second;
sort(a, a + n);
for (int i = 0; i < n; ++i) {
if ((x + a[i].second... | [
"variable_declaration.type.narrow.change",
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 911,006 | 911,007 | u869644355 | cpp |
p03103 | #include <algorithm>
#include <cstdio>
#include <vector>
typedef struct {
long long int price;
long long int number;
} shop;
bool operator<(const shop &left, const shop &right) {
return left.price < right.price;
}
int main() {
long long int i, n, m;
std::vector<shop> data;
shop a;
scanf("%d %d", &n, &m... | #include <algorithm>
#include <cstdio>
#include <vector>
typedef struct {
long long int price;
long long int number;
} shop;
bool operator<(const shop &left, const shop &right) {
return left.price < right.price;
}
int main() {
int i, n, m;
std::vector<shop> data;
shop a;
scanf("%d %d", &n, &m);
for (... | [
"literal.string.change",
"call.arguments.change"
] | 911,020 | 911,021 | u651808137 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
int main() {
int N, M;
cin >> N >> M;
int a, b;
vector<pair<int, int>> AB(N);
rep(i, N) {
cin >> a >> b;
AB[i] = make_pair(a, b);
}
sort(AB.begin(), AB.end());
int n = 0, kingaku = 0;
rep(i, N)... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < n; i++)
int main() {
int N, M;
cin >> N >> M;
int a, b;
vector<pair<long long, long long>> AB(N);
rep(i, N) {
cin >> a >> b;
AB[i] = make_pair(a, b);
}
sort(AB.begin(), AB.end());
long long n = 0, kingaku... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 911,022 | 911,023 | u209857301 | cpp |
p03103 | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
typedef... | #include "iostream"
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cstring>
#include <iomanip>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
using ll = long long;
typedef... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 911,026 | 911,027 | u863279562 | cpp |
p03103 | #include <algorithm>
#include <cstdio>
#include <map>
#include <vector>
using namespace std;
int main(void) {
int n, m;
scanf("%d %d\n", &n, &m);
vector<pair<int, int>> vc(n);
for (int i = 0; i < n; i++) {
int a, b;
scanf("%d %d\n", &a, &b);
vc[i] = make_pair(a, b);
}
sort(vc.begin(), vc.end());... | #include <algorithm>
#include <cstdio>
#include <map>
#include <vector>
using namespace std;
int main(void) {
int n, m;
scanf("%d %d\n", &n, &m);
vector<pair<int, int>> vc(n);
for (int i = 0; i < n; i++) {
int a, b;
scanf("%d %d\n", &a, &b);
vc[i] = make_pair(a, b);
}
sort(vc.begin(), vc.end());... | [
"type_conversion.add"
] | 911,030 | 911,031 | u436042324 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define poi 1000
using namespace std;
struct girl {
int x, y;
bool operator<(girl b) const { return x < b.x; }
} a[poi];
inline int re() {
char c = getchar();
int x = 0, k = 1;
while (c < '0' || c > '9') {
if (c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define poi 1000000
#define int long long
using namespace std;
struct girl {
int x, y;
bool operator<(girl b) const { return x < b.x; }
} a[poi];
inline int re() {
char c = getchar();
int x = 0, k = 1;
while (c < '0... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 911,044 | 911,045 | u584337457 | cpp |
p03103 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
int n, m;
struct qwq {
int mon, num;
};
qwq a[100005];
long long sum;
int cmp(qwq a, qwq b) { return a.mon < b.mon; }
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i].mon >> a[i].num;
}
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
long long n, m;
struct qwq {
long long mon, num;
};
qwq a[100005];
long long sum;
long long cmp(qwq a, qwq b) { return a.mon < b.mon; }
int main() {
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i].mon ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 911,060 | 911,061 | u275358946 | cpp |
p03103 | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, m, a, b;
vector<pair<int, int>> vec;
long long ans;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m... | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
using namespace std;
const long long MOD = (long long)1e9 + 7;
int n, m, a, b;
vector<pair<int, int>> vec;
long long ans;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m... | [
"literal.number.change",
"call.arguments.change"
] | 911,062 | 911,063 | u398025421 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define modulo 1000000007 // 10^9 + 7
#d... | #include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define modulo 1000000007 // 10^9 + 7
#d... | [
"variable_declaration.type.change"
] | 911,066 | 911,067 | u774652316 | cpp |
p03103 | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define pi pair<int, int>
#define pii pair<pi, pi>
#define vi vec... | #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define rc(x) return cout << x << endl, 0
#define pb push_back
#define dbg(x) cout << #x << '=' << x << '\n';
#define ll long long
#define sz size()
#define x first
#define y second
#define int ll
#define pi pair<int, int>
#define pii pair<pi, pi>... | [] | 911,074 | 911,075 | u392848063 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define mfor(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) mfor(i, 0, n)
#define all(x) (x).begin(), (x).end()
bool comp(const vector<int> &x, const vector<int> &y) { ... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define mfor(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) mfor(i, 0, n)
#define all(x) (x).begin(), (x).end()
bool comp(const vector<int> &x, const vector<int> &y) { ... | [
"variable_declaration.type.change"
] | 911,085 | 911,086 | u819688111 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
int N, M, bot = 0, ans = 0;
cin >> N >> M;
vector<pair<int, int>> p(N);
for (int i = 0; i < N; ++i)
cin >> p[i].first >> p[i].second;
sort(p.begin(), p.end());
for (int i = 0; i < N; ++i) {
... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
int main() {
long long int N, M, bot = 0, ans = 0;
cin >> N >> M;
vector<pair<long long int, long long int>> p(N);
for (int i = 0; i < N; ++i)
cin >> p[i].first >> p[i].second;
sort(p.begin(), p.end());
for... | [
"variable_declaration.type.widen.change"
] | 911,093 | 911,094 | u739362834 | cpp |
p03103 | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> AB(n);
for (int i = 0; i < n; ... | #include <algorithm>
#include <array>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <set>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<long long, int>> AB(n);
for (int i = 0; i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 911,095 | 911,096 | u572012241 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i).first >> a.at(i).second;
}
sort(a.begin(), a.begin());
long long int ans... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<long int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i).first >> a.at(i).second;
}
sort(a.begin(), a.end());
long long int ... | [
"variable_declaration.type.widen.change",
"call.function.change",
"call.arguments.change"
] | 911,097 | 911,098 | u620242073 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> ii;
int main() {
int n, m;
cin >> n >> m;
ii arr[n];
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
arr[i] = make_pair(a, b);
}
sort(arr, arr + n);
int ans = 0, a = 0;
while (m > 0) {
m -= arr[a].second;
if... | #include <bits/stdc++.h>
using namespace std;
typedef pair<long long, long long> ii;
int main() {
int n, m;
cin >> n >> m;
ii arr[n];
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
arr[i] = make_pair(a, b);
}
sort(arr, arr + n);
long long ans = 0, a = 0;
while (m > 0) {
m -= arr... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 911,101 | 911,102 | u712999358 | cpp |
p03103 | #define TEST
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> s(N);
for (int i = 0; i < N; i++) {
s[i] = make_pair(0, 0);
cin >> s[i].first >> s[i].second;
}
sort(s.begin(), s.end());
#ifdef TEST
for (int i = 0; i < N; i++)
cout << s[... | //#define TEST
#include <bits/stdc++.h>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> s(N);
for (int i = 0; i < N; i++) {
s[i] = make_pair(0, 0);
cin >> s[i].first >> s[i].second;
}
sort(s.begin(), s.end());
#ifdef TEST
for (int i = 0; i < N; i++)
cout << ... | [] | 911,117 | 911,118 | u177907787 | cpp |
p03103 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; i++) {
AB[i]... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; i++) {
AB[i]... | [
"type_conversion.add"
] | 911,130 | 911,131 | u539485388 | cpp |
p03103 | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> pairs(N);
int B[N];
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
cin >> B[i];
pairs[i] ... | #include <algorithm>
#include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<pair<long, long>> pairs(N);
int B[N];
int A[N];
for (int i = 0; i < N; i++) {
cin >> A[i];
cin >> B[i];
pairs[i... | [
"variable_declaration.type.primitive.change"
] | 911,134 | 911,135 | u806159048 | cpp |
p03103 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
vector<pair<int, int>> AB(N);
for (int i = 0; i < N; i++) {
AB[i]... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N), B(N);
for (int i = 0; i < N; i++) {
cin >> A[i] >> B[i];
}
// pair<int, int> は int2つの型
vector<pair<int, int>> AB(N);
for (int ... | [
"type_conversion.add"
] | 911,140 | 911,141 | u845620905 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
unsigned long N, M;
typedef pair<long long, long long> X;
vector<X> AB;
int main() {
cin >> N;
cin >> M;
for (int i = 0; i < N; i++) {
long long a;
cin >> a;
long long b;
cin >> b;
AB.push_back(X(a, b));
}
... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long N, M;
typedef pair<long long, long long> X;
vector<X> AB;
int main() {
cin >> N;
cin >> M;
for (int i = 0; i < N; i++) {
long long a;
cin >> a;
long long b;
cin >> b;
AB.push_back(X(a, b));
}
sort(AB... | [
"variable_declaration.type.narrow.change"
] | 911,142 | 911,143 | u543255423 | cpp |
p03103 | #include <algorithm>
#include <stdio.h>
#include <utility>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, k, n, m, ans = 0, now = 0;
scanf("%lld%lld", &n, &m);
pair<ll, ll> d[n];
for (i = 0; i < n; ++i)
scanf("%lld%lld", &d[i].first, &d[i].second);
sort(d, d + n);
for (i = 0; now ... | #include <algorithm>
#include <stdio.h>
#include <utility>
typedef long long ll;
using namespace std;
int main(void) {
ll i, j, k, n, m, ans = 0, now = 0;
scanf("%lld%lld", &n, &m);
pair<ll, ll> d[n];
for (i = 0; i < n; ++i)
scanf("%lld%lld", &d[i].first, &d[i].second);
sort(d, d + n);
for (i = 0; now ... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 911,144 | 911,145 | u440920318 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v.push_back(make_pair(a, b));
}
sort(v.begin(), v.end());
int sum = 0;
long long ans = 0;
for (int i = 0; i < n; i++) {
i... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long n, m;
cin >> n >> m;
vector<pair<int, int>> v;
for (int i = 0; i < n; i++) {
int a, b;
cin >> a >> b;
v.push_back(make_pair(a, b));
}
sort(v.begin(), v.end());
long long sum = 0;
long long ans = 0;
for (int i = 0; i < n; ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 911,163 | 911,165 | u357265888 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
sort(a.begin(), a.end());
int ans = 0;
for (int i = 0; i < n; i++) {
if (a[i].second >= m) {
ans += a[i].fir... | #include <bits/stdc++.h>
using namespace std;
int main() {
long n, m;
cin >> n >> m;
vector<pair<long, long>> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i].first >> a[i].second;
}
sort(a.begin(), a.end());
long ans = 0;
for (int i = 0; i < n; i++) {
if (a[i].second >= m) {
ans += a[i]... | [
"variable_declaration.type.primitive.change"
] | 911,169 | 911,170 | u388552482 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<long long, long long> mp;
for (int i = 0; i < n; i++) {
int a, b... | #include <algorithm>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
map<long long, long long> mp;
for (int i = 0; i < n; i++) {
int a, b... | [
"assignment.value.change",
"assignment.add"
] | 911,171 | 911,172 | u553605501 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, M;
cin >> N >> M;
vector<pair<long, long>> S(N);
for (auto &i : S)
cin >> i.first >> i.second;
sort(S.begin(), S.end());
long ans(0);
for (const auto &i : S) {
long k = min(M, i.second);
ans += k * i.second;
M -= k;
}
... | #include <bits/stdc++.h>
using namespace std;
int main() {
long N, M;
cin >> N >> M;
vector<pair<long, long>> S(N);
for (auto &i : S)
cin >> i.first >> i.second;
sort(S.begin(), S.end());
long ans(0);
for (const auto &i : S) {
long k = min(M, i.second);
ans += k * i.first;
M -= k;
}
... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 911,185 | 911,186 | u462437857 | cpp |
p03103 | #include <algorithm>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long llong;
struct DrinkInfo {
llong price;
llong stock;
DrinkInfo(llong inPrice, llong inStock) {
price = inPrice;
stock = inStock;
}
};
// DrinkInfoを値段で比較。ソートするために用意
bool cmpPrice(const DrinkInfo &a, const D... | #include <algorithm>
#include <stdio.h>
#include <vector>
using namespace std;
typedef long long llong;
struct DrinkInfo {
llong price;
llong stock;
DrinkInfo(llong inPrice, llong inStock) {
price = inPrice;
stock = inStock;
}
};
// DrinkInfoを値段で比較。ソートするために用意
bool cmpPrice(const DrinkInfo &a, const D... | [
"variable_declaration.type.change",
"literal.string.change",
"call.arguments.change"
] | 911,189 | 911,190 | u727116332 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
map<ll, ll> mp;
cin >> n >> m;
for (int i = 0; i < n; i++) {
l... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
int main() {
ll n, m;
map<ll, ll> mp;
cin >> n >> m;
for (int i = 0; i < n; i++) {
l... | [
"expression.unary.arithmetic.remove"
] | 911,193 | 911,194 | u012298376 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, M, a, b;
long long money = 0;
map<long long, long long> shop;
cin >> N >> M;
for (long long i = 0; i < N; i++) {
cin >> a >> b;
if (shop.count(a)) {
shop... | #include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
long long N, M, a, b;
long long money = 0;
map<long long, long long> shop;
cin >> N >> M;
for (long long i = 0; i < N; i++) {
cin >> a >> b;
if (shop.count(a)) {
shop... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 911,207 | 911,208 | u973004633 | cpp |
p03103 | #include <iostream>
#include <map>
int main() {
long long int n, m, sum = 0, add = 0;
std::cin >> n >> m;
std::map<long long int, long long int> mp;
for (int i = 0; i < n; i++) {
int g, p;
std::cin >> g >> p;
mp[g] = p;
}
// std::cout << mp[2] << std::endl;
for (auto itr = mp.begin(); it... | #include <iostream>
#include <map>
int main() {
long long int n, m, sum = 0, add = 0;
std::cin >> n >> m;
std::map<long long int, long long int> mp;
for (int i = 0; i < n; i++) {
int g, p;
std::cin >> g >> p;
// mp[g] = p;
mp[g] = mp[g] + p;
}
// std::cout << mp[2] << std::endl;
for ... | [
"assignment.change"
] | 911,209 | 911,210 | u210398438 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> P(N);
for (int i = 0; i < N; i++)
cin >> P[i].first >> P[i].second;
sort(P.begin(), P.end());
ll ans = 0;
for (int i = 0; i < N; i++) {
if (M >= P[i].second) {
an... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
int N, M;
cin >> N >> M;
vector<pair<int, int>> P(N);
for (int i = 0; i < N; i++)
cin >> P[i].first >> P[i].second;
sort(P.begin(), P.end());
ll ans = 0;
for (int i = 0; i < N; i++) {
if (M >= P[i].second) {
an... | [
"type_conversion.add"
] | 911,217 | 911,218 | u077536797 | cpp |
p03103 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
struct Shop {
int price;
int quantity;
bool operator<(const Shop &right) const { return price... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
struct Shop {
ll price;
ll quantity;
bool operator<(const Shop &right) const { return price <... | [] | 911,221 | 911,222 | u223160139 | cpp |
p03103 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
struct Shop {
int price;
int quantity;
bool operator<(const Shop &right) const { return price... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
struct Shop {
ll price;
ll quantity;
bool operator<(const Shop &right) const { return price <... | [] | 911,223 | 911,222 | u223160139 | cpp |
p03103 | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N, M, tmp;
ll ans = 0;
cin >> N >> M;
typedef pair<ll, ll> pair;
vector<pair> pair_vec;
for (int i = 0; i < N; i++) {
ll tmp1, tmp2;
cin >... | #include <algorithm>
#include <iostream>
#include <math.h>
#include <string.h>
#include <vector>
typedef long long ll;
using namespace std;
int main() {
int N, M, tmp;
ll ans = 0;
cin >> N >> M;
typedef pair<ll, ll> pair;
vector<pair> pair_vec;
for (int i = 0; i < N; i++) {
ll tmp1, tmp2;
cin >... | [
"call.arguments.change",
"function.return_value.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 911,224 | 911,225 | u831873811 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
struct s {
int price;
int num;
};
vector<s> sp;
int a, b;
for (int i = 0; i < n; i++) {
cin >> a >> b;
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <string>
#include <vector>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
struct s {
long long price;
long long num;
};
vector<s> sp;
int a, b;
for (int i = 0; i < n; i++) {
cin >> ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 911,232 | 911,233 | u713830790 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, m, i, j;
cin >> n >> m;
long long int a[n], b[n];
vector<pair<long long int, long long int>> aa(n);
for (i = 0; i < n; i++) {
cin... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int main(void) {
int n, m, i, j;
cin >> n >> m;
long long int a[n], b[n];
vector<pair<long long int, long long int>> aa(n);
for (i = 0; i < n; i++) {
cin... | [
"variable_declaration.type.widen.change"
] | 911,234 | 911,235 | u299725342 | cpp |
p03103 | #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... | [
"literal.string.change",
"call.arguments.change"
] | 911,238 | 911,239 | u978036461 | cpp |
p03103 | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
struct drink {
int v;
int h;
drink(int inputted_v, int inputted_h) {
v = inputted_v;
h = inputted_h;
}
bool operator<(const drink &another) const { return v < another.v; ... | #include <bits/stdc++.h>
#define ALL(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
// Compiler version g++ 6.3.0
struct drink {
ll v;
ll h;
drink(ll inputted_v, ll inputted_h) {
v = inputted_v;
h = inputted_h;
}
bool operator<(const drink &another) const { return v < another.v; };
}... | [
"variable_declaration.type.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 911,245 | 911,244 | u483156389 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define REP(var, n) for (decltype(n) var = 0; var < (n); var++)
#define RREP(var, n) ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <math.h>
#include <stdio.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
#define REP(var, n) for (decltype(n) var = 0; var < (n); var++)
#define RREP(var, n) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 911,248 | 911,249 | u346050999 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int cost[n], weight[n];
vector<pair<int, int>> vp;
for (int i = 0; i < n; ++i) {
cin >> cost[i] >> weight[i];
vp.push_back({cost[i], i});
}
sort(vp.begin(), vp.end());
long long ans = 0ll;
for (int i = 0; i <... | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, m;
cin >> n >> m;
int cost[n], weight[n];
vector<pair<int, int>> vp;
for (int i = 0; i < n; ++i) {
cin >> cost[i] >> weight[i];
vp.push_back({cost[i], i});
}
sort(vp.begin(), vp.end());
long long ans = 0ll;
for (int i = 0; i <... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.change"
] | 911,270 | 911,271 | u592629796 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define Abs(x) ((x) < 0 ? (x) * -1 : (x))
#define rep(x, y) for ((x) = 0; (x) < (y); (x)++)
#define repin(x, y) for ((x) = 0; (x) <= (y); (x)++)
#define nep(x, y) for ((x) = (y)-1; 0 <= (x); (x)--)
#define nepi(x, y,... | [] | 911,272 | 911,273 | u518883877 | cpp |
p03103 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define ll long long int
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
ll need = 0;
vector<pair<int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define INF 100000000
#define ll long long int
using namespace std;
int main() {
ll N, M;
cin >> N >> M;
ll need = 0;
vector<pair<ll,... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 911,280 | 911,281 | u617525345 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
int n, m;
long long ans;
pair<int, int> p[101010];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p, p + n);
for (int i = 0; i < n; i++) {
if (!m) {
... | #include <bits/stdc++.h>
using namespace std;
int n, m;
long long ans;
pair<int, int> p[101010];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> p[i].first >> p[i].second;
}
sort(p, p + n);
for (int i = 0; i < n; i++) {
if (!m) {
... | [
"assignment.change"
] | 911,292 | 911,293 | u580075993 | cpp |
p03103 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int n, m;
cin >> n >> m;
vector<pair<int, int>> v;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end());
ll ans = 0, i = 0;
while (m >... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
int main() {
int n, m;
cin >> n >> m;
vector<pair<ll, ll>> v;
for (int i = 0; i < n; ++i) {
int a, b;
cin >> a >> b;
v.push_back({a, b});
}
sort(v.begin(), v.end());
ll ans = 0, i = 0;
while (m >= ... | [] | 911,306 | 911,307 | u402472923 | cpp |
p03103 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b);... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b);... | [
"control_flow.return.add"
] | 911,312 | 911,313 | u946322619 | cpp |
p03103 | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b);... | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define rep(i, a) for (int i = 0; (i) < (int)(a); (i)++)
#define reps(i, a, b) for (int i = (int)(a); (i) < (int)(b); (i)++)
#define rrep(i, a) for (int i = (int)a - 1; (i) >= 0; (i)--)
#define rreps(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b);... | [
"variable_declaration.type.change",
"control_flow.return.add"
] | 911,314 | 911,313 | u946322619 | cpp |
p03103 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define rt register int
#define l putchar('\n')
#define ll long long
#define r read()
#define p 998244353
using namespace std;
inline ll read() {
ll x = 0;
char zf = 1;
char ch = getchar();
while (ch != '-' && !isdigi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#define rt register int
#define l putchar('\n')
#define ll long long
#define r read()
#define p 998244353
using namespace std;
inline ll read() {
ll x = 0;
char zf = 1;
char ch = getchar();
while (ch != '-' && !isdigi... | [
"identifier.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 911,319 | 911,320 | u178311310 | cpp |
p03103 | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
int main() {
LL N, M;
in >> N >> M;
std::vector<LL> A(N), B(N);
rep(i, N) in >> A[i] >> B[i];
std::vector<std::pair<LL, LL>> store;
rep(i, N) store.push_back(std::make_... | #include "bits/stdc++.h"
#define in std::cin
#define out std::cout
#define rep(i, N) for (LL i = 0; i < N; ++i)
typedef long long int LL;
int main() {
LL N, M;
in >> N >> M;
std::vector<LL> A(N), B(N);
rep(i, N) in >> A[i] >> B[i];
std::vector<std::pair<LL, LL>> store;
rep(i, N) store.push_back(std::make_... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 911,323 | 911,324 | u660613376 | cpp |
p03103 | // #include C/C++ {
#include <bits/stdc++.h>
// }
using namespace std;
// #typedef {
typedef long long int64;
typedef pair<int, int> PII;
typedef pair<int64, int64> PLL;
// }
#define DEBUG_MODE
// #parameter{
#ifdef DEBUG_MODE
#define TYPE decltype
#define RF(filename) ... | // #include C/C++ {
#include <bits/stdc++.h>
// }
using namespace std;
// #typedef {
typedef long long int64;
typedef pair<int, int> PII;
typedef pair<int64, int64> PLL;
// }
// #parameter{
#ifdef DEBUG_MODE
#define TYPE decltype
#define RF(filename) \
{ fre... | [] | 911,325 | 911,326 | u379993235 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define m... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define m... | [
"expression.operation.binary.remove"
] | 911,331 | 911,332 | u860546679 | cpp |
p03104 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define m... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define m... | [
"assignment.change",
"expression.operation.binary.remove"
] | 911,333 | 911,332 | u860546679 | cpp |
p03104 | #include <iostream>
using namespace std;
int main() {
long A, B;
cin >> A >> B;
long num;
long ans;
if (A % 2 == 0) {
if (B % 2 == 0) {
num = B - A;
if (num % 4 == 0) {
ans = 0;
} else {
ans = 1;
}
ans = ans ^ B;
} else {
num = B - A - 1;
if (... | #include <iostream>
using namespace std;
int main() {
long A, B;
cin >> A >> B;
long num;
long ans;
/*
long ans1=A;
for(long i=A+1;i<=B;++i){
ans1=ans1^i;
}
*/
if (A % 2 == 0) {
if (B % 2 == 0) {
num = B - A;
if (num % 4 == 0) {
ans = 0;
} else {
ans ... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 911,334 | 911,335 | u860546679 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, n, j) for (int i = (j); i < (n); ++i)
#define ssort(n) sort((n).begin(), (n).end())
#define rsort(n) sort((n).begin(), (n).end(), greater<int>())
#define mp make_pair
using ll = long long;
using ld = long double... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, n, j) for (int i = (j); i < (n); ++i)
#define ssort(n) sort((n).begin(), (n).end())
#define rsort(n) sort((n).begin(), (n).end(), greater<int>())
#define mp make_pair
using ll = long long;
using ld = long double... | [
"expression.operation.binary.remove"
] | 911,342 | 911,343 | u149757670 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int main() {
long long a, b;
cin >> a >> b;
if (a % 2 == 0) {
if (b % 2 == 0) {
cout << b + ((b - a) / 2) % 2 << endl;
} else if (b % 2 == 1) {
cout << (b / 2 - a / 2 + 1) % 2 << endl;
}
} else if (a % 2 == 1... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int main() {
long long a, b;
cin >> a >> b;
if (a % 2 == 0) {
if (b % 2 == 0) {
cout << b + ((b - a) / 2) % 2 << endl;
} else if (b % 2 == 1) {
cout << (b / 2 - a / 2 + 1) % 2 << endl;
}
} else if (a % 2 == 1... | [
"identifier.change",
"io.output.change"
] | 911,351 | 911,352 | u013069672 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int main() {
long long a, b;
cin >> a >> b;
if (a % 2 == 0) {
if (b % 2 == 0) {
cout << b + ((b - a) / 2) % 2 << endl;
} else if (b % 2 == 1) {
cout << (b / 2 - a / 2) % 2 << endl;
}
} else if (a % 2 == 1) {
... | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
int main() {
long long a, b;
cin >> a >> b;
if (a % 2 == 0) {
if (b % 2 == 0) {
cout << b + ((b - a) / 2) % 2 << endl;
} else if (b % 2 == 1) {
cout << (b / 2 - a / 2 + 1) % 2 << endl;
}
} else if (a % 2 == 1... | [
"identifier.change",
"io.output.change"
] | 911,353 | 911,352 | u013069672 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define For(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
#define leftunique(a) \
{ ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define For(i, a, b) for (ll i = (a); i < (b); ++i)
#define rep(i, n) For(i, 0, n)
#define debug(x) cerr << #x << " = " << (x) << endl;
#define leftunique(a) \
{ ... | [
"literal.number.change",
"call.arguments.change"
] | 911,354 | 911,355 | u298620933 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll ans = 0;
for (ll i = 1; i < 50; i++) {
ll x = 1LL << i;
ll ya = A % x;
ll yb = B % x;
ll za = (A / x) * x / 2LL;
ll zb = (B / x) * x ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll A, B;
cin >> A >> B;
ll ans = 0;
for (ll i = 1; i < 50; i++) {
ll x = 1LL << i;
ll ya = A % x;
ll yb = B % x;
ll za = (A / x) * x / 2LL;
ll zb = (B / x) * x ... | [
"identifier.change",
"io.output.change"
] | 911,356 | 911,357 | u412039195 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a ... | [
"control_flow.branch.if.condition.change"
] | 911,366 | 911,367 | u989306199 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
#define int long long
#define P pair<int, int>
signed main() {
int a, b;
cin >> a >> b;
int x = 0, y = 0; // x = F(0,A-1) y = F(0,B);
int acnt = a;
int bcnt = b + 1;
if (acnt % 2 == 0) {
... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define endl '\n'
#define int long long
#define P pair<int, int>
signed main() {
int a, b;
cin >> a >> b;
int x = 0, y = 0; // x = F(0,A-1) y = F(0,B);
int acnt = a;
int bcnt = b + 1;
if (acnt % 2 == 0) {
... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 911,368 | 911,369 | u862412671 | cpp |
p03104 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
static const int INTINF = (2147483647);
static const ll LLINF = (9223372036854775807);
static const int MAX = 1... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, s, n) for (int i = s; i < (n); ++i)
#define ALL(v) (v).begin(), (v).end()
using namespace std;
typedef long long ll;
static const int INTINF = (2147483647);
static const ll LLINF = (9223372036854775807);
static const int MAX = 1... | [
"assignment.change"
] | 911,415 | 911,416 | u895382169 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rem(i, s, n) for (int i = (s); i >= (n); --i)
using ll = long long;
int main() {
ll a, b;
cin >> a >> b;
ll ans;
if (a % 2 == 0) {
if (b % 2 == 0) {
if (((b - a) / 2) % 2 == 0) {
ans = ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (n); ++i)
#define rem(i, s, n) for (int i = (s); i >= (n); --i)
using ll = long long;
int main() {
ll a, b;
cin >> a >> b;
ll ans;
if (a % 2 == 0) {
if (b % 2 == 0) {
if (((b - a) / 2) % 2 == 0) {
ans = ... | [
"literal.number.change",
"assignment.value.change"
] | 911,440 | 911,441 | u526854325 | cpp |
p03104 | #include <bits/stdc++.h>
main() {
long a, b, ans = 0;
std::cin >> a >> b;
if (b % 2 == 0)
ans = ans ^ b;
if (a % 2 == 1)
ans = ans ^ (a - 1);
ans = ((b + 1) / 2) % 2 ^ ans;
ans = ((a + 1) / 2) % 2 ^ ans;
std::cout << ans;
} | #include <bits/stdc++.h>
main() {
long a, b, ans = 0;
std::cin >> a >> b;
if (b % 2 == 0)
ans = ans ^ b;
if (a % 2 == 1)
ans = ans ^ (a - 1);
ans = (((b + 1) / 2) % 2) ^ ans;
ans = ((a / 2) % 2) ^ ans;
std::cout << ans;
} | [] | 911,442 | 911,443 | u499009346 | cpp |
p03104 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll A, B;
cin >> A >> B;
ll sumA = 0, sumB = 0;
if (A % 2 == 0) {
if ((A / 2) % 2 == 1) {
sumA = 1;
} else {
sumA = 0;
}
} else if (A % 2 == 1) {
if ((A... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
int main() {
ll A, B;
cin >> A >> B;
ll sumA = 0, sumB = 0;
if (A % 2 == 0) {
if ((A / 2) % 2 == 1) {
sumA = 1;
} else {
sumA = 0;
}
} else if (A % 2 == 1) {
if ((A... | [
"literal.number.change",
"assignment.value.change"
] | 911,450 | 911,451 | u801083963 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1001001001;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
int main() {
vector<ll> v(2);
vector<ll> d(2);
cin >> v[0] >> v[1];
if (v[0] > 0)
v[0]--;
// vector<ll>v(b+1);
rep(i, 2) {
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const int INF = 1001001001;
#define rep(i, n) for (ll i = 0; i < (int)(n); i++)
int main() {
vector<ll> v(2);
vector<ll> d(2);
cin >> v[0] >> v[1];
if (v[0] > 0)
v[0]--;
// vector<ll>v(b+1);
rep(i, 2) {
... | [
"variable_declaration.value.change"
] | 911,478 | 911,479 | u289381123 | cpp |
p03104 | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using P = pair<int, ll>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, ... | #include <bits/stdc++.h>
#define _GLIBCXX_DEBUG
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using ll = long long;
using P = pair<int, ll>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, ... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 911,485 | 911,486 | u717037783 | cpp |
p03104 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int main() {
ll A, B;
cin >> A >> B;
ll ans;
if (A % 2 == 0 && B % 2 == 0) {
// A: even B:even
if (((B - A) / 2) % 2 == 0) {
ans = 0 ^ B;
} else {... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef pair<int, int> P;
int main() {
ll A, B;
cin >> A >> B;
ll ans;
if (A % 2 == 0 && B % 2 == 0) {
// A: even B:even
if (((B - A) / 2) % 2 == 0) {
ans = 0 ^ B;
} else {... | [
"assignment.value.change",
"expression.operation.binary.change"
] | 911,497 | 911,498 | u872158847 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.