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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02861 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int x[10], y[10];
double dist(int i, int j) {
double dx = x[i] - x[j];
double dy = y[i] - y[j];
return pow(dx * dx + dy * dy, 0.5);
}
void solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i];
vector<int> v(n);
for (int i = 0; i < n; i++)
v[i] = i + 1;
double sum = 0.0;
do {
for (int i = 0; i < n - 1; i++)
sum + dist(x[i], v[i + 1]);
} while (next_permutation(v.begin(), v.end()));
int Factorial = 1;
for (int i = 2; i <= n; i++)
Factorial *= i;
cout << fixed << setprecision(10) << sum / Factorial << endl;
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
int x[10], y[10];
double dist(int i, int j) {
double dx = x[i] - x[j];
double dy = y[i] - y[j];
return pow(dx * dx + dy * dy, 0.5);
}
void solve() {
cin >> n;
for (int i = 1; i <= n; i++)
cin >> x[i] >> y[i];
vector<int> v(n);
for (int i = 0; i < n; i++)
v[i] = i + 1;
double sum = 0.0;
do {
for (int i = 0; i < n - 1; i++)
sum += dist(v[i], v[i + 1]);
} while (next_permutation(v.begin(), v.end()));
int Factorial = 1;
for (int i = 2; i <= n; i++)
Factorial *= i;
cout << fixed << setprecision(10) << sum / Factorial << endl;
}
int main() {
solve();
return 0;
}
| replace | 23 | 24 | 23 | 24 | 0 | |
p02861 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int N;
int x[10], y[10];
double dist(int i, int j) {
double dx = x[i] - x[j];
double dy = y[i] - y[j];
return pow(dx * dx + dy * dy, 0.5);
}
void solve() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> x[i] >> y[i];
double sum = 0.0;
vector<int> v(N);
for (int i = 0; i < N; i++)
v[i] = i + 1;
do {
for (int i = 0; i <= N - 1; i++)
sum += dist(v[i], v[i + 1]);
} while (next_permutation(v.begin(), v.end()));
int Factorial = 1;
for (int i = 2; i <= N; i++)
Factorial *= i;
cout << fixed << setprecision(10) << sum / Factorial << endl;
return;
}
int main() {
solve();
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, N) for (int i = 0; i < N; i++)
using namespace std;
int N;
int x[10], y[10];
double dist(int i, int j) {
double dx = x[i] - x[j];
double dy = y[i] - y[j];
return pow(dx * dx + dy * dy, 0.5);
}
void solve() {
cin >> N;
for (int i = 1; i <= N; i++)
cin >> x[i] >> y[i];
double sum = 0.0;
vector<int> v(N);
for (int i = 0; i < N; i++)
v[i] = i + 1;
do {
for (int i = 0; i < N - 1; i++)
sum += dist(v[i], v[i + 1]);
} while (next_permutation(v.begin(), v.end()));
int Factorial = 1;
for (int i = 2; i <= N; i++)
Factorial *= i;
cout << fixed << setprecision(10) << sum / Factorial << endl;
return;
}
int main() {
solve();
return 0;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p02861 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int N;
int x[7], y[7];
double dist(int i, int j) {
int dx = x[i] - x[j];
int dy = y[i] - y[j];
return pow(dx * dx + dy * dy, 0.5);
}
void solve() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> x[i] >> y[i];
double sum;
vector<int> v(N);
for (int i = 0; i < N; i++)
v.at(i) = i;
do {
for (int i = 0; i < N - 1; i++)
sum += dist(v.at(i), v.at(i + 1));
} while (next_permutation(v.begin(), v.end()));
int dn = 1;
for (int i = 2; i <= N; i++)
dn *= i;
cout << fixed << setprecision(10) << sum / dn << endl;
return;
}
int main(void) {
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int N;
int x[10], y[10];
double dist(int i, int j) {
int dx = x[i] - x[j];
int dy = y[i] - y[j];
return pow(dx * dx + dy * dy, 0.5);
}
void solve() {
cin >> N;
for (int i = 0; i < N; i++)
cin >> x[i] >> y[i];
double sum;
vector<int> v(N);
for (int i = 0; i < N; i++)
v.at(i) = i;
do {
for (int i = 0; i < N - 1; i++)
sum += dist(v.at(i), v.at(i + 1));
} while (next_permutation(v.begin(), v.end()));
int dn = 1;
for (int i = 2; i <= N; i++)
dn *= i;
cout << fixed << setprecision(10) << sum / dn << endl;
return;
}
int main(void) {
solve();
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02861 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define pb push_back
#define ll long long
#define vi vector<long long>
#define pi pair<long long, long long>
#define mp make_pair
#define endl '\n'
#define _ << ' '
#define FAST_LOG2(x) \
(sizeof(unsigned long) * 8 - 1 - __builtin_clzl((unsigned long)(x)))
#define clog2(x) (((x) - (1 << FAST_LOG2(x))) ? FAST_LOG2(x) + 1 : FAST_LOG2(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
idxset;
// find_by_order(i) : iterator to the value at index i, order_of_key(x) : the
// index of value x
const ll mod = (ll)1e9 + 7;
const ll INF = (ll)1e9;
const ll N = (1 << 5);
const double PI = 3.1415926535897;
double n, a, b, ans = 0;
vector<pair<double, double>> towns;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("B.txt", "r", stdin);
#endif
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
towns.pb({a, b});
}
sort(all(towns));
do {
for (int i = 0; i < sz(towns) - 1; i++) {
double dx = towns[i + 1].F - towns[i].F, dy = towns[i + 1].S - towns[i].S;
ans += sqrt(dx * dx + dy * dy);
}
} while (next_permutation(all(towns)));
for (double i = 2; i <= n; i++) {
ans /= i;
}
cout << fixed << setprecision(9) << ans;
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define all(a) a.begin(), a.end()
#define F first
#define S second
#define sz(x) (int)x.size()
#define pb push_back
#define ll long long
#define vi vector<long long>
#define pi pair<long long, long long>
#define mp make_pair
#define endl '\n'
#define _ << ' '
#define FAST_LOG2(x) \
(sizeof(unsigned long) * 8 - 1 - __builtin_clzl((unsigned long)(x)))
#define clog2(x) (((x) - (1 << FAST_LOG2(x))) ? FAST_LOG2(x) + 1 : FAST_LOG2(x))
using namespace __gnu_pbds;
using namespace std;
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
idxset;
// find_by_order(i) : iterator to the value at index i, order_of_key(x) : the
// index of value x
const ll mod = (ll)1e9 + 7;
const ll INF = (ll)1e9;
const ll N = (1 << 5);
const double PI = 3.1415926535897;
double n, a, b, ans = 0;
vector<pair<double, double>> towns;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
// freopen("B.txt", "r", stdin);
#endif
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a >> b;
towns.pb({a, b});
}
sort(all(towns));
do {
for (int i = 0; i < sz(towns) - 1; i++) {
double dx = towns[i + 1].F - towns[i].F, dy = towns[i + 1].S - towns[i].S;
ans += sqrt(dx * dx + dy * dy);
}
} while (next_permutation(all(towns)));
for (double i = 2; i <= n; i++) {
ans /= i;
}
cout << fixed << setprecision(9) << ans;
}
| replace | 36 | 37 | 36 | 37 | 0 | |
p02861 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (int i = (N)-1; i >= 0; i--)
#define rep1(i, N) for (int i = 1; i <= (N); i++)
#define repr1(i, N) for (int i = (N); i > 0; i--)
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define vrep(v, it) for (auto it = v.begin(); it != v.end(); it++)
#define vrepr(v, it) for (auto it = v.rbegin(); it != v.rend(); it++)
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
using namespace std;
void solve();
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {
IoSetupNya() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(7);
}
} iosetupnya;
template <typename T, typename U> inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U> inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
rep(i, s) os << (i ? " " : "") << v[i];
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...) \
do { \
cerr << #__VA_ARGS__ << " = "; \
dbg_out(__VA_ARGS__); \
} while (0)
#define trca(v, N) \
do { \
cerr << #v << " = "; \
array_out(v, N); \
cout << endl; \
} while (0)
#else
#define trc(...)
#define trca(...)
int main() { solve(); }
#endif
using P = pair<double, double>;
using vp = vector<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;
////////////////
double dist(P a, P b) {
return sqrt((a.fi - b.fi) * (a.fi - b.fi) + (a.se - b.se) * (a.se - b.se));
}
void solve() {
ini(N);
vp v(N);
in(v);
vi ord(N);
iota(all(ord), 0);
double ans = 0.0;
do {
rep(i, N - 1) ans += dist(v[ord[i]], v[ord[i + 1]]);
} while (next_permutation(all(ord)));
rep1(i, N) ans /= i;
out(ans);
} | #include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (int i = (N)-1; i >= 0; i--)
#define rep1(i, N) for (int i = 1; i <= (N); i++)
#define repr1(i, N) for (int i = (N); i > 0; i--)
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define vrep(v, it) for (auto it = v.begin(); it != v.end(); it++)
#define vrepr(v, it) for (auto it = v.rbegin(); it != v.rend(); it++)
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
using namespace std;
void solve();
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {
IoSetupNya() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(7);
}
} iosetupnya;
template <typename T, typename U> inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U> inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
rep(i, s) os << (i ? " " : "") << v[i];
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...) \
do { \
cerr << #__VA_ARGS__ << " = "; \
dbg_out(__VA_ARGS__); \
} while (0)
#define trca(v, N) \
do { \
cerr << #v << " = "; \
array_out(v, N); \
cout << endl; \
} while (0)
#else
#define trc(...)
#define trca(...)
int main() { solve(); }
#endif
using P = pair<double, double>;
using vp = vector<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;
////////////////
double dist(P a, P b) {
return sqrt((a.fi - b.fi) * (a.fi - b.fi) + (a.se - b.se) * (a.se - b.se));
}
void solve() {
ini(N);
vp v(N);
in(v);
vi ord(N);
iota(all(ord), 0);
double ans = 0.0;
do {
rep(i, N - 1) ans += dist(v[ord[i]], v[ord[i + 1]]);
} while (next_permutation(all(ord)));
rep1(i, N) ans /= i;
out(ans);
}
| delete | 0 | 3 | 0 | 0 | 0 | |
p02861 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
bool isPrime(int n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
for (int i = 3; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
int n;
cin >> n;
double sum = 0;
int cnt = 0;
vector<int> x(n);
vector<int> y(n);
vector<int> order(n);
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i];
for (int i = 0; i < n; i++)
order[i] = i;
do {
for (int i = 0; i < n - 1; i++) {
double x_diff = x[order[i]] - x[order[i + 1]];
double y_diff = y[order[i]] - y[order[i + 1]];
double distance = x_diff * x_diff + y_diff * y_diff;
sum += sqrt(distance);
}
cnt++;
} while (next_permutation(All(order)));
printf("%.10Lf\n", sum / cnt);
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define All(a) a.begin(), a.end()
#define INF 1000000007
const int MOD = 1000000007;
// accumulate(vec.begin(), vec.end(), 0)
int gcd(int x, int y) {
if (x % y == 0)
return y;
else
return gcd(y, x % y);
}
bool isPrime(int n) {
if (n < 2)
return false;
else if (n == 2)
return true;
else if (n % 2 == 0)
return false;
for (int i = 3; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return true;
}
int main() {
int n;
cin >> n;
double sum = 0;
int cnt = 0;
vector<int> x(n);
vector<int> y(n);
vector<int> order(n);
for (int i = 0; i < n; i++)
cin >> x[i] >> y[i];
for (int i = 0; i < n; i++)
order[i] = i;
do {
for (int i = 0; i < n - 1; i++) {
double x_diff = x[order[i]] - x[order[i + 1]];
double y_diff = y[order[i]] - y[order[i + 1]];
double distance = x_diff * x_diff + y_diff * y_diff;
sum += sqrt(distance);
}
cnt++;
} while (next_permutation(All(order)));
printf("%.10f\n", sum / cnt);
}
| replace | 54 | 55 | 54 | 55 | 0 | |
p02861 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
struct Point {
double x;
double y;
Point() {}
Point(int x, int y) {
this->x = x;
this->y = y;
}
};
long long factorial(int n) {
if (n == 1)
return 1;
else
return n * factorial(n - 1);
}
bool operator<(const Point &ls, const Point &rs) {
if (ls.x < rs.x)
return true;
if (ls.x == rs.x)
return ls.x < rs.y;
return false;
}
int main() {
int n;
cin >> n;
vector<Point> v;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
v.push_back(Point(x, y));
}
sort(v.begin(), v.end());
double sum = 0;
do {
for (int i = 0; i < n - 1; i++) {
double xdiff = v[i].x - v[i + 1].x;
double ydiff = v[i].y - v[i + 1].y;
sum += sqrt(xdiff * xdiff + ydiff * ydiff);
}
} while (next_permutation(v.begin(), v.end()));
printf("%.7f\n", sum / factorial(n));
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using namespace std;
struct Point {
double x;
double y;
Point() {}
Point(int x, int y) {
this->x = x;
this->y = y;
}
};
long long factorial(int n) {
if (n == 1)
return 1;
else
return n * factorial(n - 1);
}
bool operator<(const Point &ls, const Point &rs) {
if (ls.x < rs.x)
return true;
if (ls.x == rs.x)
return ls.y < rs.y;
return false;
}
int main() {
int n;
cin >> n;
vector<Point> v;
for (int i = 0; i < n; i++) {
int x, y;
cin >> x >> y;
v.push_back(Point(x, y));
}
sort(v.begin(), v.end());
double sum = 0;
do {
for (int i = 0; i < n - 1; i++) {
double xdiff = v[i].x - v[i + 1].x;
double ydiff = v[i].y - v[i + 1].y;
sum += sqrt(xdiff * xdiff + ydiff * ydiff);
}
} while (next_permutation(v.begin(), v.end()));
printf("%.7f\n", sum / factorial(n));
}
| replace | 28 | 29 | 28 | 29 | TLE | |
p02861 | C++ | Runtime Error | #include <bits/stdc++.h>
/*
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iomainp>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
*/
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> x(N), y(N);
REP(i, N) {
cin >> x[i];
cin >> y[i];
}
x[N] = x[0];
y[N] = y[0];
double long tmp = 0;
REP(i, N) {
REP(j, N) {
if (i == j) {
;
} else {
int x_diff = x[i] - x[j];
ll x_val = x_diff * x_diff;
int y_diff = y[i] - y[j];
ll y_val = y_diff * y_diff;
long double val = sqrt(x_val + y_val);
tmp += val;
}
}
}
long double ans = tmp / N;
cout << fixed << setprecision(10) << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
/*
#include <algorithm>
#include <cstdio>
#include <functional>
#include <iomainp>
#include <iostream>
#include <map>
#include <math.h>
#include <string>
#include <vector>
*/
typedef long long ll;
typedef unsigned long long ull;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
const int INF = 1e9;
const int MOD = 1e9 + 7;
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
cin.tie(0);
int N;
cin >> N;
vector<int> x(N + 1), y(N + 1);
REP(i, N) {
cin >> x[i];
cin >> y[i];
}
x[N] = x[0];
y[N] = y[0];
double long tmp = 0;
REP(i, N) {
REP(j, N) {
if (i == j) {
;
} else {
int x_diff = x[i] - x[j];
ll x_val = x_diff * x_diff;
int y_diff = y[i] - y[j];
ll y_val = y_diff * y_diff;
long double val = sqrt(x_val + y_val);
tmp += val;
}
}
}
long double ans = tmp / N;
cout << fixed << setprecision(10) << ans << "\n";
return 0;
}
| replace | 31 | 32 | 31 | 32 | 0 | |
p02861 | C++ | Runtime Error |
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<ll>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<ll, ll>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define pb push_back;
#define f first
#define s second
using namespace std;
signed main() {
std::ios::sync_with_stdio(false);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int n;
cin >> n;
double a, b, f = 1;
string s;
std::vector<double> vec[n + 1];
for (int i = 1; i <= n; ++i) {
/* code */
cin >> a >> b;
vec[i].push_back(a);
vec[i].push_back(b);
s += '0' + i;
f *= i;
}
double ans = 0;
do {
for (int i = 1; i < n; ++i) {
/* code */
int r = s[i] - '0';
int t = s[i - 1] - '0';
double c = pow(vec[r][0] - vec[t][0], 2);
double d = pow(vec[r][1] - vec[t][1], 2);
ans += sqrt(c + d);
}
} while (next_permutation(s.begin(), s.end()));
cout << fixed << setprecision(10) << ans / f;
return 0;
}
|
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long int
#define vi vector<ll>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<ll, ll>
#define pll pair<long long, long long>
#define mod 1000000007
#define inf 1000000000000000001;
#define all(c) c.begin(), c.end()
#define mp(x, y) make_pair(x, y)
#define mem(a, val) memset(a, val, sizeof(a))
#define pb push_back;
#define f first
#define s second
using namespace std;
signed main() {
int n;
cin >> n;
double a, b, f = 1;
string s;
std::vector<double> vec[n + 1];
for (int i = 1; i <= n; ++i) {
/* code */
cin >> a >> b;
vec[i].push_back(a);
vec[i].push_back(b);
s += '0' + i;
f *= i;
}
double ans = 0;
do {
for (int i = 1; i < n; ++i) {
/* code */
int r = s[i] - '0';
int t = s[i - 1] - '0';
double c = pow(vec[r][0] - vec[t][0], 2);
double d = pow(vec[r][1] - vec[t][1], 2);
ans += sqrt(c + d);
}
} while (next_permutation(s.begin(), s.end()));
cout << fixed << setprecision(10) << ans / f;
return 0;
}
| delete | 21 | 28 | 21 | 21 | -11 | |
p02861 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
#define Love_coding int main
#define trace(x) cerr << #x << ": " << x << " " << endl;
#define fast ios::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define fde(i, p, n) for (long long int i = p; i >= n; i--)
#define f(i, p, n) for (long long int i = p; i < n; i++)
#define pii pair<int, int>
#define pf p.first
#define ps p.second
// int N,M;
// int Dp[101][101]={-1};
// int tc[101][101];
int h = 101;
#define chi(p, r) p - r;
#define ll long long int
/*
struct arr{
int x;
string y;
};
*/
int comparator(const void *a, const void *b) { return (*(int *)a - *(int *)b); }
long long int C(long long int n, long long int r) {
long long int res = 1, i;
if (r > n / 2)
r = n - r;
for (i = 0; i < r; i++) {
res *= n;
res /= i + 1;
n--;
}
return res;
}
unsigned nCk(unsigned n, unsigned k) {
if (k > n)
return 0;
if (k * 2 > n)
k = n - k;
if (k == 0)
return 1;
int result = n;
for (int i = 2; i <= k; ++i) {
result *= (n - i + 1);
result /= i;
}
}
struct node {
int x;
int ind;
struct node *p;
};
void max_dis() {
int n;
cin >> n;
int a[n];
trace(n);
f(i, 0, n) { cin >> a[i]; }
int chhote = 0;
f(i, 0, n) cout << a[i] << " ";
cout << "\n";
node *h = new node[30000];
f(i, 0, n) { h[i].p = NULL; }
f(i, 0, n) {
cout << "entered " << i << "\n";
if (h[a[i]].p == NULL) {
h[a[i]].ind = i;
h[a[i]].x = a[i];
h[a[i]].p = NULL;
}
else {
node *root = NULL;
root = &h[a[i]];
while (root) {
root = root->p;
}
node *l = new node();
l->ind = i;
l->x = h[a[i]].x;
l->p = NULL;
root->p = l;
}
}
int j = 0;
f(i, 0, n) {
node *root;
root = &h[a[i]];
int gore = 0;
gore = i;
while (root != NULL && j < 1000) {
cout << a[i] << " " << root->ind << " " << root->x << "\n";
int first = root->ind;
root = root->p;
int second = root->ind;
if (second - first > chhote) {
chhote = second - first;
}
j++;
}
}
delete[] h;
if (chhote >= 1)
cout << chhote + 1 << "\n";
else
cout << -1 << "\n";
}
void jodo(int a[], int left, int right) {
int mid = left + (right - left) / 2;
if (left < right) {
jodo(a, mid + 1, right);
jodo(a, left, mid);
}
if (left == right)
return;
int b[right - left + 1];
int j = left, k = mid + 1;
f(i, 0, right - left + 1) {
if (j < mid + 1 && k < right + 1) {
if (a[j] < a[k]) {
b[i] = a[j];
j++;
}
else {
b[i] = a[k];
k++;
}
}
else if (j == mid + 1 && k < right + 1) {
b[i] = a[k];
k++;
}
else if (j < mid + 1 && k == right + 1) {
b[i] = a[j];
j++;
}
else {
cout << "my bad " << i << " " << left << " " << mid << " j: " << j
<< " " << mid + 1 << " " << right << " k: " << k << " "
<< "\n";
}
}
int t = left;
f(i, 0, right - left + 1) { a[i + t] = b[i]; }
}
void mer() {
int n;
cin >> n;
int a[n];
f(i, 0, n) cin >> a[i];
int left = 0, right = n - 1;
jodo(a, left, right);
cout << "\n";
f(i, 0, n) cout << a[i] << " ";
}
void gor() {
int n;
cin >> n;
string s;
cin >> s;
vector<char> v1, v2;
f(i, 0, n) {
if (s[i] >= 65 && s[i] <= 90) {
v1.push_back(s[i]);
}
else {
v2.push_back(s[i]);
}
}
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
string q = "";
/*
for(auto i=0;i<v1.size();i++)
{
h+=v1[i];
}
*/
int j = 0, k = 0;
f(i, 0, n) {
if (s[i] >= 65 && s[i] <= 90) {
q.push_back(v1[j]);
j++;
}
else {
q.push_back(v2[k]);
k++;
}
}
cout << q << "\n";
}
int N, M;
int k[1001][1001];
int H[1001][1001];
int mx = 0;
int jolly(int i, int j, int sum) {
if (i > N || j > M)
return sum;
if (H[i][j] != 0) {
return H[i][j];
}
if (i == N && j == M) {
return sum + k[N][M];
}
H[i][j] = max(
jolly(i + 1, j, sum + k[i][j]),
max(jolly(i, j + 1, sum + k[i][j]), jolly(i + 1, j + 1, sum + k[i][j])));
return H[i][j];
}
void coll() {
cin >> N >> M;
f(i, 1, N + 1) {
f(j, 1, M + 1) {
cin >> k[i][j];
H[i][j] = 0;
}
}
int i = 0, j = 0, sum = 0;
cout << jolly(i, j, sum) << "\n";
}
void fp() {
int N;
cin >> N;
int a[N][2];
f(i, 0, N) { cin >> a[i][0] >> a[i][1]; }
double sum = 0;
f(i, 0, N) {
f(j, i, N) {
double p =
sqrt(pow((a[i][0] - a[j][0]), 2) + pow((a[i][1] - a[j][1]), 2));
sum += p;
// trace(p);
}
}
cout << setprecision(15) << sum * (2 / (double)N);
}
Love_coding() {
#ifndef ONLINE_JUDGE
freopen("test2.txt", "r", stdin);
#endif
fast;
int t = 1;
// cin>>t;
while (t--) {
fp();
}
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
#define Love_coding int main
#define trace(x) cerr << #x << ": " << x << " " << endl;
#define fast ios::sync_with_stdio(0), cout.tie(0), cin.tie(0);
#define fde(i, p, n) for (long long int i = p; i >= n; i--)
#define f(i, p, n) for (long long int i = p; i < n; i++)
#define pii pair<int, int>
#define pf p.first
#define ps p.second
// int N,M;
// int Dp[101][101]={-1};
// int tc[101][101];
int h = 101;
#define chi(p, r) p - r;
#define ll long long int
/*
struct arr{
int x;
string y;
};
*/
int comparator(const void *a, const void *b) { return (*(int *)a - *(int *)b); }
long long int C(long long int n, long long int r) {
long long int res = 1, i;
if (r > n / 2)
r = n - r;
for (i = 0; i < r; i++) {
res *= n;
res /= i + 1;
n--;
}
return res;
}
unsigned nCk(unsigned n, unsigned k) {
if (k > n)
return 0;
if (k * 2 > n)
k = n - k;
if (k == 0)
return 1;
int result = n;
for (int i = 2; i <= k; ++i) {
result *= (n - i + 1);
result /= i;
}
}
struct node {
int x;
int ind;
struct node *p;
};
void max_dis() {
int n;
cin >> n;
int a[n];
trace(n);
f(i, 0, n) { cin >> a[i]; }
int chhote = 0;
f(i, 0, n) cout << a[i] << " ";
cout << "\n";
node *h = new node[30000];
f(i, 0, n) { h[i].p = NULL; }
f(i, 0, n) {
cout << "entered " << i << "\n";
if (h[a[i]].p == NULL) {
h[a[i]].ind = i;
h[a[i]].x = a[i];
h[a[i]].p = NULL;
}
else {
node *root = NULL;
root = &h[a[i]];
while (root) {
root = root->p;
}
node *l = new node();
l->ind = i;
l->x = h[a[i]].x;
l->p = NULL;
root->p = l;
}
}
int j = 0;
f(i, 0, n) {
node *root;
root = &h[a[i]];
int gore = 0;
gore = i;
while (root != NULL && j < 1000) {
cout << a[i] << " " << root->ind << " " << root->x << "\n";
int first = root->ind;
root = root->p;
int second = root->ind;
if (second - first > chhote) {
chhote = second - first;
}
j++;
}
}
delete[] h;
if (chhote >= 1)
cout << chhote + 1 << "\n";
else
cout << -1 << "\n";
}
void jodo(int a[], int left, int right) {
int mid = left + (right - left) / 2;
if (left < right) {
jodo(a, mid + 1, right);
jodo(a, left, mid);
}
if (left == right)
return;
int b[right - left + 1];
int j = left, k = mid + 1;
f(i, 0, right - left + 1) {
if (j < mid + 1 && k < right + 1) {
if (a[j] < a[k]) {
b[i] = a[j];
j++;
}
else {
b[i] = a[k];
k++;
}
}
else if (j == mid + 1 && k < right + 1) {
b[i] = a[k];
k++;
}
else if (j < mid + 1 && k == right + 1) {
b[i] = a[j];
j++;
}
else {
cout << "my bad " << i << " " << left << " " << mid << " j: " << j
<< " " << mid + 1 << " " << right << " k: " << k << " "
<< "\n";
}
}
int t = left;
f(i, 0, right - left + 1) { a[i + t] = b[i]; }
}
void mer() {
int n;
cin >> n;
int a[n];
f(i, 0, n) cin >> a[i];
int left = 0, right = n - 1;
jodo(a, left, right);
cout << "\n";
f(i, 0, n) cout << a[i] << " ";
}
void gor() {
int n;
cin >> n;
string s;
cin >> s;
vector<char> v1, v2;
f(i, 0, n) {
if (s[i] >= 65 && s[i] <= 90) {
v1.push_back(s[i]);
}
else {
v2.push_back(s[i]);
}
}
sort(v1.begin(), v1.end());
sort(v2.begin(), v2.end());
string q = "";
/*
for(auto i=0;i<v1.size();i++)
{
h+=v1[i];
}
*/
int j = 0, k = 0;
f(i, 0, n) {
if (s[i] >= 65 && s[i] <= 90) {
q.push_back(v1[j]);
j++;
}
else {
q.push_back(v2[k]);
k++;
}
}
cout << q << "\n";
}
int N, M;
int k[1001][1001];
int H[1001][1001];
int mx = 0;
int jolly(int i, int j, int sum) {
if (i > N || j > M)
return sum;
if (H[i][j] != 0) {
return H[i][j];
}
if (i == N && j == M) {
return sum + k[N][M];
}
H[i][j] = max(
jolly(i + 1, j, sum + k[i][j]),
max(jolly(i, j + 1, sum + k[i][j]), jolly(i + 1, j + 1, sum + k[i][j])));
return H[i][j];
}
void coll() {
cin >> N >> M;
f(i, 1, N + 1) {
f(j, 1, M + 1) {
cin >> k[i][j];
H[i][j] = 0;
}
}
int i = 0, j = 0, sum = 0;
cout << jolly(i, j, sum) << "\n";
}
void fp() {
int N;
cin >> N;
int a[N][2];
f(i, 0, N) { cin >> a[i][0] >> a[i][1]; }
double sum = 0;
f(i, 0, N) {
f(j, i, N) {
double p =
sqrt(pow((a[i][0] - a[j][0]), 2) + pow((a[i][1] - a[j][1]), 2));
sum += p;
// trace(p);
}
}
cout << setprecision(15) << sum * (2 / (double)N);
}
Love_coding() {
fast;
int t = 1;
// cin>>t;
while (t--) {
fp();
}
return 0;
}
| delete | 325 | 328 | 325 | 325 | TLE | |
p02861 | C++ | Runtime Error | // #include "stdafx.h"
#include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
定義
-------------------------------------------------------------------------------*/
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define INF 2e9
#define MOD (1000 * 1000 * 1000 + 7)
#define Ceil(x, n) (((((x)) + ((n)-1)) / n)) /* Nの倍数に切り上げ割り算 */
#define CeilN(x, n) (((((x)) + ((n)-1)) / n) * n) /* Nの倍数に切り上げ */
#define FloorN(x, n) ((x) - (x) % (n)) /* Nの倍数に切り下げ */
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define BitSetV(Val, Bit) ((Val) |= (Bit))
#define BitTstV(Val, Bit) ((Val) & (Bit))
#define ArrayLength(x) (sizeof(x) / sizeof(x[0]))
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_SDWORD ((SDWORD)0x7FFFFFFF)
#define MIN_SDWORD ((SDWORD)0x80000000)
#define MAX_QWORD ((QWORD)0xFFFFFFFFFFFFFFFF)
#define MIN_QWORD ((QWORD)0x0000000000000000)
#define MAX_SQWORD ((SQWORD)0x7FFFFFFFFFFFFFFF)
#define MIN_SQWORD ((SQWORD)0x8000000000000000)
#define M_PI 3.14159265358979323846
typedef long SDWORD;
typedef long long SQWORD;
typedef unsigned long DWORD;
typedef unsigned long long int QWORD;
typedef long long ll;
typedef pair<ll, ll> P;
/*-----------------------------------------------------------------------------
処理
-------------------------------------------------------------------------------*/
int main() {
int N;
cin >> N;
int x[8], y[8];
REP(i, N) cin >> x[i] >> y[i];
// idx
vector<int> idx(N);
REP(i, 8) idx[i] = i;
// 順列
double ans = 0;
do {
for (int i = 0; i < N - 1; i++) {
double diffx = x[idx[i]] - x[idx[i + 1]];
double diffy = y[idx[i]] - y[idx[i + 1]];
ans += sqrt((pow(diffx, 2) + pow(diffy, 2)));
}
} while (next_permutation(idx.begin(), idx.end()));
// 個数
double div = 1;
for (int i = 1; i <= N; i++) {
div *= i;
}
ans = ans / div;
printf("%lf\n", ans);
return 0;
}
| // #include "stdafx.h"
#include <algorithm>
#include <assert.h>
#include <climits>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <vector>
using namespace std;
/*-----------------------------------------------------------------------------
定義
-------------------------------------------------------------------------------*/
#define REP(i, n) for (int(i) = 0; (i) < (int)(n); ++(i))
#define REPN(i, m, n) for (int(i) = m; (i) < (int)(n); ++(i))
#define INF 2e9
#define MOD (1000 * 1000 * 1000 + 7)
#define Ceil(x, n) (((((x)) + ((n)-1)) / n)) /* Nの倍数に切り上げ割り算 */
#define CeilN(x, n) (((((x)) + ((n)-1)) / n) * n) /* Nの倍数に切り上げ */
#define FloorN(x, n) ((x) - (x) % (n)) /* Nの倍数に切り下げ */
#define IsOdd(x) (((x)&0x01UL) == 0x01UL)
#define IsEven(x) (!IsOdd((x)))
#define BitSetV(Val, Bit) ((Val) |= (Bit))
#define BitTstV(Val, Bit) ((Val) & (Bit))
#define ArrayLength(x) (sizeof(x) / sizeof(x[0]))
#define MAX_DWORD (0xFFFFFFFF)
#define MAX_SDWORD ((SDWORD)0x7FFFFFFF)
#define MIN_SDWORD ((SDWORD)0x80000000)
#define MAX_QWORD ((QWORD)0xFFFFFFFFFFFFFFFF)
#define MIN_QWORD ((QWORD)0x0000000000000000)
#define MAX_SQWORD ((SQWORD)0x7FFFFFFFFFFFFFFF)
#define MIN_SQWORD ((SQWORD)0x8000000000000000)
#define M_PI 3.14159265358979323846
typedef long SDWORD;
typedef long long SQWORD;
typedef unsigned long DWORD;
typedef unsigned long long int QWORD;
typedef long long ll;
typedef pair<ll, ll> P;
/*-----------------------------------------------------------------------------
処理
-------------------------------------------------------------------------------*/
int main() {
int N;
cin >> N;
int x[8], y[8];
REP(i, N) cin >> x[i] >> y[i];
// idx
vector<int> idx(N);
REP(i, N) idx[i] = i;
// 順列
double ans = 0;
do {
for (int i = 0; i < N - 1; i++) {
double diffx = x[idx[i]] - x[idx[i + 1]];
double diffy = y[idx[i]] - y[idx[i + 1]];
ans += sqrt((pow(diffx, 2) + pow(diffy, 2)));
}
} while (next_permutation(idx.begin(), idx.end()));
// 個数
double div = 1;
for (int i = 1; i <= N; i++) {
div *= i;
}
ans = ans / div;
printf("%lf\n", ans);
return 0;
}
| replace | 65 | 66 | 65 | 66 | -6 | malloc(): corrupted top size
|
p02861 | Python | Runtime Error | from itertools import permutations
from functools import reduce
from operator import mul
def solve(string):
n, *xy = map(int, string.split())
(*xy,) = zip(*[iter(xy)] * 2)
return str(
sum(
sum(
((xy[p0][0] - xy[p1][0]) ** 2 + (xy[p0][1] - xy[p1][1]) ** 2) ** 0.5
for p0, p1 in zip(list(i), list(i)[1:])
)
for i in permutations(range(n), n)
)
/ reduce(mul, range(1, n + 1))
)
if __name__ == "__main__":
print(solve(input()))
| from itertools import permutations
from functools import reduce
from operator import mul
def solve(string):
n, *xy = map(int, string.split())
(*xy,) = zip(*[iter(xy)] * 2)
return str(
sum(
sum(
((xy[p0][0] - xy[p1][0]) ** 2 + (xy[p0][1] - xy[p1][1]) ** 2) ** 0.5
for p0, p1 in zip(list(i), list(i)[1:])
)
for i in permutations(range(n), n)
)
/ reduce(mul, range(1, n + 1))
)
if __name__ == "__main__":
n = int(input())
print(solve("{}\n".format(n) + "\n".join([input() for _ in range(n)])))
| replace | 21 | 22 | 21 | 23 | IndexError: list index out of range | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02861/Python/s645937078.py", line 18, in <module>
print(solve(input()))
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02861/Python/s645937078.py", line 10, in solve
sum(
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02861/Python/s645937078.py", line 11, in <genexpr>
sum(((xy[p0][0] - xy[p1][0])**2 + (xy[p0][1] - xy[p1][1])**2)**0.5
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02861/Python/s645937078.py", line 11, in <genexpr>
sum(((xy[p0][0] - xy[p1][0])**2 + (xy[p0][1] - xy[p1][1])**2)**0.5
IndexError: list index out of range
|
p02861 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <iterator>
#include <set>
using namespace std;
#define forr(a, n) for (int i = a; i <= n; i++)
#define MAX 1000000007LL
#define mod 998244353
#define forn(n, a) for (int i = n; i >= a; i--)
#define all(x) x.begin(), x.end()
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define pii pair<int, int>
#define ll long long
const int N = (int)1e5 + 9;
ll power(ll x, ll y) {
ll ans = 1;
while (y > 0) {
if (y % 2 == 1)
ans = ans * x;
x = x * x;
y = y >> 1;
}
return ans;
}
int n;
ll fact[10];
vector<int> x;
vector<int> y;
string s = "";
double ans = 0;
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt" , "w" , stdout);
#endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
fact[0] = 1;
fact[1] = 1;
forr(2, 9) fact[i] = fact[i - 1] * i;
cin >> n;
forr(0, n - 1) {
s = s + to_string(i);
int a, b;
cin >> a >> b;
x.pb(a);
y.pb(b);
}
do {
// cout<<s<<"\n";
double value = 0;
for (int i = 1; i < n; i++) {
int j = int(s[i]) - 48;
int k = int(s[i - 1]) - 48;
value = value + sqrt((x[j] - x[k]) * (x[j] - x[k]) +
(y[j] - y[k]) * (y[j] - y[k]));
}
// cout<<s<<" "<<value<<"\n";
ans += value;
} while (next_permutation(s.begin(), s.end()));
ans = (double)ans / (double)fact[n];
printf("%.10f", ans);
return 0;
} | #include <algorithm>
#include <bits/stdc++.h>
#include <iterator>
#include <set>
using namespace std;
#define forr(a, n) for (int i = a; i <= n; i++)
#define MAX 1000000007LL
#define mod 998244353
#define forn(n, a) for (int i = n; i >= a; i--)
#define all(x) x.begin(), x.end()
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define pii pair<int, int>
#define ll long long
const int N = (int)1e5 + 9;
ll power(ll x, ll y) {
ll ans = 1;
while (y > 0) {
if (y % 2 == 1)
ans = ans * x;
x = x * x;
y = y >> 1;
}
return ans;
}
int n;
ll fact[10];
vector<int> x;
vector<int> y;
string s = "";
double ans = 0;
int main() {
// #ifndef ONLINE_JUDGE
// freopen("in.txt" , "r" , stdin);
// // freopen("out.txt" , "w" , stdout);
// #endif
ios_base::sync_with_stdio(false);
cin.tie(NULL);
fact[0] = 1;
fact[1] = 1;
forr(2, 9) fact[i] = fact[i - 1] * i;
cin >> n;
forr(0, n - 1) {
s = s + to_string(i);
int a, b;
cin >> a >> b;
x.pb(a);
y.pb(b);
}
do {
// cout<<s<<"\n";
double value = 0;
for (int i = 1; i < n; i++) {
int j = int(s[i]) - 48;
int k = int(s[i - 1]) - 48;
value = value + sqrt((x[j] - x[k]) * (x[j] - x[k]) +
(y[j] - y[k]) * (y[j] - y[k]));
}
// cout<<s<<" "<<value<<"\n";
ans += value;
} while (next_permutation(s.begin(), s.end()));
ans = (double)ans / (double)fact[n];
printf("%.10f", ans);
return 0;
} | replace | 32 | 36 | 32 | 36 | 0 | |
p02861 | Python | Runtime Error | from itertools import permutations
import numpy as np
N = int(input())
xys = []
for _ in range(N):
xys.append(list(map(int, input().split())))
combs = np.array(list(permutations(xys, N)))
ret = np.array(
[np.linalg.norm(combs[:, i] - combs[:, i + 1], axis=1) for i in range(N - 1)]
).sum() / len(combs)
print(f"{ret:.10f}")
| from itertools import permutations
import numpy as np
N = int(input())
xys = []
for _ in range(N):
xys.append(list(map(int, input().split())))
combs = np.array(list(permutations(xys, N)))
ret = np.array(
[np.linalg.norm(combs[:, i] - combs[:, i + 1], axis=1) for i in range(N - 1)]
).sum() / len(combs)
print("{:.10f}".format(ret))
| replace | 15 | 16 | 15 | 16 | TLE | |
p02861 | C++ | Runtime Error | // 17571@nith.ac.in @Ankit Verma
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#define ll long long
// Custom Hash Function for Unordered Maps
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
// Debugger Tools
#ifndef ONLINE_JUDGE
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ::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...);
}
#else
#define debug(...)
#endif
#define n_l '\n'
template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; }
template <typename T> int SIZE(const T &t) { return t.size(); }
string to_string(string s, int x1 = 0, int x2 = 1e9) {
return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(char c) { return string({c}); }
template <size_t N> string to_string(bitset<N> &b, int x1 = 0, int x2 = 1e9) {
string t = "";
for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
__iii__ <= __jjj__; ++__iii__) {
t += b[__iii__] + '0';
}
return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B> string to_string(pair<A, B> &p) {
l_v_l_v_l++;
string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
l_v_l_v_l--;
return res;
}
template <typename A, typename... C>
string to_string(A(&v), int x1, int x2, C... coords) {
int rnk = rank<A>::value;
string tab(t_a_b_s, ' ');
string res = "";
bool first = true;
if (l_v_l_v_l == 0)
res += n_l;
res += tab + "[";
x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
auto l = begin(v);
advance(l, x1);
auto r = l;
advance(r, (x2 - x1) + (x2 < SIZE(v)));
for (auto e = l; e != r; e = next(e)) {
if (!first) {
res += ", ";
}
first = false;
l_v_l_v_l++;
if (e != l) {
if (rnk > 1) {
res += n_l;
t_a_b_s = l_v_l_v_l;
};
} else {
t_a_b_s = 0;
}
res += to_string(*e, coords...);
l_v_l_v_l--;
}
res += "]";
if (l_v_l_v_l == 0)
res += n_l;
return res;
}
void dbgs() { ; }
template <typename Heads, typename... Tails> void dbgs(Heads H, Tails... T) {
cout << to_string(H) << " | ";
dbgs(T...);
}
#define dbgm(...) \
cout << "[" << #__VA_ARGS__ << "]: "; \
dbgs(__VA_ARGS__); \
cout << endl;
// Mathematical Constants
const ll MOD = 1000000007;
const ll MOD9 = 1000000009;
const int C_SIZE = 3121000;
#define ull unsigned long long
const long long inf = MOD * MOD;
const double pie = 2 * acos(0.0);
#define gc getchar_unlocked
#define eps 1e-8
// Utility Functions
#define ms(s, n) memset(s, n, sizeof(s))
#define bolt ios::sync_with_stdio(false)
#define prec(n) fixed << setprecision(n)
#define eof (scanf("%d", &n)) != EOF
#define Unique(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EraseSpace(s) s.erase(remove(s.begin(), s.end(), ' '), s.end());
#define leftrotate(str, n) rotate(str.begin(), str.begin() + n, str.end());
#define rightrotate(str, n) \
rotate(str.begin(), str.begin() + str.size() - n, str.end());
// Constants and Shortcut Functions
constexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};
#define pb push_back
#define eb emplace_back
#define MP make_pair
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
typedef pair<ll, ll> pll;
#define vi vector<int>
typedef vector<ll> vll;
#define ff first
#define ss second
#define f(i, x, n) for (int i = x; i < n; i++)
#define fr(i, x, n) for (int i = x; i <= n; i++)
ll fact[C_SIZE];
ll finv[C_SIZE];
ll inv[C_SIZE];
ll Comb(int a, int b) {
if (a < b || b < 0)
return 0;
return fact[a] * finv[b] % MOD * finv[a - b] % MOD;
}
gp_hash_table<long long, int, custom_hash> smp;
double factorial(int n) {
if (n == 0)
return 1;
return n * factorial(n - 1);
}
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
bolt;
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int x[n + 10];
int y[n + 10];
f(i, 0, n) { cin >> x[i] >> y[i]; }
string s = "01234567";
bool check = true;
double ans = 0.0;
while (check) {
check = next_permutation(s.begin(), s.begin() + n);
f(i, 0, n - 1) {
ans += sqrt((x[s[i] - '0'] - x[s[i + 1] - '0']) *
(x[s[i] - '0'] - x[s[i + 1] - '0']) +
(y[s[i] - '0'] - y[s[i + 1] - '0']) *
(y[s[i] - '0'] - y[s[i + 1] - '0']));
}
}
int f = factorial(n);
double val = ans / f;
cout << prec(10) << val << endl;
return 0;
} | // 17571@nith.ac.in @Ankit Verma
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#define ll long long
// Custom Hash Function for Unordered Maps
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
// Debugger Tools
#ifndef ONLINE_JUDGE
#define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std ::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...);
}
#else
#define debug(...)
#endif
#define n_l '\n'
template <typename T, size_t N> int SIZE(const T (&t)[N]) { return N; }
template <typename T> int SIZE(const T &t) { return t.size(); }
string to_string(string s, int x1 = 0, int x2 = 1e9) {
return '"' + ((x1 < s.size()) ? s.substr(x1, x2 - x1 + 1) : "") + '"';
}
string to_string(const char *s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
string to_string(char c) { return string({c}); }
template <size_t N> string to_string(bitset<N> &b, int x1 = 0, int x2 = 1e9) {
string t = "";
for (int __iii__ = min(x1, SIZE(b)), __jjj__ = min(x2, SIZE(b) - 1);
__iii__ <= __jjj__; ++__iii__) {
t += b[__iii__] + '0';
}
return '"' + t + '"';
}
template <typename A, typename... C>
string to_string(A(&v), int x1 = 0, int x2 = 1e9, C... coords);
int l_v_l_v_l = 0, t_a_b_s = 0;
template <typename A, typename B> string to_string(pair<A, B> &p) {
l_v_l_v_l++;
string res = "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
l_v_l_v_l--;
return res;
}
template <typename A, typename... C>
string to_string(A(&v), int x1, int x2, C... coords) {
int rnk = rank<A>::value;
string tab(t_a_b_s, ' ');
string res = "";
bool first = true;
if (l_v_l_v_l == 0)
res += n_l;
res += tab + "[";
x1 = min(x1, SIZE(v)), x2 = min(x2, SIZE(v));
auto l = begin(v);
advance(l, x1);
auto r = l;
advance(r, (x2 - x1) + (x2 < SIZE(v)));
for (auto e = l; e != r; e = next(e)) {
if (!first) {
res += ", ";
}
first = false;
l_v_l_v_l++;
if (e != l) {
if (rnk > 1) {
res += n_l;
t_a_b_s = l_v_l_v_l;
};
} else {
t_a_b_s = 0;
}
res += to_string(*e, coords...);
l_v_l_v_l--;
}
res += "]";
if (l_v_l_v_l == 0)
res += n_l;
return res;
}
void dbgs() { ; }
template <typename Heads, typename... Tails> void dbgs(Heads H, Tails... T) {
cout << to_string(H) << " | ";
dbgs(T...);
}
#define dbgm(...) \
cout << "[" << #__VA_ARGS__ << "]: "; \
dbgs(__VA_ARGS__); \
cout << endl;
// Mathematical Constants
const ll MOD = 1000000007;
const ll MOD9 = 1000000009;
const int C_SIZE = 3121000;
#define ull unsigned long long
const long long inf = MOD * MOD;
const double pie = 2 * acos(0.0);
#define gc getchar_unlocked
#define eps 1e-8
// Utility Functions
#define ms(s, n) memset(s, n, sizeof(s))
#define bolt ios::sync_with_stdio(false)
#define prec(n) fixed << setprecision(n)
#define eof (scanf("%d", &n)) != EOF
#define Unique(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EraseSpace(s) s.erase(remove(s.begin(), s.end(), ' '), s.end());
#define leftrotate(str, n) rotate(str.begin(), str.begin() + n, str.end());
#define rightrotate(str, n) \
rotate(str.begin(), str.begin() + str.size() - n, str.end());
// Constants and Shortcut Functions
constexpr int dx[] = {-1, 0, 1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, 1, -1};
#define pb push_back
#define eb emplace_back
#define MP make_pair
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
typedef pair<ll, ll> pll;
#define vi vector<int>
typedef vector<ll> vll;
#define ff first
#define ss second
#define f(i, x, n) for (int i = x; i < n; i++)
#define fr(i, x, n) for (int i = x; i <= n; i++)
ll fact[C_SIZE];
ll finv[C_SIZE];
ll inv[C_SIZE];
ll Comb(int a, int b) {
if (a < b || b < 0)
return 0;
return fact[a] * finv[b] % MOD * finv[a - b] % MOD;
}
gp_hash_table<long long, int, custom_hash> smp;
double factorial(int n) {
if (n == 0)
return 1;
return n * factorial(n - 1);
}
int main() {
/*#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif*/
bolt;
cin.tie(NULL);
cout.tie(NULL);
int n;
cin >> n;
int x[n + 10];
int y[n + 10];
f(i, 0, n) { cin >> x[i] >> y[i]; }
string s = "01234567";
bool check = true;
double ans = 0.0;
while (check) {
check = next_permutation(s.begin(), s.begin() + n);
f(i, 0, n - 1) {
ans += sqrt((x[s[i] - '0'] - x[s[i + 1] - '0']) *
(x[s[i] - '0'] - x[s[i + 1] - '0']) +
(y[s[i] - '0'] - y[s[i + 1] - '0']) *
(y[s[i] - '0'] - y[s[i + 1] - '0']));
}
}
int f = factorial(n);
double val = ans / f;
cout << prec(10) << val << endl;
return 0;
} | replace | 160 | 164 | 160 | 164 | -11 | |
p02861 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten6 1000005
#define PI 3.1415926
#define pb(x) push_back(x)
#define mkpr(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
typedef long long int ll;
ll general, total;
// ll chk[55];
// ll num[55];
// ll num2[55];
// ll num[ten5];
// ll num2[ten5];
// char cmap[10][10];
// priority_queue<ll> pqll; //decrease
priority_queue<double> pqd;
// stack<int> stk;
vector<pair<ll, ll>> vpll;
vector<pair<double, double>> vpdd;
// vector<ll> vll;
// vector<double> vd;
// deque<ll> deq[55];
// list<int> li;
// set<int> sint;
// set<ll> sll;
// map<ll,ll> mp;
/*ll cmp(pair<ll,ll> a,pair<ll,ll> b)
{
return a.first<b.first;
//arrising
}*/
int main() {
double ans = 0.0, half, d, d1, d2;
// float f,g,h;
long long int sum, sum2, n1, n2, n3;
long long int m, n, o, i, j, k = 1;
long long int a, a1, a2, a3, a4, a5, a6;
sum = sum2 = n1 = n2 = n3 = 0;
a = a1 = a2 = a3 = a4 = a5 = a6 = 0;
// string s,s1;
// char now,pre,c;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a1 >> a2;
vpll.pb(mkpr(a1, a2));
// vpdd.pb(mkpr(d1,d2));
}
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
/*d1=abs(vpdd[i].first-vpdd[j].first);
d2=abs(vpdd[i].second-vpdd[j].second);*/
d1 = (double)abs(vpll[i].first - vpll[j].first);
d2 = (double)abs(vpll[i].second - vpll[j].second);
ans += sqrt(d1 * d1 + d2 * d2);
}
}
ans = ans * 2 / n;
printf("%.6llf", ans);
return 0;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
#define mod 1000000007
#define ten5 100005
#define ten52 200005
#define ten6 1000005
#define PI 3.1415926
#define pb(x) push_back(x)
#define mkpr(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
typedef long long int ll;
ll general, total;
// ll chk[55];
// ll num[55];
// ll num2[55];
// ll num[ten5];
// ll num2[ten5];
// char cmap[10][10];
// priority_queue<ll> pqll; //decrease
priority_queue<double> pqd;
// stack<int> stk;
vector<pair<ll, ll>> vpll;
vector<pair<double, double>> vpdd;
// vector<ll> vll;
// vector<double> vd;
// deque<ll> deq[55];
// list<int> li;
// set<int> sint;
// set<ll> sll;
// map<ll,ll> mp;
/*ll cmp(pair<ll,ll> a,pair<ll,ll> b)
{
return a.first<b.first;
//arrising
}*/
int main() {
double ans = 0.0, half, d, d1, d2;
// float f,g,h;
long long int sum, sum2, n1, n2, n3;
long long int m, n, o, i, j, k = 1;
long long int a, a1, a2, a3, a4, a5, a6;
sum = sum2 = n1 = n2 = n3 = 0;
a = a1 = a2 = a3 = a4 = a5 = a6 = 0;
// string s,s1;
// char now,pre,c;
cin >> n;
for (i = 0; i < n; i++) {
cin >> a1 >> a2;
vpll.pb(mkpr(a1, a2));
// vpdd.pb(mkpr(d1,d2));
}
for (i = 0; i < n; i++) {
for (j = i + 1; j < n; j++) {
/*d1=abs(vpdd[i].first-vpdd[j].first);
d2=abs(vpdd[i].second-vpdd[j].second);*/
d1 = (double)abs(vpll[i].first - vpll[j].first);
d2 = (double)abs(vpll[i].second - vpll[j].second);
ans += sqrt(d1 * d1 + d2 * d2);
}
}
ans = ans * 2 / n;
printf("%.7lf", ans);
return 0;
}
| replace | 76 | 77 | 76 | 77 | 0 | |
p02862 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define rrep(i, n) for (ll i = n - 1; i >= 0; --i)
#define pp pair<ll, ll>
#define ppp pair<ll, pp>
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define fi first
#define se second
const ll mod = 1e9 + 7, INF = 1e16;
const ll N = 1000010;
ll fact[N], inv[N];
ll ppow(ll x, ll n) {
ll ans = 1;
while (n > 0) {
if ((n & 1) == 1)
ans = ans * x;
x = x * x;
n >>= 1;
x %= mod;
ans %= mod;
}
return ans;
}
void setinv(ll n) {
fact[0] = 1;
inv[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = (fact[i - 1] * i) % mod; // 階乗を求める
inv[i] =
ppow(fact[i], (ll)mod - 2) % mod; // フェルマーの小定理で逆元を求める
}
}
ll conv(ll n, ll r) { // nCr
if (n - r < 0)
return 0;
return fact[n] * inv[r] % mod * inv[n - r] % mod;
}
ll x, y, a, b;
int main() {
setinv(1000005);
cin >> x >> y;
b = (2 * y - x) / 3;
if ((2 * y - x) % 3 || b < 0) {
cout << 0 << endl;
return 0;
}
a = y - 2 * b;
cout << conv(a + b, a) << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)n; ++i)
#define rrep(i, n) for (ll i = n - 1; i >= 0; --i)
#define pp pair<ll, ll>
#define ppp pair<ll, pp>
#define pb push_back
#define ALL(v) v.begin(), v.end()
#define fi first
#define se second
const ll mod = 1e9 + 7, INF = 1e16;
const ll N = 1000010;
ll fact[N], inv[N];
ll ppow(ll x, ll n) {
ll ans = 1;
while (n > 0) {
if ((n & 1) == 1)
ans = ans * x;
x = x * x;
n >>= 1;
x %= mod;
ans %= mod;
}
return ans;
}
void setinv(ll n) {
fact[0] = 1;
inv[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = (fact[i - 1] * i) % mod; // 階乗を求める
inv[i] =
ppow(fact[i], (ll)mod - 2) % mod; // フェルマーの小定理で逆元を求める
}
}
ll conv(ll n, ll r) { // nCr
if (n - r < 0)
return 0;
return fact[n] * inv[r] % mod * inv[n - r] % mod;
}
ll x, y, a, b;
int main() {
setinv(1000005);
cin >> x >> y;
b = (2 * y - x) / 3;
if ((2 * y - x) % 3 || b < 0) {
cout << 0 << endl;
return 0;
}
a = y - 2 * b;
if (a < 0) {
cout << 0 << endl;
return 0;
}
cout << conv(a + b, a) << endl;
} | insert | 50 | 50 | 50 | 54 | 0 | |
p02862 | C++ | Runtime Error | #include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int M = 510000;
ll fac[M], finv[M], inv[M];
// 前処理
void Cinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < M; 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 C(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;
if ((x + y) % 3) {
cout << 0 << endl;
} else if (2 * y - x < 0 || 2 * x - y < 0) {
cout << 0 << endl;
} else {
ll n = (2 * y - x) / 3;
ll m = (2 * x - y) / 3;
Cinit();
cout << C(n + m, m) << endl;
}
}
| #include <iostream>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int M = 10000000;
ll fac[M], finv[M], inv[M];
// 前処理
void Cinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < M; 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 C(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;
if ((x + y) % 3) {
cout << 0 << endl;
} else if (2 * y - x < 0 || 2 * x - y < 0) {
cout << 0 << endl;
} else {
ll n = (2 * y - x) / 3;
ll m = (2 * x - y) / 3;
Cinit();
cout << C(n + m, m) << endl;
}
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define mod 1000000007
#define fr first
#define se second
#define ll long long
#define PI 3.1415926535
#define pb push_back
#define mpr make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define senky_bansal ios_base::sync_with_stdio(false);
#define IIIT_ALLAHABAD \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
ll fac[2000005];
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b = b / 2;
}
return res % mod;
}
ll ncr(ll n, ll r) {
return ((fac[n] * power(fac[r], mod - 2)) % mod *
power(fac[n - r], mod - 2)) %
mod;
}
void pre() {
fac[0] = 1;
fac[1] = 1;
for (int i = 2; i < 2000005; i++)
fac[i] = (i * fac[i - 1]) % mod;
}
signed main() {
senky_bansal IIIT_ALLAHABAD
ll t;
// cin>>t;
t = 1;
pre();
while (t--) {
ll x, y;
cin >> x >> y;
ll mx = max(x, y);
ll mn = min(x, y);
if (y > x)
swap(x, y);
if (x >= y) {
ll diff = x - y;
ll f = 0;
if ((diff + x) % 3 != 0)
f = 1;
if ((2 * diff + y) % 3 != 0)
f = 1;
ll ans1 = (diff + x) / 3;
ll ans2 = (2 * diff + y) / 3;
ans2 -= diff;
ll ans = 1;
// cout<<ans1<<" "<<ans2<<endl;
ans = ncr((ans1 + ans2), ans1);
if (f)
cout << "0" << endl;
else
cout << (ans + mod) % mod << endl;
}
}
}
| #include <bits/stdc++.h>
#define mod 1000000007
#define fr first
#define se second
#define ll long long
#define PI 3.1415926535
#define pb push_back
#define mpr make_pair
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define senky_bansal ios_base::sync_with_stdio(false);
#define IIIT_ALLAHABAD \
cin.tie(NULL); \
cout.tie(NULL);
using namespace std;
ll fac[2000005];
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b = b / 2;
}
return res % mod;
}
ll ncr(ll n, ll r) {
return ((fac[n] * power(fac[r], mod - 2)) % mod *
power(fac[n - r], mod - 2)) %
mod;
}
void pre() {
fac[0] = 1;
fac[1] = 1;
for (int i = 2; i < 2000005; i++)
fac[i] = (i * fac[i - 1]) % mod;
}
signed main() {
senky_bansal IIIT_ALLAHABAD
ll t;
// cin>>t;
t = 1;
pre();
while (t--) {
ll x, y;
cin >> x >> y;
ll mx = max(x, y);
ll mn = min(x, y);
if (y > x)
swap(x, y);
if (x >= y) {
ll diff = x - y;
ll f = 0;
if ((diff + x) % 3 != 0)
f = 1;
if ((2 * diff + y) % 3 != 0)
f = 1;
ll ans1 = (diff + x) / 3;
ll ans2 = (2 * diff + y) / 3;
ans2 -= diff;
if (ans2 < 0)
f = 1;
ll ans = 1;
// cout<<ans1<<" "<<ans2<<endl;
ans = ncr((ans1 + ans2), ans1);
if (f)
cout << "0" << endl;
else
cout << (ans + mod) % mod << endl;
}
}
}
| insert | 62 | 62 | 62 | 64 | 0 | |
p02862 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <math.h>
#include <time.h>
using namespace std;
long long mod = 1000000007; // 10^9 + 7
//---------------------------------------------------------------------------------------------------
vector<long long> f(1000010);
vector<long long> rf(1000010);
long long n;
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; // kが存在かつ値 k == 1
y = (y * y) % mod;
k /= 2;
}
return res;
}
void init() {
f.at(0) = 1;
for (long long i = 1; i < 1000010; i++) {
f.at(i) = (f.at(i - 1) * i) % mod;
rf.at(i) = inv(f.at(i)); // 逆元も同時にメモ
} // n!をmodで割っていったものを求めている
}
//---------------------------------------------------------------------------------------------------
long long C(int n, int k) {
long long a = f.at(n); // = n!%mod
long long b = rf.at(n - k); // = (n-k)!%mod
long long c = rf.at(k); // = k!%mod
long long bc = (b * c) % mod;
return (a * bc) % mod;
}
/*メンチン待ちクイズ*/
void solve() {
long long x, y;
cin >> x >> y;
if ((x + y) % 3 != 0 || y > 2 * x || x > 2 * y) {
cout << 0 << endl;
} // 絶対に到達しようがないとき
/*nCkについて考える*/
n = (x + y) / 3;
long long k;
k = (x - n);
k = min(k, n - k);
if (k == 0) {
cout << 1 << endl;
} else {
init();
cout << C(n, k) << endl;
}
}
int main() {
solve();
return 0;
}
| #include "bits/stdc++.h"
#include <math.h>
#include <time.h>
using namespace std;
long long mod = 1000000007; // 10^9 + 7
//---------------------------------------------------------------------------------------------------
vector<long long> f(1000010);
vector<long long> rf(1000010);
long long n;
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; // kが存在かつ値 k == 1
y = (y * y) % mod;
k /= 2;
}
return res;
}
void init() {
f.at(0) = 1;
for (long long i = 1; i < 1000010; i++) {
f.at(i) = (f.at(i - 1) * i) % mod;
rf.at(i) = inv(f.at(i)); // 逆元も同時にメモ
} // n!をmodで割っていったものを求めている
}
//---------------------------------------------------------------------------------------------------
long long C(int n, int k) {
long long a = f.at(n); // = n!%mod
long long b = rf.at(n - k); // = (n-k)!%mod
long long c = rf.at(k); // = k!%mod
long long bc = (b * c) % mod;
return (a * bc) % mod;
}
/*メンチン待ちクイズ*/
void solve() {
long long x, y;
cin >> x >> y;
if ((x + y) % 3 != 0 || y > 2 * x || x > 2 * y) {
cout << 0 << endl;
} // 絶対に到達しようがないとき
else {
/*nCkについて考える*/
n = (x + y) / 3;
long long k;
k = (x - n);
k = min(k, n - k);
if (k == 0) {
cout << 1 << endl;
} else {
init();
cout << C(n, k) << endl;
}
}
}
int main() {
solve();
return 0;
}
| replace | 45 | 55 | 45 | 57 | 0 | |
p02862 | C++ | Runtime Error | #include <cstdio>
#define int long long
template <class T> void fr(T &a) {
T w = 0, s = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
s = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
w = w * 10 + c - '0', c = getchar();
a = w * s;
}
template <class T> T fr() {
T a;
fr(a);
return a;
}
#define R() fr<int>()
const int p = 1e9 + 7, N = 1e6;
int fac[N + 10] = {1};
int qpow(int a, int b) {
int ans = 1;
while (b) {
if (b % 2)
ans = ans * a % p;
a = a * a % p, b /= 2;
}
return ans;
}
int C(int n, int m) {
return fac[n] * qpow(fac[n - m], p - 2) % p * qpow(fac[m], p - 2) % p;
}
signed main() {
int x = R(), y = R(), z = (x + y) / 3, a = y - z, b = x - z;
if (z * 3 != x + y)
return !printf("0\n");
else {
for (int i = 1; i <= N; i++)
fac[i] = fac[i - 1] * i % p;
if (a >= 0)
return !printf("%lld\n", C(z, a));
return !printf("0\n");
}
return 0;
}
/*
(i,j) to (i+1,j+2) = a
(i,j) to (i+2,j+1) = b
a+2b=x
2a+b=y
3a+3b=x+y
a+b=(x+y)/3
a=y-(x+y)/3
b=x-(x+y)/3
*/ | #include <cstdio>
#define int long long
template <class T> void fr(T &a) {
T w = 0, s = 1;
char c = getchar();
while (c < '0' || c > '9') {
if (c == '-')
s = -1;
c = getchar();
}
while (c >= '0' && c <= '9')
w = w * 10 + c - '0', c = getchar();
a = w * s;
}
template <class T> T fr() {
T a;
fr(a);
return a;
}
#define R() fr<int>()
const int p = 1e9 + 7, N = 1e6;
int fac[N + 10] = {1};
int qpow(int a, int b) {
int ans = 1;
while (b) {
if (b % 2)
ans = ans * a % p;
a = a * a % p, b /= 2;
}
return ans;
}
int C(int n, int m) {
return fac[n] * qpow(fac[n - m], p - 2) % p * qpow(fac[m], p - 2) % p;
}
signed main() {
int x = R(), y = R(), z = (x + y) / 3, a = y - z, b = x - z;
if (z * 3 != x + y)
return !printf("0\n");
else {
for (int i = 1; i <= N; i++)
fac[i] = fac[i - 1] * i % p;
if (a >= 0 && a <= z)
return !printf("%lld\n", C(z, a));
return !printf("0\n");
}
return 0;
}
/*
(i,j) to (i+1,j+2) = a
(i,j) to (i+2,j+1) = b
a+2b=x
2a+b=y
3a+3b=x+y
a+b=(x+y)/3
a=y-(x+y)/3
b=x-(x+y)/3
*/ | replace | 47 | 48 | 47 | 48 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 1e6;
const int MOD = 1e9 + 7;
int mult(int a, int b) { return (a * 1ll * b) % MOD; }
int binpow(int a) {
int res = 1;
int b = MOD - 2;
while (b) {
if (b & 1)
res = mult(res, a);
a = mult(a, a);
b >>= 1;
}
return res;
}
int f[MAX * 3];
int calc() {
f[0] = 1;
for (int i = 1; i <= MAX * 2; ++i)
f[i] = mult(f[i - 1], i);
}
int c(int n, int k) { return mult(f[n], binpow(mult(f[k], f[n - k]))); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int x, y;
cin >> x >> y;
if ((x + y) % 3)
cout << 0, exit(0);
int m = -1, n = -1;
for (int i = 0; i <= MAX; ++i) {
m = x - 2 * i;
if (2 * m + i == y) {
n = i;
break;
}
}
if (m == -1 || n == -1)
cout << 0, exit(0);
calc();
cout << c(n + m, m);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 1e6;
const int MOD = 1e9 + 7;
int mult(int a, int b) { return (a * 1ll * b) % MOD; }
int binpow(int a) {
int res = 1;
int b = MOD - 2;
while (b) {
if (b & 1)
res = mult(res, a);
a = mult(a, a);
b >>= 1;
}
return res;
}
int f[MAX * 3];
int calc() {
f[0] = 1;
for (int i = 1; i <= MAX * 2; ++i)
f[i] = mult(f[i - 1], i);
}
int c(int n, int k) { return mult(f[n], binpow(mult(f[k], f[n - k]))); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int x, y;
cin >> x >> y;
if ((x + y) % 3)
cout << 0, exit(0);
int m = -1, n = -1;
for (int i = 0; i <= MAX; ++i) {
m = x - 2 * i;
if (2 * m + i == y) {
n = i;
break;
}
}
if (m < 0 || n < 0)
cout << 0, exit(0);
calc();
cout << c(n + m, m);
return 0;
}
| replace | 47 | 48 | 47 | 48 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define v2(v, n, m, init) vector<vector<int>> v(n, vector<int>(m, init))
#define vb2(v, n, m, init) vector<vector<bool>> v(n, vector<bool>(m, init))
#define vll2(v, n, m, init) vector<vector<ll>> v(n, vector<ll>(m, init))
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define REP(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)
#define arr(var, n) \
vec var(n); \
rep(i, n) { cin >> var[i]; }
#define arrll(var, n) \
vecll var(n); \
rep(i, n) { cin >> var[i]; }
#define arrst(var, n) \
vecst var(n); \
rep(i, n) { cin >> var[i]; }
#define all(var) (var).begin(), (var).end()
#define sortall(var) sort(all(var))
#define uniqueall(v) v.erase(unique(v.begin(), v.end()), v.end());
#define pb(var) push_back(var)
#define prt(var) cout << (var) << "\n"
#define prtd(n, var) cout << fixed << setprecision(n) << (var) << "\n"
#define prtfill(n, var) cout << setw(n) << setfill('0') << (var);
#define prt2(v1, v2) cout << (v1) << " " << (v2) << "\n"
#define prt3(v1, v2, v3) cout << (v1) << " " << (v2) << " " << (v3) << "\n"
#define prtall(v) \
rep(i, v.size()) { cout << v[i] << (i != v.size() - 1 ? " " : "\n"); }
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
//------------------------------------------------------------------
template <unsigned int mod_> struct ModInt {
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr static uint mod = mod_;
uint v;
ModInt() : v(0) {}
ModInt(ll _v) : v(normS(_v % mod + mod)) {}
explicit operator bool() const { return v != 0; }
static uint normS(const uint &x) {
return (x < mod) ? x : x - mod;
} // [0 , 2*mod-1] -> [0 , mod-1]
static ModInt make(const uint &x) {
ModInt m;
m.v = x;
return m;
}
ModInt operator+(const ModInt &b) const { return make(normS(v + b.v)); }
ModInt operator-(const ModInt &b) const { return make(normS(v + mod - b.v)); }
ModInt operator-() const { return make(normS(mod - v)); }
ModInt operator*(const ModInt &b) const { return make((ull)v * b.v % mod); }
ModInt operator/(const ModInt &b) const { return *this * b.inv(); }
ModInt &operator+=(const ModInt &b) { return *this = *this + b; }
ModInt &operator-=(const ModInt &b) { return *this = *this - b; }
ModInt &operator*=(const ModInt &b) { return *this = *this * b; }
ModInt &operator/=(const ModInt &b) { return *this = *this / b; }
ModInt &operator++(int) { return *this = *this + 1; }
ModInt &operator--(int) { return *this = *this - 1; }
ll extgcd(ll a, ll b, ll &x, ll &y) const {
ll p[] = {a, 1, 0}, q[] = {b, 0, 1};
while (*q) {
ll t = *p / *q;
rep(i, 3) swap(p[i] -= t * q[i], q[i]);
}
if (p[0] < 0)
rep(i, 3) p[i] = -p[i];
x = p[1], y = p[2];
return p[0];
}
ModInt inv() const {
ll x, y;
extgcd(v, mod, x, y);
return make(normS(x + mod));
}
ModInt pow(ll p) const {
if (p < 0)
return inv().pow(-p);
ModInt a = 1;
ModInt x = *this;
while (p) {
if (p & 1)
a *= x;
x *= x;
p >>= 1;
}
return a;
}
bool operator==(const ModInt &b) const { return v == b.v; }
bool operator!=(const ModInt &b) const { return v != b.v; }
friend istream &operator>>(istream &o, ModInt &x) {
ll tmp;
o >> tmp;
x = ModInt(tmp);
return o;
}
friend ostream &operator<<(ostream &o, const ModInt &x) { return o << x.v; }
};
using mint = ModInt<1000000007>;
const int MAX = 400000;
mint 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;
inv[i] = (mint)1 / i;
finv[i] = finv[i - 1] * inv[i];
}
}
mint 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];
}
int main(void) {
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
prt(0);
return 0;
}
ll m = (2 * x - y) / 3;
ll n = (2 * y - x) / 3;
if (m < 0 || n < 0) {
prt(0);
return 0;
}
COMinit();
prt(COM(m + n, n));
}
| #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
ll MOD = 1000000007;
#define vec vector<int>
#define vecll vector<ll>
#define vecd vector<double>
#define vecst vector<string>
#define vecb vector<bool>
#define v2(v, n, m, init) vector<vector<int>> v(n, vector<int>(m, init))
#define vb2(v, n, m, init) vector<vector<bool>> v(n, vector<bool>(m, init))
#define vll2(v, n, m, init) vector<vector<ll>> v(n, vector<ll>(m, init))
#define rep(i, n) for (ll i = (ll)0; i < (ll)n; i++)
#define REP(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)
#define arr(var, n) \
vec var(n); \
rep(i, n) { cin >> var[i]; }
#define arrll(var, n) \
vecll var(n); \
rep(i, n) { cin >> var[i]; }
#define arrst(var, n) \
vecst var(n); \
rep(i, n) { cin >> var[i]; }
#define all(var) (var).begin(), (var).end()
#define sortall(var) sort(all(var))
#define uniqueall(v) v.erase(unique(v.begin(), v.end()), v.end());
#define pb(var) push_back(var)
#define prt(var) cout << (var) << "\n"
#define prtd(n, var) cout << fixed << setprecision(n) << (var) << "\n"
#define prtfill(n, var) cout << setw(n) << setfill('0') << (var);
#define prt2(v1, v2) cout << (v1) << " " << (v2) << "\n"
#define prt3(v1, v2, v3) cout << (v1) << " " << (v2) << " " << (v3) << "\n"
#define prtall(v) \
rep(i, v.size()) { cout << v[i] << (i != v.size() - 1 ? " " : "\n"); }
template <typename T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
//------------------------------------------------------------------
template <unsigned int mod_> struct ModInt {
using uint = unsigned int;
using ll = long long;
using ull = unsigned long long;
constexpr static uint mod = mod_;
uint v;
ModInt() : v(0) {}
ModInt(ll _v) : v(normS(_v % mod + mod)) {}
explicit operator bool() const { return v != 0; }
static uint normS(const uint &x) {
return (x < mod) ? x : x - mod;
} // [0 , 2*mod-1] -> [0 , mod-1]
static ModInt make(const uint &x) {
ModInt m;
m.v = x;
return m;
}
ModInt operator+(const ModInt &b) const { return make(normS(v + b.v)); }
ModInt operator-(const ModInt &b) const { return make(normS(v + mod - b.v)); }
ModInt operator-() const { return make(normS(mod - v)); }
ModInt operator*(const ModInt &b) const { return make((ull)v * b.v % mod); }
ModInt operator/(const ModInt &b) const { return *this * b.inv(); }
ModInt &operator+=(const ModInt &b) { return *this = *this + b; }
ModInt &operator-=(const ModInt &b) { return *this = *this - b; }
ModInt &operator*=(const ModInt &b) { return *this = *this * b; }
ModInt &operator/=(const ModInt &b) { return *this = *this / b; }
ModInt &operator++(int) { return *this = *this + 1; }
ModInt &operator--(int) { return *this = *this - 1; }
ll extgcd(ll a, ll b, ll &x, ll &y) const {
ll p[] = {a, 1, 0}, q[] = {b, 0, 1};
while (*q) {
ll t = *p / *q;
rep(i, 3) swap(p[i] -= t * q[i], q[i]);
}
if (p[0] < 0)
rep(i, 3) p[i] = -p[i];
x = p[1], y = p[2];
return p[0];
}
ModInt inv() const {
ll x, y;
extgcd(v, mod, x, y);
return make(normS(x + mod));
}
ModInt pow(ll p) const {
if (p < 0)
return inv().pow(-p);
ModInt a = 1;
ModInt x = *this;
while (p) {
if (p & 1)
a *= x;
x *= x;
p >>= 1;
}
return a;
}
bool operator==(const ModInt &b) const { return v == b.v; }
bool operator!=(const ModInt &b) const { return v != b.v; }
friend istream &operator>>(istream &o, ModInt &x) {
ll tmp;
o >> tmp;
x = ModInt(tmp);
return o;
}
friend ostream &operator<<(ostream &o, const ModInt &x) { return o << x.v; }
};
using mint = ModInt<1000000007>;
const int MAX = 700000;
mint 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;
inv[i] = (mint)1 / i;
finv[i] = finv[i - 1] * inv[i];
}
}
mint 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];
}
int main(void) {
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
prt(0);
return 0;
}
ll m = (2 * x - y) / 3;
ll n = (2 * y - x) / 3;
if (m < 0 || n < 0) {
prt(0);
return 0;
}
COMinit();
prt(COM(m + n, n));
}
| replace | 122 | 123 | 122 | 123 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define filein freopen("input.txt", "r", stdin)
#define fileout freopen("output.txt", "w", stdout)
using namespace std;
ll bigmod(ll a, ll b, ll m) {
ll ans = 1;
a %= m;
while (b) {
if (b & 1)
ans = (ans * a) % m;
b >>= 1;
a = (a * a) % m;
}
return ans;
}
ll facto[1000009];
int main() {
facto[0] = facto[1] = 1;
for (int i = 1; i <= 1000002; i++)
facto[i] = (facto[i - 1] * i) % mod;
ll x, y;
cin >> x >> y;
ll d = x + y;
if (d % 3)
cout << 0 << endl;
else {
d /= 3;
if (x - d < 0)
cout << 0 << endl;
else {
ll e = bigmod(facto[x - d], mod - 2, mod);
ll f = bigmod(facto[2 * d - x], mod - 2, mod);
ll ans = (facto[d] * e) % mod;
ans = ans * f;
ans %= mod;
cout << ans << endl;
}
}
}
| #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(NULL)
#define filein freopen("input.txt", "r", stdin)
#define fileout freopen("output.txt", "w", stdout)
using namespace std;
ll bigmod(ll a, ll b, ll m) {
ll ans = 1;
a %= m;
while (b) {
if (b & 1)
ans = (ans * a) % m;
b >>= 1;
a = (a * a) % m;
}
return ans;
}
ll facto[1000009];
int main() {
facto[0] = facto[1] = 1;
for (int i = 1; i <= 1000002; i++)
facto[i] = (facto[i - 1] * i) % mod;
ll x, y;
cin >> x >> y;
ll d = x + y;
if (d % 3)
cout << 0 << endl;
else {
d /= 3;
if (x - d < 0)
cout << 0 << endl;
else if (2 * d - x < 0)
cout << 0 << endl;
else {
ll e = bigmod(facto[x - d], mod - 2, mod);
ll f = bigmod(facto[2 * d - x], mod - 2, mod);
ll ans = (facto[d] * e) % mod;
ans = ans * f;
ans %= mod;
cout << ans << endl;
}
}
}
| insert | 36 | 36 | 36 | 38 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpll = vector<pll>;
//**関数リスト**//
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
bool pairCompare(const pll firstElof, pll secondElof) {
return firstElof.first > secondElof.first;
}
ll nod(ll F) {
ll keta = 1;
while (F / 10 > 0) {
keta++;
F /= 10;
}
return keta;
}
ll gcd(ll x, ll y) {
ll r;
if (x < y) {
swap(x, y);
}
while (y > 0) {
r = x % y;
x = y;
y = r;
}
return x;
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
ll isPrime(ll x) {
ll i;
if (x < 2) {
return 0;
} else if (x == 2) {
return 1;
} else if (x % 2 == 0) {
return 0;
} else {
for (i = 3; i * i <= x; i += 2) {
if (x % i == 0) {
return 0;
}
}
return 1;
}
}
void eratos(vl isPrime) {
//(注)isPrimeのサイズはN+1にする！実際にはmain内に配置して使用
ll i, j;
for (i = 0; i < isPrime.size(); i++) {
isPrime[i] = 1;
}
isPrime[0] = 0;
isPrime[1] = 0;
for (i = 2; i * i <= isPrime.size() - 1; i++) {
if (isPrime[i] == 1) {
j = i * 2;
while (j <= isPrime.size() - 1) {
isPrime[j] = 0;
j = j + i;
}
}
}
}
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;
}
ll alphabet(char C) {
ll b = 0;
ll key = 0;
if (C == 'a') {
return b;
}
b++;
if (C == 'b') {
return b;
}
b++;
if (C == 'c') {
return b;
}
b++;
if (C == 'd') {
return b;
}
b++;
if (C == 'e') {
return b;
}
b++;
if (C == 'f') {
return b;
}
b++;
if (C == 'g') {
return b;
}
b++;
if (C == 'h') {
return b;
}
b++;
if (C == 'i') {
return b;
}
b++;
if (C == 'j') {
return b;
}
b++;
if (C == 'k') {
return b;
}
b++;
if (C == 'l') {
return b;
}
b++;
if (C == 'm') {
return b;
}
b++;
if (C == 'n') {
return b;
}
b++;
if (C == 'o') {
return b;
}
b++;
if (C == 'p') {
return b;
}
b++;
if (C == 'q') {
return b;
}
b++;
if (C == 'r') {
return b;
}
b++;
if (C == 's') {
return b;
}
b++;
if (C == 't') {
return b;
}
b++;
if (C == 'u') {
return b;
}
b++;
if (C == 'v') {
return b;
}
b++;
if (C == 'w') {
return b;
}
b++;
if (C == 'x') {
return b;
}
b++;
if (C == 'y') {
return b;
}
b++;
if (C == 'z') {
return b;
}
return -1;
}
void bitSearch(ll n) {
// 実際にはコピーして中身を改変して使う
ll i, j;
for (i = 0; i < pow(2, n); i++) {
ll p = i;
for (j = 0; j < n; j++) {
cout << p % 2;
p /= 2;
}
cout << endl;
}
}
void dfsx(ll now, ll C) {
stack<ll> S;
S.push(now);
// color[now] = C;
// while (!S.empty()) {
ll u = S.top();
S.pop();
// for (ll i = 0; i < road[u].size(); i++) {
// ll v = road[u][i];
// if (color[v] == 0) {
// dfs(v, C);
//}
//}
//}
}
void bfs(ll now) {
// 中身は毎回書き換えて使用
queue<ll> Q;
Q.push(now);
ll u;
while (!Q.empty()) {
u = Q.front();
Q.pop();
// ll v=;
// Q.push(v);
}
}
void dijkstra(ll s) {
priority_queue<pll> PQ;
// vl D(N), color(N);
// for (i = 0; i < N; i++) {
// D[i] = INF;
// color[i] = 0;
// }
// D[s] = 0;
PQ.push(make_pair(0, s));
// color[0] = 1;
ll q = -1;
while (!PQ.empty()) {
pll f = PQ.top();
PQ.pop();
ll u = f.second;
// color[u] = 2;
// if (D[u] < f.first * q) {
// continue;
// }
// for (j = 0; j < path[u].size(); j++) {
// ll v = path[u][j].first;
// if (color[v] == 2) {
// continue;
// }
// if (D[v] > D[u] + path[u][j].second) {
// D[v] = D[u] + path[u][j].second;
// color[v] = 1;
// PQ.push(make_pair(D[v] * q, v));
// }
//}
}
// cout << (D[N - 1] == INF ? -1 : D[N - 1]);
}
//**定義場所**//
ll i, j, k, l, m, n, N, M, K, H, W, L;
string S, T;
ll MOD = 1000000007;
ll ans = 1;
ll INF = 9999999999999999;
//***********//
int main() {
ll X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0;
} else if (X / Y > 2 || Y / X > 2) {
cout << 0;
} else {
ll P = (X + Y) / 3;
ll Q = (P - abs(X - Y)) / 2;
P -= Q;
vl R(340000);
R[0] = 1;
for (i = 1; i < 340000; i++) {
ll z = modinv(i, MOD);
R[i] = (R[i - 1] * (P + i)) % MOD;
R[i] = (R[i] * z) % MOD;
}
cout << R[Q];
}
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
using vl = vector<ll>;
using vll = vector<vl>;
using vpll = vector<pll>;
//**関数リスト**//
int ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
bool pairCompare(const pll firstElof, pll secondElof) {
return firstElof.first > secondElof.first;
}
ll nod(ll F) {
ll keta = 1;
while (F / 10 > 0) {
keta++;
F /= 10;
}
return keta;
}
ll gcd(ll x, ll y) {
ll r;
if (x < y) {
swap(x, y);
}
while (y > 0) {
r = x % y;
x = y;
y = r;
}
return x;
}
ll lcm(ll x, ll y) { return x * y / gcd(x, y); }
ll isPrime(ll x) {
ll i;
if (x < 2) {
return 0;
} else if (x == 2) {
return 1;
} else if (x % 2 == 0) {
return 0;
} else {
for (i = 3; i * i <= x; i += 2) {
if (x % i == 0) {
return 0;
}
}
return 1;
}
}
void eratos(vl isPrime) {
//(注)isPrimeのサイズはN+1にする！実際にはmain内に配置して使用
ll i, j;
for (i = 0; i < isPrime.size(); i++) {
isPrime[i] = 1;
}
isPrime[0] = 0;
isPrime[1] = 0;
for (i = 2; i * i <= isPrime.size() - 1; i++) {
if (isPrime[i] == 1) {
j = i * 2;
while (j <= isPrime.size() - 1) {
isPrime[j] = 0;
j = j + i;
}
}
}
}
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;
}
ll alphabet(char C) {
ll b = 0;
ll key = 0;
if (C == 'a') {
return b;
}
b++;
if (C == 'b') {
return b;
}
b++;
if (C == 'c') {
return b;
}
b++;
if (C == 'd') {
return b;
}
b++;
if (C == 'e') {
return b;
}
b++;
if (C == 'f') {
return b;
}
b++;
if (C == 'g') {
return b;
}
b++;
if (C == 'h') {
return b;
}
b++;
if (C == 'i') {
return b;
}
b++;
if (C == 'j') {
return b;
}
b++;
if (C == 'k') {
return b;
}
b++;
if (C == 'l') {
return b;
}
b++;
if (C == 'm') {
return b;
}
b++;
if (C == 'n') {
return b;
}
b++;
if (C == 'o') {
return b;
}
b++;
if (C == 'p') {
return b;
}
b++;
if (C == 'q') {
return b;
}
b++;
if (C == 'r') {
return b;
}
b++;
if (C == 's') {
return b;
}
b++;
if (C == 't') {
return b;
}
b++;
if (C == 'u') {
return b;
}
b++;
if (C == 'v') {
return b;
}
b++;
if (C == 'w') {
return b;
}
b++;
if (C == 'x') {
return b;
}
b++;
if (C == 'y') {
return b;
}
b++;
if (C == 'z') {
return b;
}
return -1;
}
void bitSearch(ll n) {
// 実際にはコピーして中身を改変して使う
ll i, j;
for (i = 0; i < pow(2, n); i++) {
ll p = i;
for (j = 0; j < n; j++) {
cout << p % 2;
p /= 2;
}
cout << endl;
}
}
void dfsx(ll now, ll C) {
stack<ll> S;
S.push(now);
// color[now] = C;
// while (!S.empty()) {
ll u = S.top();
S.pop();
// for (ll i = 0; i < road[u].size(); i++) {
// ll v = road[u][i];
// if (color[v] == 0) {
// dfs(v, C);
//}
//}
//}
}
void bfs(ll now) {
// 中身は毎回書き換えて使用
queue<ll> Q;
Q.push(now);
ll u;
while (!Q.empty()) {
u = Q.front();
Q.pop();
// ll v=;
// Q.push(v);
}
}
void dijkstra(ll s) {
priority_queue<pll> PQ;
// vl D(N), color(N);
// for (i = 0; i < N; i++) {
// D[i] = INF;
// color[i] = 0;
// }
// D[s] = 0;
PQ.push(make_pair(0, s));
// color[0] = 1;
ll q = -1;
while (!PQ.empty()) {
pll f = PQ.top();
PQ.pop();
ll u = f.second;
// color[u] = 2;
// if (D[u] < f.first * q) {
// continue;
// }
// for (j = 0; j < path[u].size(); j++) {
// ll v = path[u][j].first;
// if (color[v] == 2) {
// continue;
// }
// if (D[v] > D[u] + path[u][j].second) {
// D[v] = D[u] + path[u][j].second;
// color[v] = 1;
// PQ.push(make_pair(D[v] * q, v));
// }
//}
}
// cout << (D[N - 1] == INF ? -1 : D[N - 1]);
}
//**定義場所**//
ll i, j, k, l, m, n, N, M, K, H, W, L;
string S, T;
ll MOD = 1000000007;
ll ans = 1;
ll INF = 9999999999999999;
//***********//
int main() {
ll X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0;
} else if (X * 2 < Y || Y * 2 < X) {
cout << 0;
} else {
ll P = (X + Y) / 3;
ll Q = (P - abs(X - Y)) / 2;
P -= Q;
vl R(340000);
R[0] = 1;
for (i = 1; i < 340000; i++) {
ll z = modinv(i, MOD);
R[i] = (R[i - 1] * (P + i)) % MOD;
R[i] = (R[i] * z) % MOD;
}
cout << R[Q];
}
} | replace | 309 | 310 | 309 | 310 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ULL;
const int nMax = 2000001, MOD = 1e9 + 7;
ULL inv[nMax], Fact[nMax], invF[nMax];
ULL Comb(int n, int r) {
return (((Fact[n] * invF[r]) % MOD) * invF[n - r]) % MOD;
}
int main() {
inv[1] = Fact[0] = Fact[1] = invF[0] = invF[1] = 1;
for (int i = 2; i < nMax; i++) {
inv[i] = ((MOD - MOD / i) * inv[MOD % i]) % MOD;
Fact[i] = (Fact[i - 1] * i) % MOD;
invF[i] = (invF[i - 1] * inv[i]) % MOD;
}
int X, Y, A, B, ans = 0;
cin >> X >> Y;
int K = abs(Y - X);
if (X <= Y) {
A = X - K;
B = Y - 2 * K;
} else {
A = Y - K;
B = X - 2 * K;
}
if (A == B && A % 3 == 0) {
ans = Comb(2 * A / 3 + K, A / 3);
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ULL;
const int nMax = 2000001, MOD = 1e9 + 7;
ULL inv[nMax], Fact[nMax], invF[nMax];
ULL Comb(int n, int r) {
return (((Fact[n] * invF[r]) % MOD) * invF[n - r]) % MOD;
}
int main() {
inv[1] = Fact[0] = Fact[1] = invF[0] = invF[1] = 1;
for (int i = 2; i < nMax; i++) {
inv[i] = ((MOD - MOD / i) * inv[MOD % i]) % MOD;
Fact[i] = (Fact[i - 1] * i) % MOD;
invF[i] = (invF[i - 1] * inv[i]) % MOD;
}
int X, Y, A, B, ans = 0;
cin >> X >> Y;
int K = abs(Y - X);
if (X <= Y) {
A = X - K;
B = Y - 2 * K;
} else {
A = Y - K;
B = X - 2 * K;
}
if (A == B && A % 3 == 0 && A >= 0) {
ans = Comb(2 * A / 3 + K, A / 3);
}
cout << ans << "\n";
}
| replace | 26 | 27 | 26 | 27 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <functional>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
// 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;
// const int mod = 998244353;
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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= 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 { return mint(*this) /= a; }
};
mint N[2000001];
int main() {
int X, Y;
cin >> X >> Y;
if ((-X + 2 * Y) % 3 != 0 || (2 * X - Y) % 3 != 0) {
cout << "0" << endl;
return 0;
}
int x = (-X + 2 * Y) / 3;
int y = (2 * X - Y) / 3;
N[0] = 1;
for (int i = 1; i < 2000001; i++) {
N[i] = N[i - 1] * i;
}
mint ans = N[x + y] / (N[x] * N[y]);
cout << ans.x << endl;
return 0;
}
| #include <algorithm>
#include <climits>
#include <functional>
#include <iostream>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
// 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;
// const int mod = 998244353;
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 { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= 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 { return mint(*this) /= a; }
};
mint N[2000001];
int main() {
int X, Y;
cin >> X >> Y;
if ((-X + 2 * Y) % 3 != 0 || (2 * X - Y) % 3 != 0) {
cout << "0" << endl;
return 0;
}
int x = (-X + 2 * Y) / 3;
int y = (2 * X - Y) / 3;
if (x < 0 || y < 0) {
cout << "0" << endl;
return 0;
}
N[0] = 1;
for (int i = 1; i < 2000001; i++) {
N[i] = N[i - 1] * i;
}
mint ans = N[x + y] / (N[x] * N[y]);
cout << ans.x << endl;
return 0;
}
| insert | 73 | 73 | 73 | 78 | 0 | |
p02862 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int n, m;
int mod = 1000000007;
vector<long long> fac, inv, finv;
void combinit() {
fac.resize(n + m + 1);
inv.resize(n + m + 1);
finv.resize(n + m + 1);
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i < n + m + 1; 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 combination(int n, int k) {
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main(int argc, char const *argv[]) {
long long X, Y;
cin >> X >> Y;
int ans;
if ((X + Y) % 3 == 0) {
m = (2 * Y - X) / 3;
n = Y - 2 * m;
combinit();
ans = (int)combination(n + m, n);
} else {
ans = 0;
}
cout << ans << endl;
return 0;
} | #include <iostream>
#include <vector>
using namespace std;
int n, m;
int mod = 1000000007;
vector<long long> fac, inv, finv;
void combinit() {
fac.resize(n + m + 1);
inv.resize(n + m + 1);
finv.resize(n + m + 1);
fac[0] = fac[1] = 1;
inv[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i < n + m + 1; 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 combination(int n, int k) {
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main(int argc, char const *argv[]) {
long long X, Y;
cin >> X >> Y;
int ans;
if ((X + Y) % 3 == 0) {
m = (2 * Y - X) / 3;
n = Y - 2 * m;
if (n < 0 || m < 0) {
ans = 0;
cout << ans << endl;
return 0;
}
combinit();
ans = (int)combination(n + m, n);
} else {
ans = 0;
}
cout << ans << endl;
return 0;
} | insert | 35 | 35 | 35 | 40 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
// nを２進数に分解してビットの立っているところだけ掛け算していく。
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a inverse (mod m)
// a^(-1) = a^(p-2) (mod p)
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
const int max_fac = 5 * 1e5;
long long fac[max_fac], finv[max_fac], inv[max_fac];
void ComInit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < max_fac; 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 Comb(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;
cin >> x >> y;
int cnt_1 = 0;
long long ans = 0;
bool flag = 0;
while (!flag) {
long long cur_x = cnt_1;
long long cur_y = 2 * cnt_1;
if (cur_x > x || cur_y > y)
break;
long long res_x = x - cur_x;
long long res_y = y - cur_y;
// cout << "now (x,y) = " << cur_x << ", " << cur_y << endl;
// cout << "rest (x,y) = " << res_x << ", " << res_y << endl;
if (res_y * 2 == res_x) {
// can be reached
// cout << "can be reached " << endl;
int cnt_2 = res_y;
// cout << "cnt1 = " << cnt_1 << ", cnt2 = " << cnt_2 << endl;
ans += Comb(cnt_1 + cnt_2, cnt_1);
ans %= MOD;
}
cnt_1++;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int INF = 1e9;
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
// nを２進数に分解してビットの立っているところだけ掛け算していく。
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a inverse (mod m)
// a^(-1) = a^(p-2) (mod p)
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
const int max_fac = 2 * 1e6;
long long fac[max_fac], finv[max_fac], inv[max_fac];
void ComInit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < max_fac; 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 Comb(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;
cin >> x >> y;
int cnt_1 = 0;
long long ans = 0;
bool flag = 0;
while (!flag) {
long long cur_x = cnt_1;
long long cur_y = 2 * cnt_1;
if (cur_x > x || cur_y > y)
break;
long long res_x = x - cur_x;
long long res_y = y - cur_y;
// cout << "now (x,y) = " << cur_x << ", " << cur_y << endl;
// cout << "rest (x,y) = " << res_x << ", " << res_y << endl;
if (res_y * 2 == res_x) {
// can be reached
// cout << "can be reached " << endl;
int cnt_2 = res_y;
// cout << "cnt1 = " << cnt_1 << ", cnt2 = " << cnt_2 << endl;
ans += Comb(cnt_1 + cnt_2, cnt_1);
ans %= MOD;
}
cnt_1++;
}
cout << ans << endl;
return 0;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < (int)v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < (int)v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
const ll N_MAX = 1000005;
ll inv[N_MAX], fac[N_MAX], finv[N_MAX];
void make() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < N_MAX; i++) {
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fac[i] = fac[i - 1] * (ll)i % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll combination(ll C, ll D) {
if (C < D || C < 1)
return 0;
return fac[C] * (finv[D] * finv[C - D] % mod) % mod;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
make();
ll X, Y;
cin >> X >> Y;
ll A = X + Y;
ll B = X - Y;
if (A % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll T = A / 3;
// dump(T)
if ((B + T) % 2 != 0) {
cout << 0 << endl;
return 0;
}
ll p = (B + T) / 2;
cout << combination(T, p) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<double, double> pdd;
const ull mod = 1e9 + 7;
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
template <class S, class T>
ostream &operator<<(ostream &os, const pair<S, T> v) {
os << "(" << v.first << ", " << v.second << ")";
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> v) {
for (int i = 0; i < (int)v.size(); i++) {
if (i > 0) {
os << " ";
}
os << v[i];
}
return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<vector<T>> v) {
for (int i = 0; i < (int)v.size(); i++) {
if (i > 0) {
os << endl;
}
os << v[i];
}
return os;
}
const ll N_MAX = 1000005;
ll inv[N_MAX], fac[N_MAX], finv[N_MAX];
void make() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < N_MAX; i++) {
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fac[i] = fac[i - 1] * (ll)i % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll combination(ll C, ll D) {
if (C < D || C < 1)
return 0;
return fac[C] * (finv[D] * finv[C - D] % mod) % mod;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
make();
ll X, Y;
cin >> X >> Y;
ll A = X + Y;
ll B = abs(X - Y);
if (A % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll T = A / 3;
// dump(T)
if ((B + T) % 2 != 0) {
cout << 0 << endl;
return 0;
}
ll p = (B + T) / 2;
cout << combination(T, p) << endl;
return 0;
} | replace | 69 | 70 | 69 | 70 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int m = 1e6, M = 1e9 + 7;
ll inverse[3 * m], fact[3 * m], invfact[3 * m];
ll nCr(ll n, ll r) {
ll ans = fact[n] * invfact[r] % M;
return (ans * invfact[n - r] % M);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// good luck, kittu
inverse[1] = 1;
for (ll i = 2; i < 3 * m; i++)
inverse[i] = M - M / i * inverse[M % i] % M;
fact[0] = invfact[0] = 1;
for (ll i = 1; i < 3 * m; i++) {
fact[i] = fact[i - 1] * i % M;
invfact[i] = invfact[i - 1] * inverse[i] % M;
}
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0)
return cout << "0\n", 0;
ll n = (2 * y - x) / 3, m = (2 * x - y) / 3;
ll ans = nCr(n + m, n);
ans %= M;
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
using namespace std;
const int m = 1e6, M = 1e9 + 7;
ll inverse[3 * m], fact[3 * m], invfact[3 * m];
ll nCr(ll n, ll r) {
ll ans = fact[n] * invfact[r] % M;
return (ans * invfact[n - r] % M);
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
// good luck, kittu
inverse[1] = 1;
for (ll i = 2; i < 3 * m; i++)
inverse[i] = M - M / i * inverse[M % i] % M;
fact[0] = invfact[0] = 1;
for (ll i = 1; i < 3 * m; i++) {
fact[i] = fact[i - 1] * i % M;
invfact[i] = invfact[i - 1] * inverse[i] % M;
}
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0)
return cout << "0\n", 0;
ll n = (2 * y - x) / 3, m = (2 * x - y) / 3;
if (n < 0 || m < 0)
return cout << "0\n", 0;
ll ans = nCr(n + m, n);
ans %= M;
cout << ans << "\n";
return 0;
}
| insert | 33 | 33 | 33 | 36 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using std::vector;
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
//////////////////////////////////////
//////////////////////////////////////
int main() {
ll X, Y;
cin >> X >> Y;
if ((2 * X - Y) % 3 != 0 || (-X + 2 * Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll a, b, n;
a = (2 * X - Y) / 3;
b = (-X + 2 * Y) / 3;
n = a + b;
vector<ll> m(n + 1), mi(n + 1), inv(n + 1);
m[0] = 1;
m[1] = 1;
mi[0] = 1;
mi[1] = 1;
inv[1] = 1;
for (int i = 2; i <= n; i++) {
m[i] = m[i - 1] * i % MOD_BIG;
inv[i] = MOD_BIG - inv[MOD_BIG % i] * (MOD_BIG / i) % MOD_BIG;
mi[i] = mi[i - 1] * inv[i] % MOD_BIG;
}
ll ans = m[n] * (mi[a] * mi[b] % MOD_BIG) % MOD_BIG;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <fstream>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_set>
#include <vector>
#define MOD_BIG 1000000007
#define MOD_BIG2 998244353
using std::cerr;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using ll = long long;
using std::vector;
template <typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template <typename T, typename... Args>
void ndarray(vector<T> &vec, int len, Args... args) {
vec.resize(len);
for (auto &v : vec)
ndarray(v, args...);
}
//////////////////////////////////////
//////////////////////////////////////
int main() {
ll X, Y;
cin >> X >> Y;
if ((2 * X - Y) % 3 != 0 || (-X + 2 * Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll a, b, n;
a = (2 * X - Y) / 3;
b = (-X + 2 * Y) / 3;
n = a + b;
if (a < 0 || b < 0) {
cout << 0 << endl;
return 0;
}
vector<ll> m(n + 1), mi(n + 1), inv(n + 1);
m[0] = 1;
m[1] = 1;
mi[0] = 1;
mi[1] = 1;
inv[1] = 1;
for (int i = 2; i <= n; i++) {
m[i] = m[i - 1] * i % MOD_BIG;
inv[i] = MOD_BIG - inv[MOD_BIG % i] * (MOD_BIG / i) % MOD_BIG;
mi[i] = mi[i - 1] * inv[i] % MOD_BIG;
}
ll ans = m[n] * (mi[a] * mi[b] % MOD_BIG) % MOD_BIG;
cout << ans << endl;
return 0;
}
| insert | 49 | 49 | 49 | 53 | 0 | |
p02862 | C++ | Runtime Error | // ~maqsat~
/*
*/
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("Ofast")
// #pragma GCC optimization ("unroll-loops")
// #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>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define in insert
#define pb push_back
#define eb emplace_back
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define count1 __builtin_popcountl
#define debug(x) cerr << (#x) << " = " << (x) << "\n"
#define ACCELERATE ios_base::sync_with_stdio(false), cin.tie(nullptr)
#define fre(f) \
if (fopen(f ".in", "r")) \
freopen(f ".in", "r", stdin), freopen(f ".out", "w", stdout)
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned long long;
// using big = __int128_t; // -10^38...10^38
using db = double;
using ld = long double;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
template <class T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T> inline void cmin(T &a, T b) { a = min(a, b); }
template <class T> inline void cmax(T &a, T b) { a = max(a, b); }
const int oo = 0x3f3f3f3f;
const ll N = 4e6 + 345;
const ll MOD = 1e9 + 7;
const ll INF = 1e10 + 9;
const db EPS = 1e-9;
const db PI = acos(-1); // 3.14159265358979323846
const int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
const int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define int ll
ll f[N];
inline ll binpow(ll a, ll n) {
ll res = 1;
while (n) {
if (n & 1ll)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1ll;
}
return res;
}
signed main() {
fre("");
ACCELERATE;
f[0] = f[1] = 1;
for (int i = 2; i <= N - 100; i++)
f[i] = f[i - 1] * i % MOD;
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0;
return 0;
}
ll n = (x + y) / 3;
ll k = (x - y + n) / 2;
if (n < 0 || k < 0) {
cout << 0;
return 0;
}
cout << f[n] * binpow(f[k], MOD - 2) % MOD * binpow(f[n - k], MOD - 2) % MOD;
return 0;
}
/*
*/
| // ~maqsat~
/*
*/
// #pragma GCC target ("avx2")
// #pragma GCC optimization ("Ofast")
// #pragma GCC optimization ("unroll-loops")
// #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>
#include <ext/pb_ds/assoc_container.hpp>
#define F first
#define S second
#define in insert
#define pb push_back
#define eb emplace_back
#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define count1 __builtin_popcountl
#define debug(x) cerr << (#x) << " = " << (x) << "\n"
#define ACCELERATE ios_base::sync_with_stdio(false), cin.tie(nullptr)
#define fre(f) \
if (fopen(f ".in", "r")) \
freopen(f ".in", "r", stdin), freopen(f ".out", "w", stdout)
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using ull = unsigned long long;
// using big = __int128_t; // -10^38...10^38
using db = double;
using ld = long double;
typedef pair<int, int> ii;
typedef pair<ll, ll> pll;
template <class T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template <class T> inline void cmin(T &a, T b) { a = min(a, b); }
template <class T> inline void cmax(T &a, T b) { a = max(a, b); }
const int oo = 0x3f3f3f3f;
const ll N = 4e6 + 345;
const ll MOD = 1e9 + 7;
const ll INF = 1e10 + 9;
const db EPS = 1e-9;
const db PI = acos(-1); // 3.14159265358979323846
const int dx[] = {1, -1, 0, 0, 1, 1, -1, -1};
const int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
#define int ll
ll f[N];
inline ll binpow(ll a, ll n) {
ll res = 1;
while (n) {
if (n & 1ll)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1ll;
}
return res;
}
signed main() {
fre("");
ACCELERATE;
f[0] = f[1] = 1;
for (int i = 2; i <= N - 100; i++)
f[i] = f[i - 1] * i % MOD;
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0;
return 0;
}
ll n = (x + y) / 3;
ll k = (x - y + n) / 2;
if (n < 0 || k < 0 || (n - k) < 0) {
cout << 0;
return 0;
}
cout << f[n] * binpow(f[k], MOD - 2) % MOD * binpow(f[n - k], MOD - 2) % MOD;
return 0;
}
/*
*/
| replace | 89 | 90 | 89 | 90 | 0 | |
p02862 | C++ | Runtime Error | /*
友利奈緒ぱわーでACしてくれ！！！！！！！！！！！！
Charlotteまだ見てない人は見ような！！！！！！！
／ /:／ ＼:ヽ ＼
/ ／ ＼ ヽ
＼__L 彡 ヽ ',
ﾌ / / / / , ヽ ', ｊ
ﾚ / / / ', ヽ j
// ! /_l＿/__ノ { ＼} ', ',/
i ﾊ { 从j ﾊ i ', ト-､} i i } jj
( ﾊ ( 川 ハ ﾊ ! ' ﾊ ﾊ j j ,' 八
＜＿,ｨ∧ 斗芹ﾃミxハ ﾊ ﾚ } /__ﾚﾚ / ∧ ＼ ﾉ
∨ ＼ ゝ 辷:ソ ) 芹ﾚ心ヾレ′ / ト-- ´
＼ｰ‐' ﾉ ＼ゝ ゞ:_ソ "/ ／ ヽ
フ i八 " " , ム彡 ＼
/ / j ト " "イト＜ ＼＼
/ / j /／ヽ､ ∩ イ { { ￣ フフへ ＼＼
( ／ ,/ / i ＞――＜ニニニﾆ┐ 〃／: : ヽ ヽヽ
／ ィT´/ /┌― ￣￣ /::: , ,) 〃／／: : : : : :} ヽヽ)
/ / ∧ヾi┌― { {￣ ﾉ:::トﾟ< ∥//: : : : : : : : i ﾉ ﾉ
. ( 人 {:ヽヾi∨ ∧V /:::/ ､ヽ ∥/: : : : : : : : : :} /
V ( ∧: :＼'∨ ∧V ﾉ:::/ ∧ 〉＿__∥: : : : : :／: : : :ﾚ
/∧: : : : ∨ ∧V┬ｲ:::ﾉ 〈 TT | |{{: : : : ／: : : : : ∧ ﾉ
( ハ: : : : :∨'T∧Vi i ( V ! ! {{: : ／ : : : : : :
/ ｰ ノ V ハ: : : : :∨ﾍ∧V i ゝゝ i／⌒＼{／ : : : : : : : /ｰ― ´
∨ ヽ: : : : :∨ﾍ∧∨i 〉 〉 / /二 ): : : : : : : : :/
(https://seesaawiki.jp/asciiart/d/Charlotte より)
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// #define int ll
// #define DEBUG 42
inline void nprint() {}
template <class Head, class... Tail>
inline void nprint(Head &&head, Tail &&...tail) {
cout << head << endl;
nprint(move(tail)...);
}
#ifdef DEBUG
#define eprint(...) nprint(__VA_ARGS__)
#else
#define eprint(...) \
if (0 == 1) \
cout << 1 << endl;
#endif
#define Yes(a) cout << (a ? "Yes" : "No") << endl
#define YES(a) cout << (a ? "YES" : "NO") << endl
#define POSSIBLE(a) cout << (a ? "POSSIBLE" : "IMPOSSIBLE") << endl
using cmp = complex<double>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> using VV = vector<V<T>>;
#define fi first
#define se second
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORS(i, a, b) FOR(i, a, b + 1)
#define REPS(i, n) REP(i, n + 1)
#define RFOR(i, a, b) for (ll i = (ll)(b)-1; i >= a; --i)
#define RREP(i, n) RFOR(i, 0, n)
#define RREPS(i, n) RREP(i, n + 1)
#define RFORS(i, a, b) RFOR(i, a, b + 1)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define PERM(c) \
sort(ALL(c)); \
for (bool cp = true; cp; cp = next_permutation(ALL(c)))
#define eb(val) emplace_back(val)
const double PI = acos(-1), EPS = 1e-10;
constexpr ll MOD = 1E9 + 7;
constexpr int dx[] = {1, 0, -1, 0};
constexpr int dy[] = {0, 1, 0, -1};
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <class T> istream &operator>>(istream &is, vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T> istream &operator>>(istream &is, vector<vector<T>> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i) {
if (i == st.size() - 1)
os << st[i];
else
os << st[i] << " ";
}
return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<vector<T>> &st) {
for (size_t i = 0; i < st.size(); ++i) {
os << st[i];
if (i != st.size() - 1)
os << endl;
}
return os;
}
template <ll Mod> struct mod_int {
static const ll mod = Mod;
ll val;
mod_int(long long sig = 0) : val(sig % mod) {
sig %= mod;
if (sig < 0)
sig += mod;
}
constexpr mod_int operator-() const { return val ? mod - val : 0; }
constexpr mod_int &operator+=(const mod_int &that) {
if ((val += that.val) >= mod)
val -= mod;
return *this;
}
constexpr mod_int &operator-=(const mod_int &that) {
if ((val += mod - that.val) >= mod)
val -= mod;
return *this;
}
constexpr mod_int &operator*=(const mod_int &that) {
val = (unsigned long long)val * that.val % mod;
return *this;
}
// constexpr mod_int &operator/=(const mod_int &that) { return *this *=
// that.inverse(); }
constexpr mod_int &operator/=(const mod_int &r) noexcept {
long long a = r.val, b = Mod, u = 1, v = 0;
while (b) {
long long 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 mod_int operator+(const mod_int &that) const {
return mod_int(*this) += that;
}
constexpr mod_int operator-(const mod_int &that) const {
return mod_int(*this) -= that;
}
constexpr mod_int operator*(const mod_int &that) const {
return mod_int(*this) *= that;
}
constexpr mod_int operator/(const mod_int &that) const {
return mod_int(*this) /= that;
}
constexpr bool operator==(const mod_int &that) const noexcept {
return this->val == that.val;
}
constexpr bool operator!=(const mod_int &that) const noexcept {
return this->val != that.val;
}
friend constexpr ostream &operator<<(ostream &os, const mod_int &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, mod_int &x) noexcept {
return is >> x.val;
}
friend constexpr mod_int modpow(const mod_int &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = mod_int<MOD>;
struct comb {
V<mint> fact, infact;
comb(int n) : fact(n + 1, 1), infact(n + 1, 1) {
FOR(i, 1, n + 1) {
fact[i] = fact[i - 1] * i;
infact[i] = infact[i - 1] / i;
}
}
mint v(int n, int k) { return fact[n] * infact[n - k] * infact[k]; }
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int x, y;
cin >> x >> y;
int s = x + y;
if (s % 3 != 0) {
cout << 0 << endl;
return 0;
}
int z = s / 3;
x -= z, y -= z;
s = x + y;
comb c(s + 1);
cout << c.v(s, x) << endl;
}
| /*
友利奈緒ぱわーでACしてくれ！！！！！！！！！！！！
Charlotteまだ見てない人は見ような！！！！！！！
／ /:／ ＼:ヽ ＼
/ ／ ＼ ヽ
＼__L 彡 ヽ ',
ﾌ / / / / , ヽ ', ｊ
ﾚ / / / ', ヽ j
// ! /_l＿/__ノ { ＼} ', ',/
i ﾊ { 从j ﾊ i ', ト-､} i i } jj
( ﾊ ( 川 ハ ﾊ ! ' ﾊ ﾊ j j ,' 八
＜＿,ｨ∧ 斗芹ﾃミxハ ﾊ ﾚ } /__ﾚﾚ / ∧ ＼ ﾉ
∨ ＼ ゝ 辷:ソ ) 芹ﾚ心ヾレ′ / ト-- ´
＼ｰ‐' ﾉ ＼ゝ ゞ:_ソ "/ ／ ヽ
フ i八 " " , ム彡 ＼
/ / j ト " "イト＜ ＼＼
/ / j /／ヽ､ ∩ イ { { ￣ フフへ ＼＼
( ／ ,/ / i ＞――＜ニニニﾆ┐ 〃／: : ヽ ヽヽ
／ ィT´/ /┌― ￣￣ /::: , ,) 〃／／: : : : : :} ヽヽ)
/ / ∧ヾi┌― { {￣ ﾉ:::トﾟ< ∥//: : : : : : : : i ﾉ ﾉ
. ( 人 {:ヽヾi∨ ∧V /:::/ ､ヽ ∥/: : : : : : : : : :} /
V ( ∧: :＼'∨ ∧V ﾉ:::/ ∧ 〉＿__∥: : : : : :／: : : :ﾚ
/∧: : : : ∨ ∧V┬ｲ:::ﾉ 〈 TT | |{{: : : : ／: : : : : ∧ ﾉ
( ハ: : : : :∨'T∧Vi i ( V ! ! {{: : ／ : : : : : :
/ ｰ ノ V ハ: : : : :∨ﾍ∧V i ゝゝ i／⌒＼{／ : : : : : : : /ｰ― ´
∨ ヽ: : : : :∨ﾍ∧∨i 〉 〉 / /二 ): : : : : : : : :/
(https://seesaawiki.jp/asciiart/d/Charlotte より)
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// #define int ll
// #define DEBUG 42
inline void nprint() {}
template <class Head, class... Tail>
inline void nprint(Head &&head, Tail &&...tail) {
cout << head << endl;
nprint(move(tail)...);
}
#ifdef DEBUG
#define eprint(...) nprint(__VA_ARGS__)
#else
#define eprint(...) \
if (0 == 1) \
cout << 1 << endl;
#endif
#define Yes(a) cout << (a ? "Yes" : "No") << endl
#define YES(a) cout << (a ? "YES" : "NO") << endl
#define POSSIBLE(a) cout << (a ? "POSSIBLE" : "IMPOSSIBLE") << endl
using cmp = complex<double>;
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
template <class T> using V = vector<T>;
template <class T> using VV = vector<V<T>>;
#define fi first
#define se second
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define FOR(i, a, b) for (ll i = (a); i < (ll)(b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORS(i, a, b) FOR(i, a, b + 1)
#define REPS(i, n) REP(i, n + 1)
#define RFOR(i, a, b) for (ll i = (ll)(b)-1; i >= a; --i)
#define RREP(i, n) RFOR(i, 0, n)
#define RREPS(i, n) RREP(i, n + 1)
#define RFORS(i, a, b) RFOR(i, a, b + 1)
#define ALL(obj) (obj).begin(), (obj).end()
#define RALL(obj) (obj).rbegin(), (obj).rend()
#define PERM(c) \
sort(ALL(c)); \
for (bool cp = true; cp; cp = next_permutation(ALL(c)))
#define eb(val) emplace_back(val)
const double PI = acos(-1), EPS = 1e-10;
constexpr ll MOD = 1E9 + 7;
constexpr int dx[] = {1, 0, -1, 0};
constexpr int dy[] = {0, 1, 0, -1};
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << ", " << p.second << ")";
}
template <class T> istream &operator>>(istream &is, vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T> istream &operator>>(istream &is, vector<vector<T>> &st) {
for (size_t i = 0; i < st.size(); ++i)
is >> st[i];
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &st) {
for (size_t i = 0; i < st.size(); ++i) {
if (i == st.size() - 1)
os << st[i];
else
os << st[i] << " ";
}
return os;
}
template <class T>
ostream &operator<<(ostream &os, const vector<vector<T>> &st) {
for (size_t i = 0; i < st.size(); ++i) {
os << st[i];
if (i != st.size() - 1)
os << endl;
}
return os;
}
template <ll Mod> struct mod_int {
static const ll mod = Mod;
ll val;
mod_int(long long sig = 0) : val(sig % mod) {
sig %= mod;
if (sig < 0)
sig += mod;
}
constexpr mod_int operator-() const { return val ? mod - val : 0; }
constexpr mod_int &operator+=(const mod_int &that) {
if ((val += that.val) >= mod)
val -= mod;
return *this;
}
constexpr mod_int &operator-=(const mod_int &that) {
if ((val += mod - that.val) >= mod)
val -= mod;
return *this;
}
constexpr mod_int &operator*=(const mod_int &that) {
val = (unsigned long long)val * that.val % mod;
return *this;
}
// constexpr mod_int &operator/=(const mod_int &that) { return *this *=
// that.inverse(); }
constexpr mod_int &operator/=(const mod_int &r) noexcept {
long long a = r.val, b = Mod, u = 1, v = 0;
while (b) {
long long 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 mod_int operator+(const mod_int &that) const {
return mod_int(*this) += that;
}
constexpr mod_int operator-(const mod_int &that) const {
return mod_int(*this) -= that;
}
constexpr mod_int operator*(const mod_int &that) const {
return mod_int(*this) *= that;
}
constexpr mod_int operator/(const mod_int &that) const {
return mod_int(*this) /= that;
}
constexpr bool operator==(const mod_int &that) const noexcept {
return this->val == that.val;
}
constexpr bool operator!=(const mod_int &that) const noexcept {
return this->val != that.val;
}
friend constexpr ostream &operator<<(ostream &os, const mod_int &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, mod_int &x) noexcept {
return is >> x.val;
}
friend constexpr mod_int modpow(const mod_int &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = mod_int<MOD>;
struct comb {
V<mint> fact, infact;
comb(int n) : fact(n + 1, 1), infact(n + 1, 1) {
FOR(i, 1, n + 1) {
fact[i] = fact[i - 1] * i;
infact[i] = infact[i - 1] / i;
}
}
mint v(int n, int k) { return fact[n] * infact[n - k] * infact[k]; }
};
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int x, y;
cin >> x >> y;
int s = x + y;
if (s % 3 != 0) {
cout << 0 << endl;
return 0;
}
int z = s / 3;
x -= z, y -= z;
if (x < 0 || y < 0) {
cout << 0 << endl;
return 0;
}
s = x + y;
comb c(s + 1);
cout << c.v(s, x) << endl;
}
| insert | 215 | 215 | 215 | 219 | 0 | |
p02862 | C++ | Runtime Error | /**
* いやなんでこれでサンプルと合わないのか全然分からない
**/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
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(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() {
COMinit();
int X, Y;
cin >> X >> Y;
if (X == Y * 2 || X * 2 == Y) {
cout << 1 << "\n";
return 0;
}
if ((X % 3 == 1 && Y % 3 == 2) || (X % 3 == 2 && Y % 3 == 1) ||
(X % 3 == 0 && Y % 3 == 0)) {
ll A = abs(X - Y);
ll B = (min(X, Y) - A) / 3;
A += B;
cout << COM(A + B, A) << "\n";
return 0;
}
cout << 0 << "\n";
return 0;
}
| /**
* いやなんでこれでサンプルと合わないのか全然分からない
**/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
const int MAX = 910000;
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(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() {
COMinit();
int X, Y;
cin >> X >> Y;
if (X == Y * 2 || X * 2 == Y) {
cout << 1 << "\n";
return 0;
}
if ((X % 3 == 1 && Y % 3 == 2) || (X % 3 == 2 && Y % 3 == 1) ||
(X % 3 == 0 && Y % 3 == 0)) {
ll A = abs(X - Y);
ll B = (min(X, Y) - A) / 3;
A += B;
cout << COM(A + B, A) << "\n";
return 0;
}
cout << 0 << "\n";
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1000000007;
const int mod = 1000000007;
const double PI = 3.14159265358979323846;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
// ll memo[2020][2020];
// int pascal_triangle(){
// for(int i = 0; i < 1000; i++){
// for(int j = 0; j < i+1; j++){
// if(j == 0 || j == i) memo[i][j] = 1;
// else{
// memo[i][j] = (memo[i-1][j-1]+memo[i-1][j])%mod;
// }
// }
// }
// return 0;
// }
// int factorial(int n){
// if(n == 0) return 1;
// return n*factorial(n-1);
// }
// int divisor(int a){
// int cnt = 0;
// for(int i=1; i <= a; i++) if(a%i == 0) cnt++;
// return cnt;
// }
// int comb(int n, int k){
// pascal_triangle();
// return memo[n][k];
// }
// int cans(bool f){
// if(f) cout << "Yes" << endl;
// else cout << "No" << endl;
// return 0;
// }
const int MAX = 3000010;
const int M = 1000000007;
vector<ll> fac(MAX); // n!(mod M)
vector<ll> ifac(MAX); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
ll COMinit() {
// 大した量ではないので，先にfax[i]とifax[i]を全て計算しておく
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < MAX; 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を採用
}
return 0;
}
ll COM(ll a, ll b) { // aCbをmod計算
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
int main() {
COMinit();
ll X, Y, ans = 0;
cin >> X >> Y;
if ((X + Y) % 3 == 0) {
int n = (X + Y) / 3;
ans = COM(X - n + Y - n, X - n);
} else
ans = 0;
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <vector>
// ceil(a/b) (a + (b - 1))/ b
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1000000007;
const int mod = 1000000007;
const double PI = 3.14159265358979323846;
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
int gcd(int a, int b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
// ll memo[2020][2020];
// int pascal_triangle(){
// for(int i = 0; i < 1000; i++){
// for(int j = 0; j < i+1; j++){
// if(j == 0 || j == i) memo[i][j] = 1;
// else{
// memo[i][j] = (memo[i-1][j-1]+memo[i-1][j])%mod;
// }
// }
// }
// return 0;
// }
// int factorial(int n){
// if(n == 0) return 1;
// return n*factorial(n-1);
// }
// int divisor(int a){
// int cnt = 0;
// for(int i=1; i <= a; i++) if(a%i == 0) cnt++;
// return cnt;
// }
// int comb(int n, int k){
// pascal_triangle();
// return memo[n][k];
// }
// int cans(bool f){
// if(f) cout << "Yes" << endl;
// else cout << "No" << endl;
// return 0;
// }
const int MAX = 3000010;
const int M = 1000000007;
vector<ll> fac(MAX); // n!(mod M)
vector<ll> ifac(MAX); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
ll COMinit() {
// 大した量ではないので，先にfax[i]とifax[i]を全て計算しておく
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < MAX; 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を採用
}
return 0;
}
ll COM(ll a, ll b) { // aCbをmod計算
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
int main() {
COMinit();
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;
}
cout << COM(x + y, y) << endl;
return 0;
}
| replace | 110 | 118 | 110 | 125 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
const int INF = 1 << 29;
const int MOD = 1000000007;
long long ruizyou(int m, int n) {
if (m == 0)
return 0;
if (m == 1)
return 1;
long long ans = 1;
long long tmp = m;
for (int i = 0; i <= 30; i++) {
if (n & (1 << i)) {
ans *= tmp;
ans %= MOD;
}
tmp *= tmp;
tmp %= MOD;
}
return ans;
}
long long kaizyou(int x) {
if (x == 1)
return 1;
return x * kaizyou(x - 1) % MOD;
}
long long comb(int x, int y) {
long long bunsi = kaizyou(x);
long long bunbo = kaizyou(x - y) * kaizyou(y) % MOD;
return bunsi * ruizyou((int)bunbo, MOD - 2) % MOD;
}
int main() {
int X, Y;
cin >> X >> Y;
double x, y;
x = (-1 / 3.0) * (X - 2 * Y);
y = (-1 / 3.0) * (-2 * X + Y);
if (abs(x - int(x)) > 0.01 || abs(y - int(y)) > 0.01 || x < 0 || y < 0) {
cout << 0 << endl;
} else {
cout << comb(int(x + y), int(x)) << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
const int INF = 1 << 29;
const int MOD = 1000000007;
long long ruizyou(int m, int n) {
if (m == 0)
return 0;
if (m == 1)
return 1;
long long ans = 1;
long long tmp = m;
for (int i = 0; i <= 30; i++) {
if (n & (1 << i)) {
ans *= tmp;
ans %= MOD;
}
tmp *= tmp;
tmp %= MOD;
}
return ans;
}
long long kaizyou(int x) {
if (x == 0)
return 1;
return x * kaizyou(x - 1) % MOD;
}
long long comb(int x, int y) {
long long bunsi = kaizyou(x);
long long bunbo = kaizyou(x - y) * kaizyou(y) % MOD;
return bunsi * ruizyou((int)bunbo, MOD - 2) % MOD;
}
int main() {
int X, Y;
cin >> X >> Y;
double x, y;
x = (-1 / 3.0) * (X - 2 * Y);
y = (-1 / 3.0) * (-2 * X + Y);
if (abs(x - int(x)) > 0.01 || abs(y - int(y)) > 0.01 || x < 0 || y < 0) {
cout << 0 << endl;
} else {
cout << comb(int(x + y), int(x)) << endl;
}
} | replace | 25 | 26 | 25 | 26 | 0 | |
p02862 | Python | Runtime Error | import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(20000000)
MOD = 10**9 + 7
INF = float("inf")
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9 + 7):
self.mod = mod
self.modinv = self.make_modinv_list(n_max)
self.fac, self.facinv = self.make_factorial_list(n_max)
def __call__(self, n, r):
if n < r:
return 0
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n - r] % self.mod
def make_factorial_list(self, n):
# 階乗のリストと階乗のmod逆元のリストを返す O(n)
# self.make_modinv_list()が先に実行されている必要がある
fac = [1]
facinv = [1]
for i in range(1, n + 1):
fac.append(fac[i - 1] * i % self.mod)
facinv.append(facinv[i - 1] * self.modinv[i] % self.mod)
return fac, facinv
def make_modinv_list(self, n):
# 0からnまでのmod逆元のリストを返す O(n)
modinv = [0] * (n + 1)
modinv[1] = 1
for i in range(2, n + 1):
modinv[i] = self.mod - self.mod // i * modinv[self.mod % i] % self.mod
return modinv
def main():
X, Y = map(int, input().split())
if (X + Y) % 3 != 0:
print(0)
return
a = (X + Y) // 3
two = X - a
if two < 0:
print(0)
cmb = Combination(a + 1)
print(cmb(a, two))
if __name__ == "__main__":
main()
| import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(20000000)
MOD = 10**9 + 7
INF = float("inf")
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9 + 7):
self.mod = mod
self.modinv = self.make_modinv_list(n_max)
self.fac, self.facinv = self.make_factorial_list(n_max)
def __call__(self, n, r):
if n < r:
return 0
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n - r] % self.mod
def make_factorial_list(self, n):
# 階乗のリストと階乗のmod逆元のリストを返す O(n)
# self.make_modinv_list()が先に実行されている必要がある
fac = [1]
facinv = [1]
for i in range(1, n + 1):
fac.append(fac[i - 1] * i % self.mod)
facinv.append(facinv[i - 1] * self.modinv[i] % self.mod)
return fac, facinv
def make_modinv_list(self, n):
# 0からnまでのmod逆元のリストを返す O(n)
modinv = [0] * (n + 1)
modinv[1] = 1
for i in range(2, n + 1):
modinv[i] = self.mod - self.mod // i * modinv[self.mod % i] % self.mod
return modinv
def main():
X, Y = map(int, input().split())
if (X + Y) % 3 != 0:
print(0)
return
a = (X + Y) // 3
two = X - a
if two < 0:
print(0)
return
if two == 0:
print(1)
return
cmb = Combination(a + 1)
print(cmb(a, two))
if __name__ == "__main__":
main()
| insert | 60 | 60 | 60 | 64 | 0 | |
p02862 | Python | Runtime Error | from sys import stdin, setrecursionlimit
setrecursionlimit(10**9)
INF = 1 << 60
def input():
return stdin.readline().strip()
MOD = 1000000007
X, Y = map(int, input().split())
n = (X + Y) // 3
x = (2 * X - Y) // 3
y = (-X + 2 * Y) // 3
if (X + Y) % 3 or x < 0 or y < 0:
print(0)
exit()
def mod_com(n, k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
if k > n - k:
k = n - k
ans = 1
for i in range(n - k + 1, n + 1):
ans = ans * i % MOD
inv = [0] * (k + 1)
inv[1] = 1
for i in range(2, k + 1):
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
ans = ans * inv[i] % MOD
return ans
print(mod_com(n, x))
| from sys import stdin, setrecursionlimit
setrecursionlimit(10**9)
INF = 1 << 60
def input():
return stdin.readline().strip()
MOD = 1000000007
X, Y = map(int, input().split())
n = (X + Y) // 3
x = (2 * X - Y) // 3
y = (-X + 2 * Y) // 3
if (X + Y) % 3 or x < 0 or y < 0:
print(0)
exit()
def mod_com(n, k):
if n < k:
return 0
if n < 0 or k < 0:
return 0
if k > n - k:
k = n - k
if k == 0:
return 1
ans = 1
for i in range(n - k + 1, n + 1):
ans = ans * i % MOD
inv = [0] * (k + 1)
inv[1] = 1
for i in range(2, k + 1):
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
ans = ans * inv[i] % MOD
return ans
print(mod_com(n, x))
| insert | 28 | 28 | 28 | 30 | 0 | |
p02862 | Python | Runtime Error | MOD = 10**9 + 7
def prepare(n):
global MOD
modFacts = [0] * (n + 1)
modFacts[0] = 1
for i in range(n):
modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD
invs = [1] * (n + 1)
invs[n] = pow(modFacts[n], MOD - 2, MOD)
for i in range(n, 1, -1):
invs[i - 1] = (invs[i] * i) % MOD
return modFacts, invs
X, Y = map(int, input().split())
if (X + Y) % 3 == 0:
p = (2 * Y - X) // 3
q = (2 * X - Y) // 3
n = p + q
r = min(p, q)
modFacts, invs = prepare(n)
ans = (modFacts[n] * invs[n - r] * invs[r]) % MOD
else:
ans = 0
print(ans)
| MOD = 10**9 + 7
def prepare(n):
global MOD
modFacts = [0] * (n + 1)
modFacts[0] = 1
for i in range(n):
modFacts[i + 1] = (modFacts[i] * (i + 1)) % MOD
invs = [1] * (n + 1)
invs[n] = pow(modFacts[n], MOD - 2, MOD)
for i in range(n, 1, -1):
invs[i - 1] = (invs[i] * i) % MOD
return modFacts, invs
X, Y = map(int, input().split())
if (X + Y) % 3 == 0 and 2 * Y - X >= 0 and 2 * X - Y >= 0:
p = (2 * Y - X) // 3
q = (2 * X - Y) // 3
n = p + q
r = min(p, q)
modFacts, invs = prepare(n)
ans = (modFacts[n] * invs[n - r] * invs[r]) % MOD
else:
ans = 0
print(ans)
| replace | 19 | 20 | 19 | 20 | 0 | |
p02862 | Python | Runtime Error | import sys
X, Y = map(int, input().split())
# 直交座標に直す
if (2 * X - Y) % 3 != 0 or (2 * Y - X) % 3 != 0:
print(0)
sys.exit()
x, y = (2 * X - Y) // 3, (2 * Y - X) // 3
def comb_inv(n, k, mod):
f = [1 for _ in range(n + 1)]
inv = [1 for _ in range(n + 1)]
finv = [1 for _ in range(n + 1)]
for i in range(2, n + 1):
f[i] = f[i - 1] * i % mod
inv[i] = mod - inv[mod % i] * (mod // i) % mod
finv[i] = finv[i - 1] * inv[i] % mod
return f[n] * (finv[k] * finv[n - k] % mod) % mod
print(comb_inv(x + y, x, 10**9 + 7))
| import sys
X, Y = map(int, input().split())
# 直交座標に直す
if X > 2 * Y or Y > 2 * X or (2 * X - Y) % 3 != 0 or (2 * Y - X) % 3 != 0:
print(0)
sys.exit()
x, y = (2 * X - Y) // 3, (2 * Y - X) // 3
def comb_inv(n, k, mod):
f = [1 for _ in range(n + 1)]
inv = [1 for _ in range(n + 1)]
finv = [1 for _ in range(n + 1)]
for i in range(2, n + 1):
f[i] = f[i - 1] * i % mod
inv[i] = mod - inv[mod % i] * (mod // i) % mod
finv[i] = finv[i - 1] * inv[i] % mod
return f[n] * (finv[k] * finv[n - k] % mod) % mod
print(comb_inv(x + y, x, 10**9 + 7))
| replace | 5 | 6 | 5 | 6 | 0 | |
p02862 | Python | Runtime Error | from functools import reduce
def modcombination(n, k, mod):
# nCk % mod
num = reduce(lambda x, y: x * y % mod, range(n, n - k, -1))
den = reduce(lambda x, y: x * y % mod, range(1, k + 1))
return num * pow(den, mod - 2, mod) % mod
if __name__ == "__main__":
MOD = 10**9 + 7
x, y = map(int, input().split())
if (x + y) % 3 != 0:
print(0)
exit(0)
m = (2 * x - y) // 3
n = x - (2 * m)
if n < 0 or m < 0:
print(0)
exit(0)
print(modcombination(n + m, n, MOD) % MOD)
| from functools import reduce
def modcombination(n, k, mod):
# nCk % mod
num = reduce(lambda x, y: x * y % mod, range(n, n - k, -1))
den = reduce(lambda x, y: x * y % mod, range(1, k + 1))
return num * pow(den, mod - 2, mod) % mod
if __name__ == "__main__":
MOD = 10**9 + 7
x, y = map(int, input().split())
if (x + y) % 3 != 0:
print(0)
exit(0)
m = (2 * x - y) // 3
n = x - (2 * m)
if n < 0 or m < 0:
print(0)
exit(0)
if n == 0 or m == 0:
print(1)
exit(0)
print(modcombination(n + m, n, MOD) % MOD)
| insert | 22 | 22 | 22 | 25 | 0 | |
p02862 | Python | Runtime Error | #!/usr/bin/python3
import os
import sys
def main():
X, Y = read_ints()
print(solve(X, Y))
MOD = 10**9 + 7
def mpow(a, n):
p = a
v = 1
while n > 0:
if n & 1:
v *= p
v %= MOD
n >>= 1
p *= p
p %= MOD
return v
def solve(X, Y):
s = X + Y
if s % 3 != 0:
return 0
s //= 3
a = 2 * s - X
b = 2 * s - Y
c = a + b
facts = [0] * (c + 1)
facts[0] = 1
for i in range(1, c + 1):
facts[i] = (facts[i - 1] * i) % MOD
return (facts[c] * mpow(facts[a], MOD - 2) * mpow(facts[b], MOD - 2)) % MOD
###############################################################################
DEBUG = "DEBUG" in os.environ
def inp():
return sys.stdin.readline().rstrip()
def read_int():
return int(inp())
def read_ints():
return [int(e) for e in inp().split()]
def dprint(*value, sep=" ", end="\n"):
if DEBUG:
print(*value, sep=sep, end=end)
if __name__ == "__main__":
main()
| #!/usr/bin/python3
import os
import sys
def main():
X, Y = read_ints()
print(solve(X, Y))
MOD = 10**9 + 7
def mpow(a, n):
p = a
v = 1
while n > 0:
if n & 1:
v *= p
v %= MOD
n >>= 1
p *= p
p %= MOD
return v
def solve(X, Y):
s = X + Y
if s % 3 != 0:
return 0
s //= 3
a = 2 * s - X
b = 2 * s - Y
if a < 0 or b < 0:
return 0
c = a + b
facts = [0] * (c + 1)
facts[0] = 1
for i in range(1, c + 1):
facts[i] = (facts[i - 1] * i) % MOD
return (facts[c] * mpow(facts[a], MOD - 2) * mpow(facts[b], MOD - 2)) % MOD
###############################################################################
DEBUG = "DEBUG" in os.environ
def inp():
return sys.stdin.readline().rstrip()
def read_int():
return int(inp())
def read_ints():
return [int(e) for e in inp().split()]
def dprint(*value, sep=" ", end="\n"):
if DEBUG:
print(*value, sep=sep, end=end)
if __name__ == "__main__":
main()
| insert | 35 | 35 | 35 | 38 | 0 | |
p02862 | Python | Time Limit Exceeded | LARGE = 10**9 + 7
def solve(x, y):
if (x + y) % 3 != 0:
return 0
z = (x + y) // 3
if x < z or y < z:
return 0
# zC(x-z)
r = min(x - z, y - z)
res = 1
for i in range(r):
res *= z - i
res *= pow(i + 1, LARGE - 2, LARGE)
res %= LARGE
return res
def main():
x, y = map(int, input().split())
res = solve(x, y)
print(res)
def test():
assert solve(3, 3) == 2
assert solve(2, 2) == 0
assert solve(999999, 999999) == 151840682
if __name__ == "__main__":
test()
main()
| LARGE = 10**9 + 7
def solve(x, y):
if (x + y) % 3 != 0:
return 0
z = (x + y) // 3
if x < z or y < z:
return 0
# zC(x-z)
r = min(x - z, y - z)
res = 1
for i in range(r):
res *= z - i
res *= pow(i + 1, LARGE - 2, LARGE)
res %= LARGE
return res
def main():
x, y = map(int, input().split())
res = solve(x, y)
print(res)
def test():
assert solve(3, 3) == 2
assert solve(2, 2) == 0
assert solve(999999, 999999) == 151840682
if __name__ == "__main__":
# test()
main()
| replace | 32 | 33 | 32 | 33 | TLE | |
p02862 | Python | Runtime Error | import sys
input = sys.stdin.readline
_x, _y = map(int, input().split())
def combination(n, r, mod=10**9 + 7):
n1, r = n + 1, min(r, n - r)
numer = denom = 1
for i in range(1, r + 1):
numer = numer * (n1 - i) % mod
denom = denom * i % mod
return numer * pow(denom, mod - 2, mod) % mod
X, Y = map(int, input().split())
if (X + Y) % 3 != 0 or not (X <= 2 * Y and Y <= 2 * X):
print(0)
exit()
n = (X + Y) // 3
r = Y - n
print(combination(n, r))
def nCk(n, k, m=10**9 + 7):
a = b = 1
k = min(k, n - k)
for i in range(k):
a = (a * (n - i)) % m
b = (b * (i + 1)) % m
return (a * pow(b, m - 2, m)) % m
def chker(x, y):
if (x + y) % 3 != 0 or x > 2 * y or y > 2 * x:
print(0)
return
if x == y:
b = x // 3
print(nCk(2 * b, b))
return
x, y = (x, y) if x < y else (y, x)
b = 2 * x - y
if b % 3 != 0:
print(0)
return
d1, d2 = b // 3, x - 2 * (b // 3)
u = d1 + d2
print(nCk(u, d1))
chker(_x, _y)
| import sys
input = sys.stdin.readline
_x, _y = map(int, input().split())
def nCk(n, k, m=10**9 + 7):
a = b = 1
k = min(k, n - k)
for i in range(k):
a = (a * (n - i)) % m
b = (b * (i + 1)) % m
return (a * pow(b, m - 2, m)) % m
def chker(x, y):
if (x + y) % 3 != 0 or x > 2 * y or y > 2 * x:
print(0)
return
if x == y:
b = x // 3
print(nCk(2 * b, b))
return
x, y = (x, y) if x < y else (y, x)
b = 2 * x - y
if b % 3 != 0:
print(0)
return
d1, d2 = b // 3, x - 2 * (b // 3)
u = d1 + d2
print(nCk(u, d1))
chker(_x, _y)
| delete | 5 | 24 | 5 | 5 | ValueError: not enough values to unpack (expected 2, got 0) | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02862/Python/s588059150.py", line 16, in <module>
X, Y = map(int, input().split())
ValueError: not enough values to unpack (expected 2, got 0)
|
p02862 | C++ | Runtime Error | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll nck(ll n, ll k) {
ll p = 1000000007;
ll p2;
p2 = p - 2;
vector<int> r(35);
vector<ll> r2(35);
rep(j, 35) { r[j] = (p2 >> j) & 1; }
ll ans;
ans = 1;
if (k != 0) {
rep(i, k - 1) {
r2[0] = i + 2;
rep(j, 35) {
r2[j + 1] = (r2[j] * r2[j]) % p;
if (r[j] == 1) {
ans *= r2[j];
ans = ans % p;
}
}
}
rep(i, k) {
ans *= n - i;
ans = ans % p;
}
}
return ans;
}
int main() {
ll x, y, a, b;
cin >> x >> y;
int k;
k = 0;
if ((2 * y - x) % 3 != 0 or (2 * x - y) % 3 != 0) {
k = 1;
}
ll m;
a = 2 * y - x;
b = 2 * x - y;
if (a < 0 or b < 0) {
k = 2;
}
a /= 3;
b /= 3;
m = min(a, b);
ll ans;
if (k == 0) {
ans = nck(a + b, m);
}
if (k == 1 or k == 2) {
cout << 0 << endl;
} else {
cout << ans << endl;
}
return 0;
} | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll nck(ll n, ll k) {
ll p = 1000000007;
ll p2;
p2 = p - 2;
vector<int> r(35);
vector<ll> r2(36);
rep(j, 35) { r[j] = (p2 >> j) & 1; }
ll ans;
ans = 1;
if (k != 0) {
rep(i, k - 1) {
r2[0] = i + 2;
rep(j, 35) {
r2[j + 1] = (r2[j] * r2[j]) % p;
if (r[j] == 1) {
ans *= r2[j];
ans = ans % p;
}
}
}
rep(i, k) {
ans *= n - i;
ans = ans % p;
}
}
return ans;
}
int main() {
ll x, y, a, b;
cin >> x >> y;
int k;
k = 0;
if ((2 * y - x) % 3 != 0 or (2 * x - y) % 3 != 0) {
k = 1;
}
ll m;
a = 2 * y - x;
b = 2 * x - y;
if (a < 0 or b < 0) {
k = 2;
}
a /= 3;
b /= 3;
m = min(a, b);
ll ans;
if (k == 0) {
ans = nck(a + b, m);
}
if (k == 1 or k == 2) {
cout << 0 << endl;
} else {
cout << ans << endl;
}
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
ll X, Y;
const ll M = 1e9 + 7;
vector<ll> fac(1000001); // n!(mod M)
vector<ll> ifac(1000001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) { // aCbをmod計算
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
int main() {
cin >> X >> Y;
ll k, n;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
} else {
n = (X + Y) / 3;
k = X - n;
}
if (n < k || n < 0) {
cout << 0 << endl;
return 0;
}
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i <= 1000000; 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を採用
}
// cout << n <<" " << k << endl;
ll ans = comb(n, k) % M;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using ll = long long;
using namespace std;
ll mod = 1e9 + 7;
ll X, Y;
const ll M = 1e9 + 7;
vector<ll> fac(1000001); // n!(mod M)
vector<ll> ifac(1000001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) { // aCbをmod計算
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
int main() {
cin >> X >> Y;
ll k, n;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
} else {
n = (X + Y) / 3;
k = X - n;
}
if (n < k || k < 0) {
cout << 0 << endl;
return 0;
}
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i <= 1000000; 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を採用
}
// cout << n <<" " << k << endl;
ll ans = comb(n, k) % M;
cout << ans << endl;
return 0;
}
| replace | 43 | 44 | 43 | 44 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define Hello \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\n'
#define ll long long
const int mod = 1e9 + 7, N = 2e6 + 5;
int x, y;
ll fact[N], inv[N];
ll fp(ll base, ll exp) {
if (exp == 0)
return 1;
ll ans = fp(base, exp / 2);
if (exp % 2 == 0)
return (ans * ans) % mod;
else
return (((ans * ans) % mod) * base) % mod;
}
void calcFacAndInv() {
fact[0] = inv[0] = 1;
for (ll i = 1; i <= N; i++) {
fact[i] = (i * fact[i - 1]) % mod;
inv[i] = fp(fact[i], mod - 2);
}
}
ll ncr(ll n, ll r) { return ((fact[n] * inv[r]) % mod * inv[n - r]) % mod; }
int main() {
Hello calcFacAndInv();
cin >> x >> y;
if ((x + y) % 3 || (2 * x - y) < 0)
cout << 0;
else
cout << ncr((x + y) / 3, (2 * x - y) / 3);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define Hello \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl '\n'
#define ll long long
const int mod = 1e9 + 7, N = 2e6 + 5;
int x, y;
ll fact[N], inv[N];
ll fp(ll base, ll exp) {
if (exp == 0)
return 1;
ll ans = fp(base, exp / 2);
if (exp % 2 == 0)
return (ans * ans) % mod;
else
return (((ans * ans) % mod) * base) % mod;
}
void calcFacAndInv() {
fact[0] = inv[0] = 1;
for (ll i = 1; i <= N; i++) {
fact[i] = (i * fact[i - 1]) % mod;
inv[i] = fp(fact[i], mod - 2);
}
}
ll ncr(ll n, ll r) {
if (n - r < 0) {
cout << 0;
exit(0);
}
return ((fact[n] * inv[r]) % mod * inv[n - r]) % mod;
}
int main() {
Hello calcFacAndInv();
cin >> x >> y;
if ((x + y) % 3 || (2 * x - y) < 0)
cout << 0;
else
cout << ncr((x + y) / 3, (2 * x - y) / 3);
return 0;
}
| replace | 27 | 29 | 27 | 34 | 0 | |
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;
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 a, b;
ll ans = 0;
COMinit();
if ((2 * y - x) % 3 == 0 && (2 * x - y) % 3 == 0) {
a = (2 * y - x) / 3;
b = (2 * x - y) / 3;
cout << COM(a + b, a) << endl;
} else
cout << 0 << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef long long ll;
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() {
int x, y;
cin >> x >> y;
int a, b;
ll ans = 0;
COMinit();
if ((2 * y - x) % 3 == 0 && (2 * x - y) % 3 == 0) {
a = (2 * y - x) / 3;
b = (2 * x - y) / 3;
cout << COM(a + b, a) << endl;
} else
cout << 0 << endl;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int64_t, int64_t> pll;
typedef vector<int64_t> vl;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
const long double PI = acos(-1);
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int64_t i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define sz(s) (s).size()
#define ALL(a) begin(a), end(a)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int MAX = 1010000;
ll fact[MAX], fact_inv[MAX];
ll power(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
void init(int n) {
fact[0] = 1;
for (int i = 0; i < n; i++)
fact[i + 1] = fact[i] * (i + 1) % mod;
fact_inv[n] = power(fact[n], mod - 2);
for (int i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % mod;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % mod * fact_inv[n - r] % mod;
}
void solve() {
init(1010000);
int x, y;
cin >> x >> y;
if ((x + y) % 3) {
cout << 0 << endl;
return;
}
int m = (2 * x - y) / 3, n = (2 * y - x) / 3;
cout << comb(n + m, n) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<int64_t, int64_t> pll;
typedef vector<int64_t> vl;
int dx[] = {1, -1, 0, 0, 1, -1, 1, -1};
int dy[] = {0, 0, 1, -1, 1, -1, -1, 1};
const long double PI = acos(-1);
#define INF (2147483647)
#define mod (1000000007)
#define limit (7368791)
#define rep(i, a, b) for (int64_t i = (a); i < (b); i++)
#define REP(i, n) rep(i, 0, n)
#define sz(s) (s).size()
#define ALL(a) begin(a), end(a)
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
const int MAX = 1010000;
ll fact[MAX], fact_inv[MAX];
ll power(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
void init(int n) {
fact[0] = 1;
for (int i = 0; i < n; i++)
fact[i + 1] = fact[i] * (i + 1) % mod;
fact_inv[n] = power(fact[n], mod - 2);
for (int i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % mod;
}
ll comb(ll n, ll r) {
return (fact[n] * fact_inv[r]) % mod * fact_inv[n - r] % mod;
}
void solve() {
init(1010000);
int x, y;
cin >> x >> y;
if ((x + y) % 3) {
cout << 0 << endl;
return;
}
int m = (2 * x - y) / 3, n = (2 * y - x) / 3;
if (n < 0 || m < 0) {
cout << 0 << endl;
return;
}
cout << comb(n + m, n) << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
solve();
return 0;
}
| insert | 58 | 58 | 58 | 62 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
#define int long long
const int mod = (int)1e9 + 7;
const int N = 1000005;
int fac[N];
int inv[N];
inline void add(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
}
int mul(int a, int b) { return (1ll * a * b) % mod; }
int fp(int a, int b) {
int ans = 1;
while (b > 0) {
if (b & 1) {
ans = mul(ans, a);
}
b >>= 1;
a = mul(a, a);
}
return ans;
}
int inver(int x) { return fp(x, mod - 2); }
int comb(int n, int k) {
int ans = (1ll * fac[n] * inv[k]) % mod;
ans = (1ll * ans * inv[n - k]) % mod;
return ans;
}
int32_t main() {
int x, y;
cin >> x >> y;
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = (1ll * i * fac[i - 1]) % mod;
for (int i = 0; i < N; i++)
inv[i] = inver(fac[i]);
int ans = 0;
for (int i = 0; i <= x; i++) {
if (2 * i > y)
break;
int aa = x - i, bb = y - 2 * i;
if (aa % 2 != 0 || aa / bb != 2 || aa % bb != 0)
continue;
add(ans, comb(bb + i, bb));
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <vector>
using namespace std;
#define int long long
const int mod = (int)1e9 + 7;
const int N = 1000005;
int fac[N];
int inv[N];
inline void add(int &a, int b) {
a += b;
if (a >= mod)
a -= mod;
}
int mul(int a, int b) { return (1ll * a * b) % mod; }
int fp(int a, int b) {
int ans = 1;
while (b > 0) {
if (b & 1) {
ans = mul(ans, a);
}
b >>= 1;
a = mul(a, a);
}
return ans;
}
int inver(int x) { return fp(x, mod - 2); }
int comb(int n, int k) {
int ans = (1ll * fac[n] * inv[k]) % mod;
ans = (1ll * ans * inv[n - k]) % mod;
return ans;
}
int32_t main() {
int x, y;
cin >> x >> y;
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = (1ll * i * fac[i - 1]) % mod;
for (int i = 0; i < N; i++)
inv[i] = inver(fac[i]);
int ans = 0;
for (int i = 0; i <= x; i++) {
if (2 * i > y)
break;
int aa = x - i, bb = y - 2 * i;
if (bb == 0) {
if (aa == 0)
add(ans, 1);
continue;
}
if (aa % 2 != 0 || aa / bb != 2 || aa % bb != 0)
continue;
add(ans, comb(bb + i, bb));
}
cout << ans << endl;
return 0;
}
| insert | 70 | 70 | 70 | 75 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ft first
#define sd second
#define pb push_back
using namespace std;
const ll mod = 1e9 + 7;
ll power(ll a, ll b, ll m = mod) {
ll x = 1;
while (b) {
if (b & 1) {
x = 1ll * x * a % m;
}
a = 1ll * a * a % m;
b /= 2;
}
return x;
}
const int N = 2e6 + 9;
// int a[N];
ll f[N], invf[N];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
f[0] = invf[0] = 1;
for (int i = 1; i < N - 4; i++) {
f[i] = f[i - 1] * i % mod;
invf[i] = power(f[i], mod - 2);
}
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
return cout << "0\n", 0;
}
int n = (x + y) / 3;
int a = x - n, b = y - n;
// a = 5; b = 0;
int ans = 0;
if (a == 0 || b == 0) {
ans = 1;
} else if (a < 0 && b < 0) {
ans = 0;
} else {
ans = f[a + b] * invf[a] % mod * invf[b] % mod;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define ft first
#define sd second
#define pb push_back
using namespace std;
const ll mod = 1e9 + 7;
ll power(ll a, ll b, ll m = mod) {
ll x = 1;
while (b) {
if (b & 1) {
x = 1ll * x * a % m;
}
a = 1ll * a * a % m;
b /= 2;
}
return x;
}
const int N = 2e6 + 9;
// int a[N];
ll f[N], invf[N];
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
f[0] = invf[0] = 1;
for (int i = 1; i < N - 4; i++) {
f[i] = f[i - 1] * i % mod;
invf[i] = power(f[i], mod - 2);
}
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
return cout << "0\n", 0;
}
int n = (x + y) / 3;
int a = x - n, b = y - n;
// a = 5; b = 0;
int ans = 0;
if (a == 0 || b == 0) {
ans = 1;
} else if (a < 0 || b < 0) {
ans = 0;
} else {
ans = f[a + b] * invf[a] % mod * invf[b] % mod;
}
cout << ans << endl;
return 0;
}
| replace | 46 | 47 | 46 | 47 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(obj) obj.begin(), obj.end()
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 int iINF = 1e9;
const long long llINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;
const int MAX = 1000000;
vector<long long> fac(MAX + 1), inverseFac(MAX + 1);
long long modPow(long long x, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return res;
}
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 = inverseFac[a - b] * inverseFac[b] % MOD;
return tmp * fac[a] % MOD;
}
long long perm(long long a, long long b) {
if (a < b)
return 0;
long long tmp = inverseFac[a - b] % MOD;
return tmp * fac[a] % MOD;
}
long long dupc(long long a, long long b) {
if (a == 0 && b == 0)
return 1;
if (a < 0 || b == 0)
return 0;
long long tmp = inverseFac[a - 1] * inverseFac[b] % MOD;
return tmp * fac[a + b - 1] % MOD;
}
void init() {
fac[0] = 1;
inverseFac[0] = 1;
for (long long i = 0; i < MAX; i++) {
fac[i + 1] = fac[i] * (i + 1) % MOD;
inverseFac[i + 1] = inverseFac[i] * modPow(i + 1, MOD - 2) % MOD;
}
}
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long 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 {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long 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;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
int main() {
long long X, Y;
cin >> X >> Y;
if ((2 * X - Y) % 3 != 0) {
cout << 0 << endl;
} else {
init();
long long y = (2 * X - Y) / 3;
long long x = X - 2 * y;
mint ans = comb(x + y, x);
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define ALL(obj) obj.begin(), obj.end()
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 int iINF = 1e9;
const long long llINF = 1e18;
const int MOD = 1e9 + 7;
using namespace std;
const int MAX = 1000000;
vector<long long> fac(MAX + 1), inverseFac(MAX + 1);
long long modPow(long long x, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * x % MOD;
x = x * x % MOD;
n >>= 1;
}
return res;
}
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 = inverseFac[a - b] * inverseFac[b] % MOD;
return tmp * fac[a] % MOD;
}
long long perm(long long a, long long b) {
if (a < b)
return 0;
long long tmp = inverseFac[a - b] % MOD;
return tmp * fac[a] % MOD;
}
long long dupc(long long a, long long b) {
if (a == 0 && b == 0)
return 1;
if (a < 0 || b == 0)
return 0;
long long tmp = inverseFac[a - 1] * inverseFac[b] % MOD;
return tmp * fac[a + b - 1] % MOD;
}
void init() {
fac[0] = 1;
inverseFac[0] = 1;
for (long long i = 0; i < MAX; i++) {
fac[i + 1] = fac[i] * (i + 1) % MOD;
inverseFac[i + 1] = inverseFac[i] * modPow(i + 1, MOD - 2) % MOD;
}
}
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long 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 {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long 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;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
int main() {
long long X, Y;
cin >> X >> Y;
if ((2 * X - Y) % 3 != 0) {
cout << 0 << endl;
} else {
init();
long long y = (2 * X - Y) / 3;
long long x = X - 2 * y;
if (x < 0 || y < 0) {
cout << 0 << endl;
return 0;
}
mint ans = comb(x + y, x);
cout << ans << endl;
}
return 0;
} | insert | 149 | 149 | 149 | 155 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long md = 1e9 + 7; // mod
const int maxn = 1001000;
long long fac[maxn], inv[maxn];
// cal x^y in logy order
long long powd(long long x, long long y) {
long long res = 1;
while (y) {
if (y & 1)
res = res * x % md;
x = x * x % md;
y >>= 1;
}
return res;
}
// calc n! by fermat's little theory
void csh() {
fac[0] = 1;
for (int i = 1; i <= 1000000; i++)
fac[i] = fac[i - 1] * i % md;
inv[1000000] = powd(fac[1000000], md - 2);
for (int i = 1000000; i >= 1; i--)
inv[i - 1] = inv[i] * i % md;
}
// calc combination in xlonx
long long C(int x, int y) { return fac[x] * inv[y] % md * inv[x - y] % md; }
int main() {
csh();
int X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
} else {
cout << C((X + Y) / 3, (2 * Y - X) / 3) << endl;
}
}
| #include <bits/stdc++.h>
using namespace std;
const long long md = 1e9 + 7; // mod
const int maxn = 1001000;
long long fac[maxn], inv[maxn];
// cal x^y in logy order
long long powd(long long x, long long y) {
long long res = 1;
while (y) {
if (y & 1)
res = res * x % md;
x = x * x % md;
y >>= 1;
}
return res;
}
// calc n! by fermat's little theory
void csh() {
fac[0] = 1;
for (int i = 1; i <= 1000000; i++)
fac[i] = fac[i - 1] * i % md;
inv[1000000] = powd(fac[1000000], md - 2);
for (int i = 1000000; i >= 1; i--)
inv[i - 1] = inv[i] * i % md;
}
// calc combination in xlonx
long long C(int x, int y) { return fac[x] * inv[y] % md * inv[x - y] % md; }
int main() {
csh();
int X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0 || 2 * Y - X < 0 || 2 * X - Y < 0) {
cout << 0 << endl;
} else {
cout << C((X + Y) / 3, (2 * Y - X) / 3) << endl;
}
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define ll long long
#define INF 1000000007
ll f[1000001];
ll pow(ll a, ll b, ll MOD) {
ll x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y);
if (x > MOD)
x %= MOD;
}
y = (y * y);
if (y > MOD)
y %= MOD;
b /= 2;
}
return x;
}
ll InverseEuler(ll n, ll MOD) { return pow(n, MOD - 2, MOD); }
ll C(ll n, ll r, ll MOD) {
return (f[n] *
((InverseEuler(f[r], MOD) * InverseEuler(f[n - r], MOD)) % MOD)) %
MOD;
}
int main() {
f[0] = 1;
for (int i = 1; i <= 1000000; i++)
f[i] = (f[i - 1] * i) % INF;
ll x, y;
cin >> x >> y;
ll a = (x + y) / 3;
ll b = 2 * a - x;
if ((x + y) % 3 || b > a) {
cout << 0;
return 0;
}
cout << C(a, b, INF);
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = a; i <= b; i++)
#define ll long long
#define INF 1000000007
ll f[1000001];
ll pow(ll a, ll b, ll MOD) {
ll x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y);
if (x > MOD)
x %= MOD;
}
y = (y * y);
if (y > MOD)
y %= MOD;
b /= 2;
}
return x;
}
ll InverseEuler(ll n, ll MOD) { return pow(n, MOD - 2, MOD); }
ll C(ll n, ll r, ll MOD) {
return (f[n] *
((InverseEuler(f[r], MOD) * InverseEuler(f[n - r], MOD)) % MOD)) %
MOD;
}
int main() {
f[0] = 1;
for (int i = 1; i <= 1000000; i++)
f[i] = (f[i - 1] * i) % INF;
ll x, y;
cin >> x >> y;
ll a = (x + y) / 3;
ll b = 2 * a - x;
if ((x + y) % 3 || b > a || b < 0) {
cout << 0;
return 0;
}
cout << C(a, b, INF);
}
| replace | 41 | 42 | 41 | 42 | 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>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define Max 10000000
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() {
ios::sync_with_stdio(false);
cin.tie(0);
fact[0] = 1;
for (ll i = 0; i < Max - 1; i++)
fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[Max - 1] = power(fact[Max - 1], MOD - 2);
for (ll i = Max - 2; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
ll X, Y;
cin >> X >> Y;
ll D = X + Y;
if (D % 3) {
cout << 0 << endl;
return 0;
}
D /= 3;
ll DD = abs(X - Y);
ll n = (D + 1) / 2 + DD;
cout << comb(D, n) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;
#define INF LONG_MAX
#define MOD 1000000007
#define rng(a) a.begin(), a.end()
#define rrng(a) a.end(), a.begin()
#define Max 10000000
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() {
ios::sync_with_stdio(false);
cin.tie(0);
fact[0] = 1;
for (ll i = 0; i < Max - 1; i++)
fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[Max - 1] = power(fact[Max - 1], MOD - 2);
for (ll i = Max - 2; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
ll X, Y;
cin >> X >> Y;
ll D = X + Y;
if (D % 3) {
cout << 0 << endl;
return 0;
}
D /= 3;
ll DD = abs(X - Y);
ll n = (D + 1 - DD) / 2 + DD;
if (n < 0 || n > D) {
cout << 0 << endl;
return 0;
}
cout << comb(D, n) << endl;
return 0;
}
| replace | 50 | 51 | 50 | 55 | -11 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <set>
#include <unordered_set>
#include <vector>
using namespace std;
#define sqr(a) ((a) * (a))
#define all(a) (a).begin(), (a).end()
const int MOD = (int)1e9 + 7;
long long fact[(int)2e6 + 5];
long long ob[(int)2e6 + 5];
long long bin_pow(long long a, long long b) {
if (b == 0)
return 1;
long long ans = bin_pow(a, b / 2);
ans = ans * ans % MOD;
if (b % 2)
ans = ans * a % MOD;
return ans;
}
long long C(int n, int k) {
// cout << n << " " << k << "\n";
// cout << fact[n] << " " << ob[k] << " " << ob[n - k] << "\n";
return fact[n] * ob[k] % MOD * ob[n - k] % MOD;
}
int main() {
// freopen("input.txt", "r", stdin);
ios_base::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
ob[0] = 1;
for (int i = 1; i <= (int)2e6; ++i) {
(fact[i] = fact[i - 1] * i) %= MOD;
ob[i] = bin_pow(fact[i], MOD - 2);
}
long long x, y;
cin >> x >> y;
if ((x + y) % 3) {
cout << "0\n";
return 0;
}
cout << C((x + y) / 3, x - ((x + y) / 3)) << "\n";
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory.h>
#include <set>
#include <unordered_set>
#include <vector>
using namespace std;
#define sqr(a) ((a) * (a))
#define all(a) (a).begin(), (a).end()
const int MOD = (int)1e9 + 7;
long long fact[(int)2e6 + 5];
long long ob[(int)2e6 + 5];
long long bin_pow(long long a, long long b) {
if (b == 0)
return 1;
long long ans = bin_pow(a, b / 2);
ans = ans * ans % MOD;
if (b % 2)
ans = ans * a % MOD;
return ans;
}
long long C(int n, int k) {
// cout << n << " " << k << "\n";
// cout << fact[n] << " " << ob[k] << " " << ob[n - k] << "\n";
return fact[n] * ob[k] % MOD * ob[n - k] % MOD;
}
int main() {
// freopen("input.txt", "r", stdin);
ios_base::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
ob[0] = 1;
for (int i = 1; i <= (int)2e6; ++i) {
(fact[i] = fact[i - 1] * i) %= MOD;
ob[i] = bin_pow(fact[i], MOD - 2);
}
long long x, y;
cin >> x >> y;
if ((x + y) % 3 || (x + y) / 3 > x || (x + y) / 3 > y) {
cout << "0\n";
return 0;
}
cout << C((x + y) / 3, x - ((x + y) / 3)) << "\n";
}
| replace | 56 | 57 | 56 | 57 | 0 | |
p02862 | C++ | Runtime Error | /*author ADITYA BANSAL
//~ MNNIT ALLAHABAD */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
ll power(ll, ll);
ll ncr(ll, ll);
ll add(ll a, ll b);
void fact();
ll mul(ll a, ll b);
#define watch(x) cerr << (#x) << "is" << x << nl;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fi(a, b) for (ll i = a; i < b; i++)
#define fk(a, b) for (ll k = a; k < b; k++)
#define fri(a, b) for (ll i = a; i >= b; i--)
#define fj(a, b) for (ll j = a; j < b; j++)
#define ffi(a, b) for (ll i = a; i * i <= b; i++)
#define mp make_pair
#define ff first
#define tc \
ll t; \
cin >> t; \
while (t--)
#define all(v) (v).begin(), (v).end()
#define ss second
#define pb push_back
#define mem(v, a) memset((v), a, sizeof(v));
#define pll pair<ll, ll>
#define mll map<ll, ll>
#define sll set<ll>
#define vll vector<ll>
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define nl endl
int mod = 1e9 + 7;
const ll N = 1000032LL;
ll fac[N + 2];
ll inv[N + 2];
signed main() {
fast fact();
//~ tc
{
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0)
return cout << 0, 0;
ll p = (x + y) / 3;
ll q = min(x, y);
ll ans = ncr(p, q - p);
cout << ans << nl;
}
return 0;
}
/******************************************************************************/
ll add(ll a, ll b) {
a += b;
if (a >= mod)
a -= mod;
if (a < 0)
a += mod;
return a;
}
ll mul(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll power(ll a, ll n) {
ll res = 1;
while (n) {
if (n & 1)
res = mul(res, a);
n >>= 1;
a = mul(a, a);
}
return res;
}
void fact() {
inv[0] = fac[0] = 1;
fi(1, N) {
fac[i] = mul(fac[i - 1], i);
inv[i] = power(fac[i], mod - 2);
}
}
ll ncr(ll n, ll r) {
if (r > n)
return 0;
ll e = fac[n];
e = mul(e, inv[r]);
e = mul(e, inv[n - r]);
return e;
}
| /*author ADITYA BANSAL
//~ MNNIT ALLAHABAD */
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
ll power(ll, ll);
ll ncr(ll, ll);
ll add(ll a, ll b);
void fact();
ll mul(ll a, ll b);
#define watch(x) cerr << (#x) << "is" << x << nl;
#define fast \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define fi(a, b) for (ll i = a; i < b; i++)
#define fk(a, b) for (ll k = a; k < b; k++)
#define fri(a, b) for (ll i = a; i >= b; i--)
#define fj(a, b) for (ll j = a; j < b; j++)
#define ffi(a, b) for (ll i = a; i * i <= b; i++)
#define mp make_pair
#define ff first
#define tc \
ll t; \
cin >> t; \
while (t--)
#define all(v) (v).begin(), (v).end()
#define ss second
#define pb push_back
#define mem(v, a) memset((v), a, sizeof(v));
#define pll pair<ll, ll>
#define mll map<ll, ll>
#define sll set<ll>
#define vll vector<ll>
#define max3(a, b, c) max(a, max(b, c))
#define min3(a, b, c) min(a, min(b, c))
#define nl endl
int mod = 1e9 + 7;
const ll N = 1000032LL;
ll fac[N + 2];
ll inv[N + 2];
signed main() {
fast fact();
//~ tc
{
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0)
return cout << 0, 0;
ll p = (x + y) / 3;
ll q = min(x, y);
if (q - p < 0)
return cout << 0, 0;
ll ans = ncr(p, q - p);
cout << ans << nl;
}
return 0;
}
/******************************************************************************/
ll add(ll a, ll b) {
a += b;
if (a >= mod)
a -= mod;
if (a < 0)
a += mod;
return a;
}
ll mul(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll power(ll a, ll n) {
ll res = 1;
while (n) {
if (n & 1)
res = mul(res, a);
n >>= 1;
a = mul(a, a);
}
return res;
}
void fact() {
inv[0] = fac[0] = 1;
fi(1, N) {
fac[i] = mul(fac[i - 1], i);
inv[i] = power(fac[i], mod - 2);
}
}
ll ncr(ll n, ll r) {
if (r > n)
return 0;
ll e = fac[n];
e = mul(e, inv[r]);
e = mul(e, inv[n - r]);
return e;
}
| replace | 55 | 56 | 55 | 57 | TLE | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using std::bitset;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define reps(i, s, e) for (int i = s; i < (int)e; i++)
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll> pll;
template <class T> using Graph = vector<vector<T>>;
void printFixedDouble(double d, int fix) {
cout << std::fixed;
cout << std::setprecision(fix) << d << endl;
}
// #include <iostream>
// modint: mod 計算を int を扱うように扱える構造体
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long 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 {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::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;
}
friend constexpr std::ostream &operator<<(std::ostream &os,
const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
const int MOD = 1000000007;
int main() {
int X, Y;
cin >> X >> Y;
if ((2 * Y - X) % 3 != 0 || (2 * X - Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
int W = (2 * Y - X) / 3;
int H = (2 * X - Y) / 3;
vector<Fp<MOD>> factorial;
factorial.push_back(Fp<MOD>(1));
reps(i, 1, W + H + 1) { factorial.push_back(factorial[i - 1] * Fp<MOD>(i)); }
cout << factorial[W + H] / factorial[W] / factorial[H] << endl;
} | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using std::bitset;
using std::cin;
using std::cout;
using std::endl;
using std::string;
using std::vector;
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define reps(i, s, e) for (int i = s; i < (int)e; i++)
typedef long double ld;
typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef std::pair<int, int> pii;
typedef std::pair<ll, ll> pll;
template <class T> using Graph = vector<vector<T>>;
void printFixedDouble(double d, int fix) {
cout << std::fixed;
cout << std::setprecision(fix) << d << endl;
}
// #include <iostream>
// modint: mod 計算を int を扱うように扱える構造体
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long 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 {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::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;
}
friend constexpr std::ostream &operator<<(std::ostream &os,
const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
const int MOD = 1000000007;
int main() {
int X, Y;
cin >> X >> Y;
if ((2 * Y - X) % 3 != 0 || (2 * X - Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
int W = (2 * Y - X) / 3;
int H = (2 * X - Y) / 3;
if (W < 0 || H < 0) {
cout << 0 << endl;
return 0;
}
vector<Fp<MOD>> factorial;
factorial.push_back(Fp<MOD>(1));
reps(i, 1, W + H + 1) { factorial.push_back(factorial[i - 1] * Fp<MOD>(i)); }
cout << factorial[W + H] / factorial[W] / factorial[H] << endl;
} | insert | 113 | 113 | 113 | 117 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int64_t mod = 1000000007;
int64_t power(int64_t n, int64_t k) {
if (k == 0)
return 1;
int64_t half = power(n, k / 2), half2 = half * half % mod;
if (k % 2) {
return n * half2 % mod;
} else {
return half2;
}
}
int main() {
int x0, y0, n, x, y;
cin >> x0 >> y0;
if ((x0 + y0) % 3) {
cout << 0 << endl;
return 0;
}
n = (x0 + y0) / 3;
x = x0 - n;
y = n - x;
vector<int64_t> fact(n + 1, 1), inv(n + 1);
for (int i = 1; i <= n; i++) {
fact.at(i) = fact.at(i - 1) * i % mod;
inv.at(i) = power(fact.at(i), mod - 2);
}
cout << fact.at(n) * inv.at(x) % mod * inv.at(y) % mod << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const int64_t mod = 1000000007;
int64_t power(int64_t n, int64_t k) {
if (k == 0)
return 1;
int64_t half = power(n, k / 2), half2 = half * half % mod;
if (k % 2) {
return n * half2 % mod;
} else {
return half2;
}
}
int main() {
int x0, y0, n, x, y;
cin >> x0 >> y0;
if ((x0 + y0) % 3) {
cout << 0 << endl;
return 0;
}
n = (x0 + y0) / 3;
x = x0 - n;
y = n - x;
if (x < 0 || y < 0) {
cout << 0 << endl;
return 0;
}
vector<int64_t> fact(n + 1, 1), inv(n + 1, 1);
for (int i = 1; i <= n; i++) {
fact.at(i) = fact.at(i - 1) * i % mod;
inv.at(i) = power(fact.at(i), mod - 2);
}
cout << fact.at(n) * inv.at(x) % mod * inv.at(y) % mod << endl;
}
| replace | 26 | 27 | 26 | 31 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
#define N_MAX 2000001
ll inv[N_MAX], fac[N_MAX], finv[N_MAX];
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < N_MAX; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
fac[i] = fac[i - 1] * (ll)i % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll inv_(ll n) {
if (n == 1)
return 1;
else
return MOD - inv_(MOD % n) * (MOD / n) % MOD;
}
ll comb(ll n, ll r) {
ll ans;
if (n < r) {
ans = 0;
} else {
ans = (fac[n] * finv[r]) % MOD;
ans = (ans * finv[n - r]) % MOD;
ans = (ans + MOD) % MOD;
}
return ans;
}
int main() {
init();
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(10) << fixed;
ll X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll N = (X + Y) / 3;
ll n = X - N;
cout << comb(N, n) << endl;
} | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1000000007;
#define N_MAX 2000001
ll inv[N_MAX], fac[N_MAX], finv[N_MAX];
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < N_MAX; i++) {
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
fac[i] = fac[i - 1] * (ll)i % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll inv_(ll n) {
if (n == 1)
return 1;
else
return MOD - inv_(MOD % n) * (MOD / n) % MOD;
}
ll comb(ll n, ll r) {
ll ans;
if (n < r) {
ans = 0;
} else {
ans = (fac[n] * finv[r]) % MOD;
ans = (ans * finv[n - r]) % MOD;
ans = (ans + MOD) % MOD;
}
return ans;
}
int main() {
init();
ios::sync_with_stdio(false);
cin.tie(0);
cout << setprecision(10) << fixed;
ll X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll N = (X + Y) / 3;
ll n = X - N;
if (n < 0) {
cout << 0 << endl;
return 0;
}
cout << comb(N, n) << endl;
} | insert | 58 | 58 | 58 | 62 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, n) for (ll i = s; i < n; i++)
#define repe(i, s, n) for (ll i = s; i <= n; i++)
#define rep_r(i, s, n) for (ll i = n - 1; i > s; i--)
#define rep_re(i, s, n) for (ll i = n - 1; i >= s; i--)
ll MOD = 1e9 + 7;
static const ll FACT_SIZE = 10000000;
ll fact[FACT_SIZE] = {};
ll Pow(ll n, ll p) {
if (p == 0)
return 1;
if (p == 1)
return n;
ll t = Pow(n, p / 2);
if (p & 1)
return (t * t % MOD) * n % MOD;
else
return t * t % MOD;
}
void factorial(ll f) {
fact[0] = fact[1] = 1;
rep(i, 1, FACT_SIZE) fact[i] = fact[i - 1] * i % MOD;
}
ll nCr(ll n, ll r) {
if (fact[0] == 0)
factorial(FACT_SIZE);
return ((fact[n] * (Pow(fact[r], MOD - 2) % MOD)) % MOD *
Pow(fact[n - r], MOD - 2)) %
MOD;
}
int main() {
ll x, y;
cin >> x >> y;
if ((x + y) % 3) {
cout << 0 << endl;
return 0;
}
ll m = (2 * x - y) / 3 % MOD;
ll n = (2 * y - x) / 3 % MOD;
cout << nCr(m + n, m) << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define rep(i, s, n) for (ll i = s; i < n; i++)
#define repe(i, s, n) for (ll i = s; i <= n; i++)
#define rep_r(i, s, n) for (ll i = n - 1; i > s; i--)
#define rep_re(i, s, n) for (ll i = n - 1; i >= s; i--)
ll MOD = 1e9 + 7;
static const ll FACT_SIZE = 10000000;
ll fact[FACT_SIZE] = {};
ll Pow(ll n, ll p) {
if (p == 0)
return 1;
if (p == 1)
return n;
ll t = Pow(n, p / 2);
if (p & 1)
return (t * t % MOD) * n % MOD;
else
return t * t % MOD;
}
void factorial(ll f) {
fact[0] = fact[1] = 1;
rep(i, 1, FACT_SIZE) fact[i] = fact[i - 1] * i % MOD;
}
ll nCr(ll n, ll r) {
if (fact[0] == 0)
factorial(FACT_SIZE);
return ((fact[n] * (Pow(fact[r], MOD - 2) % MOD)) % MOD *
Pow(fact[n - r], MOD - 2)) %
MOD;
}
int main() {
ll x, y;
cin >> x >> y;
if ((x + y) % 3) {
cout << 0 << endl;
return 0;
}
ll m = (2 * x - y) / 3;
ll n = (2 * y - x) / 3;
if (m < 0 || n < 0) {
cout << 0;
return 0;
}
cout << nCr(m + n, m) << endl;
}
| replace | 53 | 55 | 53 | 60 | 0 | |
p02862 | C++ | Memory Limit Exceeded | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0, i##_MACRO = (n); i < (i##_MACRO); i++)
#define RANGE(i, a, b) for (int i = (a), i < (b), i++)
#define EACH(e, a) for (auto &&e : a)
#define ALL(a) (a).begin(), (a).end()
#define AALL(a, n) (a), a + n
#define FILL(a, n) memset((a), n, sizeof(a))
#define FILLZ(a) FILL(a, 0)
using namespace std;
using ll = long long;
using VI = vector<int>;
using VI2D = vector<vector<int>>;
const int INF = 2e9;
const double EPS = 1e-9;
const double PI = acos(-1.0);
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
const int MAX = 50000000;
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;
}
double degree2radian(double degree) { return degree * PI / 180; }
int main() {
int x, y;
scanf("%d %d", &x, &y);
double nx, ny;
nx = (2 * y - x) / 3.0;
ny = y - 2 * nx;
if (abs(nx - static_cast<int>(nx)) > EPS ||
abs(ny - static_cast<int>(ny)) > EPS) {
puts("0");
return 0;
}
COMinit();
printf("%lld\n", COM(static_cast<int>(nx) + static_cast<int>(ny),
static_cast<int>(ny)));
return 0;
} | #include <algorithm>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <list>
#include <numeric>
#include <queue>
#include <sstream>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#define REP(i, n) for (int i = 0, i##_MACRO = (n); i < (i##_MACRO); i++)
#define RANGE(i, a, b) for (int i = (a), i < (b), i++)
#define EACH(e, a) for (auto &&e : a)
#define ALL(a) (a).begin(), (a).end()
#define AALL(a, n) (a), a + n
#define FILL(a, n) memset((a), n, sizeof(a))
#define FILLZ(a) FILL(a, 0)
using namespace std;
using ll = long long;
using VI = vector<int>;
using VI2D = vector<vector<int>>;
const int INF = 2e9;
const double EPS = 1e-9;
const double PI = acos(-1.0);
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
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;
}
double degree2radian(double degree) { return degree * PI / 180; }
int main() {
int x, y;
scanf("%d %d", &x, &y);
double nx, ny;
nx = (2 * y - x) / 3.0;
ny = y - 2 * nx;
if (abs(nx - static_cast<int>(nx)) > EPS ||
abs(ny - static_cast<int>(ny)) > EPS) {
puts("0");
return 0;
}
COMinit();
printf("%lld\n", COM(static_cast<int>(nx) + static_cast<int>(ny),
static_cast<int>(ny)));
return 0;
} | replace | 41 | 42 | 41 | 42 | MLE | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1e9 + 7;
int64_t fact[1000005];
int64_t factorial(int n, int p) { return fact[n] % p; }
//-RECIPE-START-//
// Use 64 bits integers to avoid overflow errors during multiplication.
int64_t modPow(int64_t a, int64_t x, int64_t p) {
// calculates a^x mod p in logarithmic time.
int64_t res = 1;
while (x > 0) {
if (x % 2)
res = (res * a) % p;
a = (a * a) % p;
x /= 2;
}
return res;
}
int64_t modInverse(int64_t a, int64_t p) { // (assuming p is prime).
return modPow(a, p - 2,
p); // calculates the modular multiplicative of a mod m.
}
int64_t
modBinomial(int64_t n, int64_t k,
int64_t p) { // calculates C(n,k) mod p (assuming p is prime).
int64_t numerator = factorial(n, p); // n!
int64_t denominator =
(factorial(k, p) * (factorial(n - k, p))) % p; // k!*(n-k)!
return (numerator * modInverse(denominator, p)) %
p; // numerator / denominator mod p.
}
int main() {
fact[0] = 1;
for (int64_t i = 1; i <= 1e6; ++i) {
fact[i] = (fact[i - 1] * i) % MOD;
}
int R, C;
cin >> R >> C;
int d = C + R;
if (d % 3) {
cout << 0 << endl;
return 0;
}
int cb = d / 3, rb = 2 * (d / 3);
if (R > rb || C < cb) {
cout << 0 << endl;
return 0;
}
int diff = C - cb;
// cout << "here " << cb << " " << rb << " " << diff << endl;
if (R != rb - diff) {
cout << 0 << endl;
return 0;
}
cout << modBinomial(d / 3, diff, MOD) << endl;
} | #include <bits/stdc++.h>
using namespace std;
int64_t MOD = 1e9 + 7;
int64_t fact[1000005];
int64_t factorial(int n, int p) { return fact[n] % p; }
//-RECIPE-START-//
// Use 64 bits integers to avoid overflow errors during multiplication.
int64_t modPow(int64_t a, int64_t x, int64_t p) {
// calculates a^x mod p in logarithmic time.
int64_t res = 1;
while (x > 0) {
if (x % 2)
res = (res * a) % p;
a = (a * a) % p;
x /= 2;
}
return res;
}
int64_t modInverse(int64_t a, int64_t p) { // (assuming p is prime).
return modPow(a, p - 2,
p); // calculates the modular multiplicative of a mod m.
}
int64_t
modBinomial(int64_t n, int64_t k,
int64_t p) { // calculates C(n,k) mod p (assuming p is prime).
int64_t numerator = factorial(n, p); // n!
int64_t denominator =
(factorial(k, p) * (factorial(n - k, p))) % p; // k!*(n-k)!
return (numerator * modInverse(denominator, p)) %
p; // numerator / denominator mod p.
}
int main() {
fact[0] = 1;
for (int64_t i = 1; i <= 1e6; ++i) {
fact[i] = (fact[i - 1] * i) % MOD;
}
int R, C;
cin >> R >> C;
int d = C + R;
if (d % 3) {
cout << 0 << endl;
return 0;
}
int cb = d / 3, rb = 2 * (d / 3);
if (R > rb || C < cb) {
cout << 0 << endl;
return 0;
}
int diff = C - cb;
// cout << "here " << cb << " " << rb << " " << diff << endl;
if (R != rb - diff) {
cout << 0 << endl;
return 0;
}
if (diff > d / 3) {
cout << 0 << endl;
return 0;
}
cout << modBinomial(d / 3, diff, MOD) << endl;
} | insert | 67 | 67 | 67 | 72 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// const long long MOD = 1000000007;
const long long INF = 1LL << 60;
const int INT_INF = 1000000000;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1}, dy[8] = {-1, 0, 1, 1, -1, 1, 0, -1};
// 二項係数nCr
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() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll X, Y;
cin >> X >> Y;
ll ans = 0;
if ((2 * X - Y) % 3 == 0 && (2 * Y - X) % 3 == 0) {
COMinit();
int x = (2 * X - Y) / 3;
int y = (2 * Y - X) / 3;
ans = COM(x + y, x);
cout << ans << endl;
} else
cout << 0 << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <cassert>
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;
// const long long MOD = 1000000007;
const long long INF = 1LL << 60;
const int INT_INF = 1000000000;
// int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx[8] = {-1, -1, -1, 0, 0, 1, 1, 1}, dy[8] = {-1, 0, 1, 1, -1, 1, 0, -1};
// 二項係数nCr
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() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll X, Y;
cin >> X >> Y;
ll ans = 0;
if ((2 * X - Y) % 3 == 0 && (2 * Y - X) % 3 == 0) {
COMinit();
int x = (2 * X - Y) / 3;
int y = (2 * Y - X) / 3;
ans = COM(x + y, x);
cout << ans << endl;
} else
cout << 0 << endl;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p02862 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
// mを法としたときのaのモジュラ逆元を求める
template <typename T> T mod_inverse(T a, T m) {
T x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
// return nCk % mod
template <typename T> T mod_comb(T n, T k, T mod) {
T mul = 1, div = 1;
for (T i = 0; i < k; i++) {
mul *= (n - i);
mul %= mod;
div *= (i + 1);
div %= mod;
}
return mul * mod_inverse(div, mod) % mod;
}
const long long MOD = 1000000007;
int main() {
long long x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return (0);
}
long long times = (x + y) / 3;
long long a = 0;
while (!(a + 2 * (times - a) == x && 2 * a + (times - a) == y)) {
a++;
}
if (a < 0 || times - a < 0) {
cout << 0 << endl;
} else {
cout << mod_comb(times, a, MOD) << endl;
}
return (0);
}
| #include <iostream>
using namespace std;
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
// mを法としたときのaのモジュラ逆元を求める
template <typename T> T mod_inverse(T a, T m) {
T x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
// return nCk % mod
template <typename T> T mod_comb(T n, T k, T mod) {
T mul = 1, div = 1;
for (T i = 0; i < k; i++) {
mul *= (n - i);
mul %= mod;
div *= (i + 1);
div %= mod;
}
return mul * mod_inverse(div, mod) % mod;
}
const long long MOD = 1000000007;
int main() {
long long x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return (0);
}
long long times = (x + y) / 3;
long long a = 0;
while (!(a + 2 * (times - a) == x && 2 * a + (times - a) == y) &&
a <= times) {
a++;
}
if (a < 0 || times - a < 0) {
cout << 0 << endl;
} else {
cout << mod_comb(times, a, MOD) << endl;
}
return (0);
}
| replace | 43 | 44 | 43 | 45 | TLE | |
p02862 | C++ | Runtime Error | // BROWNIE TK
#include <bits/stdc++.h>
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ldb;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pb push_back
#define popb pop_back()
#define pf push_front
#define popf pop_front()
#define si size()
#define be begin()
#define en end()
#define all(v) v.be, v.en
#define le length()
#define mp make_pair
#define mt make_tuple
#define acc(v) accumulate(all(v), 0)
#define F first
#define S second
#define forz(i, n) for (int i = 0; i < n; i++)
#define fore(i, m, n) for (int i = m; i <= n; i++)
#define rforz(i, n) for (int i = n - 1; i >= 0; i--)
#define rforzm(i, m, n) for (int i = n - 1; i >= m; i--)
#define deci(n) fixed << setprecision(n)
#define high(n) __builtin_popcount(n)
#define highll(n) __builtin_popcountll(n)
#define parity(n) __builtin_parity(n)
#define ctz(n) __builtin_ctz(n)
#define lb lower_bound
#define ub upper_bound
#define er equal_range
#define maxe *max_element
#define mine *min_element
#define mod 1000000007
#define mod2 998244353
#define gcd __gcd
#define kira ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl "\n"
#define p0(a) cout << a << " "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c << endl
#define p4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl
#define oset \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define osetlli \
tree<lli, null_type, less<lli>, rb_tree_tag, \
tree_order_statistics_node_update>
// member functions :
// 1. order_of_key(k) : number of elements strictly lesser than k
// 2. find_by_order(k) : k-th element in the set
#define ofk order_of_key
#define fbo find_by_order
using namespace std;
/*STD fucntions*/
lli power(lli x, lli y, lli p) {
lli res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y=y/2
x = (x * x) % p;
}
return res;
}
lli modi(lli a, lli m) {
// fermat little thm where m is prime
return power(a, m - 2, m);
}
/*CODE BEGINS*/
const int N = 1e6 + 5;
lli fac[N];
int main() {
kira;
lli x, y;
fac[0] = 1;
for (int i = 1; i < N; i++) {
fac[i] = (fac[i - 1] * i) % mod;
}
cin >> x >> y;
lli s = x + y;
lli a, b;
if (s % 3)
cout << 0;
else {
lli c = s / 3;
b = x - c;
if (b < 0)
cout << 0;
else {
lli ans = fac[c];
ans *= modi(fac[b], mod);
ans %= mod;
ans *= modi(fac[c - b], mod);
ans %= mod;
cout << ans;
}
}
return 0;
} | // BROWNIE TK
#include <bits/stdc++.h>
typedef long long int lli;
typedef unsigned long long int ulli;
typedef long double ldb;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define pb push_back
#define popb pop_back()
#define pf push_front
#define popf pop_front()
#define si size()
#define be begin()
#define en end()
#define all(v) v.be, v.en
#define le length()
#define mp make_pair
#define mt make_tuple
#define acc(v) accumulate(all(v), 0)
#define F first
#define S second
#define forz(i, n) for (int i = 0; i < n; i++)
#define fore(i, m, n) for (int i = m; i <= n; i++)
#define rforz(i, n) for (int i = n - 1; i >= 0; i--)
#define rforzm(i, m, n) for (int i = n - 1; i >= m; i--)
#define deci(n) fixed << setprecision(n)
#define high(n) __builtin_popcount(n)
#define highll(n) __builtin_popcountll(n)
#define parity(n) __builtin_parity(n)
#define ctz(n) __builtin_ctz(n)
#define lb lower_bound
#define ub upper_bound
#define er equal_range
#define maxe *max_element
#define mine *min_element
#define mod 1000000007
#define mod2 998244353
#define gcd __gcd
#define kira ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define endl "\n"
#define p0(a) cout << a << " "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c << endl
#define p4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl
#define oset \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define osetlli \
tree<lli, null_type, less<lli>, rb_tree_tag, \
tree_order_statistics_node_update>
// member functions :
// 1. order_of_key(k) : number of elements strictly lesser than k
// 2. find_by_order(k) : k-th element in the set
#define ofk order_of_key
#define fbo find_by_order
using namespace std;
/*STD fucntions*/
lli power(lli x, lli y, lli p) {
lli res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y=y/2
x = (x * x) % p;
}
return res;
}
lli modi(lli a, lli m) {
// fermat little thm where m is prime
return power(a, m - 2, m);
}
/*CODE BEGINS*/
const int N = 1e6 + 5;
lli fac[N];
int main() {
kira;
lli x, y;
fac[0] = 1;
for (int i = 1; i < N; i++) {
fac[i] = (fac[i - 1] * i) % mod;
}
cin >> x >> y;
lli s = x + y;
lli a, b;
if (s % 3)
cout << 0;
else {
lli c = s / 3;
b = x - c;
if (b < 0 || b > c)
cout << 0;
else {
lli ans = fac[c];
ans *= modi(fac[b], mod);
ans %= mod;
ans *= modi(fac[c - b], mod);
ans %= mod;
cout << ans;
}
}
return 0;
} | replace | 100 | 101 | 100 | 101 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define dbg(x) cout << "( " << #x << " -> " << x << " )" << endl;
using namespace std;
ll Power(ll a, ll b, ll p) {
ll res = 1;
while (b > 0) {
if (b % 2 != 0)
res = ((res % p) * (a % p)) % p;
a = ((a % p) * (a % p)) % p;
b = b / 2;
}
return res;
}
ll fac[10000005];
ll infac[10000005];
int main() {
ll x, y, mod = 1000000007;
scanf("%lld%lld", &x, &y);
fac[0] = 1;
for (ll i = 1; i < 10000005; i++)
fac[i] = ((fac[i - 1] % mod) * 1LL * i) % mod;
infac[10000004] = Power(fac[10000004], mod - 2, mod);
for (ll i = 10000003; i >= 0; i--)
infac[i] = ((infac[i + 1] % mod) * 1LL * (i + 1) % mod) % mod;
double m1 = (2.0 * x - y) / 3.0;
double n1 = (2.0 * y - x) / 3.0;
if (m1 == (ll)m1 && n1 == (ll)n1) {
ll m = (ll)m1;
ll n = (ll)n1;
ll val = ((((fac[m + n]) * (infac[m])) % mod) * (infac[n])) % mod;
printf("%lld\n", val);
} else
printf("0\n");
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define dbg(x) cout << "( " << #x << " -> " << x << " )" << endl;
using namespace std;
ll Power(ll a, ll b, ll p) {
ll res = 1;
while (b > 0) {
if (b % 2 != 0)
res = ((res % p) * (a % p)) % p;
a = ((a % p) * (a % p)) % p;
b = b / 2;
}
return res;
}
ll fac[10000005];
ll infac[10000005];
int main() {
ll x, y, mod = 1000000007;
scanf("%lld%lld", &x, &y);
fac[0] = 1;
for (ll i = 1; i < 10000005; i++)
fac[i] = ((fac[i - 1] % mod) * 1LL * i) % mod;
infac[10000004] = Power(fac[10000004], mod - 2, mod);
for (ll i = 10000003; i >= 0; i--)
infac[i] = ((infac[i + 1] % mod) * 1LL * (i + 1) % mod) % mod;
double m1 = (2.0 * x - y) / 3.0;
double n1 = (2.0 * y - x) / 3.0;
if (m1 == (ll)m1 && n1 == (ll)n1 && m1 >= 0 && n1 >= 0) {
ll m = (ll)m1;
ll n = (ll)n1;
ll val = ((((fac[m + n]) * (infac[m])) % mod) * (infac[n])) % mod;
printf("%lld\n", val);
} else
printf("0\n");
return 0;
} | replace | 27 | 28 | 27 | 28 | -11 | |
p02862 | C++ | Runtime Error | /*
* Author: heyuhhh
* Created Time: 2019/11/16 20:26:13
*/
#include <bits/stdc++.h>
#define MP make_pair
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define INF 0x3f3f3f3f
#define Local
#ifdef Local
#define dbg(args...) \
do { \
cout << #args << " -> "; \
err(args); \
} while (0)
void err() { std::cout << '\n'; }
template <typename T, typename... Args> void err(T a, Args... args) {
std::cout << a << ' ';
err(args...);
}
#else
#define dbg(...)
#endif
void pt() { std::cout << '\n'; }
template <typename T, typename... Args> void pt(T a, Args... args) {
std::cout << a << ' ';
pt(args...);
}
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
// head
const int N = 1e6 + 15, MOD = 1e9 + 7;
int fac[N];
ll qpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans = ans * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return ans;
}
int C(int n, int m) {
return 1ll * fac[n] * qpow(fac[n - m], MOD - 2) % MOD *
qpow(fac[m], MOD - 2) % MOD;
}
void run() {
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = 1ll * fac[i - 1] * i % MOD;
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0;
return;
}
int t = (x + y) / 3;
if (y - t <= t) {
cout << C(t, y - t);
} else
cout << 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(20);
run();
return 0;
} | /*
* Author: heyuhhh
* Created Time: 2019/11/16 20:26:13
*/
#include <bits/stdc++.h>
#define MP make_pair
#define fi first
#define se second
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define INF 0x3f3f3f3f
#define Local
#ifdef Local
#define dbg(args...) \
do { \
cout << #args << " -> "; \
err(args); \
} while (0)
void err() { std::cout << '\n'; }
template <typename T, typename... Args> void err(T a, Args... args) {
std::cout << a << ' ';
err(args...);
}
#else
#define dbg(...)
#endif
void pt() { std::cout << '\n'; }
template <typename T, typename... Args> void pt(T a, Args... args) {
std::cout << a << ' ';
pt(args...);
}
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
// head
const int N = 1e6 + 15, MOD = 1e9 + 7;
int fac[N];
ll qpow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans = ans * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return ans;
}
int C(int n, int m) {
return 1ll * fac[n] * qpow(fac[n - m], MOD - 2) % MOD *
qpow(fac[m], MOD - 2) % MOD;
}
void run() {
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = 1ll * fac[i - 1] * i % MOD;
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0;
return;
}
int t = (x + y) / 3;
if (y - t >= 0 && y - t <= t) {
cout << C(t, y - t);
} else
cout << 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout << fixed << setprecision(20);
run();
return 0;
} | replace | 66 | 67 | 66 | 67 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define iint int
#define pll std::pair<iint, iint>
#define rep(i, a, b) for (iint i = (iint)a; i < (iint)b; i++)
#define per(i, a, b) for (iint i = (iint)a; i > (iint)b; i--)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define full(a) a.begin(), a.end()
#define rfull(a) a.rbegin(), a.rend()
using namespace std;
const double pi = acos(-1.0);
const double pii = 2 * pi;
const double eps = 1e-6;
const long long MOD = 1e9 + 7;
const long long mul = 1e6 + 1;
long long pow_mod(long long a, long long b) {
if (a == 0)
return 0ll;
if (b == 0)
return 1ll;
if (b == 1)
return a % MOD;
long long x = pow_mod(a, b / 2);
if (b % 2 == 1)
return (((x * x) % MOD) * a) % MOD;
return (x * x) % MOD;
}
void solve() {
long long a, b, x, y;
std::cin >> x >> y;
a = 2 * y - x;
b = 2 * x - y;
if (a % 3 != 0 || b % 3 != 0) {
std::cout << 0 << "\n";
return;
}
a /= 3;
b /= 3;
std::vector<long long> dp(int(a + b + 1), 1ll);
for (int i = 2; i < dp.size(); i++) {
dp[i] = (dp[i - 1] * (1ll * i)) % MOD;
}
std::cout << (dp[a + b] * (pow_mod((dp[a] * dp[b]) % MOD, MOD - 2))) % MOD
<< "\n";
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
// int t;
// std::cin >> t;
// while(t--){
// solve();
// }
solve();
return 0;
} | #include <bits/stdc++.h>
#define iint int
#define pll std::pair<iint, iint>
#define rep(i, a, b) for (iint i = (iint)a; i < (iint)b; i++)
#define per(i, a, b) for (iint i = (iint)a; i > (iint)b; i--)
#define F first
#define S second
#define pb push_back
#define mp make_pair
#define full(a) a.begin(), a.end()
#define rfull(a) a.rbegin(), a.rend()
using namespace std;
const double pi = acos(-1.0);
const double pii = 2 * pi;
const double eps = 1e-6;
const long long MOD = 1e9 + 7;
const long long mul = 1e6 + 1;
long long pow_mod(long long a, long long b) {
if (a == 0)
return 0ll;
if (b == 0)
return 1ll;
if (b == 1)
return a % MOD;
long long x = pow_mod(a, b / 2);
if (b % 2 == 1)
return (((x * x) % MOD) * a) % MOD;
return (x * x) % MOD;
}
void solve() {
long long a, b, x, y;
std::cin >> x >> y;
a = 2 * y - x;
b = 2 * x - y;
if (a < 0 || b < 0 || a % 3 != 0 || b % 3 != 0) {
std::cout << 0 << "\n";
return;
}
a /= 3;
b /= 3;
std::vector<long long> dp(int(a + b + 1), 1ll);
for (int i = 2; i < dp.size(); i++) {
dp[i] = (dp[i - 1] * (1ll * i)) % MOD;
}
std::cout << (dp[a + b] * (pow_mod((dp[a] * dp[b]) % MOD, MOD - 2))) % MOD
<< "\n";
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
// int t;
// std::cin >> t;
// while(t--){
// solve();
// }
solve();
return 0;
} | replace | 42 | 43 | 42 | 43 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rFor(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<int, lint> pil;
typedef pair<lint, lint> pll;
typedef pair<pair<lint, int>, pair<int, int>> ppp;
typedef complex<double> xy_t;
typedef vector<lint> poly;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const lint mod = 1e9 + 7;
const lint INF = mod;
const int MAX = 100010;
lint powmod(lint x, lint n) {
lint ret = 1;
while (n > 0) {
if (n & 1)
ret *= x, ret %= mod, n -= 1;
else
x *= x, x %= mod, n >>= 1;
}
return ret;
}
vector<lint> fact;
vector<lint> revfact;
void setfact(int n) {
fact.resize(n + 1);
revfact.resize(n + 1);
fact[0] = 1;
rep(i, n) fact[i + 1] = fact[i] * (i + 1) % mod;
revfact[n] = powmod(fact[n], mod - 2);
for (int i = n - 1; i >= 0; i--)
revfact[i] = revfact[i + 1] * (i + 1) % mod;
}
lint getC(int n, int r) {
return fact[n] * revfact[r] % mod * revfact[n - r] % mod;
}
int main() {
int x, y;
scanf("%d%d", &x, &y);
int n = -x + 2 * y, m = 2 * x - y;
if (n < 0 || y < 0 || n % 3 || m % 3) {
printf("%d\n", 0);
return 0;
}
n /= 3;
m /= 3;
setfact(2000010);
printf("%lld\n", getC(n + m, n));
} | #include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rFor(i, a, b) for (int(i) = (a)-1; (i) >= (b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<int, lint> pil;
typedef pair<lint, lint> pll;
typedef pair<pair<lint, int>, pair<int, int>> ppp;
typedef complex<double> xy_t;
typedef vector<lint> poly;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const lint mod = 1e9 + 7;
const lint INF = mod;
const int MAX = 100010;
lint powmod(lint x, lint n) {
lint ret = 1;
while (n > 0) {
if (n & 1)
ret *= x, ret %= mod, n -= 1;
else
x *= x, x %= mod, n >>= 1;
}
return ret;
}
vector<lint> fact;
vector<lint> revfact;
void setfact(int n) {
fact.resize(n + 1);
revfact.resize(n + 1);
fact[0] = 1;
rep(i, n) fact[i + 1] = fact[i] * (i + 1) % mod;
revfact[n] = powmod(fact[n], mod - 2);
for (int i = n - 1; i >= 0; i--)
revfact[i] = revfact[i + 1] * (i + 1) % mod;
}
lint getC(int n, int r) {
return fact[n] * revfact[r] % mod * revfact[n - r] % mod;
}
int main() {
int x, y;
scanf("%d%d", &x, &y);
int n = -x + 2 * y, m = 2 * x - y;
if (n < 0 || m < 0 || n % 3 || m % 3) {
printf("%d\n", 0);
return 0;
}
n /= 3;
m /= 3;
setfact(2000010);
printf("%lld\n", getC(n + m, n));
} | replace | 68 | 69 | 68 | 69 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename H> bool chmin(H &v1, const H v2) {
if (v1 > v2) {
v1 = v2;
return true;
}
return false;
}
template <typename H> bool chmax(H &v1, const H v2) {
if (v1 < v2) {
v1 = v2;
return true;
}
return false;
}
template <typename H> void read(H &head) { cin >> head; }
template <typename H, typename... T> void read(H &head, T &...tail) {
cin >> head;
read(tail...);
}
template <typename H> void write(H head) { cout << head << '\n'; }
template <typename H, typename... T> void write(H head, T... tail) {
cout << head << " ";
write(tail...);
}
template <typename... T> void die(T... tok) {
write(tok...);
exit(0);
}
const ll mod = 1'000'000'007;
ll fact[2000005];
ll bm(ll b, ll p, ll m) {
ll r = 1;
for (; p; p >>= 1, b = b * b % m)
if (p & 1)
r = r * b % m;
return r;
}
ll modinv(ll b) { return bm(b, mod - 2, mod); }
ll ncr(ll n, ll r) {
return fact[n] * modinv(fact[n - r]) % mod * modinv(fact[r]) % mod;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
fact[0] = 1;
rep(i, 1, 2000005) fact[i] = fact[i - 1] * i % mod;
ll x, y;
read(x, y);
ll a = 2 * y - x;
ll b = 2 * x - y;
if (a % 3 != 0 || b % 3 != 0)
die(0);
a /= 3, b /= 3;
die(ncr(a + b, a));
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
template <typename H> bool chmin(H &v1, const H v2) {
if (v1 > v2) {
v1 = v2;
return true;
}
return false;
}
template <typename H> bool chmax(H &v1, const H v2) {
if (v1 < v2) {
v1 = v2;
return true;
}
return false;
}
template <typename H> void read(H &head) { cin >> head; }
template <typename H, typename... T> void read(H &head, T &...tail) {
cin >> head;
read(tail...);
}
template <typename H> void write(H head) { cout << head << '\n'; }
template <typename H, typename... T> void write(H head, T... tail) {
cout << head << " ";
write(tail...);
}
template <typename... T> void die(T... tok) {
write(tok...);
exit(0);
}
const ll mod = 1'000'000'007;
ll fact[2000005];
ll bm(ll b, ll p, ll m) {
ll r = 1;
for (; p; p >>= 1, b = b * b % m)
if (p & 1)
r = r * b % m;
return r;
}
ll modinv(ll b) { return bm(b, mod - 2, mod); }
ll ncr(ll n, ll r) {
return fact[n] * modinv(fact[n - r]) % mod * modinv(fact[r]) % mod;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
fact[0] = 1;
rep(i, 1, 2000005) fact[i] = fact[i - 1] * i % mod;
ll x, y;
read(x, y);
ll a = 2 * y - x;
ll b = 2 * x - y;
if (a % 3 != 0 || b % 3 != 0 || a < 0 || b < 0)
die(0);
a /= 3, b /= 3;
die(ncr(a + b, a));
}
| replace | 67 | 68 | 67 | 68 | 0 | |
p02862 | C++ | Runtime Error | #pragma GCC optimize("Ofast,fast-math,unroll-loops")
#include <bits/stdc++.h>
#define int ll
// #define double long double
// #define endl '\n'
#define all(C) (C).begin(), (C).end()
#define rall(C) (C).rbegin(), (C).rend()
#define mp make_pair
#define pb emplace_back
#define dbg(x) cerr << #x << " : " << x << endl
#define PI 3.14159265358979
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pld = pair<ld, ld>;
/*
const ll MAX_MEM = 3e8;
char MEM[MAX_MEM];
ll MEM_POS = 0;
void* operator new(size_t x)
{
auto ret = MEM + MEM_POS;
MEM_POS += x;
assert(MEM_POS < MAX_MEM);
return ret;
}
void operator delete(void*)
{}
*/
template <class T> istream &operator>>(istream &in, vector<T> &a) {
for (auto &i : a)
in >> i;
return in;
}
template <class T> ostream &operator<<(ostream &out, vector<T> a) {
for (auto &i : a)
out << i << ' ';
return out;
}
template <class T, class U> istream &operator>>(istream &in, pair<T, U> &p) {
in >> p.first >> p.second;
return in;
}
template <class T, class U> ostream &operator<<(ostream &out, pair<T, U> p) {
out << p.first << " " << p.second << " ";
return out;
}
inline void Start() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
}
const int P = 1e9 + 7;
int add(int a, int b) { return a + b >= P ? a + b - P : a + b; }
int mul(int a, int b) { return (a * b) % P; }
int bpow(int a, int n) {
int res = 1;
while (n) {
if (n & 1)
res = mul(res, a);
a = mul(a, a);
n >>= 1;
}
return res;
}
int rev(int x) { return bpow(x, P - 2); }
int sub(int a, int b) { return a - b >= 0 ? a - b : (a - b + P * P) % P; }
struct comb {
vector<int> fact, revf;
int N;
comb() {}
comb(int _n) {
N = _n;
fact.resize(N + 1, 1);
revf.resize(N + 1, 1);
for (int i = 1; i <= N; ++i)
fact[i] = mul(fact[i - 1], i), revf[i] = mul(revf[i - 1], rev(i));
}
int operator()(int n, int k) {
return mul(fact[n], mul(revf[k], revf[n - k]));
}
};
signed main() {
Start();
const int N = 1e6 + 1;
comb c(N);
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0)
return cout << 0, 0;
cout << c((x + y) / 3, min(x, y) - (x + y) / 3);
return 0;
}
| #pragma GCC optimize("Ofast,fast-math,unroll-loops")
#include <bits/stdc++.h>
#define int ll
// #define double long double
// #define endl '\n'
#define all(C) (C).begin(), (C).end()
#define rall(C) (C).rbegin(), (C).rend()
#define mp make_pair
#define pb emplace_back
#define dbg(x) cerr << #x << " : " << x << endl
#define PI 3.14159265358979
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pld = pair<ld, ld>;
/*
const ll MAX_MEM = 3e8;
char MEM[MAX_MEM];
ll MEM_POS = 0;
void* operator new(size_t x)
{
auto ret = MEM + MEM_POS;
MEM_POS += x;
assert(MEM_POS < MAX_MEM);
return ret;
}
void operator delete(void*)
{}
*/
template <class T> istream &operator>>(istream &in, vector<T> &a) {
for (auto &i : a)
in >> i;
return in;
}
template <class T> ostream &operator<<(ostream &out, vector<T> a) {
for (auto &i : a)
out << i << ' ';
return out;
}
template <class T, class U> istream &operator>>(istream &in, pair<T, U> &p) {
in >> p.first >> p.second;
return in;
}
template <class T, class U> ostream &operator<<(ostream &out, pair<T, U> p) {
out << p.first << " " << p.second << " ";
return out;
}
inline void Start() {
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
}
const int P = 1e9 + 7;
int add(int a, int b) { return a + b >= P ? a + b - P : a + b; }
int mul(int a, int b) { return (a * b) % P; }
int bpow(int a, int n) {
int res = 1;
while (n) {
if (n & 1)
res = mul(res, a);
a = mul(a, a);
n >>= 1;
}
return res;
}
int rev(int x) { return bpow(x, P - 2); }
int sub(int a, int b) { return a - b >= 0 ? a - b : (a - b + P * P) % P; }
struct comb {
vector<int> fact, revf;
int N;
comb() {}
comb(int _n) {
N = _n;
fact.resize(N + 1, 1);
revf.resize(N + 1, 1);
for (int i = 1; i <= N; ++i)
fact[i] = mul(fact[i - 1], i), revf[i] = mul(revf[i - 1], rev(i));
}
int operator()(int n, int k) {
return mul(fact[n], mul(revf[k], revf[n - k]));
}
};
signed main() {
Start();
const int N = 1e6 + 1;
comb c(N);
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0)
return cout << 0, 0;
if (min(x, y) - (x + y) / 3 < 0)
return cout << 0, 0;
cout << c((x + y) / 3, min(x, y) - (x + y) / 3);
return 0;
}
| insert | 103 | 103 | 103 | 105 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const ll MX = 2000005;
namespace Modop {
ll modAdd(ll a, ll b) { return (a + b) % MOD; }
ll modSub(ll a, ll b) { return (((a - b) % MOD) + MOD) % MOD; }
ll modMul(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll modExp(ll base, ll power) {
if (power == 0) {
return 1;
} else {
ll cur = modExp(base, power / 2);
cur = cur * cur;
cur = cur % MOD;
if (power % 2 == 1)
cur = cur * base;
cur = cur % MOD;
return cur;
}
}
ll modInv(ll a) { return modExp(a, MOD - 2); }
ll modDiv(ll a, ll b) { return modMul(a, modInv(b)); }
} // namespace Modop
using namespace Modop;
ll X, Y;
ll fac[MX];
void pre() {
fac[0] = fac[1] = 1;
for (int i = 2; i < MX; i++) {
fac[i] = modMul(i, fac[i - 1]);
}
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
pre();
cin >> X >> Y;
if ((X + Y) % 3) {
cout << "0";
return 0;
} else {
ll rightMoves = (X - (Y - X)) / 3;
ll upMoves = X - (2 * rightMoves);
ll totalMoves = rightMoves + upMoves;
ll ans = fac[totalMoves];
ans = modDiv(ans, fac[rightMoves]);
ans = modDiv(ans, fac[totalMoves - rightMoves]);
cout << ans;
}
return 0;
// You should actually read the stuff at the bottom
}
/* Stuff to Look For
* -----------------
* Int overflow, array bounds
* Initializing all variables, avoid weird behavior
* Edge cases(n = 0, n = 1)
* Just return 0 after result */
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<ld> vd;
typedef vector<str> vs;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define F0R(i, a) FOR(i, 0, a)
#define ROF(i, a, b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i, a) ROF(i, 0, a)
#define trav(a, x) for (auto &a : x)
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
const ll MX = 2000005;
namespace Modop {
ll modAdd(ll a, ll b) { return (a + b) % MOD; }
ll modSub(ll a, ll b) { return (((a - b) % MOD) + MOD) % MOD; }
ll modMul(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll modExp(ll base, ll power) {
if (power == 0) {
return 1;
} else {
ll cur = modExp(base, power / 2);
cur = cur * cur;
cur = cur % MOD;
if (power % 2 == 1)
cur = cur * base;
cur = cur % MOD;
return cur;
}
}
ll modInv(ll a) { return modExp(a, MOD - 2); }
ll modDiv(ll a, ll b) { return modMul(a, modInv(b)); }
} // namespace Modop
using namespace Modop;
ll X, Y;
ll fac[MX];
void pre() {
fac[0] = fac[1] = 1;
for (int i = 2; i < MX; i++) {
fac[i] = modMul(i, fac[i - 1]);
}
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
pre();
cin >> X >> Y;
if ((X + Y) % 3) {
cout << "0";
return 0;
} else {
ll rightMoves = (X - (Y - X)) / 3;
ll upMoves = X - (2 * rightMoves);
if (rightMoves < 0 || upMoves < 0) {
cout << 0;
return 0;
}
ll totalMoves = rightMoves + upMoves;
ll ans = fac[totalMoves];
ans = modDiv(ans, fac[rightMoves]);
ans = modDiv(ans, fac[totalMoves - rightMoves]);
cout << ans;
}
return 0;
// You should actually read the stuff at the bottom
}
/* Stuff to Look For
* -----------------
* Int overflow, array bounds
* Initializing all variables, avoid weird behavior
* Edge cases(n = 0, n = 1)
* Just return 0 after result */
| insert | 89 | 89 | 89 | 93 | 0 | |
p02862 | C++ | Time Limit Exceeded | /*
AuThOr GaRyMr
技巧:
1.区别对待大数据&小数据！
2.Dp难推时算贡献！
3.long long (尤其乘法)！
4.long long INF 要大
5.Dp on trees: 换根法，每次清空当前的节点和换到的子节点
6.long double | 输出浮点数
7.注意特判!(prince and princess)
*/
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB push_back
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
#define FREO freopen("check.out", "w", stdout)
#define rep(a, b) for (int a = 0; a < b; ++a)
#define KEEP while (1)
#define SRAND \
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define random(a) rng() % a
#define ALL(a) a.begin(), a.end()
#define POB pop_back
using namespace std;
const int INF = 0x3f3f3f3f;
typedef pair<int, int> mp;
typedef pair<mp, mp> superpair;
const int maxn = 1000000;
bool arr[maxn + 1] = {false};
vector<int> produce_prim_number() {
vector<int> prim;
prim.push_back(2);
int i, j;
for (i = 3; i * i <= maxn; i += 2) {
if (!arr[i]) {
prim.push_back(i);
for (j = i * i; j <= maxn; j += i)
arr[j] = true;
}
}
while (i < maxn) {
if (!arr[i])
prim.push_back(i);
i += 2;
}
return prim;
}
// 计算n!中素数因子p的指数
int cal(int x, int p) {
int ans = 0;
long long rec = p;
while (x >= rec) {
ans += x / rec;
rec *= p;
}
return ans;
}
// 计算n的k次方对m取模，二分法
int pow(long long n, int k, int M) {
long long ans = 1;
while (k) {
if (k & 1) {
ans = (ans * n) % M;
}
n = (n * n) % M;
k >>= 1;
}
return ans;
}
// 计算C（n，m）
int combination(int n, int m) {
const int M = 1e9 + 7;
vector<int> prim = produce_prim_number();
long long ans = 1;
int num;
for (int i = 0; i < prim.size() && prim[i] <= n; ++i) {
num = cal(n, prim[i]) - cal(m, prim[i]) - cal(n - m, prim[i]);
ans = (ans * pow(prim[i], num, M)) % M;
}
return ans;
}
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3 == 0) {
int Y = (y + y - x) / 3, tot = (x + y) / 3;
int X = tot - Y;
if (X < 0) {
cout << 0 << endl;
return 0;
}
cout << combination(tot, Y) << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| /*
AuThOr GaRyMr
技巧:
1.区别对待大数据&小数据！
2.Dp难推时算贡献！
3.long long (尤其乘法)！
4.long long INF 要大
5.Dp on trees: 换根法，每次清空当前的节点和换到的子节点
6.long double | 输出浮点数
7.注意特判!(prince and princess)
*/
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define niv vector<int>
#define LL long long
#define IT iterator
#define PB push_back
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
#define FREO freopen("check.out", "w", stdout)
#define rep(a, b) for (int a = 0; a < b; ++a)
#define KEEP while (1)
#define SRAND \
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define random(a) rng() % a
#define ALL(a) a.begin(), a.end()
#define POB pop_back
using namespace std;
const int INF = 0x3f3f3f3f;
typedef pair<int, int> mp;
typedef pair<mp, mp> superpair;
const int maxn = 1000000;
bool arr[maxn + 1] = {false};
vector<int> produce_prim_number() {
vector<int> prim;
prim.push_back(2);
int i, j;
for (i = 3; i * i <= maxn; i += 2) {
if (!arr[i]) {
prim.push_back(i);
for (j = i * i; j <= maxn; j += i)
arr[j] = true;
}
}
while (i < maxn) {
if (!arr[i])
prim.push_back(i);
i += 2;
}
return prim;
}
// 计算n!中素数因子p的指数
int cal(int x, int p) {
int ans = 0;
long long rec = p;
while (x >= rec) {
ans += x / rec;
rec *= p;
}
return ans;
}
// 计算n的k次方对m取模，二分法
int pow(long long n, int k, int M) {
long long ans = 1;
while (k) {
if (k & 1) {
ans = (ans * n) % M;
}
n = (n * n) % M;
k >>= 1;
}
return ans;
}
// 计算C（n，m）
int combination(int n, int m) {
const int M = 1e9 + 7;
vector<int> prim = produce_prim_number();
long long ans = 1;
int num;
for (int i = 0; i < prim.size() && prim[i] <= n; ++i) {
num = cal(n, prim[i]) - cal(m, prim[i]) - cal(n - m, prim[i]);
ans = (ans * pow(prim[i], num, M)) % M;
}
return ans;
}
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3 == 0) {
int Y = (y + y - x) / 3, tot = (x + y) / 3;
int X = tot - Y;
if (X < 0 || Y < 0) {
cout << 0 << endl;
return 0;
}
cout << combination(tot, Y) << endl;
} else {
cout << 0 << endl;
}
return 0;
}
| replace | 93 | 94 | 93 | 94 | TLE | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll kai[2000001];
ll gyaku[2000001];
ll kuri2(ll x, ll a) {
ll ret = 1;
ll tmp = x;
while (a > 0) {
if (a & 1) {
ret *= tmp;
ret %= MOD;
}
a >>= 1;
tmp *= tmp;
tmp %= MOD;
}
if (ret < 0)
ret += MOD;
return ret;
}
int main() {
int x, y;
int p, m, a, b;
ll ans = 0;
cin >> x >> y;
kai[0] = 1;
gyaku[0] = kuri2(kai[0], MOD - 2);
for (ll i = 1; i < 2000001; i++) {
kai[i] = kai[i - 1] * i;
kai[i] %= MOD;
if (kai[i] < 0)
kai[i] += MOD;
gyaku[i] = kuri2(kai[i], MOD - 2);
}
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
p = (x + y) / 3;
m = x - y;
a = (p + m) / 2;
b = (p - m) / 2;
if (a + b != p) {
cout << 0 << endl;
return 0;
}
ans = kai[p] * gyaku[a];
ans %= MOD;
ans *= gyaku[p - a];
ans %= MOD;
if (ans < 0)
ans += MOD;
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll kai[2000001];
ll gyaku[2000001];
ll kuri2(ll x, ll a) {
ll ret = 1;
ll tmp = x;
while (a > 0) {
if (a & 1) {
ret *= tmp;
ret %= MOD;
}
a >>= 1;
tmp *= tmp;
tmp %= MOD;
}
if (ret < 0)
ret += MOD;
return ret;
}
int main() {
int x, y;
int p, m, a, b;
ll ans = 0;
cin >> x >> y;
kai[0] = 1;
gyaku[0] = kuri2(kai[0], MOD - 2);
for (ll i = 1; i < 2000001; i++) {
kai[i] = kai[i - 1] * i;
kai[i] %= MOD;
if (kai[i] < 0)
kai[i] += MOD;
gyaku[i] = kuri2(kai[i], MOD - 2);
}
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
p = (x + y) / 3;
m = x - y;
a = (p + m) / 2;
b = (p - m) / 2;
if (!(a + b == p && a >= 0 && b >= 0)) {
cout << 0 << endl;
return 0;
}
ans = kai[p] * gyaku[a];
ans %= MOD;
ans *= gyaku[p - a];
ans %= MOD;
if (ans < 0)
ans += MOD;
cout << ans << endl;
return 0;
} | replace | 51 | 52 | 51 | 52 | 0 | |
p02862 | C++ | Memory Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vc vector
#define a first
#define b second
#define pb pusu_back
#define INF (1000000000)
#define MOD (1000000007)
#define MAX (100000000)
/////////////////////////////////////////////////////////
class XY {
public:
ll x, y;
XY() { x = y = 0; }
XY(ll u, ll v) {
x = u;
y = v;
}
};
template <typename T1, typename T2> void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T1, typename T2> ll mypow(T1 a, T2 n) {
if (n == 0)
return 1;
if (n == 1)
return a;
if (n % 2)
return a * mypow(a, n - 1);
ll tmp = mypow(a, n / 2);
return tmp * tmp;
}
template <typename T> int BS(vector<T> &V, int left, int right, T key) {
int mid = (left + right) / 2;
if (V[mid] <= key)
left = mid;
else
right = mid;
if (right - mid == 1)
return left;
else
return BS(V, left, right, key);
}
ll comb(ll n, ll r) {
ll res = 1;
rep(i, 0, r) {
res *= n - i;
res /= i + 1;
}
return res;
}
template <typename T> T euclid(T a, T b) {
if (b == 0)
return a;
else
return euclid(b, a % b);
}
/////////////////////////////////////////////////////////
// MOD of Combination
vector<ll> fact(MAX, 0), fact_inv(MAX, 0);
ll pow_mod(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 prepare_comb_mod(ll n) {
fact[0] = 1LL;
for (ll i = 0; i < n; i++)
fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[n] = pow_mod(fact[n], MOD - 2);
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
ll comb_mod(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
/////////////////////////////////////////////////////////
// Union-Find Tree
template <class T> struct UFT {
vector<int> par;
vector<int> rank;
vector<T> diff_weight;
UFT(int n = 1, T w = 0) { init(n, w); }
void init(int n = 1, T w = 0) {
par.resize(n);
rank.resize(n);
diff_weight.resize(n);
rep(i, 0, n) {
par[i] = i;
rank[i] = 0;
diff_weight[i] = w;
}
}
int root(int x) {
if (par[x] == x) {
return x;
} else {
int r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
bool unite(int x, int y, int w = 0) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y]) {
par[x] = y;
diff_weight[x] = -w;
} else {
par[y] = x;
diff_weight[y] = w;
if (rank[x] == rank[y])
rank[x]++;
}
return true;
}
bool same(int x, int y) { return root(x) == root(y); }
T weight(int x) {
root(x);
return diff_weight[x];
}
T diff(int x, int y) { return weight(y) - weight(x); }
};
/////////////////////////////////////////////////////////
void Main() {
ll x, y;
cin >> x >> y;
prepare_comb_mod(x + y);
ll res = 0;
rep(n, 0, x + 1) {
if ((x - n) % 2 == 0 && (x - n) / 2 == y - 2 * n && (x - n) / 2 >= 0) {
int m = (x - n) / 2;
res += comb_mod(n + m, n);
res %= MOD;
}
}
cout << res << endl;
}
/////////////////////////////////////////////////////////
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << std::fixed << std::setprecision(15);
Main();
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, j, n) for (int i = j; i < n; i++)
#define all(x) (x).begin(), (x).end()
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vc vector
#define a first
#define b second
#define pb pusu_back
#define INF (1000000000)
#define MOD (1000000007)
#define MAX (5000000)
/////////////////////////////////////////////////////////
class XY {
public:
ll x, y;
XY() { x = y = 0; }
XY(ll u, ll v) {
x = u;
y = v;
}
};
template <typename T1, typename T2> void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T1, typename T2> ll mypow(T1 a, T2 n) {
if (n == 0)
return 1;
if (n == 1)
return a;
if (n % 2)
return a * mypow(a, n - 1);
ll tmp = mypow(a, n / 2);
return tmp * tmp;
}
template <typename T> int BS(vector<T> &V, int left, int right, T key) {
int mid = (left + right) / 2;
if (V[mid] <= key)
left = mid;
else
right = mid;
if (right - mid == 1)
return left;
else
return BS(V, left, right, key);
}
ll comb(ll n, ll r) {
ll res = 1;
rep(i, 0, r) {
res *= n - i;
res /= i + 1;
}
return res;
}
template <typename T> T euclid(T a, T b) {
if (b == 0)
return a;
else
return euclid(b, a % b);
}
/////////////////////////////////////////////////////////
// MOD of Combination
vector<ll> fact(MAX, 0), fact_inv(MAX, 0);
ll pow_mod(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 prepare_comb_mod(ll n) {
fact[0] = 1LL;
for (ll i = 0; i < n; i++)
fact[i + 1] = fact[i] * (i + 1) % MOD;
fact_inv[n] = pow_mod(fact[n], MOD - 2);
for (ll i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1) % MOD;
}
ll comb_mod(ll n, ll r) {
return (fact[n] * fact_inv[r]) % MOD * fact_inv[n - r] % MOD;
}
/////////////////////////////////////////////////////////
// Union-Find Tree
template <class T> struct UFT {
vector<int> par;
vector<int> rank;
vector<T> diff_weight;
UFT(int n = 1, T w = 0) { init(n, w); }
void init(int n = 1, T w = 0) {
par.resize(n);
rank.resize(n);
diff_weight.resize(n);
rep(i, 0, n) {
par[i] = i;
rank[i] = 0;
diff_weight[i] = w;
}
}
int root(int x) {
if (par[x] == x) {
return x;
} else {
int r = root(par[x]);
diff_weight[x] += diff_weight[par[x]];
return par[x] = r;
}
}
bool unite(int x, int y, int w = 0) {
w += weight(x);
w -= weight(y);
x = root(x);
y = root(y);
if (x == y)
return false;
if (rank[x] < rank[y]) {
par[x] = y;
diff_weight[x] = -w;
} else {
par[y] = x;
diff_weight[y] = w;
if (rank[x] == rank[y])
rank[x]++;
}
return true;
}
bool same(int x, int y) { return root(x) == root(y); }
T weight(int x) {
root(x);
return diff_weight[x];
}
T diff(int x, int y) { return weight(y) - weight(x); }
};
/////////////////////////////////////////////////////////
void Main() {
ll x, y;
cin >> x >> y;
prepare_comb_mod(x + y);
ll res = 0;
rep(n, 0, x + 1) {
if ((x - n) % 2 == 0 && (x - n) / 2 == y - 2 * n && (x - n) / 2 >= 0) {
int m = (x - n) / 2;
res += comb_mod(n + m, n);
res %= MOD;
}
}
cout << res << endl;
}
/////////////////////////////////////////////////////////
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << std::fixed << std::setprecision(15);
Main();
}
| replace | 13 | 14 | 13 | 14 | MLE | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SUM(x) accumulate(rng(x), 0)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define uni(x) x.erase(unique(rng(x)), x.end())
#define SP << " " <<
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
const int mod = 1000000007;
const double EPS = 1e-9;
const int INF = 1 << 30;
const ll INFLL = 1LL << 60;
// cout << fixed << setprecision(10);
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((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;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(500005);
// comb(n,k)ならcomb(n+k+5)とかにしておく
mint f(int n, int k) {
if (n < 0)
return 0;
mint res = comb(n, k);
// nPk = nCk * k!
// res *= comb.fact[k]; // <- nPk求めたいときは必要
return res;
}
// f(n,k).x で nCk か nPk が計算される
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
if (min(x, y) < (x + y) / 3) {
cout << 0 << endl;
return 0;
}
int n = (x + y) / 3;
int k = min(x, y) - n;
mint ans = f(n, k);
cout << ans.x << endl;
return 0;
} | #include <bits/stdc++.h>
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) for (int i = (0); i < (n); ++i)
#define rng(x) (x).begin(), (x).end()
#define rrng(x) (x).rbegin(), (x).rend()
#define debug(x) cout << #x << " = " << (x) << endl;
#define SUM(x) accumulate(rng(x), 0)
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define uni(x) x.erase(unique(rng(x)), x.end())
#define SP << " " <<
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vll = vector<ll>;
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
const int mod = 1000000007;
const double EPS = 1e-9;
const int INF = 1 << 30;
const ll INFLL = 1LL << 60;
// cout << fixed << setprecision(10);
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
// const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((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;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(2000005);
// comb(n,k)ならcomb(n+k+5)とかにしておく
mint f(int n, int k) {
if (n < 0)
return 0;
mint res = comb(n, k);
// nPk = nCk * k!
// res *= comb.fact[k]; // <- nPk求めたいときは必要
return res;
}
// f(n,k).x で nCk か nPk が計算される
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
if (min(x, y) < (x + y) / 3) {
cout << 0 << endl;
return 0;
}
int n = (x + y) / 3;
int k = min(x, y) - n;
mint ans = f(n, k);
cout << ans.x << endl;
return 0;
} | replace | 108 | 109 | 108 | 109 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long X, Y;
long long base = 1000000007LL;
long long kaijo(long long a) {
if (a == 0)
return 1LL;
else {
return a * kaijo(a - 1) % base;
}
}
long long ruijo(long long a, long long b) {
if (b == 0LL)
return 1LL;
else {
if (b % 2 == 0)
return (ruijo(a, b / 2) * ruijo(a, b / 2)) % base;
else
return (a * ruijo(a, b - 1)) % base;
}
}
int main() {
cin >> X >> Y;
if ((X + Y) % 3LL != 0LL)
cout << 0 << endl;
else {
long long k = (X + Y) / 3LL;
long long x = (2 * Y - X) / 3LL;
long long y = (2 * X - Y) / 3LL;
long long a = (kaijo(x) * kaijo(y)) % base;
cout << (kaijo(k) * ruijo(a, base - 2LL)) % base << endl;
}
} | #include <bits/stdc++.h>
using namespace std;
long long X, Y;
long long base = 1000000007LL;
long long kaijo(long long a) {
if (a == 0)
return 1LL;
else {
return a * kaijo(a - 1) % base;
}
}
long long ruijo(long long a, long long b) {
if (b == 0LL)
return 1LL;
else {
if (b % 2 == 0)
return (ruijo(a, b / 2) * ruijo(a, b / 2)) % base;
else
return (a * ruijo(a, b - 1)) % base;
}
}
int main() {
cin >> X >> Y;
if ((X + Y) % 3LL != 0LL || Y > 2 * X || X > 2 * Y)
cout << 0 << endl;
else {
long long k = (X + Y) / 3LL;
long long x = (2 * Y - X) / 3LL;
long long y = (2 * X - Y) / 3LL;
long long a = (kaijo(x) * kaijo(y)) % base;
cout << (kaijo(k) * ruijo(a, base - 2LL)) % base << endl;
}
} | replace | 27 | 28 | 27 | 28 | TLE | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define all(x) (x).begin(), (x).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 (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
using namespace std;
long long modpow(long long x, long long n, long long mod) {
if (n == 0)
return 1;
long long res = modpow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
vector<long long> fact, inv;
long long mod = 1e9 + 7;
void init(int n) {
fact.resize(n);
inv.resize(n);
fact[0] = 1LL;
rep(i, n - 1) { fact[i + 1] = (long long)fact[i] * (i + 1) % mod; }
inv[n - 1] = modinv(fact[n - 1], mod);
rrep(i, n - 1) { inv[i] = (long long)inv[i + 1] * (i + 1) % mod; }
}
long long comb(ll a, ll b) { return fact[a] * inv[b] % mod * inv[a - b] % mod; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll a, b;
a = y - (x + y) / 3;
b = x - (x + y) / 3;
// cout<<a<<" "<<b<<endl;
init(2e6);
cout << comb(a + b, a) << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define all(x) (x).begin(), (x).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 (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
using namespace std;
long long modpow(long long x, long long n, long long mod) {
if (n == 0)
return 1;
long long res = modpow(x * x % mod, n / 2, mod);
if (n & 1)
res = res * x % mod;
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
vector<long long> fact, inv;
long long mod = 1e9 + 7;
void init(int n) {
fact.resize(n);
inv.resize(n);
fact[0] = 1LL;
rep(i, n - 1) { fact[i + 1] = (long long)fact[i] * (i + 1) % mod; }
inv[n - 1] = modinv(fact[n - 1], mod);
rrep(i, n - 1) { inv[i] = (long long)inv[i + 1] * (i + 1) % mod; }
}
long long comb(ll a, ll b) { return fact[a] * inv[b] % mod * inv[a - b] % mod; }
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
ll x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll a, b;
a = y - (x + y) / 3;
b = x - (x + y) / 3;
// cout<<a<<" "<<b<<endl;
if (a < 0 || b < 0) {
cout << 0 << endl;
return 0;
}
init(2e6);
cout << comb(a + b, a) << endl;
return 0;
}
| insert | 74 | 74 | 74 | 78 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 1e6 + 6, M = 1e9 + 7;
int fac[maxn], ifac[maxn];
int mult(int a, int b) { return (1LL * a * b) % M; }
int modexp(int a, int b) {
int res = 1;
while (b > 0) {
if (b & 1)
res = mult(res, a);
a = mult(a, a);
b >>= 1;
}
return res;
}
int comb(int n, int r) { return mult(fac[n], mult(ifac[r], ifac[n - r])); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int x, y;
cin >> x >> y;
fac[0] = 1;
for (int i = 1; i < maxn; i++) {
fac[i] = mult(fac[i - 1], i);
}
for (int i = 0; i < maxn; i++) {
ifac[i] = modexp(fac[i], M - 2);
}
if ((2 * x - y) < 0 || (2 * x - y) % 3 != 0) {
cout << 0 << '\n';
} else {
int b = (2 * x - y) / 3;
int a = x - 2 * b;
cout << comb(a + b, a) << '\n';
}
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 1e6 + 6, M = 1e9 + 7;
int fac[maxn], ifac[maxn];
int mult(int a, int b) { return (1LL * a * b) % M; }
int modexp(int a, int b) {
int res = 1;
while (b > 0) {
if (b & 1)
res = mult(res, a);
a = mult(a, a);
b >>= 1;
}
return res;
}
int comb(int n, int r) { return mult(fac[n], mult(ifac[r], ifac[n - r])); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int x, y;
cin >> x >> y;
fac[0] = 1;
for (int i = 1; i < maxn; i++) {
fac[i] = mult(fac[i - 1], i);
}
for (int i = 0; i < maxn; i++) {
ifac[i] = modexp(fac[i], M - 2);
}
if ((2 * x - y) < 0 || (2 * x - y) % 3 != 0) {
cout << 0 << '\n';
} else {
int b = (2 * x - y) / 3;
int a = x - 2 * b;
if (a >= 0 && b >= 0) {
cout << comb(a + b, a) << '\n';
} else {
cout << 0 << '\n';
}
}
}
| replace | 37 | 38 | 37 | 42 | 0 | |
p02862 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i > -1; i--)
#define rrep2(i, n, a) for (int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll = long long;
using v_int = vector<int>;
using v2_int = vector<v_int>;
using v_ll = vector<ll>;
using v2_ll = vector<v_ll>;
using v_string = vector<string>;
using v_bool = vector<bool>;
using v2_bool = vector<v_bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
const double PI = 3.1415926535897932;
const int INF = (int)2e9;
const ll LINF = (ll)2e18;
const ll MOD = 1000000007;
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
template <typename T, typename U>
inline ostream &operator<<(ostream &o, pair<T, U> &p) {
return o << "{" << p.first << "," << p.second << "}";
}
template <typename T> inline istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec) {
is >> v;
}
return is;
}
template <typename T> inline ostream &operator<<(ostream &os, vector<T> &vec) {
for (auto &v : vec) {
os << v << ",";
}
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, vector<vector<T>> &mat) {
for (auto &row : mat) {
os << row << endl;
}
return os;
}
template <typename T> inline void chmin(T &a, T b) { a = min(a, b); }
template <typename T> inline void chmax(T &a, T b) { a = max(a, b); }
template <typename T> T ModPow(T s, T n) {
T res = 1;
while (n) {
if (n & 1) {
res *= s;
res %= MOD;
}
s *= s;
s %= MOD;
n >>= 1;
}
return res;
}
template <typename T> T ModInv(T n) { return ModPow(n, MOD - 2); }
template <typename T> T ModnCr(T n, T r) {
T x = 1, y = 1;
rep(i, r) {
x *= n - i;
x %= MOD;
y *= r - i;
y %= MOD;
}
T rtn = (x * ModInv(y)) % MOD;
return rtn;
}
ll func(ll n) {
ll res = 1;
while (n) {
res *= n;
res %= MOD;
n--;
}
return res;
}
int main(void) {
int x, y;
cin >> x >> y;
int d = 2 * x - y;
if (d % 3 != 0) {
cout << 0 << endl;
} else {
ll a = x - (2 * d) / 3;
ll b = d / 3;
ll ans = func(a + b);
ans *= ModInv(func(a));
ans %= MOD;
ans *= ModInv(func(b));
ans %= MOD;
cout << ans << endl;
}
return 0;
} /*atcoder*/
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, a, n) for (int i = (int)(a); i <= (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i > -1; i--)
#define rrep2(i, n, a) for (int i = (int)(n); i >= (int)(a); i--)
#define fi first
#define se second
using namespace std;
using ll = long long;
using v_int = vector<int>;
using v2_int = vector<v_int>;
using v_ll = vector<ll>;
using v2_ll = vector<v_ll>;
using v_string = vector<string>;
using v_bool = vector<bool>;
using v2_bool = vector<v_bool>;
using pii = pair<int, int>;
using mii = map<int, int>;
const double PI = 3.1415926535897932;
const int INF = (int)2e9;
const ll LINF = (ll)2e18;
const ll MOD = 1000000007;
const int dc[8] = {1, -1, 0, 0, 1, -1, 1, -1};
const int dr[8] = {0, 0, 1, -1, 1, 1, -1, -1};
template <typename T, typename U>
inline ostream &operator<<(ostream &o, pair<T, U> &p) {
return o << "{" << p.first << "," << p.second << "}";
}
template <typename T> inline istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec) {
is >> v;
}
return is;
}
template <typename T> inline ostream &operator<<(ostream &os, vector<T> &vec) {
for (auto &v : vec) {
os << v << ",";
}
return os;
}
template <typename T>
inline ostream &operator<<(ostream &os, vector<vector<T>> &mat) {
for (auto &row : mat) {
os << row << endl;
}
return os;
}
template <typename T> inline void chmin(T &a, T b) { a = min(a, b); }
template <typename T> inline void chmax(T &a, T b) { a = max(a, b); }
template <typename T> T ModPow(T s, T n) {
T res = 1;
while (n) {
if (n & 1) {
res *= s;
res %= MOD;
}
s *= s;
s %= MOD;
n >>= 1;
}
return res;
}
template <typename T> T ModInv(T n) { return ModPow(n, MOD - 2); }
template <typename T> T ModnCr(T n, T r) {
T x = 1, y = 1;
rep(i, r) {
x *= n - i;
x %= MOD;
y *= r - i;
y %= MOD;
}
T rtn = (x * ModInv(y)) % MOD;
return rtn;
}
ll func(ll n) {
ll res = 1;
while (n) {
res *= n;
res %= MOD;
n--;
}
return res;
}
int main(void) {
int x, y;
cin >> x >> y;
int d = 2 * x - y;
if (d % 3 != 0) {
cout << 0 << endl;
} else {
ll a = x - (2 * d) / 3;
ll b = d / 3;
if (a < 0 || b < 0) {
cout << 0 << endl;
return 0;
}
ll ans = ModnCr(a + b, b);
cout << ans << endl;
}
return 0;
} /*atcoder*/
| replace | 113 | 118 | 113 | 118 | TLE | |
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 M 1000000007
#define sz(a) (ll) a.size()
#define pll pair<ll, ll>
#define rep(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define sep(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
#define mll map<ll, ll>
#define vl vector<ll>
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define F first
#define S second
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int binpow(int a, int b, int mod) {
int ans = 1;
while (b) {
if (b & 1)
ans = (ans * 1LL * a) % mod;
a = (a * 1LL * a) % mod;
b >>= 1;
}
return ans;
}
const ll P = 2000005;
ll fact[P], inv[P];
void preprocess() {
fact[0] = 1;
rep(i, 1, P) fact[i] = (i * fact[i - 1]) % M;
inv[P - 1] = binpow(fact[P - 1], M - 2, M);
sep(i, P - 2, 0) inv[i] = (inv[i + 1] * (i + 1)) % M;
}
ll C(ll n, ll r) { return (((fact[n] * inv[r]) % M) * inv[n - r]) % M; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
preprocess();
ll x, y;
cin >> x >> y;
ll k = (2 * x - y);
if (k % 3) {
cout << 0 << "\n";
return 0;
}
k /= 3;
x -= 2 * k;
if (x < 0) {
cout << 0 << "\n";
return 0;
}
cout << C(x + k, k);
}
| #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define M 1000000007
#define sz(a) (ll) a.size()
#define pll pair<ll, ll>
#define rep(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define sep(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
#define mll map<ll, ll>
#define vl vector<ll>
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define F first
#define S second
using namespace __gnu_pbds;
using namespace std;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
int binpow(int a, int b, int mod) {
int ans = 1;
while (b) {
if (b & 1)
ans = (ans * 1LL * a) % mod;
a = (a * 1LL * a) % mod;
b >>= 1;
}
return ans;
}
const ll P = 2000005;
ll fact[P], inv[P];
void preprocess() {
fact[0] = 1;
rep(i, 1, P) fact[i] = (i * fact[i - 1]) % M;
inv[P - 1] = binpow(fact[P - 1], M - 2, M);
sep(i, P - 2, 0) inv[i] = (inv[i + 1] * (i + 1)) % M;
}
ll C(ll n, ll r) { return (((fact[n] * inv[r]) % M) * inv[n - r]) % M; }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
preprocess();
ll x, y;
cin >> x >> y;
ll k = (2 * x - y);
if (k % 3 or k < 0) {
cout << 0 << "\n";
return 0;
}
k /= 3;
x -= 2 * k;
if (x < 0) {
cout << 0 << "\n";
return 0;
}
cout << C(x + k, k);
}
| replace | 49 | 50 | 49 | 50 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define print(x) cout << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
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 comb(int n, int r) {
if (n - r < r)
r = n - r;
if (r == 0)
return 1;
if (r == 1)
return n;
vector<mint> numerator(r, 0), denominator(r, 0);
for (int k = 0; k < r; k++) {
numerator[k] = n - r + k + 1;
denominator[k] = k + 1;
}
for (int p = 2; p < r + 1; p++) {
mint pivot = denominator[p - 1];
if (pivot.x > 1) {
int offset = (n - r) % p;
for (int k = p - 1; k < r; k += p) {
numerator[k - offset] /= pivot;
denominator[k] /= pivot;
}
}
}
mint res = 1;
for (int k = 0; k < r; k++) {
if (numerator[k].x > 1) {
res *= numerator[k];
}
}
return res;
}
int main() {
ll x, y;
cin >> x >> y;
ll b = (2 * x - y) / 3;
ll a = x - 2 * b;
mint ans = comb(a + b, a);
if ((a + 2 * b != x) | (2 * a + b != y))
ans = 0;
cout << ans.x << endl;
return 0;
} | #include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define srep(i, s, t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(), a.end()
#define rrng(a) a.rbegin(), a.rend()
#define maxs(x, y) (x = max(x, y))
#define mins(x, y) (x = min(x, y))
#define limit(x, l, r) max(l, min(x, r))
#define lims(x, l, r) (x = max(l, min(x, r)))
#define isin(x, l, r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)), x.end())
#define show(x) cout << #x << " = " << x << endl;
#define print(x) cout << x << endl;
#define PQ(T) priority_queue<T, v(T), greater<T>>
#define bn(x) ((1 << x) - 1)
#define dup(x, y) (((x) + (y)-1) / (y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef tuple<int, int, int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
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 comb(int n, int r) {
if (n - r < r)
r = n - r;
if (r == 0)
return 1;
if (r == 1)
return n;
vector<mint> numerator(r, 0), denominator(r, 0);
for (int k = 0; k < r; k++) {
numerator[k] = n - r + k + 1;
denominator[k] = k + 1;
}
for (int p = 2; p < r + 1; p++) {
mint pivot = denominator[p - 1];
if (pivot.x > 1) {
int offset = (n - r) % p;
for (int k = p - 1; k < r; k += p) {
numerator[k - offset] /= pivot;
denominator[k] /= pivot;
}
}
}
mint res = 1;
for (int k = 0; k < r; k++) {
if (numerator[k].x > 1) {
res *= numerator[k];
}
}
return res;
}
int main() {
ll x, y;
cin >> x >> y;
ll b = (2 * x - y) / 3;
ll a = x - 2 * b;
mint ans = 0;
if (a >= 0 and b >= 0)
ans = comb(a + b, a);
if ((a + 2 * b != x) | (2 * a + b != y))
ans = 0;
cout << ans.x << endl;
return 0;
} | replace | 126 | 127 | 126 | 129 | 0 | |
p02862 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int mod = int(1e9) + 7;
int fact(int n) {
if (n == 0)
return 1;
return ((long)n * (long)fact(n - 1)) % mod;
}
int pow(int n, int i) {
long s = pow(n, i / 2);
if (i % 2 == 0) {
return (s * s) % mod;
} else {
return (((s * s) % mod) * (long)n) % mod;
}
}
int comb(int n, int r) {
if (r < 0 || r > n)
return 0;
long nf = fact(n), rf = fact(r), rnf = fact(n - r);
return (((nf * pow(rf, mod - 2)) % mod) * pow(rnf, mod - 2)) % mod;
}
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0;
return 0;
}
int n = (x + y) / 3;
cout << comb(n, x - n);
return 0;
} | #include <iostream>
using namespace std;
const int mod = int(1e9) + 7;
int fact(int n) {
if (n == 0)
return 1;
return ((long)n * (long)fact(n - 1)) % mod;
}
int pow(int n, int i) {
if (i == 0)
return 1;
long s = pow(n, i / 2);
if (i % 2 == 0) {
return (s * s) % mod;
} else {
return (((s * s) % mod) * (long)n) % mod;
}
}
int comb(int n, int r) {
if (r < 0 || r > n)
return 0;
long nf = fact(n), rf = fact(r), rnf = fact(n - r);
return (((nf * pow(rf, mod - 2)) % mod) * pow(rnf, mod - 2)) % mod;
}
int main() {
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << 0;
return 0;
}
int n = (x + y) / 3;
cout << comb(n, x - n);
return 0;
}
| insert | 12 | 12 | 12 | 14 | -11 | |
p02862 | C++ | Runtime Error | // #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define ld long double
#define pi pair<int, int>
#define pd pair<ld, ld>
#define ft first
#define sd second
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define F(i, a, b) FOR(i, (a), (b)-1)
#define REV(i, a, b) for (int i = (a); i >= (b); i--)
#define VI vector<int>
#define VPI vector<pi>
#define VPD vector<pd>
#define PI 3.14159265
#define all(x) (x).begin(), (x).end()
#define sz(a) (int)((a).size())
#define int long long
template <class TH> void _dbg(const char *sdbg, TH h) {
cerr << sdbg << "=" << h << "\n";
}
template <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while (*sdbg != ',')
cerr << *sdbg++;
cerr << "=" << h << ",";
_dbg(sdbg + 1, a...);
}
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
mt19937 r(chrono::steady_clock::now().time_since_epoch().count());
int rand_range(int a, int b) {
assert(a <= b);
return a + r() % (b - a + 1);
}
const long long K = 1000;
const long long KK = K * K;
const long long MIL = KK * K;
const long long INF = MIL * MIL;
const long long MOD = MIL + 7;
const long long N = 1e6 + 10, M = 10;
int silnia[N], odsilnia[N];
int dwumian(int a, int b) {
return (((silnia[a] * odsilnia[b]) % MOD) * odsilnia[a - b]) % MOD;
}
int pot(int x, int p) {
int tmp = 1;
for (; p; p /= 2, x = (x * x) % MOD) {
if (p & 1)
tmp = (tmp * x) % MOD;
}
return tmp;
}
void solve() {
silnia[0] = 1;
F(i, 1, N)
silnia[i] = (silnia[i - 1] * i) % MOD;
odsilnia[N - 1] = pot(silnia[N - 1], MOD - 2);
REV(i, N - 2, 0)
odsilnia[i] = (odsilnia[i + 1] * (i + 1)) % MOD;
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << "0\n";
return;
}
if (y < x)
swap(x, y);
if (2 * x < y) {
cout << "0\n";
return;
}
int ile = (y + x) / 3;
int ile1 = y - x + ile / 2;
// debug(ile1, ile);
cout << dwumian(ile, ile1) << "\n";
}
int32_t main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
cout << setprecision(9) << fixed;
cerr << setprecision(6) << fixed;
int test = 1, f;
// cin>>test;
F(_test, 0, test) {
// cout<<"Case #"<<_test + 1<<": ";
solve();
// if(_test == 1)
// return 0;
}
}
| // #pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define ll long long
#define ld long double
#define pi pair<int, int>
#define pd pair<ld, ld>
#define ft first
#define sd second
#define st first
#define nd second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define F(i, a, b) FOR(i, (a), (b)-1)
#define REV(i, a, b) for (int i = (a); i >= (b); i--)
#define VI vector<int>
#define VPI vector<pi>
#define VPD vector<pd>
#define PI 3.14159265
#define all(x) (x).begin(), (x).end()
#define sz(a) (int)((a).size())
#define int long long
template <class TH> void _dbg(const char *sdbg, TH h) {
cerr << sdbg << "=" << h << "\n";
}
template <class TH, class... TA> void _dbg(const char *sdbg, TH h, TA... a) {
while (*sdbg != ',')
cerr << *sdbg++;
cerr << "=" << h << ",";
_dbg(sdbg + 1, a...);
}
#define debug(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
mt19937 r(chrono::steady_clock::now().time_since_epoch().count());
int rand_range(int a, int b) {
assert(a <= b);
return a + r() % (b - a + 1);
}
const long long K = 1000;
const long long KK = K * K;
const long long MIL = KK * K;
const long long INF = MIL * MIL;
const long long MOD = MIL + 7;
const long long N = 1e6 + 10, M = 10;
int silnia[N], odsilnia[N];
int dwumian(int a, int b) {
return (((silnia[a] * odsilnia[b]) % MOD) * odsilnia[a - b]) % MOD;
}
int pot(int x, int p) {
int tmp = 1;
for (; p; p /= 2, x = (x * x) % MOD) {
if (p & 1)
tmp = (tmp * x) % MOD;
}
return tmp;
}
void solve() {
silnia[0] = 1;
F(i, 1, N)
silnia[i] = (silnia[i - 1] * i) % MOD;
odsilnia[N - 1] = pot(silnia[N - 1], MOD - 2);
REV(i, N - 2, 0)
odsilnia[i] = (odsilnia[i + 1] * (i + 1)) % MOD;
int x, y;
cin >> x >> y;
if ((x + y) % 3 != 0) {
cout << "0\n";
return;
}
if (y < x)
swap(x, y);
if (2 * x < y) {
cout << "0\n";
return;
}
int ile = (y + x) / 3;
int ile1 = y - x + (ile - y + x) / 2;
// debug(ile1, ile);
cout << dwumian(ile, ile1) << "\n";
}
int32_t main() {
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cerr.tie(0);
cout << setprecision(9) << fixed;
cerr << setprecision(6) << fixed;
int test = 1, f;
// cin>>test;
F(_test, 0, test) {
// cout<<"Case #"<<_test + 1<<": ";
solve();
// if(_test == 1)
// return 0;
}
}
| replace | 92 | 93 | 92 | 93 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = (int)1e9 + 7;
int add(int a, int b) {
a += b;
if (a >= MOD) {
return a - MOD;
}
if (a < 0) {
return a + MOD;
}
return a;
}
int mul(int a, int b) { return a * (ll)b % MOD; }
int pw(int a, int b) {
int r = 1;
while (b) {
if (b & 1) {
r = mul(r, a);
}
a = mul(a, a);
b /= 2;
}
return r;
}
const int N = (int)3e6 + 7;
int fact[N];
int comb(int n, int k) {
int x = fact[n];
int y = mul(fact[k], fact[n - k]);
return mul(x, pw(y, MOD - 2));
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = mul(fact[i - 1], i);
}
int x, y;
cin >> x >> y;
int t = x + y;
if (t % 3) {
cout << "0\n";
return 0;
}
t /= 3;
x -= t;
y -= t;
cout << comb(x + y, y) << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = (int)1e9 + 7;
int add(int a, int b) {
a += b;
if (a >= MOD) {
return a - MOD;
}
if (a < 0) {
return a + MOD;
}
return a;
}
int mul(int a, int b) { return a * (ll)b % MOD; }
int pw(int a, int b) {
int r = 1;
while (b) {
if (b & 1) {
r = mul(r, a);
}
a = mul(a, a);
b /= 2;
}
return r;
}
const int N = (int)3e6 + 7;
int fact[N];
int comb(int n, int k) {
int x = fact[n];
int y = mul(fact[k], fact[n - k]);
return mul(x, pw(y, MOD - 2));
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = mul(fact[i - 1], i);
}
int x, y;
cin >> x >> y;
int t = x + y;
if (t % 3) {
cout << "0\n";
return 0;
}
t /= 3;
x -= t;
y -= t;
if (x < 0 || y < 0) {
cout << "0\n";
return 0;
}
cout << comb(x + y, y) << "\n";
}
| insert | 61 | 61 | 61 | 65 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define res register int
#define ll long long
// #define cccgift
// #define
// getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
// char buf[1<<21],*p1=buf,*p2=buf;
template <typename T> inline void read(T &x) {
static char ch;
bool f = 1;
for (x = 0, ch = getchar(); !isdigit(ch); ch = getchar())
if (ch == '-')
f = 0;
for (; isdigit(ch); x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar())
;
x = f ? x : -x;
}
template <typename T> void print(T x) {
if (x < 0)
x = -x, putchar('-');
if (x > 9)
print(x / 10);
putchar(x % 10 + 48);
}
template <typename T> inline void print(T x, char ap) {
print(x);
if (ap)
putchar(ap);
}
template <typename T> inline void chkmax(T &x, const T &y) {
x = x < y ? y : x;
}
template <typename T> inline void chkmin(T &x, const T &y) {
x = x < y ? x : y;
}
const int mod = 1e9 + 7;
int n, m, fac[2000001], inv[2000001];
inline int C(int x, int y) {
return (ll)fac[x] * inv[y] % mod * inv[x - y] % mod;
}
inline int kuai(int p, int q, int mod) {
int tot = 1;
for (; q; p = (ll)p * p % mod, q >>= 1)
if (q & 1)
tot = (ll)tot * p % mod;
return tot;
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
if ((2 * n - m) % 3 || (2 * m - n) % 3)
return cout << 0 << '\n', 0;
int now1 = (2 * n - m) / 3, now2 = (2 * m - n) / 3, now = now1 + now2;
fac[0] = 1;
for (res i = 1; i <= now; ++i)
fac[i] = (ll)fac[i - 1] * i % mod;
inv[now] = kuai(fac[now], mod - 2, mod);
for (res i = now - 1; ~i; --i)
inv[i] = (ll)inv[i + 1] * (i + 1) % mod;
cout << C(now1 + now2, now1) << '\n';
cout << flush;
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do something instead of nothing and stay organized
*/ | #include <bits/stdc++.h>
using namespace std;
#define res register int
#define ll long long
// #define cccgift
// #define
// getchar()(p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
// char buf[1<<21],*p1=buf,*p2=buf;
template <typename T> inline void read(T &x) {
static char ch;
bool f = 1;
for (x = 0, ch = getchar(); !isdigit(ch); ch = getchar())
if (ch == '-')
f = 0;
for (; isdigit(ch); x = (x << 1) + (x << 3) + (ch ^ 48), ch = getchar())
;
x = f ? x : -x;
}
template <typename T> void print(T x) {
if (x < 0)
x = -x, putchar('-');
if (x > 9)
print(x / 10);
putchar(x % 10 + 48);
}
template <typename T> inline void print(T x, char ap) {
print(x);
if (ap)
putchar(ap);
}
template <typename T> inline void chkmax(T &x, const T &y) {
x = x < y ? y : x;
}
template <typename T> inline void chkmin(T &x, const T &y) {
x = x < y ? x : y;
}
const int mod = 1e9 + 7;
int n, m, fac[2000001], inv[2000001];
inline int C(int x, int y) {
return (ll)fac[x] * inv[y] % mod * inv[x - y] % mod;
}
inline int kuai(int p, int q, int mod) {
int tot = 1;
for (; q; p = (ll)p * p % mod, q >>= 1)
if (q & 1)
tot = (ll)tot * p % mod;
return tot;
}
int main() {
ios::sync_with_stdio(false);
cin >> n >> m;
if ((2 * n - m) % 3 || (2 * m - n) % 3 || 2 * m - n < 0 || 2 * n - m < 0)
return cout << 0 << '\n', 0;
int now1 = (2 * n - m) / 3, now2 = (2 * m - n) / 3, now = now1 + now2;
fac[0] = 1;
for (res i = 1; i <= now; ++i)
fac[i] = (ll)fac[i - 1] * i % mod;
inv[now] = kuai(fac[now], mod - 2, mod);
for (res i = now - 1; ~i; --i)
inv[i] = (ll)inv[i + 1] * (i + 1) % mod;
cout << C(now1 + now2, now1) << '\n';
cout << flush;
return 0;
}
/* stuff you should look for
* int overflow, array bounds
* special cases (n=1?), set tle
* do something instead of nothing and stay organized
*/ | replace | 51 | 52 | 51 | 52 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int add(int a, int b) { return a + b - mod * (a + b >= mod); }
int mul(int a, int b) { return int(1ll * a * b % mod); }
int power(int a, int x) {
if (x == 0) {
return 1;
}
return mul(power(mul(a, a), x >> 1), (x & 1 ? a : 1));
}
int divide(int a, int b) { return mul(a, power(b, mod - 2)); }
int sub(int a, int b) { return a - b + mod * (a < b); }
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int x, y;
cin >> x >> y;
if (x > y) {
swap(x, y);
}
if ((2 * y - x) % 3) {
cout << 0;
return 0;
}
int b = (2 * y - x) / 3;
int a = y - 2 * b;
vector<int> f(a + b + 1);
f[0] = 1;
for (int i = 1; i <= a + b; ++i) {
f[i] = mul(f[i - 1], i);
}
cout << divide(f[a + b], mul(f[a], f[b]));
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int add(int a, int b) { return a + b - mod * (a + b >= mod); }
int mul(int a, int b) { return int(1ll * a * b % mod); }
int power(int a, int x) {
if (x == 0) {
return 1;
}
return mul(power(mul(a, a), x >> 1), (x & 1 ? a : 1));
}
int divide(int a, int b) { return mul(a, power(b, mod - 2)); }
int sub(int a, int b) { return a - b + mod * (a < b); }
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
int x, y;
cin >> x >> y;
if (x > y) {
swap(x, y);
}
if ((2 * y - x) % 3) {
cout << 0;
return 0;
}
int b = (2 * y - x) / 3;
int a = y - 2 * b;
if (a < 0) {
cout << 0;
return 0;
}
vector<int> f(a + b + 1);
f[0] = 1;
for (int i = 1; i <= a + b; ++i) {
f[i] = mul(f[i - 1], i);
}
cout << divide(f[a + b], mul(f[a], f[b]));
return 0;
} | insert | 36 | 36 | 36 | 40 | 0 | |
p02862 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <vector>
using namespace std;
static const int INF = 1e9 + 7;
vector<long long> fact;
vector<long long> revfact;
long long powMod(long long x, int k) {
if (k == 0)
return 1;
if (k % 2 == 0)
return powMod(x * x % INF, k / 2);
else
return x * powMod(x, k - 1) % INF;
}
void setfact(int N) {
fact.resize(N + 1);
revfact.resize(N + 1);
fact[0] = 1;
for (int i = 1; i < N + 1; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= INF;
}
revfact[N] = powMod(fact[N], INF - 2);
for (int i = N - 1; i >= 0; i--) {
revfact[i] = revfact[i + 1] * (i + 1);
revfact[i] %= INF;
}
}
long long getC(int a, int b) {
return (((fact[a] * revfact[b]) % INF) * revfact[a - b]) % INF;
}
int main() {
long long x, y;
cin >> x >> y;
long long a = 2 * y - x, b = 2 * x - y;
if (a % 3 || b % 3) {
cout << 0 << "\n";
return 0;
}
a /= 3;
b /= 3;
setfact(a + b + 15);
cout << getC(a + b, a) << "\n";
} | #include <iostream>
#include <map>
#include <vector>
using namespace std;
static const int INF = 1e9 + 7;
vector<long long> fact;
vector<long long> revfact;
long long powMod(long long x, int k) {
if (k == 0)
return 1;
if (k % 2 == 0)
return powMod(x * x % INF, k / 2);
else
return x * powMod(x, k - 1) % INF;
}
void setfact(int N) {
fact.resize(N + 1);
revfact.resize(N + 1);
fact[0] = 1;
for (int i = 1; i < N + 1; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= INF;
}
revfact[N] = powMod(fact[N], INF - 2);
for (int i = N - 1; i >= 0; i--) {
revfact[i] = revfact[i + 1] * (i + 1);
revfact[i] %= INF;
}
}
long long getC(int a, int b) {
return (((fact[a] * revfact[b]) % INF) * revfact[a - b]) % INF;
}
int main() {
long long x, y;
cin >> x >> y;
long long a = 2 * y - x, b = 2 * x - y;
if (a < 0 || b < 0 || a % 3 || b % 3) {
cout << 0 << "\n";
return 0;
}
a /= 3;
b /= 3;
setfact(a + b + 15);
cout << getC(a + b, a) << "\n";
} | replace | 42 | 43 | 42 | 43 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e7 + 5;
const ll mod = 1e9 + 7;
ll fct[N], inv[N], invfct[N];
void init() {
fct[0] = fct[1] = 1;
inv[1] = 1;
invfct[0] = invfct[1] = 1;
for (ll i = 2; i < N; i++) {
fct[i] = i * fct[i - 1] % mod;
inv[i] = ll(mod - inv[mod % i]) * (mod / i) % mod;
invfct[i] = ll(inv[i]) * invfct[i - 1] % mod;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
init();
ll x, y;
cin >> x >> y;
if ((x + y) % 3)
return cout << 0, 0;
if (x > y)
swap(x, y);
ll n = (x + y) / 3;
ll r = (2 * x - y) / 3;
if (r > n)
return cout << 0, 0;
cout << ((fct[n] * invfct[r]) % mod * invfct[n - r]) % mod;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e7 + 5;
const ll mod = 1e9 + 7;
ll fct[N], inv[N], invfct[N];
void init() {
fct[0] = fct[1] = 1;
inv[1] = 1;
invfct[0] = invfct[1] = 1;
for (ll i = 2; i < N; i++) {
fct[i] = i * fct[i - 1] % mod;
inv[i] = ll(mod - inv[mod % i]) * (mod / i) % mod;
invfct[i] = ll(inv[i]) * invfct[i - 1] % mod;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
init();
ll x, y;
cin >> x >> y;
if ((x + y) % 3)
return cout << 0, 0;
if (x > y)
swap(x, y);
ll n = (x + y) / 3;
ll r = (2 * x - y) / 3;
if (r > n || r < 0)
return cout << 0, 0;
cout << ((fct[n] * invfct[r]) % mod * invfct[n - r]) % mod;
}
| replace | 30 | 31 | 30 | 31 | -11 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
// const ll mod = 998244353;
const ll mod = 1000000007;
const int MX = 1000000;
ll power(ll x, ll y, ll p) {
ll res = 1ll;
x = x % p;
while (y) {
if (y & 1ll)
res = (res * x) % p;
y = y >> 1ll;
x = (x * x) % p;
}
return res;
}
int modInverse(int n, int p) { return power(n, p - 2, p); }
int fac[MX + 1];
int C(int n, int r, int p) {
if (r == 0)
return 1;
return fac[n] * (modInverse(fac[r], p) * modInverse(fac[n - r], p) % p) % p;
}
void init(int p) {
fac[0] = 1;
for (int i = 1; i <= MX; i++)
fac[i] = fac[i - 1] * i % p;
}
signed main() {
int x, y;
cin >> x >> y;
int n = (x + y) / 3;
if ((x + y) % 3)
return cout << 0, 0;
init(mod);
x -= n;
y -= n;
cout << C(x + y, min(x, y), mod);
} | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
// const ll mod = 998244353;
const ll mod = 1000000007;
const int MX = 1000000;
ll power(ll x, ll y, ll p) {
ll res = 1ll;
x = x % p;
while (y) {
if (y & 1ll)
res = (res * x) % p;
y = y >> 1ll;
x = (x * x) % p;
}
return res;
}
int modInverse(int n, int p) { return power(n, p - 2, p); }
int fac[MX + 1];
int C(int n, int r, int p) {
if (r == 0)
return 1;
return fac[n] * (modInverse(fac[r], p) * modInverse(fac[n - r], p) % p) % p;
}
void init(int p) {
fac[0] = 1;
for (int i = 1; i <= MX; i++)
fac[i] = fac[i - 1] * i % p;
}
signed main() {
int x, y;
cin >> x >> y;
int n = (x + y) / 3;
if ((x + y) % 3)
return cout << 0, 0;
init(mod);
x -= n;
y -= n;
if (x < 0 || y < 0)
return cout << 0, 0;
cout << C(x + y, min(x, y), mod);
} | insert | 41 | 41 | 41 | 43 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define endl '\n'
#define debug(X) cout << #X << " = " << X << endl
using namespace std;
const int MN = 1000010;
const int MD = 1e9 + 7;
long long fact[MN];
long long fastExp(long long b, long long e) {
long long ans = 1;
while (e > 0) {
if (e & 1)
ans = (ans * b) % MD;
b = (b * b) % MD;
e >>= 1;
}
return ans;
}
int comb(int a, int b) {
long long p = fact[a];
long long q = (fact[b] * fact[a - b]) % MD;
return (p * fastExp(q, MD - 2)) % MD;
}
int solve(int x, int y) {
if ((x + y) % 3)
return 0;
int n = (x + y) / 3;
if (2 * n - x < 0)
return 0;
return comb(n, 2 * n - x);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifdef UTP
freopen("input.txt", "r", stdin);
#endif
fact[0] = 1;
for (int i = 1; i < MN; i++)
fact[i] = (fact[i - 1] * i) % MD;
int x, y;
cin >> x >> y;
int ans = solve(x, y);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define endl '\n'
#define debug(X) cout << #X << " = " << X << endl
using namespace std;
const int MN = 1000010;
const int MD = 1e9 + 7;
long long fact[MN];
long long fastExp(long long b, long long e) {
long long ans = 1;
while (e > 0) {
if (e & 1)
ans = (ans * b) % MD;
b = (b * b) % MD;
e >>= 1;
}
return ans;
}
int comb(int a, int b) {
long long p = fact[a];
long long q = (fact[b] * fact[a - b]) % MD;
return (p * fastExp(q, MD - 2)) % MD;
}
int solve(int x, int y) {
if ((x + y) % 3)
return 0;
int n = (x + y) / 3;
if (2 * n - x < 0 || 2 * n - x > n)
return 0;
return comb(n, 2 * n - x);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
#ifdef UTP
freopen("input.txt", "r", stdin);
#endif
fact[0] = 1;
for (int i = 1; i < MN; i++)
fact[i] = (fact[i - 1] * i) % MD;
int x, y;
cin >> x >> y;
int ans = solve(x, y);
cout << ans << endl;
return 0;
}
| replace | 32 | 33 | 32 | 33 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = (ll)1e9 + 7;
vector<long long> fact, fact_inv, inv;
template <typename T> void init_combi(size_t size, const T mod) {
size += 1;
fact.resize(size);
fact_inv.resize(size);
inv.resize(size);
fact[0] = fact[1] = 1;
fact_inv[0] = fact_inv[1] = 1;
inv[1] = 1;
for (int i = 1; i < size - 1; i++) {
fact[i + 1] = fact[i] * (i + 1) % mod;
inv[i + 1] = mod - inv[mod % (i + 1)] * (mod / (i + 1)) % mod;
fact_inv[i + 1] = fact_inv[i] * inv[i + 1] % mod;
}
}
template <typename T> T mod_combi(T n, T k, T mod) {
// return kCn % mod
return fact[n] * (fact_inv[k] * fact_inv[n - k] % mod) % mod;
}
int main() {
int X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
// X = a + 2b
// Y = 2a + b
// A = a + b = (X + Y) / 3
int A = (X + Y) / 3;
// B = a - b = (Y - X)
int B = Y - X;
if ((A + B) % 2 != 0) {
cout << 0 << endl;
return 0;
}
ll a = (A + B) / 2;
if ((A - B) % 2 != 0) {
cout << 0 << endl;
return 0;
}
ll b = (A - B) / 2;
init_combi((size_t)a + b, MOD);
cout << mod_combi(a + b, a, MOD) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll MOD = (ll)1e9 + 7;
vector<long long> fact, fact_inv, inv;
template <typename T> void init_combi(size_t size, const T mod) {
size += 1;
fact.resize(size);
fact_inv.resize(size);
inv.resize(size);
fact[0] = fact[1] = 1;
fact_inv[0] = fact_inv[1] = 1;
inv[1] = 1;
for (int i = 1; i < size - 1; i++) {
fact[i + 1] = fact[i] * (i + 1) % mod;
inv[i + 1] = mod - inv[mod % (i + 1)] * (mod / (i + 1)) % mod;
fact_inv[i + 1] = fact_inv[i] * inv[i + 1] % mod;
}
}
template <typename T> T mod_combi(T n, T k, T mod) {
// return kCn % mod
return fact[n] * (fact_inv[k] * fact_inv[n - k] % mod) % mod;
}
int main() {
int X, Y;
cin >> X >> Y;
if ((X + Y) % 3 != 0) {
cout << 0 << endl;
return 0;
}
// X = a + 2b
// Y = 2a + b
// A = a + b = (X + Y) / 3
int A = (X + Y) / 3;
// B = a - b = (Y - X)
int B = Y - X;
if ((A + B) % 2 != 0) {
cout << 0 << endl;
return 0;
}
ll a = (A + B) / 2;
if ((A - B) % 2 != 0) {
cout << 0 << endl;
return 0;
}
ll b = (A - B) / 2;
if (a < 0 || b < 0) {
cout << 0 << endl;
return 0;
}
init_combi((size_t)a + b, MOD);
cout << mod_combi(a + b, a, MOD) << endl;
}
| insert | 50 | 50 | 50 | 54 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const ll MOD = 1e9 + 7;
const int MAX = 100100;
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();
ll x, y;
cin >> x >> y;
ll over = 2 * x - y;
// a->1,2 b->2,1
if (over % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll a, b;
b = over / 3;
a = x - b * 2;
ll ans = COM(a + b, a);
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define _USE_MATH_DEFINES
#include <algorithm>
#include <math.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define print(s) cout << s << endl
#define acc(v) accumulate(v.begin(), v.end(), 0)
using namespace std;
typedef long long ll;
const int INF = 1e9;
const ll LINF = 1e18;
const ll MOD = 1e9 + 7;
const int MAX = 2000100;
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();
ll x, y;
cin >> x >> y;
ll over = 2 * x - y;
// a->1,2 b->2,1
if (over % 3 != 0) {
cout << 0 << endl;
return 0;
}
ll a, b;
b = over / 3;
a = x - b * 2;
ll ans = COM(a + b, a);
cout << ans << endl;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
const long long MOD = 1000000007;
ll f[1010101], rf[1010101];
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;
for (ll i = 1; i < 1010101; i++)
f[i] = (f[i - 1] * i) % MOD;
for (ll i = 0; i < 1010101; i++)
rf[i] = inv(f[i]);
}
//---------------------------------------------------------------------------------------------------
ll C(int n, int k) {
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;
}
void solve(long long X, long long Y) {
init();
if ((2 * X - Y) % 3 != 0) {
std::cout << 0 << std::endl;
return;
}
ll n = (2 * X - Y) / 3;
std::cout << C(X - n, n) << std::endl;
}
int main() {
long long X;
scanf("%lld", &X);
long long Y;
scanf("%lld", &Y);
solve(X, Y);
return 0;
}
| #include <algorithm>
#include <climits>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
using ll = long long int;
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto i = v.begin(); i != v.end(); i++) {
os << *i << " ";
}
return os;
}
const long long MOD = 1000000007;
ll f[1010101], rf[1010101];
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;
for (ll i = 1; i < 1010101; i++)
f[i] = (f[i - 1] * i) % MOD;
for (ll i = 0; i < 1010101; i++)
rf[i] = inv(f[i]);
}
//---------------------------------------------------------------------------------------------------
ll C(int n, int k) {
if (k < 0 or n < k)
return 0;
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;
}
void solve(long long X, long long Y) {
init();
if ((2 * X - Y) % 3 != 0) {
std::cout << 0 << std::endl;
return;
}
ll n = (2 * X - Y) / 3;
std::cout << C(X - n, n) << std::endl;
}
int main() {
long long X;
scanf("%lld", &X);
long long Y;
scanf("%lld", &Y);
solve(X, Y);
return 0;
}
| insert | 44 | 44 | 44 | 46 | 0 | |
p02862 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
// #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int mod = 1e9 + 7;
const int N = 2e6 + 5;
long long fac[N];
long long inv[N];
long long quickmod(long long a, long long b) {
long long ans = 1;
while (b) {
if (b % 2 == 1)
ans = ans * a % mod;
a = a * a % mod;
b = b / 2;
}
return ans;
}
inline long long C(int n, int m) {
return fac[n] * inv[m] % mod * inv[n - m] % mod;
}
int main() {
int n, m;
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = fac[i - 1] * i % mod;
inv[N - 1] = quickmod(fac[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--)
inv[i] = inv[i + 1] * (i + 1) % mod;
while (cin >> n >> m) {
int a = n, b = 0;
while (2 * a + b > m) {
a -= 2;
b++;
}
if (a + b * 2 != n || a * 2 + b != m) {
printf("0\n");
continue;
}
printf("%lld\n", C(a + b, a));
}
return 0;
} | #include <algorithm>
#include <deque>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stdio.h>
#include <string.h>
#include <string>
#include <vector>
// #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const int mod = 1e9 + 7;
const int N = 2e6 + 5;
long long fac[N];
long long inv[N];
long long quickmod(long long a, long long b) {
long long ans = 1;
while (b) {
if (b % 2 == 1)
ans = ans * a % mod;
a = a * a % mod;
b = b / 2;
}
return ans;
}
inline long long C(int n, int m) {
return fac[n] * inv[m] % mod * inv[n - m] % mod;
}
int main() {
int n, m;
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = fac[i - 1] * i % mod;
inv[N - 1] = quickmod(fac[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--)
inv[i] = inv[i + 1] * (i + 1) % mod;
while (cin >> n >> m) {
int a = n, b = 0;
while (2 * a + b > m) {
a -= 2;
b++;
}
if (a + b * 2 != n || a * 2 + b != m || a + b <= 0 || a < 0 || b < 0) {
printf("0\n");
continue;
}
printf("%lld\n", C(a + b, a));
}
return 0;
} | replace | 47 | 48 | 47 | 48 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mins(x, y) (x = min(x, y))
#define maxs(x, y) (x = max(x, y))
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
struct mint {
ll v;
mint() : v(0) {}
mint(ll v) : v((v % MOD + MOD) % MOD) {}
operator ll() const { return v; }
mint pow(ll t) const;
mint inv() const;
};
mint &operator+=(mint &a, mint b) { return a = a.v + b.v; }
mint &operator-=(mint &a, mint b) { return a = a.v - b.v; }
mint &operator*=(mint &a, mint b) { return a = a.v * b.v; }
mint operator+(mint a, mint b) { return a += b; }
mint operator-(mint a, mint b) { return a -= b; }
mint operator*(mint a, mint b) { return a *= b; }
mint operator-(mint a) { return (mint)0 - a; }
mint &operator/=(mint &a, mint b) { return a *= b.inv(); }
mint operator/(mint a, mint b) { return a /= b; }
mint mint::pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint mint::inv() const { return pow(MOD - 2); }
bool operator==(mint a, mint b) { return a.v == b.v; }
bool operator!=(mint a, mint b) { return a.v != b.v; }
istream &operator>>(istream &os, mint &a) { return (os >> a.v); }
ostream &operator<<(ostream &os, const mint &a) { return (os << a.v); }
mint mfact(ll n) { // n! (mod MOD)
// mint fact = 1;
// for (ll i = 2; i <= n; i++) fact = fact * (mint)i;
// return fact;
static vector<mint> fact(1, 1);
int pn = fact.size();
if (pn < n + 1) {
fact.resize(n + 1);
for (int i = pn; i <= n; i++)
fact[i] = fact[i - 1] * (mint)i;
}
return fact[n];
}
mint nPk(int n, int k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (k == 0)
return 1;
return mfact(n) * mfact(n - k).inv();
}
mint nCk(int n, int k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (k == 0)
return 1;
return mfact(n) * mfact(k).inv() * mfact(n - k).inv();
}
void solve() {
ll x, y;
cin >> x >> y;
ll a, b;
if ((x * 2 - y) % 3 != 0 || (y * 2 - x) % 3 != 0) {
cout << 0 << endl;
return;
}
a = (x * 2 - y) / 3;
b = (y * 2 - x) / 3;
if (a == 0 || b == 0) {
cout << 1 << endl;
return;
}
mint ans = mfact(a + b) * mfact(a).inv() * mfact(b).inv();
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
// freopen("temp.1", "r", stdin);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mins(x, y) (x = min(x, y))
#define maxs(x, y) (x = max(x, y))
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
struct mint {
ll v;
mint() : v(0) {}
mint(ll v) : v((v % MOD + MOD) % MOD) {}
operator ll() const { return v; }
mint pow(ll t) const;
mint inv() const;
};
mint &operator+=(mint &a, mint b) { return a = a.v + b.v; }
mint &operator-=(mint &a, mint b) { return a = a.v - b.v; }
mint &operator*=(mint &a, mint b) { return a = a.v * b.v; }
mint operator+(mint a, mint b) { return a += b; }
mint operator-(mint a, mint b) { return a -= b; }
mint operator*(mint a, mint b) { return a *= b; }
mint operator-(mint a) { return (mint)0 - a; }
mint &operator/=(mint &a, mint b) { return a *= b.inv(); }
mint operator/(mint a, mint b) { return a /= b; }
mint mint::pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint mint::inv() const { return pow(MOD - 2); }
bool operator==(mint a, mint b) { return a.v == b.v; }
bool operator!=(mint a, mint b) { return a.v != b.v; }
istream &operator>>(istream &os, mint &a) { return (os >> a.v); }
ostream &operator<<(ostream &os, const mint &a) { return (os << a.v); }
mint mfact(ll n) { // n! (mod MOD)
// mint fact = 1;
// for (ll i = 2; i <= n; i++) fact = fact * (mint)i;
// return fact;
static vector<mint> fact(1, 1);
int pn = fact.size();
if (pn < n + 1) {
fact.resize(n + 1);
for (int i = pn; i <= n; i++)
fact[i] = fact[i - 1] * (mint)i;
}
return fact[n];
}
mint nPk(int n, int k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (k == 0)
return 1;
return mfact(n) * mfact(n - k).inv();
}
mint nCk(int n, int k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (k == 0)
return 1;
return mfact(n) * mfact(k).inv() * mfact(n - k).inv();
}
void solve() {
ll x, y;
cin >> x >> y;
ll a, b;
if ((x * 2 - y) % 3 != 0 || (y * 2 - x) % 3 != 0) {
cout << 0 << endl;
return;
}
a = (x * 2 - y) / 3;
b = (y * 2 - x) / 3;
if (a < 0 || b < 0) {
cout << 0 << endl;
return;
}
if (a == 0 || b == 0) {
cout << 1 << endl;
return;
}
mint ans = mfact(a + b) * mfact(a).inv() * mfact(b).inv();
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
// freopen("temp.1", "r", stdin);
solve();
return 0;
} | insert | 93 | 93 | 93 | 97 | 0 | |
p02862 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 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() {
ll x, y;
cin >> x >> y;
ll ans = 0;
COMinit();
// 計算例
// cout << COM(100000, 50000) << endl;
for (ll i = 0; i <= x; i++) {
ll nexy = x - i;
// cout <<ans<<i<<endl;
if (nexy % 2 != 0) {
continue;
}
ll zany = y - i * 2;
if (zany < 0) {
continue;
}
if (zany == nexy / 2) {
ans += COM(zany + i, i);
ans %= inf;
}
}
cout << ans;
// your code goes here
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
const int MAX = 1100000;
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() {
ll x, y;
cin >> x >> y;
ll ans = 0;
COMinit();
// 計算例
// cout << COM(100000, 50000) << endl;
for (ll i = 0; i <= x; i++) {
ll nexy = x - i;
// cout <<ans<<i<<endl;
if (nexy % 2 != 0) {
continue;
}
ll zany = y - i * 2;
if (zany < 0) {
continue;
}
if (zany == nexy / 2) {
ans += COM(zany + i, i);
ans %= inf;
}
}
cout << ans;
// your code goes here
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02862 | C++ | Runtime Error | #pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2")
#include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (int i = (N)-1; i >= 0; i--)
#define rep1(i, N) for (int i = 1; i <= (N); i++)
#define repr1(i, N) for (int i = (N); i > 0; i--)
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define vrep(v, it) for (auto it = v.begin(); it != v.end(); it++)
#define vrepr(v, it) for (auto it = v.rbegin(); it != v.rend(); it++)
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
using namespace std;
void solve();
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {
IoSetupNya() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(7);
}
} iosetupnya;
template <typename T, typename U> inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U> inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
rep(i, s) os << (i ? " " : "") << v[i];
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...) \
do { \
cerr << #__VA_ARGS__ << " = "; \
dbg_out(__VA_ARGS__); \
} while (0)
#define trca(v, N) \
do { \
cerr << #v << " = "; \
array_out(v, N); \
cout << endl; \
} while (0)
#else
#define trc(...)
#define trca(...)
int main() { solve(); }
#endif
using P = pair<double, double>;
using vp = vector<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;
////////////////
vector<ll> fac, finv, inv;
void COMinit(int MAX) {
MAX++;
fac.resize(MAX, 0);
finv.resize(MAX, 0);
inv.resize(MAX, 0);
fac[0] = fac[1] = finv[0] = finv[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;
}
}
// nCk combination
inline long long COM(int n, int k) {
if (n < k || k < 0 || n < 0)
return 0;
else
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// nPk permutation
inline long long PER(int n, int k) {
if (n < k || k < 0 || n < 0)
return 0;
else
return (fac[n] * finv[n - k]) % MOD;
}
// nHk homogeneous polynomial
inline long long HGP(int n, int k) {
if (n == 0 && k == 0)
return 1; // 問題依存?
else if (n < 1 || k < 0)
return 0;
else
return fac[n + k - 1] * (finv[k] * finv[n - 1] % MOD) % MOD;
}
void solve() {
COMinit(3003003);
inl(X, Y);
if ((X + Y) % 3)
die(0);
ll z = (X + Y) / 3;
ll a = X - z;
ll b = Y - z;
out(COM(a + b, a));
}
| #include <bits/stdc++.h>
#define whlie while
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define rep(i, N) for (int i = 0; i < (N); i++)
#define repr(i, N) for (int i = (N)-1; i >= 0; i--)
#define rep1(i, N) for (int i = 1; i <= (N); i++)
#define repr1(i, N) for (int i = (N); i > 0; i--)
#define each(x, v) for (auto &x : v)
#define all(v) (v).begin(), (v).end()
#define sz(v) ((int)(v).size())
#define vrep(v, it) for (auto it = v.begin(); it != v.end(); it++)
#define vrepr(v, it) for (auto it = v.rbegin(); it != v.rend(); it++)
#define ini(...) \
int __VA_ARGS__; \
in(__VA_ARGS__)
#define inl(...) \
ll __VA_ARGS__; \
in(__VA_ARGS__)
#define ins(...) \
string __VA_ARGS__; \
in(__VA_ARGS__)
using namespace std;
void solve();
using ll = long long;
using vl = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
constexpr int inf = 1001001001;
constexpr ll infLL = (1LL << 61) - 1;
struct IoSetupNya {
IoSetupNya() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
cerr << fixed << setprecision(7);
}
} iosetupnya;
template <typename T, typename U> inline bool amin(T &x, U y) {
return (y < x) ? (x = y, true) : false;
}
template <typename T, typename U> inline bool amax(T &x, U y) {
return (x < y) ? (x = y, true) : false;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.first << " " << p.second;
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
int s = (int)v.size();
rep(i, s) os << (i ? " " : "") << v[i];
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
void in() {}
template <typename T, class... U> void in(T &t, U &...u) {
cin >> t;
in(u...);
}
void out() { cout << "\n"; }
template <typename T, class... U> void out(const T &t, const U &...u) {
cout << t;
if (sizeof...(u))
cout << " ";
out(u...);
}
template <typename T> void die(T x) {
out(x);
exit(0);
}
#ifdef NyaanDebug
#include "NyaanDebug.h"
#define trc(...) \
do { \
cerr << #__VA_ARGS__ << " = "; \
dbg_out(__VA_ARGS__); \
} while (0)
#define trca(v, N) \
do { \
cerr << #v << " = "; \
array_out(v, N); \
cout << endl; \
} while (0)
#else
#define trc(...)
#define trca(...)
int main() { solve(); }
#endif
using P = pair<double, double>;
using vp = vector<P>;
constexpr int MOD = /**/ 1000000007; //*/ 998244353;
////////////////
vector<ll> fac, finv, inv;
void COMinit(int MAX) {
MAX++;
fac.resize(MAX, 0);
finv.resize(MAX, 0);
inv.resize(MAX, 0);
fac[0] = fac[1] = finv[0] = finv[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;
}
}
// nCk combination
inline long long COM(int n, int k) {
if (n < k || k < 0 || n < 0)
return 0;
else
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// nPk permutation
inline long long PER(int n, int k) {
if (n < k || k < 0 || n < 0)
return 0;
else
return (fac[n] * finv[n - k]) % MOD;
}
// nHk homogeneous polynomial
inline long long HGP(int n, int k) {
if (n == 0 && k == 0)
return 1; // 問題依存?
else if (n < 1 || k < 0)
return 0;
else
return fac[n + k - 1] * (finv[k] * finv[n - 1] % MOD) % MOD;
}
void solve() {
COMinit(3003003);
inl(X, Y);
if ((X + Y) % 3)
die(0);
ll z = (X + Y) / 3;
ll a = X - z;
ll b = Y - z;
out(COM(a + b, a));
}
| delete | 0 | 3 | 0 | 0 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.