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 |
|---|---|---|---|---|---|---|---|
p03178 | // Code by 27.
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <tim... | // Code by 27.
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <tim... | [
"expression.operation.binary.remove"
] | 986,487 | 986,488 | u147008092 | cpp |
p03178 | // Code by 27.
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <tim... | // Code by 27.
#include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <memory.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdlib.h>
#include <string>
#include <tim... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"expression.operation.binary.remove"
] | 986,489 | 986,488 | u147008092 | cpp |
p03178 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define Endl endl
#define mp make_pair
#define rep(N) for (int i = 0; i < N; i++)
#define repj(N) for (... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
#define Endl endl
#define mp make_pair
#define rep(N) for (int i = 0; i < N; i++)
#define repj(N) for (... | [] | 986,490 | 986,491 | u303964289 | cpp |
p03178 | #include <bits/stdc++.h>
#define FI first
#define SE second
#define PB push_back
#define ll long long
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ROF(i, a, b) for (int i = b - 1; i >= a; i--)
#define YES(i) cout << (i ? "YES" : "NO") << endl
#define Yes(i) cout << (i ? "Yes" : "No") << endl
#define co(i) c... | #include <bits/stdc++.h>
#define FI first
#define SE second
#define PB push_back
#define ll long long
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ROF(i, a, b) for (int i = b - 1; i >= a; i--)
#define YES(i) cout << (i ? "YES" : "NO") << endl
#define Yes(i) cout << (i ? "Yes" : "No") << endl
#define co(i) c... | [
"call.arguments.change",
"assignment.change"
] | 986,494 | 986,495 | u094270015 | cpp |
p03178 | #include <bits/stdc++.h>
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define nyan "(=^･ω･^=)"
#define mkp make_pair
#define lP pair<ll, ll>
#define iP pair<int, int>
typedef long long ll;
using namespace std;
string K;
vector<int> s;
ll DP[100][2], res;
int D;
int... | #include <bits/stdc++.h>
#define mod 1000000007
#define sp ' '
#define intmax 2147483647
#define llmax 9223372036854775807
#define nyan "(=^･ω･^=)"
#define mkp make_pair
#define lP pair<ll, ll>
#define iP pair<int, int>
typedef long long ll;
using namespace std;
string K;
vector<int> s;
ll DP[100][2], res;
int D;
int... | [
"assignment.change"
] | 986,498 | 986,499 | u015514760 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int n, k;
char s[10005];
LL dp[10005][105];
int mod = 1e9 + 7;
int main() {
scanf("%s", &s);
scanf("%d", &k);
n = strlen(s);
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < k; j++) {
dp... | #include <bits/stdc++.h>
using namespace std;
#define LL long long
int n, k;
char s[10005];
LL dp[10005][105];
int mod = 1e9 + 7;
int main() {
scanf("%s", &s);
scanf("%d", &k);
n = strlen(s);
memset(dp, 0, sizeof(dp));
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j < k; j++) {
dp... | [
"assignment.change"
] | 986,529 | 986,530 | u969930880 | cpp |
p03178 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 10050;
const int M = 100;
const int mod = 1e9 + 7;
int add(int x, int y) {
x += y;
return x >= mod ? x - mod : x;
}
int sub(int x, int y) {
x -= y;
return x < 0 ? x + mod : x;
}
int mul(int x, int y) { return (ll)x * y % mod; }
int... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int N = 10050;
const int M = 100;
const int mod = 1e9 + 7;
int add(int x, int y) {
x += y;
return x >= mod ? x - mod : x;
}
int sub(int x, int y) {
x -= y;
return x < 0 ? x + mod : x;
}
int mul(int x, int y) { return (ll)x * y % mod; }
int... | [
"assignment.change"
] | 986,545 | 986,546 | u939096624 | cpp |
p03178 | #include <bits/stdc++.h>
#define REP(a, b) for (int a = 0; a < b; a++)
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define mp make_pair
#define f first
#define s second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> LL;
typedef vector<int> vi;
con... | #include <bits/stdc++.h>
#define REP(a, b) for (int a = 0; a < b; a++)
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define mp make_pair
#define f first
#define s second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef pair<ll, ll> LL;
typedef vector<int> vi;
con... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 986,549 | 986,548 | u073686265 | cpp |
p03178 | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | #include <bits/stdc++.h>
#define fr(i, n) for (int i = 0; i < (n); ++i)
#define foor(i, a, b) for (int i = (a); i <= (b); ++i)
#define rf(i, n) for (int i = (n); i--;)
#define roof(i, b, a) for (int i = (b); i >= (a); --i)
#define elsif else if
#define all(x) x.begin(), x.end()
#define Sort(x) sort(all(x))
#define Reve... | [] | 986,552 | 986,553 | u283869437 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
struct SEG {
ll seg[1 << 19], la[1 << 19];
SEG(void) {
for (int i = 0; i < 1 << 19; i++)
s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
struct SEG {
ll seg[1 << 19], la[1 << 19];
SEG(void) {
for (int i = 0; i < 1 << 19; i++)
s... | [
"function.return_value.change",
"expression.operation.unary.add"
] | 986,691 | 986,692 | u743900647 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
struct SEG {
ll seg[1 << 19], la[1 << 19];
SEG(void) {
for (int i = 0; i < 1 << 19; i++)
s... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double D;
typedef pair<ll, ll> P;
#define M 1000000007
#define F first
#define S second
#define PB push_back
#define INF 100000000000000000
struct SEG {
ll seg[1 << 19], la[1 << 19];
SEG(void) {
for (int i = 0; i < 1 << 19; i++)
s... | [
"function.return_value.change",
"expression.operation.unary.add"
] | 986,693 | 986,692 | u743900647 | cpp |
p03182 | #include <bits/stdc++.h>
#define ll long long
#define mid ((l + r) >> 1)
#define lc (root << 1)
#define rc (root << 1 | 1)
#define lowbit(x) (x & -x)
using namespace std;
const int N = 2e5 + 7;
const ll inf = 1e18;
int n, m;
ll tre[N << 2], tag[N << 2];
vector<pair<int, int>> vec[N];
void push_down(int root) {
if (ta... | #include <bits/stdc++.h>
#define ll long long
#define mid ((l + r) >> 1)
#define lc (root << 1)
#define rc (root << 1 | 1)
#define lowbit(x) (x & -x)
using namespace std;
const int N = 2e5 + 7;
const ll inf = 1e18;
int n, m;
ll tre[N << 2], tag[N << 2];
vector<pair<int, int>> vec[N];
void push_down(int root) {
if (ta... | [
"call.arguments.add",
"call.arguments.change"
] | 986,701 | 986,702 | u171891488 | cpp |
p03182 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 200010;
int n, m, kq, tmp;
int T[4 * N], B[4 * N];
#define goc 1, 0, n
#define lef 2 * s, l, mid
#define rig 2 * s + 1, mid + 1, r
#define mid (l + r) / 2
void trans(int s) {
if (!B[s])
return;
T[2 * s] += B[s];
T[2 * s + 1] += ... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 200010;
int n, m, kq, tmp;
int T[4 * N], B[4 * N];
#define goc 1, 0, n
#define lef 2 * s, l, mid
#define rig 2 * s + 1, mid + 1, r
#define mid (l + r) / 2
void trans(int s) {
if (!B[s])
return;
T[2 * s] += B[s];
T[2 * s + 1] += ... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 986,718 | 986,719 | u815544868 | cpp |
p03182 | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 2000002
#define mod 1000000007
ll add(ll a, ll b) {
a += b... | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 986,733 | 986,734 | u812771098 | cpp |
p03182 | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e9
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;
... | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 986,735 | 986,734 | u812771098 | cpp |
p03182 | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 2000002
#define mod 1000000007
ll add(ll a, ll b) {
a += b... | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 986,733 | 986,737 | u812771098 | cpp |
p03182 | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e9
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;
... | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 986,735 | 986,737 | u812771098 | cpp |
p03182 | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 2000002
#define mod 1000000007
ll add(ll a, ll b) {
a += b... | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 986,733 | 986,738 | u812771098 | cpp |
p03182 | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e9
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;
... | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 986,735 | 986,738 | u812771098 | cpp |
p03182 | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 2000002
#define mod 1000000007
ll add(ll a, ll b) {
a += b... | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 986,733 | 986,739 | u812771098 | cpp |
p03182 | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e9
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;
... | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 986,735 | 986,739 | u812771098 | cpp |
p03182 | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 2000002
#define mod 1000000007
ll add(ll a, ll b) {
a += b... | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 986,733 | 986,740 | u812771098 | cpp |
p03182 | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e9
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;
... | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 986,735 | 986,740 | u812771098 | cpp |
p03182 | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e9
#define max_n 200002
#define mod 1000000007
ll add(ll a, ll b) {
a += b;
... | // in the name of Allah
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define pb push_back
#define ll long long
#define double long double
#define sz(x) ((int)(x.size()))
#define fr first
#define se second
#define inf 1e18
#define max_n 2000002
#define mod 1000000007
ll add(ll a, ll b) {
a += b... | [
"preprocessor.define.value.change",
"literal.float.change",
"literal.integer.change"
] | 986,735 | 986,743 | u812771098 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 986,753 | 986,754 | u443685186 | cpp |
p03182 | #include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> ostream &operator<<(ostrea... | #include <bits/stdc++.h>
using namespace std;
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
template <class T> using V = vector<T>;
template <class T> using VV = V<V<T>>;
constexpr ll TEN(int n) { return (n == 0) ? 1 : 10 * TEN(n - 1); }
template <class T> ostream &operator<<(ostrea... | [
"expression.operation.binary.add"
] | 986,757 | 986,758 | u965174248 | cpp |
p03182 | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int N, M;
vector<pair<int, int>> intv[200200];
const int Z = 1 << 18;
struct node {
node() { sum = mx = 0; }
node(int x) {
sum = mx = x;
if (mx < 0)
mx = 0;
}
long long sum, mx;
node operator+(no... | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
int N, M;
vector<pair<int, int>> intv[200200];
const int Z = 1 << 18;
struct node {
node() { sum = mx = 0; }
node(long long x) {
sum = mx = x;
if (mx < 0)
mx = 0;
}
long long sum, mx;
node operat... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 986,759 | 986,760 | u233632872 | cpp |
p03183 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
// State
// dp[i][j]: The maximum value we can get by using blocks from
// 0...i and sum of blocks in the tower = j
// Initialization
// dp[0][W[0]] = V[0]
// Transitions
// dp[i][j] = max(V[j]+dp[i-W[0]][j-1], dp[i][j-1])
// Order of evaluation
// R... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
// State
// dp[i][j]: The maximum value we can get by using blocks from
// 0...i and sum of blocks in the tower = j
// Initialization
// dp[0][W[0]] = V[0]
// Transitions
// dp[i][j] = max(V[j]+dp[i-W[0]][j-1], dp[i][j-1])
// Order of evaluation
// R... | [
"literal.number.change",
"call.arguments.change"
] | 986,766 | 986,767 | u463134004 | cpp |
p03183 | #include <bits/stdc++.h>
#define F first
#define S second
#define sq(x) (x) * (x)
using namespace std;
typedef long long LL;
typedef pair<LL, LL> pii;
const LL INF = 0x3f3f3f3f3f3f3f3fLL;
const LL MOD = 1e9 + 7;
struct B {
int w, s, v;
bool operator<(const B &rhs) const { return w + s < rhs.w + rhs.s; }
};
void mar... | #include <bits/stdc++.h>
#define F first
#define S second
#define sq(x) (x) * (x)
using namespace std;
typedef long long LL;
typedef pair<LL, LL> pii;
const LL INF = 0x3f3f3f3f3f3f3f3fLL;
const LL MOD = 1e9 + 7;
struct B {
int w, s;
LL v;
bool operator<(const B &rhs) const { return w + s < rhs.w + rhs.s; }
};
voi... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 986,807 | 986,808 | u194917097 | cpp |
p03183 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<l_l> vpl;
typedef vector<string> vs;
typedef pair<l_l, ll> lll;
#define pb push_back
#define... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> P;
typedef pair<ll, ll> l_l;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<l_l> vpl;
typedef vector<string> vs;
typedef pair<l_l, ll> lll;
#define pb push_back
#define... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 986,841 | 986,842 | u796877631 | cpp |
p03183 | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll, ll>
#define iii pair<ii, ll>
#define fi first
#define se second
#define endl '\n... | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define ll long long
#define ii pair<ll, ll>
#define iii pair<ii, ll>
#define fi first
#define se second
#define endl '\n... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.variable.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 986,895 | 986,894 | u780811667 | cpp |
p03183 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LIN... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define MOD 1000000007
#define MOD2 998244353
#define INF ((1 << 30) - 1)
#define LIN... | [
"expression.operation.binary.remove"
] | 986,900 | 986,901 | u089869622 | cpp |
p03183 | #include <bits/stdc++.h>
// ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// clock_t start=clock();clock_t
// end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int, int> pii;
typedef pair<pii... | #include <bits/stdc++.h>
// ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
// clock_t start=clock();clock_t
// end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int, int> pii;
typedef pair<pii... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.branch.if.condition.change"
] | 986,907 | 986,906 | u357265888 | cpp |
p03183 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
#include <string.h>
#define inf 9000000000000000000
#define maxn 200006
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
#define endl '\n'
#define mapint_iterator map<int, int>::iterator
#define mapll_iterator map<ll, l... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define mod 1000000007
#include <string.h>
#define inf 9000000000000000000
#define maxn 200006
typedef pair<ll, ll> pll;
typedef pair<int, int> pint;
#define endl '\n'
#define mapint_iterator map<int, int>::iterator
#define mapll_iterator map<ll, l... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"identifier.replace.remove",
"literal.replace.add",
"io.output.change"
] | 986,916 | 986,917 | u920271139 | cpp |
p03183 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
struct edge {
int to;
};
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
struct edge {
int to;
};
... | [
"expression.operation.binary.add"
] | 986,931 | 986,932 | u092269433 | cpp |
p03183 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define F0R(i, a) ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define F0R(i, a) ... | [
"misc.opposites",
"expression.operator.compare.change",
"function.return_value.change",
"expression.operation.binary.change"
] | 986,982 | 986,983 | u767093102 | cpp |
p03183 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define F0R(i, a) ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define FOR(i, a, b) for (int i = a; i < (int)b; i++)
#define F0R(i, a) ... | [
"literal.number.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 986,985 | 986,983 | u767093102 | cpp |
p03183 | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n;
long long dp[N], ans;
struct node {
int w, s;
long long v;
} a[N];
bool cmp(node x, node y) { return x.w + x.s < y.w + y.s; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d%lld", &a[i].w, &a[i].s, &a[i].v... | #include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int n;
long long dp[N], ans;
struct node {
int w, s;
long long v;
} a[N];
bool cmp(node x, node y) { return x.w + x.s < y.w + y.s; }
int main() {
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
scanf("%d%d%lld", &a[i].w, &a[i].s, &a[i].v... | [
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 986,994 | 986,995 | u541361127 | cpp |
p03183 | #include <algorithm>
#include <iostream>
using namespace std;
const int MAXN = 1000 + 10;
const int MAXNA = 20000 + 20;
int n, ans;
int dp[MAXNA];
struct p {
int w;
int s;
int v;
} A[MAXN];
bool cmp(p a, p b) { return (a.w + a.s) < (b.w + b.s); }
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >... | #include <algorithm>
#include <iostream>
using namespace std;
const int MAXN = 1000 + 10;
const int MAXNA = 20000 + 20;
long long n, ans;
long long dp[MAXNA];
struct p {
int w;
int s;
int v;
} A[MAXN];
bool cmp(p a, p b) { return (a.w + a.s) < (b.w + b.s); }
int main() {
cin >> n;
for (int i = 1; i <= n; i++)... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 987,025 | 987,026 | u803932112 | cpp |
p03181 | #include <bits/stdc++.h>
#define ll long long
#define PB push_back
#define MP make_pair
#define ff first
#define ss second
using namespace std;
ll dp[100001] = {0}, ans[100001] = {0}, M, dpup[100001] = {0};
ll dfs(ll pt, vector<pair<ll, pair<ll, ll>>> adj[], ll old) {
ll v = 1;
vector<ll> vs;
ll zes = 0;
ll ... | #include <bits/stdc++.h>
#define ll long long
#define PB push_back
#define MP make_pair
#define ff first
#define ss second
using namespace std;
ll dp[100001] = {0}, ans[100001] = {0}, M, dpup[100001] = {0};
ll dfs(ll pt, vector<pair<ll, pair<ll, ll>>> adj[], ll old) {
ll v = 1;
vector<ll> vs;
ll zes = 0;
ll ... | [
"assignment.value.change",
"identifier.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 987,032 | 987,033 | u874786170 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
int n, m, tot = 0, head[100001], nxt[200002], to[200002];
long long g[100001], f[100001];
vector<long long> pre[100001], rev[100001];
void addedge(int u, int v) {
++tot;
nxt[tot] = head[u];
to[tot] = v;
head[u] = tot;
return;
}
long long dfs(int index, int p) {
... | #include <bits/stdc++.h>
using namespace std;
int n, m, tot = 0, head[100001], nxt[200002], to[200002];
long long g[100001], f[100001];
vector<long long> pre[100001], rev[100001];
void addedge(int u, int v) {
++tot;
nxt[tot] = head[u];
to[tot] = v;
head[u] = tot;
return;
}
long long dfs(int index, int p) {
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 987,036 | 987,037 | u314499126 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
int n, m, tot = 0, head[100001], nxt[200002], to[200002];
long long g[100001], f[100001];
vector<long long> pre[100001], rev[100001];
void addedge(int u, int v) {
++tot;
nxt[tot] = head[u];
to[tot] = v;
head[u] = tot;
return;
}
long long dfs(int index, int p) {
... | #include <bits/stdc++.h>
using namespace std;
int n, m, tot = 0, head[100001], nxt[200002], to[200002];
long long g[100001], f[100001];
vector<long long> pre[100001], rev[100001];
void addedge(int u, int v) {
++tot;
nxt[tot] = head[u];
to[tot] = v;
head[u] = tot;
return;
}
long long dfs(int index, int p) {
... | [
"literal.number.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 987,038 | 987,037 | u314499126 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | #include <bits/stdc++.h>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define ALL(A) A.begin(), A.end()
#define RALL(A) A.rbegin(), A.rend()
typedef long long LL;
typedef pair<int, int> P;
const LL mod = 1000000007;
const LL LINF = 1LL << 62;
... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"assignment.change"
] | 987,041 | 987,042 | u640323045 | cpp |
p03181 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (ll i = 0; i < (... | [
"assignment.change"
] | 987,043 | 987,044 | u834415466 | cpp |
p03181 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int N, M;
vector<int> g[100010];
ll dp[100010];
ll ans[100010];
vector<ll> child[100010];
ll dfs(int now, ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int N, M;
vector<int> g[100010];
ll dp[100010];
ll ans[100010];
vector<ll> child[100010];
ll dfs(int now, ... | [
"assignment.change"
] | 987,045 | 987,046 | u646339490 | cpp |
p03181 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int N, M;
vector<int> g[100010];
ll dp[100010];
ll ans[100010];
vector<ll> child[100010];
ll dfs(int now, ... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#define MOD 1000000007
typedef long long ll;
using namespace std;
int N, M;
vector<int> g[100010];
ll dp[100010];
ll ans[100010];
vector<ll> child[100010];
ll dfs(int now, ... | [
"expression.operation.binary.add"
] | 987,045 | 987,047 | u646339490 | cpp |
p03181 | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
vi adj[100001];
int n, mod;
int add(int a, int b) { return (a += b) < mod... | #include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
using ii = pair<int, int>;
using vii = vector<ii>;
vi adj[100001];
int n, mod;
int add(int a, int b) { return (a += b) < mod... | [
"expression.unary.arithmetic.add"
] | 987,048 | 987,049 | u562319622 | cpp |
p03181 | #include "bits/stdc++.h"
#define ALL(g) (g).begin(), (g).end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, x, n) for (int i = x; i >= n; i--)
#define rrep(i, n) RREP(i, n, 0)
#define pb push_back
#pragma GCC optimize("-O3")
using namespace std;
// #define DEBUG_IS_... | #include "bits/stdc++.h"
#define ALL(g) (g).begin(), (g).end()
#define REP(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, x, n) for (int i = x; i >= n; i--)
#define rrep(i, n) RREP(i, n, 0)
#define pb push_back
#pragma GCC optimize("-O3")
using namespace std;
// #define DEBUG_IS_... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 987,065 | 987,066 | u584355711 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
int n, M;
vector<int> g[100001];
ll dp[100001], ans[100001];
ll dfs(int v, int p) {
dp[v] = 1;
rep(i, g[v].siz... | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define pb emplace_back
typedef long long ll;
typedef pair<int, int> pint;
int n, M;
vector<int> g[100001];
ll dp[100001], ans[100001];
ll dfs(int v, int p) {
dp[v] = 1;
rep(i, g[v].siz... | [
"expression.operation.binary.add"
] | 987,089 | 987,090 | u526367939 | cpp |
p03181 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <string>
#include <type_... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string.h>
#include <string>
#include <type_traits>
#include <... | [
"identifier.change",
"call.arguments.change"
] | 987,091 | 987,092 | u318857467 | cpp |
p03181 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int read() {
int x = 0, f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-')
f = 0;
c = getchar();
}
while (isdigit(c)) {
x = (x << 3) + (x << 1) + (c ^ 48);
c... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
int read() {
int x = 0, f = 1;
char c = getchar();
while (!isdigit(c)) {
if (c == '-')
f = 0;
c = getchar();
}
while (isdigit(c)) {
x = (x << 3) + (x << 1) + (c ^ 48);
c... | [
"expression.operation.binary.remove"
] | 987,096 | 987,097 | u066598563 | cpp |
p03181 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORE(x, xs) for (auto &x : xs)
const i... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORE(x, xs) for (auto &x : xs)
const i... | [
"assignment.change"
] | 987,098 | 987,099 | u957084285 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
#define int long long
inline long long in() {
long long x = 0;
char c = getchar();
bool neg = false;
while (c != '-' && ('0' > c || c > '9'))
c = getchar();
if (c == '-')
neg = true, c = getchar();
while ('0' <= c && c <= '9')
x = 10 * x + c - '0', c... | #include <bits/stdc++.h>
using namespace std;
#define int long long
inline long long in() {
long long x = 0;
char c = getchar();
bool neg = false;
while (c != '-' && ('0' > c || c > '9'))
c = getchar();
if (c == '-')
neg = true, c = getchar();
while ('0' <= c && c <= '9')
x = 10 * x + c - '0', c... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 987,135 | 987,136 | u815544868 | cpp |
p03181 | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#in... | [
"expression.operation.binary.remove"
] | 987,143 | 987,144 | u294531924 | cpp |
p03181 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
vector<int> G[100000];
ll dp[100000], dp2[100000];
ll M;
ll dfs(int v, int par) {
ll t = 1;
for (int to : G[v]) {
if (to == par)
continue;
(t *=... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const double PI = 3.141592653589793238;
const double EPS = 1e-10;
vector<int> G[100000];
ll dp[100000], dp2[100000];
ll M;
ll dfs(int v, int par) {
ll t = 1;
for (int to : G[v]) {
if (to == par)
continue;
(t *=... | [
"assignment.change"
] | 987,145 | 987,146 | u243961437 | cpp |
p03181 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef long double ld;
//#define int ll
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<short> vs;
typedef vector<vs> vvs;... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 987,149 | 987,150 | u443685186 | cpp |
p03181 | #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 <... | [
"assignment.change"
] | 987,155 | 987,156 | u352642493 | cpp |
p03181 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (int)(n); (i)++)
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<vector<int>> tmp(n);
rep(i, n - 1) {
int a, b;
scanf("%d%d", &a, &b);
a--, b--;
tmp[a].push_back(b);
tmp[b].push_back(a);
}
vector<... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; (i) < (int)(n); (i)++)
using namespace std;
int main() {
int n, m;
scanf("%d%d", &n, &m);
vector<vector<int>> tmp(n);
rep(i, n - 1) {
int a, b;
scanf("%d%d", &a, &b);
a--, b--;
tmp[a].push_back(b);
tmp[b].push_back(a);
}
vector<... | [
"assignment.change"
] | 987,167 | 987,168 | u987564901 | cpp |
p03182 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int maxn = 200010;
const int lo = 20;
const int off = 1 << lo;
const int siz = off * 2;
const long long inf = (1LL << 50);
int n, m;
int a[maxn], b[maxn], c[maxn];
int dp[maxn];
long long tour[siz], prop[siz];
// long long niz[maxn]... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
const int maxn = 200010;
const int lo = 20;
const int off = 1 << lo;
const int siz = off * 2;
const long long inf = (1LL << 50);
int n, m;
int a[maxn], b[maxn], c[maxn];
long long dp[maxn];
long long tour[siz], prop[siz];
// long long niz... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 987,195 | 987,196 | u943761541 | cpp |
p03182 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define loop(i, r, n) for (int i = (r); i < (n); i++)
#define pb push_back
#define all(in) in.begin(), in.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
retu... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rrep(i, n) for (int i = (n); i >= 0; i--)
#define loop(i, r, n) for (int i = (r); i < (n); i++)
#define pb push_back
#define all(in) in.begin(), in.end()
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
retu... | [
"call.add",
"call.arguments.change"
] | 987,205 | 987,206 | u842028864 | cpp |
p03182 | #include <bits/stdc++.h>
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define file(s) ... | #include <bits/stdc++.h>
#define int long long
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define file(s) ... | [
"expression.operation.binary.remove"
] | 987,209 | 987,210 | u089230684 | cpp |
p03183 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <s... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 987,234 | 987,235 | u483814783 | cpp |
p03184 | #include <bits/stdc++.h>
#define ll long long int
#define lld long double
#define pb push_back
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define vec vector<ll>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define mod 1000000007
#define nmod -1000000007
#define rep(i, a, b) for (ll i = a;... | #include <bits/stdc++.h>
#define ll long long int
#define lld long double
#define pb push_back
#define pii pair<ll, ll>
#define mi map<ll, ll>
#define vec vector<ll>
#define all(a) (a).begin(), (a).end()
#define F first
#define S second
#define mod 1000000007
#define nmod -1000000007
#define rep(i, a, b) for (ll i = a;... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 987,248 | 987,249 | u334773822 | cpp |
p03184 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e18;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const... |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 1e18;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const... | [
"literal.number.change",
"call.arguments.change"
] | 987,252 | 987,253 | u289381123 | cpp |
p03184 | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
#defi... | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
#defi... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 987,256 | 987,257 | u163525690 | cpp |
p03184 | #include <bits/stdc++.h>
using namespace std;
#define LL long long int
#define MOD 1000000007
#define MAXN 2000000
LL fact[MAXN + 3];
LL fastExponentiation(LL base, int p) {
if (p == 0)
return 1;
LL half = fastExponentiation(base, p / 2);
LL halfhalf = (half * half) % MOD;
if (p % 2 == 0)
return hal... | #include <bits/stdc++.h>
using namespace std;
#define LL long long int
#define MOD 1000000007
#define MAXN 2000000
LL fact[MAXN + 3];
LL fastExponentiation(LL base, int p) {
if (p == 0)
return 1;
LL half = fastExponentiation(base, p / 2);
LL halfhalf = (half * half) % MOD;
if (p % 2 == 0)
return hal... | [
"identifier.change",
"io.output.change"
] | 987,258 | 987,259 | u569149712 | cpp |
p03184 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define ff first
#define ss second
#define pb push_back
#define all(s) (s).begin(), (s).end()
const ll mod = 1e9 + 7;
ll h, w, x;
vector<pair<ll, ll>> arr;
vi ans, fact;
ll binexp(ll a) {
ll res = 1, y... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define ff first
#define ss second
#define pb push_back
#define all(s) (s).begin(), (s).end()
const ll mod = 1e9 + 7;
ll h, w, x;
vector<pair<ll, ll>> arr;
vi ans, fact;
ll binexp(ll a) {
ll res = 1, y... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 987,266 | 987,265 | u828117122 | cpp |
p03184 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <vector>
const int MOD = 1e9 + 7;
const int... | [
"expression.operation.binary.remove"
] | 987,292 | 987,293 | u050865477 | cpp |
p03184 | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define time_taken_start int begtime = clock();
#define time_taken_end ... | #include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define time_taken_start int begtime = clock();
#define time_taken_end ... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 987,305 | 987,306 | u002419600 | cpp |
p03184 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long int H, W;
int N;
int r[3030], c[3030];
vector<pair<int, int>> V;
long long int dp[3030];
long long int MOD = 1000000007;
long long int P[200005], inv_P[200005];
long long int POW(long long int a, long long int k) {
if (k ==... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
long long int H, W;
int N;
int r[3030], c[3030];
vector<pair<int, int>> V;
long long int dp[3030];
long long int MOD = 1000000007;
long long int P[200005], inv_P[200005];
long long int POW(long long int a, long long int k) {
if (k ==... | [
"assignment.value.change",
"assignment.change"
] | 987,311 | 987,312 | u835297884 | cpp |
p03184 | #include <bits/stdc++.h>
#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 rrep(i, n) for (int i = ((int)(n)-1); i >= 0; (i)--)
#define rrep1(i, n) for (int i = ((int)(n)); i > 0; (i)--)
#define sz(c) ((int)(c).size())
#define all(x) (x).begin(), (x).end... | #include <bits/stdc++.h>
#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 rrep(i, n) for (int i = ((int)(n)-1); i >= 0; (i)--)
#define rrep1(i, n) for (int i = ((int)(n)); i > 0; (i)--)
#define sz(c) ((int)(c).size())
#define all(x) (x).begin(), (x).end... | [
"identifier.change",
"call.function.change",
"literal.number.change",
"call.arguments.change",
"io.output.newline.add"
] | 987,315 | 987,316 | u228214259 | cpp |
p03184 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
// const ll mod = 998244353;
#define p_ary(ary, a, b, i) \
do { \
co... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const ll mod = 1000000007;
// const ll mod = 998244353;
#define p_ary(ary, a, b, i) \
do { \
co... | [
"literal.number.change",
"variable_declaration.value.change"
] | 987,319 | 987,320 | u506255180 | cpp |
p03184 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#define debug(x) cerr << #x << " = " << x << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef ... | [
"literal.number.change",
"expression.operation.binary.change"
] | 987,323 | 987,324 | u032789819 | cpp |
p03184 | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> ii;
vector<ii> adj;
const long long mod = 1000000007;
int fact[200000], invfact[200000], n, h, w, dp[200000], x, y;
int C(int k, int n) {
int ans = (invfact[k] % mod * invfact[n - k] % mod) % mod;
return (ans * fact[n]) % mod... | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> ii;
vector<ii> adj;
const long long mod = 1000000007;
int fact[200500], invfact[200500], n, h, w, dp[200500], x, y;
int C(int k, int n) {
int ans = (invfact[k] % mod * invfact[n - k] % mod) % mod;
return (ans * fact[n]) % mod... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 987,325 | 987,326 | u998997473 | cpp |
p03184 | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> ii;
vector<ii> adj;
const long long mod = 1000000007;
int fact[3500], invfact[3500], n, h, w, dp[3500], x, y;
int C(int k, int n) {
int ans = (invfact[k] % mod * invfact[n - k] % mod) % mod;
return (ans * fact[n]) % mod;
}
in... | #include <bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int, int> ii;
vector<ii> adj;
const long long mod = 1000000007;
int fact[200500], invfact[200500], n, h, w, dp[200500], x, y;
int C(int k, int n) {
int ans = (invfact[k] % mod * invfact[n - k] % mod) % mod;
return (ans * fact[n]) % mod... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 987,327 | 987,326 | u998997473 | cpp |
p03184 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 3000;
const int MAXNUM = 3e5;
const ll MOD = 1e9 + 7;
struct Point {
int x, y;
};
int h, w, n;
Point arr[MAXN + 10];
ll fact[MAXNUM + 10], invfact[MAXNUM + 10];
ll mypow(ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 3000;
const int MAXNUM = 3e5;
const ll MOD = 1e9 + 7;
struct Point {
int x, y;
};
int h, w, n;
Point arr[MAXN + 10];
ll fact[MAXNUM + 10], invfact[MAXNUM + 10];
ll mypow(ll ... | [
"assignment.change"
] | 987,328 | 987,329 | u998997473 | cpp |
p03184 | #include <bits/stdc++.h>
using namespace std;
#define MAXN 100005
typedef long long ll;
const ll mod = 1e9 + 7;
ll fac[MAXN], ifac[MAXN];
ll fastpow(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
(res *= a) %= mod;
(a *= a) %= mod;
b >>= 1;
}
return res;
}
ll C(int m, int n) { return fac[m] ... | #include <bits/stdc++.h>
using namespace std;
#define MAXN 200005
typedef long long ll;
const ll mod = 1e9 + 7;
ll fac[MAXN], ifac[MAXN];
ll fastpow(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
(res *= a) %= mod;
(a *= a) %= mod;
b >>= 1;
}
return res;
}
ll C(int m, int n) { return fac[m] ... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 987,330 | 987,331 | u978171121 | cpp |
p03184 | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tup... | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tup... | [
"expression.operation.binary.remove"
] | 987,342 | 987,343 | u602850810 | cpp |
p03184 | /*
Author: @karngyan
Team: BlundersPride
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef std::vector<ll> vll;
typedef std::pair<ll, ll> pll;
typedef std::vector<vll> vvll;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define end... | /*
Author: @karngyan
Team: BlundersPride
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef std::vector<ll> vll;
typedef std::pair<ll, ll> pll;
typedef std::vector<vll> vvll;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define end... | [
"literal.number.change",
"expression.operation.binary.change"
] | 987,351 | 987,352 | u863090510 | cpp |
p03184 | /*
Author: @karngyan
Team: BlundersPride
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef std::vector<ll> vll;
typedef std::pair<ll, ll> pll;
typedef std::vector<vll> vvll;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define end... | /*
Author: @karngyan
Team: BlundersPride
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef std::vector<ll> vll;
typedef std::pair<ll, ll> pll;
typedef std::vector<vll> vvll;
#define fast ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL)
#define end... | [
"literal.number.change",
"expression.operation.binary.change"
] | 987,351 | 987,353 | u863090510 | cpp |
p03184 | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define forlr(i, l, r) for (int i = int(l); i <= int(r); i++)
#define repeat(n) for (int hjfjke = 0; hjfjke < int(n); hjfjke++)
#define all(c) c.begin(), c.end()
#define ll long long
const int mod =... | #include <bits/stdc++.h>
using namespace std;
#define mp make_pair
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define forlr(i, l, r) for (int i = int(l); i <= int(r); i++)
#define repeat(n) for (int hjfjke = 0; hjfjke < int(n); hjfjke++)
#define all(c) c.begin(), c.end()
#define ll long long
const int mod =... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 987,359 | 987,360 | u503820274 | cpp |
p03184 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define ll long long
using namespace std;
#define BUF_SIZE 1048576
char _buf[BUF_SIZE], *_is = _buf, *_it = _buf;
inline char rdc() {
if (_is == _it)
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
#define ll long long
using namespace std;
#define BUF_SIZE 1048576
char _buf[BUF_SIZE], *_is = _buf, *_it = _buf;
inline char rdc() {
if (_is == _it)
... | [] | 987,361 | 987,362 | u378667182 | cpp |
p03184 | #include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define umax(x, y) x = max(x, y)
#define umin(x, y) x = min(x, y)
#define ll long long
#define ii pair<int, int>
#define iii pair<ii, int>
#define iiii pair<ii, ii>
#define sz(x) ((int)x.size())
#... | #include <bits/stdc++.h>
#define st first
#define nd second
#define pb push_back
#define ppb pop_back
#define ppf pop_front
#define umax(x, y) x = max(x, y)
#define umin(x, y) x = min(x, y)
#define ll long long
#define ii pair<int, int>
#define iii pair<ii, int>
#define iiii pair<ii, ii>
#define sz(x) ((int)x.size())
#... | [] | 987,365 | 987,366 | u918828564 | cpp |
p03184 | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
typedef long long ll;
ll mod = 1000000007, MAX = 100000, dp[3010][2] = {}, ans = 0;
pair<ll, ll> p[3010];
ll inv[100010], fact[100010], fi[100010];
void inverse() {
int i;
inv[1] = 1;
for (i = 2; i <= MAX; i++) {
inv[i] = mod - (... | #include <algorithm>
#include <iostream>
#include <utility>
using namespace std;
typedef long long ll;
ll mod = 1000000007, MAX = 200000, dp[3010][2] = {}, ans = 0;
pair<ll, ll> p[3010];
ll inv[200010], fact[200010], fi[200010];
void inverse() {
int i;
inv[1] = 1;
for (i = 2; i <= MAX; i++) {
inv[i] = mod - (... | [
"literal.number.change",
"variable_declaration.value.change",
"variable_declaration.array_dimensions.change"
] | 987,371 | 987,372 | u621509943 | cpp |
p03184 | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int mod = 1000000007;
long long inv[100100] = {0, 1}, fact[100100] = {1, 1}, ifact[100100] = {1, 1};
int H, W, N;
pair<int, int> P[3030];
long long D[3030];
int main() {
for (int i = 2; i < 100100; i++) {
in... | #include <algorithm>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
const int mod = 1000000007;
long long inv[200200] = {0, 1}, fact[200200] = {1, 1}, ifact[200200] = {1, 1};
int H, W, N;
pair<int, int> P[3030];
long long D[3030];
int main() {
for (int i = 2; i < 200200; i++) {
in... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 987,381 | 987,382 | u233632872 | cpp |
p03185 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX_PIERRE = 2 * 1e5;
int nbPierre, cost;
int hauteur[MAX_PIERRE];
struct Ligne {
int coeffDirect, ordOrigine;
long double f(int x) { return coeffDirect * x + ordOrigine; }
long double intersecX(Ligne autre) {
return (ordOrigin... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX_PIERRE = 2 * 1e5;
int nbPierre, cost;
int hauteur[MAX_PIERRE];
struct Ligne {
int coeffDirect, ordOrigine;
long double f(int x) { return coeffDirect * x + ordOrigine; }
long double intersecX(Ligne autre) {
return (ordOrigin... | [
"expression.operation.binary.remove"
] | 987,416 | 987,417 | u807305742 | cpp |
p03185 | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX_PIERRE = 2 * 1e5;
int nbPierre, cost;
int hauteur[MAX_PIERRE];
struct Ligne {
int coeffDirect, ordOrigine;
long double f(int x) { return coeffDirect * x + ordOrigine; }
long double intersecX(Ligne autre) {
return (ordOrigin... | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MAX_PIERRE = 2 * 1e5;
int nbPierre, cost;
int hauteur[MAX_PIERRE];
struct Ligne {
int coeffDirect, ordOrigine;
long double f(int x) { return coeffDirect * x + ordOrigine; }
long double intersecX(Ligne autre) {
return (ordOrigin... | [
"expression.operation.binary.remove",
"call.function.change"
] | 987,418 | 987,417 | u807305742 | cpp |
p03185 | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(X) (X).begin(), (X).end()
#define REP(i, x, y) for (ll i = x; i <= y; ++i)
vector<string> vec_splitter(string s) {
for (char &c : s)
... | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define all(X) (X).begin(), (X).end()
#define REP(i, x, y) for (ll i = x; i <= y; ++i)
vector<string> vec_splitter(string s) {
for (char &c : s)
... | [
"call.remove"
] | 987,419 | 987,420 | u921436946 | cpp |
p03185 |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define PB push_back
struct equation {
ll m, b; // y = m * x + b
ll y(ll x0) { return m * x0 + b; }
ld intersect(equation o) { r... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define rep(i, a, b) for (auto i = (a); i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define PB push_back
struct equation {
ll m, b; // y = m * x + b
ll y(ll x0) { return m * x0 + b; }
ld intersect(equation o) { re... | [
"expression.operation.unary.logical.remove",
"control_flow.branch.if.condition.change"
] | 987,430 | 987,431 | u092269433 | cpp |
p03185 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll N = 2e5 + 5, INF = 1e18;
ll n, C, h[N], dp[N];
// x = (b2 - b1) / (k1 - k2)
struct Line {
ll k, b;
Line(ll kk, ll bb) {
k = kk;
b = bb;
}
};
vector<Line> lines;
ld cross(Line a, Line b) { return (b.b -... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll N = 2e5 + 5, INF = 1e18;
ll n, C, h[N], dp[N];
// x = (b2 - b1) / (k1 - k2)
struct Line {
ll k, b;
Line(ll kk, ll bb) {
k = kk;
b = bb;
}
};
vector<Line> lines;
ld cross(Line a, Line b) { return (b.b -... | [
"literal.number.change",
"assignment.value.change",
"expression.operation.binary.change",
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 987,432 | 987,433 | u967326959 | cpp |
p03185 | /*dp[n] = 0;
for(ll i = n-1; i >= 1; --i){
dp[i] = INF;
for(ll j = i+1; j <= n; ++j){
dp[i] = min(dp[i], dp[j] + (a[i]-a[j])*(a[i]-a[j]) + c);
}
}
cout<<dp[1];*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18, N = 200005;
ll n, c,... | /*dp[n] = 0;
for(ll i = n-1; i >= 1; --i){
dp[i] = INF;
for(ll j = i+1; j <= n; ++j){
dp[i] = min(dp[i], dp[j] + (a[i]-a[j])*(a[i]-a[j]) + c);
}
}
cout<<dp[1];*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll INF = 1e18, N = 200005;
ll n, c,... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 987,434 | 987,435 | u967326959 | cpp |
p03185 | #include <bits/stdc++.h>
using namespace std;
// base:[Convex-Hull Trick -
// sataniC++](http://satanic0258.hatenablog.com/entry/2016/08/16/181331#fn-534591c8)
//追加する直線の傾きは単調（最小値なら傾きは単調減少、最大値なら傾きは単調増加）
template <typename T> struct ConvecHullTrick {
typedef pair<T, T> Line;
vector<Line> lines; //直線（傾き，切片）
bool is... | #include <bits/stdc++.h>
using namespace std;
// base:[Convex-Hull Trick -
// sataniC++](http://satanic0258.hatenablog.com/entry/2016/08/16/181331#fn-534591c8)
//追加する直線の傾きは単調（最小値なら傾きは単調減少、最大値なら傾きは単調増加）
template <typename T> struct ConvecHullTrick {
typedef pair<T, T> Line;
vector<Line> lines; //直線（傾き，切片）
bool is... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 987,438 | 987,439 | u942774736 | cpp |
p03185 | #include <deque>
#include <iostream>
using namespace std;
const int NMAX = 2e5;
struct Line {
long long a, b;
long long eval(long long x) { return a * x + b; }
};
int N, C;
long long h[NMAX + 5];
long long minCost[NMAX + 5];
deque<Line> dq;
bool LinesAreGood(Line l1, Line l2, Line l3) {
/// lines are good... | #include <deque>
#include <iostream>
using namespace std;
const int NMAX = 2e5;
struct Line {
long long a, b;
long long eval(long long x) { return a * x + b; }
};
long long N, C;
long long h[NMAX + 5];
long long minCost[NMAX + 5];
deque<Line> dq;
bool LinesAreGood(Line l1, Line l2, Line l3) {
/// lines ar... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 987,456 | 987,457 | u323394394 | cpp |
p03185 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAXN = 2e5 + 10;
LL h[MAXN], dp[MAXN];
int n, c;
deque<int> que;
double slope(int j, int k) {
return double((dp[j] + h[j] * 1ll * h[j]) - (dp[k] + h[k] * 1ll * h[k])) /
(2ll * h[j] - 2ll * h[k]);
}
int main() {
cin >> n >> c;... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int MAXN = 2e5 + 10;
LL h[MAXN], dp[MAXN];
LL n, c;
deque<int> que;
double slope(int j, int k) {
return double((dp[j] + h[j] * 1ll * h[j]) - (dp[k] + h[k] * 1ll * h[k])) /
(2ll * h[j] - 2ll * h[k]);
}
int main() {
cin >> n >> c;
... | [
"variable_declaration.type.change"
] | 987,462 | 987,463 | u470165280 | cpp |
p03185 | #include <iostream>
#include <vector>
using namespace std;
class line {
public:
long long a;
long long b;
line() { ; }
line(long long A, long long B) {
a = A;
b = B;
}
long long eval(long long x) { return a * x + b; }
};
vector<line> L;
void insert(line k) {
if (L.size() <= 1)
L.push_bac... | #include <iostream>
#include <vector>
using namespace std;
class line {
public:
long long a;
long long b;
line() { ; }
line(long long A, long long B) {
a = A;
b = B;
}
long long eval(long long x) { return a * x + b; }
};
vector<line> L;
void insert(line k) {
if (L.size() <= 1)
L.push_bac... | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 987,474 | 987,475 | u404734036 | cpp |
p03185 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <queue>
#include <random>
#include <regex>
#include... | [
"variable_declaration.type.change"
] | 987,480 | 987,481 | u366676780 | cpp |
p03185 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf_int = 1e9 + 100;
const ll inf_ll = 5e18;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double dbl;
#define pb push_back
const double pi = 3.1415926535898;
#define dout ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int inf_int = 1e9 + 100;
const ll inf_ll = 1e18;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef long double dbl;
#define pb push_back
const double pi = 3.1415926535898;
#define dout ... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.branch.if.condition.change"
] | 987,484 | 987,485 | u813006723 | cpp |
p03185 | #include <bits/stdc++.h>
#define MAXN 1001000
#define lc (x << 1)
#define rc (x << 1 | 1)
#define pii pair<int, int>
#define pb push_back
typedef long long ll;
using namespace std;
ll n, C, h[MAXN], dp[MAXN];
int vis[MAXN << 1];
struct line {
double k, b;
line(double _k = 0, double _b = 0) {
k = _k;
b = ... | #include <bits/stdc++.h>
#define MAXN 3001000
#define lc (x << 1)
#define rc (x << 1 | 1)
#define pii pair<int, int>
#define pb push_back
typedef long long ll;
using namespace std;
ll n, C, h[MAXN], dp[MAXN];
int vis[MAXN << 1];
struct line {
double k, b;
line(double _k = 0, double _b = 0) {
k = _k;
b = ... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 987,529 | 987,528 | u190314045 | cpp |
p03185 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define N 200005
ll inf = 1e14;
ll mod = 1e9 + 7;
char en = '\n';
ll abs1(ll x) {
if (x < 0)
return -x;
return x;
}
ll power(ll x, ll n, ll mod) {
ll res = 1;
while (n) {
if (n & 1)
res = (res * x) % m... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define N 200005
ll inf = 1e14;
ll mod = 1e9 + 7;
char en = '\n';
ll abs1(ll x) {
if (x < 0)
return -x;
return x;
}
ll power(ll x, ll n, ll mod) {
ll res = 1;
while (n) {
if (n & 1)
res = (res * x) % m... | [
"variable_declaration.type.change"
] | 987,530 | 987,531 | u401416019 | cpp |
p03185 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define N 3005
ll inf = 1e14;
ll mod = 1e9 + 7;
char en = '\n';
ll abs1(ll x) {
if (x < 0)
return -x;
return x;
}
ll power(ll x, ll n, ll mod) {
ll res = 1;
while (n) {
if (n & 1)
res = (res * x) % mod... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define N 200005
ll inf = 1e14;
ll mod = 1e9 + 7;
char en = '\n';
ll abs1(ll x) {
if (x < 0)
return -x;
return x;
}
ll power(ll x, ll n, ll mod) {
ll res = 1;
while (n) {
if (n & 1)
res = (res * x) % m... | [
"preprocessor.define.value.change",
"literal.integer.change",
"variable_declaration.type.change"
] | 987,532 | 987,531 | u401416019 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.