problem_id stringlengths 6 6 | language stringclasses 2
values | original_status stringclasses 3
values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3
values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270
values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil = pair<int, long>;
using pll = pair<long, long>;
using vc = vector<char>;
#define fix20 cout << fixed << setprecision(20)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, t) for (int i = s; i < t; i++)
#define RNG(i, s, t, u) for (int i = s; i < t; i += u)
#define MOD 1000000007
#define all(vec) vec.begin(), vec.end()
const int MAX = 510000;
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
long x, y;
cin >> x >> y;
COMinit();
if ((x + y) % 3 != 0)
cout << 0 << endl;
else {
long m = (x + y) / 3;
long a = x - m;
long b = y - m;
cout << COM(a + b, a) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
using vb = vector<bool>;
using vl = vector<long>;
using vs = vector<string>;
using vvi = vector<vector<int>>;
using vvb = vector<vector<bool>>;
using vvc = vector<vector<char>>;
using vvl = vector<vector<long>>;
using pii = pair<int, int>;
using pil = pair<int, long>;
using pll = pair<long, long>;
using vc = vector<char>;
#define fix20 cout << fixed << setprecision(20)
#define YES cout << "Yes" << endl
#define NO cout << "No" << endl
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, s, t) for (int i = s; i < t; i++)
#define RNG(i, s, t, u) for (int i = s; i < t; i += u)
#define MOD 1000000007
#define all(vec) vec.begin(), vec.end()
const int MAX = 3010000;
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
long x, y;
cin >> x >> y;
COMinit();
if ((x + y) % 3 != 0)
cout << 0 << endl;
else {
long m = (x + y) / 3;
long a = x - m;
long b = y - m;
cout << COM(a + b, a) << endl;
}
} | replace | 23 | 24 | 23 | 24 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.141592653589793
using namespace std;
ll power(ll a, ll b) {
ll ans = 1;
ll t = a;
while (b) {
if (b % 2) {
ans = (ans * t) % mod;
}
t = (t * t) % mod;
b /= 2;
}
return ans;
}
int main() {
// cout << fixed << setprecision(20);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll fact[2000001];
fact[0] = 1;
for (int i = 1; i < 2000001; i++)
fact[i] = (fact[i - 1] * i) % mod;
int x, y;
cin >> x >> y;
if (2 * x - y < 0 || (2 * x - y) % 3) {
cout << 0;
return 0;
}
int b = (2 * x - y) / 3;
int a = x - 2 * b;
ll ans = (fact[a + b] * power(fact[a], mod - 2)) % mod;
ans = (ans * power(fact[b], mod - 2)) % mod;
cout << ans;
}
| #include <bits/stdc++.h>
#define ll long long int
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define pi 3.141592653589793
using namespace std;
ll power(ll a, ll b) {
ll ans = 1;
ll t = a;
while (b) {
if (b % 2) {
ans = (ans * t) % mod;
}
t = (t * t) % mod;
b /= 2;
}
return ans;
}
int main() {
// cout << fixed << setprecision(20);
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll fact[2000001];
fact[0] = 1;
for (int i = 1; i < 2000001; i++)
fact[i] = (fact[i - 1] * i) % mod;
int x, y;
cin >> x >> y;
if (2 * x - y < 0 || (2 * x - y) % 3) {
cout << 0;
return 0;
}
int b = (2 * x - y) / 3;
int a = x - 2 * b;
if (a < 0) {
cout << 0;
return 0;
}
ll ans = (fact[a + b] * power(fact[a], mod - 2)) % mod;
ans = (ans * power(fact[b], mod - 2)) % mod;
cout << ans;
}
| insert | 42 | 42 | 42 | 46 | -11 | |
p02862 | C++ | Runtime Error | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
using namespace std;
int mod = 1e9 + 7;
int fac[2000005];
int modInverse(int a, int m) {
int m0 = m;
int y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
// q is quotient
int q = a / m;
int t = m;
// m is remainder now, process same as
// Euclid's algo
m = a % m, a = t;
t = y;
// Update y and x
y = x - q * y;
x = t;
}
// Make x positive
if (x < 0)
x += m0;
return x;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen ("INPUT.txt" , "r" , stdin);
// freopen ("OUTPUT.txt" , "w" , stdout);
// #endif
// -------------------------------------Code starts
// here---------------------------------------------------------------------
int k1, k2;
cin >> k1 >> k2;
fac[0] = 1;
for (int i = 1; i <= 2000004; i++) {
fac[i] = (fac[i - 1] * i) % mod;
}
if ((2 * k1 - k2) % 3 == 0 && (2 * k2 - k1) % 3 == 0) {
int z1 = (2 * k1 - k2) / 3;
int z2 = (2 * k2 - k1) / 3;
int ans = (fac[z1 + z2]);
ans = (ans * modInverse(fac[z1], mod)) % mod;
ans = (ans * modInverse(fac[z2], mod)) % mod;
cout << ans;
} else {
cout << 0;
}
// -------------------------------------Code ends
// here------------------------------------------------------
clock_t clk;
clk = clock();
clk = clock() - clk;
cerr << fixed << setprecision(6) << "Time: " << ((double)clk) / CLOCKS_PER_SEC
<< "\n";
return 0;
} | #pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define int long long
using namespace std;
int mod = 1e9 + 7;
int fac[2000005];
int modInverse(int a, int m) {
int m0 = m;
int y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
// q is quotient
int q = a / m;
int t = m;
// m is remainder now, process same as
// Euclid's algo
m = a % m, a = t;
t = y;
// Update y and x
y = x - q * y;
x = t;
}
// Make x positive
if (x < 0)
x += m0;
return x;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
// #ifndef ONLINE_JUDGE
// freopen ("INPUT.txt" , "r" , stdin);
// freopen ("OUTPUT.txt" , "w" , stdout);
// #endif
// -------------------------------------Code starts
// here---------------------------------------------------------------------
int k1, k2;
cin >> k1 >> k2;
fac[0] = 1;
for (int i = 1; i <= 2000004; i++) {
fac[i] = (fac[i - 1] * i) % mod;
}
if (2 * k1 < k2 || 2 * k2 < k1) {
cout << 0;
return 0;
}
if ((2 * k1 - k2) % 3 == 0 && (2 * k2 - k1) % 3 == 0) {
int z1 = (2 * k1 - k2) / 3;
int z2 = (2 * k2 - k1) / 3;
int ans = (fac[z1 + z2]);
ans = (ans * modInverse(fac[z1], mod)) % mod;
ans = (ans * modInverse(fac[z2], mod)) % mod;
cout << ans;
} else {
cout << 0;
}
// -------------------------------------Code ends
// here------------------------------------------------------
clock_t clk;
clk = clock();
clk = clock() - clk;
cerr << fixed << setprecision(6) << "Time: " << ((double)clk) / CLOCKS_PER_SEC
<< "\n";
return 0;
} | insert | 56 | 56 | 56 | 60 | 0 | Time: 0.000002
|
p02862 | C++ | Time Limit Exceeded | #include <iostream>
#include <vector>
using namespace std;
const int det = -3;
long long C[2000005];
bool ipr[1000005];
vector<int> primelessthanN(int n) {
// vector<bool> isprime(n + 1, true);
vector<int> prime;
prime.push_back(2);
int i;
for (i = 3; i * i <= n; i += 2) {
if (!ipr[i]) {
prime.push_back(i);
for (int j = i * i; j <= n; j += i)
ipr[j] = true;
}
}
while (i <= n) {
if (!ipr[i])
prime.push_back(i);
i += 2;
}
return prime;
}
int Cal(int n, int p) {
int res = 0;
long long rec = p;
while ((long long)n >= rec) {
res += (int)((long long)n / rec);
rec *= (long long)p;
}
return res;
}
const int Mod = 1000000007;
long long PowerMod(int n, int k) {
int t(k), n0(n);
long long res = 1;
while (t) {
if (t & 1)
res = (res * (long long)n0) % Mod;
n0 = (n0 * n0) % Mod;
t >>= 1;
}
return res;
}
long long Cnm(int n, int m) {
vector<int> prime = primelessthanN(n);
long long res = 1;
for (int i = 0; i < prime.size(); i++) {
res = (res * (PowerMod(prime[i], Cal(n, prime[i]) - Cal(n - m, prime[i]) -
Cal(m, prime[i])))) %
Mod;
}
return res;
}
int main() {
int x, y;
cin >> x >> y;
int det1 = x - 2 * y;
int det2 = y - 2 * x;
if (det1 % det != 0 || det2 % det != 0)
return cout << 0 << endl, 0;
int m = det1 / det;
int n = det2 / det;
int s = m + n;
long long ans = 1LL;
// C[0] = 1;
// for (int i = 1; i <= n; i++)
// C[i] = (C[i - 1] * (s - i + 1) / i) % (1000000007);
cout << Cnm(s, (m > n) ? n : m) << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
const int det = -3;
long long C[2000005];
bool ipr[1000005];
vector<int> primelessthanN(int n) {
// vector<bool> isprime(n + 1, true);
vector<int> prime;
prime.push_back(2);
int i;
for (i = 3; i * i <= n; i += 2) {
if (!ipr[i]) {
prime.push_back(i);
for (int j = i * i; j <= n; j += i)
ipr[j] = true;
}
}
while (i <= n) {
if (!ipr[i])
prime.push_back(i);
i += 2;
}
return prime;
}
int Cal(int n, int p) {
int res = 0;
long long rec = p;
while ((long long)n >= rec) {
res += (int)((long long)n / rec);
rec *= (long long)p;
}
return res;
}
const int Mod = 1000000007;
long long PowerMod(int n, int k) {
int t(k), n0(n);
long long res = 1;
while (t) {
if (t & 1)
res = (res * (long long)n0) % Mod;
n0 = (n0 * n0) % Mod;
t >>= 1;
}
return res;
}
long long Cnm(int n, int m) {
vector<int> prime = primelessthanN(n);
long long res = 1;
for (int i = 0; i < prime.size(); i++) {
res = (res * (PowerMod(prime[i], Cal(n, prime[i]) - Cal(n - m, prime[i]) -
Cal(m, prime[i])))) %
Mod;
}
return res;
}
int main() {
int x, y;
cin >> x >> y;
int det1 = x - 2 * y;
int det2 = y - 2 * x;
if (det1 % det != 0 || det2 % det != 0)
return cout << 0 << endl, 0;
int m = det1 / det;
int n = det2 / det;
if (m < 0 || n < 0)
return cout << 0 << endl, 0;
int s = m + n;
long long ans = 1LL;
// C[0] = 1;
// for (int i = 1; i <= n; i++)
// C[i] = (C[i - 1] * (s - i + 1) / i) % (1000000007);
cout << Cnm(s, (m > n) ? n : m) << endl;
return 0;
} | insert | 74 | 74 | 74 | 76 | TLE | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll modex(ll x, ll n, ll m) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = (res * x) % m;
x = (x * x) % m;
n = n / 2;
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll x, y, sum = 0, k = 1, k1 = 1, k2 = 1, m = 1e9 + 7, a = 0, b = 0, f = 1;
cin >> x >> y;
if ((2 * x - y) % 3 == 0) {
a = (2 * x - y) / 3;
b = x - 2 * a;
if (a >= 0 && b >= 0)
f = 0;
}
if (!f) {
for (ll i = 1; i <= a + b; i++)
k = (k * i) % m;
for (ll i = 1; i <= a; i++)
k1 = (k1 * modex(i, m - 2, m)) % m;
for (ll i = 1; i <= b; i++)
k2 = (k2 * modex(i, m - 2, m)) % m;
}
if (f == 1)
cout << 0 << endl;
else {
sum = (((k * k1) % m) * k2) % m;
cout << sum << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
ll modex(ll x, ll n, ll m) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = (res * x) % m;
x = (x * x) % m;
n = n / 2;
}
return res;
}
int main() {
ios_base::sync_with_stdio(0);
cout.tie(0);
cin.tie(0);
// #ifndef ONLINE_JUDGE
// freopen("input.txt" , "r" , stdin);
// freopen("output.txt" , "w" , stdout);
// #endif
ll x, y, sum = 0, k = 1, k1 = 1, k2 = 1, m = 1e9 + 7, a = 0, b = 0, f = 1;
cin >> x >> y;
if ((2 * x - y) % 3 == 0) {
a = (2 * x - y) / 3;
b = x - 2 * a;
if (a >= 0 && b >= 0)
f = 0;
}
if (!f) {
for (ll i = 1; i <= a + b; i++)
k = (k * i) % m;
for (ll i = 1; i <= a; i++)
k1 = (k1 * modex(i, m - 2, m)) % m;
for (ll i = 1; i <= b; i++)
k2 = (k2 * modex(i, m - 2, m)) % m;
}
if (f == 1)
cout << 0 << endl;
else {
sum = (((k * k1) % m) * k2) % m;
cout << sum << endl;
}
}
| replace | 20 | 24 | 20 | 24 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
typedef long long ll;
using namespace std;
const ll MOD = 1000000007ll;
const int MAX = 510000;
ll fact[MAX], fact_inv[MAX];
// 繰り返し二乗法
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
int main() {
ll x, y;
cin >> x >> y;
ll a, b, c;
if (2 * x < y || 2 * y < x)
cout << 0 << endl;
else {
if ((2 * x - y) % 3 == 0 && (2 * y - x) % 3 == 0) {
a = (2 * x - y) / 3;
b = (2 * y - x) / 3;
fact[0] = 1;
// 階乗の計算
rep(i, a + b) fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[a + b] = power(fact[a + b], MOD - 2);
// 逆元の計算
FORR(i, 0, a + b) fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
c = comb(a + b, a);
cout << c % MOD << endl;
} else {
cout << 0 << endl;
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define FORR(i, a, b) for (int i = (b)-1; i >= (a); --i)
typedef long long ll;
using namespace std;
const ll MOD = 1000000007ll;
const int MAX = 5100000;
ll fact[MAX], fact_inv[MAX];
// 繰り返し二乗法
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
int main() {
ll x, y;
cin >> x >> y;
ll a, b, c;
if (2 * x < y || 2 * y < x)
cout << 0 << endl;
else {
if ((2 * x - y) % 3 == 0 && (2 * y - x) % 3 == 0) {
a = (2 * x - y) / 3;
b = (2 * y - x) / 3;
fact[0] = 1;
// 階乗の計算
rep(i, a + b) fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[a + b] = power(fact[a + b], MOD - 2);
// 逆元の計算
FORR(i, 0, a + b) fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
c = comb(a + b, a);
cout << c % MOD << endl;
} else {
cout << 0 << endl;
}
}
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02862 | C++ | Runtime Error | #include <cstdio>
#define mod 1000000007
#define int long long
int x, y, fac[20010000];
int quickpow(int x, int y) {
if (y == 0)
return 1;
if (y % 2 == 0)
return quickpow(x * x % mod, y / 2);
else
return quickpow(x * x % mod, y / 2) * x % mod;
}
int C(int n, int m) {
if (m == 0 || n == m)
return 1;
return fac[n] * quickpow(fac[m], mod - 2) % mod *
quickpow(fac[n - m], mod - 2) % mod;
}
signed main() {
scanf("%lld%lld", &x, &y);
fac[0] = 1;
for (int i = 1; i <= 20000000; i++)
fac[i] = fac[i - 1] * i % mod;
if ((x + y) % 3 != 0)
return puts("0"), 0;
int X = (2 * y - x) / 3, Y = (2 * x - y) / 3;
printf("%lld\n", C(X + Y, X));
} | #include <cstdio>
#define mod 1000000007
#define int long long
int x, y, fac[20010000];
int quickpow(int x, int y) {
if (y == 0)
return 1;
if (y % 2 == 0)
return quickpow(x * x % mod, y / 2);
else
return quickpow(x * x % mod, y / 2) * x % mod;
}
int C(int n, int m) {
if (m == 0 || n == m)
return 1;
return fac[n] * quickpow(fac[m], mod - 2) % mod *
quickpow(fac[n - m], mod - 2) % mod;
}
signed main() {
scanf("%lld%lld", &x, &y);
fac[0] = 1;
for (int i = 1; i <= 20000000; i++)
fac[i] = fac[i - 1] * i % mod;
if ((x + y) % 3 != 0)
return puts("0"), 0;
if (2 * y < x || 2 * x < y)
return puts("0"), 0;
int X = (2 * y - x) / 3, Y = (2 * x - y) / 3;
printf("%lld\n", C(X + Y, X));
} | insert | 25 | 25 | 25 | 27 | -11 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#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 - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
long x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0;
} else {
long row = (x + y) / 3;
long column = x - row;
cout << COM(row, column) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
const int MAX = 1000000;
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
long x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0;
} else {
long row = (x + y) / 3;
long column = x - row;
cout << COM(row, column) << endl;
}
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02862 | C++ | Runtime Error | #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 - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int X, Y;
cin >> X >> Y;
int sum = X + Y;
if (sum % 3 != 0) {
cout << "0" << endl;
return 0;
}
int m = (2 * Y - X) / 3;
int n = (2 * X - Y) / 3;
if (m < 0 || n < 0) {
cout << "0" << endl;
return 0;
}
COMinit();
cout << COM(m + n, n) << endl;
return 0;
} | #include <iostream>
using namespace std;
const int MAX = 1000000;
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int X, Y;
cin >> X >> Y;
int sum = X + Y;
if (sum % 3 != 0) {
cout << "0" << endl;
return 0;
}
int m = (2 * Y - X) / 3;
int n = (2 * X - Y) / 3;
if (m < 0 || n < 0) {
cout << "0" << endl;
return 0;
}
COMinit();
cout << COM(m + n, n) << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02862 | C++ | Runtime Error | #include <stdio.h>
#define MOD 1000000007
typedef long long ll;
ll fct[1333333] = {1, 1}, inv[1333333] = {1, 1}, fiv[1333333] = {1, 1};
ll combination(ll n, ll r) { return fct[n] * fiv[r] % MOD * fiv[n - r] % MOD; }
int main(void) {
ll X, Y, i;
scanf("%lld %lld", &X, &Y);
if ((X + Y) % 3) {
puts("0");
return 0;
}
ll x = (2 * Y - X) / 3, y = (2 * X - Y) / 3;
for (i = 2; i <= x + y; i++) {
fct[i] = fct[i - 1] * i % MOD;
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
fiv[i] = fiv[i - 1] * inv[i] % MOD;
}
printf("%lld", combination(x + y, x));
return 0;
} | #include <stdio.h>
#define MOD 1000000007
typedef long long ll;
ll fct[1333333] = {1, 1}, inv[1333333] = {1, 1}, fiv[1333333] = {1, 1};
ll combination(ll n, ll r) { return fct[n] * fiv[r] % MOD * fiv[n - r] % MOD; }
int main(void) {
ll X, Y, i;
scanf("%lld %lld", &X, &Y);
if ((X + Y) % 3) {
puts("0");
return 0;
}
ll x = (2 * Y - X) / 3, y = (2 * X - Y) / 3;
if (x < 0 || y < 0) {
puts("0");
return 0;
}
for (i = 2; i <= x + y; i++) {
fct[i] = fct[i - 1] * i % MOD;
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
fiv[i] = fiv[i - 1] * inv[i] % MOD;
}
printf("%lld", combination(x + y, x));
return 0;
} | insert | 22 | 22 | 22 | 27 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < (int)b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
const ll MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll com(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll mx = max(x, y);
ll mn = min(x, y);
if (mx / 2 > mn) {
cout << 0 << endl;
return 0;
}
if (mx / 2 == mn) {
cout << 1 << endl;
return 0;
}
ll x2 = 0;
ll y2 = 0;
while (x2 - x != -(y2 - y)) {
x2 += 2;
y2 += 1;
}
cominit();
cout << com(y2, x2 - x) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, b) for (int i = a; i < (int)b; i++)
#define all(v) v.begin(), v.end()
const int MOD = 1e9 + 7;
const int INF = 1e9;
//'A' = 65, 'Z' = 90, 'a' = 97, 'z' = 122
const ll MAX = 1000000;
ll fac[MAX], finv[MAX], inv[MAX];
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll com(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll mx = max(x, y);
ll mn = min(x, y);
if (mx / 2 > mn) {
cout << 0 << endl;
return 0;
}
if (mx / 2 == mn) {
cout << 1 << endl;
return 0;
}
ll x2 = 0;
ll y2 = 0;
while (x2 - x != -(y2 - y)) {
x2 += 2;
y2 += 1;
}
cominit();
cout << com(y2, x2 - x) << endl;
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02862 | C++ | Runtime Error | #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus >= 201703L
#pragma GCC target("avx2")
#else
#pragma GCC target("avx")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef long double Ld;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
// 二分累乗法
template <typename T> T modpow(T a, T n, T mod) {
T ret = 1;
if (mod == 1) {
while (n > 0) {
if (n & 1) {
ret = ret * a;
}
a = a * a;
n >>= 1;
}
} else {
while (n > 0) {
if (n & 1) {
ret = ret * a % mod;
}
a = a * a % mod;
n >>= 1;
}
}
return ret;
}
vector<Int> factorials, invs;
bool is_ncr_table = false;
// modが素数の場合のみ
void calc_ncr_table(Int n, Int mod) {
is_ncr_table = true;
// 1! ~ n! の計算
Int f = 1;
factorials.push_back(f);
for (Int i = 1; i <= n; i++) {
f *= i;
f %= mod;
factorials.push_back(f);
}
// n!^-1 の計算
Int inv = modpow(factorials[n], mod - 2, mod);
// (n-1)!^-1 ~ 1!^-1 の計算
invs.assign(n, 1);
invs[n] = inv;
for (Int i = n; i >= 1; i--) {
inv *= i;
inv %= mod;
invs[i - 1] = inv;
}
}
// 一度だけnCrを計算するとき用の関数
Int factorial(Int n, Int mod = 1) {
Int ret = 1;
if (mod == 1) {
for (Int i = 1; i <= n; i++) {
ret *= i;
}
return ret;
} else {
for (Int i = 1; i <= n; i++) {
ret *= i;
ret %= mod;
}
return ret;
}
}
Int ncr(Int n, Int r, Int mod) {
if (n < r) {
return (Int)0;
} else {
if (is_ncr_table) {
// modが素数の場合のみ
return (factorials[n] * invs[r] % mod) * invs[n - r] % mod;
} else {
Int x = 1;
for (Int i = n - r + 1; i <= n; i++) {
x *= i;
x %= mod;
}
return x * modpow(factorial(r, mod), mod - 2, mod) % mod;
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
calc_ncr_table(1000005LL, MOD);
Int x, y;
cin >> x >> y;
Int n, m;
n = (2 * y - x) / 3;
m = (2 * x - y) / 3;
Int ans;
if ((x + y) % 3 != 0) {
ans = 0;
} else {
ans = ncr(n + m, n, MOD);
}
cout << ans << endl;
return 0;
}
| #ifdef DEBUG
#else
#pragma GCC optimize("O3,no-stack-protector")
#pragma GCC optimize("unroll-loops")
#if __cplusplus >= 201703L
#pragma GCC target("avx2")
#else
#pragma GCC target("avx")
#endif
#endif
// 実数の場合
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define dump(x) cout << x << endl
typedef int64_t Int;
typedef long double Ld;
using namespace std;
using Graph = vector<vector<Int>>;
const double pi = M_PI;
const Int MOD = 1000000007;
// 二分累乗法
template <typename T> T modpow(T a, T n, T mod) {
T ret = 1;
if (mod == 1) {
while (n > 0) {
if (n & 1) {
ret = ret * a;
}
a = a * a;
n >>= 1;
}
} else {
while (n > 0) {
if (n & 1) {
ret = ret * a % mod;
}
a = a * a % mod;
n >>= 1;
}
}
return ret;
}
vector<Int> factorials, invs;
bool is_ncr_table = false;
// modが素数の場合のみ
void calc_ncr_table(Int n, Int mod) {
is_ncr_table = true;
// 1! ~ n! の計算
Int f = 1;
factorials.push_back(f);
for (Int i = 1; i <= n; i++) {
f *= i;
f %= mod;
factorials.push_back(f);
}
// n!^-1 の計算
Int inv = modpow(factorials[n], mod - 2, mod);
// (n-1)!^-1 ~ 1!^-1 の計算
invs.assign(n, 1);
invs[n] = inv;
for (Int i = n; i >= 1; i--) {
inv *= i;
inv %= mod;
invs[i - 1] = inv;
}
}
// 一度だけnCrを計算するとき用の関数
Int factorial(Int n, Int mod = 1) {
Int ret = 1;
if (mod == 1) {
for (Int i = 1; i <= n; i++) {
ret *= i;
}
return ret;
} else {
for (Int i = 1; i <= n; i++) {
ret *= i;
ret %= mod;
}
return ret;
}
}
Int ncr(Int n, Int r, Int mod) {
if (n < r) {
return (Int)0;
} else {
if (is_ncr_table) {
// modが素数の場合のみ
return (factorials[n] * invs[r] % mod) * invs[n - r] % mod;
} else {
Int x = 1;
for (Int i = n - r + 1; i <= n; i++) {
x *= i;
x %= mod;
}
return x * modpow(factorial(r, mod), mod - 2, mod) % mod;
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
calc_ncr_table(1000005LL, MOD);
Int x, y;
cin >> x >> y;
Int n, m;
n = (2 * y - x) / 3;
m = (2 * x - y) / 3;
Int ans;
if ((x + y) % 3 != 0 || (n < 0 || m < 0)) {
ans = 0;
} else {
ans = ncr(n + m, n, MOD);
}
cout << ans << endl;
return 0;
}
| replace | 132 | 133 | 132 | 133 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 1000000000
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define meM(y, a) memset(y, a, sizeof y)
#define sC(a) scanf("%d", &a)
#define alL(a) a.begin(), a.end()
#define prinT(a, sz) \
cout << a[0]; \
for (int i = 1; i < sz; i++) \
cout << " " << a[i]; \
cout << endl
#define ranD srand(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
// int fx[]={0,0,1,-1};
// int fy[]={1,-1,0,0};
// int gx[]={0,0,1,1,1,-1,-1,-1};
// int gy[]={1,-1,0,1,-1,0,1,-1};
const int N = 4000010;
ll fact[N];
ll m = 1e9 + 7;
ll power(ll a, ll p) {
ll res = 1;
ll y = a;
while (p > 0) {
if (p & 1)
res = (res * y) % m;
p >>= 1;
y = (y * y) % m;
}
return res;
}
int main() {
IOS;
fact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = (fact[i - 1] * i) % m;
ll a, b;
cin >> a >> b;
ll x = -1, y = -1;
if ((2 * b - a) % 3 == 0)
x = (2 * b - a) / 3;
if ((2 * a - b) % 3 == 0)
y = (2 * a - b) / 3;
if (x == -1 || y == -1)
cout << 0 << endl;
else {
// cout<<x<<" "<<y<<endl;
// ll res=(fact[x+y])/(fact[x]*fact[y]);
ll res = (((fact[x + y] * power(fact[x], m - 2)) % m) *
(power(fact[y], m - 2))) %
m;
cout << res << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define ff first
#define ss second
#define inf 1000000000
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
#define meM(y, a) memset(y, a, sizeof y)
#define sC(a) scanf("%d", &a)
#define alL(a) a.begin(), a.end()
#define prinT(a, sz) \
cout << a[0]; \
for (int i = 1; i < sz; i++) \
cout << " " << a[i]; \
cout << endl
#define ranD srand(chrono::steady_clock::now().time_since_epoch().count());
typedef pair<int, int> pi;
typedef pair<ll, ll> pll;
// int fx[]={0,0,1,-1};
// int fy[]={1,-1,0,0};
// int gx[]={0,0,1,1,1,-1,-1,-1};
// int gy[]={1,-1,0,1,-1,0,1,-1};
const int N = 4000010;
ll fact[N];
ll m = 1e9 + 7;
ll power(ll a, ll p) {
ll res = 1;
ll y = a;
while (p > 0) {
if (p & 1)
res = (res * y) % m;
p >>= 1;
y = (y * y) % m;
}
return res;
}
int main() {
IOS;
fact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = (fact[i - 1] * i) % m;
ll a, b;
cin >> a >> b;
ll x = -1, y = -1;
if ((2 * b - a) % 3 == 0)
x = (2 * b - a) / 3;
if ((2 * a - b) % 3 == 0)
y = (2 * a - b) / 3;
if (x < 0 || y < 0)
cout << 0 << endl;
else {
// cout<<x<<" "<<y<<endl;
// ll res=(fact[x+y])/(fact[x]*fact[y]);
ll res = (((fact[x + y] * power(fact[x], m - 2)) % m) *
(power(fact[y], m - 2))) %
m;
cout << res << endl;
}
}
| replace | 51 | 52 | 51 | 52 | 0 | |
p02862 | C++ | Runtime Error | #include <iostream>
#define rep(i, j, k) for (int i = j; (i) < (k); (i)++)
using namespace std;
#define mod 1000000007
#define mmax 1000000
typedef long long ll;
ll f[mmax], rf[mmax];
ll inv(ll x) {
ll res = 1;
ll k = mod - 2;
ll y = x;
while (k) {
if (k & 1)
res = (res * y) % mod;
y = (y * y) % mod;
k /= 2;
}
return res;
}
void init() {
f[0] = 1;
rep(i, 1, mmax) f[i] = (f[i - 1] * i) % mod;
rep(i, 0, mmax) rf[i] = inv(f[i]);
}
//------------------------------------------------------------------
ll C(int n, int k) {
init();
ll a = f[n]; // = n!
ll b = rf[n - k]; // = (n-k)!
ll c = rf[k]; // = k!
ll bc = (b * c) % mod;
return (a * bc) % mod;
}
int main(void) {
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
printf("0\n");
} else {
int a = (2 * y - x) / 3;
int b = (2 * x - y) / 3;
printf("%lld\n", C(a + b, a));
// printf("%lld\n",C(a+b,min(a,b)));
}
}
| #include <iostream>
#define rep(i, j, k) for (int i = j; (i) < (k); (i)++)
using namespace std;
#define mod 1000000007
#define mmax 1000000
typedef long long ll;
ll f[mmax], rf[mmax];
ll inv(ll x) {
ll res = 1;
ll k = mod - 2;
ll y = x;
while (k) {
if (k & 1)
res = (res * y) % mod;
y = (y * y) % mod;
k /= 2;
}
return res;
}
void init() {
f[0] = 1;
rep(i, 1, mmax) f[i] = (f[i - 1] * i) % mod;
rep(i, 0, mmax) rf[i] = inv(f[i]);
}
//------------------------------------------------------------------
ll C(int n, int k) {
init();
ll a = f[n]; // = n!
ll b = rf[n - k]; // = (n-k)!
ll c = rf[k]; // = k!
ll bc = (b * c) % mod;
return (a * bc) % mod;
}
int main(void) {
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
printf("0\n");
} else {
int layer = (x + y) / 3;
int left = x - layer;
if (left < 0 || layer - left < 0) {
cout << 0;
return 0;
}
// printf("%d %d\n",layer,left);
printf("%lld\n", C(layer, left));
// printf("%lld\n",C(a+b,min(a,b)));
}
}
| replace | 41 | 44 | 41 | 49 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define clr(x, i) memset(x, i, sizeof(x))
using namespace std;
const int N = 2000005;
const ll mod = 1e9 + 7, inv2 = 5e8 + 4;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = x * 10 + ch - '0', ch = getchar();
return x * f;
}
ll x, y, t, fac[N];
ll qpow(ll x, ll k) {
ll ret = 1;
while (k) {
if (k & 1)
ret *= x, ret %= mod;
x *= x;
x %= mod;
k >>= 1;
}
return ret;
}
ll C(ll x, ll y) {
return fac[x] * qpow(fac[y], mod - 2) % mod * qpow(fac[x - y], mod - 2) % mod;
}
int main() {
fac[0] = 1;
for (int i = 1; i <= N - 2; i++)
fac[i] = fac[i - 1] * i % mod;
cin >> x >> y;
if ((x + y) % 3) {
puts("0");
return 0;
}
t = (x + y) / 3;
x -= t;
y -= t;
printf("%lld\n", C(x + y, x));
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define clr(x, i) memset(x, i, sizeof(x))
using namespace std;
const int N = 2000005;
const ll mod = 1e9 + 7, inv2 = 5e8 + 4;
inline int read() {
int x = 0, f = 1;
char ch = getchar();
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = x * 10 + ch - '0', ch = getchar();
return x * f;
}
ll x, y, t, fac[N];
ll qpow(ll x, ll k) {
ll ret = 1;
while (k) {
if (k & 1)
ret *= x, ret %= mod;
x *= x;
x %= mod;
k >>= 1;
}
return ret;
}
ll C(ll x, ll y) {
return fac[x] * qpow(fac[y], mod - 2) % mod * qpow(fac[x - y], mod - 2) % mod;
}
int main() {
fac[0] = 1;
for (int i = 1; i <= N - 2; i++)
fac[i] = fac[i - 1] * i % mod;
cin >> x >> y;
if ((x + y) % 3) {
puts("0");
return 0;
}
t = (x + y) / 3;
x -= t;
y -= t;
if (x < 0 || y < 0) {
puts("0");
return 0;
}
printf("%lld\n", C(x + y, x));
return 0;
} | insert | 45 | 45 | 45 | 49 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1000000000000000;
const ll inf = -1e18;
typedef pair<ll, ll> P;
ll ma = 1000000000 + 7;
ll mx = 1000003;
ll h, w, m;
string s;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
void comb(vector<vector<ll>> &v) {
for (ll i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (ll 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]) % ma;
}
}
}
ll GetDigit(ll num) { return log10(num) + 1; }
ll Combination(int n, int r) {
if (n - r < r)
r = n - r;
if (r == 0)
return 1;
if (r == 1)
return n;
vector<ll> numerator(r);
vector<ll> denominator(r);
for (int k = 0; k < r; k++) {
numerator[k] = n - r + k + 1;
denominator[k] = k + 1;
}
for (int p = 2; p <= r; p++) {
int pivot = denominator[p - 1];
if (pivot > 1) {
int offset = (n - r) % p;
for (int k = p - 1; k < r; k += p) {
numerator[k - offset] /= pivot;
denominator[k] /= pivot;
}
}
}
ll result = 1;
for (int k = 0; k < r; k++) {
if (numerator[k] > 1)
result *= numerator[k];
result %= ma;
}
return result;
}
int main() {
ll x, y;
cin >> x >> y;
ll a, b;
a = 0;
b = 0;
if ((-x + 2 * y) % 3 == 0 && (2 * x - y) % 3 == 0) {
a = (-x + 2 * y) / 3;
b = (2 * x - y) / 3;
} else {
cout << 0 << endl;
return 0;
}
cout << Combination(a + b, min(a, b)) << endl;
}
| #include <algorithm>
#include <cstdbool>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1000000000000000;
const ll inf = -1e18;
typedef pair<ll, ll> P;
ll ma = 1000000000 + 7;
ll mx = 1000003;
ll h, w, m;
string s;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
ll gcd(ll x, ll y) {
if (x % y == 0)
return y;
return gcd(y, x % y);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
void comb(vector<vector<ll>> &v) {
for (ll i = 0; i < v.size(); i++) {
v[i][0] = 1;
v[i][i] = 1;
}
for (ll 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]) % ma;
}
}
}
ll GetDigit(ll num) { return log10(num) + 1; }
ll Combination(int n, int r) {
if (n - r < r)
r = n - r;
if (r == 0)
return 1;
if (r == 1)
return n;
vector<ll> numerator(r);
vector<ll> denominator(r);
for (int k = 0; k < r; k++) {
numerator[k] = n - r + k + 1;
denominator[k] = k + 1;
}
for (int p = 2; p <= r; p++) {
int pivot = denominator[p - 1];
if (pivot > 1) {
int offset = (n - r) % p;
for (int k = p - 1; k < r; k += p) {
numerator[k - offset] /= pivot;
denominator[k] /= pivot;
}
}
}
ll result = 1;
for (int k = 0; k < r; k++) {
if (numerator[k] > 1)
result *= numerator[k];
result %= ma;
}
return result;
}
int main() {
ll x, y;
cin >> x >> y;
ll a, b;
a = 0;
b = 0;
if ((-x + 2 * y) % 3 == 0 && (2 * x - y) % 3 == 0 && (-x + 2 * y) >= 0 &&
(2 * x - y) >= 0) {
a = (-x + 2 * y) / 3;
b = (2 * x - y) / 3;
} else {
cout << 0 << endl;
return 0;
}
cout << Combination(a + b, min(a, b)) << endl;
}
| replace | 110 | 111 | 110 | 112 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define FOR(var, from, to) for (int var = (from); var <= (to); ++var)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define rep1(var, n) for (int var = 1; var <= (n); ++var)
#define repC2(vari, varj, n) \
for (int vari = 0; vari < (n)-1; ++vari) \
for (int varj = vari + 1; varj < (n); ++varj)
#define repC3(vari, varj, vark, n) \
for (int vari = 0; vari < (n)-2; ++vari) \
for (int varj = vari + 1; varj < (n)-1; ++varj) \
for (int vark = varj + 1; vark < (n); ++vark)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define tr(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define mset(arr, val) memset(arr, val, sizeof(arr))
#define mid(x, y) ((x) + ((y) - (x)) / 2)
#define IN(x, a, b) ((a) <= (x) && (x) <= (b))
using namespace std;
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
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 - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
int X, Y;
int time, xtime, ytime;
ll ans = 0;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
Out(0);
return 0;
}
time = (X + Y) / 3;
xtime = X - time;
ytime = Y - time;
ans = COM(time, xtime);
Out(ans);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define FOR(var, from, to) for (int var = (from); var <= (to); ++var)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define rep1(var, n) for (int var = 1; var <= (n); ++var)
#define repC2(vari, varj, n) \
for (int vari = 0; vari < (n)-1; ++vari) \
for (int varj = vari + 1; varj < (n); ++varj)
#define repC3(vari, varj, vark, n) \
for (int vari = 0; vari < (n)-2; ++vari) \
for (int varj = vari + 1; varj < (n)-1; ++varj) \
for (int vark = varj + 1; vark < (n); ++vark)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define tr(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define mset(arr, val) memset(arr, val, sizeof(arr))
#define mid(x, y) ((x) + ((y) - (x)) / 2)
#define IN(x, a, b) ((a) <= (x) && (x) <= (b))
using namespace std;
template <typename T> void Out(T x) { cout << x << endl; }
template <typename T1, typename T2> void Ans(bool f, T1 y, T2 n) {
if (f)
Out(y);
else
Out(n);
}
const int MAX = 5100000;
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
int X, Y;
int time, xtime, ytime;
ll ans = 0;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
Out(0);
return 0;
}
time = (X + Y) / 3;
xtime = X - time;
ytime = Y - time;
ans = COM(time, xtime);
Out(ans);
return 0;
} | replace | 32 | 33 | 32 | 33 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rrep(i, a, n) for (ll i = n; i >= a; i--)
#define index_check(i, n) \
if (i > n - 1 || i < 0) \
continue;
#define LINF 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll, ll>;
using Pll = pair<P, ll>;
using PQ = priority_queue<P, vector<P>, greater<P>>;
const ll MOD = 1e9 + 7;
template <ll MOD> struct modint {
ll x;
modint() : x(0) {}
modint(ll a) : x((a % MOD + MOD) % MOD) {}
bool operator!() const { return !x; }
bool operator<(const modint &a) const {
modint res(*this);
return res.x < a.x;
}
bool operator>(const modint &a) const {
modint res(*this);
return res.x > a.x;
}
modint &operator+=(const modint &a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
modint &operator-=(const modint &a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
modint &operator*=(const modint &a) {
(x *= a.x) %= MOD;
return *this;
}
modint &operator/=(const modint &a) {
*this *= a.inv();
return *this;
}
modint &operator%=(const modint &a) {
x %= a.x;
return *this;
}
modint operator-() const { return modint(-x); }
modint operator+(const modint &a) const { return modint(*this) += a; }
modint operator-(const modint &a) const { return modint(*this) -= a; }
modint operator*(const modint &a) const { return modint(*this) *= a; }
modint operator/(const modint &a) const { return modint(*this) /= a; }
modint operator%(const modint &a) const { return modint(*this) %= a; }
bool operator==(const modint &a) const { return x == a.x; }
bool operator!=(const modint &a) const { return x != a.x; }
modint pow(ll n) const {
modint res(1), a(x);
while (n > 0) {
if (n & 1)
res *= a;
a *= a;
n /= 2;
}
return res;
}
modint inv() const { return this->pow(MOD - 2); }
friend ostream &operator<<(ostream &os, const modint &m) { return os << m.x; }
friend istream &operator>>(istream &is, modint &m) {
ll t;
is >> t;
m = modint<MOD>(t);
return (is);
}
static ll get_mod() { return MOD; }
};
using mint = modint<MOD>;
int main() {
ll x, y;
cin >> x >> y;
if ((x + y) % 3)
cout << 0 << endl;
else {
ll a = (x + y) / 3;
ll b = (2 * x - y) / 3;
mint fact[max(a, b) + 1];
fact[0] = 1;
fact[1] = 1;
ll temp = 2;
while (temp <= max(a, b)) {
fact[temp] = fact[temp - 1] * temp;
temp++;
}
if (a - b >= 0)
cout << fact[a] * fact[b].inv() * fact[a - b].inv() << endl;
else
cout << 0 << endl;
}
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i, a, n) for (ll i = a; i < n; i++)
#define rrep(i, a, n) for (ll i = n; i >= a; i--)
#define index_check(i, n) \
if (i > n - 1 || i < 0) \
continue;
#define LINF 1e18
#define INF 1e9
using namespace std;
#define fs first
#define sc second
using P = pair<ll, ll>;
using Pll = pair<P, ll>;
using PQ = priority_queue<P, vector<P>, greater<P>>;
const ll MOD = 1e9 + 7;
template <ll MOD> struct modint {
ll x;
modint() : x(0) {}
modint(ll a) : x((a % MOD + MOD) % MOD) {}
bool operator!() const { return !x; }
bool operator<(const modint &a) const {
modint res(*this);
return res.x < a.x;
}
bool operator>(const modint &a) const {
modint res(*this);
return res.x > a.x;
}
modint &operator+=(const modint &a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
modint &operator-=(const modint &a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
modint &operator*=(const modint &a) {
(x *= a.x) %= MOD;
return *this;
}
modint &operator/=(const modint &a) {
*this *= a.inv();
return *this;
}
modint &operator%=(const modint &a) {
x %= a.x;
return *this;
}
modint operator-() const { return modint(-x); }
modint operator+(const modint &a) const { return modint(*this) += a; }
modint operator-(const modint &a) const { return modint(*this) -= a; }
modint operator*(const modint &a) const { return modint(*this) *= a; }
modint operator/(const modint &a) const { return modint(*this) /= a; }
modint operator%(const modint &a) const { return modint(*this) %= a; }
bool operator==(const modint &a) const { return x == a.x; }
bool operator!=(const modint &a) const { return x != a.x; }
modint pow(ll n) const {
modint res(1), a(x);
while (n > 0) {
if (n & 1)
res *= a;
a *= a;
n /= 2;
}
return res;
}
modint inv() const { return this->pow(MOD - 2); }
friend ostream &operator<<(ostream &os, const modint &m) { return os << m.x; }
friend istream &operator>>(istream &is, modint &m) {
ll t;
is >> t;
m = modint<MOD>(t);
return (is);
}
static ll get_mod() { return MOD; }
};
using mint = modint<MOD>;
int main() {
ll x, y;
cin >> x >> y;
if ((x + y) % 3)
cout << 0 << endl;
else {
ll a = (x + y) / 3;
ll b = max((2 * x - y) / 3, (2 * y - x) / 3);
mint fact[max(a, b) + 1];
fact[0] = 1;
fact[1] = 1;
ll temp = 2;
while (temp <= max(a, b)) {
fact[temp] = fact[temp - 1] * temp;
temp++;
}
if (a - b >= 0)
cout << fact[a] * fact[b].inv() * fact[a - b].inv() << endl;
else
cout << 0 << endl;
}
return 0;
} | replace | 107 | 108 | 107 | 108 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep2(i, s, n) for (int i = (s); i < (int)n; i++)
int INF = 1e9 + 7;
ll power(ll a, int b) {
if (!b)
return 1;
ll c = power(a, b / 2);
if (b % 2)
return c * c % INF * a % INF;
return c * c % INF;
}
ll factorial(ll a) {
if (!a)
return 1;
return a * factorial(a - 1) % INF;
}
int main() {
int X, Y;
cin >> X >> Y;
int ans = 0;
if ((X + Y) % 3 == 0) {
ll m = (2 * Y - X) / 3, n = (2 * X - Y) / 3;
ans = factorial(m + n) * power(factorial(m), INF - 2) % INF *
power(factorial(n), INF - 2) % INF;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using vpii = vector<pii>;
using vpli = vector<pli>;
using vpll = vector<pll>;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep2(i, s, n) for (int i = (s); i < (int)n; i++)
int INF = 1e9 + 7;
ll power(ll a, int b) {
if (!b)
return 1;
ll c = power(a, b / 2);
if (b % 2)
return c * c % INF * a % INF;
return c * c % INF;
}
ll factorial(ll a) {
if (!a)
return 1;
return a * factorial(a - 1) % INF;
}
int main() {
int X, Y;
cin >> X >> Y;
ll ans = 0;
if ((X + Y) % 3 == 0 && X <= 2 * Y && Y <= 2 * X) {
ll m = (2 * Y - X) / 3, n = (2 * X - Y) / 3;
ans = factorial(m + n) * power(factorial(m), INF - 2) % INF *
power(factorial(n), INF - 2) % INF;
}
cout << ans << endl;
} | replace | 37 | 39 | 37 | 39 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
vector<long long> fac;
vector<long long> fac_inv;
vector<long long> inv;
void init_combination(long long n, long long mod) {
fac.resize(n + 1);
fac_inv.resize(n + 1);
inv.resize(n + 1);
fac[0] = 1;
fac[1] = 1;
fac_inv[0] = 1;
fac_inv[1] = 1;
inv[1] = 1;
for (long long i = 2; i <= n; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - (inv[mod % i] * (mod / i)) % mod;
fac_inv[i] = fac_inv[i - 1] * inv[i] % mod;
}
}
long long modcomb(long long n, long long r, long long mod) {
if (n < r)
return 0;
long long result = fac[n] % mod;
result *= (fac_inv[r] * fac_inv[n - r]) % mod;
result %= mod;
return result;
}
int main(void) {
const long long p = (long long)1e9 + 7;
int x, y;
cin >> x >> y;
if ((2 * y - x) % 3 != 0 || (2 * x - y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
int a = (2 * y - x) / 3;
int b = (2 * x - y) / 3;
init_combination(a + b, p);
cout << modcomb(a + b, a, p) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
vector<long long> fac;
vector<long long> fac_inv;
vector<long long> inv;
void init_combination(long long n, long long mod) {
fac.resize(n + 1);
fac_inv.resize(n + 1);
inv.resize(n + 1);
fac[0] = 1;
fac[1] = 1;
fac_inv[0] = 1;
fac_inv[1] = 1;
inv[1] = 1;
for (long long i = 2; i <= n; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - (inv[mod % i] * (mod / i)) % mod;
fac_inv[i] = fac_inv[i - 1] * inv[i] % mod;
}
}
long long modcomb(long long n, long long r, long long mod) {
if (n < r)
return 0;
long long result = fac[n] % mod;
result *= (fac_inv[r] * fac_inv[n - r]) % mod;
result %= mod;
return result;
}
int main(void) {
const long long p = (long long)1e9 + 7;
int x, y;
cin >> x >> y;
if ((2 * y - x) % 3 != 0 || (2 * x - y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
int a = (2 * y - x) / 3;
int b = (2 * x - y) / 3;
if (a < 0 || b < 0) {
cout << 0 << endl;
return 0;
}
init_combination(a + b, p);
cout << modcomb(a + b, a, p) << endl;
return 0;
} | insert | 43 | 43 | 43 | 48 | 0 | |
p02862 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
int x, y;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> x >> y;
int a = (2 * x - y) / 3, b = (2 * y - x) / 3;
if ((x + y) % 3 || a < 0 || b < 0) {
cout << 0 << endl;
return 0;
}
ll D = 1, d = 1, m = min(a, b), n = a + b;
for (int i = 0; i < m; ++i) {
D = D * (n - i) % M;
d = d * (i + 1) % M;
}
while (D % d != 0)
D += M;
cout << (D / d) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
int x, y;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> x >> y;
int a = (2 * x - y) / 3, b = (2 * y - x) / 3;
if ((x + y) % 3 || a < 0 || b < 0) {
cout << 0 << endl;
return 0;
}
ll D = 1, d = 1, m = min(a, b), n = a + b;
for (int i = 0; i < m; ++i) {
D = D * (n - i) % M;
d = d * (i + 1) % M;
}
// d^-1 mod M = d^M-2 mod M
ll p = M - 2, id = 1;
while (p != 0) {
if (p % 2 == 0) {
d = d * d % M;
p /= 2;
} else {
id = id * d % M;
p -= 1;
}
}
cout << (D * id % M) << endl;
} | replace | 21 | 24 | 21 | 33 | TLE | |
p02862 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const int MAX = 100000000;
const long long MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
long long x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
long long m = (2 * x - y) / 3;
long long n = (-1 * x + 2 * y) / 3;
if (m < 0 || n < 0) {
cout << 0 << endl;
} else {
COMinit();
cout << COM(m + n, n) << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1000000;
const long long MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
long long x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
long long m = (2 * x - y) / 3;
long long n = (-1 * x + 2 * y) / 3;
if (m < 0 || n < 0) {
cout << 0 << endl;
} else {
COMinit();
cout << COM(m + n, n) << endl;
}
return 0;
} | replace | 3 | 4 | 3 | 4 | TLE | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
// BELOW
struct mint {
int x; // typedef long long int;
mint(int x = 0) : x((x % MOD + MOD) % MOD) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(int t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
const int MAX = 510000;
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int PERM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[n - k] % MOD) % MOD;
}
int MCOM(int n, int k) {
// n個のものから重複を許してr個選ぶ。
// Choose R from N types of things, allowing for duplication.
return COM(n + k - 1, k);
}
// solve
//-----CODE------//
void solve(void) {
int X, Y;
cin >> X >> Y;
if (X > Y)
swap(X, Y);
int N1 = 0;
while (X * 2 != Y) {
N1++;
X -= 2;
Y -= 1;
if (X < 0) {
cout << 0 << endl;
return;
}
}
int N2 = X;
DEBUG(N1, N2);
COMinit();
cout << COM(N1 + N2, N1) << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <float.h>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define int long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 10000
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
// BELOW
struct mint {
int x; // typedef long long int;
mint(int x = 0) : x((x % MOD + MOD) % MOD) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(int t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
const int MAX = 510000;
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int PERM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[n - k] % MOD) % MOD;
}
int MCOM(int n, int k) {
// n個のものから重複を許してr個選ぶ。
// Choose R from N types of things, allowing for duplication.
return COM(n + k - 1, k);
}
// solve
//-----CODE------//
void solve(void) {
int X, Y;
cin >> X >> Y;
if (X > Y)
swap(X, Y);
int N1 = 0;
while (X * 2 != Y) {
N1++;
X -= 2;
Y -= 1;
if (X < 0) {
cout << 0 << endl;
return;
}
}
int N2 = X;
mint res = 1;
mint c1 = 1;
mint c2 = 1;
mint c3 = 1;
for (int i = 0; i < N1 + N2; i++) {
c1 *= i + 1;
}
for (int i = 0; i < N2; i++) {
c2 *= i + 1;
}
for (int i = 0; i < N1; i++) {
c3 *= i + 1;
}
res = c1 / c2;
res /= c3;
cout << res.x << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| replace | 184 | 188 | 184 | 201 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define i64 long long
#define lint long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807
#define MOD 1000000007
#define int long long
int MIN = I64_MAX;
const int MAX = 510000;
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void solve() {
int X, Y;
cin >> X >> Y;
int P, Q;
P = 2 * Y - X;
Q = 2 * X - Y;
if ((P < 0) || (Q < 0)) {
cout << 0 << endl;
return;
}
if (P % 3 == 0) {
P /= 3;
} else {
cout << 0 << endl;
return;
}
if (Q % 3 == 0) {
Q /= 3;
} else {
cout << 0 << endl;
return;
}
int A = P + Q;
int B = min(P, Q);
COMinit();
cout << COM(A, B) % MOD << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
solve();
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
#define i64 long long
#define lint long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807
#define MOD 1000000007
#define int long long
int MIN = I64_MAX;
const int MAX = 1000000;
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void solve() {
int X, Y;
cin >> X >> Y;
int P, Q;
P = 2 * Y - X;
Q = 2 * X - Y;
if ((P < 0) || (Q < 0)) {
cout << 0 << endl;
return;
}
if (P % 3 == 0) {
P /= 3;
} else {
cout << 0 << endl;
return;
}
if (Q % 3 == 0) {
Q /= 3;
} else {
cout << 0 << endl;
return;
}
int A = P + Q;
int B = min(P, Q);
COMinit();
cout << COM(A, B) % MOD << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
solve();
return 0;
} | replace | 30 | 31 | 30 | 31 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
int f[10000010];
void init() {
f[0] = 1;
for (int i = 1; i < 10000010; i++) {
f[i] = f[i - 1] * i % MOD;
}
}
int pow_mod(int a, int b) {
int ans = 1;
while (b != 0) {
if (b & 1)
ans = (ans * a) % MOD;
a = a * a % MOD;
b >>= 1;
}
return ans;
}
int combi(int n, int r) {
return f[n] * pow_mod(f[r], MOD - 2) % MOD * pow_mod(f[n - r], MOD - 2) % MOD;
}
signed main() {
init();
int w, h;
cin >> w >> h;
int y = 2 * h - w;
if (y % 3 != 0) {
cout << 0 << endl;
return 0;
}
y /= 3;
int x = w - y;
if (x % 2 != 0) {
cout << 0 << endl;
return 0;
}
x /= 2;
if (y < 0 || x < 0) {
swap(h, w);
int y = 2 * h - w;
if (y % 3 != 0) {
cout << 0 << endl;
return 0;
}
y /= 3;
int x = w - y;
if (x % 2 != 0) {
cout << 0 << endl;
return 0;
}
x /= 2;
}
cout << combi(x + y, x) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007
int f[10000010];
void init() {
f[0] = 1;
for (int i = 1; i < 10000010; i++) {
f[i] = f[i - 1] * i % MOD;
}
}
int pow_mod(int a, int b) {
int ans = 1;
while (b != 0) {
if (b & 1)
ans = (ans * a) % MOD;
a = a * a % MOD;
b >>= 1;
}
return ans;
}
int combi(int n, int r) {
return f[n] * pow_mod(f[r], MOD - 2) % MOD * pow_mod(f[n - r], MOD - 2) % MOD;
}
signed main() {
init();
int w, h;
cin >> w >> h;
int y = 2 * h - w;
if (y % 3 != 0) {
cout << 0 << endl;
return 0;
}
y /= 3;
int x = w - y;
if (x % 2 != 0) {
cout << 0 << endl;
return 0;
}
x /= 2;
if (y < 0 || x < 0) {
swap(h, w);
int y = 2 * h - w;
if (y % 3 != 0) {
cout << 0 << endl;
return 0;
}
y /= 3;
int x = w - y;
if (x % 2 != 0) {
cout << 0 << endl;
return 0;
}
x /= 2;
}
if (x < 0 || y < 0) {
cout << 0 << endl;
return 0;
}
cout << combi(x + y, x) << endl;
return 0;
}
| insert | 67 | 67 | 67 | 72 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
constexpr int MOD = 1000000007;
using namespace std;
ll f[1000010];
void init() {
f[0] = 1;
for (int i = 1; i < 1000010; 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 = (res * y) % MOD;
y = (y * y) % MOD;
k /= 2;
}
return res;
}
ll C(int n, int k) {
ll a = f[n];
ll b = f[n - k];
ll c = f[k];
ll bc = (b * c) % MOD;
return (a * inv(bc)) % MOD;
}
int main() {
init();
int x, y;
cin >> x >> y;
int u, r = 0;
while (y != x * 2) {
y -= 1;
x -= 2;
r++;
if (y > x * 2) {
cout << 0 << endl;
return 0;
}
}
u = y / 2;
cout << C(u + r, r) << endl;
return 0;
} | #include <bits/stdc++.h>
using ll = long long;
constexpr int MOD = 1000000007;
using namespace std;
ll f[1000010];
void init() {
f[0] = 1;
for (int i = 1; i < 1000010; 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 = (res * y) % MOD;
y = (y * y) % MOD;
k /= 2;
}
return res;
}
ll C(int n, int k) {
ll a = f[n];
ll b = f[n - k];
ll c = f[k];
ll bc = (b * c) % MOD;
return (a * inv(bc)) % MOD;
}
int main() {
init();
int x, y;
cin >> x >> y;
int u, r = 0;
while (y != x * 2) {
y -= 1;
x -= 2;
r++;
if (y > x * 2 || y < 0 || x < 0) {
cout << 0 << endl;
return 0;
}
}
u = y / 2;
cout << C(u + r, r) << endl;
return 0;
} | replace | 40 | 41 | 40 | 41 | 0 | |
p02862 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
const long long MOD = 1000000007;
int a;
int b;
int x, y;
const int MAXN = 1000010;
int p[1000010];
int szP;
int vis[1000010];
void make_p() {
// 挖素数
szP = 0;
vis[0] = vis[1] = 1;
for (int i = 2; i < MAXN; i++) {
if (!vis[i]) {
p[szP] = i;
szP++;
for (int j = i * 2; j < MAXN; j += i)
vis[j] = 1;
}
}
}
long long qsm(long long a, long long b) { // 快速幂
long long ans = 1, w = a;
for (; b; b >>= 1, w = (w * w) % MOD) {
if (b & 1)
ans = (ans * w) % MOD;
}
return ans;
}
long long Get(long long x, long long y) {
long long sum = 0;
for (; x; x /= y)
sum += x / y;
return sum;
}
long long getC(int x, int y) {
long long ans = 1;
for (int i = 0; (i < szP && p[i] <= x); i++) {
int T = Get(x, p[i]) - Get(x - y, p[i]) - Get(y, p[i]);
ans = (ans * qsm(p[i], T)) % MOD;
}
return ans;
}
int main() {
make_p();
scanf("%d%d", &x, &y);
int a = 2 * x - y;
int b = 2 * y - x;
if ((a % 3 == 0) && (b % 3 == 0)) {
a = a / 3;
b = b / 3;
long long ans = getC(a + b, b);
printf("%I64d\n", ans);
} else {
printf("0\n");
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
const long long MOD = 1000000007;
int a;
int b;
int x, y;
const int MAXN = 1000010;
int p[1000010];
int szP;
int vis[1000010];
void make_p() {
// 挖素数
szP = 0;
vis[0] = vis[1] = 1;
for (int i = 2; i < MAXN; i++) {
if (!vis[i]) {
p[szP] = i;
szP++;
for (int j = i * 2; j < MAXN; j += i)
vis[j] = 1;
}
}
}
long long qsm(long long a, long long b) { // 快速幂
long long ans = 1, w = a;
for (; b; b >>= 1, w = (w * w) % MOD) {
if (b & 1)
ans = (ans * w) % MOD;
}
return ans;
}
long long Get(long long x, long long y) {
long long sum = 0;
for (; x; x /= y)
sum += x / y;
return sum;
}
long long getC(int x, int y) {
long long ans = 1;
for (int i = 0; (i < szP && p[i] <= x); i++) {
int T = Get(x, p[i]) - Get(x - y, p[i]) - Get(y, p[i]);
ans = (ans * qsm(p[i], T)) % MOD;
}
return ans;
}
int main() {
make_p();
scanf("%d%d", &x, &y);
int a = 2 * x - y;
int b = 2 * y - x;
if ((a < 0) || (b < 0)) {
printf("0\n");
return 0;
}
if ((a % 3 == 0) && (b % 3 == 0)) {
a = a / 3;
b = b / 3;
long long ans = getC(a + b, b);
printf("%I64d\n", ans);
} else {
printf("0\n");
}
return 0;
}
| insert | 75 | 75 | 75 | 80 | TLE | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
#define int long long
#if defined(__GNUC__)
#define __int32 __int32_t
#endif // __GNUC__
#define itn __int32
#define REP(i, n) for (itn(i) = 0; (i) < (n); (i)++)
#define REP2(i, x, n) for (itn(i) = x; (i) < (n); (i)++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SORT(x) sort(ALL(x))
#define RSORT(x, T) sort(ALL(x), greater<(T)>())
#define REVERCE(x) reverce(ALL(x))
#define INT_POW(x, y) \
[](int a, int b) -> int { \
int c = a; \
REP(i, b - 1) { c *= a; } \
return c; \
}(x, y)
#define INT_POWM(x, y, m) \
[](int a, int b, int m) -> int { \
int c = a; \
REP(i, b - 1) { \
c *= a; \
c %= m; \
} \
return c; \
}(x, y, m)
const int kMax = 510000;
static int fac[kMax], finv[kMax], inv[kMax];
static int d = 1'000'000'007;
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
REP2(i, 2, kMax) {
fac[i] = fac[i - 1] * i % d;
inv[i] = d - inv[d % i] * (d / i) % d;
finv[i] = finv[i - 1] * inv[i] % d;
}
}
int COM(int n, int k) {
if (n < k) {
return 0;
}
if (n < 0 || k < 0) {
return 0;
}
return fac[n] * (finv[k] * finv[n - k] % d) % d;
}
itn main() {
ios::sync_with_stdio(false);
int x, y;
cin >> x >> y;
if (x * 2 < y || x > y * 2) {
cout << 0;
return 0;
}
if (x * 2 == y || x == y * 2) {
cout << 1;
return 0;
}
if ((x + y) % 3) {
cout << 0;
return 0;
}
int n, m;
n = (-x + 2 * y) / 3;
m = (2 * x - y) / 3;
COMinit();
cout << COM(n + m, n);
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <math.h>
#include <vector>
using namespace std;
#define int long long
#if defined(__GNUC__)
#define __int32 __int32_t
#endif // __GNUC__
#define itn __int32
#define REP(i, n) for (itn(i) = 0; (i) < (n); (i)++)
#define REP2(i, x, n) for (itn(i) = x; (i) < (n); (i)++)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SORT(x) sort(ALL(x))
#define RSORT(x, T) sort(ALL(x), greater<(T)>())
#define REVERCE(x) reverce(ALL(x))
#define INT_POW(x, y) \
[](int a, int b) -> int { \
int c = a; \
REP(i, b - 1) { c *= a; } \
return c; \
}(x, y)
#define INT_POWM(x, y, m) \
[](int a, int b, int m) -> int { \
int c = a; \
REP(i, b - 1) { \
c *= a; \
c %= m; \
} \
return c; \
}(x, y, m)
const int kMax = 680000;
int fac[kMax], finv[kMax], inv[kMax];
int d = 1'000'000'007;
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
REP2(i, 2, kMax) {
fac[i] = fac[i - 1] * i % d;
inv[i] = d - inv[d % i] * (d / i) % d;
finv[i] = finv[i - 1] * inv[i] % d;
}
}
int COM(int n, int k) {
if (n < k) {
return 0;
}
if (n < 0 || k < 0) {
return 0;
}
return fac[n] * (finv[k] * finv[n - k] % d) % d;
}
itn main() {
ios::sync_with_stdio(false);
int x, y;
cin >> x >> y;
if (x * 2 < y || x > y * 2) {
cout << 0;
return 0;
}
if (x * 2 == y || x == y * 2) {
cout << 1;
return 0;
}
if ((x + y) % 3) {
cout << 0;
return 0;
}
int n, m;
n = (-x + 2 * y) / 3;
m = (2 * x - y) / 3;
COMinit();
cout << COM(n + m, n);
return 0;
}
| replace | 38 | 41 | 38 | 41 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, l, r) for (register int i = (l); i <= (r); i++)
#define LOG(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
typedef long long ll;
const int N = 2000000 + 5, MOD = 1000000007;
int fac[N], n, x, y, ifac[N];
int qpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = 1ll * res * a % MOD;
a = 1LL * a * a % MOD;
b >>= 1;
}
return res;
}
int inv(int x) { return qpow(x, MOD - 2); }
int main() {
scanf("%d%d", &x, &y);
n = max(x, y) * 2;
fac[0] = 1;
rep(i, 1, n) fac[i] = 1LL * fac[i - 1] * i % MOD;
ifac[n] = qpow(fac[n], MOD - 2);
for (int i = n - 1; i >= 0; i--)
ifac[i] = 1LL * ifac[i + 1] * (i + 1) % MOD;
int ans = 2 * y - x;
if (ans < 0 || ans % 3)
return puts("0"), 0;
int yy = ans / 3, xx = y - 2 * yy;
if (2 * xx + yy != x)
return puts("0"), 0;
cout << 1LL * fac[xx + yy] * ifac[xx] % MOD * ifac[yy] % MOD << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, l, r) for (register int i = (l); i <= (r); i++)
#define LOG(...) fprintf(stderr, __VA_ARGS__)
using namespace std;
typedef long long ll;
const int N = 2000000 + 5, MOD = 1000000007;
int fac[N], n, x, y, ifac[N];
int qpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = 1ll * res * a % MOD;
a = 1LL * a * a % MOD;
b >>= 1;
}
return res;
}
int inv(int x) { return qpow(x, MOD - 2); }
int main() {
scanf("%d%d", &x, &y);
n = max(x, y) * 2;
fac[0] = 1;
rep(i, 1, n) fac[i] = 1LL * fac[i - 1] * i % MOD;
ifac[n] = qpow(fac[n], MOD - 2);
for (int i = n - 1; i >= 0; i--)
ifac[i] = 1LL * ifac[i + 1] * (i + 1) % MOD;
int ans = 2 * y - x;
if (ans < 0 || ans % 3)
return puts("0"), 0;
int yy = ans / 3, xx = y - 2 * yy;
if (2 * xx + yy != x || xx < 0)
return puts("0"), 0;
cout << 1LL * fac[xx + yy] * ifac[xx] % MOD * ifac[yy] % MOD << endl;
return 0;
}
| replace | 33 | 34 | 33 | 34 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = (int)1e9 + 7;
const int N = (int)2e6 + 5;
ll f[N], rf[N];
ll powmod(ll a, ll b) {
if (b == 0)
return 1;
ll ans = powmod(a, b / 2);
ans = ans * ans % M;
if (b % 2)
ans = ans * a % M;
return ans;
}
ll C(ll a, ll b) {
if (a < b)
return 0;
return f[a] * rf[b] % M * rf[a - b] % M;
}
ll x, y;
void build() {
f[0] = 1;
for (int i = 1; i < N; ++i)
f[i] = f[i - 1] * i % M;
rf[N - 1] = powmod(f[N - 1], M - 2);
for (int i = N - 2; i >= 0; --i)
rf[i] = rf[i + 1] * (i + 1) % M;
}
void init() { cin >> x >> y; }
void solve() {
if ((x + y) % 3 != 0) {
cout << "0\n";
return;
}
ll xy = (x + y) / 3, xx = 2 * xy - y, yy = 2 * xy - x;
cout << C(xx + yy, xx) << '\n';
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
build();
init();
solve();
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int M = (int)1e9 + 7;
const int N = (int)2e6 + 5;
ll f[N], rf[N];
ll powmod(ll a, ll b) {
if (b == 0)
return 1;
ll ans = powmod(a, b / 2);
ans = ans * ans % M;
if (b % 2)
ans = ans * a % M;
return ans;
}
ll C(ll a, ll b) {
if (a < b)
return 0;
return f[a] * rf[b] % M * rf[a - b] % M;
}
ll x, y;
void build() {
f[0] = 1;
for (int i = 1; i < N; ++i)
f[i] = f[i - 1] * i % M;
rf[N - 1] = powmod(f[N - 1], M - 2);
for (int i = N - 2; i >= 0; --i)
rf[i] = rf[i + 1] * (i + 1) % M;
}
void init() { cin >> x >> y; }
void solve() {
if ((x + y) % 3 != 0) {
cout << "0\n";
return;
}
ll xy = (x + y) / 3, xx = 2 * xy - y, yy = 2 * xy - x;
if (xx < 0 || yy < 0) {
cout << "0\n";
return;
}
cout << C(xx + yy, xx) << '\n';
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0);
build();
init();
solve();
}
| insert | 41 | 41 | 41 | 45 | 0 | |
p02862 | C++ | Runtime Error | #include <cstdio>
#include <iostream>
#define N 1000005
using namespace std;
typedef long long ll;
ll x, y, s, M = 1e9 + 7;
ll fac[N] = {1, 1}, inv[N] = {1, 1}, fiv[N] = {1, 1};
int main() {
cin >> x >> y;
s = x + y;
if (s % 3) {
puts("0");
return 0;
}
x -= s / 3;
y -= s / 3;
for (int i = 2; i <= x + y; i++) {
fac[i] = fac[i - 1] * i % M;
inv[i] = inv[M % i] * (M - M / i) % M;
fiv[i] = fiv[i - 1] * inv[i] % M;
}
cout << fac[x + y] * fiv[x] % M * fiv[y] % M;
return 0;
}
| #include <cstdio>
#include <iostream>
#define N 1000005
using namespace std;
typedef long long ll;
ll x, y, s, M = 1e9 + 7;
ll fac[N] = {1, 1}, inv[N] = {1, 1}, fiv[N] = {1, 1};
int main() {
cin >> x >> y;
s = x + y;
if (s % 3) {
puts("0");
return 0;
}
x -= s / 3;
y -= s / 3;
if (x < 0 || y < 0) {
puts("0");
return 0;
}
for (int i = 2; i <= x + y; i++) {
fac[i] = fac[i - 1] * i % M;
inv[i] = inv[M % i] * (M - M / i) % M;
fiv[i] = fiv[i - 1] * inv[i] % M;
}
cout << fac[x + y] * fiv[x] % M * fiv[y] % M;
return 0;
}
| insert | 17 | 17 | 17 | 21 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T> ostream &operator<<(ostream &O, const vector<T> &v) {
for (const T &e : v)
O << e << ' ';
return O;
}
const int MOD = 1E9 + 7, N = 1E6 + 1;
ll fact[N];
ll exp(int a, int n) {
if (n == 0)
return 1;
ll b = exp(a, n / 2);
(b *= b) %= MOD;
if (n & 1)
(b *= a) %= MOD;
return b;
}
ll C(int n, int k) {
return fact[n] * exp(fact[k], MOD - 2) % MOD * exp(fact[n - k], MOD - 2) %
MOD;
}
void _main() {
ll x, y;
cin >> x >> y;
if ((2 * x - y) % 3 || 2 * x - y < 0) {
cout << 0;
return;
}
int a = (2 * x - y) / 3;
int b = a - x + y;
fact[0] = 1;
for (int i = 1; i <= a + b; i++)
fact[i] = fact[i - 1] * i % MOD;
cout << C(a + b, a);
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
int _t = 1;
// cin >> _t;
while (_t--)
_main();
return 0;
} | #include <bits/stdc++.h>
using namespace ::std;
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef array<int, 3> tri;
typedef long double ld;
template <class T> istream &operator>>(istream &I, vector<T> &v) {
for (T &e : v)
I >> e;
return I;
}
template <class T> ostream &operator<<(ostream &O, const vector<T> &v) {
for (const T &e : v)
O << e << ' ';
return O;
}
const int MOD = 1E9 + 7, N = 1E6 + 1;
ll fact[N];
ll exp(int a, int n) {
if (n == 0)
return 1;
ll b = exp(a, n / 2);
(b *= b) %= MOD;
if (n & 1)
(b *= a) %= MOD;
return b;
}
ll C(int n, int k) {
return fact[n] * exp(fact[k], MOD - 2) % MOD * exp(fact[n - k], MOD - 2) %
MOD;
}
void _main() {
ll x, y;
cin >> x >> y;
if ((2 * x - y) % 3 || 2 * x - y < 0) {
cout << 0;
return;
}
int a = (2 * x - y) / 3;
int b = a - x + y;
if (a < 0 || b < 0) {
cout << 0;
return;
}
fact[0] = 1;
for (int i = 1; i <= a + b; i++)
fact[i] = fact[i - 1] * i % MOD;
cout << C(a + b, a);
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
int _t = 1;
// cin >> _t;
while (_t--)
_main();
return 0;
} | insert | 47 | 47 | 47 | 52 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
// Returns n^(-1) mod p
long long int modInverse(long long int n, long long int p) {
return power(n, p - 2, p);
}
// Returns nCr % p using Fermat's little
// theorem.
long long int nCrModPFermat(long long int n, long long int r, long long int p) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
long long int fac[n + 1];
fac[0] = 1;
for (long long int i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
int main() {
long long int x, y, a, b, m, n, p = 1000000007;
cin >> x >> y;
a = 2 * x - y;
b = 2 * y - x;
if (a % 3 == 0 && b % 3 == 0) {
n = b / 3;
m = a / 3;
cout << nCrModPFermat(n + m, n, p);
} else {
cout << 0;
}
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
using namespace std;
long long int power(long long int x, long long int y, long long int p) {
long long int res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
// Returns n^(-1) mod p
long long int modInverse(long long int n, long long int p) {
return power(n, p - 2, p);
}
// Returns nCr % p using Fermat's little
// theorem.
long long int nCrModPFermat(long long int n, long long int r, long long int p) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
long long int fac[n + 1];
fac[0] = 1;
for (long long int i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
int main() {
long long int x, y, a, b, m, n, p = 1000000007;
cin >> x >> y;
a = 2 * x - y;
b = 2 * y - x;
if (a % 3 == 0 && b % 3 == 0 && a >= 0 && b >= 0) {
n = b / 3;
m = a / 3;
cout << nCrModPFermat(n + m, n, p);
} else {
cout << 0;
}
return 0;
}
| replace | 57 | 58 | 57 | 58 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const int max_size = 1000000;
vector<long long> fac(max_size + 1), ifac(max_size + 1);
long long pow_mod(long long x, long long n) {
long long ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
long long comb(long long a, long long b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
long long tmp = ifac[a - b] * ifac[b] % mod;
return tmp * fac[a] % mod;
}
int main() {
fac[0] = 1;
ifac[0] = 1;
for (long long i = 0; i < max_size; i++) {
fac[i + 1] = fac[i] * (i + 1) % mod;
ifac[i + 1] = ifac[i] * pow_mod(i + 1, mod - 2) % mod;
}
long long x, y;
cin >> x >> y;
if ((-2 * x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
long long a = (-x + 2 * y) / 3;
long long b = (-y + 2 * x) / 3;
cout << comb(a + b, a) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
const int max_size = 1000000;
vector<long long> fac(max_size + 1), ifac(max_size + 1);
long long pow_mod(long long x, long long n) {
long long ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
long long comb(long long a, long long b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
long long tmp = ifac[a - b] * ifac[b] % mod;
return tmp * fac[a] % mod;
}
int main() {
fac[0] = 1;
ifac[0] = 1;
for (long long i = 0; i < max_size; i++) {
fac[i + 1] = fac[i] * (i + 1) % mod;
ifac[i + 1] = ifac[i] * pow_mod(i + 1, mod - 2) % mod;
}
long long x, y;
cin >> x >> y;
if ((-2 * x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
} else if ((-x + 2 * y) < 0 || (-y + 2 * x) < 0) {
cout << 0 << endl;
return 0;
}
long long a = (-x + 2 * y) / 3;
long long b = (-y + 2 * x) / 3;
cout << comb(a + b, a) << endl;
return 0;
}
| insert | 39 | 39 | 39 | 42 | 0 | |
p02862 | C++ | Runtime Error | #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 - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
int n, k;
cin >> n >> k;
int x = 2 * n - k;
if (x % 3 != 0) {
cout << 0 << endl;
return 0;
}
x /= 3;
int y = n - 2 * x;
long long xy = x + y;
int64_t ans = 1;
long long u = min(x, y);
cout << COM(xy, u) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const int MAX = 7000000;
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
int n, k;
cin >> n >> k;
int x = 2 * n - k;
if (x % 3 != 0) {
cout << 0 << endl;
return 0;
}
x /= 3;
int y = n - 2 * x;
long long xy = x + y;
int64_t ans = 1;
long long u = min(x, y);
cout << COM(xy, u) << endl;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll M = 1e9 + 7;
ll mul(ll a, ll b) { return a * b % M; }
ll add(ll a, ll b) {
ll res = a + b;
if (res >= M)
res -= M;
return res;
}
ll mod_pow(ll x, ll n) {
if (n == 0)
return 1;
if (n & 1)
return mul(x, mod_pow(mul(x, x), n / 2));
return mod_pow(mul(x, x), n / 2);
}
ll inverse(ll a) { return mod_pow(a, M - 2); }
ll fac[1000010];
void compute_fac() {
fac[0] = 1;
for (int i = 1; i < 1000010; i++) {
fac[i] = mul(fac[i - 1], i);
}
}
int combo(int n, int k) {
return mul(fac[n], inverse(mul(fac[k], fac[n - k])));
}
int main(int argc, char *argv[]) {
compute_fac();
int X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0)
return cout << 0 << endl, 0;
int n = (2 * X - Y) / 3;
int m = X - 2 * n;
cout << combo(n + m, n) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll M = 1e9 + 7;
ll mul(ll a, ll b) { return a * b % M; }
ll add(ll a, ll b) {
ll res = a + b;
if (res >= M)
res -= M;
return res;
}
ll mod_pow(ll x, ll n) {
if (n == 0)
return 1;
if (n & 1)
return mul(x, mod_pow(mul(x, x), n / 2));
return mod_pow(mul(x, x), n / 2);
}
ll inverse(ll a) { return mod_pow(a, M - 2); }
ll fac[1000010];
void compute_fac() {
fac[0] = 1;
for (int i = 1; i < 1000010; i++) {
fac[i] = mul(fac[i - 1], i);
}
}
int combo(int n, int k) {
return mul(fac[n], inverse(mul(fac[k], fac[n - k])));
}
int main(int argc, char *argv[]) {
compute_fac();
int X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0)
return cout << 0 << endl, 0;
int n = (2 * X - Y) / 3;
int m = X - 2 * n;
if (n < 0 || m < 0)
return cout << 0 << endl, 0;
cout << combo(n + m, n) << endl;
return 0;
}
| insert | 47 | 47 | 47 | 49 | 0 | |
p02862 | C++ | Runtime Error | #include <cassert>
#include <iostream>
#include <vector>
using namespace std;
template <long long mod> class modint {
private:
long long a;
public:
constexpr modint(const long long x = 0) noexcept : a(x % mod) {}
constexpr long long &value() noexcept { return a; }
constexpr const long long &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= mod)
a -= mod;
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a)
a += mod;
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % mod;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
long long k = mod - 2;
while (k > 0) {
if (k & 1) {
*this *= rhs;
}
rhs *= rhs;
k /= 2;
}
return *this;
}
friend ostream &operator<<(ostream &os, const modint &X) { return os << X.a; }
friend istream &operator>>(istream &is, modint &X) {
is >> X.a;
X.a %= mod;
if (X.a < 0)
X.a += mod;
return is;
}
};
template <typename T> struct Combination {
private:
int sz;
vector<T> F, F_;
public:
Combination(int sz) : sz(sz), F(sz + 1), F_(sz + 1) {
F[0] = 1;
for (int i = 0; i < sz; ++i)
F[i + 1] = F[i] * (i + 1);
F_.back() = (T)1 / F.back();
for (int i = sz - 1; i >= 0; --i)
F_[i] = F_[i + 1] * (i + 1);
}
T C(int n, int k) {
assert(n <= sz);
if (n < 0 or k > n)
return (T)0;
return F[n] * F_[k] * F_[n - k];
}
};
int main() {
using mint = modint<(int)1e9 + 7>;
Combination<mint> comb((int)1e6);
int X, Y;
cin >> X >> Y;
int s = (2 * Y - X) / 3, t = (2 * X - Y) / 3;
if (s + 2 * t != X or 2 * s + t != Y) {
cout << 0 << endl;
return 0;
}
cout << comb.C(s + t, s) << endl;
}
| #include <cassert>
#include <iostream>
#include <vector>
using namespace std;
template <long long mod> class modint {
private:
long long a;
public:
constexpr modint(const long long x = 0) noexcept : a(x % mod) {}
constexpr long long &value() noexcept { return a; }
constexpr const long long &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= mod)
a -= mod;
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a)
a += mod;
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % mod;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
long long k = mod - 2;
while (k > 0) {
if (k & 1) {
*this *= rhs;
}
rhs *= rhs;
k /= 2;
}
return *this;
}
friend ostream &operator<<(ostream &os, const modint &X) { return os << X.a; }
friend istream &operator>>(istream &is, modint &X) {
is >> X.a;
X.a %= mod;
if (X.a < 0)
X.a += mod;
return is;
}
};
template <typename T> struct Combination {
private:
int sz;
vector<T> F, F_;
public:
Combination(int sz) : sz(sz), F(sz + 1), F_(sz + 1) {
F[0] = 1;
for (int i = 0; i < sz; ++i)
F[i + 1] = F[i] * (i + 1);
F_.back() = (T)1 / F.back();
for (int i = sz - 1; i >= 0; --i)
F_[i] = F_[i + 1] * (i + 1);
}
T C(int n, int k) {
assert(n <= sz);
if (n < 0 or k > n)
return (T)0;
return F[n] * F_[k] * F_[n - k];
}
};
int main() {
using mint = modint<(int)1e9 + 7>;
Combination<mint> comb((int)1e6);
int X, Y;
cin >> X >> Y;
int s = (2 * Y - X) / 3, t = (2 * X - Y) / 3;
if (s + 2 * t != X or 2 * s + t != Y or s < 0 or t < 0) {
cout << 0 << endl;
return 0;
}
cout << comb.C(s + t, s) << endl;
}
| replace | 90 | 91 | 90 | 91 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const long long mod = 1e9 + 7;
long long pow(const long long &v, const long long &n, const long long &mod) {
long long ret = 1;
long long num = n;
long long now = v;
while (num > 0) {
if (num & 1) {
ret = ret * now % mod;
}
now = now * now % mod;
num = num >> 1;
}
return ret;
}
long long calc(const long long &n, const long long &k, const long long &mod) {
long long ret;
vector<long long> fac = vector<long long>(n + 1, 1);
vector<long long> inv = vector<long long>(n + 1, 1);
for (int i = 1; i <= n; ++i) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = pow(fac[i], mod - 2ll, mod);
}
ret = fac[n] * inv[k] % mod * inv[n - k] % mod;
return ret;
}
int main() {
ll x, y;
cin >> x >> y;
ll c = 0;
for (int i = 0; i <= y + 1; ++i) {
if (y * 2 == x) {
break;
}
x++;
y--;
c++;
}
if (y < 0) {
cout << 0 << endl;
return 0;
}
ll ret = calc(y, c, mod);
cout << ret << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const long long mod = 1e9 + 7;
long long pow(const long long &v, const long long &n, const long long &mod) {
long long ret = 1;
long long num = n;
long long now = v;
while (num > 0) {
if (num & 1) {
ret = ret * now % mod;
}
now = now * now % mod;
num = num >> 1;
}
return ret;
}
long long calc(const long long &n, const long long &k, const long long &mod) {
long long ret;
vector<long long> fac = vector<long long>(n + 1, 1);
vector<long long> inv = vector<long long>(n + 1, 1);
for (int i = 1; i <= n; ++i) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = pow(fac[i], mod - 2ll, mod);
}
ret = fac[n] * inv[k] % mod * inv[n - k] % mod;
return ret;
}
int main() {
ll x, y;
cin >> x >> y;
ll c = 0;
for (int i = 0; i <= y + 1; ++i) {
if (y * 2 == x) {
break;
}
x++;
y--;
c++;
}
if (y < 0 || y < c) {
cout << 0 << endl;
return 0;
}
ll ret = calc(y, c, mod);
cout << ret << endl;
return 0;
} | replace | 64 | 65 | 64 | 65 | 0 | |
p02862 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
int64 power_mod(int64 a, int n) {
int64 ret = 1;
for (; n; n >>= 1) {
if (n & 1)
ret = ret * a % MOD;
a = a * a % MOD;
}
return ret;
}
const int N = 1e6 + 10;
int64 F[N], G[N];
int main() {
F[0] = G[0] = 1;
for (int i = 1; i < N; ++i) {
F[i] = F[i - 1] * i % MOD;
G[i] = power_mod(F[i], MOD - 2);
}
int x, y;
scanf("%d%d", &x, &y);
if ((x + y) % 3) {
puts("0");
return 0;
}
int n = (x + y) / 3;
int u = x - n, v = y - n;
int64 ret = F[n] * G[u] % MOD * G[v] % MOD;
printf("%lld\n", ret);
return 0;
}
| #define _USE_MATH_DEFINES
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
int64 power_mod(int64 a, int n) {
int64 ret = 1;
for (; n; n >>= 1) {
if (n & 1)
ret = ret * a % MOD;
a = a * a % MOD;
}
return ret;
}
const int N = 1e6 + 10;
int64 F[N], G[N];
int main() {
F[0] = G[0] = 1;
for (int i = 1; i < N; ++i) {
F[i] = F[i - 1] * i % MOD;
G[i] = power_mod(F[i], MOD - 2);
}
int x, y;
scanf("%d%d", &x, &y);
if ((x + y) % 3) {
puts("0");
return 0;
}
int n = (x + y) / 3;
int u = x - n, v = y - n;
if (u < 0 || v < 0) {
// trace(u, v);
puts("0");
return 0;
}
int64 ret = F[n] * G[u] % MOD * G[v] % MOD;
printf("%lld\n", ret);
return 0;
}
| insert | 72 | 72 | 72 | 77 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long fact[1000005];
const long long MOD = 1e9 + 7;
long long powmod(long long a, long long b) {
if (b == 0) {
return 1 % MOD;
} else if (b == 1) {
return a % MOD;
} else if (b % 2 == 0) {
long long temp = powmod(a, b / 2);
return (temp * temp) % MOD;
} else {
long long temp = powmod(a, b / 2);
return (((temp * temp) % MOD) * a) % MOD;
}
}
int main() {
int X, Y;
scanf("%d%d", &X, &Y);
if ((X + Y) % 3 != 0) {
printf("0");
return 0;
}
int n = (X + Y) / 3;
int r = Y - n;
fact[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
}
long long ans = fact[n];
long long div = (fact[n - r] * fact[r]) % MOD;
printf("%lld", ans * powmod(div, MOD - 2) % MOD);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long fact[1000005];
const long long MOD = 1e9 + 7;
long long powmod(long long a, long long b) {
if (b == 0) {
return 1 % MOD;
} else if (b == 1) {
return a % MOD;
} else if (b % 2 == 0) {
long long temp = powmod(a, b / 2);
return (temp * temp) % MOD;
} else {
long long temp = powmod(a, b / 2);
return (((temp * temp) % MOD) * a) % MOD;
}
}
int main() {
int X, Y;
scanf("%d%d", &X, &Y);
if ((X + Y) % 3 != 0) {
printf("0");
return 0;
}
int n = (X + Y) / 3;
int r = Y - n;
if (r < 0 || r > n) {
printf("0");
return 0;
}
fact[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
}
long long ans = fact[n];
long long div = (fact[n - r] * fact[r]) % MOD;
printf("%lld", ans * powmod(div, MOD - 2) % MOD);
return 0;
}
| insert | 32 | 32 | 32 | 36 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long ll;
vector<ll> fac(2000100, 0); // n!(mod M)
vector<ll> ifac(2000100, 0); // k!^{M-2} (mod M)
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
ll combination(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % MOD;
return tmp * fac[a] % MOD;
}
int main() {
ll X, Y;
cin >> X >> Y;
// 大した量ではないので，先にfax[i]とifax[i]を全て計算しておく
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 2000099; i++) {
fac[i + 1] = fac[i] * (i + 1) % MOD; // n!(mod M)
ifac[i + 1] = ifac[i] * mpow(i + 1, MOD - 2) %
MOD; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
ll a_3 = 2 * Y - X;
ll b_3 = 2 * X - Y;
if (a_3 % 3 != 0 || b_3 % 3 != 0) {
cout << 0 << endl;
} else {
ll a = a_3 / 3;
ll b = b_3 / 3;
cout << combination(a + b, a) << endl;
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <tuple>
#include <vector>
#define MOD (1000000007)
using namespace std;
typedef long long ll;
vector<ll> fac(2000100, 0); // n!(mod M)
vector<ll> ifac(2000100, 0); // k!^{M-2} (mod M)
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
ll combination(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % MOD;
return tmp * fac[a] % MOD;
}
int main() {
ll X, Y;
cin >> X >> Y;
// 大した量ではないので，先にfax[i]とifax[i]を全て計算しておく
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 2000099; i++) {
fac[i + 1] = fac[i] * (i + 1) % MOD; // n!(mod M)
ifac[i + 1] = ifac[i] * mpow(i + 1, MOD - 2) %
MOD; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
ll a_3 = 2 * Y - X;
ll b_3 = 2 * X - Y;
// cout << a_3 << "," << b_3 << endl;
if (a_3 % 3 != 0 || b_3 % 3 != 0 || a_3 < 0 || b_3 < 0) {
cout << 0 << endl;
} else {
ll a = a_3 / 3;
ll b = b_3 / 3;
cout << combination(a + b, a) << endl;
}
return 0;
} | replace | 55 | 56 | 55 | 58 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll unsigned long long
const ll mod = 1e9 + 7; // adjust mod value according to your need
const ll limit = 670000;
void init_fact(vector<ll> &arr) {
arr[0] = 1;
for (ll i = 1; i <= limit; ++i)
arr[i] = (arr[i - 1] * i) % mod;
}
ll power(ll x, ll y) {
ll res = 1;
x = x % mod;
while (y > 0) {
if (y & 1)
res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res;
}
ll modInverse(ll n) { return power(n, mod - 2); }
ll nCrmod_fermat(ll n, ll r, vector<ll> &fac) {
if (r == 0)
return 1;
return (fac[n] * modInverse(fac[r]) % mod * modInverse(fac[n - r]) % mod) %
mod;
}
int main() {
ll x, y;
vector<ll> factorial(limit + 1);
init_fact(factorial);
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0;
return 0;
}
ll k = (x + y) / 3;
if (x - k < 0 || (2 * k) - x < 0) {
cout << 0;
return 0;
}
cout << nCrmod_fermat(k, x - k, factorial);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define SPEED \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define ll long long
const ll mod = 1e9 + 7; // adjust mod value according to your need
const ll limit = 670000;
void init_fact(vector<ll> &arr) {
arr[0] = 1;
for (ll i = 1; i <= limit; ++i)
arr[i] = (arr[i - 1] * i) % mod;
}
ll power(ll x, ll y) {
ll res = 1;
x = x % mod;
while (y > 0) {
if (y & 1)
res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res;
}
ll modInverse(ll n) { return power(n, mod - 2); }
ll nCrmod_fermat(ll n, ll r, vector<ll> &fac) {
if (r == 0)
return 1;
return (fac[n] * modInverse(fac[r]) % mod * modInverse(fac[n - r]) % mod) %
mod;
}
int main() {
ll x, y;
vector<ll> factorial(limit + 1);
init_fact(factorial);
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0;
return 0;
}
ll k = (x + y) / 3;
if (x - k < 0 || (2 * k) - x < 0) {
cout << 0;
return 0;
}
cout << nCrmod_fermat(k, x - k, factorial);
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define per(i, n) for (int i = n - 1; i >= 0; --i)
#define sc1(a) scanf("%d", &a)
#define sc2(a, b) scanf("%d %d", &a, &b)
#define sc3(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define sl1(a) scanf("%lld", &a)
#define sl2(a, b) scanf("%lld %lld", &a, &b)
#define sl3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define PI 3.1415926535897932
// 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 % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
int x, y, ans = 0;
sc2(x, y);
if ((x + y) % 3 != 0 || x > (x + y) / 3 * 2 || y > (x + y) / 3 * 2) {
printf("0\n");
return 0;
}
ans = COM((x + y) / 3, min(x, y) - (x + y) / 3);
printf("%d\n", ans % MOD);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define per(i, n) for (int i = n - 1; i >= 0; --i)
#define sc1(a) scanf("%d", &a)
#define sc2(a, b) scanf("%d %d", &a, &b)
#define sc3(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define sl1(a) scanf("%lld", &a)
#define sl2(a, b) scanf("%lld %lld", &a, &b)
#define sl3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define PI 3.1415926535897932
// typedef long long ll;
const int MAX = 710000;
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
int x, y, ans = 0;
sc2(x, y);
if ((x + y) % 3 != 0 || x > (x + y) / 3 * 2 || y > (x + y) / 3 * 2) {
printf("0\n");
return 0;
}
ans = COM((x + y) / 3, min(x, y) - (x + y) / 3);
printf("%d\n", ans % MOD);
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> 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 (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/*x+yは3の倍数になる*/
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3) {
cout << 0 << endl;
return 0;
}
int n = (x + y) / 3;
x -= n, y -= n;
if (x < 0 || y < 0) {
cout << 0 << endl;
return 0;
}
COMinit();
cout << COM(x + y, x) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define sz(x) int(x.size())
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 1000001;
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/*x+yは3の倍数になる*/
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3) {
cout << 0 << endl;
return 0;
}
int n = (x + y) / 3;
x -= n, y -= n;
if (x < 0 || y < 0) {
cout << 0 << endl;
return 0;
}
COMinit();
cout << COM(x + y, x) << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02862 | C++ | Runtime Error | // Copyright 2019 yaito3014
#include "bits/stdc++.h"
using namespace std;
using namespace literals;
#include <ostream>
template <size_t Mod = 1000000007, class T = long long int> struct modint {
T value;
constexpr modint() = default;
constexpr modint(const modint &) = default;
constexpr modint(modint &&) = default;
constexpr explicit modint(T value_) : value(value_ % Mod) {}
constexpr modint &operator=(modint &) = default;
constexpr modint &operator=(modint &&) = default;
constexpr modint &operator=(T rhs);
constexpr modint &operator+=(const modint &rhs);
constexpr modint &operator-=(const modint &rhs);
constexpr modint &operator*=(const modint &rhs);
constexpr modint &operator%=(T rhs);
constexpr modint &operator%=(const modint &rhs);
constexpr modint &operator/=(const modint &rhs);
constexpr modint inv() const;
};
template <size_t Mod, class T>
constexpr modint<Mod, T> modpow(modint<Mod, T> a, modint<Mod, T> b) {
modint<Mod, T> res(1);
while (b.value > 0) {
if (b.value % 2)
res = res * a;
a = a * a;
b.value /= 2;
}
return res;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &modint<Mod, T>::operator=(T rhs) {
value = rhs % Mod;
return *this;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &
modint<Mod, T>::operator+=(const modint<Mod, T> &rhs) {
value = (value + rhs.value) % Mod;
return *this;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &
modint<Mod, T>::operator-=(const modint<Mod, T> &rhs) {
value = (value - rhs.value) % Mod;
return *this;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &
modint<Mod, T>::operator*=(const modint<Mod, T> &rhs) {
value = (value * rhs.value) % Mod;
return *this;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &modint<Mod, T>::operator%=(T rhs) {
return (*this %= modint<Mod, T>(rhs));
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &
modint<Mod, T>::operator%=(const modint<Mod, T> &rhs) {
value %= rhs.value;
return *this;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> modint<Mod, T>::inv() const {
return modpow<Mod, T>(*this, modint<Mod, T>(Mod - 2));
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &
modint<Mod, T>::operator/=(const modint<Mod, T> &rhs) {
return *this *= rhs.inv();
}
template <size_t Mod, class T>
constexpr modint<Mod, T> operator+(modint<Mod, T> a, const modint<Mod, T> &b) {
return a += b;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> operator-(modint<Mod, T> a, const modint<Mod, T> &b) {
return a -= b;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> operator*(modint<Mod, T> a, const modint<Mod, T> &b) {
return a *= b;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> operator%(modint<Mod, T> a, const modint<Mod, T> &b) {
return a %= b;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> operator/(modint<Mod, T> lhs,
const modint<Mod, T> &rhs) {
return lhs /= rhs;
}
template <size_t Mod, class T>
std::ostream &operator<<(std::ostream &os, const modint<Mod, T> &rhs) {
os << rhs.value;
return os;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int X, Y;
cin >> X >> Y;
if ((X + Y) % 3 || ((X == 0 || Y == 0) && !(X == 0 && Y == 0))) {
cout << 0 << endl;
return 0;
}
vector<modint<>> in(X + Y + 2, modint<>(1));
for (int i = 0; i < X + Y + 1; ++i)
in[i + 1] = in[i] * modint<>(i + 1);
auto combi = [&in](int n, int r) { return (in[n] / in[n - r]) / in[r]; };
cout << combi((X + Y) / 3, max(X, Y) - (X + Y) / 3) << endl;
}
| // Copyright 2019 yaito3014
#include "bits/stdc++.h"
using namespace std;
using namespace literals;
#include <ostream>
template <size_t Mod = 1000000007, class T = long long int> struct modint {
T value;
constexpr modint() = default;
constexpr modint(const modint &) = default;
constexpr modint(modint &&) = default;
constexpr explicit modint(T value_) : value(value_ % Mod) {}
constexpr modint &operator=(modint &) = default;
constexpr modint &operator=(modint &&) = default;
constexpr modint &operator=(T rhs);
constexpr modint &operator+=(const modint &rhs);
constexpr modint &operator-=(const modint &rhs);
constexpr modint &operator*=(const modint &rhs);
constexpr modint &operator%=(T rhs);
constexpr modint &operator%=(const modint &rhs);
constexpr modint &operator/=(const modint &rhs);
constexpr modint inv() const;
};
template <size_t Mod, class T>
constexpr modint<Mod, T> modpow(modint<Mod, T> a, modint<Mod, T> b) {
modint<Mod, T> res(1);
while (b.value > 0) {
if (b.value % 2)
res = res * a;
a = a * a;
b.value /= 2;
}
return res;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &modint<Mod, T>::operator=(T rhs) {
value = rhs % Mod;
return *this;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &
modint<Mod, T>::operator+=(const modint<Mod, T> &rhs) {
value = (value + rhs.value) % Mod;
return *this;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &
modint<Mod, T>::operator-=(const modint<Mod, T> &rhs) {
value = (value - rhs.value) % Mod;
return *this;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &
modint<Mod, T>::operator*=(const modint<Mod, T> &rhs) {
value = (value * rhs.value) % Mod;
return *this;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &modint<Mod, T>::operator%=(T rhs) {
return (*this %= modint<Mod, T>(rhs));
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &
modint<Mod, T>::operator%=(const modint<Mod, T> &rhs) {
value %= rhs.value;
return *this;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> modint<Mod, T>::inv() const {
return modpow<Mod, T>(*this, modint<Mod, T>(Mod - 2));
}
template <size_t Mod, class T>
constexpr modint<Mod, T> &
modint<Mod, T>::operator/=(const modint<Mod, T> &rhs) {
return *this *= rhs.inv();
}
template <size_t Mod, class T>
constexpr modint<Mod, T> operator+(modint<Mod, T> a, const modint<Mod, T> &b) {
return a += b;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> operator-(modint<Mod, T> a, const modint<Mod, T> &b) {
return a -= b;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> operator*(modint<Mod, T> a, const modint<Mod, T> &b) {
return a *= b;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> operator%(modint<Mod, T> a, const modint<Mod, T> &b) {
return a %= b;
}
template <size_t Mod, class T>
constexpr modint<Mod, T> operator/(modint<Mod, T> lhs,
const modint<Mod, T> &rhs) {
return lhs /= rhs;
}
template <size_t Mod, class T>
std::ostream &operator<<(std::ostream &os, const modint<Mod, T> &rhs) {
os << rhs.value;
return os;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int X, Y;
cin >> X >> Y;
if ((X + Y) % 3 || X < (X + Y) / 3 || Y < (X + Y) / 3) {
cout << 0 << endl;
return 0;
}
vector<modint<>> in(X + Y + 2, modint<>(1));
for (int i = 0; i < X + Y + 1; ++i)
in[i + 1] = in[i] * modint<>(i + 1);
auto combi = [&in](int n, int r) { return (in[n] / in[n - r]) / in[r]; };
cout << combi((X + Y) / 3, max(X, Y) - (X + Y) / 3) << endl;
}
| replace | 124 | 125 | 124 | 125 | 0 | |
p02862 | C++ | Runtime Error | // Author:: MUKUL KUMAR RAI
// Institution:: Jalpaiguri Government Engineering College
// If you are not doing well now just stick to it and learn new things one day
// you will be... Compete with yourself
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
///*template{{{
#define sz(x) (ll) x.size()
#define all(x) (x.begin(), x.end())
#define trav(a, x) for (auto &a : x)
#define fr(i, a, b) for (ll i = a; i <= b; i++)
#define fr1(i, a) for (ll i = 0; i < a; i++)
#define frr(i, a, b) for (ll i = b; i >= a; i--)
#define frr1(i, a) for (ll i = a - 1; i >= 0; i--)
#define sorta(a, n) sort(a, a + n)
#define sortd(a, n) sort(a, a + n, greater<ll>())
#define sorva(a) sort(a.begin(), a.end())
#define sortvd(a) sort(a.begin(), a.end(), greater<ll>())
#define tc(t) while (t--)
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vld = vector<ld>;
using pii = pair<ll, ll>;
using psi = pair<string, ll>;
using pci = pair<char, ll>;
using vpii = vector<pii>;
//}}}template*/
ll mod = 1e9 + 7;
ll const maxn = 2e6 + 6;
ll const inf = 1e18;
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll mul(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll powm(ll x, ll n, ll M) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % M;
x = (x * x) % M;
n = n / 2;
}
return result;
}
ll modinverse(ll a, ll m) { return powm(a, m - 2, m); }
bool prime(ll x) {
if (x <= 1)
return false;
for (int i = 2; i <= sqrt(x); i++)
if (x % i == 0)
return false;
return true;
}
ll divisor(ll x) {
ll cnt = 0;
for (int i = 1; i <= sqrt(x); i++) {
if (x % i == 0) {
if (i != x / i)
cnt += 2;
else
cnt += 1;
}
}
return cnt;
}
vector<ll> sieve(ll n) {
bool prim[n + 1];
memset(prim, true, sizeof(prim));
for (ll p = 2; p * p <= n; p++) {
if (prim[p] == true) {
for (int i = p * p; i <= n; i += p)
prim[i] = false;
}
}
vector<ll> v;
for (int i = 2; i <= n; i++)
if (prim[i])
v.push_back(i);
return v;
}
vi fact(maxn);
void solve() {
fact[0] = fact[1] = 1;
for (ll i = 2; i < maxn; i++) {
fact[i] = mul(fact[i - 1], i);
}
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
fio;
solve();
ll x, y;
cin >> x >> y;
ll n = (x + y) / 3;
ll r = min(x - n, y - n);
if ((x + y) % 3 != 0 or (n < r)) {
cout << 0;
return 0;
}
ll ans =
mul(fact[n], mul(modinverse(fact[n - r], mod), modinverse(fact[r], mod)));
cout << ans;
return 0;
} | // Author:: MUKUL KUMAR RAI
// Institution:: Jalpaiguri Government Engineering College
// If you are not doing well now just stick to it and learn new things one day
// you will be... Compete with yourself
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define ld long double
#define fi first
#define se second
#define pb push_back
///*template{{{
#define sz(x) (ll) x.size()
#define all(x) (x.begin(), x.end())
#define trav(a, x) for (auto &a : x)
#define fr(i, a, b) for (ll i = a; i <= b; i++)
#define fr1(i, a) for (ll i = 0; i < a; i++)
#define frr(i, a, b) for (ll i = b; i >= a; i--)
#define frr1(i, a) for (ll i = a - 1; i >= 0; i--)
#define sorta(a, n) sort(a, a + n)
#define sortd(a, n) sort(a, a + n, greater<ll>())
#define sorva(a) sort(a.begin(), a.end())
#define sortvd(a) sort(a.begin(), a.end(), greater<ll>())
#define tc(t) while (t--)
#define fio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
using vi = vector<ll>;
using vvi = vector<vi>;
using vb = vector<bool>;
using vc = vector<char>;
using vs = vector<string>;
using vld = vector<ld>;
using pii = pair<ll, ll>;
using psi = pair<string, ll>;
using pci = pair<char, ll>;
using vpii = vector<pii>;
//}}}template*/
ll mod = 1e9 + 7;
ll const maxn = 2e6 + 6;
ll const inf = 1e18;
ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
ll mul(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll powm(ll x, ll n, ll M) {
ll result = 1;
while (n > 0) {
if (n % 2 == 1)
result = (result * x) % M;
x = (x * x) % M;
n = n / 2;
}
return result;
}
ll modinverse(ll a, ll m) { return powm(a, m - 2, m); }
bool prime(ll x) {
if (x <= 1)
return false;
for (int i = 2; i <= sqrt(x); i++)
if (x % i == 0)
return false;
return true;
}
ll divisor(ll x) {
ll cnt = 0;
for (int i = 1; i <= sqrt(x); i++) {
if (x % i == 0) {
if (i != x / i)
cnt += 2;
else
cnt += 1;
}
}
return cnt;
}
vector<ll> sieve(ll n) {
bool prim[n + 1];
memset(prim, true, sizeof(prim));
for (ll p = 2; p * p <= n; p++) {
if (prim[p] == true) {
for (int i = p * p; i <= n; i += p)
prim[i] = false;
}
}
vector<ll> v;
for (int i = 2; i <= n; i++)
if (prim[i])
v.push_back(i);
return v;
}
vi fact(maxn);
void solve() {
fact[0] = fact[1] = 1;
for (ll i = 2; i < maxn; i++) {
fact[i] = mul(fact[i - 1], i);
}
}
int main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
fio;
solve();
ll x, y;
cin >> x >> y;
ll n = (x + y) / 3;
ll r = min(x - n, y - n);
if ((x + y) % 3 != 0 or (n < r) or n < 0 or r < 0) {
cout << 0;
return 0;
}
ll ans =
mul(fact[n], mul(modinverse(fact[n - r], mod), modinverse(fact[r], mod)));
cout << ans;
return 0;
} | replace | 108 | 109 | 108 | 109 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int main() {
ll X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll Mod = 1000000007;
ll ans = 0;
ll a = (X + Y) / 3;
X = X - a;
Y = Y - a;
ll B[666669];
B[0] = 1;
B[1] = 1;
for (int i = 2; i <= 666668; i++) {
B[i] = B[i - 1] * i;
B[i] %= Mod;
}
if (X > Y) {
swap(X, Y);
}
ll n = (B[X] * B[Y]) % Mod;
ll m = B[X + Y];
cout << (modinv(n, Mod) * m) % Mod << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int main() {
ll X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
if (min(X, Y) * 2 < max(X, Y)) {
cout << 0 << endl;
return 0;
}
ll Mod = 1000000007;
ll ans = 0;
ll a = (X + Y) / 3;
X = X - a;
Y = Y - a;
ll B[666669];
B[0] = 1;
B[1] = 1;
for (int i = 2; i <= 666668; i++) {
B[i] = B[i - 1] * i;
B[i] %= Mod;
}
if (X > Y) {
swap(X, Y);
}
ll n = (B[X] * B[Y]) % Mod;
ll m = B[X + Y];
cout << (modinv(n, Mod) * m) % Mod << endl;
return 0;
} | insert | 26 | 26 | 26 | 30 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define frep(i, m, n) for (int(i) = (m); (i) < (int)(n); (i)++)
#define rrep(i, n) for (int(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (int(i) = (n)-1; (i) > (int)(m)-1; (i)--)
#define ALL(x) (x).begin(), (x).end()
#define SQR(x) (x) * (x)
#define CEIL(a, b) ((a) + (b)-1) / (b)
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const int MAX_N = 101010;
// A:array of pair, N:size of array
void sort_second(vector<pair<ll, ll>> &A, int N);
// a^n
ll a_n(ll a, ll n);
// make vector of (n!)%MOD, (n!)^(-1)%MOD to calculate nCk
void factorial_map(vector<ll> &n, vector<ll> &ninv);
// a^(-1) % MOD
ll inv(ll a);
// map of prime factorization
void prime_map(map<int, int> &a, int n);
// list of prime (is_prime.size() = n + 1, primes.size() = 0)
void prime_list(int n, vector<int> &primes, vector<bool> &is_prime);
// get gcd from prime map
ll gcd_map(map<int, int> a, map<int, int> b);
// get lcm from prime map
ll lcm_map(map<int, int> a, map<int, int> b);
// get gcd
ll my_gcd(ll a, ll b);
// calculate nCk
ll nCk(ll n, ll k);
// get abs
ll my_abs(ll a);
class Unionfind {
public:
vector<ll> par, siz, rank;
Unionfind();
ll root(ll x);
void merge(ll x, ll y);
bool issame(ll x, ll y);
ll size(ll x);
};
int main() {
ll x, y;
cin >> x >> y;
if ((-1 * x + 2 * y) % 3 != 0 || (2 * x - y) % 3 != 0) {
cout << 0 << endl;
} else {
ll a, b, ret;
a = (-1 * x + 2 * y) / 3;
b = (2 * x - y) / 3;
vector<ll> n(1000005), ninv(1000005);
factorial_map(n, ninv);
ret = (n.at(a + b) * ninv.at(a)) % MOD;
ret = (ret * ninv.at(b)) % MOD;
cout << ret << endl;
}
return 0;
}
void sort_second(vector<pair<ll, ll>> &A, int N) {
rep(i, N) swap(A.at(i).first, A.at(i).second);
sort(ALL(A));
rep(i, N) swap(A.at(i).first, A.at(i).second);
}
ll a_n(ll a, ll n) {
if (n == 0)
return 1;
ll ret = a, count = 1;
while (count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
}
if (count == n)
return ret;
else
return (ret * a_n(a, n - count)) % MOD;
}
/* calculate a^n with no recursive process (%MOD)
ll a_n(ll a, ll n) {
ll ret = a, count = 1;
int num = 1;
vector<ll> memory(100);
memory.at(0) = a;
while(count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
memory.at(num) = ret;
num++;
}
if(count == n) return ret;
else {
bitset<100> bit = bitset<100>(n-count);
rep(i, 100) {
if(bit.test(i)) ret = (ret * memory.at(i)) % MOD;
}
return ret;
}
}
*/
void factorial_map(vector<ll> &n, vector<ll> &ninv) {
n[0] = 1;
for (int i = 1; i < n.size(); i++)
n[i] = (n[i - 1] * i) % MOD;
ninv[n.size() - 1] = inv(n[n.size() - 1]);
for (int i = n.size() - 2; i > -1; i--)
ninv[i] = (ninv[i + 1] * (i + 1)) % MOD;
}
ll inv(ll a) { return a_n(a, MOD - 2); }
void prime_map(map<int, int> &a, int n) {
while ((n % 2) == 0) {
n /= 2;
if (a.count(2))
a.at(2)++;
else
a[2] = 1;
}
for (int i = 3; i * i <= n; i += 2) {
while ((n % i) == 0) {
n /= i;
if (a.count(i))
a.at(i)++;
else
a[i] = 1;
}
}
if (n != 1)
a[n] = 1;
}
ll gcd_map(map<int, int> a, map<int, int> b) {
ll ret = 1;
for (auto p : a) {
auto key = p.first;
auto value = p.second;
if (b.count(key)) {
if (value > b.at(key))
ret *= a_n(key, b.at(key));
else
ret *= a_n(key, value);
}
}
return ret;
}
ll lcm_map(map<int, int> a, map<int, int> b) {
ll ret = 1;
for (auto p : a) {
auto key = p.first;
auto value = p.second;
if (b.count(key)) {
if (value > b.at(key))
ret *= a_n(key, value);
else
ret *= a_n(key, b.at(key));
} else {
ret *= a_n(key, value);
}
}
for (auto p : b) {
auto key = p.first;
auto value = p.second;
if (a.count(key)) {
continue;
} else {
ret *= a_n(key, value);
}
}
return ret;
}
ll my_gcd(ll a, ll b) {
if (b == 0)
return a;
return my_gcd(b, a % b);
}
ll nCk(ll n, ll k) {
ll kfac = 1, ret = 1;
for (int i = 1; i <= k; i++) {
kfac = (kfac * i) % MOD;
}
for (int i = n; i >= n - k + 1; i--) {
ret = (ret * i) % MOD;
}
ret = (ret * inv(kfac)) % MOD;
return ret;
}
void prime_list(int n, vector<int> &primes, vector<bool> &is_prime) {
int p = 0;
rep(i, n + 1) is_prime[i] = true;
is_prime[0] = false;
is_prime[1] = false;
for (int i = 2; i <= n; i++) {
if (is_prime[i]) {
primes.push_back(i);
for (int j = 2 * i; j <= n; j += i)
is_prime[j] = false;
}
}
}
ll my_abs(ll a) {
if (a >= 0)
return a;
else
return -1 * a;
}
Unionfind::Unionfind() {
par.resize(MAX_N);
siz.resize(MAX_N);
rank.resize(MAX_N);
rep(i, MAX_N) {
par[i] = i;
siz[i] = 1;
rank[i] = 0;
}
}
ll Unionfind::root(ll x) {
if (par[x] == x)
return x;
else {
return par[x] = root(par[x]);
}
}
void Unionfind::merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rank[x] == rank[y])
rank[x]++;
}
}
bool Unionfind::issame(ll x, ll y) { return root(x) == root(y); }
ll Unionfind::size(ll x) { return siz[root(x)]; } | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
#define frep(i, m, n) for (int(i) = (m); (i) < (int)(n); (i)++)
#define rrep(i, n) for (int(i) = (n)-1; (i) > -1; (i)--)
#define frrep(i, m, n) for (int(i) = (n)-1; (i) > (int)(m)-1; (i)--)
#define ALL(x) (x).begin(), (x).end()
#define SQR(x) (x) * (x)
#define CEIL(a, b) ((a) + (b)-1) / (b)
typedef long long ll;
const int INF = 1001001001;
const int MOD = 1000000007;
const int MAX_N = 101010;
// A:array of pair, N:size of array
void sort_second(vector<pair<ll, ll>> &A, int N);
// a^n
ll a_n(ll a, ll n);
// make vector of (n!)%MOD, (n!)^(-1)%MOD to calculate nCk
void factorial_map(vector<ll> &n, vector<ll> &ninv);
// a^(-1) % MOD
ll inv(ll a);
// map of prime factorization
void prime_map(map<int, int> &a, int n);
// list of prime (is_prime.size() = n + 1, primes.size() = 0)
void prime_list(int n, vector<int> &primes, vector<bool> &is_prime);
// get gcd from prime map
ll gcd_map(map<int, int> a, map<int, int> b);
// get lcm from prime map
ll lcm_map(map<int, int> a, map<int, int> b);
// get gcd
ll my_gcd(ll a, ll b);
// calculate nCk
ll nCk(ll n, ll k);
// get abs
ll my_abs(ll a);
class Unionfind {
public:
vector<ll> par, siz, rank;
Unionfind();
ll root(ll x);
void merge(ll x, ll y);
bool issame(ll x, ll y);
ll size(ll x);
};
int main() {
ll x, y;
cin >> x >> y;
if ((-1 * x + 2 * y) % 3 != 0 || (2 * x - y) % 3 != 0 || -1 * x + 2 * y < 0 ||
2 * x - y < 0) {
cout << 0 << endl;
} else {
ll a, b, ret;
a = (-1 * x + 2 * y) / 3;
b = (2 * x - y) / 3;
vector<ll> n(1000005), ninv(1000005);
factorial_map(n, ninv);
ret = (n.at(a + b) * ninv.at(a)) % MOD;
ret = (ret * ninv.at(b)) % MOD;
cout << ret << endl;
}
return 0;
}
void sort_second(vector<pair<ll, ll>> &A, int N) {
rep(i, N) swap(A.at(i).first, A.at(i).second);
sort(ALL(A));
rep(i, N) swap(A.at(i).first, A.at(i).second);
}
ll a_n(ll a, ll n) {
if (n == 0)
return 1;
ll ret = a, count = 1;
while (count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
}
if (count == n)
return ret;
else
return (ret * a_n(a, n - count)) % MOD;
}
/* calculate a^n with no recursive process (%MOD)
ll a_n(ll a, ll n) {
ll ret = a, count = 1;
int num = 1;
vector<ll> memory(100);
memory.at(0) = a;
while(count * 2 < n) {
ret *= ret;
ret %= MOD;
count *= 2;
memory.at(num) = ret;
num++;
}
if(count == n) return ret;
else {
bitset<100> bit = bitset<100>(n-count);
rep(i, 100) {
if(bit.test(i)) ret = (ret * memory.at(i)) % MOD;
}
return ret;
}
}
*/
void factorial_map(vector<ll> &n, vector<ll> &ninv) {
n[0] = 1;
for (int i = 1; i < n.size(); i++)
n[i] = (n[i - 1] * i) % MOD;
ninv[n.size() - 1] = inv(n[n.size() - 1]);
for (int i = n.size() - 2; i > -1; i--)
ninv[i] = (ninv[i + 1] * (i + 1)) % MOD;
}
ll inv(ll a) { return a_n(a, MOD - 2); }
void prime_map(map<int, int> &a, int n) {
while ((n % 2) == 0) {
n /= 2;
if (a.count(2))
a.at(2)++;
else
a[2] = 1;
}
for (int i = 3; i * i <= n; i += 2) {
while ((n % i) == 0) {
n /= i;
if (a.count(i))
a.at(i)++;
else
a[i] = 1;
}
}
if (n != 1)
a[n] = 1;
}
ll gcd_map(map<int, int> a, map<int, int> b) {
ll ret = 1;
for (auto p : a) {
auto key = p.first;
auto value = p.second;
if (b.count(key)) {
if (value > b.at(key))
ret *= a_n(key, b.at(key));
else
ret *= a_n(key, value);
}
}
return ret;
}
ll lcm_map(map<int, int> a, map<int, int> b) {
ll ret = 1;
for (auto p : a) {
auto key = p.first;
auto value = p.second;
if (b.count(key)) {
if (value > b.at(key))
ret *= a_n(key, value);
else
ret *= a_n(key, b.at(key));
} else {
ret *= a_n(key, value);
}
}
for (auto p : b) {
auto key = p.first;
auto value = p.second;
if (a.count(key)) {
continue;
} else {
ret *= a_n(key, value);
}
}
return ret;
}
ll my_gcd(ll a, ll b) {
if (b == 0)
return a;
return my_gcd(b, a % b);
}
ll nCk(ll n, ll k) {
ll kfac = 1, ret = 1;
for (int i = 1; i <= k; i++) {
kfac = (kfac * i) % MOD;
}
for (int i = n; i >= n - k + 1; i--) {
ret = (ret * i) % MOD;
}
ret = (ret * inv(kfac)) % MOD;
return ret;
}
void prime_list(int n, vector<int> &primes, vector<bool> &is_prime) {
int p = 0;
rep(i, n + 1) is_prime[i] = true;
is_prime[0] = false;
is_prime[1] = false;
for (int i = 2; i <= n; i++) {
if (is_prime[i]) {
primes.push_back(i);
for (int j = 2 * i; j <= n; j += i)
is_prime[j] = false;
}
}
}
ll my_abs(ll a) {
if (a >= 0)
return a;
else
return -1 * a;
}
Unionfind::Unionfind() {
par.resize(MAX_N);
siz.resize(MAX_N);
rank.resize(MAX_N);
rep(i, MAX_N) {
par[i] = i;
siz[i] = 1;
rank[i] = 0;
}
}
ll Unionfind::root(ll x) {
if (par[x] == x)
return x;
else {
return par[x] = root(par[x]);
}
}
void Unionfind::merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[x] = y;
siz[y] += siz[x];
} else {
par[y] = x;
siz[x] += siz[y];
if (rank[x] == rank[y])
rank[x]++;
}
}
bool Unionfind::issame(ll x, ll y) { return root(x) == root(y); }
ll Unionfind::size(ll x) { return siz[root(x)]; } | replace | 52 | 53 | 52 | 54 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int mod = 1000000007;
const long long int INF = 99999999999999999;
long long int n, m, res, di = 1;
long double x[20], y[20], sum = 0;
string str;
// 階乗先に計算
long long int kaizyou[3000005] = {1};
long long int kai(long long int a, long long int b, long long int mod) {
long long int tmp = 1;
for (long long int i = a; i <= b; i++) {
tmp *= i;
tmp %= mod;
kaizyou[i] = tmp;
}
return tmp;
}
// 累乗(繰り返し2乗法) aのb乗(mod)を求める。
long long int rui(long long int a, long long int b, long long mod) {
int memo[65] = {};
long long int A[65] = {};
long long int tmp = 1;
for (int i = 0; i < 65; i++) {
memo[i] = b % 2;
b /= 2;
}
A[0] = a;
A[0] %= mod;
for (int i = 1; i < 65; i++) {
A[i] = A[i - 1] * A[i - 1];
A[i] %= mod;
}
for (int i = 0; i < 65; i++) {
if (memo[i] == 1) {
tmp *= A[i];
tmp %= mod;
}
}
tmp %= mod;
return tmp;
}
// コンビネーション計算
long long int comb(long long int n, long long int r, long long int mod) {
long long int tmp;
tmp = (kaizyou[n] * rui(kaizyou[r], mod - 2, mod)) % mod;
tmp *= rui(kaizyou[n - r], mod - 2, mod);
tmp %= mod;
if (tmp < 0) {
tmp = (mod - tmp) % mod;
}
return tmp;
}
int main() {
cout << fixed << setprecision(10);
cin >> n >> m;
kai(1, 3000000, mod);
if ((n + m) % 3 != 0) {
cout << 0;
return 0;
}
sum = (n + m) / 3;
n -= sum;
m -= sum;
cout << comb(n + m, n, mod);
}
| #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int mod = 1000000007;
const long long int INF = 99999999999999999;
long long int n, m, res, di = 1;
long double x[20], y[20], sum = 0;
string str;
// 階乗先に計算
long long int kaizyou[3000005] = {1};
long long int kai(long long int a, long long int b, long long int mod) {
long long int tmp = 1;
for (long long int i = a; i <= b; i++) {
tmp *= i;
tmp %= mod;
kaizyou[i] = tmp;
}
return tmp;
}
// 累乗(繰り返し2乗法) aのb乗(mod)を求める。
long long int rui(long long int a, long long int b, long long mod) {
int memo[65] = {};
long long int A[65] = {};
long long int tmp = 1;
for (int i = 0; i < 65; i++) {
memo[i] = b % 2;
b /= 2;
}
A[0] = a;
A[0] %= mod;
for (int i = 1; i < 65; i++) {
A[i] = A[i - 1] * A[i - 1];
A[i] %= mod;
}
for (int i = 0; i < 65; i++) {
if (memo[i] == 1) {
tmp *= A[i];
tmp %= mod;
}
}
tmp %= mod;
return tmp;
}
// コンビネーション計算
long long int comb(long long int n, long long int r, long long int mod) {
long long int tmp;
tmp = (kaizyou[n] * rui(kaizyou[r], mod - 2, mod)) % mod;
tmp *= rui(kaizyou[n - r], mod - 2, mod);
tmp %= mod;
if (tmp < 0) {
tmp = (mod - tmp) % mod;
}
return tmp;
}
int main() {
cout << fixed << setprecision(10);
cin >> n >> m;
kai(1, 3000000, mod);
if ((n + m) % 3 != 0 || n > 2 * m || m > 2 * n) {
cout << 0;
return 0;
}
sum = (n + m) / 3;
n -= sum;
m -= sum;
cout << comb(n + m, n, mod);
}
| replace | 79 | 80 | 79 | 80 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
const ll M = 1000000007;
vector<ll> fac(2000005);
vector<ll> ifac(2000005);
// べき乗高速化
ll mpow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
// aCbを計算
ll comb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0) {
return 0;
}
ll temp = ifac[a - b] * ifac[b] % M;
return temp * fac[a] % M;
}
int main() {
ll X, Y;
cin >> X >> Y;
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i <= 2000000; i++) {
fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
ifac[i + 1] =
ifac[i] * mpow(i + 1, M - 2) % M; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
} else {
// 何回移動するか
ll temp = (X + Y) / 3;
cout << comb(temp, X - temp) << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
typedef long long ll;
const ll M = 1000000007;
vector<ll> fac(2000005);
vector<ll> ifac(2000005);
// べき乗高速化
ll mpow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
// aCbを計算
ll comb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0) {
return 0;
}
ll temp = ifac[a - b] * ifac[b] % M;
return temp * fac[a] % M;
}
int main() {
ll X, Y;
cin >> X >> Y;
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i <= 2000000; i++) {
fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
ifac[i + 1] =
ifac[i] * mpow(i + 1, M - 2) % M; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
} else {
// 何回移動するか
ll temp = (X + Y) / 3;
if (X - temp < 0) {
cout << 0 << endl;
} else {
cout << comb(temp, X - temp) << endl;
}
}
return 0;
}
| replace | 49 | 50 | 49 | 54 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N = 1e6 + 6;
const int mod = 1e9 + 7;
ll fact[N], inv[N];
ll fp(ll b, ll p) {
if (p == 0)
return 1;
if (p & 1)
return (b * fp(b, p - 1)) % mod;
return fp((b * b) % mod, p / 2);
}
ll nCk(ll n, ll k) { return ((fact[n] * inv[k]) % mod * inv[n - k]) % mod; }
int main() {
#ifndef ONLINE_JUDGE
freopen("test.txt", "r", stdin);
#endif
ios_base::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
inv[0] = fp(fact[0], mod - 2);
for (int i = 1; i <= 1000000; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = fp(fact[i], mod - 2);
}
ll x, y, ans = 0;
cin >> x >> y;
if ((x + y) % 3 != 0)
return cout << 0, 0;
ll n = 2 * y - x;
n = n / 3;
ll m = y - 2 * n;
if (m < 0 || n < 0)
return cout << 0, 0;
cout << nCk(n + m, m) << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N = 1e6 + 6;
const int mod = 1e9 + 7;
ll fact[N], inv[N];
ll fp(ll b, ll p) {
if (p == 0)
return 1;
if (p & 1)
return (b * fp(b, p - 1)) % mod;
return fp((b * b) % mod, p / 2);
}
ll nCk(ll n, ll k) { return ((fact[n] * inv[k]) % mod * inv[n - k]) % mod; }
int main() {
/* #ifndef ONLINE_JUDGE
freopen("test.txt", "r", stdin);
#endif*/
ios_base::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
inv[0] = fp(fact[0], mod - 2);
for (int i = 1; i <= 1000000; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = fp(fact[i], mod - 2);
}
ll x, y, ans = 0;
cin >> x >> y;
if ((x + y) % 3 != 0)
return cout << 0, 0;
ll n = 2 * y - x;
n = n / 3;
ll m = y - 2 * n;
if (m < 0 || n < 0)
return cout << 0, 0;
cout << nCk(n + m, m) << '\n';
return 0;
}
| replace | 19 | 22 | 19 | 22 | -11 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int N = 2e6 + 23;
int f[N];
int binpow(long long b, long long e) {
if (!e)
return 1;
if (e & 1)
return b * binpow(b, e - 1) % mod;
return binpow(b * b % mod, e / 2);
}
int C(int n, int k) {
return 1LL * f[n] * binpow(f[k], mod - 2) % mod * binpow(f[n - k], mod - 2) %
mod;
}
int main() {
ll x, y;
cin >> x >> y;
f[0] = 1;
for (int i = 1; i <= 1000001; ++i) {
f[i] = 1LL * f[i - 1] * i % mod;
}
if (2 * x - y < 0)
cout << "0";
else if ((x + y) % 3 != 0)
cout << "0";
else
cout << C((x + y) / 3, (2 * x - y) / 3);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1e9 + 7;
const int N = 2e6 + 23;
int f[N];
int binpow(long long b, long long e) {
if (!e)
return 1;
if (e & 1)
return b * binpow(b, e - 1) % mod;
return binpow(b * b % mod, e / 2);
}
int C(int n, int k) {
if (n - k < 0) {
cout << 0;
exit(0);
}
return 1LL * f[n] * binpow(f[k], mod - 2) % mod * binpow(f[n - k], mod - 2) %
mod;
}
int main() {
ll x, y;
cin >> x >> y;
f[0] = 1;
for (int i = 1; i <= 1000001; ++i) {
f[i] = 1LL * f[i - 1] * i % mod;
}
if (2 * x - y < 0)
cout << "0";
else if ((x + y) % 3 != 0)
cout << "0";
else
cout << C((x + y) / 3, (2 * x - y) / 3);
return 0;
}
| insert | 17 | 17 | 17 | 21 | 0 | |
p02862 | C++ | Runtime Error | // shan61916
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dll;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
#define pll pair<ll, ll>
#define all(x) x.begin(), x.end()
#define vll vector<ll>
const ll MOD = (ll)(1e9 + 7);
vll fact(3000000, 0);
ll fast_exp(ll base, ll exp) {
ll res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = (res * base) % MOD;
base = (base * base) % MOD;
exp /= 2;
}
return res % MOD;
}
ll modadd(ll x, ll y) { return (x % MOD + y % MOD) % MOD; }
ll modmul(ll x, ll y) { return (x % MOD * y % MOD) % MOD; }
void f() {
fact[0] = 1;
fact[1] = 1;
for (ll i = 2; i < 3000000; i++)
fact[i] = modmul(i, fact[i - 1]);
}
ll ncr(ll x, ll y) {
ll ans = fact[x];
ll denom = modmul(fact[y], fact[x - y]);
denom = fast_exp(denom, MOD - 2);
ans = modmul(ans, denom);
return ans;
}
int main() {
IOS
#ifdef SHAN
freopen("input.txt", "r", stdin);
#endif
ll x, y;
cin >> x >> y;
ll tot = x + y;
if (tot % 3) {
cout << 0 << endl;
return 0;
}
f();
tot /= 3;
ll firch = x - tot;
if (firch == 0) {
cout << 1;
return 0;
}
if (firch < 0) {
cout << 0;
return 0;
}
cout << ncr(tot, firch);
return 0;
} // good night. | // shan61916
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef double dll;
#define mp make_pair
#define pb push_back
#define ff first
#define ss second
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define endl "\n"
#define pll pair<ll, ll>
#define all(x) x.begin(), x.end()
#define vll vector<ll>
const ll MOD = (ll)(1e9 + 7);
vll fact(3000000, 0);
ll fast_exp(ll base, ll exp) {
ll res = 1;
while (exp > 0) {
if (exp % 2 == 1)
res = (res * base) % MOD;
base = (base * base) % MOD;
exp /= 2;
}
return res % MOD;
}
ll modadd(ll x, ll y) { return (x % MOD + y % MOD) % MOD; }
ll modmul(ll x, ll y) { return (x % MOD * y % MOD) % MOD; }
void f() {
fact[0] = 1;
fact[1] = 1;
for (ll i = 2; i < 3000000; i++)
fact[i] = modmul(i, fact[i - 1]);
}
ll ncr(ll x, ll y) {
if (y > x)
return 0;
ll ans = fact[x];
ll denom = modmul(fact[y], fact[x - y]);
denom = fast_exp(denom, MOD - 2);
ans = modmul(ans, denom);
return ans;
}
int main() {
IOS
#ifdef SHAN
freopen("input.txt", "r", stdin);
#endif
ll x, y;
cin >> x >> y;
ll tot = x + y;
if (tot % 3) {
cout << 0 << endl;
return 0;
}
f();
tot /= 3;
ll firch = x - tot;
if (firch == 0) {
cout << 1;
return 0;
}
if (firch < 0) {
cout << 0;
return 0;
}
cout << ncr(tot, firch);
return 0;
} // good night. | insert | 40 | 40 | 40 | 42 | 0 | |
p02862 | C++ | Runtime Error |
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define x first
#define y second
#define endl '\n'
#define tezz \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define MOD 1000000007
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define fbo find_by_order
#define ook order_of_key
int power(int x, int y, int p) {
int res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
// Returns n^(-1) mod p
int modInverse(int n, int p) { return power(n, p - 2, p); }
int ncr(int n, int r, int p) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
int fac[n + 1];
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
signed main() {
tezz
int x,
y;
cin >> x >> y;
int t = (x + y);
if (t % 3 != 0) {
cout << 0;
return 0;
}
t /= 3;
int tt = x - t;
// cout << tt << " " << t << endl;
if (tt < 0 || t < 0) {
cout << 0;
return 0;
}
if (tt == 0 || tt == t) {
cout << 1;
return 0;
}
if (tt == 1 || tt == t - 1) {
cout << t;
return 0;
}
cout << ncr(t, tt, MOD);
return 0;
}
|
// Best practice
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
#define int long long
#define pb emplace_back
#define pf emplace_front
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define x first
#define y second
#define endl '\n'
#define tezz \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define MOD 1000000007
using namespace std;
using namespace __gnu_pbds;
typedef tree<pair<int, int>, null_type, less<pair<int, int>>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
#define fbo find_by_order
#define ook order_of_key
int power(int x, int y, int p) {
int res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
// Returns n^(-1) mod p
int modInverse(int n, int p) { return power(n, p - 2, p); }
int ncr(int n, int r, int p) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
int fac[n + 1];
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
signed main() {
tezz
int x,
y;
cin >> x >> y;
int t = (x + y);
if (t % 3 != 0) {
cout << 0;
return 0;
}
t /= 3;
int tt = x - t;
// cout << tt << " " << t << endl;
if (tt < 0 || t < 0 || tt > t) {
cout << 0;
return 0;
}
if (tt == 0 || tt == t) {
cout << 1;
return 0;
}
if (tt == 1 || tt == t - 1) {
cout << t;
return 0;
}
cout << ncr(t, tt, MOD);
return 0;
}
| replace | 83 | 84 | 83 | 84 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ordered_set \
tree<int, null_type, std::less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
ll mod = 1e9 + 7;
ll add(ll a, ll b) { return (a % mod + b % mod) % mod; }
ll mul(ll a, ll b) { return (a % mod * b % mod) % mod; }
ll debug(vector<int> a) {
for (int i : a)
cout << i << " ";
return puts("\n"), 0;
}
ll power(ll base, ll exp) {
ll res = 1;
while (exp) {
if (exp & 1)
res = mul(res, base);
base = mul(base, base);
exp >>= 1;
}
return res;
}
ll inv(ll p) { return power(p, mod - 2); }
ll fact[2000003] = {0};
int main() {
fastio fact[0] = 1;
for (int i = 1; i <= 2000002; i++)
fact[i] = mul(fact[i - 1], i);
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0)
return puts("0"), 0;
ll n = (2 * y - x) / 3, m = (2 * x - y) / 3;
ll num = fact[n + m];
ll den = mul(fact[n], fact[m]);
ll ans = mul(num, inv(den));
cout << ans << "\n";
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define pb push_back
#define fastio \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define ordered_set \
tree<int, null_type, std::less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
ll mod = 1e9 + 7;
ll add(ll a, ll b) { return (a % mod + b % mod) % mod; }
ll mul(ll a, ll b) { return (a % mod * b % mod) % mod; }
ll debug(vector<int> a) {
for (int i : a)
cout << i << " ";
return puts("\n"), 0;
}
ll power(ll base, ll exp) {
ll res = 1;
while (exp) {
if (exp & 1)
res = mul(res, base);
base = mul(base, base);
exp >>= 1;
}
return res;
}
ll inv(ll p) { return power(p, mod - 2); }
ll fact[2000003] = {0};
int main() {
fastio fact[0] = 1;
for (int i = 1; i <= 2000002; i++)
fact[i] = mul(fact[i - 1], i);
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0)
return puts("0"), 0;
ll n = (2 * y - x) / 3, m = (2 * x - y) / 3;
if (n < 0 || m < 0) {
cout << "0";
return 0;
}
ll num = fact[n + m];
ll den = mul(fact[n], fact[m]);
ll ans = mul(num, inv(den));
cout << ans << "\n";
} | insert | 46 | 46 | 46 | 50 | 0 | |
p02862 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep0(N) for (int COUNTER = 0; COUNTER < (int)(N); COUNTER++)
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define rep1(i, N) for (int i = 0; i < (int)(N); i++)
#define rep2(i, START, GOAL) for (int i = (int)(START); i < (int)(GOAL); i++)
#define rep3(i, START, GOAL) for (int i = (int)(START); i > (int)(GOAL); i--)
#define ALL(CONTAINER) CONTAINER.begin(), CONTAINER.end()
#define rALL(CONTAINER) CONTAINER.rbegin(), CONTAINER.rend()
#define from1(CONTAINER) CONTAINER.begin() + 1, CONTAINER.end()
#define rfrom1(CONTAINER) CONTAINER.rbegin(), CONTAINER.rend() - 1
#define output(X) cout << X << "\n"
#define dberr(X) cerr << X << "\n"
#define db(X) cerr << #X << ":" << (X) << " "
#define dbl(X) cerr << #X << ":" << (X) << "\n"
#define db2(X, Y) cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << " "
#define db2l(X, Y) cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << "\n"
#define dbl2(X, Y) cerr << #X << ":" << (X) << "\n" << #Y << ":" << (Y) << "\n"
#define db3(X, Y, Z) \
cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << " " << #Z << ":" \
<< (Z) << " "
#define db3l(X, Y, Z) \
cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << ", " << #Z << ":" \
<< (Z) << "\n"
#define dbl3(X, Y, Z) \
cerr << #X << ":" << (X) << "\n" \
<< #Y << ":" << (Y) << "\n" \
<< #Z << ":" << (Z) << "\n"
#define dbp(PAIR) \
cerr << #PAIR << ":(" << PAIR.first << ", " << PAIR.second << ") "
#define dbpl(PAIR) \
cerr << #PAIR << ":(" << PAIR.first << ", " << PAIR.second << ")\n"
#define dbt3(TUPLE3) \
cerr << #TUPLE3 << ":(" << get<0>(TUPLE3) << ", " << get<1>(TUPLE3) << ", " \
<< get<2>(TUPLE3) << ") "
#define dbt3l(TUPLE3) \
cerr << #TUPLE3 << ":(" << get<0>(TUPLE3) << ", " << get<1>(TUPLE3) << ", " \
<< get<2>(TUPLE3) << ")\n"
#define dbt4(TUPLE4) \
cerr << #TUPLE4 << ":(" << get<0>(TUPLE4) << ", " << get<1>(TUPLE4) << ", " \
<< get<2>(TUPLE4) << ", " << get<3>(TUPLE4) << ") "
#define dbt4l(TUPLE4) \
cerr << #TUPLE4 << ":(" << get<0>(TUPLE4) << ", " << get<1>(TUPLE4) << ", " \
<< get<2>(TUPLE4) << ", " << get<3>(TUPLE4) << ")\n"
#define dbv(VEC) \
cerr << #VEC << ":{ "; \
for (auto ELEM : VEC) \
cerr << ELEM << ", "; \
cerr << "}\n"
#define dbvp(VP) \
cerr << #VP << ":{ "; \
for (auto PAIR : VP) \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
cerr << "}\n"
#define dbvv(VV) \
cerr << #VV << ":{\n"; \
for (auto VEC : VV) { \
cerr << "{ "; \
for (auto ELEM : VEC) \
cerr << ELEM << ", "; \
cerr << "},\n"; \
} \
cerr << "}\n"
#define dbvvp(VVP) \
cerr << #VVP << ":{\n"; \
for (auto VP : VVP) { \
cerr << "{ "; \
for (auto PAIR : VP) { \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
} \
cerr << "},\n"; \
} \
cerr << "}\n";
#define dbm(MAP) \
cerr << #MAP << ":{ "; \
for (auto PAIR : MAP) \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
cerr << "}\n"
#define YN(f) cout << (f ? "YES" : "NO") << "\n"
#define Yn(f) cout << (f ? "Yes" : "No") << "\n"
#define yn(f) cout << (f ? "yes" : "no") << "\n"
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<double>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvd = vector<vd>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
using ti3 = tuple<int, int, int>;
using tl3 = tuple<ll, ll, ll>;
using td3 = tuple<double, double, double>;
using ti4 = tuple<int, int, int, int>;
using tl4 = tuple<ll, ll, ll, ll>;
using td4 = tuple<double, double, double, double>;
using mii = map<int, int>;
using mil = map<int, ll>;
using mli = map<ll, int>;
using mll = map<ll, ll>;
using si = set<int>;
using sl = set<ll>;
// db
const int MOD = 1e9 + 7; // 998244353; // 1e9 + 9;
ll rem(ll x) {
x %= MOD;
if (x < 0)
x += MOD;
return x;
}
ll madd(ll x, ll y) { return (rem(x) + rem(y)) % MOD; }
ll msub(ll x, ll y) { return madd(x, -y); }
ll mmul(ll x, ll y) { return rem(x) * rem(y) % MOD; }
ll mpow(ll x, ll n) {
assert(n >= 0);
ll res = 1;
while (n > 0) {
if (n & 1)
res = mmul(res, x);
x = mmul(x, x);
n >>= 1;
}
return res;
}
ll inv(ll x) {
assert(x % MOD != 0);
return mpow(x, MOD - 2);
}
ll mdiv(ll x, ll y) { return mmul(x, inv(y)); }
ll fact(int k) {
assert(k >= 0);
ll res = 1;
rep2(i, 2, k + 1) res = mmul(res, i);
return res;
}
ll cmb(int n, int r) {
assert(n >= 0);
assert(r >= 0);
assert(r <= n);
return mdiv(fact(n), mmul(fact(r), fact(n - r)));
}
int main() {
int X, Y;
cin >> X >> Y;
if ((X + Y) % 3 == 0) {
output(cmb((X + Y) / 3, (2 * X - Y) / 3));
} else
output(0);
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep0(N) for (int COUNTER = 0; COUNTER < (int)(N); COUNTER++)
#define rep(i, N) for (int i = 0; i < (int)(N); i++)
#define rep1(i, N) for (int i = 0; i < (int)(N); i++)
#define rep2(i, START, GOAL) for (int i = (int)(START); i < (int)(GOAL); i++)
#define rep3(i, START, GOAL) for (int i = (int)(START); i > (int)(GOAL); i--)
#define ALL(CONTAINER) CONTAINER.begin(), CONTAINER.end()
#define rALL(CONTAINER) CONTAINER.rbegin(), CONTAINER.rend()
#define from1(CONTAINER) CONTAINER.begin() + 1, CONTAINER.end()
#define rfrom1(CONTAINER) CONTAINER.rbegin(), CONTAINER.rend() - 1
#define output(X) cout << X << "\n"
#define dberr(X) cerr << X << "\n"
#define db(X) cerr << #X << ":" << (X) << " "
#define dbl(X) cerr << #X << ":" << (X) << "\n"
#define db2(X, Y) cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << " "
#define db2l(X, Y) cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << "\n"
#define dbl2(X, Y) cerr << #X << ":" << (X) << "\n" << #Y << ":" << (Y) << "\n"
#define db3(X, Y, Z) \
cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << " " << #Z << ":" \
<< (Z) << " "
#define db3l(X, Y, Z) \
cerr << #X << ":" << (X) << ", " << #Y << ":" << (Y) << ", " << #Z << ":" \
<< (Z) << "\n"
#define dbl3(X, Y, Z) \
cerr << #X << ":" << (X) << "\n" \
<< #Y << ":" << (Y) << "\n" \
<< #Z << ":" << (Z) << "\n"
#define dbp(PAIR) \
cerr << #PAIR << ":(" << PAIR.first << ", " << PAIR.second << ") "
#define dbpl(PAIR) \
cerr << #PAIR << ":(" << PAIR.first << ", " << PAIR.second << ")\n"
#define dbt3(TUPLE3) \
cerr << #TUPLE3 << ":(" << get<0>(TUPLE3) << ", " << get<1>(TUPLE3) << ", " \
<< get<2>(TUPLE3) << ") "
#define dbt3l(TUPLE3) \
cerr << #TUPLE3 << ":(" << get<0>(TUPLE3) << ", " << get<1>(TUPLE3) << ", " \
<< get<2>(TUPLE3) << ")\n"
#define dbt4(TUPLE4) \
cerr << #TUPLE4 << ":(" << get<0>(TUPLE4) << ", " << get<1>(TUPLE4) << ", " \
<< get<2>(TUPLE4) << ", " << get<3>(TUPLE4) << ") "
#define dbt4l(TUPLE4) \
cerr << #TUPLE4 << ":(" << get<0>(TUPLE4) << ", " << get<1>(TUPLE4) << ", " \
<< get<2>(TUPLE4) << ", " << get<3>(TUPLE4) << ")\n"
#define dbv(VEC) \
cerr << #VEC << ":{ "; \
for (auto ELEM : VEC) \
cerr << ELEM << ", "; \
cerr << "}\n"
#define dbvp(VP) \
cerr << #VP << ":{ "; \
for (auto PAIR : VP) \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
cerr << "}\n"
#define dbvv(VV) \
cerr << #VV << ":{\n"; \
for (auto VEC : VV) { \
cerr << "{ "; \
for (auto ELEM : VEC) \
cerr << ELEM << ", "; \
cerr << "},\n"; \
} \
cerr << "}\n"
#define dbvvp(VVP) \
cerr << #VVP << ":{\n"; \
for (auto VP : VVP) { \
cerr << "{ "; \
for (auto PAIR : VP) { \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
} \
cerr << "},\n"; \
} \
cerr << "}\n";
#define dbm(MAP) \
cerr << #MAP << ":{ "; \
for (auto PAIR : MAP) \
cerr << "(" << PAIR.first << ", " << PAIR.second << "), "; \
cerr << "}\n"
#define YN(f) cout << (f ? "YES" : "NO") << "\n"
#define Yn(f) cout << (f ? "Yes" : "No") << "\n"
#define yn(f) cout << (f ? "yes" : "no") << "\n"
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vd = vector<double>;
using vs = vector<string>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using vvd = vector<vd>;
using vvb = vector<vb>;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using vpii = vector<pii>;
using vpll = vector<pll>;
using vpdd = vector<pdd>;
using ti3 = tuple<int, int, int>;
using tl3 = tuple<ll, ll, ll>;
using td3 = tuple<double, double, double>;
using ti4 = tuple<int, int, int, int>;
using tl4 = tuple<ll, ll, ll, ll>;
using td4 = tuple<double, double, double, double>;
using mii = map<int, int>;
using mil = map<int, ll>;
using mli = map<ll, int>;
using mll = map<ll, ll>;
using si = set<int>;
using sl = set<ll>;
// db
const int MOD = 1e9 + 7; // 998244353; // 1e9 + 9;
ll rem(ll x) {
x %= MOD;
if (x < 0)
x += MOD;
return x;
}
ll madd(ll x, ll y) { return (rem(x) + rem(y)) % MOD; }
ll msub(ll x, ll y) { return madd(x, -y); }
ll mmul(ll x, ll y) { return rem(x) * rem(y) % MOD; }
ll mpow(ll x, ll n) {
assert(n >= 0);
ll res = 1;
while (n > 0) {
if (n & 1)
res = mmul(res, x);
x = mmul(x, x);
n >>= 1;
}
return res;
}
ll inv(ll x) {
assert(x % MOD != 0);
return mpow(x, MOD - 2);
}
ll mdiv(ll x, ll y) { return mmul(x, inv(y)); }
ll fact(int k) {
assert(k >= 0);
ll res = 1;
rep2(i, 2, k + 1) res = mmul(res, i);
return res;
}
ll cmb(int n, int r) {
assert(n >= 0);
assert(r >= 0);
assert(r <= n);
return mdiv(fact(n), mmul(fact(r), fact(n - r)));
}
int main() {
int X, Y;
cin >> X >> Y;
if ((X + Y) % 3 == 0 and 2 * X - Y >= 0 and 2 * Y - X >= 0) {
output(cmb((X + Y) / 3, (2 * X - Y) / 3));
} else
output(0);
} | replace | 157 | 158 | 157 | 158 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
//-------------------- Modulo --------------------//
#define MOD (1000000007LL)
#define SIZE (1000000LL)
long long fac[SIZE + 1];
long long inv[SIZE + 1];
long long finv[SIZE + 1];
void modinit(void) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i <= SIZE; ++i) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
long long modcom(long long n, long long k) {
assert(n >= k);
assert(n <= SIZE);
assert(k <= SIZE);
return fac[n] * finv[n - k] % MOD * finv[k] % MOD;
}
//-------------------- Modulo --------------------//
int main() {
modinit();
int X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
int N = (X + Y) / 3;
int a = X - N;
int b = Y - N;
cout << modcom(N, a) << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
//-------------------- Modulo --------------------//
#define MOD (1000000007LL)
#define SIZE (1000000LL)
long long fac[SIZE + 1];
long long inv[SIZE + 1];
long long finv[SIZE + 1];
void modinit(void) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i <= SIZE; ++i) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
long long modcom(long long n, long long k) {
assert(n >= k);
assert(n <= SIZE);
assert(k <= SIZE);
return fac[n] * finv[n - k] % MOD * finv[k] % MOD;
}
//-------------------- Modulo --------------------//
int main() {
modinit();
int X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
int N = (X + Y) / 3;
int a = X - N;
int b = Y - N;
if (a < 0 or b < 0) {
cout << 0 << endl;
return 0;
}
cout << modcom(N, a) << endl;
return 0;
}
| insert | 69 | 69 | 69 | 74 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
const int maxn = 1e6 + 7;
ll fac[maxn];
ll inv[maxn];
ll C(int m, int n) {
if (m > n)
return -1;
return fac[n] * inv[m] % mod * inv[n - m] % mod;
}
ll quick_mod(ll a, ll m) {
ll tmp = a % mod;
ll ans = 1;
while (m) {
if (m & 1)
ans = ans * tmp % mod;
tmp = tmp * tmp % mod;
m >>= 1;
}
return ans;
}
void init() {
fac[0] = 1;
for (int i = 1; i < maxn; i++)
fac[i] = (fac[i - 1] * i) % mod;
inv[maxn - 1] = quick_mod(fac[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; i--)
inv[i] = (inv[i + 1] * (i + 1)) % mod;
}
int main() {
init();
int x, y;
scanf("%d %d", &x, &y);
if ((x + y) % 3 != 0)
printf("0\n");
else {
ll t = (x + y) / 3;
ll k1 = x - t;
ll k2 = y - t;
printf("%lld\n", C(k1, k1 + k2));
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll mod = 1e9 + 7;
const int maxn = 1e6 + 7;
ll fac[maxn];
ll inv[maxn];
ll C(int m, int n) {
if (m > n)
return -1;
return fac[n] * inv[m] % mod * inv[n - m] % mod;
}
ll quick_mod(ll a, ll m) {
ll tmp = a % mod;
ll ans = 1;
while (m) {
if (m & 1)
ans = ans * tmp % mod;
tmp = tmp * tmp % mod;
m >>= 1;
}
return ans;
}
void init() {
fac[0] = 1;
for (int i = 1; i < maxn; i++)
fac[i] = (fac[i - 1] * i) % mod;
inv[maxn - 1] = quick_mod(fac[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; i--)
inv[i] = (inv[i + 1] * (i + 1)) % mod;
}
int main() {
init();
int x, y;
scanf("%d %d", &x, &y);
if ((x + y) % 3 != 0)
printf("0\n");
else {
ll t = (x + y) / 3;
ll k1 = x - t;
ll k2 = y - t;
if (x * 2 >= y && y * 2 >= x)
printf("%lld\n", C(k1, k1 + k2));
else
printf("0\n");
}
return 0;
}
| replace | 42 | 43 | 42 | 46 | 0 | |
p02862 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 1e6 + 5;
int x, y;
ll fac[N], inv[N];
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % MOD;
}
a = a * a % MOD;
b >>= 1;
}
return res;
}
void init() {
fac[0] = 1;
for (int i = 1; i < N; ++i) {
fac[i] = fac[i - 1] * i % MOD;
}
inv[N - 1] = power(fac[N - 1], MOD - 2);
for (int i = N - 2; i >= 0; --i) {
inv[i] = inv[i + 1] * (i + 1) % MOD;
}
}
ll C(ll a, ll b) { return fac[a] * inv[b] % MOD * inv[a - b] % MOD; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
init();
cin >> x >> y;
int sum = x + y;
if (sum % 3) {
cout << 0 << endl;
} else {
int cnt = sum / 3;
int two = x - cnt;
ll res = C(cnt, two);
cout << res << endl;
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 1e6 + 5;
int x, y;
ll fac[N], inv[N];
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % MOD;
}
a = a * a % MOD;
b >>= 1;
}
return res;
}
void init() {
fac[0] = 1;
for (int i = 1; i < N; ++i) {
fac[i] = fac[i - 1] * i % MOD;
}
inv[N - 1] = power(fac[N - 1], MOD - 2);
for (int i = N - 2; i >= 0; --i) {
inv[i] = inv[i + 1] * (i + 1) % MOD;
}
}
ll C(ll a, ll b) { return fac[a] * inv[b] % MOD * inv[a - b] % MOD; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
init();
cin >> x >> y;
int sum = x + y;
if (sum % 3) {
cout << 0 << endl;
} else {
int cnt = sum / 3;
int two = x - cnt;
if (two < 0 || two > cnt) {
cout << 0 << endl;
exit(0);
}
ll res = C(cnt, two);
cout << res << endl;
}
return 0;
}
| insert | 47 | 47 | 47 | 51 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define debug(x) \
do { \
cerr << #x << ": " << x << "\n"; \
} while (0)
#define debugv(x) \
do { \
cerr << #x << ": "; \
for (auto &e : (x)) \
cerr << e << " "; \
cerr << "\n"; \
} while (0)
#define fori(i, n) for (int i = 0; i < (int)(n); ++i)
#define forn(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n); i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define RETURN(x) \
do { \
cout << x << '\n'; \
return 0; \
} while (0)
#define FIRSTWIN \
do { \
cout << "Monocarp\n"; \
return 0; \
} while (0)
#define SECONDWIN \
do { \
cout << "Bicarp\n"; \
return 0; \
} while (0)
const int MAXN = 2e6 + 4;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 1;
int x, y;
int fact[MAXN], inv[MAXN], ifact[MAXN];
template <typename T, typename T1> T mod(T x, T1 p) {
x %= p;
if (x < 0)
x += p;
return x;
}
template <typename T> T inverse(T x, T p) {
x = mod(x, p);
if (x == 1)
return x;
return mod((1LL * (-p / x) * (inv[p % x] % p)), p);
// Since inverse of p % x is already calculated.
}
int NcR(int n, int r) {
int ret = (1LL * ifact[n - r] * ifact[r]) % MOD;
ret = (1LL * ret * fact[n]) % MOD;
return ret;
}
int main() {
#ifdef OJ
freopen("input.txt", "rt", stdin);
// freopen("output.txt", "wt", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
fact[0] = 1;
for (int i = 1; i < MAXN; i++) {
fact[i] = 1LL * fact[i - 1] * i % MOD;
}
ifact[0] = 1;
for (int i = 1; i < MAXN; i++) {
inv[i] = inverse(i, MOD);
ifact[i] = 1LL * ifact[i - 1] * inv[i] % MOD;
}
cin >> x >> y;
if ((2 * x - y) % 3)
RETURN(0);
if ((2 * y - x) % 3)
RETURN(0);
int a = (2 * x - y) / 3;
int b = (2 * y - x) / 3;
cout << NcR(a + b, a) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define se second
#define debug(x) \
do { \
cerr << #x << ": " << x << "\n"; \
} while (0)
#define debugv(x) \
do { \
cerr << #x << ": "; \
for (auto &e : (x)) \
cerr << e << " "; \
cerr << "\n"; \
} while (0)
#define fori(i, n) for (int i = 0; i < (int)(n); ++i)
#define forn(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n); i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define RETURN(x) \
do { \
cout << x << '\n'; \
return 0; \
} while (0)
#define FIRSTWIN \
do { \
cout << "Monocarp\n"; \
return 0; \
} while (0)
#define SECONDWIN \
do { \
cout << "Bicarp\n"; \
return 0; \
} while (0)
const int MAXN = 2e6 + 4;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 1;
int x, y;
int fact[MAXN], inv[MAXN], ifact[MAXN];
template <typename T, typename T1> T mod(T x, T1 p) {
x %= p;
if (x < 0)
x += p;
return x;
}
template <typename T> T inverse(T x, T p) {
x = mod(x, p);
if (x == 1)
return x;
return mod((1LL * (-p / x) * (inv[p % x] % p)), p);
// Since inverse of p % x is already calculated.
}
int NcR(int n, int r) {
int ret = (1LL * ifact[n - r] * ifact[r]) % MOD;
ret = (1LL * ret * fact[n]) % MOD;
return ret;
}
int main() {
#ifdef OJ
freopen("input.txt", "rt", stdin);
// freopen("output.txt", "wt", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);
fact[0] = 1;
for (int i = 1; i < MAXN; i++) {
fact[i] = 1LL * fact[i - 1] * i % MOD;
}
ifact[0] = 1;
for (int i = 1; i < MAXN; i++) {
inv[i] = inverse(i, MOD);
ifact[i] = 1LL * ifact[i - 1] * inv[i] % MOD;
}
cin >> x >> y;
if ((2 * x - y) % 3)
RETURN(0);
if ((2 * y - x) % 3)
RETURN(0);
int a = (2 * x - y) / 3;
int b = (2 * y - x) / 3;
if (a < 0 || b < 0)
RETURN(0);
cout << NcR(a + b, a) << endl;
return 0;
}
| insert | 98 | 98 | 98 | 100 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = INT_MAX;
constexpr ll L_INF = LLONG_MAX;
//===
constexpr int64_t MOD = static_cast<int64_t>(1e9 + 7);
// ModInt
//
// 宣言:
// ModInt<1000000007> mi;
// ModInt<1000000007> mi(917856986);
//
template <std::int_fast64_t Modulus> class ModInt {
using i64 = std::int_fast64_t;
public:
i64 a;
constexpr ModInt(const i64 x = 0) noexcept : a(x % Modulus) {}
constexpr i64 &value() noexcept { return a; }
constexpr const i64 &value() const noexcept { return a; }
constexpr ModInt operator+(const ModInt &rhs) const noexcept {
return ModInt(*this) += rhs;
}
constexpr ModInt operator-(const ModInt &rhs) const noexcept {
return ModInt(*this) -= rhs;
}
constexpr ModInt operator*(const ModInt &rhs) const noexcept {
return ModInt(*this) *= rhs;
}
constexpr ModInt operator/(const ModInt &rhs) const noexcept {
return ModInt(*this) /= rhs;
}
constexpr ModInt &operator+=(const ModInt rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr ModInt &operator-=(const ModInt rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr ModInt &operator*=(const ModInt rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr ModInt &operator/=(ModInt rhs) noexcept {
i64 exp = Modulus - 2;
while (exp) {
if (exp & 1) {
*this *= rhs;
}
rhs *= rhs;
exp >>= 1;
}
return *this;
}
constexpr ModInt &operator++() noexcept {
*this += 1;
return *this;
}
constexpr ModInt operator++(int) noexcept {
ModInt res = *this;
*this += 1;
return res;
}
constexpr ModInt &operator--() noexcept {
*this -= 1;
return *this;
}
constexpr ModInt operator--(int) noexcept {
ModInt res = *this;
*this -= 1;
return res;
}
constexpr bool operator<(const ModInt &rhs) const noexcept {
return a < rhs.a;
}
constexpr bool operator>(const ModInt &rhs) const noexcept {
return a > rhs.a;
}
constexpr bool operator<=(const ModInt &rhs) const noexcept {
return a <= rhs.a;
}
constexpr bool operator>=(const ModInt &rhs) const noexcept {
return a >= rhs.a;
}
constexpr bool operator==(const ModInt &rhs) const noexcept {
return a == rhs.a;
}
constexpr ModInt pow(i64 k) const noexcept {
ModInt res = 1;
ModInt tmp = *this;
for (; k > 0; k >>= 1) {
if (k & 1)
res *= tmp;
tmp *= tmp;
}
return res;
}
constexpr ModInt inverse() const noexcept {
i64 q = a;
i64 b = Modulus, u = 1, v = 0;
while (b) {
i64 t = q / b;
q -= t * b;
swap(q, b);
u -= t * v;
swap(u, v);
}
u %= Modulus;
if (u < 0)
u += Modulus;
return u;
}
};
// 二項係数(mod)
// 要ModInt
template <std::int_fast64_t Modulus> class ModComb {
using i64 = int_fast64_t;
using Vl = std::vector<i64>;
private:
Vl fac, inv, finv;
public:
ModComb(i64 n) : fac(n + 1), inv(n + 1), finv(n + 1) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (i64 i = 2; i < n + 1; ++i) {
fac[i] = fac[i - 1] * i % Modulus;
inv[i] = Modulus - inv[Modulus % i] * (Modulus / i) % Modulus;
finv[i] = finv[i - 1] * inv[i] % Modulus;
}
}
ModInt<Modulus> comb(i64 n, i64 k) {
ModInt<Modulus> res;
if (n < k)
res = 0;
else if (n < 0 || k < 0)
res = 0;
else
res = fac[n] * (finv[n - k] * finv[k] % Modulus) % Modulus;
return res;
}
ModInt<Modulus> get_fac(i64 n) { return ModInt<Modulus>(fac[n]); }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
int n1, n2;
int n;
n2 = (2 * x - y) / 3;
n1 = (x + y) / 3 - n2;
n = n1 + n2;
ModComb<MOD> mc(n);
ModInt<MOD> ans;
ans = mc.get_fac(n) / (mc.get_fac(n1) * mc.get_fac(n2));
cout << ans.value() << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
using Vi = vector<int>;
using Vl = vector<ll>;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;
constexpr int I_INF = INT_MAX;
constexpr ll L_INF = LLONG_MAX;
//===
constexpr int64_t MOD = static_cast<int64_t>(1e9 + 7);
// ModInt
//
// 宣言:
// ModInt<1000000007> mi;
// ModInt<1000000007> mi(917856986);
//
template <std::int_fast64_t Modulus> class ModInt {
using i64 = std::int_fast64_t;
public:
i64 a;
constexpr ModInt(const i64 x = 0) noexcept : a(x % Modulus) {}
constexpr i64 &value() noexcept { return a; }
constexpr const i64 &value() const noexcept { return a; }
constexpr ModInt operator+(const ModInt &rhs) const noexcept {
return ModInt(*this) += rhs;
}
constexpr ModInt operator-(const ModInt &rhs) const noexcept {
return ModInt(*this) -= rhs;
}
constexpr ModInt operator*(const ModInt &rhs) const noexcept {
return ModInt(*this) *= rhs;
}
constexpr ModInt operator/(const ModInt &rhs) const noexcept {
return ModInt(*this) /= rhs;
}
constexpr ModInt &operator+=(const ModInt rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr ModInt &operator-=(const ModInt rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr ModInt &operator*=(const ModInt rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr ModInt &operator/=(ModInt rhs) noexcept {
i64 exp = Modulus - 2;
while (exp) {
if (exp & 1) {
*this *= rhs;
}
rhs *= rhs;
exp >>= 1;
}
return *this;
}
constexpr ModInt &operator++() noexcept {
*this += 1;
return *this;
}
constexpr ModInt operator++(int) noexcept {
ModInt res = *this;
*this += 1;
return res;
}
constexpr ModInt &operator--() noexcept {
*this -= 1;
return *this;
}
constexpr ModInt operator--(int) noexcept {
ModInt res = *this;
*this -= 1;
return res;
}
constexpr bool operator<(const ModInt &rhs) const noexcept {
return a < rhs.a;
}
constexpr bool operator>(const ModInt &rhs) const noexcept {
return a > rhs.a;
}
constexpr bool operator<=(const ModInt &rhs) const noexcept {
return a <= rhs.a;
}
constexpr bool operator>=(const ModInt &rhs) const noexcept {
return a >= rhs.a;
}
constexpr bool operator==(const ModInt &rhs) const noexcept {
return a == rhs.a;
}
constexpr ModInt pow(i64 k) const noexcept {
ModInt res = 1;
ModInt tmp = *this;
for (; k > 0; k >>= 1) {
if (k & 1)
res *= tmp;
tmp *= tmp;
}
return res;
}
constexpr ModInt inverse() const noexcept {
i64 q = a;
i64 b = Modulus, u = 1, v = 0;
while (b) {
i64 t = q / b;
q -= t * b;
swap(q, b);
u -= t * v;
swap(u, v);
}
u %= Modulus;
if (u < 0)
u += Modulus;
return u;
}
};
// 二項係数(mod)
// 要ModInt
template <std::int_fast64_t Modulus> class ModComb {
using i64 = int_fast64_t;
using Vl = std::vector<i64>;
private:
Vl fac, inv, finv;
public:
ModComb(i64 n) : fac(n + 1), inv(n + 1), finv(n + 1) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (i64 i = 2; i < n + 1; ++i) {
fac[i] = fac[i - 1] * i % Modulus;
inv[i] = Modulus - inv[Modulus % i] * (Modulus / i) % Modulus;
finv[i] = finv[i - 1] * inv[i] % Modulus;
}
}
ModInt<Modulus> comb(i64 n, i64 k) {
ModInt<Modulus> res;
if (n < k)
res = 0;
else if (n < 0 || k < 0)
res = 0;
else
res = fac[n] * (finv[n - k] * finv[k] % Modulus) % Modulus;
return res;
}
ModInt<Modulus> get_fac(i64 n) { return ModInt<Modulus>(fac[n]); }
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
int n1, n2;
int n;
n2 = (2 * x - y) / 3;
n1 = (x + y) / 3 - n2;
if (min(n1, n2) < 0) {
cout << 0 << endl;
return 0;
}
n = n1 + n2;
ModComb<MOD> mc(n);
ModInt<MOD> ans;
ans = mc.get_fac(n) / (mc.get_fac(n1) * mc.get_fac(n2));
cout << ans.value() << endl;
return 0;
} | insert | 192 | 192 | 192 | 198 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
#define itn int
#define co(ans) cout << ans << endl;
#define COYE cout << "YES" << endl;
#define COYe cout << "Yes" << endl;
#define COye cout << "yes" << endl;
#define CONO cout << "NO" << endl;
#define CONo cout << "No" << endl;
#define COno cout << "no" << endl;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR(i, 1, n)
#define SORT(V) sort((V).begin(), (V).end())
#define REVERSE(V) reverse((V).begin(), (V).end())
#define INF ((1LL << 62) - (1LL << 31))
#define MOD 1000000007
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 namespace std;
const ll MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll X, Y;
cin >> X >> Y;
bool CAN = true;
COMinit();
if (Y > 2 * X || X > 2 * Y)
CAN = false;
if ((X + Y) % 3 != 0)
CAN = false;
if (CAN) {
co(COM((X + Y) / 3, X - (X + Y) / 3) % MOD);
return 0;
}
co(0);
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <bitset>
#include <cmath>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
#define ll long long
#define itn int
#define co(ans) cout << ans << endl;
#define COYE cout << "YES" << endl;
#define COYe cout << "Yes" << endl;
#define COye cout << "yes" << endl;
#define CONO cout << "NO" << endl;
#define CONo cout << "No" << endl;
#define COno cout << "no" << endl;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR(i, 1, n)
#define SORT(V) sort((V).begin(), (V).end())
#define REVERSE(V) reverse((V).begin(), (V).end())
#define INF ((1LL << 62) - (1LL << 31))
#define MOD 1000000007
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 namespace std;
const ll MAX = 5100000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll X, Y;
cin >> X >> Y;
bool CAN = true;
COMinit();
if (Y > 2 * X || X > 2 * Y)
CAN = false;
if ((X + Y) % 3 != 0)
CAN = false;
if (CAN) {
co(COM((X + Y) / 3, X - (X + Y) / 3) % MOD);
return 0;
}
co(0);
return 0;
} | replace | 41 | 42 | 41 | 42 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const ll MOD = 1e9 + 7;
const int INF32 = 1 << 30;
const ll INF64 = 1LL << 60;
const int N = 1e6 + 10;
const ll mod = 1e9 + 7;
ll fac[N];
ll binpow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void init() {
fac[0] = 1;
for (ll i = 1; i < N; i++)
fac[i] = fac[i - 1] * i % mod;
}
ll inv(ll a) { return binpow(a, mod - 2); }
ll A(ll n, ll m) { return fac[n] * inv(fac[n - m]) % mod; }
ll C(ll n, ll m) { return fac[n] * inv(fac[m]) % mod * inv(fac[n - m]) % mod; }
void solve() {
ll x, y;
cin >> x >> y;
if (y > x)
swap(x, y);
ll j = x - y;
if ((y - j) % 3) {
cout << 0;
return;
}
ll k = (y - j) / 3;
ll k2 = k + j;
init();
cout << A(k + k2, k + k2) * inv(A(k, k) * A(k2, k2) % mod) % mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
} | #include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define watch(x) cout << (#x) << " is " << (x) << endl
#define debug cout << "hi" << endl
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const ll MOD = 1e9 + 7;
const int INF32 = 1 << 30;
const ll INF64 = 1LL << 60;
const int N = 1e6 + 10;
const ll mod = 1e9 + 7;
ll fac[N];
ll binpow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void init() {
fac[0] = 1;
for (ll i = 1; i < N; i++)
fac[i] = fac[i - 1] * i % mod;
}
ll inv(ll a) { return binpow(a, mod - 2); }
ll A(ll n, ll m) { return fac[n] * inv(fac[n - m]) % mod; }
ll C(ll n, ll m) { return fac[n] * inv(fac[m]) % mod * inv(fac[n - m]) % mod; }
void solve() {
ll x, y;
cin >> x >> y;
if (y > x)
swap(x, y);
ll j = x - y;
if ((y - j) % 3 || y - j < 0) {
cout << 0;
return;
}
ll k = (y - j) / 3;
ll k2 = k + j;
init();
cout << A(k + k2, k + k2) * inv(A(k, k) * A(k2, k2) % mod) % mod;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
solve();
return 0;
} | replace | 48 | 49 | 48 | 49 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
long long f[1000000], rf[1000000];
long long mod = 1000000007;
long long inv(long long x) {
long long res = 1;
long long k = mod - 2;
long long y = x;
while (k) {
if (k & 1)
res = (res * y) % mod;
y = (y * y) % mod;
k /= 2;
}
return res;
}
void init() {
f[0] = 1;
for (int i = 1; i < 1000000; i++)
f[i] = (f[i - 1] * i) % mod;
for (int i = 0; i < 1000000; i++)
rf[i] = inv(f[i]);
}
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
// 到達不能
cout << 0 << endl;
return 0;
}
init();
long long n = (x + y) / 3;
long long k = x - n;
if (k < 0) {
cout << 0 << endl;
return 0;
}
long long a = f[n];
long long b = rf[n - k];
long long c = rf[k];
long long bc = (b * c) % mod;
cout << ((a * bc) % mod) << endl;
return 0;
} | #include <algorithm>
#include <cstring>
#include <iostream>
#include <vector>
using namespace std;
long long f[1000000], rf[1000000];
long long mod = 1000000007;
long long inv(long long x) {
long long res = 1;
long long k = mod - 2;
long long y = x;
while (k) {
if (k & 1)
res = (res * y) % mod;
y = (y * y) % mod;
k /= 2;
}
return res;
}
void init() {
f[0] = 1;
for (int i = 1; i < 1000000; i++)
f[i] = (f[i - 1] * i) % mod;
for (int i = 0; i < 1000000; i++)
rf[i] = inv(f[i]);
}
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
// 到達不能
cout << 0 << endl;
return 0;
}
init();
long long n = (x + y) / 3;
long long k = x - n;
if (k < 0 || n - k < 0) {
cout << 0 << endl;
return 0;
}
long long a = f[n];
long long b = rf[n - k];
long long c = rf[k];
long long bc = (b * c) % mod;
cout << ((a * bc) % mod) << endl;
return 0;
} | replace | 41 | 42 | 41 | 42 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<string>> vvs;
typedef vector<vector<char>> vvc;
typedef vector<vector<bool>> vvb;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define vrep(v, n) \
for (int i = 0; i < n; i++) { \
cin >> v.at(i); \
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srepn(i, l, n) for (int i = l; i <= (int)(n); i++)
#define pb push_back
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const int mod = 1000000007;
const int inf = 1e9;
#define PI 3.14159265369;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int ddx[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int ddy[8] = {0, 1, -1, 0, 1, -1, 1, -1};
ll fac[1000007], inv[1000007], finv[1000007];
void settable() {
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i <= 1000000; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll com(ll n, ll k) { return ((fac[n] * finv[k]) % mod) * finv[n - k] % mod; }
int main() {
settable();
ll x, y;
cin >> x >> y;
if (x < y)
swap(x, y);
if ((2 * y - x) % 3 != 0 || 2 * y - x < 0) {
cout << 0 << endl;
return 0;
} else {
cout << com(y - x / 3, x / 3) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<ll> vll;
typedef vector<vector<int>> vvi;
typedef vector<vector<string>> vvs;
typedef vector<vector<char>> vvc;
typedef vector<vector<bool>> vvb;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
#define vrep(v, n) \
for (int i = 0; i < n; i++) { \
cin >> v.at(i); \
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srepn(i, l, n) for (int i = l; i <= (int)(n); i++)
#define pb push_back
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const int mod = 1000000007;
const int inf = 1e9;
#define PI 3.14159265369;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int ddx[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int ddy[8] = {0, 1, -1, 0, 1, -1, 1, -1};
ll fac[1000007], inv[1000007], finv[1000007];
void settable() {
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i <= 1000000; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll com(ll n, ll k) { return ((fac[n] * finv[k]) % mod) * finv[n - k] % mod; }
int main() {
settable();
ll x, y;
cin >> x >> y;
if (x < y)
swap(x, y);
if ((2 * y - x) % 3 != 0 || 2 * y - x < 0) {
cout << 0 << endl;
return 0;
} else {
cout << com((x + y) / 3, (2 * y - x) / 3) << endl;
}
}
| replace | 71 | 72 | 71 | 72 | 0 | |
p02862 | C++ | Runtime Error | #include <iostream>
#include <vector>
#define MOD 1000000007
using namespace std;
int X, Y;
uint64_t mod_power(uint64_t x, uint64_t y) {
uint64_t result = 1;
while (y > 0) {
if (y & 1) {
result = (result * x) % MOD;
}
y = y >> 1;
x = (x * x) % MOD;
}
return result;
}
uint64_t mod_inverse(uint64_t x) { return mod_power(x, MOD - 2); }
uint64_t comb(int n, int r) {
if (r == 0) {
return 1;
}
vector<uint64_t> f(n + 1, 0);
f[0] = 1;
for (int i = 1; i <= n; ++i) {
f[i] = (i * f[i - 1]) % MOD;
}
return (f[n] * mod_inverse(f[r]) % MOD * mod_inverse(f[n - r]) % MOD) % MOD;
}
int solve() {
if (X == 0) {
return (Y % 4 == 0) ? 1 : 0;
}
if (Y == 0) {
return (X % 4 == 0) ? 1 : 0;
}
if ((2 * X - Y) % 3 != 0 || (2 * Y - X) % 3 != 0) {
return 0;
}
int a = (2 * X - Y) / 3;
int b = (2 * Y - X) / 3;
return comb(a + b, a);
}
int main() {
cin >> X >> Y;
cout << solve() << endl;
return 0;
} | #include <iostream>
#include <vector>
#define MOD 1000000007
using namespace std;
int X, Y;
uint64_t mod_power(uint64_t x, uint64_t y) {
uint64_t result = 1;
while (y > 0) {
if (y & 1) {
result = (result * x) % MOD;
}
y = y >> 1;
x = (x * x) % MOD;
}
return result;
}
uint64_t mod_inverse(uint64_t x) { return mod_power(x, MOD - 2); }
uint64_t comb(int n, int r) {
if (r == 0) {
return 1;
}
vector<uint64_t> f(n + 1, 0);
f[0] = 1;
for (int i = 1; i <= n; ++i) {
f[i] = (i * f[i - 1]) % MOD;
}
return (f[n] * mod_inverse(f[r]) % MOD * mod_inverse(f[n - r]) % MOD) % MOD;
}
int solve() {
if ((2 * X - Y) % 3 != 0 || (2 * Y - X) % 3 != 0 || 2 * X - Y < 0 ||
2 * Y - X < 0) {
return 0;
}
int a = (2 * X - Y) / 3;
int b = (2 * Y - X) / 3;
return comb(a + b, a);
}
int main() {
cin >> X >> Y;
cout << solve() << endl;
return 0;
} | replace | 41 | 50 | 41 | 43 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
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 % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int abs(int a) { return a < 0 ? -a : a; }
void swap(int *a, int *b) {
int c = *a;
*a = *b;
*b = c;
}
int main() {
COMinit();
int x, y;
cin >> x >> y;
if (x < y)
swap(&x, &y);
if ((x + y) % 3 != 0) {
cout << 0;
return 0;
}
int cy = ((x + y) / 3), cx = (x - cy);
cout << COM(cy, cx) << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
const int MAX = 10000000;
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int abs(int a) { return a < 0 ? -a : a; }
void swap(int *a, int *b) {
int c = *a;
*a = *b;
*b = c;
}
int main() {
COMinit();
int x, y;
cin >> x >> y;
if (x < y)
swap(&x, &y);
if ((x + y) % 3 != 0) {
cout << 0;
return 0;
}
int cy = ((x + y) / 3), cx = (x - cy);
cout << COM(cy, cx) << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); \
i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) for (i64 i = 1; i <= n; ++i)
#define RREP(i, n) for (i64 i = n - 1; i >= 0; --i)
#define RREPS(i, n) for (i64 i = n; i >= 1; --i)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define pb push_back
#define mp make_pair
#define F first
#define S second
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;
}
template <typename C> i64 SIZE(const C &c) {
return static_cast<i64>(c.size());
}
template <typename T, size_t N> i64 SIZE(const T (&)[N]) {
return static_cast<i64>(N);
}
struct ProconInit {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
ProconInit() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} PROCON_INIT;
template <int MOD> struct Fp {
i64 val;
constexpr Fp(i64 v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
i64 a = r.val, b = MOD, u = 1, v = 0;
while (b) {
i64 t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
constexpr bool operator>(const Fp &r) const noexcept {
return this->val > r.val;
}
constexpr bool operator>=(const Fp &r) const noexcept {
return this->val >= r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, i64 n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
#define MAX_X 1'000'000
#define MAX_Y 1'000'000
#define MOD 1'000'000'007
i64 X, Y;
i64 dx[] = {1, 2};
i64 dy[] = {2, 1};
// a + 2b = X
// 2a + b = Y
// a = X - 2b
// 2(X - 2b) + b = Y
// 2X - 3b = Y
// b = (2X - Y) / 3
// a = -X/3 + 2Y/3
using mint = Fp<MOD>;
mint fact[3 * MAX_X];
mint modfact(i64 n) {
if (fact[n] > (mint)0)
return fact[n];
mint p = 1;
REPS(i, n) {
p *= (mint)i;
fact[i] = p;
}
return fact[n] = p;
}
mint modcomb(i64 n, i64 k) {
if (n < k)
return (mint)0;
return modfact(n) / (modfact(k) * modfact(n - k));
}
void solve() {
fill(fact, fact + 3 * MAX_X, 0);
i64 a = (2 * Y - X) / 3;
i64 b = (2 * X - Y) / 3;
i64 x = a * dx[0] + b * dx[1];
i64 y = a * dy[0] + b * dy[1];
if (x != X || y != Y) {
cout << 0 << endl;
return;
}
mint ans = modcomb(a + b, a);
cout << ans << endl;
}
int main() {
cin >> X >> Y;
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define CPP_STR(x) CPP_STR_I(x)
#define CPP_CAT(x, y) CPP_CAT_I(x, y)
#define CPP_STR_I(args...) #args
#define CPP_CAT_I(x, y) x##y
using i8 = int8_t;
using u8 = uint8_t;
using i16 = int16_t;
using u16 = uint16_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f32 = float;
using f64 = double;
#define FOR(i, start, end) \
for (i64 i = (start), CPP_CAT(i, xxxx_end) = (end); \
i < CPP_CAT(i, xxxx_end); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) for (i64 i = 1; i <= n; ++i)
#define RREP(i, n) for (i64 i = n - 1; i >= 0; --i)
#define RREPS(i, n) for (i64 i = n; i >= 1; --i)
#define ALL(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(std::begin(cccc), std::end(cccc), ##__VA_ARGS__); \
})(c))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define pb push_back
#define mp make_pair
#define F first
#define S second
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;
}
template <typename C> i64 SIZE(const C &c) {
return static_cast<i64>(c.size());
}
template <typename T, size_t N> i64 SIZE(const T (&)[N]) {
return static_cast<i64>(N);
}
struct ProconInit {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
ProconInit() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} PROCON_INIT;
template <int MOD> struct Fp {
i64 val;
constexpr Fp(i64 v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
i64 a = r.val, b = MOD, u = 1, v = 0;
while (b) {
i64 t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
constexpr bool operator>(const Fp &r) const noexcept {
return this->val > r.val;
}
constexpr bool operator>=(const Fp &r) const noexcept {
return this->val >= r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, i64 n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
#define MAX_X 1'000'000
#define MAX_Y 1'000'000
#define MOD 1'000'000'007
i64 X, Y;
i64 dx[] = {1, 2};
i64 dy[] = {2, 1};
// a + 2b = X
// 2a + b = Y
// a = X - 2b
// 2(X - 2b) + b = Y
// 2X - 3b = Y
// b = (2X - Y) / 3
// a = -X/3 + 2Y/3
using mint = Fp<MOD>;
mint fact[3 * MAX_X];
mint modfact(i64 n) {
if (fact[n] > (mint)0)
return fact[n];
mint p = 1;
REPS(i, n) {
p *= (mint)i;
fact[i] = p;
}
return fact[n] = p;
}
mint modcomb(i64 n, i64 k) {
if (n < k)
return (mint)0;
return modfact(n) / (modfact(k) * modfact(n - k));
}
void solve() {
fill(fact, fact + 3 * MAX_X, 0);
i64 a = (2 * Y - X) / 3;
i64 b = (2 * X - Y) / 3;
i64 x = a * dx[0] + b * dx[1];
i64 y = a * dy[0] + b * dy[1];
if (x != X || y != Y) {
cout << 0 << endl;
return;
}
mint ans;
if (a < 0 || b < 0) {
ans = 0;
} else {
ans = modcomb(a + b, a);
}
cout << ans << endl;
}
int main() {
cin >> X >> Y;
solve();
return 0;
} | replace | 194 | 195 | 194 | 200 | 0 | |
p02862 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long X, Y;
cin >> X >> Y;
if ((X + Y) % 3)
return 0 & puts("0");
{
unsigned long k{(X + Y) / 3};
X -= k;
Y -= k;
}
unsigned long N{X + Y}, d{1}, n{1};
constexpr unsigned long MOD = 1000000007;
for (unsigned long i = 0, j = N; i < X;) {
(d *= j--) %= MOD;
(n *= ++i) %= MOD;
}
unsigned long a{MOD - 2};
while (a) {
if (a & 1)
(d *= n) %= MOD;
(n *= n) %= MOD;
a >>= 1;
}
cout << d << endl;
return 0;
} | #include <bits/stdc++.h>
int main() {
using namespace std;
unsigned long X, Y;
cin >> X >> Y;
if ((X + Y) % 3)
return 0 & puts("0");
{
unsigned long k{(X + Y) / 3};
if (X < k || Y < k)
return 0 & puts("0");
X -= k;
Y -= k;
}
unsigned long N{X + Y}, d{1}, n{1};
constexpr unsigned long MOD = 1000000007;
for (unsigned long i = 0, j = N; i < X;) {
(d *= j--) %= MOD;
(n *= ++i) %= MOD;
}
unsigned long a{MOD - 2};
while (a) {
if (a & 1)
(d *= n) %= MOD;
(n *= n) %= MOD;
a >>= 1;
}
cout << d << endl;
return 0;
} | insert | 10 | 10 | 10 | 12 | TLE | |
p02862 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef int64_t ll;
typedef vector<int64_t> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll, ll> P;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<vd> vvd;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SIZE(a) int((a).size())
const int MAX = 1000010;
const int MOD = 1000000007;
ll 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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll x, y;
cin >> x >> y;
ll s, t;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
} else {
t = (x * 2 - y) / 3;
s = x - s * 2;
if (s < 0 || t < 0) {
cout << 0 << endl;
} else {
COMinit();
cout << COM(s + t, max(s, t)) << endl;
}
}
} | #include "bits/stdc++.h"
using namespace std;
typedef int64_t ll;
typedef vector<int64_t> vll;
typedef vector<vll> vvll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<int> vin;
typedef pair<ll, ll> P;
typedef vector<P> vp;
typedef vector<double> vd;
typedef vector<vd> vvd;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SIZE(a) int((a).size())
const int MAX = 1000010;
const int MOD = 1000000007;
ll 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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll x, y;
cin >> x >> y;
ll s, t;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
} else {
t = (x * 2 - y) / 3;
s = x - t * 2;
if (s < 0 || t < 0) {
cout << 0 << endl;
} else {
COMinit();
cout << COM(s + t, max(s, t)) << endl;
}
}
} | replace | 44 | 45 | 44 | 45 | 0 | |
p02862 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int int64_t
#define mp make_pair
#define f first
#define s second
#define mod 1000 * 1000 * 1000 + 7
int dp[1000001];
int power(int a, int b) {
int ans = 1;
while (b > 0) {
if (b & 1) {
ans *= a;
ans %= mod;
b--;
}
b /= 2;
a *= a;
a %= mod;
}
return ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
dp[0] = 1;
for (int i = 1; i <= 1e6; i++) {
dp[i] = dp[i - 1] * i;
dp[i] %= mod;
}
int a, b;
cin >> a >> b;
if ((a + b) % 3 != 0 || max(a, b) > 2 * min(a, b)) {
cout << "0\n";
} else {
int x = min(a, b);
int y = max(a, b);
int diff = 2 * x - y;
diff /= 2;
int moves = (x + y);
moves /= 3;
// cout<<moves<<" "<<diff<<"\n";
diff = moves / 2;
diff -= (y - x);
int ans = dp[moves];
ans *= power(dp[diff], mod - 2);
ans %= mod;
ans *= power(dp[moves - diff], mod - 2);
ans %= mod;
cout << ans << "\n";
}
return 0;
}
| #include "bits/stdc++.h"
using namespace std;
#define int int64_t
#define mp make_pair
#define f first
#define s second
#define mod 1000 * 1000 * 1000 + 7
int dp[1000001];
int power(int a, int b) {
int ans = 1;
while (b > 0) {
if (b & 1) {
ans *= a;
ans %= mod;
b--;
}
b /= 2;
a *= a;
a %= mod;
}
return ans;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
dp[0] = 1;
for (int i = 1; i <= 1e6; i++) {
dp[i] = dp[i - 1] * i;
dp[i] %= mod;
}
int a, b;
cin >> a >> b;
if ((a + b) % 3 != 0 || max(a, b) > 2 * min(a, b)) {
cout << "0\n";
} else {
int x = min(a, b);
int y = max(a, b);
int diff = 2 * x - y;
diff /= 2;
int moves = (x + y);
moves /= 3;
// cout<<moves<<" "<<diff<<"\n";
diff = moves - (y - x);
diff /= 2;
int ans = dp[moves];
ans *= power(dp[diff], mod - 2);
ans %= mod;
ans *= power(dp[moves - diff], mod - 2);
ans %= mod;
cout << ans << "\n";
}
return 0;
}
| replace | 42 | 44 | 42 | 44 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int frac(int n) {
if (!n)
return 1;
int64_t ret = (int64_t)n * frac(n - 1);
return ret % mod;
}
int modinv(int i) {
int64_t x = 1, y = 0, z = 0, w = 1;
int m = mod;
while (m > 0) {
int q = i / m, r = i % m;
int64_t temp1 = x, temp2 = y;
x = z;
z = temp1 - q * z;
y = w;
w = temp2 - q * w;
i = m;
m = r;
}
while (x < 0)
x += mod;
return x;
}
int comb(int n, int i) {
int a = frac(n), b = frac(i), c = frac(n - i);
int d = (int64_t)b * c % mod;
int ret = (int64_t)a * modinv(d) % mod;
return ret;
}
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3) {
cout << 0 << endl;
return 0;
}
int m = (2 * x - y) / 3;
int n = (2 * y - x) / 3;
if (m < 0 || n < 0) {
cout << 0 << endl;
}
cout << comb(m + n, m) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const int mod = 1000000007;
int frac(int n) {
if (!n)
return 1;
int64_t ret = (int64_t)n * frac(n - 1);
return ret % mod;
}
int modinv(int i) {
int64_t x = 1, y = 0, z = 0, w = 1;
int m = mod;
while (m > 0) {
int q = i / m, r = i % m;
int64_t temp1 = x, temp2 = y;
x = z;
z = temp1 - q * z;
y = w;
w = temp2 - q * w;
i = m;
m = r;
}
while (x < 0)
x += mod;
return x;
}
int comb(int n, int i) {
int a = frac(n), b = frac(i), c = frac(n - i);
int d = (int64_t)b * c % mod;
int ret = (int64_t)a * modinv(d) % mod;
return ret;
}
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3) {
cout << 0 << endl;
return 0;
}
int m = (2 * x - y) / 3;
int n = (2 * y - x) / 3;
if (m < 0 || n < 0) {
cout << 0 << endl;
return 0;
}
cout << comb(m + n, m) << endl;
}
| insert | 47 | 47 | 47 | 48 | 0 | |
p02862 | C++ | Runtime Error | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define MAX_DOUBLE (1.0e+308)
#define DOUBLE_EPS (1.0e-12)
#define MIN_DOUBLE_N (-1.0e+308)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
static inline DOUBLE ABS(DOUBLE a) { return 0 <= a ? a : -a; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
static inline void inputStringSpSeparated(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c) || (' ' == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = true;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = true;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = true;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
/*----------------------------------------------*/
/**
* mod による操作ライブラリ
*/
#define ANS_MOD (1000000007)
class MODINT {
static SQWORD MOD;
SQWORD m_x;
public:
MODINT(SQWORD val) { m_x = (val % MOD + MOD) % MOD; };
MODINT() { m_x = 0; }
static void Init(SQWORD sqMod) { MOD = sqMod; }
MODINT &operator+=(const MODINT a) {
m_x = (m_x + a.m_x) % MOD;
return *this;
};
MODINT &operator-=(const MODINT a) {
m_x = (m_x - a.m_x + MOD) % MOD;
return *this;
};
MODINT &operator*=(const MODINT a) {
m_x = (m_x * a.m_x) % MOD;
return *this;
};
MODINT pow(SQWORD t) const {
if (!t)
return 1;
MODINT a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
MODINT operator+(const MODINT a) const {
MODINT res(*this);
return (res += a);
}
MODINT operator-(const MODINT a) const {
MODINT res(*this);
return (res -= a);
}
MODINT operator*(const MODINT a) const {
MODINT res(*this);
return (res *= a);
}
MODINT operator/(const MODINT a) const {
MODINT res(*this);
return (res /= a);
}
/* 逆元 */
MODINT inv() const { return pow(MOD - 2); }
/* 除算 */
MODINT &operator/=(const MODINT a) { return (*this) *= a.inv(); }
/* 整数版 */
MODINT &operator+=(const SQWORD a) {
*this += MODINT(a);
return *this;
};
MODINT &operator-=(const SQWORD a) {
*this -= MODINT(a);
return *this;
};
MODINT &operator*=(const SQWORD a) {
*this *= MODINT(a);
return *this;
};
MODINT &operator/=(const SQWORD a) {
*this /= MODINT(a);
return *this;
};
SQWORD getVal() { return m_x; };
};
SQWORD MODINT::MOD = ANS_MOD;
/*----------------------------------------------*/
class Combination {
vector<MODINT> vecmsqComb;
public:
Combination(SQWORD sqN) {
/* nCjを事前計算する */
vecmsqComb.resize(sqN + 1);
MODINT sqComb((SQWORD)1);
vecmsqComb[0] = sqComb;
for (SQWORD sqJ = 1; sqJ <= sqN; sqJ++) {
sqComb *= MODINT(sqN - sqJ + 1);
sqComb /= MODINT(sqJ);
vecmsqComb[sqJ] = sqComb;
}
}
MODINT GetVal(SQWORD sqJ) { return vecmsqComb[sqJ]; }
};
/*-----------------------------------------------------*/
static const DOUBLE d_PI = 3.14159265358979323846;
#define MAX_X (1001000)
int main(void) {
SQWORD sqX = inputSQWORD();
SQWORD sqY = inputSQWORD();
if (0 != (sqX + sqY) % 3) {
printf("0\n");
return 0;
}
SQWORD sqM = (sqX + sqY) / 3;
SQWORD sqN = (sqY * 2 - sqX) / 3;
sqN = min(sqM - sqN, sqN);
if (0 == sqN) {
printf("1\n");
return 0;
}
/* mCn を計算する */
#if 0
MODINT sqAns = 1;
for (SQWORD sqIdx = 0; sqIdx < sqN.getVal(); sqIdx++) {
sqAns *= (sqM - MODINT(sqIdx));
}
MODINT sqDiv = 1;
for (SQWORD sqIdx = 0; sqIdx < sqN.getVal(); sqIdx++) {
sqDiv *= (sqN - sqIdx);
}
sqAns /= sqDiv;
#endif
Combination comb(sqM);
printf("%lld\n", comb.GetVal(sqN));
return 0;
} | #pragma GCC optimize("O3")
#include <algorithm>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
using QWORD = uint64_t;
using SQWORD = int64_t;
using DWORD = uint32_t;
using SDWORD = int32_t;
using WORD = uint16_t;
using SWORD = int16_t;
using BYTE = uint8_t;
using SBYTE = int8_t;
using DOUBLE = double;
using FLOAT = float;
#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)
#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)
#define MAX_QWORD (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_WORD (0xFFFF)
#define MAX_BYTE (0xFF)
#define MAX_DOUBLE (1.0e+308)
#define DOUBLE_EPS (1.0e-12)
#define MIN_DOUBLE_N (-1.0e+308)
#define ArrayLength(a) (sizeof(a) / sizeof(a[0]))
static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }
static inline DOUBLE ABS(DOUBLE a) { return 0 <= a ? a : -a; }
#define BYTE_BITS (8)
#define WORD_BITS (16)
#define DWORD_BITS (32)
#define QWORD_BITS (64)
static inline void inputStringSpSeparated(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c) || (' ' == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline void inputString(char *pcStr) {
char *pcCur = pcStr;
for (;;) {
char c = getchar();
if (('\n' == c) || (EOF == c)) {
break;
}
*pcCur = c;
pcCur++;
}
*pcCur = '\0';
}
static inline SQWORD inputSQWORD(void) {
SQWORD sqNumber = 0;
SQWORD sqMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
sqMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
sqNumber *= 10LL;
sqNumber += (SQWORD)(c - '0');
bRead = true;
} else {
if (bRead) {
return sqNumber * sqMultiplier;
}
}
}
}
static inline SDWORD inputSDWORD(void) {
SDWORD lNumber = 0;
SDWORD lMultiplier = 1;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
lMultiplier = -1;
}
}
if (('0' <= c) && (c <= '9')) {
lNumber *= 10;
lNumber += (c - '0');
bRead = true;
} else {
if (bRead) {
return lNumber * lMultiplier;
}
}
}
}
static inline DOUBLE inputFP(void) {
DOUBLE dInt = 0.0;
DOUBLE dFrac = 0.0;
DOUBLE dMultiplier = 1.0;
DWORD dwFpCnt = 0;
DOUBLE *pdCur = &dInt;
bool bRead = false;
for (;;) {
char c = getchar();
if (!bRead) {
if ('-' == c) {
dMultiplier = -1;
}
}
if ('.' == c) {
pdCur = &dFrac;
} else if (('0' <= c) && (c <= '9')) {
(*pdCur) *= 10;
(*pdCur) += (DOUBLE)(c - '0');
bRead = true;
if (pdCur == &dFrac) {
dwFpCnt++;
}
} else {
if (bRead) {
return dMultiplier *
(dInt + dFrac / (pow((DOUBLE)10.0, (DOUBLE)dwFpCnt)));
}
}
}
}
/*----------------------------------------------*/
/**
* mod による操作ライブラリ
*/
#define ANS_MOD (1000000007)
class MODINT {
static SQWORD MOD;
SQWORD m_x;
public:
MODINT(SQWORD val) { m_x = (val % MOD + MOD) % MOD; };
MODINT() { m_x = 0; }
static void Init(SQWORD sqMod) { MOD = sqMod; }
MODINT &operator+=(const MODINT a) {
m_x = (m_x + a.m_x) % MOD;
return *this;
};
MODINT &operator-=(const MODINT a) {
m_x = (m_x - a.m_x + MOD) % MOD;
return *this;
};
MODINT &operator*=(const MODINT a) {
m_x = (m_x * a.m_x) % MOD;
return *this;
};
MODINT pow(SQWORD t) const {
if (!t)
return 1;
MODINT a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
MODINT operator+(const MODINT a) const {
MODINT res(*this);
return (res += a);
}
MODINT operator-(const MODINT a) const {
MODINT res(*this);
return (res -= a);
}
MODINT operator*(const MODINT a) const {
MODINT res(*this);
return (res *= a);
}
MODINT operator/(const MODINT a) const {
MODINT res(*this);
return (res /= a);
}
/* 逆元 */
MODINT inv() const { return pow(MOD - 2); }
/* 除算 */
MODINT &operator/=(const MODINT a) { return (*this) *= a.inv(); }
/* 整数版 */
MODINT &operator+=(const SQWORD a) {
*this += MODINT(a);
return *this;
};
MODINT &operator-=(const SQWORD a) {
*this -= MODINT(a);
return *this;
};
MODINT &operator*=(const SQWORD a) {
*this *= MODINT(a);
return *this;
};
MODINT &operator/=(const SQWORD a) {
*this /= MODINT(a);
return *this;
};
SQWORD getVal() { return m_x; };
};
SQWORD MODINT::MOD = ANS_MOD;
/*----------------------------------------------*/
class Combination {
vector<MODINT> vecmsqComb;
public:
Combination(SQWORD sqN) {
/* nCjを事前計算する */
vecmsqComb.resize(sqN + 1);
MODINT sqComb((SQWORD)1);
vecmsqComb[0] = sqComb;
for (SQWORD sqJ = 1; sqJ <= sqN; sqJ++) {
sqComb *= MODINT(sqN - sqJ + 1);
sqComb /= MODINT(sqJ);
vecmsqComb[sqJ] = sqComb;
}
}
MODINT GetVal(SQWORD sqJ) { return vecmsqComb[sqJ]; }
};
/*-----------------------------------------------------*/
static const DOUBLE d_PI = 3.14159265358979323846;
#define MAX_X (1001000)
int main(void) {
SQWORD sqX = inputSQWORD();
SQWORD sqY = inputSQWORD();
if (0 != (sqX + sqY) % 3) {
printf("0\n");
return 0;
}
if (sqY * 2 < sqX) {
printf("0\n");
return 0;
}
if (sqX * 2 < sqY) {
printf("0\n");
return 0;
}
SQWORD sqM = (sqX + sqY) / 3;
SQWORD sqN = (sqY * 2 - sqX) / 3;
sqN = min(sqM - sqN, sqN);
if (0 == sqN) {
printf("1\n");
return 0;
}
/* mCn を計算する */
#if 0
MODINT sqAns = 1;
for (SQWORD sqIdx = 0; sqIdx < sqN.getVal(); sqIdx++) {
sqAns *= (sqM - MODINT(sqIdx));
}
MODINT sqDiv = 1;
for (SQWORD sqIdx = 0; sqIdx < sqN.getVal(); sqIdx++) {
sqDiv *= (sqN - sqIdx);
}
sqAns /= sqDiv;
#endif
Combination comb(sqM);
printf("%lld\n", comb.GetVal(sqN));
return 0;
} | insert | 282 | 282 | 282 | 291 | 0 | |
p02862 | C++ | Time Limit Exceeded | // 解説前
#include <cstdint>
#include <iostream>
#include <vector>
// x^y (mod m)を計算する
// 参考：https://stackoverflow.com/questions/8496182/calculating-powa-b-mod-n
template <typename T> T pow(T x, T y, T m) noexcept {
T r = 1;
while (y > 0) {
// 指数のiビット目を見て、xの2^i乗をかける
if (y & 1) {
r *= x;
if (r >= m)
r %= m;
}
// xの2^i乗を累積的に計算する
x *= x;
if (x >= m)
x %= m;
y >>= 1;
}
return r;
}
// nCr (mod m)を計算する（ただし、mは素数とする）
// 参考：https://ikatakos.com/pot/programming_algorithm/number_theory/mod_combination
template <typename T> T combination(T n, T r, T m) noexcept {
// 分子（nPr (mod m)）を計算する
T num = 1;
for (T i = 0; i < r; ++i) {
num *= n - i;
if (num >= m)
num %= m;
}
// 分母（r! (mod m)）を計算する
T denom = 1;
for (T i = 1; i <= r; ++i) {
denom *= i;
if (denom >= m)
denom %= m;
}
// 分母の逆数（r!^{-1} (mod m)）を計算する
// フェルマーの小定理より、素数pと互いに素なaに対して、
// a^{p-1} ≡ 1 (mod p) <=> a^{p-2} ≡ a^{-1} (mod p)なので、
// r!^{-1} (mod m) = r!^{m-2} (mod m)とすることができる
const T denom_inv = pow(denom, m - 2, m);
// nPr * r!^{-1} (mod m)を計算する
return (num * denom_inv) % m;
}
// L^1ノルムを考えると、(1,2)と(2,1)のどちらの方向でも距離3だけ移動する
// => 到達可能な地点までのL^1ノルムは3の倍数になる
// => 動かした回数はn=(X+Y)/3となる
//
// すべての移動を(1,2)の方向に動かしたとすると、X=nとなる
// その状態からどこか1つを(2,1)の方向に動かすよう変えた場合、Xは+1だけ増える
// => (2,1)方向に動かした回数はX-nとなる
//
// 進む経路を図に起こすと、その個数はパスカルの三角形を描く
// => 動かす回数をn、(2,1)の方向に動かした回数をrとして、nCrを計算すれば良い
int main() {
uint64_t X, Y;
std::cin >> X >> Y;
// 経路の数を計算する
const auto distance = X + Y; // L^1ノルム
if (distance % 3 != 0) {
// (X, Y)に到達できない場合
std::cout << '0';
} else {
// (X, Y)に到達できる場合
const auto n = distance / 3; // 移動回数
const auto r = X - n; // (2,1)の方向に動かした回数
// nCr (mod 10^9+7)を計算する
const uint64_t m = 1'000'000'007;
std::cout << combination(n, r, m);
}
return 0;
}
| // 解説前
#include <cstdint>
#include <iostream>
#include <vector>
// x^y (mod m)を計算する
// 参考：https://stackoverflow.com/questions/8496182/calculating-powa-b-mod-n
template <typename T> T pow(T x, T y, T m) noexcept {
T r = 1;
while (y > 0) {
// 指数のiビット目を見て、xの2^i乗をかける
if (y & 1) {
r *= x;
if (r >= m)
r %= m;
}
// xの2^i乗を累積的に計算する
x *= x;
if (x >= m)
x %= m;
y >>= 1;
}
return r;
}
// nCr (mod m)を計算する（ただし、mは素数とする）
// 参考：https://ikatakos.com/pot/programming_algorithm/number_theory/mod_combination
template <typename T> T combination(T n, T r, T m) noexcept {
if (r > n - r)
r = n - r;
// 分子（nPr (mod m)）を計算する
T num = 1;
for (T i = 0; i < r; ++i) {
num *= n - i;
if (num >= m)
num %= m;
}
// 分母（r! (mod m)）を計算する
T denom = 1;
for (T i = 1; i <= r; ++i) {
denom *= i;
if (denom >= m)
denom %= m;
}
// 分母の逆数（r!^{-1} (mod m)）を計算する
// フェルマーの小定理より、素数pと互いに素なaに対して、
// a^{p-1} ≡ 1 (mod p) <=> a^{p-2} ≡ a^{-1} (mod p)なので、
// r!^{-1} (mod m) = r!^{m-2} (mod m)とすることができる
const T denom_inv = pow(denom, m - 2, m);
// nPr * r!^{-1} (mod m)を計算する
return (num * denom_inv) % m;
}
// L^1ノルムを考えると、(1,2)と(2,1)のどちらの方向でも距離3だけ移動する
// => 到達可能な地点までのL^1ノルムは3の倍数になる
// => 動かした回数はn=(X+Y)/3となる
//
// すべての移動を(1,2)の方向に動かしたとすると、X=nとなる
// その状態からどこか1つを(2,1)の方向に動かすよう変えた場合、Xは+1だけ増える
// => (2,1)方向に動かした回数はX-nとなる
//
// 進む経路を図に起こすと、その個数はパスカルの三角形を描く
// => 動かす回数をn、(2,1)の方向に動かした回数をrとして、nCrを計算すれば良い
int main() {
uint64_t X, Y;
std::cin >> X >> Y;
// 経路の数を計算する
const auto distance = X + Y; // L^1ノルム
if (distance % 3 != 0) {
// (X, Y)に到達できない場合
std::cout << '0';
} else {
// (X, Y)に到達できる場合
const auto n = distance / 3; // 移動回数
const auto r = X - n; // (2,1)の方向に動かした回数
// nCr (mod 10^9+7)を計算する
const uint64_t m = 1'000'000'007;
std::cout << combination(n, r, m);
}
return 0;
}
| insert | 30 | 30 | 30 | 33 | TLE | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll fac[1000010];
ll binpow(ll a, ll b, ll MOD) {
ll res = 1;
a %= MOD;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
void cal_fac(ll n, ll MOD) {
fac[0] = 1;
for (ll i = 1; i <= n; i++) {
fac[i] = fac[i - 1] * i;
fac[i] %= MOD;
}
}
ll nCr(ll n, ll r, ll MOD) {
// MOD is a prime
cal_fac(n, MOD);
// n!*(r!)^-1*((n-r)!)^-1
// inverse mod (a^-1 = a^(MOD-2) mod MOD
return fac[n] * binpow(fac[n - r], MOD - 2, MOD) % MOD *
binpow(fac[r], MOD - 2, MOD) % MOD;
}
int main() {
ll x, y;
cin >> x >> y;
if ((x + y) % 3 == 0) {
ll n = y - (x + y) / 3;
ll m = x - (x + y) / 3;
cout << nCr(n + m, n, 1000000007);
} else
cout << "0";
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll fac[1000010];
ll binpow(ll a, ll b, ll MOD) {
ll res = 1;
a %= MOD;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
void cal_fac(ll n, ll MOD) {
fac[0] = 1;
for (ll i = 1; i <= n; i++) {
fac[i] = fac[i - 1] * i;
fac[i] %= MOD;
}
}
ll nCr(ll n, ll r, ll MOD) {
// MOD is a prime
cal_fac(n, MOD);
// n!*(r!)^-1*((n-r)!)^-1
// inverse mod (a^-1 = a^(MOD-2) mod MOD
return fac[n] * binpow(fac[n - r], MOD - 2, MOD) % MOD *
binpow(fac[r], MOD - 2, MOD) % MOD;
}
int main() {
ll x, y;
cin >> x >> y;
if ((x + y) % 3 == 0) {
ll n = y - (x + y) / 3;
ll m = x - (x + y) / 3;
if (n >= 0 && m >= 0)
cout << nCr(n + m, n, 1000000007);
else
cout << "0";
} else
cout << "0";
} | replace | 37 | 38 | 37 | 41 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pull = pair<ull, ll>;
#define INF 1000000000
#define LLINF 10000000000000000ll
#define MOD 1000000007LL
bool dbgflag = false;
ll modPow(ll a, ll n, ll p) {
if (n == 1)
return a % p;
if (n % 2 == 1)
return (a * modPow(a, n - 1, p)) % p;
ll t = modPow(a, n / 2, p);
return (t * t) % p;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll x, y;
cin >> x >> y;
if (((2 * y - x) % 3 != 0) || ((2 * x - y) % 3 != 0)) {
cout << 0 << endl;
return 0;
}
ll a = (2 * y - x) / 3, b = (2 * x - y) / 3;
ll n = a + b;
vector<ll> fact(n + 1); // 階乗
vector<ll> fact_inv(n + 1); // 階乗の逆元
fact[0] = 1;
for (int i = 0; i < n; i++)
fact[i + 1] = (fact[i] * (i + 1)) % MOD;
fact_inv[n] = modPow(fact[n], MOD - 2, MOD);
for (int i = n - 1; i >= 0; i--)
fact_inv[i] = (fact_inv[i + 1] * (i + 1)) % MOD;
auto comb = [&](ll n0, ll r) { // MODで
return (((fact[n0] * fact_inv[n0 - r]) % MOD) * fact_inv[r]) % MOD;
};
cout << comb(a + b, a) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pull = pair<ull, ll>;
#define INF 1000000000
#define LLINF 10000000000000000ll
#define MOD 1000000007LL
bool dbgflag = false;
ll modPow(ll a, ll n, ll p) {
if (n == 1)
return a % p;
if (n % 2 == 1)
return (a * modPow(a, n - 1, p)) % p;
ll t = modPow(a, n / 2, p);
return (t * t) % p;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll x, y;
cin >> x >> y;
if (((2 * y - x) % 3 != 0) || ((2 * x - y) % 3 != 0)) {
cout << 0 << endl;
return 0;
}
ll a = (2 * y - x) / 3, b = (2 * x - y) / 3;
if (!((a >= 0) && (b >= 0))) {
cout << 0 << endl;
return 0;
}
ll n = a + b;
vector<ll> fact(n + 1); // 階乗
vector<ll> fact_inv(n + 1); // 階乗の逆元
fact[0] = 1;
for (int i = 0; i < n; i++)
fact[i + 1] = (fact[i] * (i + 1)) % MOD;
fact_inv[n] = modPow(fact[n], MOD - 2, MOD);
for (int i = n - 1; i >= 0; i--)
fact_inv[i] = (fact_inv[i + 1] * (i + 1)) % MOD;
auto comb = [&](ll n0, ll r) { // MODで
return (((fact[n0] * fact_inv[n0 - r]) % MOD) * fact_inv[r]) % MOD;
};
cout << comb(a + b, a) << endl;
}
| insert | 34 | 34 | 34 | 38 | 0 | |
p02862 | C++ | Runtime Error | // -----------------------------------
// author : MatsuTaku
// country : Japan
// created : 06/11/20 21:59:34
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T, T MOD> class modular {
private:
T val_;
public:
constexpr modular() : val_(0) {}
constexpr modular(T v) : val_(v % MOD) {}
constexpr modular &operator=(T v) {
val_ = v % MOD;
return *this;
}
constexpr T val() const { return val_; }
constexpr modular operator+(modular x) const {
return (val() + x.val()) % MOD;
}
constexpr modular operator+=(modular x) { return *this = *this + x; }
constexpr modular operator++() { return *this += 1; }
constexpr modular operator++(int) {
modular c = *this;
++(*this);
return c;
}
constexpr modular operator-(modular x) const {
return (val() + MOD - x.val()) % MOD;
}
constexpr modular operator-=(modular x) { return *this = *this - x; }
constexpr modular operator--() { return *this -= 1; }
constexpr modular operator--(int) {
modular c = *this;
--(*this);
return c;
}
constexpr modular operator*(modular x) const {
return (val() * x.val()) % MOD;
}
constexpr modular operator*=(modular x) { return *this = *this * x; }
friend constexpr modular pow(modular x, T p) {
modular t = 1;
modular u = x;
while (p) {
if (p & 1)
t *= u;
u *= u;
p >>= 1;
}
return t;
}
constexpr modular operator/(modular x) const {
return *this * pow(modular{x}, MOD - 2);
}
constexpr modular operator/=(modular x) { return *this = *this / x; }
constexpr bool operator==(modular x) const { return val() == x.val(); }
constexpr bool operator!=(modular x) const { return val() != x.val(); }
constexpr bool operator<(modular x) const { return val() < x.val(); };
constexpr bool operator<=(modular x) const { return val() <= x.val(); };
constexpr bool operator>(modular x) const { return val() > x.val(); };
constexpr bool operator>=(modular x) const { return val() >= x.val(); };
friend std::ostream &operator<<(std::ostream &os, const modular &x) {
return os << x.val();
}
friend std::istream &operator>>(std::istream &is, modular &x) {
return is >> x.val_;
}
};
constexpr unsigned long long MOD = 1e9 + 7;
using mint = modular<unsigned long long, MOD>;
constexpr int MAX = 7e5;
mint fact_[MAX + 1];
mint ifact_[MAX + 1];
void init() {
fact_[0] = 1;
for (size_t i = 1; i <= MAX; ++i) {
fact_[i] = fact_[i - 1] * i;
}
ifact_[MAX] = mint(1) / fact_[MAX];
for (int i = MAX - 1; i >= 0; i--) {
ifact_[i] = ifact_[i + 1] * (i + 1);
}
}
mint cmb(int p, int q) { return fact_[p] * ifact_[q] * ifact_[p - q]; }
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int x, y;
cin >> x >> y;
mint ans;
if ((x + y) % 3 != 0 or (2 * x - y) % 3 != 0 or (2 * y - x) % 3 != 0) {
ans = 0;
} else {
init();
ans = cmb((x + y) / 3, (2 * x - y) / 3);
}
cout << ans << endl;
return 0;
}
| // -----------------------------------
// author : MatsuTaku
// country : Japan
// created : 06/11/20 21:59:34
// -----------------------------------
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
template <typename T, T MOD> class modular {
private:
T val_;
public:
constexpr modular() : val_(0) {}
constexpr modular(T v) : val_(v % MOD) {}
constexpr modular &operator=(T v) {
val_ = v % MOD;
return *this;
}
constexpr T val() const { return val_; }
constexpr modular operator+(modular x) const {
return (val() + x.val()) % MOD;
}
constexpr modular operator+=(modular x) { return *this = *this + x; }
constexpr modular operator++() { return *this += 1; }
constexpr modular operator++(int) {
modular c = *this;
++(*this);
return c;
}
constexpr modular operator-(modular x) const {
return (val() + MOD - x.val()) % MOD;
}
constexpr modular operator-=(modular x) { return *this = *this - x; }
constexpr modular operator--() { return *this -= 1; }
constexpr modular operator--(int) {
modular c = *this;
--(*this);
return c;
}
constexpr modular operator*(modular x) const {
return (val() * x.val()) % MOD;
}
constexpr modular operator*=(modular x) { return *this = *this * x; }
friend constexpr modular pow(modular x, T p) {
modular t = 1;
modular u = x;
while (p) {
if (p & 1)
t *= u;
u *= u;
p >>= 1;
}
return t;
}
constexpr modular operator/(modular x) const {
return *this * pow(modular{x}, MOD - 2);
}
constexpr modular operator/=(modular x) { return *this = *this / x; }
constexpr bool operator==(modular x) const { return val() == x.val(); }
constexpr bool operator!=(modular x) const { return val() != x.val(); }
constexpr bool operator<(modular x) const { return val() < x.val(); };
constexpr bool operator<=(modular x) const { return val() <= x.val(); };
constexpr bool operator>(modular x) const { return val() > x.val(); };
constexpr bool operator>=(modular x) const { return val() >= x.val(); };
friend std::ostream &operator<<(std::ostream &os, const modular &x) {
return os << x.val();
}
friend std::istream &operator>>(std::istream &is, modular &x) {
return is >> x.val_;
}
};
constexpr unsigned long long MOD = 1e9 + 7;
using mint = modular<unsigned long long, MOD>;
constexpr int MAX = 7e5;
mint fact_[MAX + 1];
mint ifact_[MAX + 1];
void init() {
fact_[0] = 1;
for (size_t i = 1; i <= MAX; ++i) {
fact_[i] = fact_[i - 1] * i;
}
ifact_[MAX] = mint(1) / fact_[MAX];
for (int i = MAX - 1; i >= 0; i--) {
ifact_[i] = ifact_[i + 1] * (i + 1);
}
}
mint cmb(int p, int q) { return fact_[p] * ifact_[q] * ifact_[p - q]; }
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int x, y;
cin >> x >> y;
mint ans;
if ((x + y) % 3 != 0 or 2 * x < y or 2 * y < x or (2 * x - y) % 3 != 0 or
(2 * y - x) % 3 != 0) {
ans = 0;
} else {
init();
ans = cmb((x + y) / 3, (2 * x - y) / 3);
}
cout << ans << endl;
return 0;
}
| replace | 105 | 106 | 105 | 107 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
int fact[maxn], ifact[maxn];
void addmod(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
if (a < 0)
a += mod;
}
int power(int a, int b) {
if (b == 0)
return 1;
int res = power(a, b / 2);
if (b & 1)
return 1ll * res * res % mod * a % mod;
return 1ll * res * res % mod;
}
int nCk(int n, int k) {
if (k > n)
return 0;
return 1ll * fact[n] * ifact[k] % mod * ifact[n - k] % mod;
}
void precalc(void) {
fact[0] = 1;
for (int i = 1; i <= maxn - 5; ++i)
fact[i] = 1ll * fact[i - 1] * i % mod;
ifact[maxn - 5] = power(fact[maxn - 5], mod - 2);
for (int i = maxn - 6; i >= 0; --i)
ifact[i] = 1ll * ifact[i + 1] * (i + 1) % mod;
}
signed main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
precalc();
int x, y;
cin >> x >> y;
if ((x + y) % 3) {
cout << 0;
return 0;
}
int m = x - (x + y) / 3;
int n = x - 2 * m;
cout << nCk(n + m, n) << '\n';
}
| #include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 5;
const int mod = 1e9 + 7;
int fact[maxn], ifact[maxn];
void addmod(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
if (a < 0)
a += mod;
}
int power(int a, int b) {
if (b == 0)
return 1;
int res = power(a, b / 2);
if (b & 1)
return 1ll * res * res % mod * a % mod;
return 1ll * res * res % mod;
}
int nCk(int n, int k) {
if (k > n)
return 0;
return 1ll * fact[n] * ifact[k] % mod * ifact[n - k] % mod;
}
void precalc(void) {
fact[0] = 1;
for (int i = 1; i <= maxn - 5; ++i)
fact[i] = 1ll * fact[i - 1] * i % mod;
ifact[maxn - 5] = power(fact[maxn - 5], mod - 2);
for (int i = maxn - 6; i >= 0; --i)
ifact[i] = 1ll * ifact[i + 1] * (i + 1) % mod;
}
signed main(void) {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
precalc();
int x, y;
cin >> x >> y;
if ((x + y) % 3) {
cout << 0;
return 0;
}
int m = x - (x + y) / 3;
int n = x - 2 * m;
if (n < 0 || m < 0) {
cout << 0;
return 0;
}
cout << nCk(n + m, n) << '\n';
} | insert | 61 | 61 | 61 | 65 | 0 | |
p02862 | C++ | Runtime Error | // Author: πα
#include <bits/stdc++.h>
using namespace std;
#define long int64_t
const int MOD = 1000000007;
long modexp(long x, long y, long mod = MOD) {
long res = 1;
x = (x % mod + mod) % mod;
while (y) {
if (y & 1)
res = (res * x) % mod;
y >>= 1;
x = (x * x) % mod;
}
return res;
}
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3)
return cout << 0, 0;
int n = (x + y) / 3;
int r = (n - x + y) / 2;
vector<int> f(n + 1);
f[0] = 1;
for (long i = 1; i <= n; ++i)
f[i] = i * f[i - 1] % MOD;
long ans = f[n];
ans *= modexp(f[r], MOD - 2), ans %= MOD;
ans *= modexp(f[n - r], MOD - 2), ans %= MOD;
cout << ans;
return 0;
}
| // Author: πα
#include <bits/stdc++.h>
using namespace std;
#define long int64_t
const int MOD = 1000000007;
long modexp(long x, long y, long mod = MOD) {
long res = 1;
x = (x % mod + mod) % mod;
while (y) {
if (y & 1)
res = (res * x) % mod;
y >>= 1;
x = (x * x) % mod;
}
return res;
}
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3)
return cout << 0, 0;
int n = (x + y) / 3;
int r = (n - x + y) / 2;
if (r < 0 or r > n)
return cout << 0, 0;
vector<long> f(n + 1);
f[0] = 1;
for (long i = 1; i <= n; ++i)
f[i] = i * f[i - 1] % MOD;
long ans = f[n];
ans *= modexp(f[r], MOD - 2), ans %= MOD;
ans *= modexp(f[n - r], MOD - 2), ans %= MOD;
cout << ans;
return 0;
}
| replace | 26 | 27 | 26 | 29 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
long long int dizi[10000005];
long long int hizlius(long long int a, long long int b) {
if (b == 0) {
return 1;
}
if (b == 1) {
return a;
}
long long int kl = hizlius(a, b / 2);
if (b % 2 == 0) {
return (kl * kl) % MOD;
}
if (b % 2 == 1) {
return (((kl * kl) % MOD) * a) % MOD;
}
}
long long int com(long long int a, long long int b) {
long long int c = b;
long long int d = a - b;
long long int reelc = hizlius(dizi[c], MOD - 2);
long long int reeld = hizlius(dizi[d], MOD - 2);
return (((dizi[a] * reelc) % MOD) * reeld) % MOD;
}
int main() {
long long int a, b;
cin >> a >> b;
long long int x, y;
x = (2 * a - b) / 3;
y = (2 * b - a) / 3;
long long int ls = max(x + y, b);
dizi[0] = 1;
for (long long int i = 1; i < x + y + 2; i++) {
dizi[i] = (dizi[i - 1] * i) % MOD;
}
if ((a + b) % 3 != 0) {
cout << 0 << endl;
return 0;
}
cout << com(x + y, y);
// x+y
// y
} | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
long long int dizi[10000005];
long long int hizlius(long long int a, long long int b) {
if (b == 0) {
return 1;
}
if (b == 1) {
return a;
}
long long int kl = hizlius(a, b / 2);
if (b % 2 == 0) {
return (kl * kl) % MOD;
}
if (b % 2 == 1) {
return (((kl * kl) % MOD) * a) % MOD;
}
}
long long int com(long long int a, long long int b) {
long long int c = b;
long long int d = a - b;
long long int reelc = hizlius(dizi[c], MOD - 2);
long long int reeld = hizlius(dizi[d], MOD - 2);
return (((dizi[a] * reelc) % MOD) * reeld) % MOD;
}
int main() {
long long int a, b;
cin >> a >> b;
long long int x, y;
x = (2 * a - b) / 3;
y = (2 * b - a) / 3;
long long int ls = max(x + y, b);
dizi[0] = 1;
for (long long int i = 1; i < x + y + 2; i++) {
dizi[i] = (dizi[i - 1] * i) % MOD;
}
if (max(a, b) / 2 > min(a, b)) {
cout << 0;
return 0;
}
if ((a + b) % 3 != 0) {
cout << 0 << endl;
return 0;
}
cout << com(x + y, y);
// x+y
// y
} | insert | 43 | 43 | 43 | 47 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long inv[3000001];
long long fac[3000001];
long long facinv[3000001];
int main() {
int x, y;
cin >> x >> y;
if ((2 * y - x) % 3 != 0 || (2 * x - y) % 3 != 0) {
cout << 0 << endl;
} else {
int a = (2 * y - x) / 3;
int b = (2 * x - y) / 3;
inv[0] = 1;
inv[1] = 1;
for (int i = 2; i < 3000001; ++i) {
inv[i] = (mod - mod / i) * 1LL * inv[mod % i] % mod;
}
fac[0] = 1;
fac[1] = 1;
for (int i = 2; i < 3000001; ++i) {
fac[i] = fac[i - 1] * 1LL * i % mod;
}
facinv[0] = 1;
facinv[1] = 1;
for (int i = 2; i < 3000001; ++i) {
facinv[i] = facinv[i - 1] * 1LL * inv[i] % mod;
}
int res = ((1LL * fac[a + b] * facinv[b]) % mod * facinv[a]) % mod;
cout << res << endl;
}
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
long long mod = 1e9 + 7;
long long inv[3000001];
long long fac[3000001];
long long facinv[3000001];
int main() {
int x, y;
cin >> x >> y;
if ((2 * y - x) % 3 != 0 || (2 * x - y) % 3 != 0) {
cout << 0 << endl;
} else {
int a = (2 * y - x) / 3;
int b = (2 * x - y) / 3;
if (a < 0 || b < 0) {
cout << 0 << endl;
return 0;
}
inv[0] = 1;
inv[1] = 1;
for (int i = 2; i < 3000001; ++i) {
inv[i] = (mod - mod / i) * 1LL * inv[mod % i] % mod;
}
fac[0] = 1;
fac[1] = 1;
for (int i = 2; i < 3000001; ++i) {
fac[i] = fac[i - 1] * 1LL * i % mod;
}
facinv[0] = 1;
facinv[1] = 1;
for (int i = 2; i < 3000001; ++i) {
facinv[i] = facinv[i - 1] * 1LL * inv[i] % mod;
}
int res = ((1LL * fac[a + b] * facinv[b]) % mod * facinv[a]) % mod;
cout << res << endl;
}
return 0;
}
| insert | 15 | 15 | 15 | 20 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define debug(x) cout << #x << " " << x << endl;
const int P = 1e9 + 7;
const int N = 1e6 + 5;
const double eps = 1e-9;
const int INF = 1e18;
int X, Y;
int fac[N], I[N], inv[N];
void Init() {
fac[0] = I[0] = inv[0] = 1, fac[1] = I[1] = inv[1] = 1;
for (int i = 2; i <= 1000000; i++) {
fac[i] = fac[i - 1] * i % P;
I[i] = (P - P / i) * I[P % i] % P;
inv[i] = inv[i - 1] * I[i] % P;
}
}
int C(int n, int m) {
if (n < m)
return 0;
if (n < P && m < P)
return fac[n] * inv[m] % P * inv[n - m] % P;
return C(n / P, m / P) * C(n % P, m % P) % P;
}
signed main() {
// freopen("a.in","r",stdin);
// freopen("a.out","w",stdout);
cin >> X >> Y; // X++;Y++;
if ((X + Y) % 3) {
puts("0");
return 0;
}
int tmp = (X + Y) / 3;
X -= tmp, Y -= tmp;
int ans = 0;
Init();
ans = C(X + Y, Y);
cout << ans << endl;
return 0;
}
// Created Time :2019/11/16 20:18:34 | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define debug(x) cout << #x << " " << x << endl;
const int P = 1e9 + 7;
const int N = 1e6 + 5;
const double eps = 1e-9;
const int INF = 1e18;
int X, Y;
int fac[N], I[N], inv[N];
void Init() {
fac[0] = I[0] = inv[0] = 1, fac[1] = I[1] = inv[1] = 1;
for (int i = 2; i <= 1000000; i++) {
fac[i] = fac[i - 1] * i % P;
I[i] = (P - P / i) * I[P % i] % P;
inv[i] = inv[i - 1] * I[i] % P;
}
}
int C(int n, int m) {
if (n < m)
return 0;
if (n < P && m < P)
return fac[n] * inv[m] % P * inv[n - m] % P;
return C(n / P, m / P) * C(n % P, m % P) % P;
}
signed main() {
// freopen("a.in","r",stdin);
// freopen("a.out","w",stdout);
cin >> X >> Y; // X++;Y++;
if ((X + Y) % 3) {
puts("0");
return 0;
}
int tmp = (X + Y) / 3;
X -= tmp, Y -= tmp;
int ans = 0;
Init();
if (X < 0 || Y < 0) {
puts("0");
return 0;
}
ans = C(X + Y, Y);
cout << ans << endl;
return 0;
}
// Created Time :2019/11/16 20:18:34 | insert | 43 | 43 | 43 | 47 | 0 | |
p02862 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri, x, n) for (int ri = (int)(n - 1); ri >= (int)(x); ri--)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
// 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 = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
mint calcNumOfCombination_mint(mint n, mint r) {
mint num = 1;
for (mint i = 1; i.x <= r.x; i.x++) {
num = num * (n - i + 1) / i;
}
return num;
}
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
int w = (2 * x - y) / 3, h = (2 * y - x) / 3;
cout << calcNumOfCombination_mint(w + h, w).x << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(ri, n) for (int ri = (int)(n - 1); ri >= 0; ri--)
#define rep2(i, x, n) for (int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri, x, n) for (int ri = (int)(n - 1); ri >= (int)(x); ri--)
#define repit(itr, x) for (auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr, x) for (auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;
// 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 = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
mint calcNumOfCombination_mint(mint n, mint r) {
mint num = 1;
for (mint i = 1; i.x <= r.x; i.x++) {
num = num * (n - i + 1) / i;
}
return num;
}
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
int w = (2 * x - y) / 3, h = (2 * y - x) / 3;
if (w < 0 || h < 0) {
cout << 0 << endl;
return 0;
}
cout << calcNumOfCombination_mint(w + h, w).x << endl;
return 0;
} | insert | 81 | 81 | 81 | 85 | TLE | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
ll fac[1100000];
ll finv[1100000];
ll inv[1100000];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 10000000; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long COM(long long n, long long k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll modpow(ll n, ll p, ll m) {
if (p == 0)
return 1LL;
if (p % 2 == 0) {
ll t = modpow(n, p / 2, m);
return t * t % m;
}
return n * modpow(n, p - 1, m) % m;
}
int main() {
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0 || x > 2 * y || y > 2 * x) {
cout << 0 << endl;
return 0;
}
ll n = (x + y) / 3;
ll k = 2 * n - x;
COMinit();
cout << COM(n, k) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<ll> vll;
const long long mod = 1000000007LL;
ll fac[1100000];
ll finv[1100000];
ll inv[1100000];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000000; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long COM(long long n, long long k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll modpow(ll n, ll p, ll m) {
if (p == 0)
return 1LL;
if (p % 2 == 0) {
ll t = modpow(n, p / 2, m);
return t * t % m;
}
return n * modpow(n, p - 1, m) % m;
}
int main() {
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0 || x > 2 * y || y > 2 * x) {
cout << 0 << endl;
return 0;
}
ll n = (x + y) / 3;
ll k = 2 * n - x;
COMinit();
cout << COM(n, k) << endl;
return 0;
} | replace | 19 | 20 | 19 | 20 | -11 | |
p02862 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1000000000 + 7;
template <int Modulo = MOD> struct Mint {
Int val;
constexpr Mint(Int v = 0) noexcept : val(v % Modulo) {
if (val < 0)
v += Modulo;
}
constexpr int getmod() { return Modulo; }
constexpr Mint operator-() const noexcept { return val ? Modulo - val : 0; }
constexpr Mint operator+(const Mint &r) const noexcept {
return Mint(*this) += r;
}
constexpr Mint operator-(const Mint &r) const noexcept {
return Mint(*this) -= r;
}
constexpr Mint operator*(const Mint &r) const noexcept {
return Mint(*this) *= r;
}
constexpr Mint operator/(const Mint &r) const noexcept {
return Mint(*this) /= r;
}
constexpr Mint &operator+=(const Mint &r) noexcept {
val += r.val;
if (val >= Modulo)
val -= Modulo;
return *this;
}
constexpr Mint &operator-=(const Mint &r) noexcept {
val -= r.val;
if (val < 0)
val += Modulo;
return *this;
}
constexpr Mint &operator*=(const Mint &r) noexcept {
val = val * r.val % Modulo;
return *this;
}
constexpr Mint &operator/=(const Mint &r) noexcept {
Int a = r.val, b = Modulo, u = 1, v = 0;
while (b) {
Int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % Modulo;
if (val < 0)
val += Modulo;
return *this;
}
constexpr bool operator==(const Mint &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Mint &r) const noexcept {
return this->val != r.val;
}
friend ostream &operator<<(ostream &os, const Mint<Modulo> &x) noexcept {
return os << x.val;
}
friend istream &operator>>(istream &is, Mint<Modulo> &x) noexcept {
Int tmp;
is >> tmp;
x = Mint<Modulo>(tmp);
return is;
}
friend constexpr Mint<Modulo> modpow(const Mint<Modulo> &a, Int n) noexcept {
Mint res(1), tmp = a;
while (n > 0) {
if (n & 1)
res *= tmp;
tmp *= tmp;
n >>= 1;
}
return res;
}
};
using mint = Mint<>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
Int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << "\n";
} else {
mint ans = 1;
Int a = (x + y) / 3;
Int b = min(x, y) - a;
Int c = a - b;
while (a) {
ans *= a;
a--;
}
while (b) {
ans /= b;
b--;
}
while (c) {
ans /= c;
c--;
}
cout << ans << "\n";
}
}
| #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
using Int = long long;
Int INF = 1LL << 60;
const Int MOD = 1000000000 + 7;
template <int Modulo = MOD> struct Mint {
Int val;
constexpr Mint(Int v = 0) noexcept : val(v % Modulo) {
if (val < 0)
v += Modulo;
}
constexpr int getmod() { return Modulo; }
constexpr Mint operator-() const noexcept { return val ? Modulo - val : 0; }
constexpr Mint operator+(const Mint &r) const noexcept {
return Mint(*this) += r;
}
constexpr Mint operator-(const Mint &r) const noexcept {
return Mint(*this) -= r;
}
constexpr Mint operator*(const Mint &r) const noexcept {
return Mint(*this) *= r;
}
constexpr Mint operator/(const Mint &r) const noexcept {
return Mint(*this) /= r;
}
constexpr Mint &operator+=(const Mint &r) noexcept {
val += r.val;
if (val >= Modulo)
val -= Modulo;
return *this;
}
constexpr Mint &operator-=(const Mint &r) noexcept {
val -= r.val;
if (val < 0)
val += Modulo;
return *this;
}
constexpr Mint &operator*=(const Mint &r) noexcept {
val = val * r.val % Modulo;
return *this;
}
constexpr Mint &operator/=(const Mint &r) noexcept {
Int a = r.val, b = Modulo, u = 1, v = 0;
while (b) {
Int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % Modulo;
if (val < 0)
val += Modulo;
return *this;
}
constexpr bool operator==(const Mint &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Mint &r) const noexcept {
return this->val != r.val;
}
friend ostream &operator<<(ostream &os, const Mint<Modulo> &x) noexcept {
return os << x.val;
}
friend istream &operator>>(istream &is, Mint<Modulo> &x) noexcept {
Int tmp;
is >> tmp;
x = Mint<Modulo>(tmp);
return is;
}
friend constexpr Mint<Modulo> modpow(const Mint<Modulo> &a, Int n) noexcept {
Mint res(1), tmp = a;
while (n > 0) {
if (n & 1)
res *= tmp;
tmp *= tmp;
n >>= 1;
}
return res;
}
};
using mint = Mint<>;
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
Int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << "\n";
} else if (y < (x + 1) / 2 || y > 2 * x) {
cout << 0 << "\n";
} else {
mint ans = 1;
Int a = (x + y) / 3;
Int b = min(x, y) - a;
Int c = a - b;
while (a) {
ans *= a;
a--;
}
while (b) {
ans /= b;
b--;
}
while (c) {
ans /= c;
c--;
}
cout << ans << "\n";
}
}
| insert | 108 | 108 | 108 | 110 | TLE | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
#define MOD 1000000007
const int MAX = 510000;
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int x, y;
cin >> x >> y;
string s;
cin >> s;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
// 連立方程式からのa,bを求める
int m = (2 * x - y) / 3;
int n = (y - m) / 2;
int c = (n + m);
COMinit();
ll count = COM(c, n);
cout << count << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MAX = 5100000;
ll gcd(ll a, ll b) { return (b == 0) ? a : gcd(b, a % b); }
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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int x, y;
cin >> x >> y;
string s;
cin >> s;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
// 連立方程式からのa,bを求める
int m = (2 * x - y) / 3;
int n = (y - m) / 2;
int c = (n + m);
COMinit();
ll count = COM(c, n);
cout << count << endl;
} | replace | 5 | 7 | 5 | 7 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define ll long long
#define dd double
#define MOD 1000000007
#define nl cout << endl
#define rt ll Q[100005] = {0}
#define mp make_pair
#define test() \
ull t; \
cin >> t; \
while (t--)
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define s(ar, n) sort(ar, ar + n)
#define rs(ar, n) sort(ar, ar + n, greater<ll>())
#define oa(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define cn(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define ov(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define maxa(ar, N) *max_element(ar, ar + N)
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modInverse(ll n, ll p) { return power(n, p - 2, p); }
ll nCrModPFermat(ll n, ll r, ll p) {
if (r < 0)
return 0;
if (r == 0)
return 1ll;
ll fac[n + 1];
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
int main() {
fastio();
ll N, M;
cin >> N >> M;
ll j = N + M;
if (j % 3 == 0) {
j /= 3;
// cout<<j<<" "<<M-j<<" "<<MOD<<endl;
ll kj = nCrModPFermat(j, M - j, MOD);
cout << kj;
} else
cout << 0;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#define ll long long
#define dd double
#define MOD 1000000007
#define nl cout << endl
#define rt ll Q[100005] = {0}
#define mp make_pair
#define test() \
ull t; \
cin >> t; \
while (t--)
#define pb push_back
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define s(ar, n) sort(ar, ar + n)
#define rs(ar, n) sort(ar, ar + n, greater<ll>())
#define oa(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define cn(a, n) \
for (ll i = 0; i < n; i++) \
cin >> a[i];
#define ov(a, n) \
for (ll i = 0; i < n; i++) \
cout << a[i] << " "; \
nl
#define maxa(ar, N) *max_element(ar, ar + N)
#define fastio() \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll modInverse(ll n, ll p) { return power(n, p - 2, p); }
ll nCrModPFermat(ll n, ll r, ll p) {
if (r < 0 || r > n)
return 0;
if (r == 0)
return 1ll;
ll fac[n + 1];
fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = fac[i - 1] * i % p;
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
int main() {
fastio();
ll N, M;
cin >> N >> M;
ll j = N + M;
if (j % 3 == 0) {
j /= 3;
// cout<<j<<" "<<M-j<<" "<<MOD<<endl;
ll kj = nCrModPFermat(j, M - j, MOD);
cout << kj;
} else
cout << 0;
return 0;
} | replace | 49 | 50 | 49 | 50 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <numeric>
#include <queue>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll X, Y, W, H;
ll p = 1000000007;
vector<ll> fac, ifac;
cin >> X >> Y;
if ((2 * X - Y) % 3 == 0 && (2 * Y - X) % 3 == 0) {
W = (2 * X - Y) / 3;
H = (2 * Y - X) / 3;
} else {
cout << 0 << endl;
return 0;
}
// calculate factorial and inverse factorial
fac.push_back(1);
for (ll i = 1; i <= H + W; i++) {
ll t = fac[i - 1];
t *= i;
fac.push_back(t % p);
}
ll fac_t = fac[H + W];
ll ifac_max = 1;
for (int i = 0; ((p - 2) >> i) > 0; i++) {
if (((p - 2) >> i) & 1) {
ifac_max *= fac_t;
ifac_max %= p;
}
fac_t *= fac_t;
fac_t %= p;
}
ifac.push_back(ifac_max);
for (int i = 1; i <= H + W; i++) {
ll t = ifac[i - 1];
t *= H + W - i + 1;
ifac.push_back(t % p);
}
reverse(ifac.begin(), ifac.end());
ll ans = fac[W + H];
ans = (ans * ifac[W]) % p;
ans = (ans * ifac[H]) % p;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <limits>
#include <numeric>
#include <queue>
#include <regex>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
int main() {
ll X, Y, W, H;
ll p = 1000000007;
vector<ll> fac, ifac;
cin >> X >> Y;
if ((2 * X - Y) % 3 == 0 && (2 * Y - X) % 3 == 0) {
W = (2 * X - Y) / 3;
H = (2 * Y - X) / 3;
} else {
cout << 0 << endl;
return 0;
}
if (W < 0 || H < 0) {
cout << 0 << endl;
return 0;
}
// calculate factorial and inverse factorial
fac.push_back(1);
for (ll i = 1; i <= H + W; i++) {
ll t = fac[i - 1];
t *= i;
fac.push_back(t % p);
}
ll fac_t = fac[H + W];
ll ifac_max = 1;
for (int i = 0; ((p - 2) >> i) > 0; i++) {
if (((p - 2) >> i) & 1) {
ifac_max *= fac_t;
ifac_max %= p;
}
fac_t *= fac_t;
fac_t %= p;
}
ifac.push_back(ifac_max);
for (int i = 1; i <= H + W; i++) {
ll t = ifac[i - 1];
t *= H + W - i + 1;
ifac.push_back(t % p);
}
reverse(ifac.begin(), ifac.end());
ll ans = fac[W + H];
ans = (ans * ifac[W]) % p;
ans = (ans * ifac[H]) % p;
cout << ans << endl;
return 0;
}
| insert | 27 | 27 | 27 | 31 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
// 英語は 26 文字
// common
namespace {
#define XINT_MAX LLONG_MAX
#define CAST(T, val) ((T)(val))
#define CASE(lb) \
break; \
case lb:
#define CASE_CONT(lb) case lb:
#define CASE_DEF \
break; \
default:
#define For(i, s) for (int i = 0, forEnd##i = CAST(int, s); i < forEnd##i; ++i)
#define ForA(i, a, s) \
for (int i = CAST(int, a), forEnd##i = CAST(int, s); i < forEnd##i; ++i)
#define ForR(i, s) for (int i = s; i >= 0; i--)
#define ForRA(i, s, e) for (int i = s; i >= e; i--)
#define ForItr(itr, con) \
for (auto itr = con.begin(), forEnd##itr = con.end(); itr != forEnd##itr; \
++itr)
#define ForRItr(itr, con) \
for (auto itr = con.rbegin(), forEnd##itr = con.rend(); itr != forEnd##itr; \
++itr)
#define ForStr(i, str) for (int i = 0; str[i]; ++i)
#define GOTO(lb) goto lb
#define LABEL(lb) \
lb:
#define ALL(con) (con).begin(), (con).end()
template <typename T, typename K> struct Pair {
T fst;
K snd;
bool operator<(const Pair &p) const {
if (fst != p.fst)
return fst < p.fst;
return snd < p.snd;
}
Pair() {}
Pair(T f, T s) : fst(f), snd(s) {}
};
template <typename T, typename K>
std::istream &operator>>(std::istream &in, Pair<T, K> &p) {
return in >> p.fst >> p.snd;
}
template <typename T, typename K, typename H> struct Trir {
T fst;
K snd;
H trd;
bool operator<(const Trir &t) const {
if (fst != t.fst)
return fst < t.fst;
if (snd != t.snd)
return snd < t.snd;
return trd < t.trd;
}
Trir() {}
Trir(T f, T s, H t) : fst(f), snd(s), trd(t) {}
};
template <typename T, typename K, typename H>
std::istream &operator>>(std::istream &in, Trir<T, K, H> &p) {
return in >> p.fst >> p.snd >> p.trd;
}
typedef long long xint;
typedef unsigned long long uxint;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned short ushort;
typedef vector<int> Vi;
typedef vector<xint> Vx;
typedef vector<double> Vd;
typedef set<int> Si;
typedef set<xint> Sx;
typedef Pair<int, int> Pii;
typedef vector<Pii> VPii;
typedef Trir<int, int, int> Tiii;
typedef vector<Pii> VTiii;
const int Ten5 = 100000; // 10^5
const int Ten6 = 1000000; // 10^6
const double EPS = 0.00000000023283064365386962890625; // 2^-32
} // namespace
// min-max-mod
namespace {
// 合同式
class Mod {
public:
typedef xint T; // 型
static T N; // 法
Mod operator+(Mod m) const { return Mod(x + m.x); }
Mod operator+=(Mod m) { return *this = Mod(x + m.x); }
Mod operator-(Mod m) const { return Mod(x - m.x + N); }
Mod operator-=(Mod m) { return *this = Mod(x - m.x + N); }
Mod operator*(Mod m) const { return Mod(x * m.x); }
Mod operator*=(Mod m) { return *this = Mod(x * m.x); }
Mod operator/(
Mod m) const { // フェルマーの小定理より, m.x の逆元は m.x^( HOU-2 )
const T n = N - 2;
T v = m.x, r = x;
for (T b = 1; b < n; b <<= 1) {
if (n & b)
r = r * v % N;
v = v * v % N;
}
return r;
}
Mod operator/=(Mod m) { return *this = *this / m; }
operator T() const { return x; }
Mod() {}
Mod(T v) : x(v % N) {}
private:
T x;
};
Mod::T Mod::N = 1000 * 1000 * 1000 + 7;
// 最大値
template <typename T> class Max {
public:
// 何回更新したか
int cnt() const { return c; }
// 更新したときに true を返す
bool operator=(T v) {
if (!c) {
c = 1;
x = v;
return true;
}
if (x < v) {
c++;
x = v;
return true;
}
return false;
}
operator T() const { return x; }
Max() : x(0), c(0) {}
Max(T v) : x(v), c(1) {}
Max(const T *f, const T *l) : x(*f++), c(1) {
while (f < l) {
*this = *f++;
}
}
Max(const T *a, int n) : x(0), c(0) { For(i, n) *this = *a++; }
private:
T x;
int c;
};
// 最小値
template <typename T> class Min {
public:
// 何回更新したか
int cnt() const { return c; }
// 更新したときに true を返す
bool operator=(T v) {
if (!c) {
c = 1;
x = v;
return true;
}
if (v < x) {
c++;
x = v;
return true;
}
return false;
}
operator T() const { return x; }
Min() : x(0), c(0) {}
Min(T v) : x(v), c(1) {}
Min(const T *f, const T *l) : x(*f++), c(1) {
while (f < l) {
*this = *f++;
}
}
Min(const T *a, int n) : x(0), c(0) { For(i, n) *this = *a++; }
private:
T x;
int c;
};
template <typename T> Mod operator+(Mod m, T x) { return m + Mod(x); }
template <typename T> Mod operator+=(Mod &m, T x) { return m += Mod(x); }
template <typename T> Mod operator+(T x, Mod m) { return Mod(x) + m; }
template <typename T> Mod operator-(Mod m, T x) { return m - Mod(x); }
template <typename T> Mod operator-=(Mod &m, T x) { return m -= Mod(x); }
template <typename T> Mod operator-(T x, Mod m) { return Mod(x) - m; }
template <typename T> Mod operator*(Mod m, T x) { return m * Mod(x); }
template <typename T> Mod operator*=(Mod &m, T x) { return m *= Mod(x); }
template <typename T> Mod operator*(T x, Mod m) { return Mod(x) * m; }
template <typename T> Mod operator/(Mod m, T x) { return m / Mod(x); }
template <typename T> Mod operator/=(Mod &m, T x) { return m /= Mod(x); }
istream &operator>>(istream &in, Mod &m) {
Mod::T t;
in >> t;
m = Mod(t);
return in;
}
ostream &operator<<(ostream &ot, Mod m) { return ot << CAST(Mod::T, m); }
template <typename T> istream &operator>>(istream &in, Max<T> &m) {
T t;
in >> t;
m = Max<T>(t);
return in;
}
template <typename T> ostream &operator<<(ostream &ot, Max<T> m) {
return ot << CAST(T, m);
}
template <typename T> istream &operator>>(istream &in, Min<T> &m) {
T t;
in >> t;
m = Min<T>(t);
return in;
}
template <typename T> ostream &operator<<(ostream &ot, Min<T> m) {
return ot << CAST(T, m);
}
} // namespace
// vec
namespace {
// 2D int Vector
class Pint {
public:
int x, y;
static const Pint dir[8];
// util
static void setup(int width, int height, int offset = -1, bool swap = false) {
Width = width;
Height = height;
Offset = offset;
Swap = swap;
}
inline bool isInFld() const {
return 0 <= x && x < Width && 0 <= y && y < Height;
}
// vector
inline double len() const { return sqrt(sq()); }
inline double len(const Pint &p) const { return sqrt(sq(p)); }
inline int sq() const { return x * x + y * y; }
inline int sq(const Pint &p) const {
return (x - p.x) * (x - p.x) + (y - p.y) * (y - p.y);
}
inline int manhattan() const { return abs(x) + abs(y); }
inline int manhattan(const Pint &p) const {
return abs(x - p.x) + abs(y - p.y);
}
inline int dot(const Pint &p) const { return x * p.x + y * p.y; }
inline int crs(const Pint &p) const { return x * p.y - y * p.x; }
// opr, cst
inline Pint operator+() { return Pint(x, y); }
inline Pint operator-() { return Pint(-x, -y); }
inline Pint operator+(const Pint &p) const { return Pint(x + p.x, y + p.y); }
inline const Pint &operator+=(const Pint &p) {
x += p.x;
y += p.y;
return *this;
}
inline Pint operator-(const Pint &p) const { return Pint(x - p.x, y - p.y); }
inline const Pint &operator-=(const Pint &p) {
x -= p.x;
y -= p.y;
return *this;
}
inline Pint operator*(const Pint &p) const { return Pint(x * p.x, y * p.y); }
inline const Pint &operator*=(const Pint &p) {
x *= p.x;
y *= p.y;
return *this;
}
inline Pint operator/(const Pint &p) const { return Pint(x / p.x, y / p.y); }
inline const Pint &operator/=(const Pint &p) {
x /= p.x;
y /= p.y;
return *this;
}
inline Pint operator*(const int k) const { return Pint(x * k, y * k); }
inline const Pint &operator*=(const int k) {
x *= k;
y *= k;
return *this;
}
inline Pint operator/(const int k) const { return Pint(x / k, y / k); }
inline const Pint &operator/=(const int k) {
x /= k;
y /= k;
return *this;
}
inline bool operator<(const Pint &p) const {
return x == p.x ? y < p.y : x < p.x;
}
inline bool operator>(const Pint &p) const {
return x == p.x ? y > p.y : x > p.x;
}
inline bool operator==(const Pint &p) const { return x == p.x && y == p.y; }
inline bool operator!=(const Pint &p) const { return x != p.x || y != p.y; }
Pint() {}
Pint(const int x, const int y) : x(x), y(y) {}
private:
friend istream &operator>>(istream &in, Pint &p);
friend ostream &operator<<(ostream &out, const Pint &p);
static int Width, Height, Offset;
static bool Swap;
};
istream &operator>>(istream &in, Pint &p) {
int x, y;
in >> x >> y;
x += Pint::Offset;
y += Pint::Offset;
if (Pint::Swap)
p = Pint(y, x);
else
p = Pint(x, y);
return in;
}
ostream &operator<<(ostream &out, const Pint &p) {
return out << "( " << p.x << ", " << p.y << " )";
}
int Pint::Width, Pint::Height, Pint::Offset;
bool Pint::Swap;
const Pint Pint::dir[8] = {Pint(0, 1), Pint(1, 0), Pint(0, -1), Pint(-1, 0),
Pint(1, 1), Pint(1, -1), Pint(-1, 1), Pint(-1, -1)};
// 2D double Vector
class Pdouble {
public:
double x, y;
// vector
inline double len() const { return sqrt(sq()); }
inline double len(const Pdouble &p) const { return sqrt(sq(p)); }
inline double sq() const { return x * x + y * y; }
inline double sq(const Pdouble &p) const {
return (x - p.x) * (x - p.x) + (y - p.y) * (y - p.y);
}
inline Pdouble norm(const double l = 1.0) { return *this * l / len(); }
inline double dot(const Pdouble &p) const { return x * p.x + y * p.y; }
inline double crs(const Pdouble &p) const { return x * p.y - y * p.x; }
inline Pdouble proj(const Pdouble &v) const {
const double s = v.sq();
if (s < EPS * EPS)
return Pdouble(0, 0);
return v * dot(v) / s;
}
inline Pdouble rot(const double rad) const {
const double c = cos(rad), s = sin(rad);
return Pdouble(c * x - s * y, s * x + c * y);
}
// opr, cst
inline Pdouble operator+() { return Pdouble(x, y); }
inline Pdouble operator-() { return Pdouble(-x, -y); }
inline Pdouble operator+(const Pdouble &p) const {
return Pdouble(x + p.x, y + p.y);
}
inline const Pdouble &operator+=(const Pdouble &p) {
x += p.x;
y += p.y;
return *this;
}
inline Pdouble operator-(const Pdouble &p) const {
return Pdouble(x - p.x, y - p.y);
}
inline const Pdouble &operator-=(const Pdouble &p) {
x -= p.x;
y -= p.y;
return *this;
}
inline Pdouble operator*(const Pdouble &p) const {
return Pdouble(x * p.x, y * p.y);
}
inline const Pdouble &operator*=(const Pdouble &p) {
x *= p.x;
y *= p.y;
return *this;
}
inline Pdouble operator/(const Pdouble &p) const {
return Pdouble(x / p.x, y / p.y);
}
inline const Pdouble &operator/=(const Pdouble &p) {
x /= p.x;
y /= p.y;
return *this;
}
inline Pdouble operator*(const double k) const {
return Pdouble(x * k, y * k);
}
inline const Pdouble &operator*=(const double k) {
x *= k;
y *= k;
return *this;
}
inline Pdouble operator/(const double k) const {
return Pdouble(x / k, y / k);
}
inline const Pdouble &operator/=(const double k) {
x /= k;
y /= k;
return *this;
}
inline bool operator<(const Pdouble &p) const {
return x == p.x ? y < p.y : x < p.x;
}
inline bool operator>(const Pdouble &p) const {
return x == p.x ? y > p.y : x > p.x;
}
inline bool operator==(const Pdouble &p) const {
return x == p.x && y == p.y;
}
inline bool operator!=(const Pdouble &p) const {
return x != p.x || y != p.y;
}
Pdouble() {}
Pdouble(const double x, const double y) : x(x), y(y) {}
Pdouble(const Pint &p) : x(p.x), y(p.y) {}
};
istream &operator>>(istream &in, Pdouble &p) { return in >> p.x >> p.y; }
ostream &operator<<(ostream &out, const Pdouble &p) {
return out << "( " << p.x << ", " << p.y << " )";
}
// ( lP, lQ ) と ( nP, nQ ) の線分の交差判定
bool CollisionLine(const Pdouble lP, const Pdouble lQ, const Pdouble nP,
const Pdouble nQ) {
auto sign = [](double d) { return d < 0 ? -1 : d > 0 ? 1 : 0; };
Pdouble v = lQ - lP;
if (sign(v.crs(nP - lP)) == sign(v.crs(nQ - lQ)))
return false;
v = nQ - nP;
return sign(v.crs(lP - nP)) * sign(v.crs(lQ - nP)) <= 0;
}
} // namespace
// util
namespace {
// 初期化
void SpeedUpIO() {
cin.tie(0);
ios::sync_with_stdio(false);
}
// 座圧 O( N log N ). x に座圧後の座標が入る
void Zaatu(int *x, int N) {
map<int, int> map;
For(i, N) map.insert(
std::pair<int, int>(x[i], 0)); // sort すると順番が維持できない
int idx = 0;
ForItr(itr, map) itr->second = idx++;
For(i, N) x[i] = map[x[i]];
}
// double 出力
void DoubleOut(double d, char c = '\n') { printf("%.12f%c", d, c); }
} // namespace
Mod C(int N, int M) {
Mod a = 1, b = 1, c = 1;
For(i, M) { b *= (i + 1); }
For(i, N - M) { c *= (i + 1); }
For(i, N) a *= (i + 1);
return a / (b * c);
}
int main() {
int X, Y;
cin >> X >> Y;
int P = 0, Q = 0;
while (1) {
if (X < Y) {
X--;
Y -= 2;
P++;
} else {
X -= 2;
Y--;
Q++;
}
if (X == 0 && Y == 0)
break;
if (X < 0 || Y < 0) {
cout << 0 << endl;
return 9;
}
}
cout << C(P + Q, P) << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <complex>
#include <functional>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
// 英語は 26 文字
// common
namespace {
#define XINT_MAX LLONG_MAX
#define CAST(T, val) ((T)(val))
#define CASE(lb) \
break; \
case lb:
#define CASE_CONT(lb) case lb:
#define CASE_DEF \
break; \
default:
#define For(i, s) for (int i = 0, forEnd##i = CAST(int, s); i < forEnd##i; ++i)
#define ForA(i, a, s) \
for (int i = CAST(int, a), forEnd##i = CAST(int, s); i < forEnd##i; ++i)
#define ForR(i, s) for (int i = s; i >= 0; i--)
#define ForRA(i, s, e) for (int i = s; i >= e; i--)
#define ForItr(itr, con) \
for (auto itr = con.begin(), forEnd##itr = con.end(); itr != forEnd##itr; \
++itr)
#define ForRItr(itr, con) \
for (auto itr = con.rbegin(), forEnd##itr = con.rend(); itr != forEnd##itr; \
++itr)
#define ForStr(i, str) for (int i = 0; str[i]; ++i)
#define GOTO(lb) goto lb
#define LABEL(lb) \
lb:
#define ALL(con) (con).begin(), (con).end()
template <typename T, typename K> struct Pair {
T fst;
K snd;
bool operator<(const Pair &p) const {
if (fst != p.fst)
return fst < p.fst;
return snd < p.snd;
}
Pair() {}
Pair(T f, T s) : fst(f), snd(s) {}
};
template <typename T, typename K>
std::istream &operator>>(std::istream &in, Pair<T, K> &p) {
return in >> p.fst >> p.snd;
}
template <typename T, typename K, typename H> struct Trir {
T fst;
K snd;
H trd;
bool operator<(const Trir &t) const {
if (fst != t.fst)
return fst < t.fst;
if (snd != t.snd)
return snd < t.snd;
return trd < t.trd;
}
Trir() {}
Trir(T f, T s, H t) : fst(f), snd(s), trd(t) {}
};
template <typename T, typename K, typename H>
std::istream &operator>>(std::istream &in, Trir<T, K, H> &p) {
return in >> p.fst >> p.snd >> p.trd;
}
typedef long long xint;
typedef unsigned long long uxint;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned short ushort;
typedef vector<int> Vi;
typedef vector<xint> Vx;
typedef vector<double> Vd;
typedef set<int> Si;
typedef set<xint> Sx;
typedef Pair<int, int> Pii;
typedef vector<Pii> VPii;
typedef Trir<int, int, int> Tiii;
typedef vector<Pii> VTiii;
const int Ten5 = 100000; // 10^5
const int Ten6 = 1000000; // 10^6
const double EPS = 0.00000000023283064365386962890625; // 2^-32
} // namespace
// min-max-mod
namespace {
// 合同式
class Mod {
public:
typedef xint T; // 型
static T N; // 法
Mod operator+(Mod m) const { return Mod(x + m.x); }
Mod operator+=(Mod m) { return *this = Mod(x + m.x); }
Mod operator-(Mod m) const { return Mod(x - m.x + N); }
Mod operator-=(Mod m) { return *this = Mod(x - m.x + N); }
Mod operator*(Mod m) const { return Mod(x * m.x); }
Mod operator*=(Mod m) { return *this = Mod(x * m.x); }
Mod operator/(
Mod m) const { // フェルマーの小定理より, m.x の逆元は m.x^( HOU-2 )
const T n = N - 2;
T v = m.x, r = x;
for (T b = 1; b < n; b <<= 1) {
if (n & b)
r = r * v % N;
v = v * v % N;
}
return r;
}
Mod operator/=(Mod m) { return *this = *this / m; }
operator T() const { return x; }
Mod() {}
Mod(T v) : x(v % N) {}
private:
T x;
};
Mod::T Mod::N = 1000 * 1000 * 1000 + 7;
// 最大値
template <typename T> class Max {
public:
// 何回更新したか
int cnt() const { return c; }
// 更新したときに true を返す
bool operator=(T v) {
if (!c) {
c = 1;
x = v;
return true;
}
if (x < v) {
c++;
x = v;
return true;
}
return false;
}
operator T() const { return x; }
Max() : x(0), c(0) {}
Max(T v) : x(v), c(1) {}
Max(const T *f, const T *l) : x(*f++), c(1) {
while (f < l) {
*this = *f++;
}
}
Max(const T *a, int n) : x(0), c(0) { For(i, n) *this = *a++; }
private:
T x;
int c;
};
// 最小値
template <typename T> class Min {
public:
// 何回更新したか
int cnt() const { return c; }
// 更新したときに true を返す
bool operator=(T v) {
if (!c) {
c = 1;
x = v;
return true;
}
if (v < x) {
c++;
x = v;
return true;
}
return false;
}
operator T() const { return x; }
Min() : x(0), c(0) {}
Min(T v) : x(v), c(1) {}
Min(const T *f, const T *l) : x(*f++), c(1) {
while (f < l) {
*this = *f++;
}
}
Min(const T *a, int n) : x(0), c(0) { For(i, n) *this = *a++; }
private:
T x;
int c;
};
template <typename T> Mod operator+(Mod m, T x) { return m + Mod(x); }
template <typename T> Mod operator+=(Mod &m, T x) { return m += Mod(x); }
template <typename T> Mod operator+(T x, Mod m) { return Mod(x) + m; }
template <typename T> Mod operator-(Mod m, T x) { return m - Mod(x); }
template <typename T> Mod operator-=(Mod &m, T x) { return m -= Mod(x); }
template <typename T> Mod operator-(T x, Mod m) { return Mod(x) - m; }
template <typename T> Mod operator*(Mod m, T x) { return m * Mod(x); }
template <typename T> Mod operator*=(Mod &m, T x) { return m *= Mod(x); }
template <typename T> Mod operator*(T x, Mod m) { return Mod(x) * m; }
template <typename T> Mod operator/(Mod m, T x) { return m / Mod(x); }
template <typename T> Mod operator/=(Mod &m, T x) { return m /= Mod(x); }
istream &operator>>(istream &in, Mod &m) {
Mod::T t;
in >> t;
m = Mod(t);
return in;
}
ostream &operator<<(ostream &ot, Mod m) { return ot << CAST(Mod::T, m); }
template <typename T> istream &operator>>(istream &in, Max<T> &m) {
T t;
in >> t;
m = Max<T>(t);
return in;
}
template <typename T> ostream &operator<<(ostream &ot, Max<T> m) {
return ot << CAST(T, m);
}
template <typename T> istream &operator>>(istream &in, Min<T> &m) {
T t;
in >> t;
m = Min<T>(t);
return in;
}
template <typename T> ostream &operator<<(ostream &ot, Min<T> m) {
return ot << CAST(T, m);
}
} // namespace
// vec
namespace {
// 2D int Vector
class Pint {
public:
int x, y;
static const Pint dir[8];
// util
static void setup(int width, int height, int offset = -1, bool swap = false) {
Width = width;
Height = height;
Offset = offset;
Swap = swap;
}
inline bool isInFld() const {
return 0 <= x && x < Width && 0 <= y && y < Height;
}
// vector
inline double len() const { return sqrt(sq()); }
inline double len(const Pint &p) const { return sqrt(sq(p)); }
inline int sq() const { return x * x + y * y; }
inline int sq(const Pint &p) const {
return (x - p.x) * (x - p.x) + (y - p.y) * (y - p.y);
}
inline int manhattan() const { return abs(x) + abs(y); }
inline int manhattan(const Pint &p) const {
return abs(x - p.x) + abs(y - p.y);
}
inline int dot(const Pint &p) const { return x * p.x + y * p.y; }
inline int crs(const Pint &p) const { return x * p.y - y * p.x; }
// opr, cst
inline Pint operator+() { return Pint(x, y); }
inline Pint operator-() { return Pint(-x, -y); }
inline Pint operator+(const Pint &p) const { return Pint(x + p.x, y + p.y); }
inline const Pint &operator+=(const Pint &p) {
x += p.x;
y += p.y;
return *this;
}
inline Pint operator-(const Pint &p) const { return Pint(x - p.x, y - p.y); }
inline const Pint &operator-=(const Pint &p) {
x -= p.x;
y -= p.y;
return *this;
}
inline Pint operator*(const Pint &p) const { return Pint(x * p.x, y * p.y); }
inline const Pint &operator*=(const Pint &p) {
x *= p.x;
y *= p.y;
return *this;
}
inline Pint operator/(const Pint &p) const { return Pint(x / p.x, y / p.y); }
inline const Pint &operator/=(const Pint &p) {
x /= p.x;
y /= p.y;
return *this;
}
inline Pint operator*(const int k) const { return Pint(x * k, y * k); }
inline const Pint &operator*=(const int k) {
x *= k;
y *= k;
return *this;
}
inline Pint operator/(const int k) const { return Pint(x / k, y / k); }
inline const Pint &operator/=(const int k) {
x /= k;
y /= k;
return *this;
}
inline bool operator<(const Pint &p) const {
return x == p.x ? y < p.y : x < p.x;
}
inline bool operator>(const Pint &p) const {
return x == p.x ? y > p.y : x > p.x;
}
inline bool operator==(const Pint &p) const { return x == p.x && y == p.y; }
inline bool operator!=(const Pint &p) const { return x != p.x || y != p.y; }
Pint() {}
Pint(const int x, const int y) : x(x), y(y) {}
private:
friend istream &operator>>(istream &in, Pint &p);
friend ostream &operator<<(ostream &out, const Pint &p);
static int Width, Height, Offset;
static bool Swap;
};
istream &operator>>(istream &in, Pint &p) {
int x, y;
in >> x >> y;
x += Pint::Offset;
y += Pint::Offset;
if (Pint::Swap)
p = Pint(y, x);
else
p = Pint(x, y);
return in;
}
ostream &operator<<(ostream &out, const Pint &p) {
return out << "( " << p.x << ", " << p.y << " )";
}
int Pint::Width, Pint::Height, Pint::Offset;
bool Pint::Swap;
const Pint Pint::dir[8] = {Pint(0, 1), Pint(1, 0), Pint(0, -1), Pint(-1, 0),
Pint(1, 1), Pint(1, -1), Pint(-1, 1), Pint(-1, -1)};
// 2D double Vector
class Pdouble {
public:
double x, y;
// vector
inline double len() const { return sqrt(sq()); }
inline double len(const Pdouble &p) const { return sqrt(sq(p)); }
inline double sq() const { return x * x + y * y; }
inline double sq(const Pdouble &p) const {
return (x - p.x) * (x - p.x) + (y - p.y) * (y - p.y);
}
inline Pdouble norm(const double l = 1.0) { return *this * l / len(); }
inline double dot(const Pdouble &p) const { return x * p.x + y * p.y; }
inline double crs(const Pdouble &p) const { return x * p.y - y * p.x; }
inline Pdouble proj(const Pdouble &v) const {
const double s = v.sq();
if (s < EPS * EPS)
return Pdouble(0, 0);
return v * dot(v) / s;
}
inline Pdouble rot(const double rad) const {
const double c = cos(rad), s = sin(rad);
return Pdouble(c * x - s * y, s * x + c * y);
}
// opr, cst
inline Pdouble operator+() { return Pdouble(x, y); }
inline Pdouble operator-() { return Pdouble(-x, -y); }
inline Pdouble operator+(const Pdouble &p) const {
return Pdouble(x + p.x, y + p.y);
}
inline const Pdouble &operator+=(const Pdouble &p) {
x += p.x;
y += p.y;
return *this;
}
inline Pdouble operator-(const Pdouble &p) const {
return Pdouble(x - p.x, y - p.y);
}
inline const Pdouble &operator-=(const Pdouble &p) {
x -= p.x;
y -= p.y;
return *this;
}
inline Pdouble operator*(const Pdouble &p) const {
return Pdouble(x * p.x, y * p.y);
}
inline const Pdouble &operator*=(const Pdouble &p) {
x *= p.x;
y *= p.y;
return *this;
}
inline Pdouble operator/(const Pdouble &p) const {
return Pdouble(x / p.x, y / p.y);
}
inline const Pdouble &operator/=(const Pdouble &p) {
x /= p.x;
y /= p.y;
return *this;
}
inline Pdouble operator*(const double k) const {
return Pdouble(x * k, y * k);
}
inline const Pdouble &operator*=(const double k) {
x *= k;
y *= k;
return *this;
}
inline Pdouble operator/(const double k) const {
return Pdouble(x / k, y / k);
}
inline const Pdouble &operator/=(const double k) {
x /= k;
y /= k;
return *this;
}
inline bool operator<(const Pdouble &p) const {
return x == p.x ? y < p.y : x < p.x;
}
inline bool operator>(const Pdouble &p) const {
return x == p.x ? y > p.y : x > p.x;
}
inline bool operator==(const Pdouble &p) const {
return x == p.x && y == p.y;
}
inline bool operator!=(const Pdouble &p) const {
return x != p.x || y != p.y;
}
Pdouble() {}
Pdouble(const double x, const double y) : x(x), y(y) {}
Pdouble(const Pint &p) : x(p.x), y(p.y) {}
};
istream &operator>>(istream &in, Pdouble &p) { return in >> p.x >> p.y; }
ostream &operator<<(ostream &out, const Pdouble &p) {
return out << "( " << p.x << ", " << p.y << " )";
}
// ( lP, lQ ) と ( nP, nQ ) の線分の交差判定
bool CollisionLine(const Pdouble lP, const Pdouble lQ, const Pdouble nP,
const Pdouble nQ) {
auto sign = [](double d) { return d < 0 ? -1 : d > 0 ? 1 : 0; };
Pdouble v = lQ - lP;
if (sign(v.crs(nP - lP)) == sign(v.crs(nQ - lQ)))
return false;
v = nQ - nP;
return sign(v.crs(lP - nP)) * sign(v.crs(lQ - nP)) <= 0;
}
} // namespace
// util
namespace {
// 初期化
void SpeedUpIO() {
cin.tie(0);
ios::sync_with_stdio(false);
}
// 座圧 O( N log N ). x に座圧後の座標が入る
void Zaatu(int *x, int N) {
map<int, int> map;
For(i, N) map.insert(
std::pair<int, int>(x[i], 0)); // sort すると順番が維持できない
int idx = 0;
ForItr(itr, map) itr->second = idx++;
For(i, N) x[i] = map[x[i]];
}
// double 出力
void DoubleOut(double d, char c = '\n') { printf("%.12f%c", d, c); }
} // namespace
Mod C(int N, int M) {
Mod a = 1, b = 1, c = 1;
For(i, M) { b *= (i + 1); }
For(i, N - M) { c *= (i + 1); }
For(i, N) a *= (i + 1);
return a / (b * c);
}
int main() {
int X, Y;
cin >> X >> Y;
int P = 0, Q = 0;
while (1) {
if (X < Y) {
X--;
Y -= 2;
P++;
} else {
X -= 2;
Y--;
Q++;
}
if (X == 0 && Y == 0)
break;
if (X < 0 || Y < 0) {
cout << 0 << endl;
return 0;
}
}
cout << C(P + Q, P) << endl;
return 0;
}
| replace | 509 | 510 | 509 | 510 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int add(int a, int b) {
int s = a + b;
if (s >= mod)
s -= mod;
return s;
}
int mul(int a, int b) { return (long long)a * b % mod; }
int pow(int b, int e) {
int r = 1;
while (e > 0) {
if (e & 1) {
r = mul(r, b);
}
b = mul(b, b);
e /= 2;
}
return r;
}
int divm(int a, int b) { return mul(a, pow(b, mod - 2)); }
int fac[1000004];
int C(int n, int k) { return divm(fac[n], mul(fac[k], fac[n - k])); }
int main() {
int x, y;
scanf("%d%d", &x, &y);
fac[0] = 1;
for (int i = 1; i <= x; ++i) {
fac[i] = mul(fac[i - 1], i);
}
int k = (x + y) / 3;
printf("%d\n", (k * 3 == (x + y)) ? C(k, x - k) : 0);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int add(int a, int b) {
int s = a + b;
if (s >= mod)
s -= mod;
return s;
}
int mul(int a, int b) { return (long long)a * b % mod; }
int pow(int b, int e) {
int r = 1;
while (e > 0) {
if (e & 1) {
r = mul(r, b);
}
b = mul(b, b);
e /= 2;
}
return r;
}
int divm(int a, int b) { return mul(a, pow(b, mod - 2)); }
int fac[1000004];
int C(int n, int k) { return divm(fac[n], mul(fac[k], fac[n - k])); }
int main() {
int x, y;
scanf("%d%d", &x, &y);
fac[0] = 1;
for (int i = 1; i <= x; ++i) {
fac[i] = mul(fac[i - 1], i);
}
int k = (x + y) / 3;
printf("%d\n", (k * 3 == (x + y) && x >= k && y >= k) ? C(k, x - k) : 0);
return 0;
} | replace | 43 | 44 | 43 | 44 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
const int mod = 1000000007;
int add(int a, int b) { return (a += b) < mod ? a : a - mod; }
int sub(int a, int b) { return (a -= b) >= 0 ? a : a + mod; }
int mul(int a, int b) { return 1LL * a * b % mod; }
void adds(int &a, int b) { a = add(a, b); }
void subs(int &a, int b) { a = sub(a, b); }
void muls(int &a, int b) { a = mul(a, b); }
void maxs(int &a, int b) { a = max(a, b); }
void mins(int &a, int b) { a = min(a, b); }
int pwr(int a, ll p) {
if (p == 0)
return 1;
if (p & 1)
return mul(a, pwr(a, p - 1));
return pwr(mul(a, a), p / 2);
}
int inv(int a) { return pwr(a, mod - 2); }
const int maxn = 4000005;
int f[maxn + 1], fi[maxn + 1];
int ncr(int n, int r) { return mul(f[n], mul(fi[r], fi[n - r])); }
void precompute() {
f[0] = 1;
for (int i = 1; i <= maxn; ++i)
f[i] = mul(f[i - 1], i);
fi[maxn] = inv(f[maxn]);
for (int i = maxn - 1; i >= 0; --i)
fi[i] = mul(fi[i + 1], i + 1);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
precompute();
int x, y;
cin >> x >> y;
if ((2 * y - x) % 3)
return cout << 0, 0;
int b = (2 * y - x) / 3;
int a = y - 2 * b;
cout << ncr(a + b, a);
}
| #include <bits/stdc++.h>
#define all(x) begin(x), end(x)
#define dbg(x) cerr << #x << " = " << x << endl
#define _ << ' ' <<
using namespace std;
using ll = long long;
using vi = vector<int>;
const int mod = 1000000007;
int add(int a, int b) { return (a += b) < mod ? a : a - mod; }
int sub(int a, int b) { return (a -= b) >= 0 ? a : a + mod; }
int mul(int a, int b) { return 1LL * a * b % mod; }
void adds(int &a, int b) { a = add(a, b); }
void subs(int &a, int b) { a = sub(a, b); }
void muls(int &a, int b) { a = mul(a, b); }
void maxs(int &a, int b) { a = max(a, b); }
void mins(int &a, int b) { a = min(a, b); }
int pwr(int a, ll p) {
if (p == 0)
return 1;
if (p & 1)
return mul(a, pwr(a, p - 1));
return pwr(mul(a, a), p / 2);
}
int inv(int a) { return pwr(a, mod - 2); }
const int maxn = 4000005;
int f[maxn + 1], fi[maxn + 1];
int ncr(int n, int r) { return mul(f[n], mul(fi[r], fi[n - r])); }
void precompute() {
f[0] = 1;
for (int i = 1; i <= maxn; ++i)
f[i] = mul(f[i - 1], i);
fi[maxn] = inv(f[maxn]);
for (int i = maxn - 1; i >= 0; --i)
fi[i] = mul(fi[i + 1], i + 1);
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
precompute();
int x, y;
cin >> x >> y;
if ((2 * y - x) % 3)
return cout << 0, 0;
int b = (2 * y - x) / 3;
int a = y - 2 * b;
if (b < 0 || a < 0)
return cout << 0, 0;
cout << ncr(a + b, a);
}
| insert | 49 | 49 | 49 | 51 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MM = 1000000000;
ll mod = MM + 7;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (int i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
ll fact[800000], fact_inv[800000];
ll power(ll a, ll n) { // 繰り返し二乗法
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll comb(ll n, ll r) {
return fact[n] * fact_inv[r] % mod * fact_inv[n - r] % mod;
}
int main() {
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll a = (2 * x - y) / 3;
ll b = (2 * y - x) / 3;
ll n = 700000;
fact[0] = 1;
for (ll i = 0; i < n; i++)
fact[i + 1] = fact[i] * (i + 1) % mod;
fact_inv[n] = power(fact[n], mod - 2);
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % mod;
cout << comb(a + b, b) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MM = 1000000000;
ll mod = MM + 7;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define Rep(i, j, n) for (int i = j; i < n; i++)
#define all(vec) vec.begin(), vec.end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const ll INF = 1LL << 60;
ll fact[800000], fact_inv[800000];
ll power(ll a, ll n) { // 繰り返し二乗法
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll comb(ll n, ll r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return fact[n] * fact_inv[r] % mod * fact_inv[n - r] % mod;
}
int main() {
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll a = (2 * x - y) / 3;
ll b = (2 * y - x) / 3;
ll n = 700000;
fact[0] = 1;
for (ll i = 0; i < n; i++)
fact[i + 1] = fact[i] * (i + 1) % mod;
fact_inv[n] = power(fact[n], mod - 2);
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % mod;
cout << comb(a + b, b) << endl;
} | insert | 38 | 38 | 38 | 42 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
ll x, y, a, b, fact[2000010];
ll power(ll a, ll b = mod - 2) {
ll ans = 1;
while (b) {
if (b & 1)
ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
void init(ll n) {
fact[0] = 1;
for (ll i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i % mod;
}
ll C(ll n, ll m) {
return fact[n] * power(fact[m]) % mod * power(fact[n - m]) % mod;
}
int main() {
ios::sync_with_stdio(false);
cin >> x >> y;
b = (2 * y - x) / 3;
a = (2 * x - y) / 3;
init(a + b);
if (2 * a + b != x || 2 * b + a != y)
cout << 0 << endl;
else
cout << C(a + b, a) << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const ll mod = 1e9 + 7;
ll x, y, a, b, fact[2000010];
ll power(ll a, ll b = mod - 2) {
ll ans = 1;
while (b) {
if (b & 1)
ans = ans * a % mod;
a = a * a % mod;
b >>= 1;
}
return ans;
}
void init(ll n) {
fact[0] = 1;
for (ll i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i % mod;
}
ll C(ll n, ll m) {
return fact[n] * power(fact[m]) % mod * power(fact[n - m]) % mod;
}
int main() {
ios::sync_with_stdio(false);
cin >> x >> y;
b = (2 * y - x) / 3;
a = (2 * x - y) / 3;
init(a + b);
if (2 * a + b != x || 2 * b + a != y || a < 0 || b < 0)
cout << 0 << endl;
else
cout << C(a + b, a) << endl;
return 0;
} | replace | 29 | 30 | 29 | 30 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
constexpr ll INF = 9e18;
constexpr int inf = 1e9;
const double INFD = 1e100;
const ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
};
// intやllをstringに変換
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
// ----------------------------------------------------------------------------
ll Pow(ll x, ll p) {
if (!p)
return 1;
if (p % 2) {
return (x * Pow(x, p - 1)) % mod;
}
ll t = Pow(x, p >> 1);
return (t * t) % mod;
}
struct combination {
vector<ll> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (ll i = 1; i <= n; i++)
fact[i] = (fact[i - 1] * i) % mod;
ifact[n] = Pow(fact[n], mod - 2);
for (ll i = n; i >= 1; i--)
ifact[i - 1] = (ifact[i] * i) % mod;
}
ll operator()(ll n, ll k) {
return (((fact[n] * ifact[k]) % mod) * ifact[n - k]) % mod;
}
};
int main() {
ll X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll temp = X + Y;
X -= temp / 3;
Y -= temp / 3;
if (X < 0 || Y < 0) {
cout << 0 << endl;
}
combination c(X + Y);
cout << c(X + Y, Y) << endl;
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
// #include<bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
constexpr ll INF = 9e18;
constexpr int inf = 1e9;
const double INFD = 1e100;
const ll mod = 1000000007;
const double PI = 3.1415926535897932384626433832795028841971;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
};
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
};
// intやllをstringに変換
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
};
// ----------------------------------------------------------------------------
ll Pow(ll x, ll p) {
if (!p)
return 1;
if (p % 2) {
return (x * Pow(x, p - 1)) % mod;
}
ll t = Pow(x, p >> 1);
return (t * t) % mod;
}
struct combination {
vector<ll> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (ll i = 1; i <= n; i++)
fact[i] = (fact[i - 1] * i) % mod;
ifact[n] = Pow(fact[n], mod - 2);
for (ll i = n; i >= 1; i--)
ifact[i - 1] = (ifact[i] * i) % mod;
}
ll operator()(ll n, ll k) {
return (((fact[n] * ifact[k]) % mod) * ifact[n - k]) % mod;
}
};
int main() {
ll X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll temp = X + Y;
X -= temp / 3;
Y -= temp / 3;
if (X < 0 || Y < 0) {
cout << 0 << endl;
return 0;
}
combination c(X + Y);
cout << c(X + Y, Y) << endl;
return 0;
}
| insert | 89 | 89 | 89 | 90 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
using P = pair<ll, ll>;
const ll MOD = 1000000007;
// nのcnt乗
ll pow2(ll n, ll cnt) {
if (cnt == 0)
return 1;
if (cnt == 1)
return n;
ll tmp = pow2(n, cnt / 2);
if (cnt % 2 == 0)
return tmp % MOD * tmp % MOD;
else
return tmp % MOD * n % MOD * tmp % MOD;
}
// nから(n-cnt+1)までの積
ll fac(ll n, ll cnt) {
if (cnt == 0)
return 1;
if (cnt == 1)
return n;
return fac(n - 1, cnt - 1) % MOD * n % MOD;
}
int main() {
ll x, y;
cin >> x >> y;
if ((2 * x - y) < 0 || (2 * x - y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll t = (2 * x - y) / 3;
ll s = x - 2 * t;
ll n = s + t;
// nCs mod MOD を求める
ll m = min(s, t);
ll denominator = fac(m, m) % MOD;
ll ans = fac(n, m) * pow2(denominator, MOD - 2);
ans %= MOD;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
using P = pair<ll, ll>;
const ll MOD = 1000000007;
// nのcnt乗
ll pow2(ll n, ll cnt) {
if (cnt == 0)
return 1;
if (cnt == 1)
return n;
ll tmp = pow2(n, cnt / 2);
if (cnt % 2 == 0)
return tmp % MOD * tmp % MOD;
else
return tmp % MOD * n % MOD * tmp % MOD;
}
// nから(n-cnt+1)までの積
ll fac(ll n, ll cnt) {
if (cnt == 0)
return 1;
if (cnt == 1)
return n;
return fac(n - 1, cnt - 1) % MOD * n % MOD;
}
int main() {
ll x, y;
cin >> x >> y;
if ((2 * x - y) < 0 || (2 * x - y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll t = (2 * x - y) / 3;
ll s = x - 2 * t;
ll n = s + t;
// nCs mod MOD を求める
ll m = min(s, t);
if (m < 0) {
cout << 0 << endl;
return 0;
}
ll denominator = fac(m, m) % MOD;
ll ans = fac(n, m) * pow2(denominator, MOD - 2);
ans %= MOD;
cout << ans << endl;
return 0;
}
| insert | 45 | 45 | 45 | 49 | 0 | |
p02862 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#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
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cerr << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl
//----------------------------------------------------------------
// int MOD = 998244353;
int MOD = 1000000007;
ll bitpow(ll x, ll n) {
ll ans = 1;
while (n > 0) {
if (n % 2 == 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
// 高速nCk
#define N 2000010
int fac[N + 1];
int inv[N + 1];
ll COM(ll n, ll k) { return fac[n] * inv[k] % MOD * inv[n - k] % MOD; }
//----------------------------------------------------------------
signed main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
if ((2 * x > y && y > x) || (2 * y > x && x > y)) {
cout << 0 << endl;
return 0;
}
fac[0] = 1;
inv[0] = 1;
for (int i = 1; i <= N; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = bitpow(fac[i], MOD - 2) % MOD;
}
int n = (x + y) / 3;
int X = x - n;
int Y = n - X;
cout << fac[X + Y] * inv[X] % MOD * inv[Y] % MOD << endl;
// cout << n << " " << X << " " << Y << endl;
return 0;
}
//----------------------------------------------------------------
// g++ -std=c++14 code1.cpp
// sudo pip3 install --upgrade online-judge-tools
// rm -r -f test;oj dl
// https://code-festival-2018-quala.contest.atcoder.jp/tasks/code_festival_2018_quala_c
// rm -r -f test;oj dl
// https://nikkei2019-2-qual.contest.atcoder.jp/tasks/nikkei2019_2_qual_b rm -r
// -f test;oj dl https://abc145.contest.atcoder.jp/tasks/abc145_b | #include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
#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
#define all(x) (x).begin(), (x).end()
#define debug(x) cerr << #x << ": " << x << endl
#define debug_vec(v) \
cerr << #v << ":"; \
rep(i, v.size()) cerr << " " << v[i]; \
cerr << endl
//----------------------------------------------------------------
// int MOD = 998244353;
int MOD = 1000000007;
ll bitpow(ll x, ll n) {
ll ans = 1;
while (n > 0) {
if (n % 2 == 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
// 高速nCk
#define N 2000010
int fac[N + 1];
int inv[N + 1];
ll COM(ll n, ll k) { return fac[n] * inv[k] % MOD * inv[n - k] % MOD; }
//----------------------------------------------------------------
signed main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
if (2 * x < y || 2 * y < x) {
cout << 0 << endl;
return 0;
}
fac[0] = 1;
inv[0] = 1;
for (int i = 1; i <= N; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = bitpow(fac[i], MOD - 2) % MOD;
}
int n = (x + y) / 3;
int X = x - n;
int Y = n - X;
cout << fac[X + Y] * inv[X] % MOD * inv[Y] % MOD << endl;
// cout << n << " " << X << " " << Y << endl;
return 0;
}
//----------------------------------------------------------------
// g++ -std=c++14 code1.cpp
// sudo pip3 install --upgrade online-judge-tools
// rm -r -f test;oj dl
// https://code-festival-2018-quala.contest.atcoder.jp/tasks/code_festival_2018_quala_c
// rm -r -f test;oj dl
// https://nikkei2019-2-qual.contest.atcoder.jp/tasks/nikkei2019_2_qual_b rm -r
// -f test;oj dl https://abc145.contest.atcoder.jp/tasks/abc145_b | replace | 53 | 54 | 53 | 54 | 0 | |
p02862 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <climits>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define MEMSET(v, h) memset((v), h, sizeof(v))
typedef long long ll;
using namespace std;
const int MAX = 51000000;
const int MOD = 1000000007;
static 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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(void) {
ll X, Y;
COMinit();
cin >> X >> Y;
if ((2 * Y - X) < 0 || ((2 * Y - X) % 3 != 0) || (2 * X - Y) < 0 ||
((2 * X - Y) % 3 != 0)) {
cout << 0 << endl;
} else {
ll k = (2 * Y - X) / 3;
ll l = (2 * X - Y) / 3;
// cout<<k <<" " << l <<endl;
cout << COM(k + l, k) << endl;
}
return 0;
}
| #include <algorithm>
#include <climits>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define all(x) (x).begin(), (x).end()
#define MEMSET(v, h) memset((v), h, sizeof(v))
typedef long long ll;
using namespace std;
const int MAX = 5100000;
const int MOD = 1000000007;
static 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] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main(void) {
ll X, Y;
COMinit();
cin >> X >> Y;
if ((2 * Y - X) < 0 || ((2 * Y - X) % 3 != 0) || (2 * X - Y) < 0 ||
((2 * X - Y) % 3 != 0)) {
cout << 0 << endl;
} else {
ll k = (2 * Y - X) / 3;
ll l = (2 * X - Y) / 3;
// cout<<k <<" " << l <<endl;
cout << COM(k + l, k) << endl;
}
return 0;
}
| replace | 18 | 19 | 18 | 19 | MLE | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
double PI = 3.141592653589793238462643383279;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
struct CONBINATION {
vector<ll> kai, mokai;
ll mod_pow(ll x, ll y) {
ll ret = 1;
while (y) {
if (y & 1)
ret = ret * x % MOD;
x = x * x % MOD;
y /= 2;
}
return ret;
}
void init(int _n) {
kai.assign(_n + 1, 0);
mokai.assign(_n + 1, 0);
kai[0] = 1;
for (int i = 1; i <= _n; i++)
kai[i] = kai[i - 1] * i % MOD;
for (int i = 0; i <= _n; i++)
mokai[i] = mod_pow(kai[i], MOD - 2);
}
ll conb(ll x, ll y) {
ll z = x - y;
ll ret = kai[x] * mokai[y] % MOD;
ret = ret * mokai[z] % MOD;
return ret;
}
} conb;
ll X, Y;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll n = (X + Y) / 3;
X -= n;
Y -= n;
conb.init(2000000);
cout << conb.conb(n, X) << endl;
} | #include <algorithm>
#include <complex>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <string.h>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pi;
typedef pair<pi, pi> pp;
typedef pair<ll, ll> pl;
double PI = 3.141592653589793238462643383279;
const double EPS = 1e-9;
const ll MOD = 1000000007;
const int inf = 1 << 30;
const ll linf = 1LL << 60;
struct CONBINATION {
vector<ll> kai, mokai;
ll mod_pow(ll x, ll y) {
ll ret = 1;
while (y) {
if (y & 1)
ret = ret * x % MOD;
x = x * x % MOD;
y /= 2;
}
return ret;
}
void init(int _n) {
kai.assign(_n + 1, 0);
mokai.assign(_n + 1, 0);
kai[0] = 1;
for (int i = 1; i <= _n; i++)
kai[i] = kai[i - 1] * i % MOD;
for (int i = 0; i <= _n; i++)
mokai[i] = mod_pow(kai[i], MOD - 2);
}
ll conb(ll x, ll y) {
ll z = x - y;
ll ret = kai[x] * mokai[y] % MOD;
ret = ret * mokai[z] % MOD;
return ret;
}
} conb;
ll X, Y;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll n = (X + Y) / 3;
X -= n;
Y -= n;
if (X < 0 || Y < 0) {
cout << 0 << endl;
return 0;
}
conb.init(2000000);
cout << conb.conb(n, X) << endl;
} | insert | 70 | 70 | 70 | 74 | 0 | |
p02862 | C++ | Runtime Error | // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define itr(it, x) for (auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) \
v[x].pb(y); \
v[y].pb(x);
#define popc __builtin_popcount
#define ANS(s) \
{ \
cout << s << "\n"; \
return; \
}
// functions
template <typename T> void unique(T &c) {
c.erase(std::unique(c.begin(), c.end()), c.end());
}
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 (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 != vec.size())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
// constants
const ll N = 1e5 + 5, M = 1e6 + 5, A = 1e7 + 5, inf = 1e9;
const long long linf = 1LL << 60;
const double er = 1e-10, pi = 3.141592653589793238463;
const ll lx[4] = {0, 1, -1, 0};
const ll ly[4] = {1, 0, 0, -1};
const ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
// io
struct fast_io {
fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
}
} fast_io_;
ll f[M], fin[M];
ll power(ll a, ll b = MOD - 2) {
if (b == 0)
return 1;
ll r = power(a, b / 2);
r = (r * r) % MOD;
if (b % 2)
r = (r * a) % MOD;
return r;
}
void pre() {
f[0] = fin[0] = 1;
for (ll i = 1; i < M; i++) {
f[i] = (f[i - 1] * i) % MOD;
fin[i] = (fin[i - 1] * power(i)) % MOD;
}
}
ll C(ll n, ll r) { return (f[n] * ((fin[r] * fin[n - r]) % MOD)) % MOD; }
void solve() {
pre();
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0)
ANS(0);
ll k = (x + y) / 3;
ll cx = k * 2, cy = k;
if (x > cx || y < cy)
ANS(0);
ll no = abs(cx - x) + abs(cy - y);
no /= 2; // cout << cx << " " << cy << endl;
cout << C(k, no);
}
int main(int argc, char const *argv[]) {
ll t = 1; // cin >> t;
while (t--) {
solve();
}
return 0;
}
| // includes
#include "bits/stdc++.h"
using namespace std;
// macros
#define ll long long
#define MOD 1000000007 // 998244353 //100000000 //
#define pii pair<ll, ll>
#define piii pair<ll, pii>
#define sz(x) ((ll)(x).size())
#define ft first
#define sd second
#define pb push_back
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repr(i, n) for (ll i = n - 1; i >= 0; i--)
#define itr(it, x) for (auto it = x.begin(); it != x.end(); it++)
#define mem(a, b) memset(a, (ll)b, sizeof(a))
#define all(v) v.begin(), v.end()
#define allr(v) v.rbegin(), v.rend()
#define edge(v, x, y) \
v[x].pb(y); \
v[y].pb(x);
#define popc __builtin_popcount
#define ANS(s) \
{ \
cout << s << "\n"; \
return; \
}
// functions
template <typename T> void unique(T &c) {
c.erase(std::unique(c.begin(), c.end()), c.end());
}
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 (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 != vec.size())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_set<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T>
ostream &operator<<(ostream &os, const unordered_multiset<T> &st) {
for (auto itr = st.begin(); itr != st.end(); ++itr) {
os << *itr;
auto titr = itr;
if (++titr != st.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, const unordered_map<T1, T2> &mp) {
for (auto itr = mp.begin(); itr != mp.end(); ++itr) {
os << "(" << itr->first << ", " << itr->second << ")";
auto titr = itr;
if (++titr != mp.end())
os << " ";
}
return os;
}
// constants
const ll N = 1e5 + 5, M = 1e6 + 5, A = 1e7 + 5, inf = 1e9;
const long long linf = 1LL << 60;
const double er = 1e-10, pi = 3.141592653589793238463;
const ll lx[4] = {0, 1, -1, 0};
const ll ly[4] = {1, 0, 0, -1};
const ll dx[8] = {0, 0, 1, -1, 1, -1, 1, -1};
const ll dy[8] = {1, -1, 0, 0, 1, 1, -1, -1};
// io
struct fast_io {
fast_io() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
}
} fast_io_;
ll f[M], fin[M];
ll power(ll a, ll b = MOD - 2) {
if (b == 0)
return 1;
ll r = power(a, b / 2);
r = (r * r) % MOD;
if (b % 2)
r = (r * a) % MOD;
return r;
}
void pre() {
f[0] = fin[0] = 1;
for (ll i = 1; i < M; i++) {
f[i] = (f[i - 1] * i) % MOD;
fin[i] = (fin[i - 1] * power(i)) % MOD;
}
}
ll C(ll n, ll r) { return (f[n] * ((fin[r] * fin[n - r]) % MOD)) % MOD; }
void solve() {
pre();
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0)
ANS(0);
ll k = (x + y) / 3;
ll cx = k * 2, cy = k;
if (x > cx || x < cy)
ANS(0);
ll no = abs(cx - x) + abs(cy - y);
no /= 2; // cout << cx << " " << cy << endl;
cout << C(k, no);
}
int main(int argc, char const *argv[]) {
ll t = 1; // cin >> t;
while (t--) {
solve();
}
return 0;
}
| replace | 164 | 165 | 164 | 165 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll i, j;
ll x, y;
cin >> x >> y;
if ((x + y) % 3) {
cout << 0 << endl;
return 0;
}
ll max_number = (x + y) / 3;
int MOD = 1e9 + 7;
ll l = x - max_number;
vector<ll> fac(max_number + 1, 1);
vector<ll> inv(max_number + 1, 1);
vector<ll> finv(max_number + 1, 1);
vector<ll> nCk(max_number + 1, 1);
for (i = 2; i <= max_number; ++i) {
inv.at(i) = MOD - inv.at(MOD % i) * (MOD / i) % MOD;
}
for (i = 1; i <= max_number; ++i) {
fac.at(i) = fac.at(i - 1) * i % MOD;
finv.at(i) = finv.at(i - 1) * inv.at(i) % MOD;
}
for (i = 1; i <= max_number; ++i) {
nCk.at(i) =
fac.at(max_number) * finv.at(i) % MOD * finv.at(max_number - i) % MOD;
}
cout << nCk.at(l) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int main() {
ll i, j;
ll x, y;
cin >> x >> y;
if ((x + y) % 3) {
cout << 0 << endl;
return 0;
}
ll max_number = (x + y) / 3;
int MOD = 1e9 + 7;
ll l = x - max_number;
ll k = y - max_number;
if (l < 0 || k < 0) {
cout << 0 << endl;
return 0;
}
vector<ll> fac(max_number + 1, 1);
vector<ll> inv(max_number + 1, 1);
vector<ll> finv(max_number + 1, 1);
vector<ll> nCk(max_number + 1, 1);
for (i = 2; i <= max_number; ++i) {
inv.at(i) = MOD - inv.at(MOD % i) * (MOD / i) % MOD;
}
for (i = 1; i <= max_number; ++i) {
fac.at(i) = fac.at(i - 1) * i % MOD;
finv.at(i) = finv.at(i - 1) * inv.at(i) % MOD;
}
for (i = 1; i <= max_number; ++i) {
nCk.at(i) =
fac.at(max_number) * finv.at(i) % MOD * finv.at(max_number - i) % MOD;
}
cout << nCk.at(l) << endl;
return 0;
} | replace | 17 | 18 | 17 | 22 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.