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 <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define BIT(n) (1LL << (n))
#define INF 2e9
#d... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define BIT(n) (1LL << (n))
#define INF 2e9
#d... | [
"variable_declaration.type.change"
] | 798,552 | 798,553 | u468262978 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define BIT(n) (1LL << (n))
#define INF 2e9
#d... | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPS(i, x) for (int i = 1; i <= (int)(x); i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define FORS(i, m, n) for (int i = m; i <= n; i++)
#define BIT(n) (1LL << (n))
#define INF 2e9
#d... | [
"preprocessor.define.value.change",
"literal.integer.change"
] | 798,554 | 798,553 | u468262978 | cpp |
p02990 | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1 << 30
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define RREP(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll>... | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1 << 30
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define RREP(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll>... | [
"literal.number.change",
"variable_declaration.array_dimensions.change"
] | 798,568 | 798,569 | u242679311 | cpp |
p02990 | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1 << 30
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define RREP(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll>... | #include <bits/stdc++.h>
#define MOD 1000000007
#define INF 1 << 30
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define REP(i, a, b) for (ll i = (a); i < (b); i++)
#define RREP(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef vector<ll>... | [
"assignment.change"
] | 798,570 | 798,569 | u242679311 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
vector<ll> fac(300001); // n!(mod M)
vector<ll> ifac(300001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n !=... | #include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
vector<ll> fac(300001); // n!(mod M)
vector<ll> ifac(300001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n !=... | [
"assignment.change"
] | 798,576 | 798,577 | u332253305 | cpp |
p02990 | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace... | #include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <cstdlib>
#include <math.h>
#include <queue>
#include <string>
#include <vector>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define debug(x) cerr << #x << ": " << x << '\n'
using namespace... | [
"expression.operation.binary.add"
] | 798,585 | 798,586 | u311671153 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
long long c[2010][2010] = {}, mod = 1e9 + 7;
void init() {
for (int i = 0; i < 2005; i++) {
c[i][0] = 1;
for (int j = 1; j < i + 1; j++) {
c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
}
}
}
int main() {
init();
int n, k;
cin >> n >> k;
for (int ... | #include <bits/stdc++.h>
using namespace std;
long long c[2010][2010] = {}, mod = 1e9 + 7;
void init() {
for (int i = 0; i < 2005; i++) {
c[i][0] = 1;
for (int j = 1; j < i + 1; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
}
}
int main() {
init();
int n, k;
cin >> n >> k;
f... | [
"assignment.change"
] | 798,595 | 798,596 | u164474813 | cpp |
p02990 | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
vector<vector<long long>> comb(int n, int r) {
std::vector<std::vector<long long>> v(n + 1,
std::vector<long long>(n + 1, 0));
for (int i = 0; i < v.siz... | #include <algorithm>
#include <iostream>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
vector<vector<long long>> comb(int n, int r) {
std::vector<std::vector<long long>> v(n + 1,
std::vector<long long>(n + 1, 0));
for (int i = 0; i < v.siz... | [
"assignment.change"
] | 798,597 | 798,598 | u683667335 | cpp |
p02990 | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
// const int mod = 103;
vector<long long> factorial;
long long mod_pow(long long a, long long p) {
vector<long long> vals = {a};
vector<long long> pow2s... | #include <algorithm>
#include <cstdio>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
const int mod = 1e9 + 7;
vector<long long> factorial;
long long mod_pow(long long a, long long p) {
vector<long long> vals = {a};
vector<long long> pow2s = {1};
while (pow2s.... | [
"literal.number.change",
"call.arguments.change",
"expression.operator.compare.change",
"control_flow.loop.for.condition.change",
"expression.off_by_one",
"expression.operation.binary.change"
] | 798,599 | 798,600 | u590241855 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
#define rep1(i, n) for (int i = 1; i <= int(n); ++i)
class modint {
public:
using ll = long long;
ll num;
static const ll MOD = 1e9 + 7;
static vector<mod... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); ++i)
#define all(a) (a).begin(), (a).end()
typedef long long ll;
#define rep1(i, n) for (int i = 1; i <= int(n); ++i)
class modint {
public:
using ll = long long;
ll num;
static const ll MOD = 1e9 + 7;
static vector<mod... | [
"expression.operation.binary.add"
] | 798,601 | 798,602 | u241615199 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, n, a) for (int i = (n); i >= (a); i--)
#define REPR(i, n) FOR(i, n, 0)
#define ALL(o) (o).begin(), (o).end()
template <class T> using V = vector<T>;... | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define FOR(i, a, n) for (int i = (a); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, n, a) for (int i = (n); i >= (a); i--)
#define REPR(i, n) FOR(i, n, 0)
#define ALL(o) (o).begin(), (o).end()
template <class T> using V = vector<T>;... | [] | 798,606 | 798,607 | u116518875 | cpp |
p02990 | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
typedef long long ll;
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... | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
typedef long long ll;
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... | [
"expression.operation.binary.add"
] | 798,608 | 798,609 | u141938981 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int N = 2007, mod = 1e9 + 7;
int c[N][N];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
for (int i = 0; i <= n + 1; ++i) {
c[i][0] = 1;
for (int j = 1; j <= i; ++j)
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % m... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2007, mod = 1e9 + 7;
ll c[N][N];
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int n, k;
cin >> n >> k;
for (int i = 0; i <= n + 1; ++i) {
c[i][0] = 1;
for (int j = 1; j <= i; ++j)
c[i][j] = (c[i - 1][j] +... | [
"variable_declaration.type.change"
] | 798,610 | 798,611 | u310673702 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <util... | [
"expression.operation.binary.add"
] | 798,621 | 798,622 | u261965335 | cpp |
p02990 | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// const int INF = (1 << 30) - 1;
// const ll LL_INF = (1LL... | #include <algorithm>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
// const int INF = (1 << 30) - 1;
// const ll LL_INF = (1LL... | [
"identifier.change",
"call.function.change",
"expression.operation.binary.change"
] | 798,623 | 798,624 | u751964641 | cpp |
p02990 | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; 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 = max(x, y))
#define mins(x, y) (x = min(x, y))
#defin... | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; 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 = max(x, y))
#define mins(x, y) (x = min(x, y))
#defin... | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"call.arguments.add"
] | 798,625 | 798,626 | u340293807 | cpp |
p02990 | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
tem... | #include <algorithm>
#include <bits/stdc++.h>
#include <cstdlib>
#include <iostream>
#include <math.h>
#include <string>
#include <vector>
using namespace std;
template <class T> using V = vector<T>;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
tem... | [] | 798,631 | 798,632 | u835924161 | cpp |
p02990 | #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
const uint32_t MOD = 1000000007;
uint32_t COMB[2005][2005] = {0};
void comb_init(uint32_t N) {
for (int n = 1; n <= N; ++n) {
for (int r = 0; r <= N; ++r) {
if (n == r || r == 0)
COMB[n][r] = 1;
else
CO... | #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
const uint32_t MOD = 1000000007;
uint32_t COMB[2005][2005] = {1};
void comb_init(uint32_t N) {
for (int n = 1; n <= N; ++n) {
for (int r = 0; r <= N; ++r) {
if (n == r || r == 0)
COMB[n][r] = 1;
else
CO... | [
"literal.number.change"
] | 798,633 | 798,634 | u843070415 | cpp |
p02990 | #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
const uint32_t MOD = 1000000007;
uint32_t COMB[2005][2005] = {0};
// uint32_t comb(uint32_t n, uint32_t r)
// {
// if (COMB[n][r] != 0)
// return COMB[n][r];
// cerr << n << ' ' << r << endl;
// cerr << COMB[n][r] << endl;
// ... | #include <iostream>
#include <stdint.h>
#include <utility>
using namespace std;
const uint32_t MOD = 1000000007;
uint32_t COMB[2005][2005] = {1};
void comb_init(uint32_t N) {
for (int n = 1; n <= N; ++n) {
for (int r = 0; r <= N; ++r) {
if (n == r || r == 0)
COMB[n][r] = 1;
else
CO... | [
"literal.number.change"
] | 798,636 | 798,634 | u843070415 | cpp |
p02990 | #include <iostream>
using namespace std;
const int MAX = 2001;
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] * (MO... | #include <iostream>
using namespace std;
const int MAX = 2001;
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] * (MO... | [
"expression.operation.binary.add"
] | 798,644 | 798,645 | u810075828 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef std::pair<int, int> P;
typedef long long int ll;
using namespace std;
const int MOD = 1e9 + 7;
int c[4005][4005];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 2000; i++) {
for (int j = 0; j <= i; j++) {
c[i + 1][j] = (... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef std::pair<int, int> P;
typedef long long int ll;
using namespace std;
const int MOD = 1e9 + 7;
ll c[4005][4005];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 2000; i++) {
for (int j = 0; j <= i; j++) {
c[i + 1][j] = (c... | [
"variable_declaration.type.change"
] | 798,646 | 798,647 | u221067205 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef std::pair<int, int> P;
typedef long long int ll;
using namespace std;
const ll MOD = 1e9 + 7;
int c[4005][4005];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 2000; i++) {
for (int j = 0; j <= i; j++) {
c[i + 1][j] = (c... | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef std::pair<int, int> P;
typedef long long int ll;
using namespace std;
const int MOD = 1e9 + 7;
ll c[4005][4005];
void init() {
c[0][0] = 1;
for (int i = 0; i <= 2000; i++) {
for (int j = 0; j <= i; j++) {
c[i + 1][j] = (c... | [
"variable_declaration.type.change"
] | 798,648 | 798,647 | u221067205 | cpp |
p02990 | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
ll M = 1000000007;
std::vector<ll> fac(510000, 1), finv(510000, 1), inv(510000, 1);
void c4_init(ll m) {
// fac[0] = fac[1] = 1;
// finv[0] =... | #include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (a); i < (b); i++)
typedef uint64_t ull;
typedef int64_t ll;
typedef std::pair<ll, ll> PLL;
using namespace std;
ll M = 1000000007;
std::vector<ll> fac(510000, 1), finv(510000, 1), inv(510000, 1);
void c4_init(ll m) {
// fac[0] = fac[1] = 1;
// finv[0] =... | [
"expression.operation.binary.add"
] | 798,649 | 798,650 | u702996070 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define SORT(x) sort(x.begin(), x.end())
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
vector<vector<ll>> com(2010, vect... | #include <bits/stdc++.h>
using namespace std;
#define SORT(x) sort(x.begin(), x.end())
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < n; i++)
#define INF 1000000000
#define mod 1000000007
typedef long long ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
vector<vector<ll>> com(2010, vect... | [
"expression.operation.binary.add"
] | 798,657 | 798,658 | u022832318 | cpp |
p02990 | #include <bits/stdc++.h>
#define REV(v) reverse(v.begin(), v.end());
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, start, stop) for (int i = start; i < stop; i++)
#define FORR(i, start, stop) for (int i = start; i > stop; i--)
#define SORT(v, n) sort(v, v +... | #include <bits/stdc++.h>
#define REV(v) reverse(v.begin(), v.end());
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, start, stop) for (int i = start; i < stop; i++)
#define FORR(i, start, stop) for (int i = start; i > stop; i--)
#define SORT(v, n) sort(v, v +... | [
"expression.operation.binary.add"
] | 798,659 | 798,660 | u908349502 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int N = 2002, mod = 1e9 + 7;
int c[N][N];
int main() {
int n, k;
int i, j;
cin >> n >> k;
for (i = 0; i <= n + 1; i++) {
c[i][0] = 1;
for (j = 1; j <= i; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
}
for (i = 1; i <= k; ... | #include <bits/stdc++.h>
using namespace std;
const int N = 2002, mod = 1e9 + 7;
int c[N][N];
int main() {
int n, k;
int i, j;
cin >> n >> k;
for (i = 0; i <= n + 1; i++) {
c[i][0] = 1;
for (j = 1; j <= i; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
}
}
for (i = 1; i <= k; ... | [
"assignment.change"
] | 798,665 | 798,666 | u127768253 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll ... | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll ... | [
"expression.operation.binary.add"
] | 798,680 | 798,681 | u398942100 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll ... | #include <bits/stdc++.h>
using namespace std;
/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/
// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll ... | [
"literal.number.change",
"variable_declaration.value.change"
] | 798,682 | 798,681 | u398942100 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
long long c[2001][2001];
int main() {
long DIV = 1e9 + 7;
int n, k;
cin >> n >> k;
int Nmax = max(n - k + 1, k - 1);
for (int i = 0; i <= ... | #include <algorithm>
#include <cmath>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
long long c[2001][2001];
int main() {
long DIV = 1e9 + 7;
int n, k;
cin >> n >> k;
int Nmax = max(n - k + 1, k - 1);
for (int i = 0; i <= ... | [
"literal.number.change",
"io.output.change"
] | 798,685 | 798,686 | u947304300 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M (1000000007)
#define N (2010)
// int n,k,dp[N][N][2];
// int main(){
// scanf("%d%d",&n,&k);
// dp[0][0][0]=1;
// for (int i=1;i<=n;i++){//放i个球
// for (int j=min(i,k);j>=max(1,(i-(n-k)));j--){//放j个B
// for (int k=j;k>=1;k--){//k次
// dp[... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M (1000000007)
#define N (2010)
// int n,k,dp[N][N][2];
// int main(){
// scanf("%d%d",&n,&k);
// dp[0][0][0]=1;
// for (int i=1;i<=n;i++){//放i个球
// for (int j=min(i,k);j>=max(1,(i-(n-k)));j--){//放j个B
// for (int k=j;k>=1;k--){//k次
// dp[... | [] | 798,687 | 798,688 | u548390458 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M (1000000007)
#define N (2010)
// int n,k,dp[N][N][2];
// int main(){
// scanf("%d%d",&n,&k);
// dp[0][0][0]=1;
// for (int i=1;i<=n;i++){//放i个球
// for (int j=min(i,k);j>=max(1,(i-(n-k)));j--){//放j个B
// for (int k=j;k>=1;k--){//k次
// dp[... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M (1000000007)
#define N (2010)
// int n,k,dp[N][N][2];
// int main(){
// scanf("%d%d",&n,&k);
// dp[0][0][0]=1;
// for (int i=1;i<=n;i++){//放i个球
// for (int j=min(i,k);j>=max(1,(i-(n-k)));j--){//放j个B
// for (int k=j;k>=1;k--){//k次
// dp[... | [
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change"
] | 798,689 | 798,688 | u548390458 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M (1000000007)
#define N (2010)
// int n,k,dp[N][N][2];
// int main(){
// scanf("%d%d",&n,&k);
// dp[0][0][0]=1;
// for (int i=1;i<=n;i++){//放i个球
// for (int j=min(i,k);j>=max(1,(i-(n-k)));j--){//放j个B
// for (int k=j;k>=1;k--){//k次
// dp[... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define M (1000000007)
#define N (2010)
// int n,k,dp[N][N][2];
// int main(){
// scanf("%d%d",&n,&k);
// dp[0][0][0]=1;
// for (int i=1;i<=n;i++){//放i个球
// for (int j=min(i,k);j>=max(1,(i-(n-k)));j--){//放j个B
// for (int k=j;k>=1;k--){//k次
// dp[... | [
"assignment.value.change",
"expression.operation.binary.change",
"assignment.change",
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 798,690 | 798,688 | u548390458 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const ll MOD = 1000000007;
ll f[101010];
void factInit() {
f[0] = 1;
for (ll i = 1; i < 101010; i++)
f[i] = (f[i - 1] * i) % MOD;
}
ll inv(ll x) {
ll res = 1;
ll k = MOD - 2;
ll y = x;
while (k) {
if (k & 1)
res = (re... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
static const ll MOD = 1000000007;
ll f[101010];
void factInit() {
f[0] = 1;
for (ll i = 1; i < 101010; i++)
f[i] = (f[i - 1] * i) % MOD;
}
ll inv(ll x) {
ll res = 1;
ll k = MOD - 2;
ll y = x;
while (k) {
if (k & 1)
res = (re... | [
"literal.number.change",
"function.return_value.change"
] | 798,703 | 798,704 | u881599732 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = ll(a); i < ll(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define inf (ll)1e9
#define mod (ll)(1e9 + 7)
#... | [
"assignment.change"
] | 798,709 | 798,710 | u001566280 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll m = pow(10, 9) + 7;
vector<ll> fac(2001);
vector<ll> ifac(2001);
ll mpow(ll a, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * a % m;
a = a * a % m;
n = n >> 1;
}
return ans;
}
void COMinit() {
fac[0]... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll m = pow(10, 9) + 7;
vector<ll> fac(2001);
vector<ll> ifac(2001);
ll mpow(ll a, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * a % m;
a = a * a % m;
n = n >> 1;
}
return ans;
}
void COMinit() {
fac[0]... | [
"misc.opposites",
"control_flow.branch.if.condition.change"
] | 798,711 | 798,712 | u255172538 | cpp |
p02990 | #include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#... | #include <iostream>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#... | [
"identifier.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 798,717 | 798,718 | u338903636 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int inv[5005];
int fac[5005];
int facinv[5005];
int mod = 1e9 + 7;
int f, t;
int main() {
int n, k;
cin >> n >> k;
inv[0] = 1;
inv[1] = 1;
for (int i = 2; i <= 5005; ++i) {
inv[i] = (mod - mod / i) * 1LL * inv[mod % i] % mod;
}
fac[1] = 0;
fac[1] = 1;... | #include <bits/stdc++.h>
using namespace std;
int inv[5005];
int fac[5005];
int facinv[5005];
int mod = 1e9 + 7;
int f, t;
int main() {
int n, k;
cin >> n >> k;
inv[0] = 1;
inv[1] = 1;
for (int i = 2; i <= 5005; ++i) {
inv[i] = (mod - mod / i) * 1LL * inv[mod % i] % mod;
}
fac[0] = 1;
fac[1] = 1;... | [
"literal.number.change",
"assignment.variable.change",
"variable_access.subscript.index.change",
"assignment.value.change"
] | 798,721 | 798,722 | u542111796 | cpp |
p02990 | #include <iostream>
using namespace std;
#define MOD 1000000007
long long C[2005][2005] = {};
void ncr() {
for (int i = 0; i <= 2000; ++i)
C[i][0] = C[i][i] = 1, C[i][1] = i;
for (int i = 1; i <= 2000; ++i) {
for (int j = 2; j < i; ++j) {
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
}
}
}... | #include <iostream>
using namespace std;
#define MOD 1000000007
long long C[2005][2005] = {};
void ncr() {
for (int i = 0; i <= 2000; ++i)
C[i][0] = C[i][i] = 1, C[i][1] = i;
for (int i = 1; i <= 2000; ++i) {
for (int j = 2; j < i; ++j) {
C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % MOD;
}
}
}... | [
"expression.operation.binary.add"
] | 798,725 | 798,726 | u848359007 | cpp |
p02990 | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007ll
long long inv(long long n) {
long long ans = 1;
while (n > 1) {
ans *= (mod - mod / n) % mod;
... | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <iomanip>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007ll
long long inv(long long n) {
long long ans = 1;
while (n > 1) {
ans *= (mod - mod / n) % mod;
... | [
"expression.operation.binary.change",
"assignment.change"
] | 798,740 | 798,741 | u324549724 | cpp |
p02990 | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// See debug.cc for usage etc
#define DEBUG 0
template <class... Args> string dbgFormat(const char *fmt, Args... args) {
size_t len = snprintf(nullptr, 0, fmt, args...);
char buf[len + 1];
snprintf(buf, len + 1, fmt, args... | #include <bits/stdc++.h>
#include <cassert>
typedef long long int ll;
using namespace std;
// See debug.cc for usage etc
#define DEBUG 0
template <class... Args> string dbgFormat(const char *fmt, Args... args) {
size_t len = snprintf(nullptr, 0, fmt, args...);
char buf[len + 1];
snprintf(buf, len + 1, fmt, args... | [
"variable_declaration.type.change"
] | 798,742 | 798,743 | u588093355 | cpp |
p02990 | #include <iostream>
using namespace std;
const int MAX = 510000;
const int MOD = 1e9 + 7;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[M... | #include <iostream>
using namespace std;
const int MAX = 510000;
const int MOD = 1e9 + 7;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[M... | [
"expression.operation.binary.add"
] | 798,757 | 798,758 | u168774513 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long c[5005][5005];
void init(int n) {
c[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
c[i][j] %= MOD;
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
long long comb(long l... | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1000000007;
long long c[5005][5005];
void init(int n) {
c[0][0] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j <= i; j++) {
c[i][j] %= MOD;
c[i + 1][j] += c[i][j];
c[i + 1][j + 1] += c[i][j];
}
}
}
long long comb(long l... | [
"literal.number.change",
"call.arguments.change",
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change"
] | 798,761 | 798,762 | u507188501 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
// #define MOD 1000000007
typedef long long ll;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ... | #include <bits/stdc++.h>
using namespace std;
// #define MOD 1000000007
typedef long long ll;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ... | [
"literal.number.change",
"function.return_value.change"
] | 798,763 | 798,764 | u031598803 | cpp |
p02990 | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr int mo = 1e9 + 7;
constexpr int mod = mo;
constexpr ll inf = 1e15;
ll combi(ll N_, ll C_) {
const int NUM_ = 400001;
static ll fact[NUM_ + 1], factr[NUM_ + 1], inv[NUM_ + 1];
if (fact[0] == 0) {
... | #include <bits/stdc++.h>
#include <iomanip>
#include <numeric>
using namespace std;
using ll = long long;
constexpr int mo = 1e9 + 7;
constexpr int mod = mo;
constexpr ll inf = 1e15;
ll combi(ll N_, ll C_) {
const int NUM_ = 400001;
static ll fact[NUM_ + 1], factr[NUM_ + 1], inv[NUM_ + 1];
if (fact[0] == 0) {
... | [
"variable_declaration.type.change"
] | 798,765 | 798,766 | u699193595 | cpp |
p02990 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<vector<ll>> comb(2005, vector<ll>(2005));
for (ll i = 1; i < 2005; i++) {
for (ll j = 0; j <= i; j++) {
if (j == 0 || j ... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<vector<ll>> comb(2005, vector<ll>(2005));
for (ll i = 0; i < 2005; i++) {
for (ll j = 0; j <= i; j++) {
if (j == 0 || j ... | [
"literal.number.change",
"variable_declaration.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one"
] | 798,767 | 798,768 | u201316840 | cpp |
p02990 | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<vector<ll>> comb(2005, vector<ll>(2005));
comb[0][0] = 1;
for (ll i = 1; i < 6; i++) {
for (ll j = 0; j <= i; j++) {
i... | #include <bits/stdc++.h>
#define ll long long
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
using namespace std;
ll mod = 1e9 + 7;
int main() {
ll n, k;
cin >> n >> k;
vector<vector<ll>> comb(2005, vector<ll>(2005));
comb[0][0] = 1;
for (ll i = 1; i < 2005; i++) {
for (ll j = 0; j <= i; j++) {
... | [
"literal.number.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.change"
] | 798,769 | 798,770 | u201316840 | cpp |
p02990 | #include <iostream>
#include <vector>
using namespace std;
void comb(vector<vector<long long int>> &v) {
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]);
}
}
}
int ... | #include <iostream>
#include <vector>
using namespace std;
void comb(vector<vector<long long int>> &v) {
for (int i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (int k = 1; k < v.size(); k++) {
for (int j = 1; j < k; j++) {
v[k][j] = (v[k - 1][j - 1] + v[k - 1][j]) % 1000000007;
... | [
"assignment.change"
] | 798,777 | 798,778 | u196254124 | cpp |
p02990 | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
#include <list>
using namespace std;
#define REP(i, n) for (int... | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <type_traits>
#include <vector>
#include <list>
using namespace std;
#define REP(i, n) for (int... | [
"expression.operation.binary.add"
] | 798,788 | 798,789 | u636137609 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - ... | #include <algorithm>
#include <cmath>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <sstream>
#include <string>
#include <vector>
#define rep(i, n) for (ll i = 0; i < n; i++)
#define rrep(i, n) for (ll i = n - ... | [
"literal.number.change",
"assignment.value.change"
] | 798,790 | 798,791 | u991974907 | cpp |
p02990 | #include <bits/stdc++.h>
int main() {
using namespace std;
constexpr unsigned long MOD = 1000000007;
size_t n, k;
cin >> n >> k;
auto r = n - k;
vector<vector<unsigned long>> C(n, vector<unsigned long>(n));
C[0][0] = 1;
for (size_t i = 1; i < n; ++i) {
C[i][0] = 1;
for (size_t j = 1; j <= i; ++... | #include <bits/stdc++.h>
int main() {
using namespace std;
constexpr unsigned long MOD = 1000000007;
size_t n, k;
cin >> n >> k;
auto r = n - k;
vector<vector<unsigned long>> C(n + 10, vector<unsigned long>(n + 10));
C[0][0] = 1;
for (size_t i = 1; i < n + 10; ++i) {
C[i][0] = 1;
for (size_t j ... | [
"control_flow.loop.for.condition.change"
] | 798,794 | 798,795 | u462437857 | cpp |
p02990 | // temprates
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
... | // temprates
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <tuple>
#include <vector>
... | [
"expression.operation.binary.add"
] | 798,801 | 798,802 | u136354774 | cpp |
p02990 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [] | 798,803 | 798,804 | u236433947 | cpp |
p02990 | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define PB push_back
#define M... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 798,805 | 798,804 | u236433947 | cpp |
p02990 | //
// main.cpp
// 競技20190629
#include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <time.h>
#include <vector>
using namespace std;
#define ll long long int
const ll overflow = 1000000007;
int br() {
printf("\n");
return 0;
}
ll combi(int n, int k) {
if (n == k... | //
// main.cpp
// 競技20190629
#include <algorithm>
#include <cmath>
#include <iostream>
#include <math.h>
#include <stdio.h>
#include <time.h>
#include <vector>
using namespace std;
#define ll long long int
const ll overflow = 1000000007;
int br() {
printf("\n");
return 0;
}
ll combi(int n, int k) {
if (n == k... | [
"call.arguments.change"
] | 798,806 | 798,807 | u024416480 | cpp |
p02990 | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long int64;
int main(void) {
int64 N, K;
cin >> N >> K;
int64 facA = 1, facB = 1;
for (int64 i = 1; i <= N - K + 1; i++) {
facA *= i;
facA %= MOD;
... | #include <algorithm>
#include <iostream>
#include <tuple>
#include <utility>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long int64;
int main(void) {
int64 N, K;
cin >> N >> K;
int64 facA = 1, facB = 1;
for (int64 i = 1; i <= N - K + 1; i++) {
facA *= i;
facA %= MOD;
... | [] | 798,809 | 798,810 | u647569169 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
const ll LINF = 0x1fffffffffffffff;
const int... | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
const ll MOD = 1000000007;
const ll LINF = 0x1fffffffffffffff;
const int... | [
"expression.operation.binary.add"
] | 798,820 | 798,821 | u356489231 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begi... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begi... | [
"assignment.change"
] | 798,832 | 798,833 | u859765185 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begi... | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pf push_front
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define mp make_pair
#define fi first
#define se second
typedef pair<int, int> pint;
#define All(s) s.begi... | [
"literal.number.change",
"variable_declaration.value.change",
"expression.operation.binary.remove"
] | 798,834 | 798,833 | u859765185 | cpp |
p02990 | #include <bits/stdc++.h>
#define M 1000000007
using namespace std;
int A[2005][2005];
int main() {
int a, b, i, j, c;
long long w;
cin >> a >> b, c = a - b;
for (i = 1; i <= a; i++) {
A[i][0] = 1;
for (j = 1; j <= i; j++)
A[i][j] = (A[i - 1][j - 1] + A[i - 1][j]) % M;
}
for (i = 1; i <= b; i++... | #include <bits/stdc++.h>
#define M 1000000007
using namespace std;
int A[2005][2005];
int main() {
int a, b, i, j, c;
long long w;
cin >> a >> b, c = a - b;
for (i = 0; i <= a; i++) {
A[i][0] = 1;
for (j = 1; j <= i; j++)
A[i][j] = (A[i - 1][j - 1] + A[i - 1][j]) % M;
}
for (i = 1; i <= b; i++... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"control_flow.branch.if.condition.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 798,835 | 798,836 | u680068823 | cpp |
p02990 | #include <bits/stdc++.h>
#define M 1000000007
using namespace std;
int A[2005][2005];
int main() {
int a, b, i, j, c;
long long w;
cin >> a >> b, c = a - b;
for (i = 1; i <= a; i++) {
A[i][0] = 1;
for (j = 1; j <= i; j++)
A[i][j] = (A[i - 1][j - 1] + A[i - 1][j]) % M;
}
for (i = 1; i <= b; i++... | #include <bits/stdc++.h>
#define M 1000000007
using namespace std;
int A[2005][2005];
int main() {
int a, b, i, j, c;
long long w;
cin >> a >> b, c = a - b;
for (i = 0; i <= a; i++) {
A[i][0] = 1;
for (j = 1; j <= i; j++)
A[i][j] = (A[i - 1][j - 1] + A[i - 1][j]) % M;
}
for (i = 1; i <= b; i++... | [
"literal.number.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 798,837 | 798,836 | u680068823 | cpp |
p02990 | #include <bits/stdc++.h>
#define M 1000000007
using namespace std;
int A[2001][2001];
int main() {
int a, b, i, j, c;
long long w;
cin >> a >> b, c = a - b;
for (i = 1; i <= a; i++) {
A[i][0] = 1;
for (j = 1; j <= i; j++)
A[i][j] = (A[i - 1][j - 1] + A[i - 1][j]) % M;
}
for (i = 1; i <= b; i++... | #include <bits/stdc++.h>
#define M 1000000007
using namespace std;
int A[2005][2005];
int main() {
int a, b, i, j, c;
long long w;
cin >> a >> b, c = a - b;
for (i = 0; i <= a; i++) {
A[i][0] = 1;
for (j = 1; j <= i; j++)
A[i][j] = (A[i - 1][j - 1] + A[i - 1][j]) % M;
}
for (i = 1; i <= b; i++... | [
"literal.number.change",
"variable_declaration.array_dimensions.change",
"assignment.value.change",
"control_flow.loop.for.initializer.change",
"expression.off_by_one",
"variable_access.subscript.index.change",
"expression.operation.binary.change",
"assignment.change"
] | 798,838 | 798,836 | u680068823 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1000000007;
vector<ll> fac(20001); // n!(mod M)
vector<ll> ifac(20001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1000000007;
vector<ll> fac(20001); // n!(mod M)
vector<ll> ifac(20001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (... | [
"control_flow.branch.else_if.replace.add",
"control_flow.branch.if.replace.remove"
] | 798,841 | 798,842 | u280114218 | cpp |
p02990 | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long ll;
ll kai[3000], inv[3000];
int n, k;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
... | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <map>
#include <set>
#include <vector>
#define MOD 1000000007
using namespace std;
typedef long long ll;
ll kai[3000], inv[3000];
int n, k;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 798,848 | 798,849 | u855429581 | cpp |
p02990 | #include <iostream>
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 - in... | #include <iostream>
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 - in... | [
"expression.operation.binary.add"
] | 798,850 | 798,851 | u086355897 | cpp |
p02990 | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#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;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_o... | #pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse2")
#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;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_o... | [
"expression.operation.binary.add"
] | 798,860 | 798,861 | u240509821 | cpp |
p02990 | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define input(arr, n) ... | #include <bits/stdc++.h>
typedef long long int ll;
typedef long double ld;
#define sync \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define input(arr, n) ... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 798,863 | 798,864 | u181228520 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2005;
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 = 2005;
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.add"
] | 798,872 | 798,873 | u285409047 | cpp |
p02990 | #include <bits/stdc++.h>
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define f(i, a, b) for (int i = a; i ... | #include <bits/stdc++.h>
#define fast \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define f(i, a, b) for (int i = a; i ... | [
"assignment.change"
] | 798,880 | 798,881 | u708986486 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1000000007;
vector<long long> ki(2001);
vector<long long> kii(2001);
ki[0] = 1;
kii[0] = 1;
long long lll;
long long llc;
for (int i = 1; i <= 2000; i++) {
ki[i] = ki[i - 1] * i % mod;
lll = ki[i];
for (int j = 0; j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1000000007;
vector<long long> ki(2001);
vector<long long> kii(2001);
ki[0] = 1;
kii[0] = 1;
long long lll;
long long llc;
for (int i = 1; i <= 2000; i++) {
ki[i] = ki[i - 1] * i % mod;
lll = ki[i];
for (int j = 0; j ... | [] | 798,882 | 798,883 | u912534104 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1000000007;
vector<long long> ki(2001);
vector<long long> kii(2001);
ki[0] = 1;
kii[0] = 1;
long long lll;
long long llc;
for (int i = 1; i <= 2000; i++) {
ki[i] = ki[i - 1] * i % mod;
lll = ki[i];
for (int j = 0; j ... | #include <bits/stdc++.h>
using namespace std;
int main() {
long long mod = 1000000007;
vector<long long> ki(2001);
vector<long long> kii(2001);
ki[0] = 1;
kii[0] = 1;
long long lll;
long long llc;
for (int i = 1; i <= 2000; i++) {
ki[i] = ki[i - 1] * i % mod;
lll = ki[i];
for (int j = 0; j ... | [
"control_flow.break.remove",
"control_flow.continue.add"
] | 798,884 | 798,883 | u912534104 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int n, k;
long long ans, p[2010][2010];
long long combi(int a, int b) {
if ((b == 0) || (a == b)) {
return 1;
}
if (p[a][b] != 0) {
return p[a][b];
}
ans = combi(a - 1, b - 1) + combi(a - 1, b);
p[a][b] = ans;
return ans;
}
int main() {
cin >> n >... | #include <bits/stdc++.h>
using namespace std;
int n, k;
long long ans, p[2010][2010];
long long combi(int a, int b) {
if ((b == 0) || (a == b)) {
return 1;
}
if (p[a][b] != 0) {
return p[a][b];
}
ans = combi(a - 1, b - 1) + combi(a - 1, b);
ans %= 1000000007;
p[a][b] = ans;
return ans;
}
int ... | [
"assignment.add"
] | 798,898 | 798,899 | u576357314 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2100;
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 = 2100;
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] ... | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 798,904 | 798,905 | u953110527 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2100;
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 = 2100;
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] ... | [
"identifier.change",
"control_flow.branch.if.condition.change",
"expression.operation.binary.remove"
] | 798,906 | 798,905 | u953110527 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int n, a, b, c[2050][2050], d[2050][2050], M = 1e9 + 7;
void Init() {
for (int i = 1; i <= 2010; i++) {
c[i][0] = c[i][i] = 1;
for (int j = 1; j < i; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % M;
}
}
for (int i = 0; i <= 2010; i++)
d[0][i... | #include <bits/stdc++.h>
using namespace std;
int n, a, b, c[2050][2050], d[2050][2050], M = 1e9 + 7;
void Init() {
for (int i = 1; i <= 2010; i++) {
c[i][0] = c[i][i] = 1;
for (int j = 1; j < i; j++) {
c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % M;
}
}
for (int i = 0; i <= 2010; i++)
d[0][i... | [
"control_flow.branch.else_if.replace.remove",
"control_flow.branch.if.replace.add"
] | 798,923 | 798,924 | u316473009 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ch... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eee(a) (cerr << (#a) << ": " << (a) << endl);
using ll = long long;
using pint = pair<int, int>;
using pll = pair<ll, ll>;
using mint = map<int, int>;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
const ch... | [
"expression.operation.binary.add"
] | 798,928 | 798,929 | u306142032 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(A, H) for (int A = 0; A < H; A++)
#define RREP(A, B, H, W) \
for (int A = 0; A < H; A++) \
for (int B = 0; B < W; B++)
#define MAX(A, B) (A = std::max(A, B))
#define MIN(A, ... | #include <bits/stdc++.h>
#define REP(A, H) for (int A = 0; A < H; A++)
#define RREP(A, B, H, W) \
for (int A = 0; A < H; A++) \
for (int B = 0; B < W; B++)
#define MAX(A, B) (A = std::max(A, B))
#define MIN(A, ... | [
"control_flow.return.remove",
"control_flow.continue.add"
] | 798,930 | 798,931 | u218356514 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(A, H) for (int A = 0; A < H; A++)
#define RREP(A, B, H, W) \
for (int A = 0; A < H; A++) \
for (int B = 0; B < W; B++)
#define MAX(A, B) (A = std::max(A, B))
#define MIN(A, ... | #include <bits/stdc++.h>
#define REP(A, H) for (int A = 0; A < H; A++)
#define RREP(A, B, H, W) \
for (int A = 0; A < H; A++) \
for (int B = 0; B < W; B++)
#define MAX(A, B) (A = std::max(A, B))
#define MIN(A, ... | [] | 798,932 | 798,931 | u218356514 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
#de... | [
"literal.number.change",
"variable_declaration.value.change"
] | 798,933 | 798,934 | u282860133 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
#de... | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ld long double
#define forn(i, n) for (ll i = 0; i < (n); i++)
#define fori(i, b, e) for (ll i = (b); i < (e); i++)
#define forr(i, b, e) for (ll i = (b); i >= (e); i--)
#define allele(v) v.begin(), v.end()
#define fi first
#define se second
#de... | [] | 798,935 | 798,934 | u282860133 | cpp |
p02990 | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define mod 1000000007
... | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define mod 1000000007
... | [] | 798,942 | 798,943 | u121266738 | cpp |
p02990 | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define mod 1000000007
... | #include <bits/stdc++.h>
#define ll long long
#define dl double
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define F first
#define S second
#define endl "\n"
#define rep(i, a, b) for (i = a; i < b; i++)
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define mod 1000000007
... | [
"literal.number.change",
"call.arguments.change"
] | 798,944 | 798,943 | u121266738 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll lon... | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define ll lon... | [
"assignment.add"
] | 798,949 | 798,950 | u300650560 | cpp |
p02990 | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#defi... | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#defi... | [
"assignment.change"
] | 798,951 | 798,952 | u172873334 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline ll qpow(ll a, ll b, ll mod) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
const int mod = 1e9 + 7;
const int MAXN = 2e5 + 7;
ll fac[... | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
inline ll qpow(ll a, ll b, ll mod) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
const int mod = 1e9 + 7;
const int MAXN = 2e5 + 7;
ll fac[... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 798,958 | 798,959 | u613520453 | cpp |
p02990 | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int mod = 1e9 + 7;
// vector<vector<ll>> C(4000, vector<int> (4000,0));
ll C[4000][4000];
ll nCk(ll n, ll k) {
if (C[n][k] != 0)
return C[n][k];
if (n == k || k == 0)
return C[n][k] = 1;
else {
return C[n][k] = nCk(n - 1, k - 1) + n... | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int mod = 1e9 + 7;
// vector<vector<ll>> C(4000, vector<int> (4000,0));
ll C[4000][4000];
ll nCk(ll n, ll k) {
if (C[n][k] != 0)
return C[n][k];
if (n == k || k == 0)
return C[n][k] = 1;
else {
return C[n][k] = nCk(n - 1, k - 1) % m... | [
"assignment.change"
] | 798,964 | 798,965 | u534417782 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
vector<long long> fac;
vector<long long> ifac;
template <typename T> T modpow(T a, T n, T mod = MOD) { //(a^n)%MOD
T ret = 1;
while (n > 0) {
if ((n & 1) != 0) { // n%2==1
ret = ret * a % mod;
}
a = a * a % mod;
... | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
vector<long long> fac;
vector<long long> ifac;
template <typename T> T modpow(T a, T n, T mod = MOD) { //(a^n)%MOD
T ret = 1;
while (n > 0) {
if ((n & 1) != 0) { // n%2==1
ret = ret * a % mod;
}
a = a * a % mod;
... | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"expression.operation.binary.change",
"call.arguments.change",
"call.arguments.add"
] | 798,972 | 798,973 | u604693716 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
int n, k;
long long nCr[2020][2020];
const int mod = 1000000009;
long long f(int n, int r) {
if (nCr[n][r] != -1)
return nCr[n][r];
if (n == 0 && n == 1)
return nCr[n][r] = 1;
if (r == 0 || r == n)
return nCr[n][r] = 1;
else
return nCr[n][r] = (f(n -... | #include <bits/stdc++.h>
using namespace std;
int n, k;
long long nCr[2020][2020];
const long long mod = 1000000007;
long long f(int n, int r) {
if (nCr[n][r] != -1)
return nCr[n][r];
if (n == 0 && n == 1)
return nCr[n][r] = 1;
if (r == 0 || r == n)
return nCr[n][r] = 1;
else
return nCr[n][r] = ... | [
"variable_declaration.type.primitive.change",
"variable_declaration.type.widen.change",
"literal.number.change",
"variable_declaration.value.change"
] | 798,976 | 798,977 | u076783581 | cpp |
p02990 | // atcoder/abc132/D/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typenam... | // atcoder/abc132/D/main.cpp
// author: @___Johniel
// github: https://github.com/johniel/
#include <bits/stdc++.h>
#define each(i, c) for (auto &i : c)
#define unless(cond) if (!(cond))
using namespace std;
typedef long long int lli;
typedef unsigned long long ull;
typedef complex<double> point;
template <typenam... | [
"variable_declaration.type.change"
] | 798,978 | 798,979 | u768334187 | cpp |
p02990 | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
typedef string::const_iterator State;
class ParseError {};
void IOS() { ios::sync_with_stdio(false), cin.tie(0); ... | #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using P = pair<ll, ll>;
using mat = vector<vector<ll>>;
typedef string::const_iterator State;
class ParseError {};
void IOS() { ios::sync_with_stdio(false), cin.tie(0); ... | [
"assignment.add"
] | 798,986 | 798,987 | u872959410 | cpp |
p02990 | /* **
** SMIT MANGUKIYA
** DA-IICT(201801191)
**
*/
#include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); \
srand(time(NULL))
#define ff first
#define ss second... | /* **
** SMIT MANGUKIYA
** DA-IICT(201801191)
**
*/
#include <bits/stdc++.h>
using namespace std;
#define FAST \
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); \
srand(time(NULL))
#define ff first
#define ss second... | [
"call.arguments.change"
] | 798,988 | 798,989 | u670919462 | cpp |
p02990 | #include <iostream>
using namespace std;
typedef long long ll;
ll inf = 1e9 + 7;
ll fact[200010] = {0};
ll inv[200010] = {0};
ll mult(ll n, ll m) {
if (m == 0)
return 1;
if (m == 1)
return n % inf;
else if (m % 2 == 0) {
ll t = mult(n, m / 2);
return (t * t) % inf;
} else {
ll t = mult(n,... | #include <iostream>
using namespace std;
typedef long long ll;
ll inf = 1e9 + 7;
ll fact[200010] = {0};
ll inv[200010] = {0};
ll mult(ll n, ll m) {
if (m == 0)
return 1;
if (m == 1)
return n % inf;
else if (m % 2 == 0) {
ll t = mult(n, m / 2);
return (t * t) % inf;
} else {
ll t = mult(n,... | [
"variable_declaration.type.change",
"control_flow.loop.for.initializer.change",
"identifier.change",
"call.function.change",
"io.output.change"
] | 798,994 | 798,995 | u623954643 | cpp |
p02990 | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ ... | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end() // sort(all(vi S)) sort(all(string S))
#define print(v) \
{ ... | [
"assignment.add"
] | 799,004 | 799,005 | u106297876 | cpp |
p02990 | // Author: πα
#include <bits/stdc++.h>
using namespace std;
#define long int64_t
const int MOD = 1000000007;
const int N = 2e3 + 5;
int c[N][N];
void calc() {
for (int n = 0; n < N; ++n) {
c[n][0] = c[n][n] = 1;
for (int k = 1; k < n; ++k)
c[n][k] = (c[n - 1][k - 1] + c[n - 1][k]) % MOD;
}
}
int m... | // Author: πα
#include <bits/stdc++.h>
using namespace std;
#define long int64_t
const int MOD = 1000000007;
const int N = 2e3 + 5;
int c[N][N];
void calc() {
for (int n = 0; n < N; ++n) {
c[n][0] = c[n][n] = 1;
for (int k = 1; k < n; ++k)
c[n][k] = (c[n - 1][k - 1] + c[n - 1][k]) % MOD;
}
}
int m... | [
"expression.operation.binary.add"
] | 799,010 | 799,011 | u518468154 | cpp |
p02990 | // #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int... | // #define DEBUGGING
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
template <typename T> using V = vector<T>;
template <typename T> using VV = V<V<T>>;
template <typename T, typename U> using P = pair<T, U>;
using ll = int... | [
"call.function.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 799,012 | 799,013 | u216962796 | cpp |
p02990 | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long ... | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long ... | [
"assignment.change"
] | 799,014 | 799,015 | u194385557 | cpp |
p02990 | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2... | #include "bits/stdc++.h"
typedef long long ll;
#define int ll
#define fi first
#define se second
#define SORT(a) sort(a.begin(), a.end())
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 0; i < (n); i++)
#define MP(a, b) make_pair(a, b)
#define pb(a) push_back(a)
#define INF LLONG_MAX / 2... | [
"control_flow.branch.else.add"
] | 799,016 | 799,017 | u548768105 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 799,018 | 799,019 | u824337972 | cpp |
p02990 | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | #include <bits/stdc++.h>
#define REP(i, n) for (ll i = 0; i < (ll)n; i++)
#define FOR(i, a, b) for (ll i = (a); i < (ll)b; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1000000000000000
using namespace std;
typedef long long ll;
typedef double db;
typedef string str;
typedef pair<ll, ll> p;
constexpr int... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 799,020 | 799,019 | u824337972 | cpp |
p02990 | #include <iostream>
using namespace std;
long long ruijou(long long a, long long b) {
long long c, mod;
mod = 1e9 + 7;
if (b == 1) {
return a;
} else {
c = ruijou(a, b / 2);
c = (c * c) % mod;
if (b % 2 == 1) {
c = (c * a) % mod;
}
return c;
}
}
int main(void) {
long long N, K,... | #include <iostream>
using namespace std;
long long ruijou(long long a, long long b) {
long long c, mod;
mod = 1e9 + 7;
if (b == 1) {
return a;
} else {
c = ruijou(a, b / 2);
c = (c * c) % mod;
if (b % 2 == 1) {
c = (c * a) % mod;
}
return c;
}
}
int main(void) {
long long N, K,... | [
"assignment.change"
] | 799,021 | 799,022 | u965103758 | cpp |
p02990 | #include <bits/stdc++.h>
#define int long long
#define N 2005
#define Mod 1000000007
#define db(x) cout << #x << "=" << x << endl;
using namespace std;
int n, k, f[N];
int Pow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = res * a % Mod;
a = a * a % Mod;
b >>= 1;
}
return res;
}
int... | #include <bits/stdc++.h>
#define int long long
#define N 2005
#define Mod 1000000007
#define db(x) cout << #x << "=" << x << endl;
using namespace std;
int n, k, f[N];
int Pow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = res * a % Mod;
a = a * a % Mod;
b >>= 1;
}
return res;
}
int... | [
"literal.number.change",
"function.return_value.change"
] | 799,025 | 799,026 | u928673524 | cpp |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.