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 |
|---|---|---|---|---|---|---|---|
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[n / 2 + 1] == a[n / 2])
cout << "0" << endl;
else
cout << a[n / 2 + 1] - a[n / 2] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
if (a[n / 2 - 1] == a[n / 2])
cout << "0" << endl;
else
cout << a[n / 2] - a[n / 2 - 1] << endl;
return 0;
}
| [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 797,092 | 797,093 | u640323045 | cpp |
p02989 | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; ++i) {
cin >> d[i];
}
sort(d.begin(), d.end());
int res = d[n / 2 + 1] -... | #include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vector<int> d(n);
for (int i = 0; i < n; ++i) {
cin >> d[i];
}
sort(d.begin(), d.end());
int res = d[n / 2] - d[n... | [
"expression.operation.binary.remove"
] | 797,100 | 797,101 | u640255289 | cpp |
p02989 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int num[n];
int ans;
for (int i = 0; i < n; i++)
cin >> num[i];
sort(num, num + n);
if (num[n / 2 + 1] == num[n / 2])
ans = 0;
else
ans = num[n / 2] - num[n / 2... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
int main(void) {
int n;
cin >> n;
int num[n];
int ans;
for (int i = 0; i < n; i++)
cin >> num[i];
sort(num, num + n);
if (num[n / 2] == num[n / 2 - 1])
ans = 0;
else
ans = num[n / 2] - num[n / 2... | [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 797,119 | 797,120 | u157195505 | cpp |
p02989 | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <stdio.h>
#include <time.h>
#include <unordered_set>
#... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <stdio.h>
#include <time.h>
#include <unordered_set>
#... | [
"expression.operation.binary.remove"
] | 797,166 | 797,167 | u485550995 | cpp |
p02989 | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <stdio.h>
#include <time.h>
#include <unordered_set>
#... | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx,avx2")
#include <algorithm>
#include <bitset>
#include <cassert>
#include <iostream>
#include <map>
#include <random>
#include <set>
#include <stdio.h>
#include <time.h>
#include <unordered_set>
#... | [
"expression.operation.binary.remove",
"variable_access.subscript.index.change",
"io.output.change"
] | 797,168 | 797,167 | u485550995 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int s = n / 2;
cout << a[s + 1] - a[s] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a[i];
}
sort(a.begin(), a.end());
int s = n / 2;
cout << a[s] - a[s - 1] << endl;
return 0;
}
| [
"expression.operation.binary.remove"
] | 797,205 | 797,206 | u127361799 | 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[i];
sort(d.begin(), d.end());
cout << d[n / 2 + 1] - d[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[i];
sort(d.begin(), d.end());
cout << d[n / 2] - d[n / 2 - 1] << endl;
} | [
"expression.operation.binary.remove"
] | 797,207 | 797,208 | u370447425 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int a[100010], n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a, a + n);
cout << a[n / 2 + 1] - a[n / 2];
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int a[100010], n;
int main() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a, a + n + 1);
cout << a[n / 2 + 1] - a[n / 2];
return 0;
} | [
"expression.operation.binary.add"
] | 797,224 | 797,225 | u260168182 | cpp |
p02989 | #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
cout << a.at(n - 1) - a.at(n - 2) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
vector<int> a(n);
for (int i = 0; i < n; i++) {
cin >> a.at(i);
}
sort(a.begin(), a.end());
cout << a.at(n / 2) - a.at(n / 2 - 1) << endl;
}
| [
"expression.operator.arithmetic.change",
"io.output.change"
] | 797,242 | 797,243 | u577552796 | cpp |
p02989 | #include <iostream>
#include <vector>
using namespace std;
typedef long value_type; /* ソートするキーの型 */
/* x, y, z の中間値を返す */
value_type med3(value_type x, value_type y, value_type z) {
if (x < y) {
if (y < z)
return y;
else if (z < x)
return x;
else
return z;
} else {
if (z < y)
... | #include <iostream>
#include <vector>
using namespace std;
typedef long value_type; /* ソートするキーの型 */
/* x, y, z の中間値を返す */
value_type med3(value_type x, value_type y, value_type z) {
if (x < y) {
if (y < z)
return y;
else if (z < x)
return x;
else
return z;
} else {
if (z < y)
... | [
"expression.operation.binary.remove"
] | 797,247 | 797,248 | u344977358 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
con... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using ll = long long;
using ld = long double;
using namespace std;
con... | [
"expression.operation.binary.add"
] | 797,263 | 797,264 | u756784272 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int c(int n, int r) {
const int mod = 1000000007;
long long x = 1, g = 1;
for (int i = 1; i <= r; i++) {
x *= (n - i + 1);
x %= mod;
g *= i;
g %= mod;
}
long long pow = g;
g = 1;
for (int i = mod - 2; i > 0; i /= 2) {
if (i % 2)
g *= ... | #include <bits/stdc++.h>
using namespace std;
long long c(int n, int r) {
const int mod = 1000000007;
long long x = 1, g = 1;
for (int i = 1; i <= r; i++) {
x *= (n - i + 1);
x %= mod;
g *= i;
g %= mod;
}
long long pow = g;
g = 1;
for (int i = mod - 2; i > 0; i /= 2) {
if (i % 2)
... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 797,265 | 797,266 | u507850687 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 1e9 + 7;
ll LLINF = 1LL << 60;
int INF = INT_MAX;
//
// a^n mod を計算する
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
using ll = long long;
const ll MOD = 1e9 + 7;
ll LLINF = 1LL << 60;
int INF = INT_MAX;
//
// a^n mod を計算する
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n ... | [
"expression.operation.binary.add"
] | 797,277 | 797,278 | u646962247 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%d", &x);
ll mpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%d", &x);
ll mpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 797,279 | 797,280 | u920543723 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%d", &x);
ll mpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define sc(x) scanf("%d", &x);
ll mpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 797,281 | 797,280 | u920543723 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define rep(a, n) for (int i = a; i < n; i++)
#define rep1(a, n) for (int i = a; i <= n; i++)
#define bada 1000000007
int c[2001][2001];
int main() {
for (int i = 0; i <= 2000; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define rep(a, n) for (int i = a; i < n; i++)
#define rep1(a, n) for (int i = a; i <= n; i++)
#define bada 1000000007
ll c[2001][2001];
int main() {
for (int i = 0; i <= 2000; i++) {
... | [
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 797,282 | 797,283 | u507549471 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define rep(a, n) for (int i = a; i < n; i++)
#define rep1(a, n) for (int i = a; i <= n; i++)
#define bada 1000000007
ll c[2001][2001];
int main() {
for (int i = 0; i <= 2000; i++) {
... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define rep(a, n) for (int i = a; i < n; i++)
#define rep1(a, n) for (int i = a; i <= n; i++)
#define bada 1000000007
ll c[2001][2001];
int main() {
for (int i = 0; i <= 2000; i++) {
... | [
"expression.operation.binary.remove"
] | 797,284 | 797,283 | u507549471 | 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,285 | 797,286 | u189867560 | 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 ... | [
"identifier.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 797,287 | 797,286 | u189867560 | 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,287 | 797,289 | u189867560 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define all(x) (x).begin(), (x).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> i... | [
"expression.operation.binary.add"
] | 797,290 | 797,291 | u989306199 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Edge = pair<int, int>;
using Graph = vector<vector<Edge>>;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define RSORT(v) sort((v).rbegin(), (v).rend())
const ll MOD = 1000000007;
const ll nmax = 8;
... | [
"assignment.change"
] | 797,292 | 797,293 | u228295160 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
// 二分累乗法による a^b mod p
ll mod_pow(ll a, ll b, ll p) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % p;
a = a * a % p;
b >>= 1;
}
return res;
}
vector<ll> fact;
// n! mod p
void mod_fact(ll ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
// 二分累乗法による a^b mod p
ll mod_pow(ll a, ll b, ll p) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % p;
a = a * a % p;
b >>= 1;
}
return res;
}
vector<ll> fact;
// n! mod p
void mod_fact(ll ... | [
"assignment.change"
] | 797,296 | 797,297 | u705561278 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using P = pair<int, int>;
const int inf = 1e9;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
con... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef string str;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 1; i <= n; ++i)
#define all(obj) (obj).begin(), (obj).end()
using P = pair<int, int>;
const int inf = 1e9;
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
con... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 797,298 | 797,299 | u142577570 | cpp |
p02990 | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const ll MAX = 51000;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
ll extGCD(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(a, b % a, y, x);
y -= (a / b) * x;
retu... | #include <algorithm>
#include <iostream>
using namespace std;
typedef long long ll;
const ll MAX = 51000;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
ll extGCD(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll d = extGCD(a, b % a, y, x);
y -= (a / b) * x;
retu... | [
"assignment.change"
] | 797,300 | 797,301 | u255112547 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll LongINF = 1e13 + 7;
const int INF = 1e9 + 7;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll LongINF = 1e13 + 7;
const ll INF = 1e9 + 7;
const int dx[] = {0, 1, 0, -1};
const int dy[] = {1, 0, -1, 0};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
r... | [
"variable_declaration.type.change",
"assignment.change"
] | 797,302 | 797,303 | u534015096 | cpp |
p02990 | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define int long long
using namespace std;
const int INF = 2e18;
const int MOD = 1e9 + 7;
const int MB = 20;
const int maxN = 1e4 + 1;
int fact[maxN], re... | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define int long long
using namespace std;
const int INF = 2e18;
const int MOD = 1e9 + 7;
const int MB = 20;
const int maxN = 1e4 + 1;
int fact[maxN], re... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 797,309 | 797,310 | u782387599 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 4005;
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 - inv[mod % i] *... | #include <bits/stdc++.h>
using namespace std;
const int MAX = 4005;
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 - inv[mod % i] *... | [
"expression.operation.binary.remove"
] | 797,317 | 797,318 | u983681697 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, b) for (int i = a; i < (int)b; i++)
#define rep(i, n) REP(i, 0, n)
#define all(c) (c).begin(), (c).end()
#define zero(a) memset(a, 0, sizeof a)
#define minus(a) memset(a, -1, sizeof a)
#define watch(a) ... | [
"literal.number.change",
"variable_declaration.value.change",
"assignment.variable.change",
"expression.operation.binary.change"
] | 797,319 | 797,320 | u809665051 | cpp |
p02990 | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pa;
const int N = 2e5 + 100;
const int inf = 0x3f3f3f3f;
c... | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pa;
const int N = 2e5 + 100;
const int inf = 0x3f3f3f3f;
c... | [
"assignment.change"
] | 797,321 | 797,322 | u722928342 | cpp |
p02990 | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pa;
const int N = 2e5 + 100;
const int inf = 0x3f3f3f3f;
c... | #include <algorithm>
#include <cstdio>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int> pa;
const int N = 2e5 + 100;
const int inf = 0x3f3f3f3f;
c... | [
"assignment.change"
] | 797,323 | 797,322 | u722928342 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1000000007;
const double PI = 3.14159265358979;
const ll INF = pow(10, 18);
typedef pair<ll, ll> P;
typedef vector<ll> vl;
typedef vector<vl> vvl;
#define FOR(i, a, b) for (ll i = a; i < b; i++)
#define rep(i, n) FOR(i, 0, n)
string abc ... | [
"assignment.change"
] | 797,326 | 797,327 | u328811800 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < (int)(n); i++)
ll MOD = 1000000007;
ll pow_mod(ll x, ll n) {
x %= MOD;
if (n == 0)
return 1;
else if (n % 2 == 1)
return (x * pow_mod(x, n - 1)) % MOD;
else
return pow_mod((x * x) % MOD, n / ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < (int)(n); i++)
ll MOD = 1000000007;
ll pow_mod(ll x, ll n) {
x %= MOD;
if (n == 0)
return 1;
else if (n % 2 == 1)
return (x * pow_mod(x, n - 1)) % MOD;
else
return pow_mod((x * x) % MOD, n / ... | [
"expression.operation.binary.add"
] | 797,328 | 797,329 | u433189059 | cpp |
p02990 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
Int modpow(Int a, Int n, Int mod) {
Int ret = 1;
while (n > 0) {
if (n & 1) {
ret = ret *... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
Int modpow(Int a, Int n, Int mod) {
Int ret = 1;
while (n > 0) {
if (n & 1) {
ret = ret *... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change"
] | 797,336 | 797,337 | u261538386 | cpp |
p02990 | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 2010, mod = 1e9 + 7;
int n, k;
int f[N][N];
int main() {
cin >> n >> k;
for (int i = 0; i < N; i++)
f[i][0] = 1;
for (int i = 1; i < N; i++)
for (int j = 1; ... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 2010, mod = 1e9 + 7;
int n, k;
LL f[N][N];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
f[i][0] = 1;
for (int i = 1; i <= n; i++)
for (int j = 1; ... | [
"variable_declaration.type.change",
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 797,338 | 797,339 | u866538547 | cpp |
p02990 | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 2010, mod = 1e9 + 7;
int n, k;
int f[N][N];
int main() {
cin >> n >> k;
for (int i = 0; i <= n; i++)
f[i][0] = 1;
for (int i = 1; i <= n; i++)
for (int j = 1... | #include <bits/stdc++.h>
#define F first
#define S second
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
const int N = 2010, mod = 1e9 + 7;
int n, k;
LL f[N][N];
int main() {
cin >> n >> k;
for (int i = 0; i < n; i++)
f[i][0] = 1;
for (int i = 1; i <= n; i++)
for (int j = 1; ... | [
"variable_declaration.type.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 797,340 | 797,339 | u866538547 | cpp |
p02990 | #include <iostream>
#include <vector>
std::vector<std::vector<unsigned long>> comb(unsigned long n, unsigned long r) {
std::vector<std::vector<unsigned long>> v(
n + 1, std::vector<unsigned long>(n + 1, 0));
for (unsigned long i = 0; i < v.size(); ++i) {
v[i][0] = 1;
v[i][i] = 1;
}
for (unsigne... | #include <iostream>
#include <vector>
std::vector<std::vector<unsigned long>> comb(unsigned long n, unsigned long r) {
std::vector<std::vector<unsigned long>> v(
n + 1, std::vector<unsigned long>(n + 1, 0));
for (unsigned long i = 0; i < v.size(); ++i) {
v[i][0] = 1;
v[i][i] = 1;
}
for (unsigne... | [
"expression.operation.binary.remove"
] | 797,343 | 797,344 | u706001235 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 0;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理、これも呼ぶ
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1]... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define INF 999999999
#define rep(i, n) for (int i = 0; i < n; i++)
const int MOD = 1000000007;
ll cnt = 0;
const int MAX = 510000;
unsigned ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理、これも呼ぶ
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[... | [
"expression.operation.binary.add"
] | 797,345 | 797,346 | u179593519 | cpp |
p02990 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr long long int INFLL = ... | [
"identifier.change",
"call.function.change"
] | 797,352 | 797,353 | u863537799 | cpp |
p02990 | #include <bits/stdc++.h>
//----***やべーやつら***----
using namespace std;
#define int long long
//----***型定義***----
using ll = long long;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
typedef long double lb;
typedef vector<int, vector<int>> vvec;
typedef long double ld;
typedef pair<int, int> P;
//----***Lik... | #include <bits/stdc++.h>
//----***やべーやつら***----
using namespace std;
#define int long long
//----***型定義***----
using ll = long long;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
typedef long double lb;
typedef vector<int, vector<int>> vvec;
typedef long double ld;
typedef pair<int, int> P;
//----***Lik... | [
"assignment.add"
] | 797,356 | 797,357 | u526459074 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const long long INF = (long long)1e18... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const long long INF = (long long)1e18... | [
"expression.operation.binary.remove"
] | 797,359 | 797,360 | u645961531 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const long long INF = (long long)1e18... | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <stack>
#include <unordered_map>
#include <vector>
using namespace std;
using ll = long long;
const long long INF = (long long)1e18... | [
"control_flow.loop.for.initializer.change",
"variable_declaration.type.change",
"expression.operation.binary.remove"
] | 797,361 | 797,360 | u645961531 | cpp |
p02990 | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = l... | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author champon
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#define se cout << "test ok" << endl;
#define sp << " " <<
using namespace std;
using ll = long long;
using ld = long double;
const ll mod = l... | [
"assignment.change"
] | 797,364 | 797,365 | u026620445 | cpp |
p02990 | #define MOD 1000000007
#include <iostream>
#include <vector>
using namespace std;
long pow(long a, long b) {
if (!b)
return 1;
long c = pow(a, b / 2);
if (b % 2)
c = a * c % MOD * c % MOD;
else
c = c * c % MOD;
return c;
}
int main() {
int N, K;
cin >> N >> K;
vector<long> a(N + 1, 1), b(... | #define MOD 1000000007
#include <iostream>
#include <vector>
using namespace std;
long pow(long a, long b) {
if (!b)
return 1;
long c = pow(a, b / 2);
if (b % 2)
c = a * c % MOD * c % MOD;
else
c = c * c % MOD;
return c;
}
int main() {
int N, K;
cin >> N >> K;
vector<long> a(N + 1, 1), b(... | [
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove",
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 797,366 | 797,367 | u102795616 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b /= 2;
}
... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b /= 2;
}
... | [
"assignment.change"
] | 797,372 | 797,373 | u724012411 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
constexpr int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define rep(i, n) for (int i = 1; i <= n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define SORTR(v) sort((v).rb... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
constexpr int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define rep(i, n) for (int i = 1; i <= n; i++)
#define repr(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define SORTR(v) sort((v).rb... | [
"expression.operation.binary.add"
] | 797,384 | 797,385 | u310228685 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll c[2005][2005], mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 0; i <= 2002; i++) {
c[i][0] = c[i][i] = 1;
for (ll j = 1; j < i; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
}
for (ll i = 1; i... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll c[2005][2005], mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
for (ll i = 0; i <= 2002; i++) {
c[i][0] = c[i][i] = 1;
for (ll j = 1; j < i; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
}
for (ll i = 1; i... | [
"expression.operation.binary.add"
] | 797,392 | 797,393 | u089147470 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
static const double pi = 3.141592653589793;
typedef pair<int64_t, int64_t> P;
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 (i... | #include <bits/stdc++.h>
using namespace std;
static const double pi = 3.141592653589793;
typedef pair<int64_t, int64_t> P;
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 (i... | [
"expression.operation.binary.add"
] | 797,398 | 797,399 | u398685345 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) reverse((a).begin(), (a).end())
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
const long long INF = 1LL << 60;
// const int INF=1010101010;
using Edge = pair<int, int>;
using Graph = vector<... | #include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) reverse((a).begin(), (a).end())
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
const long long INF = 1LL << 60;
// const int INF=1010101010;
using Edge = pair<int, int>;
using Graph = vector<... | [
"expression.operation.binary.add"
] | 797,400 | 797,401 | u251779460 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) reverse((a).begin(), (a).end())
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
const long long INF = 1LL << 60;
// const int INF=1010101010;
using Edge = pair<int, int>;
using Graph = vector<... | #include <bits/stdc++.h>
using namespace std;
#define SORT(a) sort((a).begin(), (a).end())
#define RSORT(a) reverse((a).begin(), (a).end())
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;
const long long INF = 1LL << 60;
// const int INF=1010101010;
using Edge = pair<int, int>;
using Graph = vector<... | [
"literal.number.change",
"variable_declaration.value.change"
] | 797,402 | 797,401 | u251779460 | cpp |
p02990 | #include <bits/stdc++.h>
using ll = int_fast64_t;
const ll MOD = 1e9 + 7;
ll fact[100000], finv[100000], inv[100000];
void combinit() {
fact[0] = fact[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < 100000; i++) {
fact[i] = fact[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) %... | #include <bits/stdc++.h>
using ll = int_fast64_t;
const ll MOD = 1e9 + 7;
ll fact[100000], finv[100000], inv[100000];
void combinit() {
fact[0] = fact[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < 100000; i++) {
fact[i] = fact[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) %... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"identifier.replace.add",
"literal.replace.remove"
] | 797,411 | 797,412 | u242031676 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
using Graph = vector<vector<int>>;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
... | [
"assignment.change"
] | 797,414 | 797,415 | u770009793 | cpp |
p02990 | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include ... | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <functional>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include ... | [
"literal.number.change",
"expression.operation.binary.change",
"expression.operation.binary.remove"
] | 797,424 | 797,425 | u645188582 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
const int MAX = 2000;
const int mod = 1e9 + 7;
ll fac[MAX], finv[MAX], inv[MAX];
void COM... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define REP(i, d, n) for (int i = (d); i < (n); ++i)
#define all(v) v.begin(), v.end()
using ll = long long;
using P = pair<int, int>;
const int MAX = 2000;
const int mod = 1e9 + 7;
ll fac[MAX], finv[MAX], inv[MAX];
void COM... | [
"expression.operation.binary.remove"
] | 797,428 | 797,429 | u561143568 | cpp |
p02990 | #include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(), in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
const ll MOD = 1e9 + ... | #include <bits/stdc++.h>
#define loop2(i, s, n, a) for (int i = int(s); i < int(n); i += a)
#define loop(i, s, n) loop2(i, s, n, 1)
#define rep(i, n) loop(i, 0, n)
#define pb push_back
#define all(in) in.begin(), in.end()
using ll = long long;
using ull = unsigned long long;
using namespace std;
const ll MOD = 1e9 + ... | [
"literal.number.change",
"call.arguments.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 797,430 | 797,431 | u842028864 | cpp |
p02990 | ///////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <typeinfo>
#... | ///////////////////////////////////////////////////////////////////////////////
#include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <typeinfo>
#... | [
"assignment.add"
] | 797,432 | 797,433 | u167931717 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll MOD = 1000000007;
const int MAX = 4001;
long... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> l_l;
typedef pair<int, int> i_i;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define EPS (1e-7)
#define INF (1e9)
#define PI (acos(-1))
const ll MOD = 1000000007;
const int MAX = 4001;
long... | [
"expression.operation.binary.add"
] | 797,434 | 797,435 | u225642513 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define MOD 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
ll modPow(ll x, ll a) {
if (a == 1)
return x;
if (a % 2)
return (x * modPow(x, a - 1... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
#define ld long double
#define ll long long
#define MOD 1000000007
#define IINF INT_MAX
#define INF 1LL << 30
ll modPow(ll x, ll a) {
if (a == 1)
return x;
if (a % 2)
return (x * modPow(x, a - 1... | [
"expression.operation.binary.add"
] | 797,438 | 797,439 | u651235280 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const ll MOD = 1e9 + 7;
// 繰り返し二乗法
ll modPow(ll x, ll a) {
if (a == 1)
return x;
// 指数aが奇数の時はx*x^(a-1)
if (a % 2)
return (x * modPow(x, a - 1)) % MOD;
// 指数aが偶数の時はx^(a/... | #include <bits/stdc++.h>
using namespace std;
#define ALL(v) v.begin(), v.end()
#define V vector
#define P pair
typedef long long ll;
const ll MOD = 1e9 + 7;
// 繰り返し二乗法
ll modPow(ll x, ll a) {
if (a == 1)
return x;
// 指数aが奇数の時はx*x^(a-1)
if (a % 2)
return (x * modPow(x, a - 1)) % MOD;
// 指数aが偶数の時はx^(a/... | [
"expression.operation.binary.add"
] | 797,440 | 797,441 | u651235280 | cpp |
p02990 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
#define rep(i, n) for (int i = 0; i < (n); ++... | [
"identifier.change",
"call.function.change",
"io.output.change"
] | 797,447 | 797,448 | u596311864 | 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;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
const int mod = 1e9 + 7;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
... | #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;
typedef pair<int, int> P;
const ll INF = 1LL << 60;
const int mod = 1e9 + 7;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
... | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 797,451 | 797,452 | u455366471 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll RepeatSquaring(ll N, ll P, ll M) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RepeatSquaring(N, P / 2, M);
return t * t % M;
}
return N * RepeatSquar... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll mod = 1000000007;
ll RepeatSquaring(ll N, ll P, ll M) {
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RepeatSquaring(N, P / 2, M);
return t * t % M;
}
return N * RepeatSquar... | [
"expression.operation.binary.add"
] | 797,465 | 797,466 | u859566721 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <stack>
#include <stdio.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<int, int... | [
"expression.operation.binary.add"
] | 797,476 | 797,477 | u265187423 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 100000... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (long long i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 100000... | [
"literal.number.change",
"variable_declaration.value.change"
] | 797,478 | 797,479 | u863279562 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
#define sz(x) ((int)(x).size())
using ll = long long;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define MOD 1000000007
c... | [
"expression.operation.binary.add"
] | 797,480 | 797,481 | u863279562 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define repr(i, N) for (ll i = N - 1; i >= 0; i--)
#define repr1(i, N) for (ll i = N; i > 0; i--)
#define MOD 1000000007
using ll = long long;
using namespace std;
typedef pair<int, int> P;
typedef v... | #include <bits/stdc++.h>
#define rep(i, N) for (ll i = 0; i < N; i++)
#define rep1(i, N) for (ll i = 1; i <= N; i++)
#define repr(i, N) for (ll i = N - 1; i >= 0; i--)
#define repr1(i, N) for (ll i = N; i > 0; i--)
#define MOD 1000000007
using ll = long long;
using namespace std;
typedef pair<int, int> P;
typedef v... | [
"assignment.add"
] | 797,489 | 797,490 | u099619676 | cpp |
p02990 | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll modpow(ll a, ll n) {
if (n == 0)
return 1;
else if (n == 1)
return a;
else if (n % 2)
return a * modpow(a * a % mod,... | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll modpow(ll a, ll n) {
if (n == 0)
return 1;
else if (n == 1)
return a;
else if (n % 2)
return a * modpow(a * a % mod,... | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 797,491 | 797,492 | u930561195 | cpp |
p02990 | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#de... | #include <algorithm>
#include <climits>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (int)n; ++i)
#de... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 797,493 | 797,494 | u491256431 | cpp |
p02990 | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
using namespace std;
// 5 3
const int MAX = 2010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void initComb() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for... | #include <bits/stdc++.h>
#include <iostream>
//#include <algorithm>
// #include <iomanip>
#define ll long long
using namespace std;
// 5 3
const int MAX = 2010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void initComb() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for... | [
"expression.operation.binary.add"
] | 797,497 | 797,498 | u006576567 | cpp |
p02990 | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | #include <iostream>
#include <stdio.h>
//#include <bits/stdc++.h>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cmath>
#include <cstdint>
#include <cstring>
#include <float.h>
#include <iomanip>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#i... | [
"control_flow.branch.if.condition.change",
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 797,510 | 797,509 | u516525290 | cpp |
p02990 | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const long long MAX = 10000000;
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 (long long i = 2; i < MAX; i++) {
... | #include <cmath>
#include <iostream>
#include <vector>
using namespace std;
const long long MAX = 10000000;
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 (long long i = 2; i < MAX; i++) {
... | [
"expression.operation.binary.add"
] | 797,527 | 797,528 | u855866205 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (1000000007)
int arr[2010][2010] = {};
ll comb(ll n, ll r) {
if (n < 0 || r < 0)
cout << n << "," << r << endl;
if (arr[n][r] != 0)
return arr[n][r];
else if (r == 0) {
arr[n][r] = 1;
return arr[n][r];
} else if (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD (1000000007)
int arr[2010][2010] = {};
ll comb(ll n, ll r) {
if (n < 0 || r < 0)
cout << n << "," << r << endl;
if (arr[n][r] != 0)
return arr[n][r];
else if (r == 0) {
arr[n][r] = 1;
return arr[n][r];
} else if (... | [
"literal.number.change",
"io.output.change"
] | 797,541 | 797,542 | u218759384 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
templa... | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
using P = pair<ll, ll>;
templa... | [
"expression.operation.binary.add"
] | 797,545 | 797,546 | u952081880 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
te... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (n); i++)
#define REP2(i, x, n) for (int i = x; i < (n); i++)
#define ALL(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
te... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 797,551 | 797,552 | u151005508 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll C[2010][2010];
ll mod = 1e9 + 7;
void init() {
C[0][0] = 1;
C[1][0] = 1;
C[1][1] = 1;
for (int i = 2; i < 2010; ++i) {
C[i][0] = 1;
for (int j = 1; j < 2010; ++j) {
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
}
}
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll C[2010][2010];
ll mod = 1e9 + 7;
void init() {
C[0][0] = 1;
C[1][0] = 1;
C[1][1] = 1;
for (int i = 2; i < 2010; ++i) {
C[i][0] = 1;
for (int j = 1; j < 2010; ++j) {
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % mod;
}
}
}
... | [
"assignment.change"
] | 797,553 | 797,554 | u808092084 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"misc.opposites",
"expression.operator.arithmetic.change",
"io.output.change"
] | 797,562 | 797,563 | u809967037 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#incl... | [
"expression.operation.binary.remove"
] | 797,564 | 797,563 | u809967037 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll>;
#define all(v) v.begin(), v.end()
#define MAX 2020
const ll MOD = 1e9 + 7;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using vll = vector<ll>;
#define all(v) v.begin(), v.end()
#define MAX 2020
const ll MOD = 1e9 + 7;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[... | [
"expression.operation.binary.add"
] | 797,567 | 797,568 | u883725898 | cpp |
p02990 |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
... |
// include
//------------------------------------------
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
... | [
"literal.number.change",
"function.return_value.change"
] | 797,576 | 797,577 | u259053514 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
struct Combination {
vector<long long> inv, finv, fac;
Combination(int n, int kmax) : inv(kmax + 1), finv(kmax + 1), fac(kmax) {
if (kmax >= 1) {
inv.at(1) = 1;
finv.at(1) = 1;
fac.at(0) = n;
}
... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
struct Combination {
vector<long long> inv, finv, fac;
Combination(int n, int kmax) : inv(kmax + 1), finv(kmax + 1), fac(kmax) {
if (kmax >= 1) {
inv.at(1) = 1;
finv.at(1) = 1;
fac.at(0) = n;
}
... | [] | 797,578 | 797,579 | u168860135 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
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;
}
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
... | #include <bits/stdc++.h>
using namespace std;
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;
}
using ll = long long;
const int dx[4] = {1, 0, -1, 0};
... | [
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 797,584 | 797,585 | u787139585 | cpp |
p02990 | /**
* author: rishabh_sethi
**/
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mem(x, val) memset(x, val, sizeof(x))
#define mk make_pair
#define f(i, n) for (i = 0; i < n; i++)
#define f1(i, n) for (i = 1; i <= n; i++)
#define all(a) a.begin(), a.end()
#define upp(v, val) upper_bound(... | /**
* author: rishabh_sethi
**/
#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define mem(x, val) memset(x, val, sizeof(x))
#define mk make_pair
#define f(i, n) for (i = 0; i < n; i++)
#define f1(i, n) for (i = 1; i <= n; i++)
#define all(a) a.begin(), a.end()
#define upp(v, val) upper_bound(... | [
"expression.operation.binary.add"
] | 797,592 | 797,593 | u097326875 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef unordered_set<int> si;
typedef pair<int, int> pp;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#define ... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vector<int>> vvi;
typedef vector<string> vs;
typedef unordered_set<int> si;
typedef pair<int, int> pp;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#define ... | [
"literal.number.change",
"function.return_value.change"
] | 797,594 | 797,595 | u825443083 | 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;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
struct Combination {
vector<vector<int>> memo;
Combination(int x) {
memo.resize(x + 1);
for (int i = 0; i <= x; i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
struct Combination {
vector<vector<ll>> memo;
Combination(int x) {
memo.resize(x + 1);
for (int i = 0; i <= x; i+... | [
"variable_declaration.type.change"
] | 797,602 | 797,603 | u893239355 | 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;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
struct Combination {
vector<vector<int>> memo;
Combination(int x) {
memo.resize(x + 1);
for (int i = 0; i <= x; i... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
struct Combination {
vector<vector<ll>> memo;
Combination(int x) {
memo.resize(x + 1);
for (int i = 0; i <= x; i+... | [
"variable_declaration.type.change"
] | 797,604 | 797,603 | u893239355 | cpp |
p02990 | #include <bits/stdc++.h>
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(), a.end()
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
ll C[2010][2010];
int main() {
memset(C, 0, sizeof C);
rep(i, 2010) {
for (int j = 0;... | #include <bits/stdc++.h>
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rng(a) a.begin(), a.end()
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
ll C[2010][2010];
int main() {
memset(C, 0, sizeof C);
rep(i, 2010) {
for (int j = 0;... | [
"expression.operation.binary.add"
] | 797,609 | 797,610 | u641900703 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 100000... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 100000... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 797,611 | 797,612 | u005006157 | cpp |
p02990 | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(), a.end()
#define lb lower_bound
#define ub upper_bound
#define owo \
io... | #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) a.size()
#define all(a) a.begin(), a.end()
#define lb lower_bound
#define ub upper_bound
#define owo \
io... | [
"preprocessor.define.value.change",
"literal.float.change"
] | 797,615 | 797,616 | u300665398 | 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 inf = 1001001001;
int modpow(ll a, ll n, ll p) {
if (n == 0)
return 1;
if (n == 1)
return a % p;
if (n % 2 == 1)
return (a * modpow(a, n - 1, p)) %... | #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 inf = 1001001001;
int modpow(ll a, ll n, ll p) {
if (n == 0)
return 1;
if (n == 1)
return a % p;
if (n % 2 == 1)
return (a * modpow(a, n - 1, p)) %... | [
"assignment.add"
] | 797,617 | 797,618 | u886613668 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#defin... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vec = vector<ll>;
using mat = vector<vec>;
#define INF (1LL << 60)
#define MOD 1000000007
#define PI 3.14159265358979323846
#define REP(i, m, n) for (ll(i) = (m), (i_len) = (n); (i) < (i_len); ++(i))
#define FORR(i, v) for (auto(i) : v)
#defin... | [
"call.arguments.change",
"call.arguments.add"
] | 797,619 | 797,620 | u768347697 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
long long moder = 1000000007;
long long fac[5005] = {1};
long long multi(long long a, long long b) {
if (b == 0)
return 0;
if (b == 1)
return a;
long long ret = multi(a, b / 2);
ret *= ret;
ret %= moder;
if (b % 2)
ret *= a;
return ret % moder;
}
l... | #include <bits/stdc++.h>
using namespace std;
long long moder = 1000000007;
long long fac[5005] = {1};
long long multi(long long a, long long b) {
if (b == 0)
return 0;
if (b == 1)
return a;
long long ret = multi(a, b / 2);
ret *= ret;
ret %= moder;
if (b % 2)
ret *= a;
return ret % moder;
}
l... | [
"expression.operation.binary.add"
] | 797,621 | 797,622 | u371958417 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
/// Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout << #var << " " << var << endl;
#define co(q) cout << q << endl;
#define all(q) (q).begin(), (q).end()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ... | #include <bits/stdc++.h>
using namespace std;
/// Welcome to Nasif's Code
#define bug printf("bug\n");
#define bug2(var) cout << #var << " " << var << endl;
#define co(q) cout << q << endl;
#define all(q) (q).begin(), (q).end()
#define pi acos(-1)
#define inf 1000000000000000LL
#define FastRead ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change",
"call.arguments.change",
"variable_declaration.value.change",
"cont... | 797,625 | 797,624 | u642657797 | cpp |
p02990 | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
#define irep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define irrep(i, n) for (int i = (int)(n - 1); i > -1; i--)
#define irrep2(i, n, a) for (int i = (int)(... | #include <bits/stdc++.h>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
#define irep(i, n) for (int i = 0; i < (int)(n); i++)
#define irep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define irrep(i, n) for (int i = (int)(n - 1); i > -1; i--)
#define irrep2(i, n, a) for (int i = (int)(... | [
"expression.operation.binary.add"
] | 797,626 | 797,627 | u829260400 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
const ll MOD = ... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
#define all(x) x.begin(), x.end()
#define rep(i, j, n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
const ll MOD = ... | [
"identifier.replace.remove",
"literal.replace.add",
"control_flow.branch.if.condition.change"
] | 797,631 | 797,632 | u164181205 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
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;
typedef long long ll;
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 % ... | [
"call.add"
] | 797,633 | 797,634 | u109191542 | cpp |
p02990 | #include <bits/stdc++.h>
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define int long... | #include <bits/stdc++.h>
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
#define int long... | [
"literal.number.change",
"function.return_value.change"
] | 797,637 | 797,638 | u432498296 | 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 rep_r(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define resize(x, n) x.resize(n)
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
const ll INF = 1... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rep_r(i, n) for (ll i = n - 1; i >= 0; i--)
#define all(x) x.begin(), x.end()
#define resize(x, n) x.resize(n)
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
const ll INF = 1... | [
"assignment.change"
] | 797,643 | 797,644 | u915582296 | cpp |
p02990 |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1e18;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
con... |
#include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const ll INF = 1e18;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
con... | [
"expression.operation.binary.remove"
] | 797,647 | 797,648 | u289381123 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
string char_to_string(char val) { return string(1, val); }
int char_to_int(char val) { return val - '0'; }
template <class T> inline bool chmin(T ... | [
"assignment.add"
] | 797,653 | 797,654 | u308463793 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e16 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int fac[2500], finv[2500], inv[2500];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2... | #include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int, int> P;
int INF = 1e16 + 7;
int mod = 1e9 + 7;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
int fac[2500], finv[2500], inv[2500];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2... | [
"expression.operation.binary.add"
] | 797,666 | 797,667 | u237390401 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.