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 9
values |
|---|---|---|---|---|---|---|---|
p02990 | #include <array>
#include <iostream>
#include <iostream>
#include <vector>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = f... | #include <array>
#include <iostream>
#include <iostream>
#include <vector>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = f... | [
"io.output.newline.add"
] | 797,668 | 797,669 | u570229212 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll l, n, k, x, a, b, c, d, sum;
vector<int> v;
const ll MOD = 1e9 + 7;
const ll N = 2000;
const ll K = 2000;
ll C[N + 2][K + 2];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
memset(C, 0, sizeof C);
C[0][0] = 1;
C[1][0] = 1;
for ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll l, n, k, x, a, b, c, d, sum;
vector<int> v;
const ll MOD = 1e9 + 7;
const ll N = 2000;
const ll K = 2000;
ll C[N + 2][K + 2];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
memset(C, 0, sizeof C);
C[0][0] = 1;
C[1][0] = 1;
for ... | [
"assignment.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 797,670 | 797,671 | u353919145 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
#define REP(i, n) for (long long i = 0; i < (n); i++)
... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
long long mod = 1000000007;
#define REP(i, n) for (long long i = 0; i < (n); i++)
... | [
"assignment.add"
] | 797,674 | 797,675 | u687204015 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// long long m... | #include <bits/stdc++.h>
using namespace std;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
}
} fast;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// long long m... | [
"assignment.add"
] | 797,676 | 797,677 | u687204015 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i... | [
"expression.operation.binary.add"
] | 797,686 | 797,687 | u166378830 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[2005][2005];
int main() {
a[0][0] = 1;
for (int i = 1; i < 2005; i++) {
for (int j = 0; j <= i; j++) {
a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
a[i][j] %= inf;
}
}
ll n, k;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll a[2005][2005];
int main() {
a[0][0] = 1;
for (int i = 1; i < 2005; i++) {
for (int j = 0; j <= i; j++) {
a[i][j] = a[i - 1][j - 1] + a[i - 1][j];
a[i][j] %= inf;
}
}
ll n, k;
... | [
"expression.operation.binary.add"
] | 797,688 | 797,689 | u166378830 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#defi... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#defi... | [
"expression.operation.binary.add"
] | 797,690 | 797,691 | u330518333 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#defi... | #include <bits/stdc++.h>
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, cc, n) for (int i = cc; i < n; ++i)
#defi... | [
"literal.number.change",
"variable_declaration.value.change"
] | 797,690 | 797,692 | u330518333 | cpp |
p02990 | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef p... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 797,693 | 797,694 | u311090179 | cpp |
p02990 | /*
* atcoder/abc132_3rd/d.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T> ostream &op... | /*
* atcoder/abc132_3rd/d.cpp
*/
// C++ 14
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstring> // memset
#include <iostream>
#include <vector>
using namespace std;
#define ll long long
#define loop(__x, __start, __end) for (int __x = __start; __x < __end; __x++)
template <class T> ostream &op... | [
"literal.number.change",
"call.arguments.change"
] | 797,695 | 797,696 | u823862638 | cpp |
p02990 | #include <iostream>
using namespace std;
static const long long MOD = 1e9 + 7;
long long C[2005][2005];
void COMB() {
for (int i = 1; i < 2005; ++i) {
C[i][0] = 1;
C[i][i] = 1;
}
for (int i = 2; i < 2005; ++i) {
for (int j = 1; j < i; ++j) {
C[i][j] = C[i - 1][j - 1] % MOD + C[i - 1][j] % MOD... | #include <iostream>
using namespace std;
static const long long MOD = 1e9 + 7;
long long C[2005][2005];
void COMB() {
for (int i = 0; i < 2005; ++i) {
C[i][0] = 1;
C[i][i] = 1;
}
for (int i = 2; i < 2005; ++i) {
for (int j = 1; j < i; ++j) {
C[i][j] = C[i - 1][j - 1] % MOD + C[i - 1][j] % MOD... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 797,697 | 797,698 | u159943174 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
struct Mcomb {
vector<ll> fac;
vector<ll> inv;
vector<ll> finv;
// nCnまで対応できる
Mcomb(int n) {
fac.resize(n + 1), inv.resize(n + 1), finv.resize(n + 1);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1]... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
struct Mcomb {
vector<ll> fac;
vector<ll> inv;
vector<ll> finv;
// nCnまで対応できる
Mcomb(int n) {
fac.resize(n + 1), inv.resize(n + 1), finv.resize(n + 1);
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1]... | [
"identifier.change",
"io.output.change"
] | 797,701 | 797,702 | u543584809 | cpp |
p02990 | #include <bits/stdc++.h>
int mod = 1000000007;
std::vector<long long> fac(1000100), inv(1000100),
finv(1000100); //階乗 / 逆元 / inv * fac
void comb_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000100; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod... | #include <bits/stdc++.h>
long long mod = 1000000007;
std::vector<long long> fac(1000100), inv(1000100),
finv(1000100); //階乗 / 逆元 / inv * fac
void comb_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000100; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - i... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 797,703 | 797,704 | u543584809 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll power(ll X, ll Y, ll P) {
vector<ll> digit2(1000), XX(1000);
ll I, N, mod;
I = 0;
while (Y != 0) {
digit2.at(I) = Y % 2;
Y = Y / 2;
I++;
}
N = I;
XX.at(0) = X % P;
for (I = 1; I < N; I++) {
XX.at(I) = (XX.at(I - 1) ... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll power(ll X, ll Y, ll P) {
vector<ll> digit2(1000), XX(1000);
ll I, N, mod;
I = 0;
while (Y != 0) {
digit2.at(I) = Y % 2;
Y = Y / 2;
I++;
}
N = I;
XX.at(0) = X % P;
for (I = 1; I < N; I++) {
XX.at(I) = (XX.at(I - 1) ... | [
"expression.operation.binary.remove"
] | 797,708 | 797,709 | u666712170 | cpp |
p02990 | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using n... | #include <algorithm>
#include <bits/stdc++.h>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using n... | [
"expression.operation.binary.remove"
] | 797,710 | 797,711 | u767543103 | cpp |
p02990 | #include <iostream>
using namespace std;
const int MOD = 1e9 + 7, N = 2005;
int dp[N][N];
int main() {
int n, k;
cin >> n >> k;
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0)
dp[i][j] = 1;
else
dp[i][j] = (dp[i - 1][j - 1] + dp[i - 1][j... | #include <iostream>
using namespace std;
const int MOD = 1e9 + 7, N = 2005;
long long dp[N][N];
int main() {
int n, k;
cin >> n >> k;
dp[0][0] = 1;
for (int i = 1; i <= n; i++) {
for (int j = 0; j <= i; j++) {
if (j == 0)
dp[i][j] = 1;
else
dp[i][j] = (dp[i - 1][j - 1] + dp[i ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 797,723 | 797,724 | u448570453 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define MOD 1000000007LL
#define rep(i, n) for (ll(i) = 0LL; (i) < (ll)(n); (i)++)
#define rep2(i, s, e) for (ll(i) = (ll)(s); (i) < (ll)(e); (i)++)
#define repi(i, n) for (ll(i) = 0LL; (i) <= ... | [
"expression.operation.binary.add"
] | 797,725 | 797,726 | u196953553 | cpp |
p02990 | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define FLASH \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.ti... | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define FLASH \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.ti... | [
"expression.operation.binary.add"
] | 797,727 | 797,728 | u494904817 | cpp |
p02990 | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 9... | //#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INF 100000000
#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define repp(i, n, s) for (int i = (int)(n); i >= (int)(s); i--)
#define mp make_pair
ll mod = 1000000007;
ll mod2 = 9... | [
"expression.operation.binary.remove",
"literal.number.change",
"io.output.change"
] | 797,735 | 797,736 | u590825760 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7... | [
"expression.operation.binary.add"
] | 797,737 | 797,738 | u137747137 | cpp |
p02990 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
// for(int i=0;i<n;i++)
#define cinf(n, x) \
... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <math.h>
#include <queue>
#include <sstream>
#include <stdexcept>
#include <stdio.h>
#include <string>
#include <vector>
// for(int i=0;i<n;i++)
#define cinf(n, x) \
... | [
"expression.operation.binary.add"
] | 797,741 | 797,742 | u139300044 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
const int mod = 1e9 + 7;
long long calc(long long a, long long b, long long p) {
if (b == 0)
return 1;
if (b % 2 == 0) {
long long d = calc(a, b / 2, p);
return ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
using P = pair<int, int>;
const int mod = 1e9 + 7;
long long calc(long long a, long long b, long long p) {
if (b == 0)
return 1;
if (b % 2 == 0) {
long long d = calc(a, b / 2, p);
return ... | [
"assignment.add"
] | 797,750 | 797,751 | u890331732 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vdouble = vector<double>;
using vvdouble = vector<vdouble>;
using vvvdouble = vector<vvdouble>;
using vll = v... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vvint = vector<vint>;
using vvvint = vector<vvint>;
using vdouble = vector<double>;
using vvdouble = vector<vdouble>;
using vvvdouble = vector<vvdouble>;
using vll = v... | [
"expression.operation.binary.add"
] | 797,752 | 797,753 | u239239546 | cpp |
p02989 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
if (N % 2 == 1) {
cout << 0 << endl;
return 0;
}
sort(p.begin(), p.end());
int halfu, halfl;
halfu = p[N / 2... |
#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> p(N);
for (int i = 0; i < N; i++) {
cin >> p[i];
}
if (N % 2 == 1) {
cout << 0 << endl;
return 0;
}
sort(p.begin(), p.end());
int halfu, halfl;
halfu = p[N / ... | [
"expression.operation.binary.remove"
] | 797,758 | 797,759 | u047450022 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
cout << d.at(n / 2 + 1) - d.at(n / 2) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++)
cin >> d.at(i);
sort(d.begin(), d.end());
cout << d.at(n / 2) - d.at((n / 2) - 1) << endl;
} | [
"expression.operation.binary.remove",
"call.arguments.change"
] | 797,762 | 797,763 | u704064492 | cpp |
p02989 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d.at(i);
}
sort(d.begin... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; i++) {
cin >> d.at(i);
}
sort(d.begin... | [
"expression.operation.binary.remove"
] | 797,772 | 797,773 | u324549724 | cpp |
p02989 | #include <iostream>
#include <string>
using namespace std;
void swap(int *x, int *y) {
int temp;
temp = *x;
*x = *y;
*y = temp;
}
int partition(int array[], int left, int right) {
int i, j, pivot;
i = left;
j = right + 1;
pivot = left;
do {
do {
i++;
} while (array[i] < array[pivot]... | #include <iostream>
#include <string>
using namespace std;
void swap(int *x, int *y) {
int temp;
temp = *x;
*x = *y;
*y = temp;
}
int partition(int array[], int left, int right) {
int i, j, pivot;
i = left;
j = right + 1;
pivot = left;
do {
do {
i++;
} while (array[i] < array[pivot]... | [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change"
] | 797,778 | 797,779 | u321719888 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> b(a);
for (int i = 0; i < a; i++)
cin >> b.at(i);
sort(b.begin(), b.end());
if (b.at(a / 2 - 1) == b.at(a / 2))
cout << 0;
else
cout << b.at(a / 2) - b.at(a / 2 - 1) + 1;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int a;
cin >> a;
vector<int> b(a);
for (int i = 0; i < a; i++)
cin >> b.at(i);
sort(b.begin(), b.end());
if (b.at(a / 2 - 1) == b.at(a / 2))
cout << 0;
else
cout << b.at(a / 2) - b.at(a / 2 - 1);
} | [
"expression.operation.binary.remove"
] | 797,790 | 797,791 | u341447450 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 5];
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a, a + (n + 1));
int g = n / 2;
int k = a[g + 1] - a[g];
cout << k << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int a[n + 5] = {};
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
sort(a, a + (n + 1));
/*for(int i=1;i<=n;i++){
cout<<a[i]<<endl;
}*/
int g = n / 2;
int k = a[g + 1] - a[g];
cout << k << endl;
}
| [
"variable_declaration.value.change"
] | 797,793 | 797,794 | u758406624 | cpp |
p02989 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int ans = 0;
for (int i = 0; i < vec.size(); i++) {
if (vec.at((N ... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int ans = 0;
for (int i = 0; i < vec.at(N - 1) + 1; i++) {
if (vec... | [
"call.function.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"misc.off_by_one"
] | 797,797 | 797,796 | u469953228 | cpp |
p02989 | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int ans = 0;
for (int i = 0; i < vec.at(N - 1); i++) {
if (vec.at(... | #include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<int> vec(N);
for (int i = 0; i < N; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int ans = 0;
for (int i = 0; i < vec.at(N - 1) + 1; i++) {
if (vec... | [
"control_flow.loop.for.condition.change",
"misc.off_by_one",
"control_flow.branch.if.condition.change"
] | 797,798 | 797,796 | u469953228 | cpp |
p02989 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define MAX_N 100000
void solve() {}
int main() {
int n;
cin >> n;
int d[n];
REP(i, n)
cin >> d[i];
sort(d, d + n - 1);
if (n % 2)
cout << 0 << endl;
else {
cout... | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define MAX_N 100000
void solve() {}
int main() {
int n;
cin >> n;
int d[n];
REP(i, n)
cin >> d[i];
sort(d, d + n);
if (n % 2)
cout << 0 << endl;
else {
cout << ... | [
"expression.operation.binary.remove"
] | 797,799 | 797,800 | u754909749 | cpp |
p02989 | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
//3<=n<=10^5\
//N guusuu
int n = 0;
cin >> n;
// int p[10^5];
vector<int> v;
for (int i = 0; i < n; i++) {
// cin >> p[i];
int tmp;
cin >> tmp;
v.push_b... | #include <algorithm>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
//3<=n<=10^5\
//N guusuu
int n = 0;
cin >> n;
// int p[10^5];
vector<int> v;
for (int i = 0; i < n; i++) {
// cin >> p[i];
int tmp;
cin >> tmp;
v.push_b... | [
"expression.operation.binary.remove"
] | 797,803 | 797,804 | u913604515 | cpp |
p02989 | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int a = vec.at(n / 2 - 1);
int b = vec.at(n / 2);
cout << b - a << endl;
} | #include <algorithm>
#include <iostream>
#include <vector>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec.at(i);
}
sort(vec.begin(), vec.end());
int a = vec.at(n / 2 - 1);
int b = vec.at(n / 2);
cout << b - a << endl;
} | [] | 797,807 | 797,808 | u656568465 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(cons... | #include <iostream>
#include <vector>
using namespace std;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(cons... | [
"expression.operation.binary.add"
] | 797,816 | 797,817 | u620269708 | cpp |
p02990 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define maxs(x, y) (x = ma... | [
"assignment.compound.arithmetic.replace.add",
"expression.operator.arithmetic.replace.remove",
"expression.operation.binary.change",
"literal.number.change",
"call.arguments.change"
] | 797,818 | 797,819 | u577393547 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
const int MAX = 3000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
const int MAX = 3000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1... | [
"expression.operation.binary.add"
] | 797,821 | 797,822 | u976833038 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] =... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
const int MAX = 3000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1... | [
"literal.number.change",
"variable_declaration.value.change"
] | 797,823 | 797,822 | u976833038 | cpp |
p02990 |
// D - Blue and Red Balls
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
const int MOD = 1e9 + 7;
class Comb {
private:
int MOD;
long long *fac;
long long *finv;
long long *inv;
public:
// 事前にテーブルを作成
Comb(int MAX,... |
// D - Blue and Red Balls
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
// const int INF = 2147483647;
// const ll INF = 9223372036854775807;
const int MOD = 1e9 + 7;
class Comb {
private:
int MOD;
long long *fac;
long long *finv;
long long *inv;
public:
// 事前にテーブルを作成
Comb(int MAX,... | [
"variable_declaration.type.change"
] | 797,824 | 797,825 | u790272146 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define int long long
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* short */
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define F first
#define S second
#define ALL(v) begin(v), end(v)
/*... | #include <bits/stdc++.h>
using namespace std;
#define int long long
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* short */
#define pb push_back
#define mp make_pair
#define fst first
#define snd second
#define F first
#define S second
#define ALL(v) begin(v), end(v)
/*... | [
"assignment.change"
] | 797,828 | 797,829 | u106964380 | cpp |
p02990 | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
// https://... | // g++ -std=c++14 test.cpp -o test.out
#include <algorithm>
#include <cassert>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <math.h>
#include <queue>
#include <stdlib.h>
#include <string.h>
#include <utility>
#include <vector>
using namespace std;
// https://... | [
"expression.operation.binary.add"
] | 797,834 | 797,835 | u302000346 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD... | [
"expression.operation.binary.add"
] | 797,836 | 797,837 | u239087789 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | [] | 797,842 | 797,843 | u322177979 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#defin... | [] | 797,845 | 797,843 | u322177979 | cpp |
p02990 | /*
24 January 2020
islingr
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<... | /*
24 January 2020
islingr
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<... | [] | 797,848 | 797,849 | u883745615 | cpp |
p02990 | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, a, b) for (signed i = a; i < (b); ++i)
#define erep(i, a, b) for (signed i = a; i <= (b); ++i)
#define per(i, a, b) for (signed i = (a); i > (b); --i)
#define eper(i, a, b) for (signed i = (a); i >= b; --i)
#define fore(i, x, a) for (aut... | #include <bits/stdc++.h>
#define int long long
#define ll long long
#define rep(i, a, b) for (signed i = a; i < (b); ++i)
#define erep(i, a, b) for (signed i = a; i <= (b); ++i)
#define per(i, a, b) for (signed i = (a); i > (b); --i)
#define eper(i, a, b) for (signed i = (a); i >= b; --i)
#define fore(i, x, a) for (aut... | [
"expression.operation.binary.add"
] | 797,852 | 797,853 | u394919721 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
vector<vector<int>> dp(N + 1, vector<int>(N + 1));
for (int i = 0; i <= N; i++) {
dp[i][0] = 1;
dp[i][i] = 1;
for (int j = 1; j < i; j++) {
dp[i][j] = (dp[i - 1][j]... | #include <iostream>
#include <vector>
using namespace std;
const int MOD = 1000000007;
int main() {
int N, K;
cin >> N >> K;
vector<vector<long long>> dp(N + 1, vector<long long>(N + 1));
for (int i = 0; i <= N; i++) {
dp[i][0] = 1;
dp[i][i] = 1;
for (int j = 1; j < i; j++) {
dp[i][j] = (... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 797,860 | 797,861 | u188117876 | cpp |
p02990 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 797,862 | 797,863 | u421426760 | cpp |
p02990 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | [
"literal.string.change",
"io.output.change",
"function.return_value.change"
] | 797,864 | 797,863 | u421426760 | cpp |
p02990 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | [
"preprocessor.define.value.change",
"literal.integer.change",
"function.return_value.change"
] | 797,865 | 797,863 | u421426760 | cpp |
p02990 | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | #include <bits/stdc++.h>
#include <cmath>
#include <numeric>
using namespace std;
#define rep(i, a, b) for (int64_t i = (a); i < (b); ++i) // a ≦ i < b
#define Rrep(i, a, b) \
for (int64_t i = (a); i >= (b); --i) // reverse repeat. a から b まで減少．
#define ALL(a) (... | [
"function.return_value.change"
] | 797,867 | 797,863 | u421426760 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (in... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define repr(i, a, b) for (in... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"variable_declaration.type.change"
] | 797,868 | 797,869 | u314008046 | cpp |
p02990 | #include <iostream>
#include <stdio.h>
using namespace std;
#define REP(a, i, n) for (int i = a; i < n; ++i)
const int limitation = 2005;
long C[limitation][limitation]; // C[n][k] = n! / (k! * (n - k)!)
long calc(int i, int j) {
if (C[i][j] != 0)
return C[i][j];
if (i < j) {
return 1;
} else if (i =... | #include <iostream>
#include <stdio.h>
using namespace std;
#define REP(a, i, n) for (int i = a; i < n; ++i)
const int limitation = 2005;
long C[limitation][limitation]; // C[n][k] = n! / (k! * (n - k)!)
long calc(int i, int j) {
if (C[i][j] != 0)
return C[i][j];
if (i < j) {
return 0;
} else if (i =... | [
"literal.number.change",
"function.return_value.change"
] | 797,878 | 797,879 | u392294962 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define repl(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const l... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define REPL(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define repl(i, n) REP(i, 0, n)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const l... | [
"call.add",
"identifier.change",
"call.function.change"
] | 797,882 | 797,883 | u764013649 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
long long cob(long long a, long long b... | #include <bits/stdc++.h>
using namespace std;
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
long long cob(long long a, long long b... | [
"assignment.add"
] | 797,884 | 797,885 | u431602218 | cpp |
p02990 | #include <bits/stdc++.h>
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 (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v)... | #include <bits/stdc++.h>
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 (ll i = (a); i <= (b); i++)
#define repR(i, n) for (ll i = n; i >= 0; i--)
#define all(v) (v).begin(), (v).end()
#define rall(v)... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 797,886 | 797,887 | u103850114 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include ... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include ... | [
"expression.operation.binary.add"
] | 797,892 | 797,893 | u099918199 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i %... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i %... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 797,894 | 797,895 | u580402951 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
c... | #include <bits/stdc++.h>
using namespace std;
#define SZ(x) (int)(x.size())
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
const double eps = 1e-10;
const int MOD = 1000000007;
c... | [
"expression.operation.binary.add"
] | 797,896 | 797,897 | u334351654 | cpp |
p02990 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
... | [
"expression.operation.binary.add"
] | 797,898 | 797,899 | u550014122 | cpp |
p02990 | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
... | #include <algorithm>
#include <assert.h>
#include <bits/stdc++.h>
#include <bitset>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = 1001001001001001LL;
... | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 797,900 | 797,899 | u550014122 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < (b); i++)
#define repr(i, b, a) for (int i = int(b); i >= (a); i--)
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + ... | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = int(a); i < (b); i++)
#define repr(i, b, a) for (int i = int(b); i >= (a); i--)
#define all(x) x.begin(), x.end()
const ll mod = 1e9 + ... | [
"call.arguments.change",
"call.arguments.add"
] | 797,901 | 797,902 | u700986952 | cpp |
p02990 | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | // include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 797,905 | 797,906 | u089668660 | cpp |
p02990 | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 1000000007;
using ll = long long;
using namespace std;
ll memo[2500][2500];
ll comb(int x, int y) {
if (memo[x][y])
return memo[x][y];
if (y == 0 || y == x)
return memo[x][y] = 1;
return memo[x][y] = (comb(x - 1, y) ... | #include <bits/stdc++.h>
#define l_ength size
const int inf = (1 << 30);
const int mod = 1000000007;
using ll = long long;
using namespace std;
ll memo[2500][2500];
ll comb(int x, int y) {
if (x < y || memo[x][y])
return memo[x][y];
if (y == 0 || y == x)
return memo[x][y] = 1;
return memo[x][y] = (comb(x... | [
"control_flow.branch.if.condition.change"
] | 797,907 | 797,908 | u268977772 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
ll mod = 1e9 + 7;
ll comb[5001][5001];
int main() {
ll k, n;
cin >> n >> k;
... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <vector>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
ll mod = 1e9 + 7;
ll comb[5001][5001];
int main() {
ll k, n;
cin >> n >> k;
... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 797,913 | 797,914 | u790614328 | cpp |
p02990 | #include <algorithm>
#include <iostream>
#include <string>
#define llint long long
#define mod 1000000007
using namespace std;
llint n, k;
const int FACT_MAX = 200005;
llint fact[FACT_MAX], fact_inv[FACT_MAX];
llint modpow(llint a, llint n) {
if (n == 0)
return 1;
if (n % 2) {
return ((a % mod) * (modpo... | #include <algorithm>
#include <iostream>
#include <string>
#define llint long long
#define mod 1000000007
using namespace std;
llint n, k;
const int FACT_MAX = 200005;
llint fact[FACT_MAX], fact_inv[FACT_MAX];
llint modpow(llint a, llint n) {
if (n == 0)
return 1;
if (n % 2) {
return ((a % mod) * (modpo... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"misc.off_by_one"
] | 797,917 | 797,918 | u319282133 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const long long MAX = 510000;
const long long MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
... | #include <bits/stdc++.h>
using namespace std;
const long long MAX = 10000;
const long long MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 797,919 | 797,920 | u523303964 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const long long MAX = 2010;
const long long MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
in... | #include <bits/stdc++.h>
using namespace std;
const long long MAX = 10000;
const long long MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
i... | [
"literal.number.change",
"variable_declaration.value.change"
] | 797,921 | 797,920 | u523303964 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll n, k, ans = 0;
cin >> n >> k;
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1, 0));
rep(i, n + 1) dp[i][0] = 1;
for (int j ... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll n, k, ans = 0;
cin >> n >> k;
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1, 0));
rep(i, n + 1) dp[i][0] = 1;
for (int j ... | [
"expression.operation.binary.add"
] | 797,931 | 797,932 | u199343957 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
int n, k, ans = 0;
cin >> n >> k;
vector<vector<int>> dp(n + 1, vector<int>(k + 1, 0));
rep(i, n + 1) dp[i][0] = 1;
for (int... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
const int MOD = 1000000007;
int main() {
ll n, k, ans = 0;
cin >> n >> k;
vector<vector<ll>> dp(n + 1, vector<ll>(k + 1, 0));
rep(i, n + 1) dp[i][0] = 1;
for (int j ... | [
"variable_declaration.type.change",
"call.arguments.change"
] | 797,933 | 797,932 | u199343957 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
#define MAX 10000
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
#define MAX 10000
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - ... | [
"identifier.change",
"call.function.change",
"io.output.change",
"call.arguments.change",
"call.arguments.add",
"misc.opposites",
"expression.operator.arithmetic.change"
] | 797,934 | 797,935 | u656771711 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD... | [
"expression.operation.binary.add"
] | 797,936 | 797,937 | u736788838 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const ll mod = 1000000007;
#define INF (1 << 29)
/* ちゃんと考えて実装して問題なくACできた時嬉しいよ！！ */
ll C[2001][2001];
void pascal_shower() {
for (int i = 0; i <= 2000; i++) {
C[i][0] = 1;
C[i][i] = 1;
}
for (int i = 2; i <= 2000; i++) {
for (i... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
static const ll mod = 1000000007;
#define INF (1 << 29)
/* ちゃんと考えて実装して問題なくACできた時嬉しいよ！！ */
ll C[2001][2001];
void pascal_shower() {
for (int i = 0; i <= 2000; i++) {
C[i][0] = 1;
C[i][i] = 1;
}
for (int i = 2; i <= 2000; i++) {
for (i... | [
"assignment.change"
] | 797,938 | 797,939 | u900688325 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int MOD = 1e9 + 7;
const int MAX_N = 2000000;
ll inv[MAX_N + 10];
ll fac[MAX_N + 10], facInv[MAX_N + 10];
class MATH {
public:
MATH() {
inverse();
factroial();
}
ll nCk(ll n, ll k) {... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
const int MOD = 1e9 + 7;
const int MAX_N = 2000000;
ll inv[MAX_N + 10];
ll fac[MAX_N + 10], facInv[MAX_N + 10];
class MATH {
public:
MATH() {
inverse();
factroial();
}
ll nCk(ll n, ll k) {... | [
"variable_declaration.type.change"
] | 797,942 | 797,943 | u029876051 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, int> P;
ll C[2100][2100];
int main() {
for (int i = 1; i < 2100; i++) {
C... | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
using namespace std;
#define INF 110000000000
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, int> P;
ll C[2100][2100];
int main() {
for (int i = 0; i < 2100; i++) {
C... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 797,950 | 797,951 | u591914971 | cpp |
p02990 | /*
∫ ∫ ∫
ノヽ
（＿ ）
（＿ ）
（＿＿＿＿＿＿ ）
ヽ(´･ω･)ﾉ
| /
UU
*/
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
using P = pair<ll, ll>;
typedef vector<int> vi;
const int MOD = (int)1e9 + 7;
const ll INF = 1LL << 60;
const int inf = 1 << 30;
template <class T> bool chmax(T &a, const T &b) {
... | /*
∫ ∫ ∫
ノヽ
（＿ ）
（＿ ）
（＿＿＿＿＿＿ ）
ヽ(´･ω･)ﾉ
| /
UU
*/
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
using P = pair<ll, ll>;
typedef vector<int> vi;
const int MOD = (int)1e9 + 7;
const ll INF = 1LL << 60;
const int inf = 1 << 30;
template <class T> bool chmax(T &a, const T &b) {
... | [
"assignment.change"
] | 797,953 | 797,954 | u788137651 | cpp |
p02990 | #include <iostream>
//#include <math.h>
#include <algorithm>
#include <iomanip>
#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;
#... | #include <iostream>
//#include <math.h>
#include <algorithm>
#include <iomanip>
#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;
#... | [
"identifier.change",
"expression.operation.binary.change"
] | 797,959 | 797,960 | u297203024 | cpp |
p02990 | #include <algorithm>
#include <iostream>
#include <list>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef list<ll> listl;
typedef string str;
#define min(A, B) min(static_cast<ll>(A), static_cast<ll>(B))
#define max(A, B) max(static_cast... | #include <algorithm>
#include <iostream>
#include <list>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef list<ll> listl;
typedef string str;
#define min(A, B) min(static_cast<ll>(A), static_cast<ll>(B))
#define max(A, B) max(static_cast... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 797,961 | 797,962 | u288035794 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T>... | [
"expression.operation.binary.add"
] | 797,969 | 797,970 | u052332717 | cpp |
p02990 | #include <bits/stdc++.h>
#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(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
... | #include <bits/stdc++.h>
#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(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
... | [
"variable_declaration.type.change"
] | 797,973 | 797,974 | u850516963 | cpp |
p02990 | #include <bits/stdc++.h>
#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(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
... | #include <bits/stdc++.h>
#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(i, 0, (n))
#define REPS(i, n) FOR(i, 1, (n) + 1)
#define RREP(i, n) RFOR(i, 0, (n))
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
... | [
"variable_declaration.type.change"
] | 797,975 | 797,976 | u850516963 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#includ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 797,979 | 797,980 | u861345985 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
constexpr int mod = 1e9 + 7;
int comb[2010][2010];
void init(int n) {
comb[0][0] = 1;
rep(i, n) {
rep(j, i + 1) {
comb[i + 1][j] += comb[i][j];
comb[i + 1][j] %= mod;
com... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
constexpr int mod = 1e9 + 7;
ll comb[2010][2010];
void init(int n) {
comb[0][0] = 1;
rep(i, n) {
rep(j, i + 1) {
comb[i + 1][j] += comb[i][j];
comb[i + 1][j] %= mod;
comb... | [
"variable_declaration.type.change"
] | 797,983 | 797,984 | u292106243 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000007;
const int mod = 10000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (long long)(n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
using vi = vector<ll>;
using vvi = vector<vector<ll>>;
using vc = vector<char>;
using vvc = vector<vector<char>>;
const int inf = 1000000007;
const int mod = 10000... | [] | 797,985 | 797,986 | u422633119 | cpp |
p02990 |
//けんちょんさんに感謝！！！！！！！！！！！（2回目）
// http://drken1215.hatenablog.com/entry/2019/06/30/183400
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#define rep(i, n) for (long long i = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
template <int MOD> struct Fp {
long... |
//けんちょんさんに感謝！！！！！！！！！！！（2回目）
// http://drken1215.hatenablog.com/entry/2019/06/30/183400
#include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <queue>
#define rep(i, n) for (long long i = 0; (i) < (n); (i)++)
using namespace std;
using ll = long long;
template <int MOD> struct Fp {
long... | [
"literal.number.change",
"variable_declaration.value.change"
] | 797,989 | 797,990 | u378155378 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, x, N) for (int i = x; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll combi[2001][2001] = {0};
int main() {
int n, r;
cin >> n >> r;
rep(i, 0, 2001) {
rep(j, 0, 2001) {
if (i == ... | #include <bits/stdc++.h>
#define rep(i, x, N) for (int i = x; i < (N); i++)
#define swap(a, b) (a += b, b = a - b, a -= b)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll combi[2001][2001] = {0};
int main() {
int n, r;
cin >> n >> r;
rep(i, 0, 2001) {
rep(j, 0, 2001) {
if (i == ... | [
"expression.operation.binary.add"
] | 797,993 | 797,994 | u466393447 | cpp |
p02986 | /*input
*/
#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define ff first
#define ss second
#define pb push_back
using ll = long long;
using pii = pair<ll, ll>;
template <typename T> using V = vector<T>;
// dist(a, b) = D(a) + D(b) - 2 * D(L)
// Traverse the tree using a DFS. For ... | /*input
*/
#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define ff first
#define ss second
#define pb push_back
using ll = long long;
using pii = pair<int, int>;
template <typename T> using V = vector<T>;
// dist(a, b) = D(a) + D(b) - 2 * D(L)
// Traverse the tree using a DFS. Fo... | [
"variable_declaration.type.change",
"expression.operation.unary.arithmetic.add"
] | 798,003 | 798,004 | u704703586 | cpp |
p02986 | /*input
*/
#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define ff first
#define ss second
#define pb push_back
using ll = long long;
using pii = pair<ll, ll>;
template <typename T> using V = vector<T>;
// dist(a, b) = D(a) + D(b) - 2 * D(L)
// Traverse the tree using a DFS. For ... | /*input
*/
#include <bits/stdc++.h>
using namespace std;
#define all(a) a.begin(), a.end()
#define ff first
#define ss second
#define pb push_back
using ll = long long;
using pii = pair<int, int>;
template <typename T> using V = vector<T>;
// dist(a, b) = D(a) + D(b) - 2 * D(L)
// Traverse the tree using a DFS. Fo... | [
"expression.operation.unary.arithmetic.add"
] | 798,003 | 798,005 | u704703586 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
int n, q;
struct edge {
int v, c, w;
edge(int vv, int cc, int ww) {
v = vv;
c = cc;
w = ww;
}
};
vector<edge> G[123456];
int cnt[123456], in[123456], out[123456], tim = 0;
int pa[18][123... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
int n, q;
struct edge {
int v, c, w;
edge(int vv, int cc, int ww) {
v = vv;
c = cc;
w = ww;
}
};
vector<edge> G[123456];
int cnt[123456], in[123456], out[123456], tim = 0;
int pa[18][123... | [
"literal.number.change",
"call.arguments.change"
] | 798,020 | 798,017 | u594742844 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
int n, q;
struct edge {
int v, c, w;
edge(int vv, int cc, int ww) {
v = vv;
c = cc;
w = ww;
}
};
vector<edge> G[123456];
int cnt[123456], in[123456], out[123456], tim = 0;
int pa[18][123... | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int, int>
#define mp make_pair
int n, q;
struct edge {
int v, c, w;
edge(int vv, int cc, int ww) {
v = vv;
c = cc;
w = ww;
}
};
vector<edge> G[123456];
int cnt[123456], in[123456], out[123456], tim = 0;
int pa[18][123... | [
"literal.number.change",
"call.arguments.change"
] | 798,020 | 798,021 | u594742844 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
vector<pipii> g[100005];
int ans[100005];
int par[17][100005], depth[100005], dp[100005];
void dfs(int u, int p, int d, int val) {
depth[u] = d;
par[0][u] = p;
dp[u] = val;
for (int i = 0; i < g[u].size(); i... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
vector<pipii> g[100005];
int ans[100005];
int par[17][100005], depth[100005], dp[100005];
void dfs(int u, int p, int d, int val) {
depth[u] = d;
par[0][u] = p;
dp[u] = val;
for (int i = 0; i < g[u].size(); i... | [
"variable_declaration.name.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 798,067 | 798,068 | u854367220 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
vector<pipii> g[100005];
int ans[100005];
int par[17][100005], depth[100005], dp[100005];
void dfs(int u, int p, int d, int val) {
depth[u] = d;
par[0][u] = p;
dp[u] = val;
for (int i = 0; i < g[u].size(); i... | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
vector<pipii> g[100005];
int ans[100005];
int par[17][100005], depth[100005], dp[100005];
void dfs(int u, int p, int d, int val) {
depth[u] = d;
par[0][u] = p;
dp[u] = val;
for (int i = 0; i < g[u].size(); i... | [
"variable_declaration.name.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"assignment.change"
] | 798,069 | 798,068 | u854367220 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
vector<pipii> g[100005];
LL ans[100005];
int par[17][100005], depth[100005];
LL dp[100005];
void dfs(int u, int p, int d, LL val) {
depth[u] = d;
par[0][u] = p;
dp[u] = val;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
vector<pipii> g[100005];
LL ans[100005];
int par[17][100005], depth[100005];
LL dp[100005];
void dfs(int u, int p, int d, LL val) {
depth[u] = d;
par[0][u] = p;
dp[u] = val;
for (int i ... | [
"variable_declaration.name.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 798,070 | 798,071 | u854367220 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
vector<pipii> g[100005];
LL ans[100005];
int par[17][100005], depth[100005];
LL dp[100005];
void dfs(int u, int p, int d, LL val) {
depth[u] = d;
par[0][u] = p;
dp[u] = val;
for (int i ... | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
typedef pair<int, pii> pipii;
vector<pipii> g[100005];
LL ans[100005];
int par[17][100005], depth[100005];
LL dp[100005];
void dfs(int u, int p, int d, LL val) {
depth[u] = d;
par[0][u] = p;
dp[u] = val;
for (int i ... | [
"variable_declaration.name.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"variable_declaration.type.change"
] | 798,072 | 798,071 | u854367220 | cpp |
p02986 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ld, ld> pdd;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
io... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ld, ld> pdd;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
io... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 798,073 | 798,074 | u722777218 | cpp |
p02986 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ld, ld> pdd;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
io... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ld, ld> pdd;
#define fi first
#define se second
#define mp make_pair
#define fastIO \
io... | [
"expression.operation.unary.add",
"control_flow.branch.if.condition.change"
] | 798,075 | 798,074 | u722777218 | cpp |
p02986 | // Daniel Grzegorzewski
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define MP make_pair
#define PB push_back
#define ST first
#define ND second
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_s... | // Daniel Grzegorzewski
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("O3")
#define MP make_pair
#define PB push_back
#define ST first
#define ND second
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_s... | [
"control_flow.loop.condition.change",
"control_flow.loop.for.condition.change"
] | 798,076 | 798,077 | u413886749 | cpp |
p02986 | /*
Rathin Bhargava
IIIT Bangalore
*/
#include <bits/stdc++.h>
#define mt make_tuple
#define mp make_pair
#define pu push_back
#define INF 1000000001
#define MOD 1000000007
// #define ll long long int
#define int long long int
#define ld long double
#define fi first
#define se second
#define pr(v) ... | /*
Rathin Bhargava
IIIT Bangalore
*/
#include <bits/stdc++.h>
#define mt make_tuple
#define mp make_pair
#define pu push_back
#define INF 1000000001
#define MOD 1000000007
#define ll long long int
#define ld long double
#define fi first
#define se second
#define pr(v) ... | [
"identifier.change",
"function.return_type.change"
] | 798,098 | 798,099 | u760425207 | cpp |
p02986 | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100100, lg = 20;
struct query {
int i, x, y, sig;
};
vector<tuple<int, int, int>> e[maxn];
vector<query> que[maxn];
int par[lg][maxn], dep[maxn];
void dfs(int u, int p) {
par[0][u] = p;
for (auto ee : e[u]) {
int to, b, c;
tie(to, b, c);
i... | #include <bits/stdc++.h>
using namespace std;
const int maxn = 100100, lg = 20;
struct query {
int i, x, y, sig;
};
vector<tuple<int, int, int>> e[maxn];
vector<query> que[maxn];
int par[lg][maxn], dep[maxn];
void dfs(int u, int p) {
par[0][u] = p;
for (auto ee : e[u]) {
int to, b, c;
tie(to, b, c) = ee;
... | [
"assignment.change"
] | 798,100 | 798,101 | u251828455 | cpp |
p02986 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define maxn 100005
#define maxq 100005
#define mp make_pair
using namespace std;
typedef long long ll;
const int LEN = 100000;
typedef pair<int, int> P;
struct fastio {... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <utility>
#include <vector>
#define maxn 100005
#define maxq 100005
#define mp make_pair
using namespace std;
typedef long long ll;
const int LEN = 100000;
typedef pair<int, int> P;
struct fastio {... | [
"literal.number.change",
"expression.operation.binary.change",
"identifier.change",
"control_flow.loop.for.condition.change"
] | 798,104 | 798,105 | u002547574 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.