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 |
|---|---|---|---|---|---|---|---|
p03038 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
ll n, m;
ll a[100001], b[100001], c[100001];
l_l cb[100001];
ll ans;
signed main() {
cin >> n >> m;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> i_i;
typedef pair<ll, ll> l_l;
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
// const ll mod = 1000000007;
ll n, m;
ll a[100010], b[100010], c[100010];
l_l cb[100010];
ll ans;
signed main() {
cin >> n >> m;
... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 854,113 | 854,114 | u263858205 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 10... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 10... | [
"call.function.change",
"control_flow.loop.for.initializer.change"
] | 854,120 | 854,121 | u627427672 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 10... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define REP(NAME, NUM) for (int NAME = 0; NAME < (NUM); ++NAME)
#define BREP(NAME, NUM) for (int NAME = (NUM)-1; NAME >= 0; --NAME)
#define ALL(NAME) (NAME).begin(), (NAME).end()
#define cMOD 10... | [
"control_flow.loop.for.update.change",
"expression.unary.arithmetic.add"
] | 854,120 | 854,122 | u627427672 | cpp |
p03038 | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
int main() {
int N, M, tmp, b, c, j;
ll total = 0;
cin >> N >> M;
vector<P> data(N + M);
for (int i = 0; i < N; i++) {
cin >> data[... | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
int main() {
int N, M, tmp, b, c, j;
ll total = 0;
cin >> N >> M;
vector<P> data(N + M);
for (int i = 0; i < N; i++) {
cin >> data[i]... | [] | 854,129 | 854,130 | u511788770 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, j, i = 0, k = 0;
cin >> n >> j;
int a[100000] = {};
while (i < n) {
cin >> a[i];
i++;
}
sort(a, a + n);
vector<pair<int, int>> A(j);
while (i < j) {
cin >> A[i].second >> A[i].first;
i++... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n, j, i = 0, k = 0;
cin >> n >> j;
int a[100000] = {};
while (i < n) {
cin >> a[i];
i++;
}
sort(a, a + n);
vector<pair<int, int>> A(j);
i = 0;
while (i < j) {
cin >> A[i].second >> A[i].first... | [
"assignment.add"
] | 854,131 | 854,132 | u258475646 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int maxn = 123456;
typedef long long ll;
typedef pair<int, int> pii;
ll a[maxn];
map<ll, int> mp;
std::map<ll, int>::iterator it;
int main() {
// freopen("input.txt", "r", stdin);
int N, M;
mp.clear();
cin >> N >> M;
fo... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int maxn = 123456;
typedef long long ll;
typedef pair<int, int> pii;
ll a[maxn];
map<ll, int> mp;
std::map<ll, int>::iterator it;
int main() {
// freopen("input.txt", "r", stdin);
int N, M;
mp.clear();
cin >> N >> M;
fo... | [
"assignment.value.change"
] | 854,139 | 854,140 | u608624039 | cpp |
p03038 | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int maxn = 123456;
typedef long long ll;
typedef pair<int, int> pii;
ll a[maxn];
map<ll, int> mp;
std::map<ll, int>::iterator it;
int main() {
// freopen("input.txt", "r", stdin);
int N, M;
mp.clear();
cin >> N >> M;
fo... | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
const int maxn = 123456;
typedef long long ll;
typedef pair<int, int> pii;
ll a[maxn];
map<ll, int> mp;
std::map<ll, int>::iterator it;
int main() {
// freopen("input.txt", "r", stdin);
int N, M;
mp.clear();
cin >> N >> M;
fo... | [
"assignment.value.change"
] | 854,139 | 854,141 | u608624039 | cpp |
p03038 | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
vector<pair<int, int>> P(M);
for (int i = 0; i < M; i++) {
cin >> P[i].first >> P[i].second;... | #include <bits/stdc++.h>
#define ll long long
using namespace std;
int main() {
int N, M;
cin >> N >> M;
vector<int> A(N + 1, 0);
for (int i = 1; i <= N; i++) {
cin >> A[i];
}
sort(A.begin(), A.end());
vector<pair<int, int>> P(M);
for (int i = 0; i < M; i++) {
cin >> P[i].first >> P[i].second;... | [
"expression.unary.arithmetic.add"
] | 854,154 | 854,155 | u119098168 | cpp |
p03038 | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, M;
cin >> N >> M;
int Ai;
priority_queue<P> p;
for (int i = 0; i < N; i++) {
cin >> Ai;
p.push(make_pair(Ai, 1));
}
for (int i = 0;... | #include <algorithm>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
int main() {
int N, M;
cin >> N >> M;
int Ai;
priority_queue<P> p;
for (int i = 0; i < N; i++) {
cin >> Ai;
p.push(make_pair(Ai, 1));
}
for (int i = 0;... | [
"variable_declaration.type.change"
] | 854,158 | 854,159 | u904131021 | cpp |
p03038 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n)... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <tuple>
#include <utility>
#include <vector>
#define int long long int
#define rep(i, n) for (int i = 0; i < (n)... | [
"control_flow.branch.if.condition.change"
] | 854,028 | 854,029 | u558092537 | cpp |
p03039 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 854,174 | 854,175 | u103850114 | cpp |
p03039 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <string>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (l... | [
"expression.operation.binary.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 854,176 | 854,175 | u103850114 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 101010
#define DEBUG_OUT true
#define ALL(x) (x)... | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 101010
#define DEBUG_OUT true
#define ALL(x) (x)... | [
"assignment.change"
] | 854,179 | 854,180 | u221285045 | cpp |
p03039 | //インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> /... | //インクルード(アルファベット順)
#include <algorithm> //sort,二分探索,など
#include <bitset> //固定長bit集合
#include <cmath> //pow,logなど
#include <complex> //複素数
#include <deque> //両端アクセスのキュー
#include <functional> //sortのgreater
#include <iomanip> //setprecision(浮動小数点の出力の誤差)
#include <iostream> /... | [
"call.add"
] | 854,207 | 854,208 | u989345508 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 0
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#e... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define int ll
#define REP(i, n) for (int i = 0; i < n; ++i)
#define SORT(name) sort(name.begin(), name.end())
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
#if 0
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#e... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 854,209 | 854,210 | u633020228 | cpp |
p03039 | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(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) ... | #include <bits/stdc++.h>
const int INF = 1e9;
const int MOD = 1e9 + 7;
const long long LINF = 1e18;
#define dump(x) cout << 'x' << ' = ' << (x) << ` `;
#define FOR(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) ... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 854,223 | 854,224 | u102602414 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define fr(i, n) for (int i = 0; i < n; i++)
#define ifr(i, n) for (int i = n - 1; i >= 0; i--)
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv... | [
"call.add",
"variable_declaration.type.change"
] | 854,231 | 854,230 | u806159048 | cpp |
p03039 | /*
██████ ██████
██ ██ ██ ██
Author -> ██████ ██ ██
██ ██ ██
██ ██████
nik is love.
nik is motivation.
Ek modulus aapki jindagi barbaad kar sakti hai
Watch for integer overflows.
A dream doesn't become reality through magic; it t... | /*
██████ ██████
██ ██ ██ ██
Author -> ██████ ██ ██
██ ██ ██
██ ██████
nik is love.
nik is motivation.
Ek modulus aapki jindagi barbaad kar sakti hai
Watch for integer overflows.
A dream doesn't become reality through magic; it t... | [
"assignment.add"
] | 854,240 | 854,241 | u151137534 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll INF... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll INF... | [
"assignment.change"
] | 854,272 | 854,273 | u244626757 | cpp |
p03039 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
const int MAX_N... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <vector>
typedef long long ll;
using namespace std;
const ll MOD = 1000000007LL;
const int MAX_N... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 854,278 | 854,279 | u334624175 | cpp |
p03039 | // BUGSBUNNY
// IIT ROORKEE
// _,add8ba,
// ,d888888888b,
// d8888888888888b _,ad8ba,_
// d888888888888888) ,d888888888b,
// I88888888888888... | // BUGSBUNNY
// IIT ROORKEE
// _,add8ba,
// ,d888888888b,
// d8888888888888b _,ad8ba,_
// d888888888888888) ,d888888888b,
// I88888888888888... | [
"assignment.change"
] | 854,284 | 854,285 | u747201517 | cpp |
p03039 | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string... | #pragma GCC optimize("Ofast")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 854,286 | 854,287 | u591914971 | cpp |
p03039 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iostream>
#include <limits>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define INF 11000000000
#define MAX 210000
#define MOD 1000000007
typedef long lo... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <iostream>
#include <limits>
#include <queue>
#include <set>
#include <tuple>
#include <vector>
using namespace std;
#define INF 11000000000
#define MAX 210000
#define MOD 1000000007
typedef long lo... | [
"expression.operation.binary.add"
] | 854,288 | 854,289 | u591914971 | cpp |
p03039 | #include <algorithm>
#include <complex>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
typedef long long int LL;
using namespace std;
// 插入此處
namespace Number {
typedef long long int LL;
// 求取 a, b 的最大公因數
LL gcd(LL a, LL b) {
if (a % b == 0... | #include <algorithm>
#include <complex>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <vector>
typedef long long int LL;
using namespace std;
// 插入此處
namespace Number {
typedef long long int LL;
// 求取 a, b 的最大公因數
LL gcd(LL a, LL b) {
if (a % b == 0... | [
"assignment.add"
] | 854,290 | 854,291 | u360239609 | cpp |
p03039 | #include <chrono>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <... | #include <chrono>
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <istream>
#include <map>
#include <ostream>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 854,300 | 854,301 | u168026006 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 854,302 | 854,303 | u366381207 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV... | #include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep2(i, m, n) for (int i = int(m); i < int(n); i++)
#define rep(i, n) rep2(i, 0, n)
#define all(a) a.begin(), a.end()
using ll = long long;
using ld = long double;
using V = vector<int>;
using Vll = vector<ll>;
using Vld = vector<ld>;
using VV... | [
"literal.number.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 854,302 | 854,304 | u366381207 | cpp |
p03039 | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#includ... | //
// main.cpp
//
#include <algorithm>
#include <array>
#include <assert.h>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <memory>
#include <queue>
#include <random>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#includ... | [] | 854,314 | 854,315 | u578938637 | cpp |
p03039 | #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 <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for... | #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 <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for... | [
"assignment.change"
] | 854,354 | 854,355 | u834415466 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#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) fo... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#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) fo... | [
"control_flow.branch.if.condition.change"
] | 854,356 | 854,357 | u139031151 | cpp |
p03039 | //
// ROIGold.cpp
// Main calisma
//
// Created by Rakhman on 05/02/2019.
// Copyright © 2019 Rakhman. All rights reserved.
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#... | //
// ROIGold.cpp
// Main calisma
//
// Created by Rakhman on 05/02/2019.
// Copyright © 2019 Rakhman. All rights reserved.
//
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#... | [
"expression.operation.binary.add"
] | 854,380 | 854,381 | u796195598 | cpp |
p03039 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll << 60)
#else
#define inf (1 << 30)
#endif
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i <= b;... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll << 60)
#else
#define inf (1 << 30)
#endif
#define rep(i, n) for (int i = 0; i < n; i++)
#define Rep(i, a, b) for (int i = a; i < b; i++)
#define REP(i, a, b) for (int i = a; i <= b;... | [
"expression.operation.binary.remove",
"assignment.change"
] | 854,384 | 854,385 | u128527648 | cpp |
p03039 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#defin... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <utility>
#include <vector>
#define INF 1e9 + 7
#define rep(i, n) for (int i = 0; i < n; i++)
#define NO cout << "NO" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#defin... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 854,415 | 854,416 | u297203024 | cpp |
p03039 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 854,425 | 854,424 | u576106056 | cpp |
p03039 | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (... | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (... | [
"preprocessor.define.value.change",
"literal.integer.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.value.change"
] | 854,426 | 854,424 | u576106056 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M, K;
const ll MAX = 4000010;
const ll MOD = 1e9 + 7;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll N, M, K;
const ll MAX = 4000010;
const ll MOD = 1e9 + 7;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;... | [
"call.add"
] | 854,435 | 854,436 | u904123392 | cpp |
p03039 | //#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a, v) memset((a), (v), sizeof(a))
#define enl printf("\n")
#define case (t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%... | //#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>
#define mem(a, v) memset((a), (v), sizeof(a))
#define enl printf("\n")
#define case (t) printf("Case #%d: ", (t))
#define ni(n) scanf("%d", &(n))
#define nl(n) scanf("%... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 854,437 | 854,438 | u270920804 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
// BEGIN CUT HERE
template <typename T, T MOD = 1000000007> struct Mint {
static constexpr T mod = MOD;
T v;
Mint() : v(0) {}
Mint(signed v) : v(v) {}
Mint(long long t) {
v = t % MOD;
if (v < 0)
v += MOD;
}
Mint pow(long l... | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
// BEGIN CUT HERE
template <typename T, T MOD = 1000000007> struct Mint {
static constexpr T mod = MOD;
T v;
Mint() : v(0) {}
Mint(signed v) : v(v) {}
Mint(long long t) {
v = t % MOD;
if (v < 0)
v += MOD;
}
Mint pow(long l... | [] | 854,454 | 854,455 | u687214625 | cpp |
p03039 | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cassert>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#includ... | #define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cassert>
#include <complex>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#includ... | [
"identifier.change",
"call.arguments.change"
] | 854,473 | 854,474 | u545022164 | cpp |
p03039 | #include <algorithm>
#include <cmath>
#include <iostream>
// あまり大きな数字を入れると桁溢れする
template <typename T> T comb(T n, T r) {
// 組み合わせ計算時のかぶっている部分を取り除く
r = std::min(n - r, r);
T result = 1;
T div = 1;
for (T i = 1; i <= r; ++i) {
result = (result * (n - i + 1));
// result = result / i;
div = div * i;
... | #include <algorithm>
#include <cmath>
#include <iostream>
// あまり大きな数字を入れると桁溢れする
template <typename T> T comb(T n, T r) {
// 組み合わせ計算時のかぶっている部分を取り除く
r = std::min(n - r, r);
T result = 1;
T div = 1;
for (T i = 1; i <= r; ++i) {
result = (result * (n - i + 1));
// result = result / i;
div = div * i;
... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 854,475 | 854,476 | u477096296 | cpp |
p03039 | #include <iostream>
#include <stdio.h>
#include <vector>
#define lld long long
using namespace std;
const lld MODULO = 1e9 + 7;
const int N = 2e5 + 5;
int n, m, t;
lld d[N], s[N], k[N], res;
vector<lld> F[N];
lld gcd, x, y;
void gener() {
for (int i = 1; i <= m; i++) {
k[i] = (k[i - 1] + (i - 1)) % MODULO;
... | #include <iostream>
#include <stdio.h>
#include <vector>
#define lld long long
using namespace std;
const lld MODULO = 1e9 + 7;
const int N = 2e5 + 5;
int n, m, t;
lld d[N], s[N], k[N], res;
vector<lld> F[N];
lld gcd, x, y;
void gener() {
for (int i = 1; i <= max(m, n); i++) {
k[i] = (k[i - 1] + (i - 1)) % MOD... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 854,477 | 854,478 | u287877771 | cpp |
p03039 | #include <iostream>
#include <stdio.h>
using namespace std;
const int MX = 200005, MOD = 1E9 + 7;
int m, n, k;
long long ans = 0, fct[MX], ivf[MX], inv[MX], d[MX], c[MX];
// n giai thua, nghich dao modulo tung vi tri i, nghich dao modulo nhan lai voi
// nhau
void gener() {
fct[0] = ivf[0] = 1;
fct[1] = ivf[1] = i... | #include <iostream>
#include <stdio.h>
using namespace std;
const int MX = 200005, MOD = 1E9 + 7;
int m, n, k;
long long ans = 0, fct[MX], ivf[MX], inv[MX], d[MX], c[MX];
// n giai thua, nghich dao modulo tung vi tri i, nghich dao modulo nhan lai voi
// nhau
void gener() {
fct[0] = ivf[0] = 1;
fct[1] = ivf[1] = i... | [
"control_flow.loop.for.condition.change",
"call.add",
"call.arguments.add"
] | 854,479 | 854,480 | u287877771 | cpp |
p03039 | #include <bits/stdc++.h>
#define INF (1 << 30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
const int MAX = 200100;
ll fact[MAX], fact_inv[MAX];
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
... | #include <bits/stdc++.h>
#define INF (1 << 30)
#define MOD 1000000007
#define l_ength size
using ll = long long;
using namespace std;
const int MAX = 200100;
ll fact[MAX], fact_inv[MAX];
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 854,485 | 854,486 | u268977772 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
int mod = 1e9 + 7;
struct modCalc {
int mod;
int n;
bool ok;
vector<int> fact, invfact;
modCalc(){};
modCalc(int _mod, int _n) {... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = (n)-1; (i) >= 0; (i)--)
int mod = 1e9 + 7;
struct modCalc {
int mod;
int n;
bool ok;
vector<int> fact, invfact;
modCalc(){};
modCalc(int _mod, int _n) {... | [
"call.arguments.change"
] | 854,498 | 854,499 | u731175398 | cpp |
p03039 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <initializer_list>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#inc... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <initializer_list>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#inc... | [
"assignment.value.change",
"identifier.change"
] | 854,510 | 854,511 | u890437211 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9 + 7;
// O(log a)
int64_t powmod(int64_t a, int64_t p) {
int64_t value = 1;
for (int64_t mul = a; p > 0; p >>= 1, mul = (mul * mul) % MOD) {
if (p & 1)
value = (value * mul) % MOD;
}
return value;
}
int64_t invmod(int64_t x) { ret... | #include <bits/stdc++.h>
using namespace std;
const int64_t MOD = 1e9 + 7;
// O(log a)
int64_t powmod(int64_t a, int64_t p) {
int64_t value = 1;
for (int64_t mul = a; p > 0; p >>= 1, mul = (mul * mul) % MOD) {
if (p & 1)
value = (value * mul) % MOD;
}
return value;
}
int64_t invmod(int64_t x) { ret... | [
"assignment.change"
] | 854,512 | 854,513 | u936555566 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
class finite_field {
const int md;
const int sz;
vector<int> fct, fnv;
public:
finite_field(const int md, const int init_factorial_size = 0)
: md(md), sz(init_factorial_size), fct(sz), fnv(sz) {
fct[0] = 1;
for (int i = 1; i < sz; i++)
fct[i] = ... | #include <bits/stdc++.h>
using namespace std;
class finite_field {
const int md;
const int sz;
vector<int> fct, fnv;
public:
finite_field(const int md, const int init_factorial_size = 0)
: md(md), sz(init_factorial_size), fct(sz), fnv(sz) {
fct[0] = 1;
for (int i = 1; i < sz; i++)
fct[i] = ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 854,520 | 854,521 | u846041485 | cpp |
p03039 | #include <algorithm>
#include <bitset>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef stack<int> IntStack;
typedef queue<int> IntQueue;
const double pi = 3.141592653589793;
int char_to_int... | #include <algorithm>
#include <bitset>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef stack<int> IntStack;
typedef queue<int> IntQueue;
const double pi = 3.141592653589793;
int char_to_int... | [
"variable_declaration.value.change"
] | 854,529 | 854,530 | u397037010 | cpp |
p03039 | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
usin... | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstring>
#include <fstream>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
usin... | [
"call.arguments.add"
] | 854,533 | 854,534 | u281384315 | cpp |
p03039 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend()) // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define LINF 1e18
#define MOD 1000000007... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end())
#define VRSORT(v) sort(v.rbegin(), v.rend()) // vectorの降順ソート
#define ll long long
#define pb(a) push_back(a)
#define INF 1000000000
#define LINF 1e18
#define MOD 1000000007... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change"
] | 854,549 | 854,550 | u493750228 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define all... | [
"assignment.value.change",
"assignment.change"
] | 854,554 | 854,555 | u962966398 | cpp |
p03039 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = ll(1e9) + 7;
ll modinv(ll a, ll m) { return a == 1 ? 1 : m - modinv(m % a, a) * m / a; }
ll choose(ll n, ll r) {
r = min(r, n - r);
if (r < 0)
return 0;
ll num = 1, den = 1;
for (int i = 0; i < r; i++) {
num *= (n - i)... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = ll(1e9) + 7;
ll modinv(ll a, ll m) { return a == 1 ? 1 : m - modinv(m % a, a) * m / a; }
ll choose(ll n, ll r) {
r = min(r, n - r);
if (r < 0)
return 0;
ll num = 1, den = 1;
for (int i = 0; i < r; i++) {
num *= (n - i)... | [
"assignment.change"
] | 854,562 | 854,563 | u570944601 | cpp |
p03039 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define N 1000000007
int main() {
long long n, m, k, cost = 0, t = 0;
cin >> n >> m >> k;
for (long long i = 0; i < n; i++)
cost = (cost + (1 + i) * i / 2 * m % N * m % N) % N;
for (long long i = 0; i < m; i++)
cost = (cost... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define N 1000000007
int main() {
long long n, m, k, cost = 0, t = 1;
cin >> n >> m >> k;
for (long long i = 0; i < n; i++)
cost = (cost + (1 + i) * i / 2 * m % N * m % N) % N;
for (long long i = 0; i < m; i++)
cost = (cost... | [
"literal.number.change",
"variable_declaration.value.change"
] | 854,568 | 854,569 | u258475646 | cpp |
p03039 | #include <iostream>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll fac[100000000];
ll modinv(ll a) {
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
void modfac() {
... | #include <iostream>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll fac[300010];
ll modinv(ll a) {
ll b = mod, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
void modfac() {
f... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change"
] | 854,575 | 854,574 | u179970156 | cpp |
p03039 | #include <algorithm>
#include <cstdio>
#define mod 1000000007
using namespace std;
typedef long long ll;
ll kai[200001], inv[200001], sum[200001];
ll n, m, k, ans;
ll gyaku(ll x) {
ll res = x;
ll a = mod - 2;
for (int i = 1; i <= 30; i++) {
x = x * x;
x %= mod;
if (((a << i) & a)) {
res *= x;
... | #include <algorithm>
#include <cstdio>
#define mod 1000000007
using namespace std;
typedef long long ll;
ll kai[200001], inv[200001], sum[200001];
ll n, m, k, ans;
ll gyaku(ll x) {
ll res = x;
ll a = mod - 2;
for (int i = 1; i < 30; i++) {
x = x * x;
x %= mod;
if (((1 << i) & a)) {
res *= x;
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change",
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 854,614 | 854,615 | u855429581 | cpp |
p03039 | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < n; i++)
using namespace std;
long modinv(long a) {
long M ... | #include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define rep(i, n) for (long i = 0; i < n; i++)
using namespace std;
long modinv(long a) {
long M ... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 854,632 | 854,633 | u995792346 | cpp |
p03040 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++... | [] | 854,638 | 854,639 | u563710899 | cpp |
p03040 | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++... | #include <algorithm>
#include <array>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
#define rep(i, n) for (int i = 0; i < n; i++... | [] | 854,640 | 854,639 | u563710899 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
int q;
long long leftsum, rightsum, bsum;
priority_queue<int> maxh;
priority_queue<int, vector<int>, greater<int>> minh;
void print_min() {
long long med = maxh.top();
long long lsize = max... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
int q;
long long leftsum, rightsum, bsum;
priority_queue<int> maxh;
priority_queue<int, vector<int>, greater<int>> minh;
void print_min() {
long long med = maxh.top();
long long lsize = max... | [
"assignment.value.change",
"identifier.change"
] | 854,641 | 854,642 | u870592517 | cpp |
p03040 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int Q;
cin >> Q;
int cnt = 0;
long long bSum = 0;
pair<int, int> median;
long long leftSum = 0;
long long rightSum = 0;
set<pair<int, int>... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <set>
#include <string>
#include <vector>
using namespace std;
int main() {
int Q;
cin >> Q;
int cnt = 0;
long long bSum = 0;
pair<int, int> median;
long long leftSum = 0;
long long rightSum = 0;
set<pair<int, int>... | [
"assignment.variable.change",
"identifier.change"
] | 854,643 | 854,644 | u048945791 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long Q;
cin >> Q;
set<long long> left, right;
long long bsum = 0;
long long msum = 0;
long long geta = 1E+10;
for (long long q = 0; q < Q; q++) {
int type;
cin >> type;
if (type == 1) {
long long a, b;
cin >> a >... | #include <bits/stdc++.h>
using namespace std;
int main(void) {
long long Q;
cin >> Q;
set<long long> left, right;
long long bsum = 0;
long long msum = 0;
long long geta = 1E+10;
for (long long q = 0; q < Q; q++) {
int type;
cin >> type;
if (type == 1) {
long long a, b;
cin >> a >... | [
"expression.operator.change"
] | 854,645 | 854,646 | u898331860 | cpp |
p03040 | #include <iostream>
#include <queue>
using namespace std;
int main() {
int Q;
cin >> Q;
priority_queue<int, vector<int>, greater<int>> que2;
priority_queue<int, vector<int>> que1;
long sum1 = 0;
long sum2 = 0;
long sumb = 0;
int cnt = 0;
for (int i = 0; i < Q; i++) {
int t;
cin >> t;
if ... | #include <iostream>
#include <queue>
using namespace std;
int main() {
int Q;
cin >> Q;
priority_queue<int, vector<int>, greater<int>> que2;
priority_queue<int, vector<int>> que1;
long sum1 = 0;
long sum2 = 0;
long sumb = 0;
int cnt = 0;
for (int i = 0; i < Q; i++) {
int t;
cin >> t;
if ... | [
"expression.operation.unary.add"
] | 854,649 | 854,650 | u693133807 | cpp |
p03040 | #include <bits/stdc++.h>
template <typename InputIterator>
typename InputIterator::value_type summation(InputIterator first,
InputIterator last) {
return std::accumulate(first, last, typename InputIterator::value_type());
}
template <typename T>
std::istream &operator>>(s... | #include <bits/stdc++.h>
template <typename InputIterator>
typename InputIterator::value_type summation(InputIterator first,
InputIterator last) {
return std::accumulate(first, last, typename InputIterator::value_type());
}
template <typename T>
std::istream &operator>>(s... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 854,651 | 854,652 | u438319362 | cpp |
p03040 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
ll n, t[400010] = {};
void built() {
for (int i = n - 1; i > 0; i--) {
t[i] = t[i << 1] + t[i << 1 | 1];
}
}
void update(ll p, ll a) {
for (t[p += n] += a; p > 1; p >>= 1) {
t[p >> 1] = t[... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
ll n, t[400010] = {};
void built() {
for (int i = n - 1; i > 0; i--) {
t[i] = t[i << 1] + t[i << 1 | 1];
}
}
void update(ll p, ll a) {
for (t[p += n] += a; p > 1; p >>= 1) {
t[p >> 1] = t[... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 854,661 | 854,662 | u621509943 | cpp |
p03040 | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
ll n, t[400010] = {};
void built() {
for (int i = n - 1; i > 0; i--) {
t[i] = t[i << 1] + t[i << 1 | 1];
}
}
void update(ll p, ll a) {
for (t[p += n] += a; p > 1; p >>= 1) {
t[p >> 1] = t[... | #include <algorithm>
#include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
ll n, t[400010] = {};
void built() {
for (int i = n - 1; i > 0; i--) {
t[i] = t[i << 1] + t[i << 1 | 1];
}
}
void update(ll p, ll a) {
for (t[p += n] += a; p > 1; p >>= 1) {
t[p >> 1] = t[... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 854,663 | 854,662 | u621509943 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ul;
typedef signed long long ll;
ul over = 1000000007;
mt19937 mt(time(nullptr));
// uniform_int_distribution< int > rand_int(0, 10) // rand[0, 10] inclusive
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
int q;... | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ul;
typedef signed long long ll;
ul over = 1000000007;
mt19937 mt(time(nullptr));
// uniform_int_distribution< int > rand_int(0, 10) // rand[0, 10] inclusive
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed;
int q;... | [
"expression.unary.arithmetic.add"
] | 854,672 | 854,673 | u691764803 | cpp |
p03040 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"expression.operator.change"
] | 854,676 | 854,675 | u917944707 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
unsigned xor128() {
static unsigned x = 123456789, y = 362436069, z = 521288629, w = 88675123;
unsigned t = x ^ (x << 11);
x = y;
y = z;
z = w;
return w = w ^ (w >> 19) ^ (t ^ (t >> 8));
}
namespace randomized_binary_search_tree {
using T... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
unsigned xor128() {
static unsigned x = 123456789, y = 362436069, z = 521288629, w = 88675123;
unsigned t = x ^ (x << 11);
x = y;
y = z;
z = w;
return w = w ^ (w >> 19) ^ (t ^ (t >> 8));
}
namespace randomized_binary_search_tree {
using T... | [] | 854,677 | 854,678 | u752161277 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i ... | #include <bits/stdc++.h>
using namespace std;
struct fast_ios {
fast_ios() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
};
} fast_ios_;
#define FOR(i, begin, end) for (int i = (begin); i < (end); i++)
#define REP(i, n) FOR(i, 0, n)
#define IFOR(i, begin, end) for (int i ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 854,679 | 854,680 | u434231045 | cpp |
p03040 | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define vel vector<long long>
#define vvel vector<vel>
#define int long long
#define rep(i, n) for (long long i = 0; i < n; i++)
#define sor(v) sort(v.begin(), v.end())
#define mmax(a, b) a ... | #include <algorithm>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define vel vector<long long>
#define vvel vector<vel>
#define int long long
#define rep(i, n) for (long long i = 0; i < n; i++)
#define sor(v) sort(v.begin(), v.end())
#define mmax(a, b) a ... | [
"expression.operation.unary.add",
"call.arguments.change"
] | 854,689 | 854,690 | u021034020 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll, ll> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i, n) for (int i = 0; i < (n); i++)
#define Fr(i, n) for (int i = 0; i++ < (n);)
#define ifr(i, n) for (int i = (n)-1; i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<ll, ll> P;
#define pb push_back
#define ft first
#define sd second
#define mp make_pair
#define fr(i, n) for (int i = 0; i < (n); i++)
#define Fr(i, n) for (int i = 0; i++ < (n);)
#define ifr(i, n) for (int i = (n)-1; i ... | [
"expression.operation.unary.add"
] | 854,693 | 854,694 | u434208140 | cpp |
p03040 | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | #include <algorithm>
#include <cassert>
#include <chrono>
#include <cmath>
#include <cstdio>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namesp... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 854,697 | 854,698 | u075551644 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int q;
cin >> q;
int tmp1, tmp2, tmp3;
cin >> tmp1 >> tmp2 >> tmp3;
map<long long, int> dct;
dct[tmp2] = 1;
int left = 0, right = 0;
long long sum_left = 0, sum_right = 0;
long long constant = tm... | #include <bits/stdc++.h>
using namespace std;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
int q;
cin >> q;
int tmp1, tmp2, tmp3;
cin >> tmp1 >> tmp2 >> tmp3;
map<long long, int> dct;
dct[tmp2] = 1;
int left = 0, right = 0;
long long sum_left = 0, sum_right = 0;
long long constant = tm... | [
"assignment.change",
"expression.operation.binary.remove"
] | 854,699 | 854,700 | u776338097 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned int;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = pair<ll, pll>;
using tuplis2 = pair<... | [] | 854,707 | 854,708 | u874644572 | cpp |
p03041 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, k;
string s;
cin >> n >> k >> s;
--n;
s[n] = (char)tolower(s[n]);
cout << s << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
int n, k;
string s;
cin >> n >> k >> s;
--k;
s[k] = (char)tolower(s[k]);
cout << s << '\n';
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
} | [
"identifier.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change"
] | 854,711 | 854,712 | u105935673 | cpp |
p03041 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
const long long INF = 1e9 +... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
const long long INF = 1e9 +... | [] | 854,715 | 854,716 | u809967037 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int q;
int main(void) {
// Here your code !
scanf("%d", &q);
priority_queue<ll> left_set;
priority_queue<ll, vector<ll>, greater<ll>> right_set;
ll current = 0LL;
for... | #include <bits/stdc++.h>
using namespace std;
using ll = long long int;
const int MAX = (int)(1e5 + 5);
const ll INF = (ll)(1e10 + 5);
int q;
int main(void) {
// Here your code !
scanf("%d", &q);
priority_queue<ll> left_set;
priority_queue<ll, vector<ll>, greater<ll>> right_set;
ll current = 0LL;
for... | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 854,723 | 854,724 | u497422208 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int Q;
multiset<ll> l, r;
ll ls, rs, bs;
ll x;
int main() {
cin >> Q;
int q;
cin >> q >> x >> bs;
l.insert(x);
ls += x;
for (int i = 1; i < Q; i++) {
cin >> q;
auto it = l.end();
x = *--it;
if (q == 1) {
ll a, b;
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
int Q;
multiset<ll> l, r;
ll ls, rs, bs;
ll x;
int main() {
cin >> Q;
int q;
cin >> q >> x >> bs;
l.insert(x);
ls += x;
for (int i = 1; i < Q; i++) {
cin >> q;
auto it = l.end();
x = *--it;
if (q == 1) {
ll a, b;
... | [
"assignment.value.change",
"call.function.change",
"expression.unary.arithmetic.remove"
] | 854,736 | 854,737 | u554116180 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) \
for (int i = (n); i >= (k); i--) ... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) \
for (int i = (n); i >= (k); i--) ... | [
"assignment.value.change",
"identifier.change"
] | 854,738 | 854,739 | u714538557 | cpp |
p03040 | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n - 1); i >= 0; i--)
#define REP1(i, n) for (int i = 1; i <... | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); i--)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define RREP(i, n) for (int i = (n - 1); i >= 0; i--)
#define REP1(i, n) for (int i = 1; i <... | [
"identifier.change",
"call.arguments.change",
"call.add"
] | 854,740 | 854,741 | u183175308 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pint;
typedef pair<ll, ll> P;
// typedef pair<int, pair<int, int>> P;
// typedef tuple<int,int,int> T;
ll INFL = 1000000000000000010; // 10^18 = 2^60
int INF = 2147483600; // 10^9
ll MOD = 1000000007;
vector<int> dy = {0... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> Pint;
typedef pair<ll, ll> P;
// typedef pair<int, pair<int, int>> P;
// typedef tuple<int,int,int> T;
ll INFL = 1000000000000000010; // 10^18 = 2^60
int INF = 2147483600; // 10^9
ll MOD = 1000000007;
vector<int> dy = {0... | [
"expression.operation.binary.remove",
"assignment.change"
] | 854,746 | 854,747 | u633284019 | cpp |
p03040 | #pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define P pair
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define V vector
#define RE return
#define ALL(a) a.begin(), a.end()
#define MP mak... | #pragma GCC optimize("Ofast,unroll-loops")
#include <bits/stdc++.h>
#define int long long
#define F first
#define S second
#define P pair
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define V vector
#define RE return
#define ALL(a) a.begin(), a.end()
#define MP mak... | [
"expression.operation.binary.remove"
] | 854,748 | 854,749 | u751741878 | cpp |
p03040 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#defin... | [
"control_flow.branch.if.condition.change",
"call.remove"
] | 854,752 | 854,753 | u906208439 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define show(x) \
for (auto i : x) { \
cout << i << " "; ... | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define show(x) \
for (auto i : x) { \
cout << i << " "; ... | [] | 854,756 | 854,757 | u317715099 | cpp |
p03040 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include "bits/stdc++.h"
#define REP(i, x, y) for (int i = (x); i < (y); i++)
#define RREP(i, x, y) for (int i = (y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
/... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include "bits/stdc++.h"
#define REP(i, x, y) for (int i = (x); i < (y); i++)
#define RREP(i, x, y) for (int i = (y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
#... | [
"variable_declaration.type.primitive.change"
] | 854,758 | 854,759 | u535555850 | cpp |
p03040 | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | #include <algorithm>
#include <bits/stdc++.h>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using na... | [] | 854,764 | 854,765 | u925940521 | cpp |
p03040 | #include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_... | #include <bits/stdc++.h>
#include <chrono>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <random>
using namespace std;
using namespace __gnu_pbds;
#define endl '\n'
typedef long long ll;
typedef pair<int, int> pii;
// typedef tree<int,null_type,less<int>,rb_tree_tag,
// tree_... | [
"literal.number.change",
"control_flow.branch.if.condition.change"
] | 854,768 | 854,769 | u045505231 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
class OnlineMedian {
private:
priority_queue<int64, vector<int64>, less<int64>> pq_less;
priority_queue<int64, vector<int64>, greater<int64>> pq_greater;
public:
void Add(int64 x) {
if (pq_less.empty() || x <=... | #include <bits/stdc++.h>
using namespace std;
using int64 = long long;
constexpr int DEBUG = 0;
class OnlineMedian {
private:
priority_queue<int64, vector<int64>, less<int64>> pq_less;
priority_queue<int64, vector<int64>, greater<int64>> pq_greater;
public:
void Add(int64 x) {
if (pq_less.empty() || x <=... | [] | 854,772 | 854,773 | u771276542 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
/*
1-indexed であることに注意 !!
*/
template <typename T> stru... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a) for (int i = 0; i < (a); i++)
#define ALL(a) (a).begin(), (a).end()
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const long long LINF = 1e18;
const long long MOD = 1e9 + 7;
/*
1-indexed であることに注意 !!
*/
template <typename T> stru... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 854,774 | 854,775 | u366398972 | cpp |
p03040 | #pragma GCC optimize("O3")
#pragma GCC target("avx")
//#include<bits/stdc++.h>
#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x)... | #pragma GCC optimize("O3")
#pragma GCC target("avx")
//#include<bits/stdc++.h>
#include <algorithm>
#include <cstdio>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x)... | [
"expression.operation.binary.change",
"assignment.change"
] | 854,776 | 854,777 | u096883693 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_... | [
"identifier.change",
"call.function.change"
] | 854,778 | 854,779 | u096883693 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll q;
scanf("%lld", &q);
priority_queue<ll> L;
priority_queue<ll, vector<ll>, greater<ll>> R;
ll ret = 0;
ll t, a, b;
scanf("%lld%lld%lld", &t, &a, &b);
L.push(a);
ret = b;
q--;
for (; q > 0; q--) {
scanf("%l... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll q;
scanf("%lld", &q);
priority_queue<ll> L;
priority_queue<ll, vector<ll>, greater<ll>> R;
ll ret = 0;
ll t, a, b;
scanf("%lld%lld%lld", &t, &a, &b);
L.push(a);
ret = b;
q--;
for (; q > 0; q--) {
scanf("%l... | [
"expression.operator.change"
] | 854,780 | 854,781 | u957457849 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll Q;
cin >> Q;
ll type, a, b, n, mn = 0;
multiset<ll> l, r;
auto resize = [&]() {
if (ll(l.size()) - ll(r.size()) > 1) {
auto mv = --l.end();
r.insert(*mv);
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
int main() {
ll Q;
cin >> Q;
ll type, a, b, n, mn = 0;
multiset<ll> l, r;
auto resize = [&]() {
if (ll(l.size()) - ll(r.size()) > 1) {
auto mv = --l.end();
r.insert(*mv);
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 854,784 | 854,785 | u526974618 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for (int i = s; i < t; i++)
typedef long long ll;
#define pii pair<ll, ll>
#define mid (l + r) / 2
#define lnode now * 2
#define rnode now * 2 + 1
#define MAXNUM 222222
ll tree[MAXNUM * 4];
ll sum[MAXNUM * 4], num[MAXNUM], add[MAXNUM * 4];
int allx[MAXN... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, t) for (int i = s; i < t; i++)
typedef long long ll;
#define pii pair<ll, ll>
#define mid (l + r) / 2
#define lnode now * 2
#define rnode now * 2 + 1
#define MAXNUM 222222
ll tree[MAXNUM * 4];
ll sum[MAXNUM * 4], num[MAXNUM], add[MAXNUM * 4];
int allx[MAXN... | [
"assignment.value.change",
"variable_declaration.remove"
] | 854,792 | 854,793 | u930038564 | cpp |
p03040 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define ... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <iostream>
#include <list>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep_r(i, n) for (int i = n - 1; i >= 0; i--)
#define ... | [
"identifier.change"
] | 854,802 | 854,803 | u297007413 | cpp |
p03040 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 854,808 | 854,809 | u624678037 | cpp |
p03040 | #include <functional>
#include <queue>
#include <stdio.h>
#include <vector>
using lli = long long int;
int main(void) {
int Q;
scanf("%d", &Q);
lli B = 0, SL = 0, SU = 0;
std::priority_queue<int> L;
std::priority_queue<int, std::vector<int>, std::greater<int>> U;
while (Q--) {
int k;
scanf("%d", &... | #include <functional>
#include <queue>
#include <stdio.h>
#include <vector>
using lli = long long int;
int main(void) {
int Q;
scanf("%d", &Q);
lli B = 0, SL = 0, SU = 0;
std::priority_queue<int> L;
std::priority_queue<int, std::vector<int>, std::greater<int>> U;
while (Q--) {
int k;
scanf("%d", &... | [
"identifier.change",
"call.arguments.change"
] | 854,810 | 854,811 | u394853232 | cpp |
p03040 | #include <algorithm>
#include <cstdio>
#include <vector>
#define ll long long
using namespace std;
ll a[200010][3];
ll n;
ll seg[800000];
ll seg1[800000];
ll update(ll pos, ll val, ll node, ll x, ll y) {
if (pos < x || y < pos)
return seg[node];
if (x == y) {
return seg[node] += val;
}
ll mid = (x + y) ... | #include <algorithm>
#include <cstdio>
#include <vector>
#define ll long long
using namespace std;
ll a[200010][3];
ll n;
ll seg[800000];
ll seg1[800000];
ll update(ll pos, ll val, ll node, ll x, ll y) {
if (pos < x || y < pos)
return seg[node];
if (x == y) {
return seg[node] += val;
}
ll mid = (x + y) ... | [] | 854,816 | 854,817 | u266602249 | cpp |
p03040 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | [
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 854,818 | 854,819 | u874947858 | cpp |
p03040 | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | #define _USE_MATH_DEFINES
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 854,820 | 854,821 | u874947858 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.