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 |
|---|---|---|---|---|---|---|---|
p03229 | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int num[100005];
int s[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num[i];
}
sort(num, num + n);
int mid = n / 2;
int sum = 0;
if (n % 2 == 0) {
for (int i = 0; i < mid; i++)
sum ... | #include <algorithm>
#include <cmath>
#include <iostream>
using namespace std;
int num[100005];
int s[100005];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> num[i];
}
sort(num, num + n);
int mid = n / 2;
long long sum = 0;
if (n % 2 == 0) {
for (int i = 0; i < mid; i++)
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,023,007 | 1,023,005 | u714489093 | cpp |
p03229 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iterator>
#include <list>
using namespace std;
long long a[211111];
long long b[211111];
long long c = 0;
long long p1 = 0;
long long p2 = 0;
list<long long> old;
list<long long> ans;
int main() {
long long n;
scanf("%lld", &n);
for (long lon... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <iterator>
#include <list>
using namespace std;
long long a[211111];
long long b[211111];
long long c = 0;
long long p1 = 0;
long long p2 = 0;
list<long long> old;
list<long long> ans;
int main() {
long long n;
scanf("%lld", &n);
for (long lon... | [
"call.function.change"
] | 1,023,012 | 1,023,014 | u816242241 | cpp |
p03232 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define f(i, a, b) for (int i = a; i < b; i++)
const ll mod = 1e9 + 7;
ll modpow(ll a, ll b) {
return b ? modpow(a * a % mod, b / 2) * (b & 1 ? a : 1) % mod : 1;
}
void add(ll &a, ll b) {
if (b >= mod)
b %= mod;
a += b;
if (a >= mod)
... |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define f(i, a, b) for (int i = a; i < b; i++)
const ll mod = 1e9 + 7;
ll modpow(ll a, ll b) {
return b ? modpow(a * a % mod, b / 2) * (b & 1 ? a : 1) % mod : 1;
}
void add(ll &a, ll b) {
if (b >= mod)
b %= mod;
a += b;
if (a >= mod)
... | [] | 1,023,041 | 1,023,042 | u027091475 | cpp |
p03232 | #include <bits/stdc++.h>
#define maxn 100010
#define ll long long
#define mod 1000000007
using namespace std;
int val[maxn], n, pre[maxn], fac[maxn], inv[maxn];
int C(int n, int m) { return (ll)fac[n] * inv[m] % mod * inv[n - m] % mod; }
int calc(int a, int k) {
int ans = 1;
while (k) {
if (k % 2)
ans = (... | #include <bits/stdc++.h>
#define maxn 100010
#define ll long long
#define mod 1000000007
using namespace std;
int val[maxn], n, pre[maxn], fac[maxn], inv[maxn];
int C(int n, int m) { return (ll)fac[n] * inv[m] % mod * inv[n - m] % mod; }
int calc(int a, int k) {
int ans = 1;
while (k) {
if (k % 2)
ans = (... | [
"assignment.change"
] | 1,023,043 | 1,023,044 | u276642373 | cpp |
p03232 | #include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#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 RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define RFORE(i, a, b) for (int i = (b); i >= (a); --i)
#de... | #include <bits/stdc++.h>
#define int long long int
#define MOD(x) ((x % MOD_N) + MOD_N) % MOD_N
#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 RFOR(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define RFORE(i, a, b) for (int i = (b); i >= (a); --i)
#de... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,023,059 | 1,023,060 | u960524878 | cpp |
p03232 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#define gt getchar()
#define ll long long
#define File(s) freopen(s ".in", "r", stdin), freopen(s ".out", "w", stdout)
typedef std::pair<int, int> P;
#define mk std::make_pair
#define fr first
#define sc second
inline int in() {
int k = 0;
c... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#define gt getchar()
#define ll long long
#define File(s) freopen(s ".in", "r", stdin), freopen(s ".out", "w", stdout)
typedef std::pair<int, int> P;
#define mk std::make_pair
#define fr first
#define sc second
inline int in() {
int k = 0;
c... | [
"literal.number.change"
] | 1,023,062 | 1,023,063 | u194740579 | cpp |
p03232 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int M = 1e5 + 55;
const int N = 1e5;
int bas[M];
int psum[M];
int n;
int w[M];
int ans;
int quickPow(int a, int b) {
int ret = 1, bas = a;
whi... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int M = 1e5 + 55;
const int N = 1e5;
int bas[M];
int psum[M];
int n;
int w[M];
int ans;
int quickPow(int a, int b) {
int ret = 1, bas = a;
whi... | [
"assignment.value.change"
] | 1,023,077 | 1,023,078 | u214775674 | cpp |
p03232 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MX = 1e5 + 100;
const int mo = 1e9 + 7;
int inverse(int v) {
int p = mo - 2;
int ans = 1;
while (p) {
if (p & 1)
ans = ans * v % mo;
v = v * v % mo;
p >>= 1;
}
return ans;
}
int inv[MX];
main() {
int n;
cin >> ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MX = 1e5 + 100;
const int mo = 1e9 + 7;
int inverse(int v) {
int p = mo - 2;
int ans = 1;
while (p) {
if (p & 1)
ans = ans * v % mo;
v = v * v % mo;
p >>= 1;
}
return ans;
}
int inv[MX];
main() {
int n;
cin >> ... | [
"assignment.change"
] | 1,023,095 | 1,023,096 | u466435290 | cpp |
p03232 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#define MN 100005
using namespace std;
typedef long long ll;
int n, inv[MN], sum[MN], a[MN];
ll ans;
const int mod = 1e9 + 7;
int main() {
scanf("%d", &n);
inv[0] = inv[1] = 1;
for (int i = 2; i <= n; i++)
inv[i] = 1ll * (mod - mod / i... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#define MN 100005
using namespace std;
typedef long long ll;
int n, inv[MN], sum[MN], a[MN];
ll ans;
const int mod = 1e9 + 7;
int main() {
scanf("%d", &n);
inv[0] = inv[1] = 1;
for (int i = 2; i <= n; i++)
inv[i] = 1ll * (mod - mod / i... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change"
] | 1,023,107 | 1,023,108 | u614979975 | cpp |
p03232 | #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;
ll powmod(ll x, ll n) {
if (n == 0)
return 1;
ll ans = powmod(x * x % MOD, n / 2);
if (n % 2)
ans = ans * x % MOD;
return ans;
}
ll... | #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;
ll powmod(ll x, ll n) {
if (n == 0)
return 1;
ll ans = powmod(x * x % MOD, n / 2);
if (n % 2)
ans = ans * x % MOD;
return ans;
}
ll... | [
"call.arguments.add",
"call.arguments.change"
] | 1,023,135 | 1,023,136 | u157322125 | cpp |
p03232 | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
int inv[100005];
int someinv[100005];
int powmod(int a, int x) {
int ans = 1;
while (x) {
if (x & 1)
(ans *= a) %= mod;
(a *= a) %= mod;
x >>= 1;
}
return ans;
}
void init() {
for (int i = 1; i < 1... | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1e9 + 7;
int inv[100005];
int someinv[100005];
int powmod(int a, int x) {
int ans = 1;
while (x) {
if (x & 1)
(ans *= a) %= mod;
(a *= a) %= mod;
x >>= 1;
}
return ans;
}
void init() {
for (int i = 1; i < 1... | [
"assignment.change"
] | 1,023,137 | 1,023,138 | u566529875 | cpp |
p03232 | #include <bits/stdc++.h>
typedef long long ll;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << (... | #include <bits/stdc++.h>
typedef long long ll;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << (... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,023,142 | 1,023,143 | u705918648 | cpp |
p03232 | #include <bits/stdc++.h>
typedef long long ll;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << (... | #include <bits/stdc++.h>
typedef long long ll;
const ll INF = 1e9;
const ll MOD = 1e9 + 7;
const ll LINF = 1e18;
using namespace std;
#define dump(x) cout << #x << " = " << (x) << endl;
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << (... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,023,144 | 1,023,143 | u705918648 | cpp |
p03232 | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const long long MOD = 1e9 + 7;
// mod m での a の逆元
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
... | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const long long MOD = 1e9 + 7;
// mod m での a の逆元
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
... | [
"assignment.change"
] | 1,023,145 | 1,023,146 | u732285858 | cpp |
p03232 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mod 1000000007
#define eps 1e-13
#define PI 3.141592653589793238L
#define inf 1000000011
#define INFLL 1000000000000000011LL
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define mod 1000000007
#define eps 1e-13
#define PI 3.141592653589793238L
#define inf 1000000011
#define INFLL 1000000000000000011LL
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<... | [] | 1,023,173 | 1,023,174 | u036385662 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)... | [
"call.arguments.change"
] | 1,023,202 | 1,023,203 | u104057163 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)... | #include <bits/stdc++.h>
using namespace std;
// #define int long long
// #define double long double
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep1(i, n) for (int i = 1; i < (int)(n); ++i)
#define repeq(i, n) for (int i = 0; i <= (int)(n); ++i)
#define rep1eq(i, n) for (int i = 1; i <= (int)(n); ++i)... | [
"control_flow.branch.if.condition.change",
"call.arguments.change"
] | 1,023,204 | 1,023,203 | u104057163 | cpp |
p03233 | /* be name khoda */
#define long_enable
#include <algorithm>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <vector>
using namespace std;
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif
typedef pair<ll, ll> pii;
typedef pa... | /* be name khoda */
#define long_enable
#include <algorithm>
#include <cstring>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <vector>
using namespace std;
#ifdef long_enable
typedef long long int ll;
#else
typedef int ll;
#endif
typedef pair<ll, ll> pii;
typedef pa... | [
"expression.operation.binary.remove"
] | 1,023,207 | 1,023,208 | u780597450 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 100010;
struct WEN {
int val, pos, type;
bool operator<(const WEN &b) { return val < b.val; }
} num[N * 2];
LL pre[N * 2];
int pos[2][N];
int main() {
int n, tp = 0;
scanf("%d", &n);
LL A = 0, B = 0;
for (int i = 1; i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 100010;
struct WEN {
int val, pos, type;
bool operator<(const WEN &b) { return val < b.val; }
} num[N * 2];
LL pre[N * 2];
int pos[2][N];
int main() {
int n, tp = 0;
scanf("%d", &n);
LL A = 0, B = 0;
for (int i = 1; i ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,023,212 | 1,023,213 | u741086489 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RREP(i, n) for (int i = (int)(n); i >= 0; --i)
#define RFOR(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define ALL(a) (a).be... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RREP(i, n) for (int i = (int)(n); i >= 0; --i)
#define RFOR(i, a, b) for (int i = (int)(a); i >= (int)(b); --i)
#define ALL(a) (a).be... | [
"control_flow.branch.if.replace.add",
"control_flow.branch.else_if.replace.remove"
] | 1,023,217 | 1,023,218 | u334351654 | cpp |
p03233 | #include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
typedef long long ll;
namespace IO {
cs int Rlen = 1 << 22 | 1;
inline char gc() {
static char buf[Rlen], *p1, *p2;
(p1 == p2) && (p2 = (p1 = buf) + fread(buf, 1, Rlen, stdin));
return p1 == p2 ? EOF : *p1++;
}
int read() {
int ... | #include <bits/stdc++.h>
#define cs const
#define pb push_back
using namespace std;
typedef long long ll;
namespace IO {
cs int Rlen = 1 << 22 | 1;
inline char gc() {
static char buf[Rlen], *p1, *p2;
(p1 == p2) && (p2 = (p1 = buf) + fread(buf, 1, Rlen, stdin));
return p1 == p2 ? EOF : *p1++;
}
int read() {
int ... | [
"control_flow.branch.if.condition.change"
] | 1,023,221 | 1,023,222 | u800131298 | cpp |
p03233 | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typ... | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typ... | [
"variable_declaration.value.change",
"identifier.replace.add",
"literal.replace.remove",
"identifier.change",
"call.function.change"
] | 1,023,223 | 1,023,224 | u643840641 | cpp |
p03233 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < x; i++)
#define repn(i, x) for (ll i... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#define _USE_MATH_DEFINES
#include <functional>
#include <math.h>
using namespace std;
#define rep(i, x) for (ll i = 0; i < x; i++)
#define repn(i, x) for (ll i... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,023,225 | 1,023,226 | u004411048 | cpp |
p03233 | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr ll mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr bool chmax(T &a, const T b) {
if ... | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr ll mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr bool chmax(T &a, const T b) {
if ... | [
"variable_declaration.type.change",
"io.output.change"
] | 1,023,227 | 1,023,228 | u047554023 | cpp |
p03233 | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr ll mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr bool chmax(T &a, const T b) {
if ... | #include <bits/stdc++.h>
#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; i++)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
constexpr ll mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;
template <typename T> constexpr bool chmax(T &a, const T b) {
if ... | [
"io.output.change"
] | 1,023,229 | 1,023,228 | u047554023 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
if (n == 1) {
cout << "Hello World" << '\n';
}
if (n == 2) {
cin >> a >> b;
cout << a + b << '\n';
}
return (0);
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Hello World" << '\n';
}
if (n == 2) {
cin >> a >> b;
cout << a + b << '\n';
}
return (0);
}
| [] | 1,023,242 | 1,023,243 | u412732017 | cpp |
p03238 | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define f first
#define s second
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef debug
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
if (n == 1)
... | #include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define f first
#define s second
using namespace std;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#ifdef debug
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
if (n == 1)
... | [
"literal.string.change",
"io.output.change"
] | 1,023,244 | 1,023,245 | u382032245 | cpp |
p03238 | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli, lli> pii;
#define rep(i, n) for (int i... | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ld;
#define vec(s) vector<s>
#define vvec(s) vector<vector<s>>
typedef vector<lli> vi;
typedef vector<vi> vvi;
typedef pair<lli, lli> pii;
#define rep(i, n) for (int i... | [
"literal.string.change",
"call.arguments.change"
] | 1,023,250 | 1,023,251 | u338418253 | cpp |
p03238 | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using namespace std;
int main() {
fastIO;
int n;
cin >> n;
if (n == 1)
cout << 'Hello World';
else {
int a, b;
... | #include <bits/stdc++.h>
#define fastIO (cin.tie(0), cout.tie(0), ios::sync_with_stdio(false))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define precise(i) fixed << setprecision(i)
using namespace std;
int main() {
fastIO;
int n;
cin >> n;
if (n == 1)
cout << "Hello World";
else {
int a, b;
... | [
"io.output.change"
] | 1,023,254 | 1,023,255 | u273359100 | cpp |
p03238 | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | /*
URL_HERE
*/
/*
*/
#ifdef _WIN32
#pragma warning(disable : 4996)
#endif
#include <algorithm>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
using namespace std;
FILE *_fin = stdin;
FILE *_fout = stdout;
#define PI 3.141592653589793238462643383279502884197169399... | [
"literal.string.change",
"call.arguments.change"
] | 1,023,259 | 1,023,260 | u950002813 | cpp |
p03238 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(), (x).end()
#define re... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
constexpr char ln = '\n';
constexpr long long MOD = 1000000007LL;
constexpr long long INF = 1000000009LL;
#define all(x) (x).begin(), (x).end()
#define re... | [
"literal.string.change",
"io.output.change"
] | 1,023,265 | 1,023,266 | u062736195 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a,... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e16;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a,... | [] | 1,023,281 | 1,023,282 | u785492958 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N;
if (N == 1) {
cout << "Hello world" << endl;
} else {
cin >> A >> B;
cout << A + B << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int N, A, B;
cin >> N;
if (N == 1) {
cout << "Hello World" << endl;
} else {
cin >> A >> B;
cout << A + B << endl;
}
}
| [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,283 | 1,023,284 | u033273089 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int i, a, b;
cin >> i >> a >> b;
if (a == 1) {
cout << "Hello World";
} else {
cout << a + b;
}
}
| #include <bits/stdc++.h>
using namespace std;
int main(void) {
int i, a, b;
cin >> i >> a >> b;
if (i == 1) {
cout << "Hello World";
} else {
cout << a + b;
}
}
| [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,023,289 | 1,023,290 | u329845662 | cpp |
p03238 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define put(i) cout << fixed << i << endl
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
if (a == 1) {
put("Hello World");
} else {
ll b;
cin >> b;
put(a + b);
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define put(i) cout << fixed << i << endl
using namespace std;
using ll = long long;
int main() {
ll a;
cin >> a;
if (a == 1) {
put("Hello World");
} else {
cin >> a;
ll b;
cin >> b;
put(a + b);
}
} | [] | 1,023,291 | 1,023,292 | u185935459 | cpp |
p03238 | /**
* auther: moririn_cocoa
*/
// #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ =
// malloc(size);void * stack_extend_origin_memory_;char *
// stack_extend_du... | /**
* auther: moririn_cocoa
*/
// #pragma GCC target("avx") // CPU 処理並列化
// #pragma GCC optimize("O3") // CPU 処理並列化
// #pragma GCC optimize("unroll-loops") // 条件処理の呼び出しを減らす
// #define BEGIN_STACK_EXTEND(size) void * stack_extend_memory_ =
// malloc(size);void * stack_extend_origin_memory_;char *
// stack_extend_du... | [
"expression.operation.compare.replace.add",
"assignment.replace.remove",
"misc.typo"
] | 1,023,297 | 1,023,298 | u121251784 | cpp |
p03238 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
if (n == 1) {
cout << "Hello World!"
<< "\n";
return 0;
}
int a, b;
cin ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
//#define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
if (n == 1) {
cout << "Hello World"
<< "\n";
return 0;
} else {
int a, b... | [
"literal.string.change",
"io.output.change",
"control_flow.branch.else.add"
] | 1,023,303 | 1,023,304 | u568501780 | cpp |
p03238 | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
if (n == 1)
cout << "Hello world" << endl;
else {
int a, b;
cin >> a >> b;
... | #include <algorithm>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
int n;
cin >> n;
if (n == 1)
cout << "Hello World" << endl;
else {
int a, b;
cin >> a >> b;
... | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,318 | 1,023,319 | u657208344 | cpp |
p03238 | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "hello world" << endl;
return 0;
} else {
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | #include <iostream>
using namespace std;
int main() {
int n, a, b;
cin >> n;
if (n == 1) {
cout << "Hello World" << endl;
return 0;
} else {
cin >> a >> b;
cout << a + b << endl;
}
return 0;
} | [
"literal.string.change",
"literal.string.case.change",
"io.output.change"
] | 1,023,320 | 1,023,321 | u657208344 | cpp |
p03233 | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define lscan(x) scanf("%I64d", &x);
#defin... | #include <algorithm>
#include <bitset>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define lscan(x) scanf("%I64d", &x);
#defin... | [
"assignment.add"
] | 1,023,326 | 1,023,327 | u933068010 | cpp |
p03233 | #include <bits/stdc++.h>
typedef long long ll;
typedef std::pair<int, int> pr;
const int N = 200054;
int n;
pr a[N];
bool fill[N];
inline ll min(const ll x, const ll y) { return x < y ? x : y; }
int main() {
int i, u, v;
ll ans, s = 0;
bool ok = false;
scanf("%d", &n);
for (i = 0; i < n; ++i)
scanf("%... | #include <bits/stdc++.h>
typedef long long ll;
typedef std::pair<int, int> pr;
const int N = 200054;
int n;
pr a[N];
bool fill[N];
inline ll min(const ll x, const ll y) { return x < y ? x : y; }
int main() {
int i, u, v;
ll ans, s = 0;
bool ok = false;
scanf("%d", &n);
for (i = 0; i < n; ++i)
scanf("%... | [
"control_flow.branch.if.condition.change"
] | 1,023,330 | 1,023,331 | u357974633 | cpp |
p03233 | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a, _e = b; i <= _e; ++i)
#define ll long long
using namespace std;
const int N = 1e5 + 5;
int n, a, b, is[N], c[4];
struct nod {
int a, i;
} v[N * 2];
ll tot, tot2, ansa, ansb;
bool cmp(nod a, nod b) { return a.a < b.a; }
int main() {
ios::sync_with_stdio(fa... | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a, _e = b; i <= _e; ++i)
#define ll long long
using namespace std;
const int N = 1e5 + 5;
int n, a, b, is[N], c[4];
struct nod {
int a, i;
} v[N * 2];
ll tot, tot2, ansa, ansb;
bool cmp(nod a, nod b) { return a.a < b.a; }
int main() {
ios::sync_with_stdio(fa... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,023,336 | 1,023,337 | u442731964 | cpp |
p03233 | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("trapv")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb ... | //#pragma GCC optimize("Ofast")
//#pragma GCC target("avx2,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("trapv")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 1,023,338 | 1,023,339 | u084411645 | cpp |
p03233 | #include <bits/stdc++.h>
#define fo(i, x, y) for (int i = x, B = y; i <= B; i++)
#define ff(i, x, y) for (int i = x, B = y; i < B; i++)
#define fd(i, x, y) for (int i = x, B = y; i >= B; i--)
#define ll long long
#define pp printf
#define hh pp("\n")
using namespace std;
const int N = 2e5 + 5;
int n, x, y, p[N], q[N]... | #include <bits/stdc++.h>
#define fo(i, x, y) for (int i = x, B = y; i <= B; i++)
#define ff(i, x, y) for (int i = x, B = y; i < B; i++)
#define fd(i, x, y) for (int i = x, B = y; i >= B; i--)
#define ll long long
#define pp printf
#define hh pp("\n")
using namespace std;
const int N = 2e5 + 5;
int n, x, y, p[N], q[N]... | [
"control_flow.branch.if.condition.change"
] | 1,023,340 | 1,023,341 | u173123334 | cpp |
p03233 | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd... | #include <bits/stdc++.h>
#define syosu(x) fixed << setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef pair<double, double> pdd;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,023,342 | 1,023,343 | u434747175 | cpp |
p03233 | // 21
#include <algorithm>
#include <cstdio>
using namespace std;
const int maxn = 100001;
int n;
int a[maxn], b[maxn];
pair<int, int> ord1[maxn], ord2[maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &a[i], &b[i]);
}
for (int i = 1; i <= n; i++) {
ord1[i] = make_pair... | // 21
#include <algorithm>
#include <cstdio>
using namespace std;
const int maxn = 100001;
int n;
int a[maxn], b[maxn];
pair<int, int> ord1[maxn], ord2[maxn];
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d", &a[i], &b[i]);
}
for (int i = 1; i <= n; i++) {
ord1[i] = make_pair... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,023,344 | 1,023,345 | u633894589 | cpp |
p03233 | #include <bits/stdc++.h>
#define int long long
#define N 201000
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define max(a, b) (((a) > (b)) ? (a) : (b))
using namespace std;
struct node {
int val, indx;
node() {}
node(int V, int I) : val(V), indx(I) {}
} A[N], B[N], C[N];
bool operator<(const node a, const node b)... | #include <bits/stdc++.h>
#define int long long
#define N 201000
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define max(a, b) (((a) > (b)) ? (a) : (b))
using namespace std;
struct node {
int val, indx;
node() {}
node(int V, int I) : val(V), indx(I) {}
} A[N], B[N], C[N];
bool operator<(const node a, const node b)... | [
"expression.operation.binary.add"
] | 1,023,350 | 1,023,351 | u699596082 | cpp |
p03233 | #include <bits/stdc++.h>
#define N 300010
using namespace std;
typedef long long ll;
char *p1, *p2, buf[100000];
#define nc() \
(p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) \
? EOF ... | #include <bits/stdc++.h>
#define N 300010
using namespace std;
typedef long long ll;
char *p1, *p2, buf[100000];
#define nc() \
(p1 == p2 && (p2 = (p1 = buf) + fread(buf, 1, 100000, stdin), p1 == p2) \
? EOF ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,023,352 | 1,023,353 | u334395581 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
const int N = 100100;
typedef long long ll;
pair<int, int> a[N], b[N];
ll sumx, sumy, sa[N], sb[N], ans;
int n, ia[N], ib[N];
int main() {
#ifdef ONLINE_JUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#endif
cin >> n;
for (int i = 1; i <= n; ++i) {
int... | #include <bits/stdc++.h>
using namespace std;
const int N = 100100;
typedef long long ll;
pair<int, int> a[N], b[N];
ll sumx, sumy, sa[N], sb[N], ans;
int n, ia[N], ib[N];
int main() {
#ifdef ONLINE_JUDGE
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#endif
cin >> n;
for (int i = 1; i <= n; ++i) {
int... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 1,023,358 | 1,023,359 | u922461964 | cpp |
p03233 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const ll inf = 1e15;
ll n, vis[200005], ans, cnt1, cnt2, a[100005], b[100005], dif1, dif2, cmp;
struct node {
ll v, id;
friend bool operator<(node a, node b) { return a.v < b.v; }
} e[200005];
int main() {
cin >> n;
for (ll i... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const ll inf = 1e16;
ll n, vis[200005], ans, cnt1, cnt2, a[100005], b[100005], dif1, dif2, cmp;
struct node {
ll v, id;
friend bool operator<(node a, node b) { return a.v < b.v; }
} e[200005];
int main() {
cin >> n;
for (ll i... | [
"literal.number.change",
"variable_declaration.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 1,023,362 | 1,023,363 | u790515578 | cpp |
p03233 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
#define ll long long
#define Maxn 100000
set<pair<int, int>> st;
int a[Maxn + 5], b[Maxn + 5];
int x[Maxn + 5];
int have[Maxn + 5];
int mn(int a, int b) { return a < b ? a : b; }
int main() {
int n;
scanf("%d", &n);
for... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <set>
using namespace std;
#define ll long long
#define Maxn 100000
set<pair<int, int>> st;
int a[Maxn + 5], b[Maxn + 5];
int x[Maxn + 5];
int have[Maxn + 5];
int mn(int a, int b) { return a < b ? a : b; }
int main() {
int n;
scanf("%d", &n);
for... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,023,364 | 1,023,365 | u410132794 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
struct T {
ll value;
int id;
bool isB;
};
int main(void) {
int n;
cin >> n;
vector<T> t;
rep(i, n) {
ll a, b;
cin >> a >> b;
t.push_ba... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
struct T {
ll value;
int id;
bool isB;
};
int main(void) {
int n;
cin >> n;
vector<T> t;
rep(i, n) {
ll a, b;
cin >> a >> b;
t.push_ba... | [
"call.remove"
] | 1,023,369 | 1,023,370 | u241615199 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
struct T {
ll value;
int id;
bool isB;
};
int main(void) {
int n;
cin >> n;
vector<T> t;
rep(i, n) {
ll a, b;
cin >> a >> b;
t.push_ba... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
struct T {
ll value;
int id;
bool isB;
};
int main(void) {
int n;
cin >> n;
vector<T> t;
rep(i, n) {
ll a, b;
cin >> a >> b;
t.push_ba... | [
"call.remove"
] | 1,023,371 | 1,023,370 | u241615199 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
struct T {
ll value;
int id;
bool isB;
};
int main(void) {
int n;
cin >> n;
vector<T> t;
rep(i, n) {
ll a, b;
cin >> a >> b;
t.push_ba... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
struct T {
ll value;
int id;
bool isB;
};
int main(void) {
int n;
cin >> n;
vector<T> t;
rep(i, n) {
ll a, b;
cin >> a >> b;
t.push_ba... | [
"call.remove"
] | 1,023,372 | 1,023,370 | u241615199 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define FOR(i, a, b) for (ll i = (a); i < (b); ++i)
#define FORR(i, a, b) for (ll i = (a); i > (b); --i)
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REPR(i, n) for (ll i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 1,023,373 | 1,023,374 | u139031151 | cpp |
p03233 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
#define fi first
#define se second
int n;
pair<ll, pair<int, int>> c[200001];
int ch[100001][2];
int cnt[4];
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
c... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
#define fi first
#define se second
int n;
pair<ll, pair<int, int>> c[200001];
int ch[100001][2];
int cnt[4];
int main() {
ios::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
int a, b;
cin >> a >> b;
c... | [
"literal.number.change",
"assignment.value.change",
"control_flow.return.remove"
] | 1,023,379 | 1,023,380 | u707303246 | cpp |
p03233 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | [
"call.remove"
] | 1,023,383 | 1,023,384 | u525288965 | cpp |
p03233 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | [
"expression.operation.binary.remove"
] | 1,023,385 | 1,023,384 | u525288965 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MN = 100010;
int N;
pii P[MN];
vector<pii> V;
int chk[MN];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d %d", &P[i].first, &P[i].second);
V.push_back(pii(P[i].first, 2 * i))... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MN = 100010;
int N;
pii P[MN];
vector<pii> V;
int chk[MN];
int main() {
scanf("%d", &N);
for (int i = 0; i < N; i++) {
scanf("%d %d", &P[i].first, &P[i].second);
V.push_back(pii(P[i].first, 2 * i))... | [
"control_flow.branch.if.condition.change"
] | 1,023,393 | 1,023,394 | u333877810 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<pair<int, int>> vec(2 * n);
for (int i = 0; i < n; ++i) {
vec[i].second = i, vec[i + n].second = i + n;
cin >> vec[i].first >> vec[i + n].first;
}
sort(vec.begin(), ve... | #include <bits/stdc++.h>
using namespace std;
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<pair<int, int>> vec(2 * n);
for (int i = 0; i < n; ++i) {
vec[i].second = i, vec[i + n].second = i + n;
cin >> vec[i].first >> vec[i + n].first;
}
sort(vec.begin(), ve... | [
"control_flow.branch.if.condition.change"
] | 1,023,403 | 1,023,404 | u873415461 | cpp |
p03233 | // https://agc028.contest.atcoder.jp/tasks/agc028_c
#include <bits/stdc++.h>
const int N = 1e5 + 5;
using namespace std;
typedef pair<int, int> ii;
vector<ii> mv;
int n, a[N], b[N];
int cnt[4], num[N];
long long ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int... | // https://agc028.contest.atcoder.jp/tasks/agc028_c
#include <bits/stdc++.h>
const int N = 1e5 + 5;
using namespace std;
typedef pair<int, int> ii;
vector<ii> mv;
int n, a[N], b[N];
int cnt[4], num[N];
long long ans;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
for (int... | [
"literal.number.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,023,405 | 1,023,406 | u900485553 | cpp |
p03233 | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define repd(i, a, b) for (int i = a; i >= b; --i)
#define per(i, a, b) for (int i = a; i >= b; --i)
#define rvc(i, S) for (int i = 0; i < (int)S.size(); ++i)
#define pb push_back
#define fi first
#define se second
#define debug(...) fprintf(st... | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; ++i)
#define repd(i, a, b) for (int i = a; i >= b; --i)
#define per(i, a, b) for (int i = a; i >= b; --i)
#define rvc(i, S) for (int i = 0; i < (int)S.size(); ++i)
#define pb push_back
#define fi first
#define se second
#define debug(...) fprintf(st... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 1,023,409 | 1,023,410 | u978960267 | cpp |
p03233 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,023,413 | 1,023,414 | u711985352 | cpp |
p03233 | #include <algorithm>
#include <iostream>
using namespace std;
long long n, i, A[100005], B[100005], V[200005], sumx, sumy, s, rez, ind, sum;
int main() {
ios::sync_with_stdio(false);
/*
Se observa ca exista 4 tipuri de noduri: a. Are legatura de tip A si B (se
aduna A[i]+B[i]) b. Are legatura de tip A (A[i]) c.... | #include <algorithm>
#include <iostream>
using namespace std;
long long n, i, A[100005], B[100005], V[200005], sumx, sumy, s, rez, ind, sum;
int main() {
ios::sync_with_stdio(false);
/*
Se observa ca exista 4 tipuri de noduri: a. Are legatura de tip A si B (se
aduna A[i]+B[i]) b. Are legatura de tip A (A[i]) c.... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,023,415 | 1,023,416 | u184697276 | cpp |
p03233 | #include <algorithm>
#include <iostream>
using namespace std;
long long n, i, A[100005], B[100005], V[100005], sumx, sumy, s, rez, ind, sum;
int main() {
ios::sync_with_stdio(false);
/*
Se observa ca exista 4 tipuri de noduri: a. Are legatura de tip A si B (se
aduna A[i]+B[i]) b. Are legatura de tip A (A[i]) c.... | #include <algorithm>
#include <iostream>
using namespace std;
long long n, i, A[100005], B[100005], V[200005], sumx, sumy, s, rez, ind, sum;
int main() {
ios::sync_with_stdio(false);
/*
Se observa ca exista 4 tipuri de noduri: a. Are legatura de tip A si B (se
aduna A[i]+B[i]) b. Are legatura de tip A (A[i]) c.... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,023,418 | 1,023,416 | u184697276 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// INSERT ABOVE HERE
signed main() {
Int n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// INSERT ABOVE HERE
signed main() {
Int n;
cin >> n;
... | [
"expression.operation.binary.change"
] | 1,023,431 | 1,023,432 | u687214625 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// INSERT ABOVE HERE
signed main() {
Int n;
cin >> n;
... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
// INSERT ABOVE HERE
signed main() {
Int n;
cin >> n;
... | [
"expression.operation.binary.change"
] | 1,023,433 | 1,023,432 | u687214625 | cpp |
p03233 | #include <bits/stdc++.h>
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define LL long long
using namespace std;
template <typename T> void read(T &x) {
x = 0;
int f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -1;
for (; isd... | #include <bits/stdc++.h>
#define max(a, b) (((a) > (b)) ? (a) : (b))
#define min(a, b) (((a) < (b)) ? (a) : (b))
#define LL long long
using namespace std;
template <typename T> void read(T &x) {
x = 0;
int f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -1;
for (; isd... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,023,438 | 1,023,437 | u823378651 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
using pi = pair<int, int>;
const int64 INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<pi> A;
int64 latte = 0, malta = 0;
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
A.emplace_back(x, i);
A.emplace_back(... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
using pi = pair<int, int>;
const int64 INF = 1LL << 60;
int main() {
int N;
cin >> N;
vector<pi> A;
int64 latte = 0, malta = 0;
for (int i = 0; i < N; i++) {
int x, y;
cin >> x >> y;
A.emplace_back(x, i);
A.emplace_back(... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 1,023,448 | 1,023,449 | u524343822 | cpp |
p03233 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef ve... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef ve... | [] | 1,023,450 | 1,023,451 | u007610006 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for (int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for (int ... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef complex<double> point;
#define xx real()
#define yy imag()
#define REP(i, a, b) for (int i = (a); i < (int)(b); i++)
#define REPN(i, a, b) for (int ... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,023,458 | 1,023,459 | u308650788 | cpp |
p03231 | /*
* @Author: WZY
* @School: HPU
* @Date: 2018-10-13 20:01:51
* @Last Modified by: WZY
* @Last Modified time: 2018-10-13 21:20:48
*/
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <strin... | /*
* @Author: WZY
* @School: HPU
* @Date: 2018-10-13 20:01:51
* @Last Modified by: WZY
* @Last Modified time: 2018-10-13 21:21:42
*/
#include <algorithm>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <strin... | [
"control_flow.loop.for.condition.change",
"control_flow.branch.if.condition.change"
] | 1,023,480 | 1,023,481 | u849365377 | cpp |
p03231 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9
#define MOD 1000000007
#define MAX 210000
#define ll long long
using ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9
#define MOD 1000000007
#define MAX 210000
#define ll long long
using ... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,023,484 | 1,023,485 | u388552482 | cpp |
p03231 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <exception>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
typ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <exception>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <vector>
using namespace std;
typ... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 1,023,499 | 1,023,500 | u103539599 | cpp |
p03231 | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; i++)
long long N, M, L, D, l, ans;
char s[110000], t[110000];
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
inline void chec(long long d) {
if (d <= ans)
return;
l = L / d;
long long pos, p, ... | #include <bits/stdc++.h>
#define fo(i, a, b) for (int i = a; i <= b; i++)
long long N, M, L, D, l, ans;
char s[110000], t[110000];
long long gcd(long long a, long long b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
inline void chec(long long d) {
if (d <= ans)
return;
l = L / d;
long long pos, p, ... | [
"identifier.change",
"expression.operation.binary.change"
] | 1,023,514 | 1,023,515 | u334519666 | cpp |
p03231 | #include <bits/stdc++.h>
#define MAXN 200001
using namespace std;
/*
* author : vivekcrux
*/
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
// freopen("input.txt","r",stdin);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, m, i, j, k;
cin >> n >> m;
string s, t;
... | #include <bits/stdc++.h>
#define MAXN 200001
using namespace std;
/*
* author : vivekcrux
*/
typedef long long ll;
typedef pair<ll, ll> pll;
int main() {
// freopen("input.txt","r",stdin);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll n, m, i, j, k;
cin >> n >> m;
string s, t;
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 1,023,554 | 1,023,555 | u965943031 | cpp |
p03231 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#includ... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 1,023,585 | 1,023,586 | u614363347 | cpp |
p03231 | #include <bits/stdc++.h>
#define rep(i, a, n) for (int(i) = (int)(a); (i) < (int)(n); ++(i))
#define repe(i, a, n) for (int(i) = (int)(a); (i) <= (int)(n); ++(i))
#define repif(i, a, x) for (int(i) = (int)(a); (x); ++(i))
#define repr(i, a, n) for (int(i) = ((int)(a)-1); (i) >= (int)(n); --(i))
#define reper(i, a, n) f... | #include <bits/stdc++.h>
#define int llint
#define rep(i, a, n) for (int(i) = (int)(a); (i) < (int)(n); ++(i))
#define repe(i, a, n) for (int(i) = (int)(a); (i) <= (int)(n); ++(i))
#define repif(i, a, x) for (int(i) = (int)(a); (x); ++(i))
#define repr(i, a, n) for (int(i) = ((int)(a)-1); (i) >= (int)(n); --(i))
#defin... | [
"expression.operator.compare.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 1,023,589 | 1,023,590 | u660270504 | cpp |
p03231 | #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;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
main() {
ll N, M;
string S, T;
cin >> ... | #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;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
main() {
ll N, M;
string S, T;
cin >> ... | [
"identifier.change",
"io.output.change"
] | 1,023,599 | 1,023,600 | u157322125 | cpp |
p03233 | // includes {{{
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// }}}
// #include<bits/stdc++.h>
using namespace std;
using ll = long lon... | // includes {{{
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// }}}
// #include<bits/stdc++.h>
using namespace std;
using ll = long lon... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 1,023,601 | 1,023,602 | u884379688 | cpp |
p03233 | // includes {{{
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// }}}
// #include<bits/stdc++.h>
using namespace std;
using ll = long lon... | // includes {{{
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <tuple>
#include <vector>
// }}}
// #include<bits/stdc++.h>
using namespace std;
using ll = long lon... | [
"control_flow.branch.if.condition.change",
"identifier.change"
] | 1,023,603 | 1,023,602 | u884379688 | cpp |
p03233 | #include <cstdio>
#include <iostream>
#include <vector>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <limits.h>
#include <list>
#include <m... | #include <cstdio>
#include <iostream>
#include <vector>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <complex>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <limits.h>
#include <list>
#include <m... | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"identifier.change",
"assignment.value.change"
] | 1,023,604 | 1,023,605 | u152129372 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
const int max_n = 100111, inf = 1000111222;
int n, a[max_n], b[max_n];
multiset<pair<int, int>> xy, yx;
void add(int x, int y) {
// cout << "+ " << x << " " << y << endl;
xy.insert({x, y});
yx.insert({y, x});
}
void del(int x, int y) {
// cout << "- " << x << "... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 100111, inf = 1000111222;
int n, a[max_n], b[max_n];
multiset<pair<int, int>> xy, yx;
void add(int x, int y) {
// cout << "+ " << x << " " << y << endl;
xy.insert({x, y});
yx.insert({y, x});
}
void del(int x, int y) {
// cout << "- " << x << "... | [
"call.remove",
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,023,606 | 1,023,607 | u844891589 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
const int max_n = 100111, inf = 1000111222;
int n, a[max_n], b[max_n];
multiset<pair<int, int>> xy, yx;
void add(int x, int y) {
// cout << "+ " << x << " " << y << endl;
xy.insert({x, y});
yx.insert({y, x});
}
void del(int x, int y) {
// cout << "- " << x << "... | #include <bits/stdc++.h>
using namespace std;
const int max_n = 100111, inf = 1000111222;
int n, a[max_n], b[max_n];
multiset<pair<int, int>> xy, yx;
void add(int x, int y) {
// cout << "+ " << x << " " << y << endl;
xy.insert({x, y});
yx.insert({y, x});
}
void del(int x, int y) {
// cout << "- " << x << "... | [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 1,023,608 | 1,023,607 | u844891589 | cpp |
p03233 | #include <bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i, a, b) for (register sign i = (sign)a; i <= (sign)b; ++i)
#define Fordown(i, a, b) for (register sign i = (sign)a; i >= (sign)b; --i)
bool cmax(sign &a, sign b) { return (a < b) ? a = b, 1 : 0; }
bool cmin(sign &a, sign ... | #include <bits/stdc++.h>
using namespace std;
typedef int sign;
typedef long long ll;
#define For(i, a, b) for (register sign i = (sign)a; i <= (sign)b; ++i)
#define Fordown(i, a, b) for (register sign i = (sign)a; i >= (sign)b; --i)
bool cmax(sign &a, sign b) { return (a < b) ? a = b, 1 : 0; }
bool cmin(sign &a, sign ... | [
"call.arguments.change"
] | 1,023,611 | 1,023,612 | u332108407 | cpp |
p03233 | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i <... | #include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)m; i <... | [
"control_flow.branch.if.condition.change"
] | 1,023,615 | 1,023,616 | u352642493 | cpp |
p03233 | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define uint ungigned
#define db double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pli pair<ll, int>
#define vi vector<int>
#define vpi vector<pii>
#define IT iterator
#define PB push_back
#define MK make_pair
#define LB lower_bound... | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define uint ungigned
#define db double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pli pair<ll, int>
#define vi vector<int>
#define vpi vector<pii>
#define IT iterator
#define PB push_back
#define MK make_pair
#define LB lower_bound... | [
"assignment.value.change",
"call.function.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 1,023,619 | 1,023,620 | u579191570 | cpp |
p03234 | #include <bits/stdc++.h>
#define il inline
#define ll long long
const int N = 605, P = 1e9 + 7;
int n, K, ans, to[N], s[N], f[N][N], g[N];
il int cal(int l, int r) {
if ((s[r] - s[l - 1] & 1) || (r - l + 1 & 1))
return 0;
int i;
for (i = l; i <= r; i++)
if (to[i] && (to[i] < l || to[i] > r))
retur... | #include <bits/stdc++.h>
#define il inline
#define ll long long
const int N = 605, P = 1e9 + 7;
int n, K, ans, to[N], s[N], f[N][N], g[N];
il int cal(int l, int r) {
if ((s[r] - s[l - 1] & 1) || (r - l + 1 & 1))
return 0;
int i;
for (i = l; i <= r; i++)
if (to[i] && (to[i] < l || to[i] > r))
retur... | [
"control_flow.loop.for.initializer.change",
"assignment.change"
] | 1,023,623 | 1,023,624 | u562973253 | cpp |
p03234 | #include <bits/stdc++.h>
#define ll long long
#define ljc 998244353
using namespace std;
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10ll + ch - '0';
ch = getchar();
}
return x ... | #include <bits/stdc++.h>
#define ll long long
#define ljc 1000000007
using namespace std;
inline ll read() {
ll x = 0, f = 1;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10ll + ch - '0';
ch = getchar();
}
return x... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 1,023,625 | 1,023,626 | u634343213 | cpp |
p03234 | #include <algorithm>
// #include <cstdlib>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <map>
#include <queue>
#include <set>
#include <string>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef double db;
const int oo = 2139063143;
co... | #include <algorithm>
// #include <cstdlib>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <map>
#include <queue>
#include <set>
#include <string>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef double db;
const int oo = 2139063143;
co... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 1,023,633 | 1,023,634 | u110991149 | cpp |
p03234 | #include <iostream>
using i64 = long long;
const i64 MOD = 1000000007;
const int N = 600 + 7;
int n, k;
int to[N];
int cnt[N];
i64 f[N][N], g[N][N];
i64 dfac_[N], *dfac;
i64 ans;
int main() {
// freopen("code.in", "r", stdin);
// freopen("code.out", "w", stdout);
scanf("%d%d", &n, &k), n <<= 1;
for (int i ... | #include <iostream>
using i64 = long long;
const i64 MOD = 1000000007;
const int N = 600 + 7;
int n, k;
int to[N];
int cnt[N];
i64 f[N][N], g[N][N];
i64 dfac_[N], *dfac;
i64 ans;
int main() {
// freopen("code.in", "r", stdin);
// freopen("code.out", "w", stdout);
scanf("%d%d", &n, &k), n <<= 1;
for (int i ... | [
"call.arguments.change"
] | 1,023,635 | 1,023,636 | u260874358 | cpp |
p03234 | /*
Author: QAQAutomaton
Lang: C++
Code: D.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#define Debug debug("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#... | /*
Author: QAQAutomaton
Lang: C++
Code: D.cpp
Mail: lk@qaq-am.com
Blog: https://www.qaq-am.com/
*/
#include <bits/stdc++.h>
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define DEBUG printf("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#define Debug debug("Passing [%s] in LINE %d\n", __FUNCTION__, __LINE__)
#... | [] | 1,023,642 | 1,023,643 | u228297051 | cpp |
p03234 | // Clockwork is still ticking.
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
typedef pair<int, int> pii;
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define fst first
#define snd second
#define SZ(u) ((int)(u).size())
#define ALL(u) (u).begin()... | // Clockwork is still ticking.
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned int UI;
typedef pair<int, int> pii;
#define DEBUG(...) fprintf(stderr, __VA_ARGS__)
#define mp make_pair
#define fst first
#define snd second
#define SZ(u) ((int)(u).size())
#define ALL(u) (u).begin()... | [
"assignment.change"
] | 1,023,648 | 1,023,649 | u284781029 | cpp |
p03234 | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
long long read() {
long long x = 0, w = 1;
char ch = getchar();
while (!isdigit(ch))
w = ch == '-' ? -1 : 1, c... | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
long long read() {
long long x = 0, w = 1;
char ch = getchar();
while (!isdigit(ch))
w = ch == '-' ? -1 : 1, c... | [
"assignment.change"
] | 1,023,667 | 1,023,668 | u778172613 | cpp |
p03234 | #include <bits/stdc++.h>
#define il inline
#define stt static
#define rg register
#define ll long long
#define db double
#define pii pair<int, int>
#define mp make_pair
#define fst first
#define snd second
#define pb push_back
#define y1 substitute_of_y1
#define DEBUG(x) cerr << #x " = " << x << endl;
using namespace s... | #include <bits/stdc++.h>
#define il inline
#define stt static
#define rg register
#define ll long long
#define db double
#define pii pair<int, int>
#define mp make_pair
#define fst first
#define snd second
#define pb push_back
#define y1 substitute_of_y1
#define DEBUG(x) cerr << #x " = " << x << endl;
using namespace s... | [
"control_flow.loop.for.initializer.change",
"expression.operation.binary.remove"
] | 1,023,671 | 1,023,672 | u484538410 | cpp |
p03234 | #include <bits/stdc++.h>
#define x first
#define y second
#define y1 Y1
#define y2 Y2
#define mp make_pair
#define pb push_back
#define DEBUG(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax(T &a, T b) {
return a < ... | #include <bits/stdc++.h>
#define x first
#define y second
#define y1 Y1
#define y2 Y2
#define mp make_pair
#define pb push_back
#define DEBUG(x) cout << #x << " = " << x << endl;
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
template <typename T> inline int Chkmax(T &a, T b) {
return a < ... | [
"expression.operation.binary.add"
] | 1,023,673 | 1,023,674 | u530846427 | cpp |
p03234 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ <<... | [
"type_conversion.add"
] | 1,023,679 | 1,023,680 | u525288965 | cpp |
p03234 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 6e2 + 10;
const int mod = 1e9 + 7;
int c[maxn][maxn], dp[maxn][maxn], tmp[maxn], g[maxn];
int main() {
int n, K, a, b;
scanf("%d%d", &n, &K);
for (int i = 1; i <= K; i++) {
scanf("%d%d", &a, &b);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 6e2 + 10;
const int mod = 1e9 + 7;
int c[maxn][maxn], dp[maxn][maxn], tmp[maxn], g[maxn];
int main() {
int n, K, a, b;
scanf("%d%d", &n, &K);
for (int i = 1; i <= K; i++) {
scanf("%d%d", &a, &b);
... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 1,023,683 | 1,023,684 | u264309267 | cpp |
p03234 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 6e2 + 10;
const int mod = 1e9 + 7;
int c[maxn][maxn], dp[maxn][maxn], tmp[maxn], g[maxn];
int main() {
int n, K, a, b;
scanf("%d%d", &n, &K);
for (int i = 1; i <= K; i++) {
scanf("%d%d", &a, &b);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 6e2 + 10;
const int mod = 1e9 + 7;
int c[maxn][maxn], dp[maxn][maxn], tmp[maxn], g[maxn];
int main() {
int n, K, a, b;
scanf("%d%d", &n, &K);
for (int i = 1; i <= K; i++) {
scanf("%d%d", &a, &b);
... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 1,023,685 | 1,023,686 | u264309267 | cpp |
p03234 | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
////////////////... | #include <algorithm>
#include <climits>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; A++)
using namespace std;
////////////////... | [
"expression.operation.binary.add"
] | 1,023,690 | 1,023,691 | u259396003 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.