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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02780 | Python | Time Limit Exceeded | #!/usr/bin/env python3
n, k, *p = map(int, open(0).read().split())
ans = float()
for i in range(n - k + 1):
ans = max(ans, (sum(p[i : k + i]) + k) / 2)
print(ans)
| #!/usr/bin/env python3
n, k, *P = map(int, open(0).read().split())
p = [(i + 1) / 2 for i in P]
c = sum(p[:k])
ans = c
for i in range(n - k):
c = c + p[i + k] - p[i]
ans = max(c, ans)
print(ans)
| replace | 1 | 5 | 1 | 8 | TLE | |
p02780 | Python | Time Limit Exceeded | n, k = map(int, input().split())
p = list(map(int, input().split()))
M = 0
for i in range(n - k + 1):
s = sum(p[i : i + k])
M = max(M, s)
print((M + k) / 2)
| n, k = map(int, input().split())
p = list(map(int, input().split()))
s = sum(p[:k])
M = s
for i in range(n - k):
s += p[i + k] - p[i]
M = max(M, s)
print((M + k) / 2)
| replace | 2 | 5 | 2 | 6 | TLE | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[200005];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
int xx = 0;
for (int i = 0; i < n - k + 1; ++i) {
int aa = 0;
for (int j = 0; j < k; ++j) {
aa += arr[i + j];
}
if (aa > xx)
xx = aa;
}
// cout<<<<endl;
printf("%.15lf\n", (double)(xx + k) / 2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, k;
cin >> n >> k;
int arr[200005];
for (int i = 0; i < n; ++i) {
cin >> arr[i];
}
int xx = 0;
int aa = 0;
for (int j = 0; j < k; ++j) {
aa += arr[j];
}
xx = aa;
for (int i = 1; i < n - k + 1; ++i) {
aa -= (arr[i - 1] - arr[i + k - 1]);
if (aa > xx)
xx = aa;
}
// cout<<<<endl;
printf("%.15lf\n", (double)(xx + k) / 2);
return 0;
} | replace | 14 | 19 | 14 | 21 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
using P = pair<int, int>;
ll MOD = 1000000007;
ll INF = 1 << 29;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
rep(i, n) cin >> p[i];
int tot = 0;
int omax = -1;
if (k == 1) {
rep(i, n) { omax = max(omax, p[i]); }
double oans = double(omax + 1) / 2;
cout << fixed << setprecision(8) << oans << endl;
return 0;
}
vector<int> s(n);
s[0] = p[0];
rep(i, n - 1) { s[i + 1] = s[i] + p[i + 1]; }
int ma = s[k - 1];
int ans;
for (int i = 1; i + k < n; ++i) {
if (s[i + k] - s[i] > ma) {
ma = s[i + k] - s[i];
ans = i;
}
}
double kita = 0;
for (int i = ans; i < ans + k; ++i) {
kita += (double)(p[i + 1] + 1) / 2;
}
cout << fixed << setprecision(8) << kita << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a, b); }
using P = pair<int, int>;
ll MOD = 1000000007;
ll INF = 1 << 29;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
rep(i, n) cin >> p[i];
int tot = 0;
int omax = -1;
if (k == 1) {
rep(i, n) { omax = max(omax, p[i]); }
double oans = double(omax + 1) / 2;
cout << fixed << setprecision(8) << oans << endl;
return 0;
}
double nans;
if (k == n) {
rep(i, n) { nans += double(p[i] + 1) / 2; }
cout << fixed << setprecision(8) << nans << endl;
return 0;
}
vector<int> s(n);
s[0] = p[0];
rep(i, n - 1) { s[i + 1] = s[i] + p[i + 1]; }
int ma = s[k - 1];
int ans;
for (int i = 1; i + k < n; ++i) {
if (s[i + k] - s[i] > ma) {
ma = s[i + k] - s[i];
ans = i;
}
}
double kita = 0;
for (int i = ans; i < ans + k; ++i) {
kita += (double)(p[i + 1] + 1) / 2;
}
cout << fixed << setprecision(8) << kita << endl;
} | insert | 25 | 25 | 25 | 31 | 0 | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int n, p[1010], k, num, ans;
int main() {
cin >> n >> k;
for (int i = 0; i < k; i++) {
cin >> p[i];
num += p[i];
}
ans = num;
for (int i = k; i < n; i++) {
cin >> p[i];
num += p[i] - p[i - k];
ans = max(ans, num);
}
float x = ans, y = k;
printf("%.12f", (x + y) / 2);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
int n, p[200010], k, num, ans;
int main() {
cin >> n >> k;
for (int i = 0; i < k; i++) {
cin >> p[i];
num += p[i];
}
ans = num;
for (int i = k; i < n; i++) {
cin >> p[i];
num += p[i] - p[i - k];
ans = max(ans, num);
}
float x = ans, y = k;
printf("%.12f", (x + y) / 2);
return 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef pair<int, int> pi;
int main() {
int n, k;
cin >> n >> k;
vi p(n);
vector<double> pa(n);
rep(i, n) { cin >> p[i]; }
rep(i, n) { pa[i] = (double)(p[i] + 1) / 2; }
double ans = 0;
rep(i, n - k + 1) {
double x = 0;
rep(j, k) { x += pa[i + j]; }
if (ans < x)
ans = x;
}
printf("%.10lf\n", ans);
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef pair<int, int> pi;
int main() {
int n, k;
cin >> n >> k;
vi p(n);
vector<double> pa(n);
rep(i, n) { cin >> p[i]; }
rep(i, n) { pa[i] = (double)(p[i] + 1) / 2; }
double x = 0;
rep(i, k) x += pa[i];
double ans = x;
rep(i, n - k) {
x = x - pa[i] + pa[i + k];
ans = max(ans, x);
}
printf("%.10lf\n", ans);
return 0;
} | replace | 23 | 29 | 23 | 29 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define INF (ll)1e9
#define deb(x) cerr << #x << " " << x << "\n"
#define fixed setprecision(9)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<double> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int index = 0;
ll ma = (ll)0;
for (int i = 0; i < k; i++) {
ma += v[i];
}
ll prev = ma;
for (int i = 1; i <= n - k; i++) {
ll sum = prev - v[i - k] + v[i];
if (sum > ma) {
index = i;
ma = sum;
}
prev = sum;
}
long double ans = 0;
for (int i = index; i < index + k; i++) {
ans += ((v[i] * (v[i] + 1) / 2.00) / v[i]);
}
// cerr<<v[index]<<"\n";
cout << fixed << ans;
return 0;
}
| #include <bits/stdc++.h>
#define pb push_back
#define INF (ll)1e9
#define deb(x) cerr << #x << " " << x << "\n"
#define fixed setprecision(9)
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<double> v(n);
for (int i = 0; i < n; i++) {
cin >> v[i];
}
int index = 0;
ll ma = (ll)0;
for (int i = 0; i < k; i++) {
ma += v[i];
}
ll prev = ma;
for (int i = 1; i <= n - k; i++) {
ll sum = prev - v[i - 1] + v[i + k - 1];
if (sum > ma) {
index = i;
ma = sum;
}
prev = sum;
}
long double ans = 0;
for (int i = index; i < index + k; i++) {
ans += ((v[i] * (v[i] + 1) / 2.00) / v[i]);
}
// cerr<<v[index]<<"\n";
cout << fixed << ans;
return 0;
}
| replace | 22 | 23 | 22 | 23 | 0 | |
p02780 | C++ | Runtime Error | #include <fstream>
#include <iomanip>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long n, k;
ifstream ifs("10.txt");
cin.rdbuf(ifs.rdbuf());
if (ifs.fail()) {
cout << "読み込み失敗" << endl;
}
cin >> n >> k;
long long p[n];
rep(i, n) { cin >> p[i]; }
long long max = 0;
rep(i, k) { max += p[i]; }
long long sum = max;
rep(i, n - k) {
sum += p[i + k];
sum -= p[i];
if (sum > max) {
max = sum;
}
}
max += k;
cout << setprecision(15) << max / 2.0 << endl;
return 0;
}
| #include <fstream>
#include <iomanip>
#include <iostream>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main() {
long long n, k;
cin >> n >> k;
long long p[n];
rep(i, n) { cin >> p[i]; }
long long max = 0;
rep(i, k) { max += p[i]; }
long long sum = max;
rep(i, n - k) {
sum += p[i + k];
sum -= p[i];
if (sum > max) {
max = sum;
}
}
max += k;
cout << setprecision(15) << max / 2.0 << endl;
return 0;
}
| delete | 8 | 13 | 8 | 8 | -11 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define sz(arr) (int)(arr).size()
#define rng(arr) arr.begin(), arr.end()
#define show(x) cout << #x << " = " << x << endl;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define Cins(T, n, xs) \
vector<T> xs(n); \
for (int i = 0; i < n; ++i) \
cin >> xs[i]
void Main();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
Main();
return 0;
}
void Main() {
Cin(int, n, k);
Cins(int, n, p);
vector<double> e(n);
rep(i, n) e[i] = (1 + p[i]) / 2.;
vector<double> s(n + 1);
s[0] = 0;
rep(i, n) rep(j, i + 1) s[i + 1] += e[j];
double mx = 0;
for (int i = 0; i + k <= n; ++i)
mx = max(mx, s[i + k] - s[i]);
cout << mx << endl;
} | #include <bits/stdc++.h>
#define sz(arr) (int)(arr).size()
#define rng(arr) arr.begin(), arr.end()
#define show(x) cout << #x << " = " << x << endl;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long int ll;
void _cin() {}
template <class Head, class... Tail> void _cin(Head &&head, Tail &&...tail) {
cin >> head;
_cin(forward<Tail>(tail)...);
}
#define Cin(T, ...) \
T __VA_ARGS__; \
_cin(__VA_ARGS__)
#define Cins(T, n, xs) \
vector<T> xs(n); \
for (int i = 0; i < n; ++i) \
cin >> xs[i]
void Main();
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
Main();
return 0;
}
void Main() {
Cin(int, n, k);
Cins(int, n, p);
vector<double> e(n);
rep(i, n) e[i] = (1 + p[i]) / 2.;
vector<double> s(n + 1);
s[0] = 0;
for (int i = 1; i <= n; ++i)
s[i] = s[i - 1] + e[i - 1];
double mx = 0;
for (int i = 0; i + k <= n; ++i)
mx = max(mx, s[i + k] - s[i]);
cout << mx << endl;
} | replace | 42 | 43 | 42 | 44 | TLE | |
p02780 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < (a + n); i++)
#define var auto
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
rep(i, 0, n) cin >> p[i];
// 累積和
vector<int> s(n + 1, 0);
rep(i, 0, n + 1) s[i + 1] = s[i] + p[i];
// 最大を探す
int i_max = 0;
int s_max = 0;
rep(i, 0, n - k + 1) {
if (s_max < (s[i + k] - s[i])) {
i_max = i;
s_max = s[i + k] - s[i];
}
}
double m = 0;
rep(i, i_max, k) { m += (double)(1 + p[i]) / 2; }
cout << fixed << setprecision(12) << m << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i < (a + n); i++)
#define var auto
using namespace std;
using ll = long long;
int main() {
int n, k;
cin >> n >> k;
vector<int> p(n);
rep(i, 0, n) cin >> p[i];
// 累積和
vector<int> s(n + 1, 0);
rep(i, 0, n) { s[i + 1] = s[i] + p[i]; }
// 最大を探す
int i_max = 0;
int s_max = 0;
rep(i, 0, n - k + 1) {
if (s_max < (s[i + k] - s[i])) {
i_max = i;
s_max = s[i + k] - s[i];
}
}
double m = 0;
rep(i, i_max, k) { m += (double)(1 + p[i]) / 2; }
cout << fixed << setprecision(12) << m << endl;
return 0;
}
| replace | 14 | 15 | 14 | 15 | -6 | Fatal glibc error: malloc assertion failure in sysmalloc: (old_top == initial_top (av) && old_size == 0) || ((unsigned long) (old_size) >= MINSIZE && prev_inuse (old_top) && ((unsigned long) old_end & (pagesize - 1)) == 0)
|
p02780 | Python | Runtime Error | from itertools import accumulate
def solve(string):
n, k, *p = map(int, string.split())
(*p,) = accumulate((1 + _p) / 2 for _p in p)
return str(max(p2 - p1 for p1, p2 in zip(p, p[k:])))
if __name__ == "__main__":
import sys
print(solve(sys.stdin.read().strip()))
| from itertools import accumulate
def solve(string):
n, k, *p = map(int, string.split())
(*p,) = accumulate((1 + _p) / 2 for _p in p)
return str(max(p2 - p1 for p1, p2 in zip(p, p[k:]))) if k < n else str(p[-1])
if __name__ == "__main__":
import sys
print(solve(sys.stdin.read().strip()))
| replace | 6 | 7 | 6 | 7 | 0 | |
p02780 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int> vint;
typedef vector<ll> vll;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
int main() {
int n, k;
cin >> n >> k;
vint p(n);
cin >> p;
int max = 0;
int idx = 0;
for (int i = k - 1; i < n; i++) {
int sum = 0;
for (int j = i - (k - 1); j <= i; j++) {
sum += p[j];
}
if (max < sum) {
max = sum;
idx = i - (k - 1);
}
}
double ans = 0;
for (int i = idx; i < (idx + k); i++) {
ans += (p[i] + 1) / ((double)2);
}
cout << fixed << setprecision(10) << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
#define ALL(x) (x).begin(), (x).end()
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define pb push_back
typedef vector<int> vint;
typedef vector<ll> vll;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
int main() {
int n, k;
cin >> n >> k;
vint p(n);
cin >> p;
int max = 0;
int idx = 0;
for (int i = 0; i < k; i++) {
max += p[i];
}
int tmp = max;
for (int i = k; i < n; i++) {
tmp += p[i];
tmp -= p[i - k];
if (max < tmp) {
max = tmp;
idx = i - k + 1;
}
}
double ans = 0;
for (int i = idx; i < (idx + k); i++) {
ans += (p[i] + 1) / ((double)2);
}
cout << fixed << setprecision(10) << ans << endl;
} | replace | 30 | 38 | 30 | 40 | TLE | |
p02781 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
int k;
vector<vector<vector<ll>>> dp;
ll f(int indextoadd, bool isequal, int numleft) {
if (numleft < 0) {
return dp[indextoadd][isequal][numleft] = 0;
}
if (indextoadd == s.size()) {
if (numleft == 0) {
return dp[indextoadd][isequal][numleft] = 1;
} else {
return dp[indextoadd][isequal][numleft] = 0;
}
}
if (dp[indextoadd][isequal][numleft] != -1) {
return dp[indextoadd][isequal][numleft];
}
ll total = 0;
for (int i = 0; i <= 9; i++) {
if (isequal && i > (s[indextoadd] - '0')) {
break;
}
total += f(indextoadd + 1, (isequal && (s[indextoadd] - '0' == i)),
(i == 0 ? numleft : numleft - 1));
}
return dp[indextoadd][isequal][numleft] = total;
}
int main() {
cin >> s >> k;
dp.resize(s.size() + 1, vector<vector<ll>>(2, vector<ll>(k + 1, -1)));
cout << f(0, true, k) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
string s;
int k;
vector<vector<vector<ll>>> dp;
ll f(int indextoadd, bool isequal, int numleft) {
if (numleft < 0) {
return 0;
}
if (indextoadd == s.size()) {
if (numleft == 0) {
return dp[indextoadd][isequal][numleft] = 1;
} else {
return dp[indextoadd][isequal][numleft] = 0;
}
}
if (dp[indextoadd][isequal][numleft] != -1) {
return dp[indextoadd][isequal][numleft];
}
ll total = 0;
for (int i = 0; i <= 9; i++) {
if (isequal && i > (s[indextoadd] - '0')) {
break;
}
total += f(indextoadd + 1, (isequal && (s[indextoadd] - '0' == i)),
(i == 0 ? numleft : numleft - 1));
}
return dp[indextoadd][isequal][numleft] = total;
}
int main() {
cin >> s >> k;
dp.resize(s.size() + 1, vector<vector<ll>>(2, vector<ll>(k + 1, -1)));
cout << f(0, true, k) << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | -6 | free(): invalid pointer
|
p02781 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// MACROS
#define ll long long
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vld vector<ld>
#define u_s unordered_set
#define pii pair<int, int>
#define pll pair<ll, ll>
#define FOR(i, n) for (ll(i) = 0; i < n; i++)
#define FORN(i, a, b) for (ll(i) = a; i < b; i++)
#define FORE(i, l) for (auto(i) : l)
#define pb push_back
#define pob pop_back
#define emp emplace
#define fi first
#define se second
#define all(n) (n).begin(), (n).end()
#define in(n) cin >> (n);
#define debug(n) cout << #n << ": " << n << '\n';
// FUNCTIONS
template <typename T> inline T gcd(T a, T b) {
if (b)
return gcd(b, a % b);
return a;
}
template <typename T> inline T ext_gcd(T a, T b, T &x, T &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
T x1, y1;
T g = ext_gcd(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return g;
}
ll f1(string n, ll N) {
if (N == 0)
return n[0] - '0';
string x = "";
x.resize(N);
FOR(i, N) x[i] = n[i];
return 9 + f1(x, N - 1);
}
ll f2(string n, ll N) {
if (N < 1)
return 0;
string x = "";
x.resize(N);
FOR(i, N) x[i] = '9';
ll res1 = (n[0] - '0' - 1) * f1(x, N - 1) + f2(x, N - 1);
bool found = false;
x = "";
FORN(i, 1, N + 1) {
if (n[i] != '0' || found) {
x += n[i];
found = true;
}
}
ll res2 = f1(x, (ll)x.size() - 1);
return res1 + res2;
}
ll f3(string n, ll N) {
if (N < 2)
return 0;
string x = "";
x.resize(N);
FOR(i, N) x[i] = '9';
ll res1 = (n[0] - '0' - 1) * f2(x, N - 1) + f3(x, N - 1);
bool found = false;
x = "";
FORN(i, 1, N + 1) {
if (n[i] != '0' || found) {
x += n[i];
found = true;
}
}
ll res2 = f2(x, (ll)x.size() - 1);
return res1 + res2;
}
int main() {
// ios_base::sync_with_stdio(0);
// cin.tie(0);
// cout << setprecision(15);
string n;
ll k;
cin >> n >> k;
ll N = n.size() - 1;
if (k == 1)
cout << f1(n, N) << '\n';
else if (k == 2)
cout << f2(n, N) << '\n';
else
cout << f3(n, N) << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
// MACROS
#define ll long long
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vld vector<ld>
#define u_s unordered_set
#define pii pair<int, int>
#define pll pair<ll, ll>
#define FOR(i, n) for (ll(i) = 0; i < n; i++)
#define FORN(i, a, b) for (ll(i) = a; i < b; i++)
#define FORE(i, l) for (auto(i) : l)
#define pb push_back
#define pob pop_back
#define emp emplace
#define fi first
#define se second
#define all(n) (n).begin(), (n).end()
#define in(n) cin >> (n);
#define debug(n) cout << #n << ": " << n << '\n';
// FUNCTIONS
template <typename T> inline T gcd(T a, T b) {
if (b)
return gcd(b, a % b);
return a;
}
template <typename T> inline T ext_gcd(T a, T b, T &x, T &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
T x1, y1;
T g = ext_gcd(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return g;
}
ll f1(string n, ll N) {
if (N < 0)
return 0;
if (N == 0)
return n[0] - '0';
string x = "";
x.resize(N);
FOR(i, N) x[i] = n[i];
return 9 + f1(x, N - 1);
}
ll f2(string n, ll N) {
if (N < 1)
return 0;
string x = "";
x.resize(N);
FOR(i, N) x[i] = '9';
ll res1 = (n[0] - '0' - 1) * f1(x, N - 1) + f2(x, N - 1);
bool found = false;
x = "";
FORN(i, 1, N + 1) {
if (n[i] != '0' || found) {
x += n[i];
found = true;
}
}
ll res2 = f1(x, (ll)x.size() - 1);
return res1 + res2;
}
ll f3(string n, ll N) {
if (N < 2)
return 0;
string x = "";
x.resize(N);
FOR(i, N) x[i] = '9';
ll res1 = (n[0] - '0' - 1) * f2(x, N - 1) + f3(x, N - 1);
bool found = false;
x = "";
FORN(i, 1, N + 1) {
if (n[i] != '0' || found) {
x += n[i];
found = true;
}
}
ll res2 = f2(x, (ll)x.size() - 1);
return res1 + res2;
}
int main() {
// ios_base::sync_with_stdio(0);
// cin.tie(0);
// cout << setprecision(15);
string n;
ll k;
cin >> n >> k;
ll N = n.size() - 1;
if (k == 1)
cout << f1(n, N) << '\n';
else if (k == 2)
cout << f2(n, N) << '\n';
else
cout << f3(n, N) << '\n';
}
| insert | 54 | 54 | 54 | 56 | 0 | |
p02781 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cout << #var << "=" << var << endl;
#define dup(x, y) (((x) + (y)-1) / (y))
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
const int INTMAX = 2147483647;
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u> void chmin(t &a, u b) {
if (b < a)
a = b;
}
int main() {
string s;
cin >> s;
int n = s.size();
int K;
cin >> K;
vector<vector<vl>> dp(n + 10, vector<vl>(2, vl(K + 1, 0)));
dp[0][0][0] = 1;
for (int i = 0; i < n; ++i) {
int D = s[i] - '0';
for (int j = 0; j < 2; ++j) {
for (int k = 0; k <= K; ++k) {
for (int d = 0; d <= (j ? 9 : D); ++d) {
if (d == 0) {
dp[i + 1][j || (d < D)][k] += dp[i][j][k];
} else
dp[i + 1][j || (d < D)][k + 1] += dp[i][j][k];
}
}
}
}
cout << dp[n][0][K] + dp[n][1][K] << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define call(var) cout << #var << "=" << var << endl;
#define dup(x, y) (((x) + (y)-1) / (y))
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using Graph = vector<vi>;
using P = pair<int, int>;
const int MOD = (int)1e9 + 7;
const int INF = (int)1e9;
const ll LINF = (ll)1e18;
const int INTMAX = 2147483647;
template <class t, class u> void chmax(t &a, u b) {
if (a < b)
a = b;
}
template <class t, class u> void chmin(t &a, u b) {
if (b < a)
a = b;
}
int main() {
string s;
cin >> s;
int n = s.size();
int K;
cin >> K;
vector<vector<vl>> dp(n + 10, vector<vl>(2, vl(K + 1, 0)));
dp[0][0][0] = 1;
for (int i = 0; i < n; ++i) {
int D = s[i] - '0';
for (int j = 0; j < 2; ++j) {
for (int k = 0; k <= K; ++k) {
for (int d = 0; d <= (j ? 9 : D); ++d) {
if (d == 0) {
dp[i + 1][j || (d < D)][k] += dp[i][j][k];
} else if (k < K)
dp[i + 1][j || (d < D)][k + 1] += dp[i][j][k];
}
}
}
}
cout << dp[n][0][K] + dp[n][1][K] << endl;
} | replace | 39 | 40 | 39 | 40 | 0 | |
p02781 | C++ | Runtime Error | // 6/23 解き直し
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
string N;
vector<int> n;
int dp[100][2][5];
int main() {
cin >> N;
int K;
cin >> K;
// int size = N.size();
for (auto a : N) {
n.push_back(a - '0');
}
int l = n.size();
dp[0][0][0] = 1; // 初期条件
for (int i = 0; i < l; i++) {
for (int smaller = 0; smaller < 2; smaller++) {
for (int k = 0; k <= K; k++) {
for (int x = 0; x <= (smaller ? 9 : n[i]); x++) {
if (x == 0)
dp[i + 1][smaller || x < n[i]][k] += dp[i][smaller][k];
else
dp[i + 1][smaller || x < n[i]][k + 1] += dp[i][smaller][k];
}
}
}
}
cout << dp[l][0][K] + dp[l][1][K] << endl;
} | // 6/23 解き直し
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
string N;
vector<int> n;
int dp[110][2][5];
int main() {
cin >> N;
int K;
cin >> K;
// int size = N.size();
for (auto a : N) {
n.push_back(a - '0');
}
int l = n.size();
dp[0][0][0] = 1; // 初期条件
for (int i = 0; i < l; i++) {
for (int smaller = 0; smaller < 2; smaller++) {
for (int k = 0; k <= K; k++) {
for (int x = 0; x <= (smaller ? 9 : n[i]); x++) {
if (x == 0)
dp[i + 1][smaller || x < n[i]][k] += dp[i][smaller][k];
else
dp[i + 1][smaller || x < n[i]][k + 1] += dp[i][smaller][k];
}
}
}
}
cout << dp[l][0][K] + dp[l][1][K] << endl;
} | replace | 9 | 10 | 9 | 10 | 0 | |
p02781 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll mod = 1000000007;
const ll mod998 = 998244353;
const ll intmax = 2147483647;
const ll llmax = 9223372036854775807;
const char sp = ' ';
string S, T;
int K, M;
ll res;
bool comp() {
for (int i = 0; i < M; i++) {
if (S[i] > T[i])
return true;
if (S[i] < T[i])
return false;
}
return true;
}
int main() {
cin >> S >> K;
M = S.size();
T = string('0', M);
if (K == 1) {
for (int i = 0; i < M; i++) {
for (char ci = '1'; ci <= '9'; ci++) {
T[i] = ci;
res += comp();
T[i] = '0';
}
}
} else if (K == 2) {
for (int i = 0; i < M; i++) {
for (char ci = '1'; ci <= '9'; ci++) {
T[i] = ci;
for (int j = i + 1; j < M; j++) {
for (char cj = '1'; cj <= '9'; cj++) {
T[j] = cj;
res += comp();
T[j] = '0';
}
}
T[i] = '0';
}
}
} else if (K == 3) {
for (int i = 0; i < M; i++) {
for (char ci = '1'; ci <= '9'; ci++) {
T[i] = ci;
for (int j = i + 1; j < M; j++) {
for (char cj = '1'; cj <= '9'; cj++) {
T[j] = cj;
for (int k = j + 1; k < M; k++) {
for (char ck = '1'; ck <= '9'; ck++) {
T[k] = ck;
res += comp();
T[k] = '0';
}
}
T[j] = '0';
}
}
T[i] = '0';
}
}
}
cout << res << endl;
} | #include <bits/stdc++.h>
typedef long long ll;
using namespace std;
const ll mod = 1000000007;
const ll mod998 = 998244353;
const ll intmax = 2147483647;
const ll llmax = 9223372036854775807;
const char sp = ' ';
string S, T;
int K, M;
ll res;
bool comp() {
for (int i = 0; i < M; i++) {
if (S[i] > T[i])
return true;
if (S[i] < T[i])
return false;
}
return true;
}
int main() {
cin >> S >> K;
M = S.size();
for (int i = 0; i < M; i++) {
T.push_back('0');
}
if (K == 1) {
for (int i = 0; i < M; i++) {
for (char ci = '1'; ci <= '9'; ci++) {
T[i] = ci;
res += comp();
T[i] = '0';
}
}
} else if (K == 2) {
for (int i = 0; i < M; i++) {
for (char ci = '1'; ci <= '9'; ci++) {
T[i] = ci;
for (int j = i + 1; j < M; j++) {
for (char cj = '1'; cj <= '9'; cj++) {
T[j] = cj;
res += comp();
T[j] = '0';
}
}
T[i] = '0';
}
}
} else if (K == 3) {
for (int i = 0; i < M; i++) {
for (char ci = '1'; ci <= '9'; ci++) {
T[i] = ci;
for (int j = i + 1; j < M; j++) {
for (char cj = '1'; cj <= '9'; cj++) {
T[j] = cj;
for (int k = j + 1; k < M; k++) {
for (char ck = '1'; ck <= '9'; ck++) {
T[k] = ck;
res += comp();
T[k] = '0';
}
}
T[j] = '0';
}
}
T[i] = '0';
}
}
}
cout << res << endl;
} | replace | 27 | 28 | 27 | 30 | 0 | |
p02781 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll dp[100][2][4];
int main() {
string s;
cin >> s;
ll k;
cin >> k;
dp[0][0][0] = 1;
for (ll i = 0; i < s.size(); i++) {
for (ll j = 0; j <= 9; j++) {
if (s[i] - '0' == j) {
if (j == 0) {
// cout << i<< " "<<j;
for (ll l = 0; l < 4; l++) {
dp[i + 1][0][l] += dp[i][0][l];
dp[i + 1][1][l] += dp[i][1][l];
}
// cout << " "<<dp[1][0][1]<< " "<<dp[1][1][1]<<endl;
} else {
for (ll l = 0; l < 4; l++) {
dp[i + 1][0][l + 1] += dp[i][0][l];
dp[i + 1][1][l + 1] += dp[i][1][l];
}
}
} else {
if (j == 0) {
for (ll l = 0; l < 4; l++) {
dp[i + 1][1][l] += dp[i][0][l];
dp[i + 1][1][l] += dp[i][1][l];
}
} else {
for (ll l = 0; l < 4; l++) {
if (s[i] - '0' > j) {
dp[i + 1][1][l + 1] += dp[i][0][l];
}
dp[i + 1][1][l + 1] += dp[i][1][l];
}
}
}
}
}
cout << dp[s.size()][0][k] + dp[s.size()][1][k];
// your code goes here
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
ll dp[100][2][5];
int main() {
string s;
cin >> s;
ll k;
cin >> k;
dp[0][0][0] = 1;
for (ll i = 0; i < s.size(); i++) {
for (ll j = 0; j <= 9; j++) {
if (s[i] - '0' == j) {
if (j == 0) {
// cout << i<< " "<<j;
for (ll l = 0; l < 4; l++) {
dp[i + 1][0][l] += dp[i][0][l];
dp[i + 1][1][l] += dp[i][1][l];
}
// cout << " "<<dp[1][0][1]<< " "<<dp[1][1][1]<<endl;
} else {
for (ll l = 0; l < 4; l++) {
dp[i + 1][0][l + 1] += dp[i][0][l];
dp[i + 1][1][l + 1] += dp[i][1][l];
}
}
} else {
if (j == 0) {
for (ll l = 0; l < 4; l++) {
dp[i + 1][1][l] += dp[i][0][l];
dp[i + 1][1][l] += dp[i][1][l];
}
} else {
for (ll l = 0; l < 4; l++) {
if (s[i] - '0' > j) {
dp[i + 1][1][l + 1] += dp[i][0][l];
}
dp[i + 1][1][l + 1] += dp[i][1][l];
}
}
}
}
}
cout << dp[s.size()][0][k] + dp[s.size()][1][k];
// your code goes here
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02781 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void solve() {
string S;
cin >> S;
ll N, K;
cin >> K;
N = S.size();
vector<vector<vector<ll>>> dp(N + 1,
vector<vector<ll>>(2, vector<ll>(K + 1, 0)));
dp[0][0][0] = 1;
rep(i, N) {
ll d = S[i] - '0';
rep(j, 2) {
if (j == 1) {
d = 9;
}
rep(k, K + 1) {
rep(m, d + 1) {
dp[i + 1][j == 1 || m < d][(m != 0 ? k + 1 : k)] += dp[i][j][k];
}
}
}
}
ll ans = dp[N][0][K] + dp[N][1][K];
cout << ans << '\n';
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
void solve() {
string S;
cin >> S;
ll N, K;
cin >> K;
N = S.size();
vector<vector<vector<ll>>> dp(N + 1,
vector<vector<ll>>(2, vector<ll>(K + 2, 0)));
dp[0][0][0] = 1;
rep(i, N) {
ll d = S[i] - '0';
rep(j, 2) {
if (j == 1) {
d = 9;
}
rep(k, K + 1) {
rep(m, d + 1) {
dp[i + 1][j == 1 || m < d][(m != 0 ? k + 1 : k)] += dp[i][j][k];
}
}
}
}
ll ans = dp[N][0][K] + dp[N][1][K];
cout << ans << '\n';
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| replace | 33 | 34 | 33 | 34 | 0 | |
p02781 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define fn for (int i = 0; i < n; i++)
#define fn1 for (int i = 1; i <= n; i++)
#define fm for (int j = 0; j < m; j++)
#define fm1 for (int j = 1; j <= m; j++)
#define fi first
#define se second
#define E endl
#define MOD 1000000007
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
const int N = 2e6 + 5;
const int INF = 1e18L;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
int ar[N];
int dp[N];
int pow1(int x, int y) {
int ans = 1;
while (y > 0) {
if (y & 1) {
ans *= x;
}
x *= x;
y >>= 1;
}
return ans;
}
signed main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
IOS;
int T = 1;
// cin >> T;
while (T--) {
string s;
cin >> s;
int k;
cin >> k;
if (k == 1) {
int q = s.size() - 1, ans = 0;
ans += 9 * q;
ans += (int)(s[0] - '0') - 1;
ans += 1ll;
return cout << ans, 0;
}
int n = s.size();
string t(n - 1, '0');
for (int i = 0; i < k - 1; i++)
t[n - 2 - i] = '1';
int cnt = 0;
vector<int> C;
for (int i = pow1(10ll, k - 1) + 1; i < pow1(10ll, k); i++) {
int ii = i;
int flag = 1;
while (ii) {
if ((ii % 10) == 0)
flag = 0;
ii /= 10;
}
if (flag)
cnt++;
if (flag)
C.pb(i);
}
int mul = 1, den = 1;
for (int i = 0; i < k; i++) {
mul *= (n - 1 - i);
den *= (i + 1);
}
int ans = 1ll * (mul / den) * cnt;
do {
vector<int> p;
p.pb(0);
for (int i = 0; i < n - 1; i++)
if (t[i] == '1')
p.pb(i + 1);
string t1 = "1";
t1 += t;
int ss = t1.size();
vector<int> d(k);
for (int i : C) {
int ii = i;
for (int j = 0; ii > 0 && j < k; j++) {
d[k - 1 - j] = ii % 10;
ii /= 10;
}
int ok = 0;
for (int j = 0; j < k; j++) {
if (p[j] < 0) {
ok = 1;
break;
}
t1[p[j]] = '0' + d[j];
}
if (!ok && t1 <= s)
ans++;
}
} while (next_permutation(all(t)));
cout << ans;
}
cerr << "Time Taken : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(NULL);
#define pb push_back
#define eb emplace_back
#define fn for (int i = 0; i < n; i++)
#define fn1 for (int i = 1; i <= n; i++)
#define fm for (int j = 0; j < m; j++)
#define fm1 for (int j = 1; j <= m; j++)
#define fi first
#define se second
#define E endl
#define MOD 1000000007
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
const int N = 2e6 + 5;
const int INF = 1e18L;
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << ": " << arg1 << " |";
__f(comma + 1, args...);
}
int ar[N];
int dp[N];
int pow1(int x, int y) {
int ans = 1;
while (y > 0) {
if (y & 1) {
ans *= x;
}
x *= x;
y >>= 1;
}
return ans;
}
signed main() {
// #ifndef ONLINE_JUDGE
// freopen("input.txt","r",stdin);
// freopen("output.txt","w",stdout);
// #endif
IOS;
int T = 1;
// cin >> T;
while (T--) {
string s;
cin >> s;
int k;
cin >> k;
if (k == 1) {
int q = s.size() - 1, ans = 0;
ans += 9 * q;
ans += (int)(s[0] - '0') - 1;
ans += 1ll;
return cout << ans, 0;
}
int n = s.size();
string t(n - 1, '0');
for (int i = 0; i < k - 1; i++)
t[n - 2 - i] = '1';
int cnt = 0;
vector<int> C;
for (int i = pow1(10ll, k - 1) + 1; i < pow1(10ll, k); i++) {
int ii = i;
int flag = 1;
while (ii) {
if ((ii % 10) == 0)
flag = 0;
ii /= 10;
}
if (flag)
cnt++;
if (flag)
C.pb(i);
}
int mul = 1, den = 1;
for (int i = 0; i < k; i++) {
mul *= (n - 1 - i);
den *= (i + 1);
}
int ans = 1ll * (mul / den) * cnt;
do {
vector<int> p;
p.pb(0);
for (int i = 0; i < n - 1; i++)
if (t[i] == '1')
p.pb(i + 1);
string t1 = "1";
t1 += t;
int ss = t1.size();
vector<int> d(k);
for (int i : C) {
int ii = i;
for (int j = 0; ii > 0 && j < k; j++) {
d[k - 1 - j] = ii % 10;
ii /= 10;
}
int ok = 0;
for (int j = 0; j < k; j++) {
if (p[j] > ss) {
ok = 1;
break;
}
t1[p[j]] = '0' + d[j];
}
if (!ok && t1 <= s)
ans++;
}
} while (next_permutation(all(t)));
cout << ans;
}
cerr << "Time Taken : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
return 0;
}
| replace | 106 | 107 | 106 | 107 | 0 | |
p02781 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int t;
cin >> t;
int n = s.size();
string u = "";
for (int i = 0; i < n; i++) {
u += '0';
}
if (n < t) {
cout << 0 << endl;
return 0;
}
long long ans = 0;
string q;
if (t == 1) {
for (int i = 0; i < n; i++) {
for (char x = '1'; x <= '9'; x++) {
q = u;
q[i] = x;
if (q <= s) {
ans++;
}
}
}
} else if (t == 2) {
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
for (char x = '1'; x <= '9'; x++) {
for (char y = '1'; y <= '9'; y++) {
q = u;
q[i] = x;
q[j] = y;
if (q <= s) {
ans++;
}
}
}
}
}
} else {
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
for (int k = j + 1; k < n; k++) {
for (char x = '1'; x <= '9'; x++) {
for (char y = '1'; y <= '9'; y++) {
for (int z = '1'; z <= '9'; z++) {
q = u;
q[i] = x;
q[j] = y;
q[k] = z;
if (q <= s) {
ans++;
}
}
}
}
}
}
}
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
int main() {
string s;
cin >> s;
int t;
cin >> t;
int n = s.size();
string u = "";
for (int i = 0; i < n; i++) {
u += '0';
}
if (n < t) {
cout << 0 << endl;
return 0;
}
long long ans = 0;
string q;
if (t == 1) {
for (int i = 0; i < n; i++) {
for (char x = '1'; x <= '9'; x++) {
q = u;
q[i] = x;
if (q <= s) {
ans++;
}
}
}
} else if (t == 2) {
for (int i = 0; i < n; i++) {
for (int j = i + 1; j < n; j++) {
for (char x = '1'; x <= '9'; x++) {
for (char y = '1'; y <= '9'; y++) {
q = u;
q[i] = x;
q[j] = y;
if (q <= s) {
ans++;
}
}
}
}
}
} else {
ans += (n - 1) * (n - 2) * (n - 3) / 6 * 9 * 9 * 9;
for (int j = 1; j < n; j++) {
for (int k = j + 1; k < n; k++) {
for (char x = '1'; x <= '9'; x++) {
for (char y = '1'; y <= '9'; y++) {
for (int z = '1'; z <= '9'; z++) {
q = u;
q[0] = x;
q[j] = y;
q[k] = z;
if (q <= s) {
ans++;
}
}
}
}
}
}
}
cout << ans << endl;
} | replace | 44 | 57 | 44 | 56 | TLE | |
p02781 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
vl v; \
rep(i, n) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
bool chmin(ll &a, ll &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
bool chmax(ll &a, ll &b) {
if (b > a) {
a = b;
return 1;
}
return 0;
}
const ll INF = 999999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
ll a, b, c, d, e, f, p, t, x, y, z, q, m, n, r, h, k, w, l, ans;
string s;
ll saiki(ll x, ll i, ll k) {
if (i == 0) {
if (x == n - 1 && k == 1)
return 9;
if (k == 0)
return 1;
if (x == n - 1)
return 0;
return saiki(x + 1, 0, k) + saiki(x + 1, 0, k - 1) * 9;
}
a = s[x] - '0';
if (x == n - 1 && k == 1)
return a;
if (k == 0)
return 1;
if (a == 0)
return saiki(x + 1, 1, k);
return saiki(x + 1, 0, k) + saiki(x + 1, 0, k - 1) * (a - 1) +
saiki(x + 1, 1, k - 1);
}
int main() {
cin >> s >> k;
n = s.length();
cout << saiki(0, 1, k) << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define all(v) v.begin(), v.end()
#define inputv(v, n) \
vl v; \
rep(i, n) { \
ll x; \
cin >> x; \
v.push_back(x); \
}
bool chmin(ll &a, ll &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
bool chmax(ll &a, ll &b) {
if (b > a) {
a = b;
return 1;
}
return 0;
}
const ll INF = 999999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
ll a, b, c, d, e, f, p, t, x, y, z, q, m, n, r, h, k, w, l, ans;
string s;
ll saiki(ll x, ll i, ll k) {
if (i == 0) {
if (x == n - 1 && k == 1)
return 9;
if (k == 0)
return 1;
if (x == n - 1)
return 0;
return saiki(x + 1, 0, k) + saiki(x + 1, 0, k - 1) * 9;
}
a = s[x] - '0';
if (x == n - 1 && k == 1)
return a;
if (k == 0)
return 1;
if (a == 0)
return saiki(x + 1, 1, k);
return saiki(x + 1, 0, k) + saiki(x + 1, 0, k - 1) * (a - 1) +
saiki(x + 1, 1, k - 1);
}
int main() {
cin >> s >> k;
n = s.length();
if (n < k) {
cout << 0 << endl;
} else
cout << saiki(0, 1, k) << endl;
} | replace | 56 | 57 | 56 | 60 | 0 | |
p02781 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
// #include <ext/numeric>
using namespace std;
// using namespace __gnu_cxx;
const int MAXN = (int)1e3 + 5;
const int MAXM = (int)1e4 + 5;
const int MOD = 1000000007;
long long mul(long long a, long long b) { return a * b % MOD; }
long long power(long long a, long long b) {
if (!b)
return 1;
long long r = power(a, b / 2);
r = mul(r, r);
if (b & 1)
return mul(r, a);
return r;
}
long long mod_inv(long long x) { return power(x, MOD - 2); }
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0), cout.precision(10),
cout << fixed;
string str;
int k;
cin >> str >> k;
int n = (int)str.size();
long long ans = 0;
for (int i = 1; i < n; ++i) {
if (k == 1)
ans += 9;
else if (k == 2) {
for (int j = 2; j <= i; ++j) {
ans += 81;
}
} else {
for (int j = 2; j <= i; ++j) {
for (int jj = j + 1; jj <= i; ++jj) {
ans += 81 * 9;
}
}
}
}
if (k == 1)
ans += str[0] - '0';
else if (k == 2) {
for (int i = 1; i <= str[0] - '0'; ++i) {
bool f = i == str[0] - '0';
for (int j = 1; j < n; ++j) {
if (!f)
ans += 9;
else
ans += str[j] - '0';
f &= str[j] - '0' == 0;
}
}
} else {
for (int i = 1; i <= str[0] - '0'; ++i) {
bool f = i == str[0] - '0';
for (int j = 1; j < n; ++j) {
for (int a = 1; a <= f ? str[j] - '0' : 9; ++a) {
bool ff = f;
ff &= a == str[j] - '0';
for (int jj = j + 1; jj < n; ++jj) {
if (!ff)
ans += 9;
else
ans += str[jj] - '0';
ff &= str[jj] == '0';
}
}
f &= str[j] - '0' == 0;
}
}
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
// #include <ext/numeric>
using namespace std;
// using namespace __gnu_cxx;
const int MAXN = (int)1e3 + 5;
const int MAXM = (int)1e4 + 5;
const int MOD = 1000000007;
long long mul(long long a, long long b) { return a * b % MOD; }
long long power(long long a, long long b) {
if (!b)
return 1;
long long r = power(a, b / 2);
r = mul(r, r);
if (b & 1)
return mul(r, a);
return r;
}
long long mod_inv(long long x) { return power(x, MOD - 2); }
int main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0), cout.precision(10),
cout << fixed;
string str;
int k;
cin >> str >> k;
int n = (int)str.size();
long long ans = 0;
for (int i = 1; i < n; ++i) {
if (k == 1)
ans += 9;
else if (k == 2) {
for (int j = 2; j <= i; ++j) {
ans += 81;
}
} else {
for (int j = 2; j <= i; ++j) {
for (int jj = j + 1; jj <= i; ++jj) {
ans += 81 * 9;
}
}
}
}
if (k == 1)
ans += str[0] - '0';
else if (k == 2) {
for (int i = 1; i <= str[0] - '0'; ++i) {
bool f = i == str[0] - '0';
for (int j = 1; j < n; ++j) {
if (!f)
ans += 9;
else
ans += str[j] - '0';
f &= str[j] - '0' == 0;
}
}
} else {
for (int i = 1; i <= str[0] - '0'; ++i) {
bool f = i == str[0] - '0';
for (int j = 1; j < n; ++j) {
for (int a = 1; a <= (f ? str[j] - '0' : 9); ++a) {
bool ff = f;
ff &= a == str[j] - '0';
for (int jj = j + 1; jj < n; ++jj) {
if (!ff)
ans += 9;
else
ans += str[jj] - '0';
ff &= str[jj] == '0';
}
}
f &= str[j] - '0' == 0;
}
}
}
cout << ans << '\n';
return 0;
} | replace | 70 | 71 | 70 | 71 | TLE | |
p02781 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = std::int_fast64_t;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string S;
int K;
cin >> S >> K;
int N = (int)S.size();
vector<vector<vector<i64>>> dp(N + 1,
vector<vector<i64>>(2, vector<i64>(K + 1, 0)));
dp[0][0][0] = 1;
for (int d = 0; d < N; d++) {
for (int is_less = 0; is_less < 2; is_less++) {
for (int k = 0; k < K + 1; k++) {
int c = S[d] - '0';
for (int nxt = 0; nxt < 10; nxt++) {
if (c < nxt && is_less == 0)
continue;
int nis_less = is_less;
if (nxt < c)
nis_less = 1;
int nk = k + (nxt == 0 ? 0 : 1);
dp[d + 1][nis_less][nk] += dp[d][is_less][k];
}
}
}
}
cout << dp[N][0][K] + dp[N][1][K] << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using i64 = std::int_fast64_t;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
string S;
int K;
cin >> S >> K;
int N = (int)S.size();
vector<vector<vector<i64>>> dp(N + 1,
vector<vector<i64>>(2, vector<i64>(K + 2, 0)));
dp[0][0][0] = 1;
for (int d = 0; d < N; d++) {
for (int is_less = 0; is_less < 2; is_less++) {
for (int k = 0; k < K + 1; k++) {
int c = S[d] - '0';
for (int nxt = 0; nxt < 10; nxt++) {
if (c < nxt && is_less == 0)
continue;
int nis_less = is_less;
if (nxt < c)
nis_less = 1;
int nk = k + (nxt == 0 ? 0 : 1);
dp[d + 1][nis_less][nk] += dp[d][is_less][k];
}
}
}
}
cout << dp[N][0][K] + dp[N][1][K] << '\n';
return 0;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02781 | 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 ld long double
#define all(x) (x).begin(), (x).end()
#define inf 1e18
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>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// ifstream cin("input.txt");
// ofstream cout("output.txt");
ll k;
string s;
cin >> s >> k;
int n = s.size();
vector<vector<vector<ll>>> dp(n + 1,
vector<vector<ll>>(n + 1, vector<ll>(2)));
dp[0][0][1] = 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= k; ++j) {
for (int z = 0; z < 2; ++z) {
for (int d = 0; d <= 9; ++d) {
if (j + (d != 0) > k) {
continue;
}
if (j > i || (d > s[i] - '0' && z == 1)) {
continue;
}
dp[i + 1][j + (d != 0)][z & (d == s[i] - '0')] += dp[i][j][z];
}
}
}
}
cout << dp[n][k][1] + dp[n][k][0];
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define all(x) (x).begin(), (x).end()
#define inf 1e18
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>;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// ifstream cin("input.txt");
// ofstream cout("output.txt");
ll k;
string s;
cin >> s >> k;
int n = s.size();
vector<vector<vector<ll>>> dp(n + 1,
vector<vector<ll>>(k + 100, vector<ll>(2)));
dp[0][0][1] = 1;
for (int i = 0; i < n; ++i) {
for (int j = 0; j <= k; ++j) {
for (int z = 0; z < 2; ++z) {
for (int d = 0; d <= 9; ++d) {
if (j + (d != 0) > k) {
continue;
}
if (j > i || (d > s[i] - '0' && z == 1)) {
continue;
}
dp[i + 1][j + (d != 0)][z & (d == s[i] - '0')] += dp[i][j][z];
}
}
}
}
cout << dp[n][k][1] + dp[n][k][0];
} | replace | 26 | 27 | 26 | 27 | 0 | |
p02781 | C++ | Memory Limit Exceeded | //----------BHAVIK DIWANI(PICT_COMP)---------------
#include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define MAX 1000005
#define pb push_back
#define vi vector<int>
#define endl '\n'
using namespace std;
// cnt total no. of elements between range from a to b which contains digit d
// exactly k times
string b;
int k;
vi num;
int dp[10000000][12]
[2]; // dp[pos][cnt][f] f=if number has become less or not
int call(int pos, int cnt, int f) {
if (cnt > k)
return 0;
if (num.size() == pos) {
if (cnt == k)
return 1;
return 0;
}
int limit, res = 0;
if (dp[pos][cnt][f] != -1)
return dp[pos][cnt][f];
if (f == 0)
limit = num[pos];
else
limit = 9;
for (int i = 0; i <= limit; i++) {
int nf = f;
int ncnt = cnt;
if (i < limit)
nf = 1;
if (i != 0)
ncnt++;
if (cnt <= k)
res += call(pos + 1, ncnt, nf);
}
return dp[pos][cnt][f] = res;
}
int solve(string b) {
num.clear();
for (int i = 0; i < b.length(); i++) {
num.pb(b[i] - '0');
}
memset(dp, -1, sizeof(dp));
int res = call(0, 0, 0);
return res;
}
signed main() {
fastio;
cin >> b >> k;
int res = solve(b);
cout << res << endl;
return 0;
}
| //----------BHAVIK DIWANI(PICT_COMP)---------------
#include <bits/stdc++.h>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define int long long
#define MAX 1000005
#define pb push_back
#define vi vector<int>
#define endl '\n'
using namespace std;
// cnt total no. of elements between range from a to b which contains digit d
// exactly k times
string b;
int k;
vi num;
int dp[128][4][2]; // dp[pos][cnt][f] f=if number has become less or not
int call(int pos, int cnt, int f) {
if (cnt > k)
return 0;
if (num.size() == pos) {
if (cnt == k)
return 1;
return 0;
}
int limit, res = 0;
if (dp[pos][cnt][f] != -1)
return dp[pos][cnt][f];
if (f == 0)
limit = num[pos];
else
limit = 9;
for (int i = 0; i <= limit; i++) {
int nf = f;
int ncnt = cnt;
if (i < limit)
nf = 1;
if (i != 0)
ncnt++;
if (cnt <= k)
res += call(pos + 1, ncnt, nf);
}
return dp[pos][cnt][f] = res;
}
int solve(string b) {
num.clear();
for (int i = 0; i < b.length(); i++) {
num.pb(b[i] - '0');
}
memset(dp, -1, sizeof(dp));
int res = call(0, 0, 0);
return res;
}
signed main() {
fastio;
cin >> b >> k;
int res = solve(b);
cout << res << endl;
return 0;
}
| replace | 17 | 19 | 17 | 18 | MLE | |
p02781 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long comb(int n, int k) {
if (n < k || k < 0)
return 0;
long long ans = 1;
rep(i, k) {
ans *= n;
n--;
}
rep(i, k) { ans /= i + 1; }
return ans;
}
long long calc(string S, int N, int K) {
if (K > N)
return 0;
if (K == 0)
return 1;
if (S[0] - '0' == 0)
return calc(S.substr(1), N, K);
long long ans = 0;
ans += comb(N - 1, K) * pow(9, K);
if (S[0] - '0' > 1) {
ans += (S[0] - '0' - 1) * comb(N - 1, K - 1) * pow(9, K - 1);
}
ans += calc(S.substr(1), N - 1, K - 1);
return ans;
}
int main() {
string S;
cin >> S;
int K;
cin >> K;
int N = S.size();
cout << calc(S, N, K) << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
long long comb(int n, int k) {
if (n < k || k < 0)
return 0;
long long ans = 1;
rep(i, k) {
ans *= n;
n--;
}
rep(i, k) { ans /= i + 1; }
return ans;
}
long long calc(string S, int N, int K) {
if (K > N)
return 0;
if (K == 0)
return 1;
if (S[0] - '0' == 0)
return calc(S.substr(1), N - 1, K);
long long ans = 0;
ans += comb(N - 1, K) * pow(9, K);
if (S[0] - '0' > 1) {
ans += (S[0] - '0' - 1) * comb(N - 1, K - 1) * pow(9, K - 1);
}
ans += calc(S.substr(1), N - 1, K - 1);
return ans;
}
int main() {
string S;
cin >> S;
int K;
cin >> K;
int N = S.size();
cout << calc(S, N, K) << endl;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p02781 | Python | Runtime Error | import sys
sys.setrecursionlimit(100)
n = input()
k = int(input())
m = {}
def doit(n, k):
if len(n) == 0:
return k == 0
d = int(n[0])
if (n, k) not in m:
ret = 0
for i in range(d + 1):
if i == d:
ret += doit(n[1:], k - 1 if i > 0 else k)
else:
ret += doit("9" * (len(n) - 1), k - 1 if i > 0 else k)
m[(n, k)] = ret
return m[(n, k)]
print(doit(n, k))
| import sys
sys.setrecursionlimit(10000)
n = input()
k = int(input())
m = {}
def doit(n, k):
if len(n) == 0:
return k == 0
d = int(n[0])
if (n, k) not in m:
ret = 0
for i in range(d + 1):
if i == d:
ret += doit(n[1:], k - 1 if i > 0 else k)
else:
ret += doit("9" * (len(n) - 1), k - 1 if i > 0 else k)
m[(n, k)] = ret
return m[(n, k)]
print(doit(n, k))
| replace | 2 | 3 | 2 | 3 | 0 | |
p02781 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int K;
cin >> K;
long dp[S.length()][5][2];
for (int i = 0; i < S.length(); i++) {
for (int j = 0; j < S.length() + 1; j++) {
for (int k = 0; k < 2; k++) {
dp[i][j][k] = 0;
}
}
}
dp[0][1][0] = 1;
dp[0][1][1] = S[0] - '0' - 1;
dp[0][0][1] = 1;
// 0: t
// 1: >t
for (int i = 1; i < S.length(); i++) {
for (int j = 0; j < 4; j++) {
if (S[i] == '0') {
dp[i][j][0] = dp[i - 1][j][0];
} else {
dp[i][j + 1][0] = dp[i - 1][j][0];
dp[i][j + 1][1] += dp[i - 1][j][0] * (S[i] - '0' - 1);
dp[i][j][1] += dp[i - 1][j][0];
}
dp[i][j + 1][1] += dp[i - 1][j][1] * 9;
dp[i][j][1] += dp[i - 1][j][1];
}
}
cout << dp[S.length() - 1][K][0] + dp[S.length() - 1][K][1] << endl;
return 0;
} | #include <iostream>
using namespace std;
int main() {
string S;
cin >> S;
int K;
cin >> K;
long dp[S.length()][5][2];
for (int i = 0; i < S.length(); i++) {
for (int j = 0; j < 4; j++) {
for (int k = 0; k < 2; k++) {
dp[i][j][k] = 0;
}
}
}
dp[0][1][0] = 1;
dp[0][1][1] = S[0] - '0' - 1;
dp[0][0][1] = 1;
// 0: t
// 1: >t
for (int i = 1; i < S.length(); i++) {
for (int j = 0; j < 4; j++) {
if (S[i] == '0') {
dp[i][j][0] = dp[i - 1][j][0];
} else {
dp[i][j + 1][0] = dp[i - 1][j][0];
dp[i][j + 1][1] += dp[i - 1][j][0] * (S[i] - '0' - 1);
dp[i][j][1] += dp[i - 1][j][0];
}
dp[i][j + 1][1] += dp[i - 1][j][1] * 9;
dp[i][j][1] += dp[i - 1][j][1];
}
}
cout << dp[S.length() - 1][K][0] + dp[S.length() - 1][K][1] << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02781 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define LL long int
int main() {
string s;
cin >> s;
int k;
cin >> k;
int sz = s.size();
vector<int> num(sz);
for (int i = 0; i < sz; ++i)
num[i] = s[i] - '0';
vector<vector<vector<LL>>> dp(sz + 1,
vector<vector<LL>>(2, vector<LL>(k + 1, 0)));
dp[0][0][0] = 1;
for (int i = 0; i < sz; ++i) {
for (int smaller = 0; smaller < 2; ++smaller) {
for (int j = 0; j <= k; ++j) {
for (int x = 0; x <= (smaller ? 9 : num[i]); ++x) {
dp[i + 1][smaller || x < num[i]][j + (x != 0)] += dp[i][smaller][j];
}
}
}
}
cout << dp[sz][0][k] + dp[sz][1][k] << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define LL long int
int main() {
string s;
cin >> s;
int k;
cin >> k;
int sz = s.size();
vector<int> num(sz);
for (int i = 0; i < sz; ++i)
num[i] = s[i] - '0';
vector<vector<vector<LL>>> dp(sz + 1,
vector<vector<LL>>(2, vector<LL>(k + 2, 0)));
dp[0][0][0] = 1;
for (int i = 0; i < sz; ++i) {
for (int smaller = 0; smaller < 2; ++smaller) {
for (int j = 0; j <= k; ++j) {
for (int x = 0; x <= (smaller ? 9 : num[i]); ++x) {
dp[i + 1][smaller || x < num[i]][j + (x != 0)] += dp[i][smaller][j];
}
}
}
}
cout << dp[sz][0][k] + dp[sz][1][k] << endl;
return 0;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p02781 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#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 sz(x) ((int)(x).size())
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll ans = 0;
int main() {
string S;
cin >> S;
int N = sz(S);
int K;
cin >> K;
/*
dp[i][j][k]
i: 頭からi桁 j: 未満フラグ k: 0以外の個数
dp[i][0][0]:頭からi桁 n未満確定 全部0
dp[i][0][1]:頭からi桁 n未満確定 0以外が1個
dp[i][1][0]:頭からi桁 nは一致 全部0
dp[i][1][1]:頭からi桁 nは一致 0以外が1個
*/
vector<vector<vector<ll>>> dp(N + 1,
vector<vector<ll>>(2, vector<ll>(K + 1, 0)));
dp[0][0][0] = 1;
rep(i, N) {
rep(smaller, 2) {
rep(k, K + 1) {
for (int x = 0; x <= (smaller ? 9 : (int)(S[i] - '0')); x++) {
dp[i + 1][smaller || x < (int)(S[i] - '0')][k + (x != 0)] +=
dp[i][smaller][k];
}
}
}
}
cout << dp[N][0][K] + dp[N][1][K] << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#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 sz(x) ((int)(x).size())
#define pb push_back
#define mod 1000000007
using ll = long long;
using namespace std;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll ans = 0;
int main() {
string S;
cin >> S;
int N = sz(S);
int K;
cin >> K;
/*
dp[i][j][k]
i: 頭からi桁 j: 未満フラグ k: 0以外の個数
dp[i][0][0]:頭からi桁 n未満確定 全部0
dp[i][0][1]:頭からi桁 n未満確定 0以外が1個
dp[i][1][0]:頭からi桁 nは一致 全部0
dp[i][1][1]:頭からi桁 nは一致 0以外が1個
*/
vector<vector<vector<ll>>> dp(N + 1,
vector<vector<ll>>(2, vector<ll>(K + 2, 0)));
dp[0][0][0] = 1;
rep(i, N) {
rep(smaller, 2) {
rep(k, K + 1) {
for (int x = 0; x <= (smaller ? 9 : (int)(S[i] - '0')); x++) {
dp[i + 1][smaller || x < (int)(S[i] - '0')][k + (x != 0)] +=
dp[i][smaller][k];
}
}
}
}
cout << dp[N][0][K] + dp[N][1][K] << endl;
return 0;
}
| replace | 45 | 46 | 45 | 46 | 0 | |
p02781 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
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;
}
ll Pow(ll x, ll n) {
ll ret = 1;
while (n > 0) {
if (n & 1)
ret *= x;
x *= x;
n >>= 1;
}
return ret;
}
long long combination(long long N, long long R) {
if (R < 0 || R > N)
return 0;
if (R == 1)
return N;
else if (R == 2)
return N * (N - 1) / 2;
else
return N * (N - 1) * (N - 2) / 6;
}
vector<vvll> memo;
string N;
int K, keta;
ll solve(int i, int k, bool smaller) {
if (memo[i][k][smaller] != -1) {
return memo[i][k][smaller];
}
if (k == 0) {
memo[i][k][smaller] = 1;
return 1;
}
if (i == keta) {
memo[i][k][smaller] = 0;
return 0;
}
if (smaller) {
memo[i][k][smaller] = combination(keta - i, k) * pow(9, k);
return memo[i][k][smaller];
}
if (N[i] == '0') {
memo[i][k][smaller] = solve(i + 1, k, smaller);
return memo[i][k][smaller];
}
ll zero = solve(i + 1, k, true);
ll mid = solve(i + 1, k - 1, true) * (N[i] - '1');
ll girigiri = solve(i + 1, k - 1, false);
memo[i][k][smaller] = zero + mid + girigiri;
return memo[i][k][smaller];
}
int main() {
cin >> N;
cin >> K;
keta = N.size();
memo.resize(keta + 1, vvll(keta + 1, vll(2, -1)));
cout << solve(0, K, false);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep2(i, x, n) for (int i = x; i < (n); i++)
#define all(n) begin(n), end(n)
struct cww {
cww() {
ios::sync_with_stdio(false);
cin.tie(0);
}
} star;
const long long INF = numeric_limits<long long>::max();
typedef long long ll;
typedef vector<int> vint;
typedef vector<char> vchar;
typedef vector<vector<int>> vvint;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef unsigned long long ull;
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;
}
ll Pow(ll x, ll n) {
ll ret = 1;
while (n > 0) {
if (n & 1)
ret *= x;
x *= x;
n >>= 1;
}
return ret;
}
long long combination(long long N, long long R) {
if (R < 0 || R > N)
return 0;
if (R == 1)
return N;
else if (R == 2)
return N * (N - 1) / 2;
else
return N * (N - 1) * (N - 2) / 6;
}
vector<vvll> memo;
string N;
int K, keta;
ll solve(int i, int k, bool smaller) {
if (memo[i][k][smaller] != -1) {
return memo[i][k][smaller];
}
if (k == 0) {
memo[i][k][smaller] = 1;
return 1;
}
if (i == keta) {
memo[i][k][smaller] = 0;
return 0;
}
if (smaller) {
memo[i][k][smaller] = combination(keta - i, k) * pow(9, k);
return memo[i][k][smaller];
}
if (N[i] == '0') {
memo[i][k][smaller] = solve(i + 1, k, smaller);
return memo[i][k][smaller];
}
ll zero = solve(i + 1, k, true);
ll mid = solve(i + 1, k - 1, true) * (N[i] - '1');
ll girigiri = solve(i + 1, k - 1, false);
memo[i][k][smaller] = zero + mid + girigiri;
return memo[i][k][smaller];
}
int main() {
cin >> N;
cin >> K;
keta = N.size();
memo.resize(keta + 1, vvll(K + 1, vll(2, -1)));
cout << solve(0, K, false);
return 0;
} | replace | 91 | 92 | 91 | 92 | 0 | |
p02781 | Python | Runtime Error | N = input()
K = int(input())
a = 1
b = [0] * (K + 1)
b[0] = 1
b[1] = int(N[0]) - 1
for c in N[1:]:
t = int(c)
for i in range(K - 1, -1, -1):
b[i + 1] += b[i] * 9
if t != 0:
b[a + 1] += t - 1
b[a] += 1
a += 1
if a == K:
print(b[K] + 1)
else:
print(b[K])
| N = input()
K = int(input())
a = 1
b = [0] * (K + 1)
b[0] = 1
b[1] = int(N[0]) - 1
for c in N[1:]:
t = int(c)
for i in range(K - 1, -1, -1):
b[i + 1] += b[i] * 9
if t != 0:
if a + 1 <= K:
b[a + 1] += t - 1
if a <= K:
b[a] += 1
a += 1
if a == K:
print(b[K] + 1)
else:
print(b[K])
| replace | 13 | 15 | 13 | 17 | 0 | |
p02782 | C++ | Runtime Error | #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
static const long long mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
(x += a.x) %= mod;
return *this;
}
mint &operator-=(const mint a) {
(x += mod - a.x) %= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint ret(*this);
return ret += a;
}
mint operator-(const mint a) const {
mint ret(*this);
return ret -= a;
}
mint operator*(const mint a) const {
mint ret(*this);
return ret *= a;
}
mint pow(ll t) const {
if (t == 0)
return mint(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 ret(*this);
return ret /= a;
}
};
class modutils {
vector<mint> fact, invfact;
public:
modutils(int n = 200005) : fact(n + 1), invfact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i;
invfact[n] = fact[n].inv();
for (int i = n; i >= 1; i--)
invfact[i - 1] = invfact[i] * i;
}
mint pow(mint x, ll n) { return x.pow(n); }
mint comb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[k] * invfact[n - k];
}
mint perm(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[n - k];
}
mint fac(ll n) { return fact[n]; }
};
mint g(modutils &mu, ll r, ll c) {
mint ret(0);
repLRE(j, 0, c) ret += mu.comb(r + j + 1, j + 1);
return ret;
}
int main() {
// ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
modutils mu(1001000);
mint ans = g(mu, r2, c2) - g(mu, r1 - 1, c2) - g(mu, r2, c1 - 1) +
g(mu, r1 - 1, c1 - 1);
cout << ans.x << endl;
return 0;
}
| #include <limits.h>
#include <math.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>
#include <cassert>
#include <cfloat>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <regex>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repLRE(i, l, r) for (ll i = (l); i <= (r); ++i)
#define rrepLRE(i, l, r) for (ll i = (l); i >= (r); --i)
#define Sort(v) sort(v.begin(), v.end())
#define rSort(v) sort(v.rbegin(), v.rend())
#define Reverse(v) reverse(v.begin(), v.end())
#define Lower_bound(v, x) \
distance(v.begin(), lower_bound(v.begin(), v.end(), x))
#define Upper_bound(v, x) \
distance(v.begin(), upper_bound(v.begin(), v.end(), x))
using ll = long long;
using ull = unsigned long long;
using P = pair<ll, ll>;
using T = tuple<ll, ll, ll>;
using vll = vector<ll>;
using vP = vector<P>;
using vT = vector<T>;
using vvll = vector<vector<ll>>;
using vvP = vector<vector<P>>;
using dqll = deque<ll>;
ll dx[9] = {-1, 1, 0, 0, -1, -1, 1, 1, 0};
ll dy[9] = {0, 0, -1, 1, -1, 1, -1, 1, 0};
/* Macros reg. ends here */
const ll INF = 1LL << 50;
static const long long mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
(x += a.x) %= mod;
return *this;
}
mint &operator-=(const mint a) {
(x += mod - a.x) %= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint ret(*this);
return ret += a;
}
mint operator-(const mint a) const {
mint ret(*this);
return ret -= a;
}
mint operator*(const mint a) const {
mint ret(*this);
return ret *= a;
}
mint pow(ll t) const {
if (t == 0)
return mint(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 ret(*this);
return ret /= a;
}
};
class modutils {
vector<mint> fact, invfact;
public:
modutils(int n = 200005) : fact(n + 1), invfact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i;
invfact[n] = fact[n].inv();
for (int i = n; i >= 1; i--)
invfact[i - 1] = invfact[i] * i;
}
mint pow(mint x, ll n) { return x.pow(n); }
mint comb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[k] * invfact[n - k];
}
mint perm(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[n - k];
}
mint fac(ll n) { return fact[n]; }
};
mint g(modutils &mu, ll r, ll c) {
mint ret(0);
repLRE(j, 0, c) ret += mu.comb(r + j + 1, j + 1);
return ret;
}
int main() {
// ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
cout << fixed << setprecision(15);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
modutils mu(2002000);
mint ans = g(mu, r2, c2) - g(mu, r1 - 1, c2) - g(mu, r2, c1 - 1) +
g(mu, r1 - 1, c1 - 1);
cout << ans.x << endl;
return 0;
}
| replace | 141 | 142 | 141 | 142 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) \
for (int i = (n); i >= (k); i--) \
;
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &elemnt : v)
is >> elemnt;
return is;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T> vector<T> make_vector(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vector(size_t a, Ts... ts) {
return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));
}
const int MOD = 1e9 + 7;
const int INF = 2e18;
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<MOD>;
template <typename T> struct Combination {
vector<T> _fact, _rfact, _inv;
Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
_fact[0] = _rfact[sz] = _inv[0] = 1;
for (int i = 1; i <= sz; i++)
_fact[i] = _fact[i - 1] * i;
_rfact[sz] /= _fact[sz];
for (int i = sz - 1; i >= 0; i--)
_rfact[i] = _rfact[i + 1] * (i + 1);
for (int i = 1; i <= sz; i++)
_inv[i] = _rfact[i] * _fact[i - 1];
}
inline T fact(int k) const { return _fact[k]; }
inline T rfact(int k) const { return _rfact[k]; }
inline T inv(int k) const { return _inv[k]; }
T P(int n, int r) const {
if (r < 0 || n < r)
return 0;
return fact(n) * rfact(n - r);
}
T C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return fact(p) * rfact(q) * rfact(p - q);
}
T H(int n, int r) const {
if (n < 0 || r < 0)
return (0);
return r == 0 ? 1 : C(n + r - 1, r);
}
};
signed main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
auto comb = Combination<modint>(1e6 + 100);
modint ans = 0;
int left = min(c1, c2);
int right = max(c1, c2) + 1;
for (int i = r1; i <= r2; i++) {
ans += comb.C(right + i, i + 1) - comb.C(left + i, i + 1);
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define PI 3.141592653589793
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, a, n) for (int i = a; i < (n); i++)
#define rrep(i, n, k) \
for (int i = (n); i >= (k); i--) \
;
#define all(x) (x).begin(), (x).end()
#define vi vector<int>
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &elemnt : v)
is >> elemnt;
return is;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T> vector<T> make_vector(size_t a) { return vector<T>(a); }
template <class T, class... Ts> auto make_vector(size_t a, Ts... ts) {
return vector<decltype(make_vector<T>(ts...))>(a, make_vector<T>(ts...));
}
const int MOD = 1e9 + 7;
const int INF = 2e18;
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<MOD>;
template <typename T> struct Combination {
vector<T> _fact, _rfact, _inv;
Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
_fact[0] = _rfact[sz] = _inv[0] = 1;
for (int i = 1; i <= sz; i++)
_fact[i] = _fact[i - 1] * i;
_rfact[sz] /= _fact[sz];
for (int i = sz - 1; i >= 0; i--)
_rfact[i] = _rfact[i + 1] * (i + 1);
for (int i = 1; i <= sz; i++)
_inv[i] = _rfact[i] * _fact[i - 1];
}
inline T fact(int k) const { return _fact[k]; }
inline T rfact(int k) const { return _rfact[k]; }
inline T inv(int k) const { return _inv[k]; }
T P(int n, int r) const {
if (r < 0 || n < r)
return 0;
return fact(n) * rfact(n - r);
}
T C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return fact(p) * rfact(q) * rfact(p - q);
}
T H(int n, int r) const {
if (n < 0 || r < 0)
return (0);
return r == 0 ? 1 : C(n + r - 1, r);
}
};
signed main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
auto comb = Combination<modint>(1e6 * 2 + 500);
modint ans = 0;
int left = min(c1, c2);
int right = max(c1, c2) + 1;
for (int i = r1; i <= r2; i++) {
ans += comb.C(right + i, i + 1) - comb.C(left + i, i + 1);
}
cout << ans << endl;
}
| replace | 147 | 148 | 147 | 148 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
vector<pair<string, P>> vec;
// vector<vector<int>> data(3, vector<int>(4));
const long long MAX_P = 400001;
const long long MOD = 1000000007;
// 入力はすべて正とする
// 素数判定O(√n)
bool is_prime(long long n) {
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1; // 1の場合は例外
}
// 約数の列挙O(√n)
vector<long long> divisor(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
// 素因数分解O(√n)
map<long long, long long> prime_factor(long long n) {
map<long long, long long> res;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
long long extgcd(long long a, long long b, long long &x, long long &y) {
long long d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
long long mod_inverse(long long a, long long m) {
long long x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
long long fact[MAX_P + 1];
// n! mod pのテーブルを作る O(p)
void mod_fact(long long n, long long m) {
fact[0] = 1;
for (long long i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i % m;
}
// n!=a p^e としたときのa mod pを求める。O(log_p n)
long long mod_fact(long long n, long long p, long long &e) {
e = 0;
if (n == 0)
return 1;
// pの倍数の部分を計算
long long res = mod_fact(n / p, p, e);
e += n / p;
// (p-1)!≡-1なので(p-1)!^(n/p)はn/pの偶奇だけで計算できる
if (n / p % 2 != 0)
return res * (p - fact[n % p]) % p;
return res * fact[n % p] % p;
}
// nCk mod pを求める。O(log_p n)
long long mod_comb(long long n, long long k, long long p) {
if (n < 0 || k < 0 || n < k)
return 0;
long long e1, e2, e3;
long long a1 = mod_fact(n, p, e1), a2 = mod_fact(k, p, e2),
a3 = mod_fact(n - k, p, e3);
// if (a1 * mod_inverse(a2 * a3 % p, p) % p == 0) printf("%lld, %lld,
// %lld,%lld, %lld, %lld\n",n, p, e1,a1, a2, a3);
if (e1 > e2 + e3)
return 0;
return a1 * mod_inverse(a2 * a3 % p, p) % p;
}
// void solve(long long N, long long M){
// map<long long, long long> factorM = prime_factor(M);
// long long res = 1;
// mod_fact(MAX_P,MOD);
// for (auto x : factorM){
// //if (mod_comb(N-1+x.second,x.second,MOD) == 0) printf("%lld,
// %lld\n",x.first, x.second); if (x.second > 0) res =
// res*mod_comb(N-1+x.second,x.second,MOD)%MOD;
// }
// printf("%lld\n", res);
// }
ll solve(ll r, ll c) {
ll res = 0;
rep(i, r + 1) { res = (res + mod_comb(i + 1 + c, c, MOD) + MOD) % MOD; }
return res;
}
int main() {
vector<long long> c(2 - 1 + 1);
vector<long long> r(2 - 1 + 1);
for (int i = 0; i <= 2 - 1; i++) {
scanf("%lld", &r[i]);
scanf("%lld", &c[i]);
}
r[0]--;
c[0]--;
mod_fact(MAX_P, MOD);
ll res = 0;
res = (res + solve(r[0], c[0])) % MOD;
// cout << solve(r[0],c[0])%MOD << endl;
res = (res + solve(r[1], c[1])) % MOD;
// cout << solve(r[1],c[1])%MOD << endl;
res = (res + (MOD - solve(r[1], c[0])) % MOD) % MOD;
// cout << solve(r[1],c[0])%MOD << endl;
res = (res + (MOD - solve(r[0], c[1])) % MOD) % MOD;
// cout << solve(r[0],c[1])%MOD << endl;
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> P1;
typedef pair<P, P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i, x) for (long long i = 0; i < x; i++)
#define repn(i, x) for (long long i = 1; i <= x; i++)
#define SORT(x) sort(x.begin(), x.end())
#define ERASE(x) x.erase(unique(x.begin(), x.end()), x.end())
#define POSL(x, v) (lower_bound(x.begin(), x.end(), v) - x.begin())
#define POSU(x, v) (upper_bound(x.begin(), x.end(), v) - x.begin())
vector<pair<string, P>> vec;
// vector<vector<int>> data(3, vector<int>(4));
const long long MAX_P = 2000005;
const long long MOD = 1000000007;
// 入力はすべて正とする
// 素数判定O(√n)
bool is_prime(long long n) {
for (long long i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1; // 1の場合は例外
}
// 約数の列挙O(√n)
vector<long long> divisor(long long n) {
vector<long long> res;
for (long long i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (i != n / i)
res.push_back(n / i);
}
}
return res;
}
// 素因数分解O(√n)
map<long long, long long> prime_factor(long long n) {
map<long long, long long> res;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
++res[i];
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
long long extgcd(long long a, long long b, long long &x, long long &y) {
long long d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
long long mod_inverse(long long a, long long m) {
long long x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
long long fact[MAX_P + 1];
// n! mod pのテーブルを作る O(p)
void mod_fact(long long n, long long m) {
fact[0] = 1;
for (long long i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i % m;
}
// n!=a p^e としたときのa mod pを求める。O(log_p n)
long long mod_fact(long long n, long long p, long long &e) {
e = 0;
if (n == 0)
return 1;
// pの倍数の部分を計算
long long res = mod_fact(n / p, p, e);
e += n / p;
// (p-1)!≡-1なので(p-1)!^(n/p)はn/pの偶奇だけで計算できる
if (n / p % 2 != 0)
return res * (p - fact[n % p]) % p;
return res * fact[n % p] % p;
}
// nCk mod pを求める。O(log_p n)
long long mod_comb(long long n, long long k, long long p) {
if (n < 0 || k < 0 || n < k)
return 0;
long long e1, e2, e3;
long long a1 = mod_fact(n, p, e1), a2 = mod_fact(k, p, e2),
a3 = mod_fact(n - k, p, e3);
// if (a1 * mod_inverse(a2 * a3 % p, p) % p == 0) printf("%lld, %lld,
// %lld,%lld, %lld, %lld\n",n, p, e1,a1, a2, a3);
if (e1 > e2 + e3)
return 0;
return a1 * mod_inverse(a2 * a3 % p, p) % p;
}
// void solve(long long N, long long M){
// map<long long, long long> factorM = prime_factor(M);
// long long res = 1;
// mod_fact(MAX_P,MOD);
// for (auto x : factorM){
// //if (mod_comb(N-1+x.second,x.second,MOD) == 0) printf("%lld,
// %lld\n",x.first, x.second); if (x.second > 0) res =
// res*mod_comb(N-1+x.second,x.second,MOD)%MOD;
// }
// printf("%lld\n", res);
// }
ll solve(ll r, ll c) {
ll res = 0;
rep(i, r + 1) { res = (res + mod_comb(i + 1 + c, c, MOD) + MOD) % MOD; }
return res;
}
int main() {
vector<long long> c(2 - 1 + 1);
vector<long long> r(2 - 1 + 1);
for (int i = 0; i <= 2 - 1; i++) {
scanf("%lld", &r[i]);
scanf("%lld", &c[i]);
}
r[0]--;
c[0]--;
mod_fact(MAX_P, MOD);
ll res = 0;
res = (res + solve(r[0], c[0])) % MOD;
// cout << solve(r[0],c[0])%MOD << endl;
res = (res + solve(r[1], c[1])) % MOD;
// cout << solve(r[1],c[1])%MOD << endl;
res = (res + (MOD - solve(r[1], c[0])) % MOD) % MOD;
// cout << solve(r[1],c[0])%MOD << endl;
res = (res + (MOD - solve(r[0], c[1])) % MOD) % MOD;
// cout << solve(r[0],c[1])%MOD << endl;
cout << res << endl;
return 0;
}
| replace | 23 | 24 | 23 | 24 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#define dbg(x) cerr << #x " = " << x << endl;
#define idbg(x) #x " = " << x
#include "pretty_print.h"
#else
#define dbg(x)
#define idbg(x) ""
#endif
#ifdef _WIN32
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T sqr(T x) { return x * x; }
template <typename T> T abs(T x) { return x < 0 ? -x : x; }
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> bool chmin(T &x, const T &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T> bool chmax(T &x, const T &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
const int MOD = 1e+9 + 7;
vector<ll> f(1e+6 + 42);
ll powmod(ll a, ll b) {
if (b == 0) {
return 1;
}
ll r = powmod(a, b >> 1);
(r *= r) %= MOD;
return b & 1 ? a * r % MOD : r;
}
ll divmod(ll a, ll b) { return a * powmod(b, MOD - 2) % MOD; }
ll C(int n, int k) { return divmod(f[n], f[k] * f[n - k] % MOD); }
ll get(int r, int c) { return C(r + c, r); }
int main(int /* argc */, char ** /* argv */) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef LOCAL
assert(freopen("inp", "r", stdin));
assert(freopen("out", "w", stdout));
#endif
f[0] = 1;
for (int i = 1; i < (int)f.size(); ++i) {
f[i] = f[i - 1] * i % MOD;
}
int r1, c1, r2, c2;
while (cin >> r1 >> c1 >> r2 >> c2) {
ll cur = get(r1, c1);
ll ans = cur;
for (int i = 1; i <= (r2 + c2) - (r1 + c1); ++i) {
(cur *= 2) %= MOD;
if (r1 + i <= r2) {
cur += get(r1 + i, c1 - 1);
} else {
cur -= get(r2, c1 + i - (r2 - r1 + 1));
}
if (c1 + i <= c2) {
cur += get(r1 - 1, c1 + i);
} else {
cur -= get(r1 + i - (c2 - c1 + 1), c2);
}
cur %= MOD;
(ans += cur) %= MOD;
}
cout << (ans + MOD) % MOD << endl;
}
cerr << "Time execute: " << clock() / (double)CLOCKS_PER_SEC << " sec"
<< endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define all(x) (x).begin(), (x).end()
#ifdef LOCAL
#define dbg(x) cerr << #x " = " << x << endl;
#define idbg(x) #x " = " << x
#include "pretty_print.h"
#else
#define dbg(x)
#define idbg(x) ""
#endif
#ifdef _WIN32
#define LLD "%I64d"
#else
#define LLD "%lld"
#endif
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T sqr(T x) { return x * x; }
template <typename T> T abs(T x) { return x < 0 ? -x : x; }
template <typename T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <typename T> bool chmin(T &x, const T &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T> bool chmax(T &x, const T &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
const int MOD = 1e+9 + 7;
vector<ll> f(2e+6 + 42);
ll powmod(ll a, ll b) {
if (b == 0) {
return 1;
}
ll r = powmod(a, b >> 1);
(r *= r) %= MOD;
return b & 1 ? a * r % MOD : r;
}
ll divmod(ll a, ll b) { return a * powmod(b, MOD - 2) % MOD; }
ll C(int n, int k) { return divmod(f[n], f[k] * f[n - k] % MOD); }
ll get(int r, int c) { return C(r + c, r); }
int main(int /* argc */, char ** /* argv */) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef LOCAL
assert(freopen("inp", "r", stdin));
assert(freopen("out", "w", stdout));
#endif
f[0] = 1;
for (int i = 1; i < (int)f.size(); ++i) {
f[i] = f[i - 1] * i % MOD;
}
int r1, c1, r2, c2;
while (cin >> r1 >> c1 >> r2 >> c2) {
ll cur = get(r1, c1);
ll ans = cur;
for (int i = 1; i <= (r2 + c2) - (r1 + c1); ++i) {
(cur *= 2) %= MOD;
if (r1 + i <= r2) {
cur += get(r1 + i, c1 - 1);
} else {
cur -= get(r2, c1 + i - (r2 - r1 + 1));
}
if (c1 + i <= c2) {
cur += get(r1 - 1, c1 + i);
} else {
cur -= get(r1 + i - (c2 - c1 + 1), c2);
}
cur %= MOD;
(ans += cur) %= MOD;
}
cout << (ans + MOD) % MOD << endl;
}
cerr << "Time execute: " << clock() / (double)CLOCKS_PER_SEC << " sec"
<< endl;
return 0;
}
| replace | 57 | 58 | 57 | 58 | 0 | Time execute: 0.054075 sec
|
p02782 | C++ | Runtime Error | // ====================================================================================================================
// C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.
// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
// <http://www.gnu.org/licenses/>.
/** @file stdc++.h
* This is an implementation file for a precompiled header.
*/
// 17.4.1.2 Headers
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
// ここより↑は触らない(#include <bits/stdc++.h>の部分)
// ====================================================================================================================
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
//==================================================================================
// 素数を法とした整数の演算用
//==================================================================================
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; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
//==================================================================================
//==================================================================================
// コンビネーション
//==================================================================================
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
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];
}
};
//==================================================================================
combination comb(200005);
mint g(int r, int c) { return (comb(r + c + 2, r + 1)); }
int main(void) {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r1--;
c1--;
// 全体の合計
mint ans = g(r2, c2);
ans -= g(r1, c2);
ans -= g(r2, c1);
ans += g(r1, c1);
cout << ans.x << endl;
return (0);
}
| // ====================================================================================================================
// C++ includes used for precompiling -*- C++ -*-
// Copyright (C) 2003-2013 Free Software Foundation, Inc.
//
// This file is part of the GNU ISO C++ Library. This library is free
// software; you can redistribute it and/or modify it under the
// terms of the GNU General Public License as published by the
// Free Software Foundation; either version 3, or (at your option)
// any later version.
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// Under Section 7 of GPL version 3, you are granted additional
// permissions described in the GCC Runtime Library Exception, version
// 3.1, as published by the Free Software Foundation.
// You should have received a copy of the GNU General Public License and
// a copy of the GCC Runtime Library Exception along with this program;
// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
// <http://www.gnu.org/licenses/>.
/** @file stdc++.h
* This is an implementation file for a precompiled header.
*/
// 17.4.1.2 Headers
// C
#ifndef _GLIBCXX_NO_ASSERT
#include <cassert>
#endif
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#if __cplusplus >= 201103L
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>
#endif
// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#if __cplusplus >= 201103L
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <unordered_map>
#include <unordered_set>
#endif
// ここより↑は触らない(#include <bits/stdc++.h>の部分)
// ====================================================================================================================
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
//==================================================================================
// 素数を法とした整数の演算用
//==================================================================================
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; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
//==================================================================================
//==================================================================================
// コンビネーション
//==================================================================================
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
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];
}
};
//==================================================================================
combination comb(2000005);
mint g(int r, int c) { return (comb(r + c + 2, r + 1) - 1); }
int main(void) {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r1--;
c1--;
// 全体の合計
mint ans = g(r2, c2);
ans -= g(r1, c2);
ans -= g(r2, c1);
ans += g(r1, c1);
cout << ans.x << endl;
return (0);
}
| replace | 195 | 198 | 195 | 198 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i, N) repr(i, 0, N)
#define per(i, N) for (int i = (int)N - 1; i >= 0; i--)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
vector<ll> fac;
void c_fac(int x = pow(10, 6) + 10) {
fac.resize(x, true);
rep(i, x) fac[i] = i ? (fac[i - 1] * i) % MOD : 1;
}
ll inv(ll a, ll m = MOD) {
ll b = m, x = 1, y = 0;
while (b != 0) {
int d = a / b;
a -= b * d;
swap(a, b);
x -= y * d;
swap(x, y);
}
return (x + m) % m;
}
ll nck(ll n, ll k) { return fac[n] * inv(fac[k] * fac[n - k] % MOD) % MOD; }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
c_fac();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int ra = r2 - r1 + 1, ca = c2 - c1 + 1;
ll result = 0;
result += nck(r1 + c1, c1);
repr(i, 1, ra) {
result += nck(i + r1 + c1, c1) * nck(ra + ca - (i + 1), ca - 1);
result %= MOD;
}
repr(i, 1, ca) {
result += nck(i + r1 + c1, r1) * nck(ra + ca - (i + 1), ra - 1);
result %= MOD;
}
cout << result << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;
template <class T> void debug(T itr1, T itr2) {
auto now = itr1;
while (now < itr2) {
cout << *now << " ";
now++;
}
cout << endl;
}
#define repr(i, from, to) for (int i = (int)from; i < (int)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i, N) repr(i, 0, N)
#define per(i, N) for (int i = (int)N - 1; i >= 0; i--)
const ll MOD = pow(10, 9) + 7;
const ll LLINF = pow(2, 61) - 1;
const int INF = pow(2, 30) - 1;
vector<ll> fac;
void c_fac(int x = pow(10, 6) * 2 + 10) {
fac.resize(x, true);
rep(i, x) fac[i] = i ? (fac[i - 1] * i) % MOD : 1;
}
ll inv(ll a, ll m = MOD) {
ll b = m, x = 1, y = 0;
while (b != 0) {
int d = a / b;
a -= b * d;
swap(a, b);
x -= y * d;
swap(x, y);
}
return (x + m) % m;
}
ll nck(ll n, ll k) { return fac[n] * inv(fac[k] * fac[n - k] % MOD) % MOD; }
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
int main() {
c_fac();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int ra = r2 - r1 + 1, ca = c2 - c1 + 1;
ll result = 0;
result += nck(r1 + c1, c1);
repr(i, 1, ra) {
result += nck(i + r1 + c1, c1) * nck(ra + ca - (i + 1), ca - 1);
result %= MOD;
}
repr(i, 1, ca) {
result += nck(i + r1 + c1, r1) * nck(ra + ca - (i + 1), ra - 1);
result %= MOD;
}
cout << result << endl;
return 0;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 1000002;
const int MOD = 1000000007;
//
int fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
signed main() {
cout << fixed << setprecision(10);
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r2++;
c2++;
cout << (COM(r2 + c2, r2) + COM(r1 + c1, r1) + (MOD - (COM(r1 + c2, r1))) +
(MOD - (COM(r2 + c1, r2)))) %
MOD;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 2000003;
const int MOD = 1000000007;
//
int fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
signed main() {
cout << fixed << setprecision(10);
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r2++;
c2++;
cout << (COM(r2 + c2, r2) + COM(r1 + c1, r1) + (MOD - (COM(r1 + c2, r1))) +
(MOD - (COM(r2 + c1, r2)))) %
MOD;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02782 | C++ | Runtime Error | // https://codeforces.com/contest/1295/problem/A
// 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 pll pair<lli, lli>
#define pii pair<int, int>
#define pil pair<int, lli>
#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 rfore(i, m, n) for (int i = n; 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 bset(a, p) ((a) | (1ll << (p)))
#define bchk(a, p) ((a) & (1ll << (p)))
#define bxor(a, p) ((a) ^ (1ll << (p)));
#define brem(a, p) (bchk(a, p) ? (bxor(a, p)) : (a))
/*SOME BITMASK KNOWLEDGE
1)x & (x - 1):sets the last one bit of x to zero
power of two exactly when x & (x − 1) = 0.
2)x & -x:sets all the one bits to zero, except last one bit
3)x | (x - 1):inverts all the bits after the last one bit*/
#define lb lower_bound
#define ub upper_bound
#define er equal_range
#define findnot find_first_not_of
#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 sbtriectly 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 funcions*/
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 = y >> 1;
x = (x * x) % p;
}
return res;
}
lli modi(lli a, lli m) { return power(a, m - 2, m); }
/*CODE BEGINS*/
const int N = 1e6 + 5;
lli fac[N];
void fact() {
fac[0] = 1;
for (int i = 1; i < N; i++) {
fac[i] = (fac[i - 1] * i) % mod;
}
return;
}
lli ncr(lli a, lli b) {
return ((fac[a] * modi(fac[b], mod)) % mod * modi(fac[a - b], mod)) % mod;
}
int main() {
kira;
fact();
lli r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
lli a = ncr(lli(r2 + c2 + 2), lli(c2 + 1));
lli b = ncr(r2 + c1 + 1, c1);
lli c = ncr(r1 + c2 + 1, r1);
lli d = ncr(r1 + c1, c1);
// p4(a,b,c,d);
cout << ((a + d) % mod - (c + b) % mod + mod) % mod;
return 0;
} | // https://codeforces.com/contest/1295/problem/A
// 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 pll pair<lli, lli>
#define pii pair<int, int>
#define pil pair<int, lli>
#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 rfore(i, m, n) for (int i = n; 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 bset(a, p) ((a) | (1ll << (p)))
#define bchk(a, p) ((a) & (1ll << (p)))
#define bxor(a, p) ((a) ^ (1ll << (p)));
#define brem(a, p) (bchk(a, p) ? (bxor(a, p)) : (a))
/*SOME BITMASK KNOWLEDGE
1)x & (x - 1):sets the last one bit of x to zero
power of two exactly when x & (x − 1) = 0.
2)x & -x:sets all the one bits to zero, except last one bit
3)x | (x - 1):inverts all the bits after the last one bit*/
#define lb lower_bound
#define ub upper_bound
#define er equal_range
#define findnot find_first_not_of
#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 sbtriectly 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 funcions*/
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 = y >> 1;
x = (x * x) % p;
}
return res;
}
lli modi(lli a, lli m) { return power(a, m - 2, m); }
/*CODE BEGINS*/
const int N = 2e6 + 10;
lli fac[N];
void fact() {
fac[0] = 1;
for (int i = 1; i < N; i++) {
fac[i] = (fac[i - 1] * i) % mod;
}
return;
}
lli ncr(lli a, lli b) {
return ((fac[a] * modi(fac[b], mod)) % mod * modi(fac[a - b], mod)) % mod;
}
int main() {
kira;
fact();
lli r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
lli a = ncr(lli(r2 + c2 + 2), lli(c2 + 1));
lli b = ncr(r2 + c1 + 1, c1);
lli c = ncr(r1 + c2 + 1, r1);
lli d = ncr(r1 + c1, c1);
// p4(a,b,c,d);
cout << ((a + d) % mod - (c + b) % mod + mod) % mod;
return 0;
} | replace | 102 | 103 | 102 | 103 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1100000;
const long long MOD = 1000000007;
typedef long long ll;
ll fac[MAX], finv[MAX], inv[MAX];
ll mod_pow(ll x, ll n) { // べき乗
ll ans = 1;
x %= MOD;
while (n != 0) {
if (n & 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans % MOD;
}
void com_init() { // 初期化
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;
finv[i] = finv[i - 1] * mod_pow(i, MOD - 2) % MOD; // フェルマーの小定理より
}
}
ll comb(ll n, ll k) { // nCk
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll sum_comb(ll r, ll c) {
ll tmp = 0;
for (int i = 1; i <= r + 1; i++) {
tmp += comb(i + c, c);
tmp %= MOD;
}
return tmp % MOD;
;
}
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
com_init();
ll ans = sum_comb(r2, c2) + sum_comb(r1 - 1, c1 - 1) + 2 * MOD -
sum_comb(r1 - 1, c2) - sum_comb(r2, c1 - 1);
cout << ans % MOD << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2100000;
const long long MOD = 1000000007;
typedef long long ll;
ll fac[MAX], finv[MAX], inv[MAX];
ll mod_pow(ll x, ll n) { // べき乗
ll ans = 1;
x %= MOD;
while (n != 0) {
if (n & 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans % MOD;
}
void com_init() { // 初期化
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;
finv[i] = finv[i - 1] * mod_pow(i, MOD - 2) % MOD; // フェルマーの小定理より
}
}
ll comb(ll n, ll k) { // nCk
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll sum_comb(ll r, ll c) {
ll tmp = 0;
for (int i = 1; i <= r + 1; i++) {
tmp += comb(i + c, c);
tmp %= MOD;
}
return tmp % MOD;
;
}
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
com_init();
ll ans = sum_comb(r2, c2) + sum_comb(r1 - 1, c1 - 1) + 2 * MOD -
sum_comb(r1 - 1, c2) - sum_comb(r2, c1 - 1);
cout << ans % MOD << endl;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi first
#define se second
#define setpre(x) cout << fixed << setprecision(x)
#define ii(x) \
int x; \
cin >> (x)
#define ii2(x, y) \
int x, y; \
cin >> (x) >> (y)
#define ii3(x, y, z) \
int x, y, z; \
cin >> (x) >> (y) >> (z)
#define out(x) cout << (x) << endl
#define yn(x) cout << ((x) ? ("Yes") : ("No")) << endl
#define YN(x) cout << ((x) ? ("YES") : ("NO")) << endl
#define bit_c(x) __builtin_popcountll(x)
inline void logger() { cout << endl; }
template <typename A, typename... B> void logger(const A &a, const B &...b) {
cout << a << " , ";
logger(b...);
}
typedef pair<lint, lint> P;
const lint MOD = 1000000007;
const lint MOD9 = 998244353;
const lint INF = MOD * MOD;
const int MAX = 300000;
/* ...o(^-^)o... */
long long fac[MAX], facinv[MAX], inv[MAX];
void facinit() {
fac[0] = fac[1] = 1;
facinv[0] = facinv[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;
facinv[i] = facinv[i - 1] * inv[i] % MOD;
}
}
long long combi(long long a, long long b) {
if (a < b)
return 0;
if (a < 0 || b < 0)
return 0;
return fac[a] * (facinv[b] * facinv[a - b] % MOD) % MOD;
}
int main() {
lint r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
facinit();
lint ans = combi(r2 + c2 + 2, r2 + 1);
ans += MOD - combi(r1 + c2 + 1, c2 + 1);
ans %= MOD;
ans += MOD - combi(r2 + c1 + 1, r2 + 1);
ans %= MOD;
ans += combi(r1 + c1, r1);
ans %= MOD;
out(ans);
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define fi first
#define se second
#define setpre(x) cout << fixed << setprecision(x)
#define ii(x) \
int x; \
cin >> (x)
#define ii2(x, y) \
int x, y; \
cin >> (x) >> (y)
#define ii3(x, y, z) \
int x, y, z; \
cin >> (x) >> (y) >> (z)
#define out(x) cout << (x) << endl
#define yn(x) cout << ((x) ? ("Yes") : ("No")) << endl
#define YN(x) cout << ((x) ? ("YES") : ("NO")) << endl
#define bit_c(x) __builtin_popcountll(x)
inline void logger() { cout << endl; }
template <typename A, typename... B> void logger(const A &a, const B &...b) {
cout << a << " , ";
logger(b...);
}
typedef pair<lint, lint> P;
const lint MOD = 1000000007;
const lint MOD9 = 998244353;
const lint INF = MOD * MOD;
const int MAX = 2000005;
/* ...o(^-^)o... */
long long fac[MAX], facinv[MAX], inv[MAX];
void facinit() {
fac[0] = fac[1] = 1;
facinv[0] = facinv[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;
facinv[i] = facinv[i - 1] * inv[i] % MOD;
}
}
long long combi(long long a, long long b) {
if (a < b)
return 0;
if (a < 0 || b < 0)
return 0;
return fac[a] * (facinv[b] * facinv[a - b] % MOD) % MOD;
}
int main() {
lint r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
facinit();
lint ans = combi(r2 + c2 + 2, r2 + 1);
ans += MOD - combi(r1 + c2 + 1, c2 + 1);
ans %= MOD;
ans += MOD - combi(r2 + c1 + 1, r2 + 1);
ans %= MOD;
ans += combi(r1 + c1, r1);
ans %= MOD;
out(ans);
}
| replace | 36 | 37 | 36 | 37 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
const int INF = 1001001001;
const long long LINF = 1001002003004005006ll;
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;
typedef pair<int, int> P;
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;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination {
// fact 階乗 iface 階乗の逆数
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
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];
}
};
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ans = 0;
combination c(1000005);
ans += c(r2 + c2 + 2, c2 + 1) - 1;
ans -= c(r1 + c2 + 1, r1) - 1;
ans -= c(r2 + c1 + 1, c1) - 1;
ans += c(r1 + c1, c1) - 1;
cout << ans << endl;
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
const int INF = 1001001001;
const long long LINF = 1001002003004005006ll;
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;
typedef pair<int, int> P;
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;
}
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination {
// fact 階乗 iface 階乗の逆数
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
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];
}
};
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ans = 0;
combination c(2000005);
ans += c(r2 + c2 + 2, c2 + 1) - 1;
ans -= c(r1 + c2 + 1, r1) - 1;
ans -= c(r2 + c1 + 1, c1) - 1;
ans += c(r1 + c1, c1) - 1;
cout << ans << endl;
} | replace | 108 | 109 | 108 | 109 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <codecvt>
#include <complex>
#include <condition_variable>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll INF = (1LL << 62);
const double inf = pow(10, 10);
const ld pi = acosl(1);
const ll mod = 1000000007;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy[8] = {1, 1, 1, 0, -1, -1, -1, 0};
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<mod>;
template <typename T> struct Combination {
vector<T> _fact, _rfact, _inv;
Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
_fact[0] = _rfact[sz] = _inv[0] = 1;
for (int i = 1; i <= sz; i++)
_fact[i] = _fact[i - 1] * i;
_rfact[sz] /= _fact[sz];
for (int i = sz - 1; i >= 0; i--)
_rfact[i] = _rfact[i + 1] * (i + 1);
for (int i = 1; i <= sz; i++)
_inv[i] = _rfact[i] * _fact[i - 1];
}
inline T fact(int k) const { return _fact[k]; }
inline T rfact(int k) const { return _rfact[k]; }
inline T inv(int k) const { return _inv[k]; }
T P(int n, int r) const {
if (r < 0 || n < r)
return 0;
return fact(n) * rfact(n - r);
}
T C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return fact(p) * rfact(q) * rfact(p - q);
}
T H(int n, int r) const {
if (n < 0 || r < 0)
return (0);
return r == 0 ? 1 : C(n + r - 1, r);
}
};
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
Combination<modint> com(pow(10, 6) + 5);
modint ans = 0;
for (int r = 0; r <= r2; r++) {
ans += com.C(c2 + r + 1, c2);
}
for (int r = 0; r < r1; r++) {
ans -= com.C(c2 + r + 1, c2);
}
for (int r = 0; r <= r2; r++) {
ans -= com.C(c1 + r, c1 - 1);
}
for (int r = 0; r < r1; r++) {
ans += com.C(c1 + r, c1 - 1);
}
cout << ans << endl;
}
| #include <algorithm>
#include <array>
#include <atomic>
#include <bitset>
#include <cassert>
#include <ccomplex>
#include <cctype>
#include <cerrno>
#include <cfenv>
#include <cfloat>
#include <chrono>
#include <cinttypes>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <codecvt>
#include <complex>
#include <condition_variable>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstdbool>
#include <cstddef>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctgmath>
#include <ctime>
#include <cwchar>
#include <cwctype>
#include <deque>
#include <exception>
#include <forward_list>
#include <fstream>
#include <functional>
#include <future>
#include <initializer_list>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <mutex>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <system_error>
#include <thread>
#include <tuple>
#include <type_traits>
#include <typeindex>
#include <typeinfo>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <valarray>
#include <vector>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, n) for (int i = 1; i <= (int)(n); i++)
using namespace std;
typedef int64_t ll;
typedef long double ld;
const ll INF = (1LL << 62);
const double inf = pow(10, 10);
const ld pi = acosl(1);
const ll mod = 1000000007;
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
const int ddx[8] = {1, 0, -1, -1, -1, 0, 1, 1};
const int ddy[8] = {1, 1, 1, 0, -1, -1, -1, 0};
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<mod>;
template <typename T> struct Combination {
vector<T> _fact, _rfact, _inv;
Combination(int sz) : _fact(sz + 1), _rfact(sz + 1), _inv(sz + 1) {
_fact[0] = _rfact[sz] = _inv[0] = 1;
for (int i = 1; i <= sz; i++)
_fact[i] = _fact[i - 1] * i;
_rfact[sz] /= _fact[sz];
for (int i = sz - 1; i >= 0; i--)
_rfact[i] = _rfact[i + 1] * (i + 1);
for (int i = 1; i <= sz; i++)
_inv[i] = _rfact[i] * _fact[i - 1];
}
inline T fact(int k) const { return _fact[k]; }
inline T rfact(int k) const { return _rfact[k]; }
inline T inv(int k) const { return _inv[k]; }
T P(int n, int r) const {
if (r < 0 || n < r)
return 0;
return fact(n) * rfact(n - r);
}
T C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return fact(p) * rfact(q) * rfact(p - q);
}
T H(int n, int r) const {
if (n < 0 || r < 0)
return (0);
return r == 0 ? 1 : C(n + r - 1, r);
}
};
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
Combination<modint> com(10000007);
modint ans = 0;
for (int r = 0; r <= r2; r++) {
ans += com.C(c2 + r + 1, c2);
}
for (int r = 0; r < r1; r++) {
ans -= com.C(c2 + r + 1, c2);
}
for (int r = 0; r <= r2; r++) {
ans -= com.C(c1 + r, c1 - 1);
}
for (int r = 0; r < r1; r++) {
ans += com.C(c1 + r, c1 - 1);
}
cout << ans << endl;
}
| replace | 209 | 210 | 209 | 210 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e6 + 6;
ll r1, c1, r2, c2;
ll fac[N], infac[N];
ll sq(ll a) { return (a * a) % mod; }
ll pw(ll a, ll b) {
if (b == 0)
return 1;
if (b == 1)
return a % mod;
if (b & 1)
return (a * sq(pw(a, b >> 1))) % mod;
return sq(pw(a, b >> 1)) % mod;
}
ll ncr(ll n, ll r) {
if (n == r)
return 1;
if (n < r)
return 0;
ll res = fac[n];
res *= infac[r];
res %= mod;
res *= infac[n - r];
res %= mod;
return res;
}
int main() {
infac[1] = infac[0] = fac[0] = fac[1] = 1;
for (int i = 1; i < N; i++) {
fac[i] = fac[i - 1] * i;
fac[i] %= mod;
infac[i] = pw(fac[i], mod - 2);
}
cin >> r1 >> c1 >> r2 >> c2;
ll ans = 0;
for (ll i = c1; i <= c2; i++) {
ll tmp = ncr(r2 + i + 1, i + 1) - ncr(r1 + i, i + 1);
tmp += mod;
tmp %= mod;
ans += tmp;
ans %= mod;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 2e6 + 6;
ll r1, c1, r2, c2;
ll fac[N], infac[N];
ll sq(ll a) { return (a * a) % mod; }
ll pw(ll a, ll b) {
if (b == 0)
return 1;
if (b == 1)
return a % mod;
if (b & 1)
return (a * sq(pw(a, b >> 1))) % mod;
return sq(pw(a, b >> 1)) % mod;
}
ll ncr(ll n, ll r) {
if (n == r)
return 1;
if (n < r)
return 0;
ll res = fac[n];
res *= infac[r];
res %= mod;
res *= infac[n - r];
res %= mod;
return res;
}
int main() {
infac[1] = infac[0] = fac[0] = fac[1] = 1;
for (int i = 1; i < N; i++) {
fac[i] = fac[i - 1] * i;
fac[i] %= mod;
infac[i] = pw(fac[i], mod - 2);
}
cin >> r1 >> c1 >> r2 >> c2;
ll ans = 0;
for (ll i = c1; i <= c2; i++) {
ll tmp = ncr(r2 + i + 1, i + 1) - ncr(r1 + i, i + 1);
tmp += mod;
tmp %= mod;
ans += tmp;
ans %= mod;
}
cout << ans;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
#define MAX_N 200005
ll factorial[MAX_N];
void make_factorial_tableMOD() {
factorial[0] = 1;
for (int i = 1; i < MAX_N; i++) {
factorial[i] = factorial[i - 1] * i % MOD;
}
}
ll bisection_powerMOD(ll x, ll y) {
if (y == 0) {
return 1;
}
ll t = bisection_powerMOD(x * x % MOD, y / 2);
if (y % 2 == 1) {
t = t * x % MOD;
}
return t;
}
ll nCrMOD(int n, int r) {
if (n < r || n <= 0 || r < 0) {
return 0;
}
ll a = factorial[n];
ll b = a * bisection_powerMOD(factorial[r], (MOD - 2)) % MOD;
ll c = b * bisection_powerMOD(factorial[n - r], MOD - 2) % MOD;
return c % MOD;
}
int main() {
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
make_factorial_tableMOD();
ll ru = 0;
for (int i = 0; i <= r2; i++) {
ru += nCrMOD(i + c2 + 1, i + 1);
ru %= MOD;
}
// dbg(ru);
ll lu = 0;
for (int i = 0; i <= r2; i++) {
lu += nCrMOD(i + c1, i + 1);
lu %= MOD;
}
// dbg(lu);
ll rd = 0;
for (int i = 0; i <= c2; i++) {
rd += nCrMOD(i + r1, i + 1);
rd %= MOD;
}
// dbg(rd);
ll ld = 0;
for (int i = 0; i < c1; i++) {
ld += nCrMOD(i + r1, i + 1);
ld %= MOD;
}
// dbg(ld);
ll ans = ru - lu - rd + ld + 4 * MOD;
ans %= MOD;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define LLINF 9223372036854775807
#define MOD ll(1e9 + 7)
#define all(x) (x).begin(), (x).end()
#define dbg(x) cerr << #x << ": " << x << endl
#define MAX_N 2000005
ll factorial[MAX_N];
void make_factorial_tableMOD() {
factorial[0] = 1;
for (int i = 1; i < MAX_N; i++) {
factorial[i] = factorial[i - 1] * i % MOD;
}
}
ll bisection_powerMOD(ll x, ll y) {
if (y == 0) {
return 1;
}
ll t = bisection_powerMOD(x * x % MOD, y / 2);
if (y % 2 == 1) {
t = t * x % MOD;
}
return t;
}
ll nCrMOD(int n, int r) {
if (n < r || n <= 0 || r < 0) {
return 0;
}
ll a = factorial[n];
ll b = a * bisection_powerMOD(factorial[r], (MOD - 2)) % MOD;
ll c = b * bisection_powerMOD(factorial[n - r], MOD - 2) % MOD;
return c % MOD;
}
int main() {
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
make_factorial_tableMOD();
ll ru = 0;
for (int i = 0; i <= r2; i++) {
ru += nCrMOD(i + c2 + 1, i + 1);
ru %= MOD;
}
// dbg(ru);
ll lu = 0;
for (int i = 0; i <= r2; i++) {
lu += nCrMOD(i + c1, i + 1);
lu %= MOD;
}
// dbg(lu);
ll rd = 0;
for (int i = 0; i <= c2; i++) {
rd += nCrMOD(i + r1, i + 1);
rd %= MOD;
}
// dbg(rd);
ll ld = 0;
for (int i = 0; i < c1; i++) {
ld += nCrMOD(i + r1, i + 1);
ld %= MOD;
}
// dbg(ld);
ll ans = ru - lu - rd + ld + 4 * MOD;
ans %= MOD;
cout << ans << endl;
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02782 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define int long long
using i64 = long long;
#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 FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template <class T> inline void out(T t) { cout << t << "\n"; }
template <class T, class... Ts> inline void out(T t, Ts... ts) {
cout << t << " ";
out(ts...);
}
template <class T> inline bool CHMIN(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool CHMAX(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
constexpr int INF = 1e18;
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;
}
};
// 二項係数ライブラリ
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
const int MOD = 1000000007;
// const int MOD =
using mint = Fp<MOD>;
BiCoef<mint> bc;
// bc.init(500050);
signed main() {
bc.init(500050);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
auto f = [&](int r, int c) { return bc.com(r + c + 2, c + 1) - r - c - 2; };
cout << f(r2, c2) - f(r2, c1 - 1) - f(r1 - 1, c2) + f(r1 - 1, c1 - 1) << endl;
} | #include "bits/stdc++.h"
using namespace std;
#define int long long
using i64 = long long;
#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 FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template <class T> inline void out(T t) { cout << t << "\n"; }
template <class T, class... Ts> inline void out(T t, Ts... ts) {
cout << t << " ";
out(ts...);
}
template <class T> inline bool CHMIN(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool CHMAX(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
constexpr int INF = 1e18;
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;
}
};
// 二項係数ライブラリ
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
const int MOD = 1000000007;
// const int MOD =
using mint = Fp<MOD>;
BiCoef<mint> bc;
// bc.init(500050);
signed main() {
bc.init(2000020);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
auto f = [&](int r, int c) { return bc.com(r + c + 2, c + 1) - r - c - 2; };
cout << f(r2, c2) - f(r2, c1 - 1) - f(r1 - 1, c2) + f(r1 - 1, c1 - 1) << endl;
} | replace | 138 | 139 | 138 | 139 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define lb(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define ub(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
using Pair = pair<ll, pair<int, int>>;
#define pq priority_queue<Pair, vector<Pair>, greater<Pair>>
const ll mod = 1000000007;
// const ll mod=998244353;
const ld pi = acos(-1.0);
const ll INF = 1LL << 61;
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;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
// intの最大値2147483647 ≒ 2×10^9
// long longの最大値9223372036854775807 ≒ 9×10^18
//'大文字'+=32; で小文字に
// cout << fixed << setprecision (20); 小数点以下2０桁まで
// 実行時間制約2秒では２×10^8回くらいまで計算できる
// ——————————————————modint———————————————————————————
#define MAX 2000000 // 階乗をいくつまで計算するか
class mint {
ll val;
static ll *invs, *facts, *finvs;
// 階乗, 逆元, 階乗の逆元をMAXまで求める
bool initMint() {
invs[1] = facts[0] = facts[1] = finvs[0] = finvs[1] = 1;
for (int i = 2; i <= MAX; i++) {
invs[i] = -invs[MOD % i] * (MOD / i) % MOD;
facts[i] = facts[i - 1] * i % MOD;
finvs[i] = finvs[i - 1] * invs[i] % MOD;
}
return true;
}
public:
static ll MOD; // modの元
// 初期化 値を引数に与えなかった場合はval=0としておく
mint(ll init = 0) : val(init) {
static bool call_once =
initMint(); // static変数の性質により一度だけ呼ばれる
assert(call_once); // unusedの回避
if (val < 0 || val >= MOD)
val %= MOD;
if (val < 0)
val += MOD; // 0以上であることを保証
}
inline ll toll() { return this->val; }
// 代入
void operator=(const mint &r) { this->val = r.val; }
void operator=(const ll &r) { *this = mint(r); }
// 足し算; 符号反転; 引き算
mint operator+(const mint &r) {
ll ans = this->val + r.val;
if (ans >= MOD)
ans -= MOD;
return mint(ans);
}
mint operator-() {
ll ans = MOD - this->val;
return mint(ans);
}
mint operator-(const mint &r) {
mint rr = r;
return *this + (-rr);
}
// かけ算; 逆元; わり算
mint operator*(const mint &r) {
ll ans = this->val * r.val;
return mint(ans);
}
mint inv() {
assert(this->val != 0);
if (this->val == 1)
return mint(1);
mint p, q = *this, m(0), n(1), r, c;
p.val = MOD;
while (q.val > MAX) {
r = p.val % q.val;
c = m.val - n.val * (p.val / q.val);
p = q, q = r, m = n, n = c;
}
return n * invs[q.val];
}
mint operator/(const mint &r) { return *this * mint(r).inv(); }
mint operator%(const mint &r) { return mint(this->val % r.val); }
// ++ -- 前付きと後ろ付き
void operator++() { ++this->val; }
void operator++(int a) {
a = 0;
this->val++;
}
void operator--() { --this->val; }
void operator--(int a) {
a = 0;
this->val--;
}
// 四則演算&代入
void operator+=(const mint &r) { *this = *this + r; }
void operator-=(const mint &r) { *this = *this - r; }
void operator*=(const mint &r) { *this = *this * r; }
void operator/=(const mint &r) { *this = *this / r; }
void operator%=(const mint &r) { *this = *this % r; }
// べき乗
mint pow(long n) {
if (n < 0)
return inv().pow(-n); // 逆元の-n乗
else if (n == 0)
return mint(1);
mint half = pow(n / 2);
if (n % 2)
return *this * half * half;
else
return half * half;
}
mint pow(mint n) { return pow(n.val); }
// 順列
mint per(mint _k) {
assert(this->val <= MAX);
const ll n = this->val, k = _k.val;
if (k < 0 || k > n)
return 0;
if (k == 0)
return 1;
if (k == n)
return facts[n];
return mint(facts[n]) * finvs[n - k];
}
// コンビネーション
mint com(mint _k) {
assert(this->val <= MAX);
const ll n = this->val, k = _k.val;
if (k < 0 || k > n)
return 0;
if (k == 0 || k == n)
return 1;
return mint(facts[n]) * finvs[k] * finvs[n - k];
}
// 階乗
mint fact() {
assert(this->val <= MAX);
return mint(facts[this->val]);
}
friend bool operator<(const mint &l, const mint &r) { return l.val < r.val; }
friend bool operator>(const mint &l, const mint &r) { return l.val > r.val; }
friend bool operator==(const mint &l, const mint &r) {
return l.val == r.val;
}
friend bool operator!=(const mint &l, const mint &r) {
return !(l.val == r.val);
}
friend bool operator<=(const mint &l, const mint &r) {
return !(l.val > r.val);
}
friend bool operator>=(const mint &l, const mint &r) {
return !(l.val < r.val);
}
friend ostream &operator<<(ostream &os, const mint &out) {
os << out.val;
return os;
}
friend istream &operator>>(istream &is, mint &in) {
ll inl;
is >> inl;
in.val = inl % mint::MOD;
return is;
}
};
// べき乗
inline mint mpow(ll n, ll k) { return mint(n).pow(k); }
// 順列
inline mint mper(ll n, ll k) { return mint(n).per(k); }
// コンビネーション
inline mint mcom(ll n, ll k) { return mint(n).com(k); }
// 階乗
inline mint mfac(ll n) { return mint(n).fact(); }
// static変数
ll *mint::invs = new ll[MAX + 1];
ll *mint::facts = new ll[MAX + 1];
ll *mint::finvs = new ll[MAX + 1];
ll mint::MOD = (ll)1e9 + 7;
// —————————————————————————————————————————————————
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c, d;
cin >> a >> b >> c >> d;
mint ans = 0;
ans += mcom(c + d + 2, c + 1) - 1;
ans -= mcom(a + d + 1, a) - 1;
ans -= mcom(b + c + 1, b) - 1;
ans += mcom(a + b, a) - 1;
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
#define ll long long
#define ld long double
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repo(i, n) for (int i = 1; i < (int)(n); i++)
#define pb push_back
#define mp make_pair
#define np next_permutation
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
#define uniq(v) v.erase(unique(v.begin(), v.end()), v.end())
#define lb(v, x) (lower_bound(v.begin(), v.end(), x) - v.begin())
#define ub(v, x) (upper_bound(v.begin(), v.end(), x) - v.begin())
using Pair = pair<ll, pair<int, int>>;
#define pq priority_queue<Pair, vector<Pair>, greater<Pair>>
const ll mod = 1000000007;
// const ll mod=998244353;
const ld pi = acos(-1.0);
const ll INF = 1LL << 61;
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;
}
ll gcd(ll x, ll y) { return y ? gcd(y, x % y) : x; }
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; }
// intの最大値2147483647 ≒ 2×10^9
// long longの最大値9223372036854775807 ≒ 9×10^18
//'大文字'+=32; で小文字に
// cout << fixed << setprecision (20); 小数点以下2０桁まで
// 実行時間制約2秒では２×10^8回くらいまで計算できる
// ——————————————————modint———————————————————————————
#define MAX 2000020 // 階乗をいくつまで計算するか
class mint {
ll val;
static ll *invs, *facts, *finvs;
// 階乗, 逆元, 階乗の逆元をMAXまで求める
bool initMint() {
invs[1] = facts[0] = facts[1] = finvs[0] = finvs[1] = 1;
for (int i = 2; i <= MAX; i++) {
invs[i] = -invs[MOD % i] * (MOD / i) % MOD;
facts[i] = facts[i - 1] * i % MOD;
finvs[i] = finvs[i - 1] * invs[i] % MOD;
}
return true;
}
public:
static ll MOD; // modの元
// 初期化 値を引数に与えなかった場合はval=0としておく
mint(ll init = 0) : val(init) {
static bool call_once =
initMint(); // static変数の性質により一度だけ呼ばれる
assert(call_once); // unusedの回避
if (val < 0 || val >= MOD)
val %= MOD;
if (val < 0)
val += MOD; // 0以上であることを保証
}
inline ll toll() { return this->val; }
// 代入
void operator=(const mint &r) { this->val = r.val; }
void operator=(const ll &r) { *this = mint(r); }
// 足し算; 符号反転; 引き算
mint operator+(const mint &r) {
ll ans = this->val + r.val;
if (ans >= MOD)
ans -= MOD;
return mint(ans);
}
mint operator-() {
ll ans = MOD - this->val;
return mint(ans);
}
mint operator-(const mint &r) {
mint rr = r;
return *this + (-rr);
}
// かけ算; 逆元; わり算
mint operator*(const mint &r) {
ll ans = this->val * r.val;
return mint(ans);
}
mint inv() {
assert(this->val != 0);
if (this->val == 1)
return mint(1);
mint p, q = *this, m(0), n(1), r, c;
p.val = MOD;
while (q.val > MAX) {
r = p.val % q.val;
c = m.val - n.val * (p.val / q.val);
p = q, q = r, m = n, n = c;
}
return n * invs[q.val];
}
mint operator/(const mint &r) { return *this * mint(r).inv(); }
mint operator%(const mint &r) { return mint(this->val % r.val); }
// ++ -- 前付きと後ろ付き
void operator++() { ++this->val; }
void operator++(int a) {
a = 0;
this->val++;
}
void operator--() { --this->val; }
void operator--(int a) {
a = 0;
this->val--;
}
// 四則演算&代入
void operator+=(const mint &r) { *this = *this + r; }
void operator-=(const mint &r) { *this = *this - r; }
void operator*=(const mint &r) { *this = *this * r; }
void operator/=(const mint &r) { *this = *this / r; }
void operator%=(const mint &r) { *this = *this % r; }
// べき乗
mint pow(long n) {
if (n < 0)
return inv().pow(-n); // 逆元の-n乗
else if (n == 0)
return mint(1);
mint half = pow(n / 2);
if (n % 2)
return *this * half * half;
else
return half * half;
}
mint pow(mint n) { return pow(n.val); }
// 順列
mint per(mint _k) {
assert(this->val <= MAX);
const ll n = this->val, k = _k.val;
if (k < 0 || k > n)
return 0;
if (k == 0)
return 1;
if (k == n)
return facts[n];
return mint(facts[n]) * finvs[n - k];
}
// コンビネーション
mint com(mint _k) {
assert(this->val <= MAX);
const ll n = this->val, k = _k.val;
if (k < 0 || k > n)
return 0;
if (k == 0 || k == n)
return 1;
return mint(facts[n]) * finvs[k] * finvs[n - k];
}
// 階乗
mint fact() {
assert(this->val <= MAX);
return mint(facts[this->val]);
}
friend bool operator<(const mint &l, const mint &r) { return l.val < r.val; }
friend bool operator>(const mint &l, const mint &r) { return l.val > r.val; }
friend bool operator==(const mint &l, const mint &r) {
return l.val == r.val;
}
friend bool operator!=(const mint &l, const mint &r) {
return !(l.val == r.val);
}
friend bool operator<=(const mint &l, const mint &r) {
return !(l.val > r.val);
}
friend bool operator>=(const mint &l, const mint &r) {
return !(l.val < r.val);
}
friend ostream &operator<<(ostream &os, const mint &out) {
os << out.val;
return os;
}
friend istream &operator>>(istream &is, mint &in) {
ll inl;
is >> inl;
in.val = inl % mint::MOD;
return is;
}
};
// べき乗
inline mint mpow(ll n, ll k) { return mint(n).pow(k); }
// 順列
inline mint mper(ll n, ll k) { return mint(n).per(k); }
// コンビネーション
inline mint mcom(ll n, ll k) { return mint(n).com(k); }
// 階乗
inline mint mfac(ll n) { return mint(n).fact(); }
// static変数
ll *mint::invs = new ll[MAX + 1];
ll *mint::facts = new ll[MAX + 1];
ll *mint::finvs = new ll[MAX + 1];
ll mint::MOD = (ll)1e9 + 7;
// —————————————————————————————————————————————————
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll a, b, c, d;
cin >> a >> b >> c >> d;
mint ans = 0;
ans += mcom(c + d + 2, c + 1) - 1;
ans -= mcom(a + d + 1, a) - 1;
ans -= mcom(b + c + 1, b) - 1;
ans += mcom(a + b, a) - 1;
cout << ans << endl;
}
| replace | 46 | 47 | 46 | 47 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2> bool chmin(T1 &l, const T2 &r);
template <class T1, class T2> bool chmax(T1 &l, const T2 &r);
template <signed M, unsigned T> struct mod_int {
constexpr static signed MODULO = M;
constexpr static unsigned TABLE_SIZE = T;
signed x;
mod_int() : x(0) {}
mod_int(long long y)
: x(static_cast<signed>(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO)) {}
mod_int(int y) : x(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO) {}
mod_int &operator+=(const mod_int &rhs) {
if ((x += rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((x += MODULO - rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
x = static_cast<signed>(1LL * x * rhs.x % MODULO);
return *this;
}
mod_int &operator/=(const mod_int &rhs) {
x = static_cast<signed>((1LL * x * rhs.inv().x) % MODULO);
return *this;
}
mod_int operator-() const { return mod_int(-x); }
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
bool operator<(const mod_int &rhs) const { return x < rhs.x; }
mod_int inv() const {
assert(x != 0);
if (x <= static_cast<signed>(TABLE_SIZE)) {
if (_inv[1].x == 0)
prepare();
return _inv[x];
} else {
signed a = x, b = MODULO, u = 1, v = 0, t;
while (b) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return mod_int(u);
}
}
mod_int pow(long long t) const {
assert(!(x == 0 && t == 0));
mod_int e = *this, res = mod_int(1);
for (; t; e *= e, t >>= 1)
if (t & 1)
res *= e;
return res;
}
mod_int fact() {
if (_fact[0].x == 0)
prepare();
return _fact[x];
}
mod_int inv_fact() {
if (_fact[0].x == 0)
prepare();
return _inv_fact[x];
}
mod_int choose(mod_int y) {
assert(y.x <= x);
return this->fact() * y.inv_fact() * mod_int(x - y.x).inv_fact();
}
static mod_int _inv[TABLE_SIZE + 1];
static mod_int _fact[TABLE_SIZE + 1];
static mod_int _inv_fact[TABLE_SIZE + 1];
static void prepare() {
_inv[1] = 1;
for (int i = 2; i <= (int)TABLE_SIZE; ++i) {
_inv[i] = 1LL * _inv[MODULO % i].x * (MODULO - MODULO / i) % MODULO;
}
_fact[0] = 1;
for (unsigned i = 1; i <= TABLE_SIZE; ++i) {
_fact[i] = _fact[i - 1] * int(i);
}
_inv_fact[TABLE_SIZE] = _fact[TABLE_SIZE].inv();
for (int i = (int)TABLE_SIZE - 1; i >= 0; --i) {
_inv_fact[i] = _inv_fact[i + 1] * (i + 1);
}
}
};
template <int M, unsigned F>
std::ostream &operator<<(std::ostream &os, const mod_int<M, F> &rhs) {
return os << rhs.x;
}
template <int M, unsigned F>
std::istream &operator>>(std::istream &is, mod_int<M, F> &rhs) {
long long s;
is >> s;
rhs = mod_int<M, F>(s);
return is;
}
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_inv[TABLE_SIZE + 1];
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
mod_int<M, F> mod_int<M, F>::_inv_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
bool operator==(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return lhs.x == rhs.x;
}
template <int M, unsigned F>
bool operator!=(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return !(lhs == rhs);
}
const int MF = 100005, MOD = 1000000007;
using mint = mod_int<MOD, MF>;
mint binom(int n, int r) {
return (r < 0 || r > n || n < 0) ? 0 : mint(n).choose(r);
}
mint fact(int n) { return mint(n).fact(); }
mint inv_fact(int n) { return mint(n).inv_fact(); }
mint rect(int n, int m) {
if (n < 0 || m < 0)
return mint(0);
return (mint(n + 2) * binom(n + m + 2, n + 2) - m - 1) / mint(m + 1);
}
mint rect(int l1, int r1, int l2, int r2) {
return rect(l2, r2) - rect(l2, r1 - 1) - rect(l1 - 1, r2) +
rect(l1 - 1, r1 - 1);
}
void solve(std::vector<long long> r, std::vector<long long> c) {
cout << rect(r[0], c[0], r[1], c[1]) << endl;
}
int main() {
std::vector<long long> r(2);
std::vector<long long> c(2);
for (int i = 0; i < 2; i++) {
scanf("%lld", &r[i]);
scanf("%lld", &c[i]);
}
solve(std::move(r), std::move(c));
return 0;
}
// -- lib
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T1, class T2> bool chmin(T1 &l, const T2 &r) {
return (l > r) ? (l = r, true) : false;
}
template <class T1, class T2> bool chmax(T1 &l, const T2 &r) {
return (l < r) ? (l = r, true) : false;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (lli i = 0; i < (n); i++)
#define rrep(i, n) for (lli i = (n)-1; i >= 0; i--)
using namespace std;
using lli = long long int;
void YESNO(bool), YesNo(bool);
template <class T1, class T2> bool chmin(T1 &l, const T2 &r);
template <class T1, class T2> bool chmax(T1 &l, const T2 &r);
template <signed M, unsigned T> struct mod_int {
constexpr static signed MODULO = M;
constexpr static unsigned TABLE_SIZE = T;
signed x;
mod_int() : x(0) {}
mod_int(long long y)
: x(static_cast<signed>(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO)) {}
mod_int(int y) : x(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO) {}
mod_int &operator+=(const mod_int &rhs) {
if ((x += rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((x += MODULO - rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
x = static_cast<signed>(1LL * x * rhs.x % MODULO);
return *this;
}
mod_int &operator/=(const mod_int &rhs) {
x = static_cast<signed>((1LL * x * rhs.inv().x) % MODULO);
return *this;
}
mod_int operator-() const { return mod_int(-x); }
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
bool operator<(const mod_int &rhs) const { return x < rhs.x; }
mod_int inv() const {
assert(x != 0);
if (x <= static_cast<signed>(TABLE_SIZE)) {
if (_inv[1].x == 0)
prepare();
return _inv[x];
} else {
signed a = x, b = MODULO, u = 1, v = 0, t;
while (b) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return mod_int(u);
}
}
mod_int pow(long long t) const {
assert(!(x == 0 && t == 0));
mod_int e = *this, res = mod_int(1);
for (; t; e *= e, t >>= 1)
if (t & 1)
res *= e;
return res;
}
mod_int fact() {
if (_fact[0].x == 0)
prepare();
return _fact[x];
}
mod_int inv_fact() {
if (_fact[0].x == 0)
prepare();
return _inv_fact[x];
}
mod_int choose(mod_int y) {
assert(y.x <= x);
return this->fact() * y.inv_fact() * mod_int(x - y.x).inv_fact();
}
static mod_int _inv[TABLE_SIZE + 1];
static mod_int _fact[TABLE_SIZE + 1];
static mod_int _inv_fact[TABLE_SIZE + 1];
static void prepare() {
_inv[1] = 1;
for (int i = 2; i <= (int)TABLE_SIZE; ++i) {
_inv[i] = 1LL * _inv[MODULO % i].x * (MODULO - MODULO / i) % MODULO;
}
_fact[0] = 1;
for (unsigned i = 1; i <= TABLE_SIZE; ++i) {
_fact[i] = _fact[i - 1] * int(i);
}
_inv_fact[TABLE_SIZE] = _fact[TABLE_SIZE].inv();
for (int i = (int)TABLE_SIZE - 1; i >= 0; --i) {
_inv_fact[i] = _inv_fact[i + 1] * (i + 1);
}
}
};
template <int M, unsigned F>
std::ostream &operator<<(std::ostream &os, const mod_int<M, F> &rhs) {
return os << rhs.x;
}
template <int M, unsigned F>
std::istream &operator>>(std::istream &is, mod_int<M, F> &rhs) {
long long s;
is >> s;
rhs = mod_int<M, F>(s);
return is;
}
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_inv[TABLE_SIZE + 1];
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
mod_int<M, F> mod_int<M, F>::_inv_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
bool operator==(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return lhs.x == rhs.x;
}
template <int M, unsigned F>
bool operator!=(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return !(lhs == rhs);
}
const int MF = 2000005, MOD = 1000000007;
using mint = mod_int<MOD, MF>;
mint binom(int n, int r) {
return (r < 0 || r > n || n < 0) ? 0 : mint(n).choose(r);
}
mint fact(int n) { return mint(n).fact(); }
mint inv_fact(int n) { return mint(n).inv_fact(); }
mint rect(int n, int m) {
if (n < 0 || m < 0)
return mint(0);
return (mint(n + 2) * binom(n + m + 2, n + 2) - m - 1) / mint(m + 1);
}
mint rect(int l1, int r1, int l2, int r2) {
return rect(l2, r2) - rect(l2, r1 - 1) - rect(l1 - 1, r2) +
rect(l1 - 1, r1 - 1);
}
void solve(std::vector<long long> r, std::vector<long long> c) {
cout << rect(r[0], c[0], r[1], c[1]) << endl;
}
int main() {
std::vector<long long> r(2);
std::vector<long long> c(2);
for (int i = 0; i < 2; i++) {
scanf("%lld", &r[i]);
scanf("%lld", &c[i]);
}
solve(std::move(r), std::move(c));
return 0;
}
// -- lib
void YESNO(bool b) { cout << (b ? "YES" : "NO") << endl; }
void YesNo(bool b) { cout << (b ? "Yes" : "No") << endl; }
template <class T1, class T2> bool chmin(T1 &l, const T2 &r) {
return (l > r) ? (l = r, true) : false;
}
template <class T1, class T2> bool chmax(T1 &l, const T2 &r) {
return (l < r) ? (l = r, true) : false;
}
| replace | 152 | 153 | 152 | 153 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; } // 最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } // 最小公倍数
using Graph = vector<vector<int>>;
ll inf = 300000000000000000;
const double PI = 3.14159265358979323846;
const int MAX = 1000001;
const ll 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;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1; // a^n%mod
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
COMinit();
cout << (COM(c + 1 + d + 1, c + 1) + COM(a + b, a) - COM(a + d + 1, a) -
COM(c + b + 1, b) + MOD * 2) %
MOD
<< endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ll long long
ll gcd(int x, int y) { return (x % y) ? gcd(y, x % y) : y; } // 最大公約数
ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } // 最小公倍数
using Graph = vector<vector<int>>;
ll inf = 300000000000000000;
const double PI = 3.14159265358979323846;
const int MAX = 2000005;
const ll 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;
}
long long modpow(long long a, long long n, long long mod) {
long long res = 1; // a^n%mod
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
COMinit();
cout << (COM(c + 1 + d + 1, c + 1) + COM(a + b, a) - COM(a + d + 1, a) -
COM(c + b + 1, b) + MOD * 2) %
MOD
<< endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define SZ(x) x.size()
#define fi first
#define se second
const int INF = 1e9;
using namespace std;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using pi = pair<int, int>;
using vi = vc<int>;
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;
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>;
const int MX = 777777 + 5;
int fac[MX + 5], inv[MX + 5];
int power(int x, int y, int p) {
int res = 1;
x = x % p;
while (y) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
void init() {
int n = MX + 4;
fac[0] = 1;
for (int i = 0; i < n; ++i)
fac[i + 1] = fac[i] * (i + 1) % MOD;
inv[n] = power(fac[n], MOD - 2, MOD);
for (int i = n - 1; i >= 0; --i)
inv[i] = inv[i + 1] * (i + 1) % MOD;
}
int comb(int n, int r) { return (fac[n] * inv[r]) % MOD * inv[n - r] % MOD; }
int g(int r, int c) {
int pos = comb(r + c + 2, r + 1) - 1;
if (pos < 0)
pos += MOD;
return pos;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
init();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ans = 0;
ans += g(r2, c2);
ans -= g(r1 - 1, c2);
ans -= g(r2, c1 - 1);
ans += g(r1 - 1, c1 - 1);
cout << ans << endl;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define SZ(x) x.size()
#define fi first
#define se second
const int INF = 1e9;
using namespace std;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using pi = pair<int, int>;
using vi = vc<int>;
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;
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>;
const int MX = 7777777 + 5;
int fac[MX + 5], inv[MX + 5];
int power(int x, int y, int p) {
int res = 1;
x = x % p;
while (y) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
void init() {
int n = MX + 4;
fac[0] = 1;
for (int i = 0; i < n; ++i)
fac[i + 1] = fac[i] * (i + 1) % MOD;
inv[n] = power(fac[n], MOD - 2, MOD);
for (int i = n - 1; i >= 0; --i)
inv[i] = inv[i + 1] * (i + 1) % MOD;
}
int comb(int n, int r) { return (fac[n] * inv[r]) % MOD * inv[n - r] % MOD; }
int g(int r, int c) {
int pos = comb(r + c + 2, r + 1) - 1;
if (pos < 0)
pos += MOD;
return pos;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
init();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ans = 0;
ans += g(r2, c2);
ans -= g(r1 - 1, c2);
ans -= g(r2, c1 - 1);
ans += g(r1 - 1, c1 - 1);
cout << ans << endl;
} | replace | 117 | 118 | 117 | 118 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define EPS 1e-9
// #define PI 3.14159265358979
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &A) {
for (int i = 0; i < A.size(); i++)
os << A[i] << " ";
os << endl;
return os;
}
template <> ostream &operator<<(ostream &os, const vector<vector<int>> &A) {
int N = A.size();
int M;
if (N > 0)
M = A[0].size();
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)
os << A[i][j] << " ";
os << endl;
}
return os;
}
typedef pair<int, int> pii;
typedef long long ll;
struct edge {
int from, to, d, c;
edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
from = _from;
to = _to;
d = _d;
c = _c;
}
bool operator<(const edge &rhs) const {
return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
}
};
struct aabb {
int x1, y1, x2, y2;
aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};
typedef vector<edge> edges;
typedef vector<edges> graph;
struct flow {
int to, cap, rev, cost;
flow(int to = 0, int cap = 0, int rev = 0, int cost = 0)
: to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector<vector<flow>> flows;
const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);
int pow2(int n) { return 1LL << n; }
template <typename T, typename U> bool chmin(T &x, const U &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T, typename U> bool chmax(T &x, const U &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
struct initializer {
initializer() { cout << fixed << setprecision(20); }
};
initializer _____;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll factorial(ll x) {
if (x == 1)
return 1;
else
return x * factorial(x - 1);
}
ll Mfactorial(ll x, ll m) {
ll ret = 1;
for (ll i = 1; i <= x; i++) {
ret *= i;
ret %= m;
}
return ret;
}
vector<int> MfactTable(int n, int m) {
vector<int> ret(n + 1);
ret[0] = 1;
int tmp = 1;
for (int i = 1; i <= n; i++) {
tmp *= i;
tmp %= m;
ret[i] = tmp;
}
return ret;
}
int Minverse(int a, int m) {
int x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
int McombSmall(int n, int k, int m) {
// O(n)
int ret = Mfactorial(n, m);
ret *= Minverse(Mfactorial(k, m), m);
ret %= m;
ret *= Minverse(Mfactorial(n - k, m), m);
return ret % m;
}
int McombFromFactTable(vector<int> &T, int n, int k, int m) {
if (k > n)
return 0;
int ret = T[n];
ret *= Minverse(T[k], m);
ret %= m;
ret *= Minverse(T[n - k], m);
return ret % m;
}
ll pow(ll x, int n) {
if (n == 0)
return 1;
ll ret = (n & 1) ? x : 1;
ll a = pow(x, n / 2);
return ret * a * a;
}
ll Mpow(ll x, int n, int m) {
if (n == 0)
return 1;
ll ret = (n & 1) ? x : 1;
ll a = Mpow(x, n / 2, m);
return (((ret * a) % m) * a) % m;
}
vector<vector<int>> combTable(int N) {
vector<vector<int>> ret(N + 1, vector<int>(N + 1));
for (int i = 0; i <= N; i++)
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i)
ret[i][j] = 1;
else
ret[i][j] = ret[i - 1][j - 1] + ret[i - 1][j];
}
return ret;
}
int countNmodPisQlr(int l, int r, int P, int Q) {
// r>=l>=0
return (r - Q + P) / P - (l - Q + P - 1) / P;
}
int N, M, K, T, Q, H, W;
signed main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int ans = 0;
vector<int> t = MfactTable(1e6 + 10, MOD);
for (int c = c1; c <= c2; c++) {
int tmp = (McombFromFactTable(t, c + r2 + 1, c + 1, MOD) -
McombFromFactTable(t, c + r1, c + 1, MOD) + MOD) %
MOD;
(ans += tmp) %= MOD;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#include <climits>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
#define MOD 1000000007
#define MOD2 998244353
#define int long long
#define EPS 1e-9
// #define PI 3.14159265358979
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
template <typename T> ostream &operator<<(ostream &os, const vector<T> &A) {
for (int i = 0; i < A.size(); i++)
os << A[i] << " ";
os << endl;
return os;
}
template <> ostream &operator<<(ostream &os, const vector<vector<int>> &A) {
int N = A.size();
int M;
if (N > 0)
M = A[0].size();
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++)
os << A[i][j] << " ";
os << endl;
}
return os;
}
typedef pair<int, int> pii;
typedef long long ll;
struct edge {
int from, to, d, c;
edge(int _from = 0, int _to = 0, int _d = 0, int _c = 0) {
from = _from;
to = _to;
d = _d;
c = _c;
}
bool operator<(const edge &rhs) const {
return (d == rhs.d) ? (c < rhs.c) : (d < rhs.d);
}
};
struct aabb {
int x1, y1, x2, y2;
aabb(int x1, int y1, int x2, int y2) : x1(x1), y1(y1), x2(x2), y2(y2) {}
};
typedef vector<edge> edges;
typedef vector<edges> graph;
struct flow {
int to, cap, rev, cost;
flow(int to = 0, int cap = 0, int rev = 0, int cost = 0)
: to(to), cap(cap), rev(rev), cost(cost) {}
};
typedef vector<vector<flow>> flows;
const int di[4] = {0, -1, 0, 1};
const int dj[4] = {-1, 0, 1, 0};
const int ci[5] = {0, 0, -1, 0, 1};
const int cj[5] = {0, -1, 0, 1, 0};
const ll LINF = LLONG_MAX / 2;
const int INF = INT_MAX / 2;
const double PI = acos(-1);
int pow2(int n) { return 1LL << n; }
template <typename T, typename U> bool chmin(T &x, const U &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T, typename U> bool chmax(T &x, const U &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
struct initializer {
initializer() { cout << fixed << setprecision(20); }
};
initializer _____;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
int d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll factorial(ll x) {
if (x == 1)
return 1;
else
return x * factorial(x - 1);
}
ll Mfactorial(ll x, ll m) {
ll ret = 1;
for (ll i = 1; i <= x; i++) {
ret *= i;
ret %= m;
}
return ret;
}
vector<int> MfactTable(int n, int m) {
vector<int> ret(n + 1);
ret[0] = 1;
int tmp = 1;
for (int i = 1; i <= n; i++) {
tmp *= i;
tmp %= m;
ret[i] = tmp;
}
return ret;
}
int Minverse(int a, int m) {
int x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
int McombSmall(int n, int k, int m) {
// O(n)
int ret = Mfactorial(n, m);
ret *= Minverse(Mfactorial(k, m), m);
ret %= m;
ret *= Minverse(Mfactorial(n - k, m), m);
return ret % m;
}
int McombFromFactTable(vector<int> &T, int n, int k, int m) {
if (k > n)
return 0;
int ret = T[n];
ret *= Minverse(T[k], m);
ret %= m;
ret *= Minverse(T[n - k], m);
return ret % m;
}
ll pow(ll x, int n) {
if (n == 0)
return 1;
ll ret = (n & 1) ? x : 1;
ll a = pow(x, n / 2);
return ret * a * a;
}
ll Mpow(ll x, int n, int m) {
if (n == 0)
return 1;
ll ret = (n & 1) ? x : 1;
ll a = Mpow(x, n / 2, m);
return (((ret * a) % m) * a) % m;
}
vector<vector<int>> combTable(int N) {
vector<vector<int>> ret(N + 1, vector<int>(N + 1));
for (int i = 0; i <= N; i++)
for (int j = 0; j <= i; j++) {
if (j == 0 || j == i)
ret[i][j] = 1;
else
ret[i][j] = ret[i - 1][j - 1] + ret[i - 1][j];
}
return ret;
}
int countNmodPisQlr(int l, int r, int P, int Q) {
// r>=l>=0
return (r - Q + P) / P - (l - Q + P - 1) / P;
}
int N, M, K, T, Q, H, W;
signed main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int ans = 0;
vector<int> t = MfactTable(2e6 + 10, MOD);
for (int c = c1; c <= c2; c++) {
int tmp = (McombFromFactTable(t, c + r2 + 1, c + 1, MOD) -
McombFromFactTable(t, c + r1, c + 1, MOD) + MOD) %
MOD;
(ans += tmp) %= MOD;
}
cout << ans << endl;
return 0;
} | replace | 201 | 202 | 201 | 202 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define bug(x) cout << "zdongdebug1: " << x << endl;
#define bug2(x, y) cout << "zdongdebug2: " << x << " " << y << endl;
#define bug3(x, y, z) \
cout << "zdongdebug3: " << x << " " << y << " " << z << endl;
using namespace std;
typedef long long ll;
const int maxn = 1000005;
const int mod = 1000000007;
void gcd(ll a, ll b, ll &d, ll &x, ll &y) {
if (!b) {
d = a;
x = 1;
y = 0;
} else {
gcd(b, a % b, d, y, x);
y -= a / b * x;
}
}
ll inv(ll a, ll n) {
ll d, x, y;
gcd(a, n, d, x, y);
return d == 1 ? (x % n + n) % (n / d) : -1;
}
ll p[maxn];
ll solve(int r, int c) {
ll ret = 0;
for (int i = 0; i <= c; i++) {
ret += p[r + i + 1] * inv(p[i + 1] * p[r] % mod, mod) % mod;
ret %= mod;
}
return ret;
}
int main() {
#ifdef suiyuan2009
freopen("/Users/suiyuan2009/CLionProjects/icpc/input.txt", "r", stdin);
// freopen("/Users/suiyuan2009/CLionProjects/icpc/output.txt", "w", stdout);
#endif
p[0] = 1;
for (int i = 1; i < maxn; i++)
p[i] = p[i - 1] * i % mod;
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ret = (solve(r2, c2) + solve(r1 - 1, c1 - 1) - solve(r1 - 1, c2) -
solve(r2, c1 - 1));
ret = (ret % mod + mod) % mod;
cout << ret << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define bug(x) cout << "zdongdebug1: " << x << endl;
#define bug2(x, y) cout << "zdongdebug2: " << x << " " << y << endl;
#define bug3(x, y, z) \
cout << "zdongdebug3: " << x << " " << y << " " << z << endl;
using namespace std;
typedef long long ll;
const int maxn = 2000005;
const int mod = 1000000007;
void gcd(ll a, ll b, ll &d, ll &x, ll &y) {
if (!b) {
d = a;
x = 1;
y = 0;
} else {
gcd(b, a % b, d, y, x);
y -= a / b * x;
}
}
ll inv(ll a, ll n) {
ll d, x, y;
gcd(a, n, d, x, y);
return d == 1 ? (x % n + n) % (n / d) : -1;
}
ll p[maxn];
ll solve(int r, int c) {
ll ret = 0;
for (int i = 0; i <= c; i++) {
ret += p[r + i + 1] * inv(p[i + 1] * p[r] % mod, mod) % mod;
ret %= mod;
}
return ret;
}
int main() {
#ifdef suiyuan2009
freopen("/Users/suiyuan2009/CLionProjects/icpc/input.txt", "r", stdin);
// freopen("/Users/suiyuan2009/CLionProjects/icpc/output.txt", "w", stdout);
#endif
p[0] = 1;
for (int i = 1; i < maxn; i++)
p[i] = p[i - 1] * i % mod;
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ret = (solve(r2, c2) + solve(r1 - 1, c1 - 1) - solve(r1 - 1, c2) -
solve(r2, c1 - 1));
ret = (ret % mod + mod) % mod;
cout << ret << endl;
return 0;
} | replace | 20 | 21 | 20 | 21 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define Inf 1000000000
#define nmax_def 110000
#define mod 1000000007
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
vl pow_;
void pow_ini(ll n) {
pow_.push_back(n);
rep(j, 62) {
ll nxt = pow_[j] * pow_[j];
nxt %= mod;
pow_.push_back(nxt);
}
return;
}
ll pow1(ll k) {
ll ans = 1;
rep(ntmp, 62) {
if ((k >> ntmp) % 2 == 1) {
ans *= pow_[ntmp];
ans %= mod;
}
}
return ans;
}
vl fact;
vl fact_inv;
void fact_ini(ll n) {
fact.push_back(1);
fact.push_back(1);
for (ll i = 2; i <= n; i++) {
ll fact_tmp = fact[i - 1] * i;
fact_tmp %= mod;
fact.push_back(fact_tmp);
}
fact_inv.resize(n + 1);
pow_ini(fact[n]);
fact_inv[n] = pow1(mod - 2);
for (ll i = n - 1; i >= 0; i--) {
fact_inv[i] = fact_inv[i + 1] * (i + 1);
fact_inv[i] %= mod;
}
}
ll nCm(ll n, ll m) {
if (fact.size() <= n)
assert(false);
if (fact.size() <= m)
assert(false);
ll ans = fact[n] * fact_inv[m];
ans %= mod;
ans *= fact_inv[n - m];
ans %= mod;
return ans;
}
int main() {
fact_ini(1100000);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
if (r2 - r1 < c2 - c1) {
swap(r1, c1);
swap(r2, c2);
}
ll anstmp = nCm(r1 + c1, r1);
ll ans = anstmp;
rep(i, r2 + c2 - r1 - c1) {
anstmp = anstmp * 2;
anstmp %= mod;
if (i < c2 - c1) {
anstmp += nCm(r1 + c1 + i, c1 + i + 1);
anstmp += nCm(r1 + c1 + i, c1 - 1);
} else if (i < r2 - r1) {
anstmp -= nCm(r1 + c1 + i, c2);
anstmp += nCm(r1 + c1 + i, c1 - 1);
anstmp += mod;
} else {
anstmp -= nCm(r1 + c1 + i, c2);
anstmp -= nCm(r1 + c1 + i, r2);
anstmp += mod;
anstmp += mod;
}
anstmp %= mod;
ans += anstmp;
ans %= mod;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cmath>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
#define Inf 1000000000
#define nmax_def 110000
#define mod 1000000007
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
vl pow_;
void pow_ini(ll n) {
pow_.push_back(n);
rep(j, 62) {
ll nxt = pow_[j] * pow_[j];
nxt %= mod;
pow_.push_back(nxt);
}
return;
}
ll pow1(ll k) {
ll ans = 1;
rep(ntmp, 62) {
if ((k >> ntmp) % 2 == 1) {
ans *= pow_[ntmp];
ans %= mod;
}
}
return ans;
}
vl fact;
vl fact_inv;
void fact_ini(ll n) {
fact.push_back(1);
fact.push_back(1);
for (ll i = 2; i <= n; i++) {
ll fact_tmp = fact[i - 1] * i;
fact_tmp %= mod;
fact.push_back(fact_tmp);
}
fact_inv.resize(n + 1);
pow_ini(fact[n]);
fact_inv[n] = pow1(mod - 2);
for (ll i = n - 1; i >= 0; i--) {
fact_inv[i] = fact_inv[i + 1] * (i + 1);
fact_inv[i] %= mod;
}
}
ll nCm(ll n, ll m) {
if (fact.size() <= n)
assert(false);
if (fact.size() <= m)
assert(false);
ll ans = fact[n] * fact_inv[m];
ans %= mod;
ans *= fact_inv[n - m];
ans %= mod;
return ans;
}
int main() {
fact_ini(11000000);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
if (r2 - r1 < c2 - c1) {
swap(r1, c1);
swap(r2, c2);
}
ll anstmp = nCm(r1 + c1, r1);
ll ans = anstmp;
rep(i, r2 + c2 - r1 - c1) {
anstmp = anstmp * 2;
anstmp %= mod;
if (i < c2 - c1) {
anstmp += nCm(r1 + c1 + i, c1 + i + 1);
anstmp += nCm(r1 + c1 + i, c1 - 1);
} else if (i < r2 - r1) {
anstmp -= nCm(r1 + c1 + i, c2);
anstmp += nCm(r1 + c1 + i, c1 - 1);
anstmp += mod;
} else {
anstmp -= nCm(r1 + c1 + i, c2);
anstmp -= nCm(r1 + c1 + i, r2);
anstmp += mod;
anstmp += mod;
}
anstmp %= mod;
ans += anstmp;
ans %= mod;
}
cout << ans << endl;
return 0;
}
| replace | 78 | 79 | 78 | 79 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for (auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for (auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c, x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL << (i))
#ifdef DEBUG
#include <Mylib/Debug/debug.cpp>
#else
#define dump(...) ((void)0)
#endif
using namespace std;
template <typename I> void join(ostream &ost, I s, I t, string d = " ") {
for (auto i = s; i != t; ++i) {
if (i != s)
ost << d;
ost << *i;
}
ost << endl;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &a : v)
is >> a;
return is;
}
template <typename T> void puts_all(const T &value) {
std::cout << value << "\n";
}
template <typename T, typename... Args>
void puts_all(const T &value, const Args &...args) {
std::cout << value << " ";
puts_all(args...);
}
template <typename T, typename U> bool chmin(T &a, const U &b) {
return (a > b ? a = b, true : false);
}
template <typename T, typename U> bool chmax(T &a, const U &b) {
return (a < b ? a = b, true : false);
}
template <typename T, size_t N, typename U>
void fill_array(T (&a)[N], const U &v) {
fill((U *)a, (U *)(a + N), v);
}
template <typename T> auto make_vector(int n, int m, const T &value) {
return vector<vector<T>>(n, vector<T>(m, value));
}
struct Init {
Init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
cerr << fixed << setprecision(12);
}
} init;
template <std::uint32_t M> class ModInt {
public:
std::uint64_t val;
ModInt() : val(0) {}
ModInt(std::int64_t n) {
if (n >= M)
val = n % M;
else if (n < 0)
val = n % M + M;
else
val = n;
}
inline constexpr auto operator+(const ModInt &a) const {
return ModInt(val + a.val);
}
inline constexpr auto operator-(const ModInt &a) const {
return ModInt(val - a.val);
}
inline constexpr auto operator*(const ModInt &a) const {
return ModInt(val * a.val);
}
inline constexpr auto operator/(const ModInt &a) const {
return ModInt(val * a.inv().val);
}
inline constexpr auto &operator=(const ModInt &a) {
val = a.val;
return *this;
}
inline constexpr auto &operator+=(const ModInt &a) {
if ((val += a.val) >= M)
val -= M;
return *this;
}
inline constexpr auto &operator-=(const ModInt &a) {
if (val < a.val)
val += M;
val -= a.val;
return *this;
}
inline constexpr auto &operator*=(const ModInt &a) {
(val *= a.val) %= M;
return *this;
}
inline constexpr auto &operator/=(const ModInt &a) {
(val *= a.inv().val) %= M;
return *this;
}
inline constexpr bool operator==(const ModInt &a) const {
return val == a.val;
}
inline constexpr bool operator!=(const ModInt &a) const {
return val != a.val;
}
inline constexpr auto &operator++() {
*this += 1;
return *this;
}
inline constexpr auto &operator--() {
*this -= 1;
return *this;
}
inline constexpr auto operator++(int) {
auto t = *this;
*this += 1;
return t;
}
inline constexpr auto operator--(int) {
auto t = *this;
*this -= 1;
return t;
}
inline constexpr static auto frac(std::int64_t a, std::int64_t b) {
return ModInt(a) / ModInt(b);
}
inline constexpr static ModInt power(std::int64_t n, std::int64_t p) {
if (p < 0)
return power(n, -p).inv();
ModInt ret = 1, e = n;
for (; p; e *= e, p >>= 1)
if (p & 1)
ret *= e;
return ret;
}
inline constexpr auto power(std::int64_t p) const { return power(val, p); }
inline constexpr ModInt inv() const {
std::int64_t a = val, b = M, u = 1, v = 0;
while (b) {
std::int64_t t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
u %= M;
if (u < 0)
u += M;
return u;
}
};
template <std::uint32_t M> auto operator-(const ModInt<M> &a) {
return ModInt<M>(-a.val);
}
template <std::uint32_t M> auto operator+(std::int64_t a, const ModInt<M> &b) {
return ModInt<M>(a) + b;
}
template <std::uint32_t M> auto operator-(std::int64_t a, const ModInt<M> &b) {
return ModInt<M>(a) - b;
}
template <std::uint32_t M> auto operator*(std::int64_t a, const ModInt<M> &b) {
return ModInt<M>(a) * b;
}
template <std::uint32_t M> auto operator/(std::int64_t a, const ModInt<M> &b) {
return ModInt<M>(a) / b;
}
template <std::uint32_t M>
std::istream &operator>>(std::istream &is, ModInt<M> &a) {
is >> a.val;
return is;
}
template <std::uint32_t M>
std::ostream &operator<<(std::ostream &os, const ModInt<M> &a) {
os << a.val;
return os;
}
/**
* @attention 使用前にinit関数を呼び出す
*/
template <typename T> class Combinatorics {
public:
static std::vector<T> facto;
static std::vector<T> ifacto;
static void init(int N) {
facto.assign(N + 1, 1);
ifacto.assign(N + 1, 1);
for (int i = 1; i <= N; ++i) {
facto[i] = facto[i - 1] * i;
}
ifacto[N] = facto[N].inv();
for (int i = N - 1; i >= 0; --i) {
ifacto[i] = ifacto[i + 1] * (i + 1);
}
}
static T f(int64_t i) {
assert(i < facto.size());
return facto[i];
}
static T finv(int64_t i) {
assert(i < ifacto.size());
return ifacto[i];
}
static T P(int64_t n, int64_t k);
static T C(int64_t n, int64_t k);
static T H(int64_t n, int64_t k);
static T stirling_number(int64_t n, int64_t k);
static T bell_number(int64_t n, int64_t k);
static std::vector<T> bernoulli_number(int64_t n);
static T catalan_number(int64_t n);
};
template <typename T> std::vector<T> Combinatorics<T>::facto = std::vector<T>();
template <typename T>
std::vector<T> Combinatorics<T>::ifacto = std::vector<T>();
template <typename T> T Combinatorics<T>::P(int64_t n, int64_t k) {
if (n < k or n < 0 or k < 0)
return 0;
return f(n) * finv(n - k);
}
template <typename T> T Combinatorics<T>::C(int64_t n, int64_t k) {
if (n < k or n < 0 or k < 0)
return 0;
return P(n, k) * finv(k);
}
template <typename T> T Combinatorics<T>::H(int64_t n, int64_t k) {
if (n == 0 and k == 0)
return 1;
return C(n + k - 1, k);
}
using mint = ModInt<1000000007>;
using C = Combinatorics<mint>;
mint f(int r, int c) {
mint ret = 0;
REPE(i, r) {
ret += C::C(i + c + 1, c);
/*
REPE(j,c){
ret += C::C(i+j, i);
}*/
}
dump(ret);
return ret;
}
int main() {
C::init(2000000);
int r1, c1, r2, c2;
while (cin >> r1 >> c1 >> r2 >> c2) {
auto ans = f(r2, c2) - f(r1 - 1, c2) - f(r2, c1 - 1) + f(r1 - 1, c1 - 1);
puts_all(ans);
}
return 0;
}
| #include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for (LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for (LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for (LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for (auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for (auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c, x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL << (i))
#ifdef DEBUG
#include <Mylib/Debug/debug.cpp>
#else
#define dump(...) ((void)0)
#endif
using namespace std;
template <typename I> void join(ostream &ost, I s, I t, string d = " ") {
for (auto i = s; i != t; ++i) {
if (i != s)
ost << d;
ost << *i;
}
ost << endl;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &a : v)
is >> a;
return is;
}
template <typename T> void puts_all(const T &value) {
std::cout << value << "\n";
}
template <typename T, typename... Args>
void puts_all(const T &value, const Args &...args) {
std::cout << value << " ";
puts_all(args...);
}
template <typename T, typename U> bool chmin(T &a, const U &b) {
return (a > b ? a = b, true : false);
}
template <typename T, typename U> bool chmax(T &a, const U &b) {
return (a < b ? a = b, true : false);
}
template <typename T, size_t N, typename U>
void fill_array(T (&a)[N], const U &v) {
fill((U *)a, (U *)(a + N), v);
}
template <typename T> auto make_vector(int n, int m, const T &value) {
return vector<vector<T>>(n, vector<T>(m, value));
}
struct Init {
Init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
cerr << fixed << setprecision(12);
}
} init;
template <std::uint32_t M> class ModInt {
public:
std::uint64_t val;
ModInt() : val(0) {}
ModInt(std::int64_t n) {
if (n >= M)
val = n % M;
else if (n < 0)
val = n % M + M;
else
val = n;
}
inline constexpr auto operator+(const ModInt &a) const {
return ModInt(val + a.val);
}
inline constexpr auto operator-(const ModInt &a) const {
return ModInt(val - a.val);
}
inline constexpr auto operator*(const ModInt &a) const {
return ModInt(val * a.val);
}
inline constexpr auto operator/(const ModInt &a) const {
return ModInt(val * a.inv().val);
}
inline constexpr auto &operator=(const ModInt &a) {
val = a.val;
return *this;
}
inline constexpr auto &operator+=(const ModInt &a) {
if ((val += a.val) >= M)
val -= M;
return *this;
}
inline constexpr auto &operator-=(const ModInt &a) {
if (val < a.val)
val += M;
val -= a.val;
return *this;
}
inline constexpr auto &operator*=(const ModInt &a) {
(val *= a.val) %= M;
return *this;
}
inline constexpr auto &operator/=(const ModInt &a) {
(val *= a.inv().val) %= M;
return *this;
}
inline constexpr bool operator==(const ModInt &a) const {
return val == a.val;
}
inline constexpr bool operator!=(const ModInt &a) const {
return val != a.val;
}
inline constexpr auto &operator++() {
*this += 1;
return *this;
}
inline constexpr auto &operator--() {
*this -= 1;
return *this;
}
inline constexpr auto operator++(int) {
auto t = *this;
*this += 1;
return t;
}
inline constexpr auto operator--(int) {
auto t = *this;
*this -= 1;
return t;
}
inline constexpr static auto frac(std::int64_t a, std::int64_t b) {
return ModInt(a) / ModInt(b);
}
inline constexpr static ModInt power(std::int64_t n, std::int64_t p) {
if (p < 0)
return power(n, -p).inv();
ModInt ret = 1, e = n;
for (; p; e *= e, p >>= 1)
if (p & 1)
ret *= e;
return ret;
}
inline constexpr auto power(std::int64_t p) const { return power(val, p); }
inline constexpr ModInt inv() const {
std::int64_t a = val, b = M, u = 1, v = 0;
while (b) {
std::int64_t t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
u %= M;
if (u < 0)
u += M;
return u;
}
};
template <std::uint32_t M> auto operator-(const ModInt<M> &a) {
return ModInt<M>(-a.val);
}
template <std::uint32_t M> auto operator+(std::int64_t a, const ModInt<M> &b) {
return ModInt<M>(a) + b;
}
template <std::uint32_t M> auto operator-(std::int64_t a, const ModInt<M> &b) {
return ModInt<M>(a) - b;
}
template <std::uint32_t M> auto operator*(std::int64_t a, const ModInt<M> &b) {
return ModInt<M>(a) * b;
}
template <std::uint32_t M> auto operator/(std::int64_t a, const ModInt<M> &b) {
return ModInt<M>(a) / b;
}
template <std::uint32_t M>
std::istream &operator>>(std::istream &is, ModInt<M> &a) {
is >> a.val;
return is;
}
template <std::uint32_t M>
std::ostream &operator<<(std::ostream &os, const ModInt<M> &a) {
os << a.val;
return os;
}
/**
* @attention 使用前にinit関数を呼び出す
*/
template <typename T> class Combinatorics {
public:
static std::vector<T> facto;
static std::vector<T> ifacto;
static void init(int N) {
facto.assign(N + 1, 1);
ifacto.assign(N + 1, 1);
for (int i = 1; i <= N; ++i) {
facto[i] = facto[i - 1] * i;
}
ifacto[N] = facto[N].inv();
for (int i = N - 1; i >= 0; --i) {
ifacto[i] = ifacto[i + 1] * (i + 1);
}
}
static T f(int64_t i) {
assert(i < facto.size());
return facto[i];
}
static T finv(int64_t i) {
assert(i < ifacto.size());
return ifacto[i];
}
static T P(int64_t n, int64_t k);
static T C(int64_t n, int64_t k);
static T H(int64_t n, int64_t k);
static T stirling_number(int64_t n, int64_t k);
static T bell_number(int64_t n, int64_t k);
static std::vector<T> bernoulli_number(int64_t n);
static T catalan_number(int64_t n);
};
template <typename T> std::vector<T> Combinatorics<T>::facto = std::vector<T>();
template <typename T>
std::vector<T> Combinatorics<T>::ifacto = std::vector<T>();
template <typename T> T Combinatorics<T>::P(int64_t n, int64_t k) {
if (n < k or n < 0 or k < 0)
return 0;
return f(n) * finv(n - k);
}
template <typename T> T Combinatorics<T>::C(int64_t n, int64_t k) {
if (n < k or n < 0 or k < 0)
return 0;
return P(n, k) * finv(k);
}
template <typename T> T Combinatorics<T>::H(int64_t n, int64_t k) {
if (n == 0 and k == 0)
return 1;
return C(n + k - 1, k);
}
using mint = ModInt<1000000007>;
using C = Combinatorics<mint>;
mint f(int r, int c) {
mint ret = 0;
REPE(i, r) {
ret += C::C(i + c + 1, c);
/*
REPE(j,c){
ret += C::C(i+j, i);
}*/
}
dump(ret);
return ret;
}
int main() {
C::init(5000000);
int r1, c1, r2, c2;
while (cin >> r1 >> c1 >> r2 >> c2) {
auto ans = f(r2, c2) - f(r1 - 1, c2) - f(r2, c1 - 1) + f(r1 - 1, c1 - 1);
puts_all(ans);
}
return 0;
}
| replace | 295 | 296 | 295 | 296 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt &operator^=(long long p) {
ModInt res = 1;
for (; p; p >>= 1) {
if (p & 1)
res *= *this;
*this *= *this;
}
return *this = res;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
ModInt operator^(long long p) const { return ModInt(*this) ^= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
explicit operator int() const { return x; }
ModInt operator=(const int p) {
x = p;
return ModInt(*this);
}
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return ModInt(u);
}
friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend std::istream &operator>>(std::istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
typedef ModInt<MOD> mint;
struct MComb {
std::vector<mint> fact;
std::vector<mint> inversed;
MComb(int n) { // O(n+log(mod))
fact = std::vector<mint>(n + 1, 1);
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * mint(i);
inversed = std::vector<mint>(n + 1);
inversed[n] = fact[n] ^ (MOD - 2);
for (int i = n - 1; i >= 0; i--)
inversed[i] = inversed[i + 1] * mint(i + 1);
}
mint ncr(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return (fact[n] * inversed[r] * inversed[n - r]);
}
mint npr(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return (fact[n] * inversed[n - r]);
}
mint nhr(int n, int r) {
assert(n + r - 1 < (int)fact.size());
return ncr(n + r - 1, r);
}
mint fac(int n) {
if (n < 0)
return 0;
return fact[n];
}
};
MComb comb(500000);
mint F(int x, int y) {
mint res = 0;
for (int i = 0; i <= y; i++) {
res += comb.ncr(x + i + 1, x);
}
return res;
}
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
c1--, r1--;
cout << F(r2, c2) - F(r2, c1) - F(r1, c2) + F(r1, c1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt &operator^=(long long p) {
ModInt res = 1;
for (; p; p >>= 1) {
if (p & 1)
res *= *this;
*this *= *this;
}
return *this = res;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
ModInt operator^(long long p) const { return ModInt(*this) ^= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
explicit operator int() const { return x; }
ModInt operator=(const int p) {
x = p;
return ModInt(*this);
}
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return ModInt(u);
}
friend std::ostream &operator<<(std::ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend std::istream &operator>>(std::istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
typedef ModInt<MOD> mint;
struct MComb {
std::vector<mint> fact;
std::vector<mint> inversed;
MComb(int n) { // O(n+log(mod))
fact = std::vector<mint>(n + 1, 1);
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * mint(i);
inversed = std::vector<mint>(n + 1);
inversed[n] = fact[n] ^ (MOD - 2);
for (int i = n - 1; i >= 0; i--)
inversed[i] = inversed[i + 1] * mint(i + 1);
}
mint ncr(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return (fact[n] * inversed[r] * inversed[n - r]);
}
mint npr(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return (fact[n] * inversed[n - r]);
}
mint nhr(int n, int r) {
assert(n + r - 1 < (int)fact.size());
return ncr(n + r - 1, r);
}
mint fac(int n) {
if (n < 0)
return 0;
return fact[n];
}
};
MComb comb(5000000);
mint F(int x, int y) {
mint res = 0;
for (int i = 0; i <= y; i++) {
res += comb.ncr(x + i + 1, x);
}
return res;
}
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
c1--, r1--;
cout << F(r2, c2) - F(r2, c1) - F(r1, c2) + F(r1, c1) << endl;
}
| replace | 109 | 110 | 109 | 110 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> pii;
const int maxn = 1e6 + 10;
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const ll mod = 1000000007;
ll fact[maxn], inv[maxn];
ll power(ll a, int x) {
ll ans = 1;
while (x) {
if (x & 1)
ans = (ans * a) % mod;
a = (a * a) % mod;
x >>= 1;
}
return ans;
}
void init() {
fact[0] = 1ll;
for (int i = 1; i < maxn; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[maxn - 1] = power(fact[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll f(int i, int j) { return fact[i + j] * inv[i] % mod * inv[j] % mod; }
ll cal(int i, int j) {
ll res = 0;
for (int k = 1; k <= i + 1; k++)
res = (res + f(k, j)) % mod;
return res;
}
int r1, c1, r2, c2;
int main() {
cin >> r1 >> c1 >> r2 >> c2;
init();
ll ans = (cal(r2, c2) + cal(r1 - 1, c1 - 1)) % mod;
ans = (ans - cal(r1 - 1, c2) + mod - cal(r2, c1 - 1) + mod) % mod;
cout << ans << endl;
return 0;
}; | #include <bits/stdc++.h>
using namespace std;
#define ll long long
typedef pair<ll, ll> pii;
const int maxn = 2e6 + 10;
const int INF = 0x3f3f3f3f;
const ll inf = 1e18;
const ll mod = 1000000007;
ll fact[maxn], inv[maxn];
ll power(ll a, int x) {
ll ans = 1;
while (x) {
if (x & 1)
ans = (ans * a) % mod;
a = (a * a) % mod;
x >>= 1;
}
return ans;
}
void init() {
fact[0] = 1ll;
for (int i = 1; i < maxn; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[maxn - 1] = power(fact[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll f(int i, int j) { return fact[i + j] * inv[i] % mod * inv[j] % mod; }
ll cal(int i, int j) {
ll res = 0;
for (int k = 1; k <= i + 1; k++)
res = (res + f(k, j)) % mod;
return res;
}
int r1, c1, r2, c2;
int main() {
cin >> r1 >> c1 >> r2 >> c2;
init();
ll ans = (cal(r2, c2) + cal(r1 - 1, c1 - 1)) % mod;
ans = (ans - cal(r1 - 1, c2) + mod - cal(r2, c1 - 1) + mod) % mod;
cout << ans << endl;
return 0;
}; | replace | 4 | 5 | 4 | 5 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) { return fabs(a - b) < DBL_EPSILON; }
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
// ofstream outfile("log.txt");
// outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0')
// << rank << endl;
// std::cout << std::bitset<8>(9);
// const ll mod = 1e10;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQ_ASK;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(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;
}
friend std::istream &operator>>(std::istream &in, mint &o) {
ll a;
in >> a;
o = a;
return in;
}
friend std::ostream &operator<<(std::ostream &out, const mint &o) {
out << o.x;
return out;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
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];
}
} combination(1000000);
mint pascal(int a, int b) { return combination(a + b + 2, a + 1) - 1; }
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
mint p = pascal(c, d);
mint q = pascal(d, a - 1);
mint r = pascal(c, b - 1);
mint s = pascal(a - 1, b - 1);
mint ans = p - q - r + s;
cout << ans << endl;
}
| #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) { return fabs(a - b) < DBL_EPSILON; }
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
// ofstream outfile("log.txt");
// outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0')
// << rank << endl;
// std::cout << std::bitset<8>(9);
// const ll mod = 1e10;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQ_ASK;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(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;
}
friend std::istream &operator>>(std::istream &in, mint &o) {
ll a;
in >> a;
o = a;
return in;
}
friend std::ostream &operator<<(std::ostream &out, const mint &o) {
out << o.x;
return out;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
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];
}
} combination(10000000);
mint pascal(int a, int b) { return combination(a + b + 2, a + 1) - 1; }
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
mint p = pascal(c, d);
mint q = pascal(d, a - 1);
mint r = pascal(c, b - 1);
mint s = pascal(a - 1, b - 1);
mint ans = p - q - r + s;
cout << ans << endl;
}
| replace | 132 | 133 | 132 | 133 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) { return fabs(a - b) < DBL_EPSILON; }
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
typedef priority_queue<ll, vector<ll>, greater<ll>> PQ_ASK;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(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;
}
friend std::istream &operator>>(std::istream &in, mint &o) {
ll a;
in >> a;
o = a;
return in;
}
friend std::ostream &operator<<(std::ostream &out, const mint &o) {
out << o.x;
return out;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
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];
}
} combination(1000000);
mint co(int y, int x) { return combination(y + x, x); }
mint cs(int y, int x) { return combination(y + x + 2, x + 1) - 1; }
mint solve(int r1, int c1, int r2, int c2) {
mint ans = 0;
for (int y = r1; y <= r2; y++) {
for (int x = c1; x <= c2; x++) {
mint now = co(y, x);
ans += now;
}
}
return ans;
}
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int y = r2 - r1 + 1;
int x = c2 - c1 + 1;
int yy = r1 - 1;
int xx = c1 - 1;
mint a = cs(r2, c2);
mint b = cs(r2, c1 - 1);
mint c = cs(c2, r1 - 1);
mint d = cs(c1 - 1, r1 - 1);
mint ans = a - b - c + d;
cout << ans << endl;
// cout << solve(r1, c1, r2, c2) << endl;
} | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) { return fabs(a - b) < DBL_EPSILON; }
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
typedef priority_queue<ll, vector<ll>, greater<ll>> PQ_ASK;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(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;
}
friend std::istream &operator>>(std::istream &in, mint &o) {
ll a;
in >> a;
o = a;
return in;
}
friend std::ostream &operator<<(std::ostream &out, const mint &o) {
out << o.x;
return out;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
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];
}
} combination(10000000);
mint co(int y, int x) { return combination(y + x, x); }
mint cs(int y, int x) { return combination(y + x + 2, x + 1) - 1; }
mint solve(int r1, int c1, int r2, int c2) {
mint ans = 0;
for (int y = r1; y <= r2; y++) {
for (int x = c1; x <= c2; x++) {
mint now = co(y, x);
ans += now;
}
}
return ans;
}
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int y = r2 - r1 + 1;
int x = c2 - c1 + 1;
int yy = r1 - 1;
int xx = c1 - 1;
mint a = cs(r2, c2);
mint b = cs(r2, c1 - 1);
mint c = cs(c2, r1 - 1);
mint d = cs(c1 - 1, r1 - 1);
mint ans = a - b - c + d;
cout << ans << endl;
// cout << solve(r1, c1, r2, c2) << endl;
} | replace | 124 | 125 | 124 | 125 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vpii = vector<pii>;
#define PI 3.1415926535897932384626433832795
using ll = long long;
class mod_ll {
public:
ll m_v;
static const ll m_m = 1000000007; // prime value ex. 1000000009
mod_ll(ll v = 0) : m_v(v) {}
mod_ll operator=(ll rhs) {
m_v = rhs % m_m;
return *this;
}
ll operator()() { return m_v; }
mod_ll operator=(mod_ll rhs) {
m_v = rhs.m_v;
return *this;
}
mod_ll operator+=(ll rhs) {
m_v = (m_v + rhs) % m_m;
return *this;
}
mod_ll operator+=(mod_ll rhs) {
m_v = (m_v + rhs.m_v) % m_m;
return *this;
}
mod_ll operator+(mod_ll rhs) {
auto ret = *this;
return ret += rhs;
}
mod_ll operator-=(mod_ll rhs) {
m_v = (m_v - rhs.m_v + m_m) % m_m;
return *this;
}
mod_ll operator-(mod_ll rhs) {
auto ret = *this;
return ret -= rhs;
}
mod_ll operator*=(ll rhs) {
m_v = (m_v * rhs) % m_m;
return *this;
}
mod_ll operator*=(mod_ll rhs) {
m_v = (m_v * rhs.m_v) % m_m;
return *this;
}
mod_ll operator*(mod_ll rhs) {
mod_ll ret = *this;
return ret *= rhs;
}
mod_ll operator^(ll rhs) {
mod_ll t = *this;
mod_ll ret(1LL);
for (; rhs > 0; rhs >>= 1) {
if (rhs & 1)
ret *= t;
t *= t;
}
return ret;
}
mod_ll operator/=(mod_ll rhs) { return *this *= (rhs ^ (m_m - 2)); }
mod_ll operator/=(ll rhs) {
mod_ll t(rhs);
return *this /= t;
}
mod_ll operator/(mod_ll rhs) {
mod_ll ret = *this;
return ret /= rhs;
}
};
mod_ll mod_fact(int n) {
static vector<mod_ll> memo(1);
if (memo.size() <= n) {
if (memo.size() == 1) {
memo[0] = 1;
}
for (int i = memo.size(); i <= n; i++) {
memo.push_back(memo.back() * i);
}
}
return memo[n];
}
mod_ll mod_nCr(int n, int r) {
mod_ll bunsi = mod_fact(n);
mod_ll bunbo = mod_fact(n - r) * mod_fact(r);
return bunsi / bunbo;
}
mod_ll mod_nPr(int n, int r) {
mod_ll ret(1);
for (int i = 0; i < r; i++) {
ret *= (n - i);
}
return ret;
}
mod_ll g(int r, int c) {
return mod_fact(r + c + 2) / (mod_fact(r + 1) * mod_fact(c + 1)) - 1;
}
int main(void) {
int r1, c1, r2, c2;
while (scanf("%d%d%d%d", &r1, &c1, &r2, &c2) == 4) {
vector<vector<mod_ll>> dp(c2 + 1);
for (auto &m : dp)
m.resize(r2 + 1);
for (int x = 0; x <= r2; x++)
dp[0][x] = x + 1;
for (int y = 1; y <= c2; y++)
dp[y][0] = y + 1;
for (int y = 1; y <= c2; y++) {
for (int x = 1; x <= r2; x++) {
dp[y][x] = dp[y - 1][x] + dp[y][x - 1] + 1;
}
}
// mod_ll ans=dp[c2][r2]-dp[c2][r1-1]-dp[c1-1][r2]+dp[c1-1][r1-1];
mod_ll ans = g(c2, r2) - g(c2, r1 - 1) - g(c1 - 1, r2) + g(c1 - 1, r1 - 1);
printf("%lld\n", ans());
}
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vpii = vector<pii>;
#define PI 3.1415926535897932384626433832795
using ll = long long;
class mod_ll {
public:
ll m_v;
static const ll m_m = 1000000007; // prime value ex. 1000000009
mod_ll(ll v = 0) : m_v(v) {}
mod_ll operator=(ll rhs) {
m_v = rhs % m_m;
return *this;
}
ll operator()() { return m_v; }
mod_ll operator=(mod_ll rhs) {
m_v = rhs.m_v;
return *this;
}
mod_ll operator+=(ll rhs) {
m_v = (m_v + rhs) % m_m;
return *this;
}
mod_ll operator+=(mod_ll rhs) {
m_v = (m_v + rhs.m_v) % m_m;
return *this;
}
mod_ll operator+(mod_ll rhs) {
auto ret = *this;
return ret += rhs;
}
mod_ll operator-=(mod_ll rhs) {
m_v = (m_v - rhs.m_v + m_m) % m_m;
return *this;
}
mod_ll operator-(mod_ll rhs) {
auto ret = *this;
return ret -= rhs;
}
mod_ll operator*=(ll rhs) {
m_v = (m_v * rhs) % m_m;
return *this;
}
mod_ll operator*=(mod_ll rhs) {
m_v = (m_v * rhs.m_v) % m_m;
return *this;
}
mod_ll operator*(mod_ll rhs) {
mod_ll ret = *this;
return ret *= rhs;
}
mod_ll operator^(ll rhs) {
mod_ll t = *this;
mod_ll ret(1LL);
for (; rhs > 0; rhs >>= 1) {
if (rhs & 1)
ret *= t;
t *= t;
}
return ret;
}
mod_ll operator/=(mod_ll rhs) { return *this *= (rhs ^ (m_m - 2)); }
mod_ll operator/=(ll rhs) {
mod_ll t(rhs);
return *this /= t;
}
mod_ll operator/(mod_ll rhs) {
mod_ll ret = *this;
return ret /= rhs;
}
};
mod_ll mod_fact(int n) {
static vector<mod_ll> memo(1);
if (memo.size() <= n) {
if (memo.size() == 1) {
memo[0] = 1;
}
for (int i = memo.size(); i <= n; i++) {
memo.push_back(memo.back() * i);
}
}
return memo[n];
}
mod_ll mod_nCr(int n, int r) {
mod_ll bunsi = mod_fact(n);
mod_ll bunbo = mod_fact(n - r) * mod_fact(r);
return bunsi / bunbo;
}
mod_ll mod_nPr(int n, int r) {
mod_ll ret(1);
for (int i = 0; i < r; i++) {
ret *= (n - i);
}
return ret;
}
mod_ll g(int r, int c) {
return mod_fact(r + c + 2) / (mod_fact(r + 1) * mod_fact(c + 1)) - 1;
}
int main(void) {
int r1, c1, r2, c2;
while (scanf("%d%d%d%d", &r1, &c1, &r2, &c2) == 4) {
mod_ll ans = g(c2, r2) - g(c2, r1 - 1) - g(c1 - 1, r2) + g(c1 - 1, r1 - 1);
printf("%lld\n", ans());
}
return 0;
}
| delete | 127 | 143 | 127 | 127 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N - 1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N - 1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;
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;
}
struct mll {
static ll MOD;
ll val;
mll(ll v = 0) : val(v % MOD) {
if (val < 0)
val += MOD;
}
mll operator-() const { return -val; }
mll operator+(const mll &b) const { return val + b.val; }
mll operator-(const mll &b) const { return val - b.val; }
mll operator*(const mll &b) const { return val * b.val; }
mll operator/(const mll &b) const { return mll(*this) /= b; }
mll operator+(ll b) const { return *this + mll(b); }
mll operator-(ll b) const { return *this - mll(b); }
mll operator*(ll b) const { return *this * mll(b); }
friend mll operator+(ll a, const mll &b) { return b + a; }
friend mll operator-(ll a, const mll &b) { return -b + a; }
friend mll operator*(ll a, const mll &b) { return b * a; }
mll &operator+=(const mll &b) {
val = (val + b.val) % MOD;
return *this;
}
mll &operator-=(const mll &b) {
val = (val + MOD - b.val) % MOD;
return *this;
}
mll &operator*=(const mll &b) {
val = (val * b.val) % MOD;
return *this;
}
mll &operator/=(const mll &b) {
ll c = b.val, d = MOD, u = 1, v = 0;
while (d) {
ll t = c / d;
c -= t * d;
swap(c, d);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
mll &operator+=(ll b) { return *this += mll(b); }
mll &operator-=(ll b) { return *this -= mll(b); }
mll &operator*=(ll b) { return *this *= mll(b); }
mll &operator/=(ll b) { return *this /= mll(b); }
bool operator==(const mll &b) { return val == b.val; }
bool operator!=(const mll &b) { return val != b.val; }
bool operator==(ll b) { return *this == mll(b); }
bool operator!=(ll b) { return *this != mll(b); }
friend bool operator==(ll a, const mll &b) { return mll(a) == b.val; }
friend bool operator!=(ll a, const mll &b) { return mll(a) != b.val; }
friend ostream &operator<<(ostream &os, const mll &a) { return os << a.val; }
friend istream &operator>>(istream &is, mll &a) { return is >> a.val; }
static mll Combination(ll a, ll b) {
chmin(b, a - b);
if (b < 0)
return mll(0);
mll c = 1;
rep(i, b) c *= a - i;
rep(i, b) c /= i + 1;
return c;
}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
}
} fast; // cin,cout高速化のおまじない＋桁数指定
ll mll::MOD = (ll)(1e9 + 7); // 998244353ll;
//--debug--
#ifdef LOCAL
void _debug_out_(string s = "") {
if (s != "") {
eprintf(s.c_str());
} else {
eprintf("\n");
}
}
void _debug_out_(ll x, string s = "") {
if (s != "") {
eprintf(s.c_str(), x);
} else {
eprintf("%lld\n", x);
}
}
void _debug_out_(vvll x, string s = "") {
string t = s;
if (s == "") {
ll maxLen = 0;
rep(i, (ll)x.size()) rep(j, (ll)x[i].size()) {
ll n = x[i][j] / 10, len = 1;
while (n > 0) {
len++;
n /= 10;
}
chmax(maxLen, len);
}
t = "%" + to_string(maxLen) + "lld ";
}
rep(i, (ll)x.size()) {
rep(j, (ll)x[i].size()) { eprintf(t.c_str(), x[i][j]); }
eprintf("\n");
}
eprintf("\n");
}
void _debug_out_(vll x, string s = "") {
rep(i, (ll)x.size()) {
if (s != "") {
eprintf(s.c_str(), x[i]);
} else {
eprintf("%lld ", x[i]);
}
}
eprintf("\n");
}
void _debug_out_(vector<bool> x) {
rep(i, (ll)x.size()) { eprintf("%s", x[i] ? "o" : "x"); }
eprintf("\n");
}
void _debug_out_(vector<vector<bool>> x) {
rep(i, (ll)x.size()) {
rep(j, (ll)x[i].size()) { eprintf("%s", x[i][j] ? "o" : "x"); }
eprintf("\n");
}
eprintf("\n");
}
void _debug_out_(map<ll, ll> x) {
auto begin = x.begin(), end = x.end();
for (auto iter = begin; iter != end; iter++) {
eprintf("%lld:%lld ", iter->first, iter->second);
}
eprintf("\n");
}
void _debug_out_(map<char, ll> x) {
auto begin = x.begin(), end = x.end();
for (auto iter = begin; iter != end; iter++) {
eprintf("%c:%lld ", iter->first, iter->second);
}
eprintf("\n");
}
#define debug_out(...) _debug_out_(__VA_ARGS__)
#else
#define debug_out(...) 42
#endif
//--debug--
const ll MAX = 1000010;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
mll 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;
}
mll f(ll r, ll c) { //(r,c)へのパス数
return COM(r + c, r);
}
int main() {
ll r1;
cin >> r1;
ll c1;
cin >> c1;
ll r2;
cin >> r2;
ll c2;
cin >> c2;
COMinit();
mll result = f(r2 + 1, c2 + 1);
result -= f(r1 - 1 + 1, c2 + 1);
result -= f(r2 + 1, c1 - 1 + 1);
result += f(r1 - 1 + 1, c1 - 1 + 1);
cout << result << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
using ll = long long;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
using vvvll = std::vector<vvll>;
#define reps(i, S, E) for (ll i = (S); i <= (E); i++)
#define rep(i, N) reps(i, 0, N - 1)
#define deps(i, E, S) for (ll i = (E); i >= (S); i--)
#define dep(i, N) deps(i, N - 1, 0)
const ll INF = 1LL << 60;
const int INF_INT = 1 << 30;
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;
}
struct mll {
static ll MOD;
ll val;
mll(ll v = 0) : val(v % MOD) {
if (val < 0)
val += MOD;
}
mll operator-() const { return -val; }
mll operator+(const mll &b) const { return val + b.val; }
mll operator-(const mll &b) const { return val - b.val; }
mll operator*(const mll &b) const { return val * b.val; }
mll operator/(const mll &b) const { return mll(*this) /= b; }
mll operator+(ll b) const { return *this + mll(b); }
mll operator-(ll b) const { return *this - mll(b); }
mll operator*(ll b) const { return *this * mll(b); }
friend mll operator+(ll a, const mll &b) { return b + a; }
friend mll operator-(ll a, const mll &b) { return -b + a; }
friend mll operator*(ll a, const mll &b) { return b * a; }
mll &operator+=(const mll &b) {
val = (val + b.val) % MOD;
return *this;
}
mll &operator-=(const mll &b) {
val = (val + MOD - b.val) % MOD;
return *this;
}
mll &operator*=(const mll &b) {
val = (val * b.val) % MOD;
return *this;
}
mll &operator/=(const mll &b) {
ll c = b.val, d = MOD, u = 1, v = 0;
while (d) {
ll t = c / d;
c -= t * d;
swap(c, d);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
mll &operator+=(ll b) { return *this += mll(b); }
mll &operator-=(ll b) { return *this -= mll(b); }
mll &operator*=(ll b) { return *this *= mll(b); }
mll &operator/=(ll b) { return *this /= mll(b); }
bool operator==(const mll &b) { return val == b.val; }
bool operator!=(const mll &b) { return val != b.val; }
bool operator==(ll b) { return *this == mll(b); }
bool operator!=(ll b) { return *this != mll(b); }
friend bool operator==(ll a, const mll &b) { return mll(a) == b.val; }
friend bool operator!=(ll a, const mll &b) { return mll(a) != b.val; }
friend ostream &operator<<(ostream &os, const mll &a) { return os << a.val; }
friend istream &operator>>(istream &is, mll &a) { return is >> a.val; }
static mll Combination(ll a, ll b) {
chmin(b, a - b);
if (b < 0)
return mll(0);
mll c = 1;
rep(i, b) c *= a - i;
rep(i, b) c /= i + 1;
return c;
}
};
using vmll = std::vector<mll>;
using vvmll = std::vector<vmll>;
using vvvmll = std::vector<vvmll>;
using vvvvmll = std::vector<vvvmll>;
struct Fast {
Fast() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(std::numeric_limits<double>::max_digits10);
}
} fast; // cin,cout高速化のおまじない＋桁数指定
ll mll::MOD = (ll)(1e9 + 7); // 998244353ll;
//--debug--
#ifdef LOCAL
void _debug_out_(string s = "") {
if (s != "") {
eprintf(s.c_str());
} else {
eprintf("\n");
}
}
void _debug_out_(ll x, string s = "") {
if (s != "") {
eprintf(s.c_str(), x);
} else {
eprintf("%lld\n", x);
}
}
void _debug_out_(vvll x, string s = "") {
string t = s;
if (s == "") {
ll maxLen = 0;
rep(i, (ll)x.size()) rep(j, (ll)x[i].size()) {
ll n = x[i][j] / 10, len = 1;
while (n > 0) {
len++;
n /= 10;
}
chmax(maxLen, len);
}
t = "%" + to_string(maxLen) + "lld ";
}
rep(i, (ll)x.size()) {
rep(j, (ll)x[i].size()) { eprintf(t.c_str(), x[i][j]); }
eprintf("\n");
}
eprintf("\n");
}
void _debug_out_(vll x, string s = "") {
rep(i, (ll)x.size()) {
if (s != "") {
eprintf(s.c_str(), x[i]);
} else {
eprintf("%lld ", x[i]);
}
}
eprintf("\n");
}
void _debug_out_(vector<bool> x) {
rep(i, (ll)x.size()) { eprintf("%s", x[i] ? "o" : "x"); }
eprintf("\n");
}
void _debug_out_(vector<vector<bool>> x) {
rep(i, (ll)x.size()) {
rep(j, (ll)x[i].size()) { eprintf("%s", x[i][j] ? "o" : "x"); }
eprintf("\n");
}
eprintf("\n");
}
void _debug_out_(map<ll, ll> x) {
auto begin = x.begin(), end = x.end();
for (auto iter = begin; iter != end; iter++) {
eprintf("%lld:%lld ", iter->first, iter->second);
}
eprintf("\n");
}
void _debug_out_(map<char, ll> x) {
auto begin = x.begin(), end = x.end();
for (auto iter = begin; iter != end; iter++) {
eprintf("%c:%lld ", iter->first, iter->second);
}
eprintf("\n");
}
#define debug_out(...) _debug_out_(__VA_ARGS__)
#else
#define debug_out(...) 42
#endif
//--debug--
const ll MAX = 2000010;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
mll 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;
}
mll f(ll r, ll c) { //(r,c)へのパス数
return COM(r + c, r);
}
int main() {
ll r1;
cin >> r1;
ll c1;
cin >> c1;
ll r2;
cin >> r2;
ll c2;
cin >> c2;
COMinit();
mll result = f(r2 + 1, c2 + 1);
result -= f(r1 - 1 + 1, c2 + 1);
result -= f(r2 + 1, c1 - 1 + 1);
result += f(r1 - 1 + 1, c1 - 1 + 1);
cout << result << endl;
return 0;
} | replace | 204 | 205 | 204 | 205 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9 + 7;
// mod付きコンビネーション
const int MAX = 510000;
const int MOD = 1000000007;
Int fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
Int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
Int a, b, c, d;
cin >> a >> b >> c >> d;
COMinit();
Int res = 0;
for (Int i = a + 1; i <= c + 1; i++) {
Int add = fac[i + d] * finv[i] % mod * finv[d] % mod;
Int sub = fac[i + b - 1] * finv[i] % mod * finv[b - 1] % mod;
res = (res + add - sub + mod) % mod;
}
dump(res);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define dump(x) cout << (x) << '\n'
#define Int int64_t
#define fi first
#define se second
#define all(x) (x).begin(), (x).end()
Int INF = 1e18;
int inf = 1e9;
Int mod = 1e9 + 7;
// mod付きコンビネーション
const int MAX = 5100000;
const int MOD = 1000000007;
Int fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
Int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
Int a, b, c, d;
cin >> a >> b >> c >> d;
COMinit();
Int res = 0;
for (Int i = a + 1; i <= c + 1; i++) {
Int add = fac[i + d] * finv[i] % mod * finv[d] % mod;
Int sub = fac[i + b - 1] * finv[i] % mod * finv[b - 1] % mod;
res = (res + add - sub + mod) % mod;
}
dump(res);
return 0;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long MOD = 1000000007;
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll f(int i, int j) {
return (fac[i + j] * finv[i] % MOD * finv[j] % MOD) % MOD;
}
void solve(std::vector<long long> r, std::vector<long long> c) {
COMinit();
ll ans = 0;
for (int i = r[0]; i <= r[1]; i++) {
ans += f(i + 1, c[1]) + MOD - f(i + 1, c[0] - 1);
// if(i <= 20)cout<<f(i+1, c[1])<<" "<< f(i+1, c[1])<<endl;
ans %= MOD;
}
cout << ans % MOD << endl;
}
int main() {
std::vector<long long> r(2);
std::vector<long long> c(2);
for (int i = 0; i < 2; i++) {
scanf("%lld", &r[i]);
scanf("%lld", &c[i]);
}
solve(std::move(r), std::move(c));
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const long long MOD = 1000000007;
const int MAX = 5100000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll f(int i, int j) {
return (fac[i + j] * finv[i] % MOD * finv[j] % MOD) % MOD;
}
void solve(std::vector<long long> r, std::vector<long long> c) {
COMinit();
ll ans = 0;
for (int i = r[0]; i <= r[1]; i++) {
ans += f(i + 1, c[1]) + MOD - f(i + 1, c[0] - 1);
// if(i <= 20)cout<<f(i+1, c[1])<<" "<< f(i+1, c[1])<<endl;
ans %= MOD;
}
cout << ans % MOD << endl;
}
int main() {
std::vector<long long> r(2);
std::vector<long long> c(2);
for (int i = 0; i < 2; i++) {
scanf("%lld", &r[i]);
scanf("%lld", &c[i]);
}
solve(std::move(r), std::move(c));
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02782 | C++ | Runtime Error | // 6/23 解き直し
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
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; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
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(1000000);
mint f(int r, int c) { return comb(r + c, r); }
mint g(int r, int c) {
mint res = 0;
for (int i = 0; i <= c; i++) {
res += f(r, i + 1);
}
// y = i
// }
return res;
}
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ans = g(r2, c2) - g(r2, c1 - 1) - g(r1 - 1, c2) + g(r1 - 1, c1 - 1);
cout << ans.x << endl;
} | // 6/23 解き直し
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
using ll = long long;
using P = pair<int, int>;
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; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
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(3000000);
mint f(int r, int c) { return comb(r + c, r); }
mint g(int r, int c) {
mint res = 0;
for (int i = 0; i <= c; i++) {
res += f(r, i + 1);
}
// y = i
// }
return res;
}
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ans = g(r2, c2) - g(r2, c1 - 1) - g(r1 - 1, c2) + g(r1 - 1, c1 - 1);
cout << ans.x << endl;
} | replace | 64 | 65 | 64 | 65 | 0 | |
p02782 | C++ | Runtime Error | // F.
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
const LL MOD = 1000000007;
static const size_t MAX_N = 1000001;
struct modll {
long long x;
modll() {}
modll(int _x) : x(_x) {}
operator int() const { return (int)x; }
modll operator+(int y) { return (x + y + MOD) % MOD; }
modll operator+=(int y) {
x = (x + y + MOD) % MOD;
return *this;
}
modll operator-(int y) { return (x - y + MOD) % MOD; }
modll operator-=(int y) {
x = (x - y + MOD) % MOD;
return *this;
}
modll operator*(int y) { return (x * y) % MOD; }
modll operator*=(int y) {
x = (x * y) % MOD;
return *this;
}
modll operator/(int y) { return (x * modpow(y, MOD - 2)) % MOD; }
modll operator/=(int y) {
x = (x * modpow(y, MOD - 2)) % MOD;
return *this;
}
static modll modinv(int a) { return modpow(a, MOD - 2); }
static modll modpow(int a, int b) {
modll x = a, r = 1;
for (; b; b >>= 1, x *= x)
if (b & 1)
r *= x;
return r;
}
};
modll combination(LL n, LL r) {
static modll fact[MAX_N + 1], inv[MAX_N + 1];
if (!fact[0]) {
fact[0] = 1;
for (int i = 1; i <= MAX_N; ++i) {
fact[i] = fact[i - 1] * i;
}
inv[MAX_N] = modll::modinv(fact[MAX_N]);
for (int i = MAX_N; i >= 1; --i) {
inv[i - 1] = inv[i] * i;
}
}
if (r > n) {
return 0;
}
return (fact[n] * inv[r]) * inv[n - r];
}
int main(int argc, char *argv[]) {
#ifdef _MSC_VER
while (true)
#endif
{
LL r1 = -1, c1 = -1, r2 = -1, c2 = -1;
cin >> r1 >> c1 >> r2 >> c2;
if (r1 < 0)
return 0;
modll ans = 0;
for (LL r = r1; r <= r2; ++r) {
modll a = combination(c2 + r + 1, c2);
ans += a;
if (c1 > 0) {
a = combination(c1 + r, c1 - 1);
ans -= a;
}
// cout << (c2 + r) << "," << (c2 - 1) << "," << a
//<< endl;
}
cout << ans << endl;
}
return 0;
}
| // F.
#include <algorithm>
#include <iostream>
#include <map>
#include <numeric>
#include <set>
#include <sstream>
#include <vector>
using namespace std;
typedef long long LL;
const LL MOD = 1000000007;
static const size_t MAX_N = 2000005;
struct modll {
long long x;
modll() {}
modll(int _x) : x(_x) {}
operator int() const { return (int)x; }
modll operator+(int y) { return (x + y + MOD) % MOD; }
modll operator+=(int y) {
x = (x + y + MOD) % MOD;
return *this;
}
modll operator-(int y) { return (x - y + MOD) % MOD; }
modll operator-=(int y) {
x = (x - y + MOD) % MOD;
return *this;
}
modll operator*(int y) { return (x * y) % MOD; }
modll operator*=(int y) {
x = (x * y) % MOD;
return *this;
}
modll operator/(int y) { return (x * modpow(y, MOD - 2)) % MOD; }
modll operator/=(int y) {
x = (x * modpow(y, MOD - 2)) % MOD;
return *this;
}
static modll modinv(int a) { return modpow(a, MOD - 2); }
static modll modpow(int a, int b) {
modll x = a, r = 1;
for (; b; b >>= 1, x *= x)
if (b & 1)
r *= x;
return r;
}
};
modll combination(LL n, LL r) {
static modll fact[MAX_N + 1], inv[MAX_N + 1];
if (!fact[0]) {
fact[0] = 1;
for (int i = 1; i <= MAX_N; ++i) {
fact[i] = fact[i - 1] * i;
}
inv[MAX_N] = modll::modinv(fact[MAX_N]);
for (int i = MAX_N; i >= 1; --i) {
inv[i - 1] = inv[i] * i;
}
}
if (r > n) {
return 0;
}
return (fact[n] * inv[r]) * inv[n - r];
}
int main(int argc, char *argv[]) {
#ifdef _MSC_VER
while (true)
#endif
{
LL r1 = -1, c1 = -1, r2 = -1, c2 = -1;
cin >> r1 >> c1 >> r2 >> c2;
if (r1 < 0)
return 0;
modll ans = 0;
for (LL r = r1; r <= r2; ++r) {
modll a = combination(c2 + r + 1, c2);
ans += a;
if (c1 > 0) {
a = combination(c1 + r, c1 - 1);
ans -= a;
}
// cout << (c2 + r) << "," << (c2 - 1) << "," << a
//<< endl;
}
cout << ans << endl;
}
return 0;
}
| replace | 14 | 15 | 14 | 15 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
const int inf = 1e9 + 7;
const ll INF = 1LL << 61;
const ll mod = 1e9 + 7;
vector<ll> inv, fact, invfact;
void Mod_build(int n = 101010) {
fact.resize(n + 1);
inv.resize(n + 1);
invfact.resize(n + 1);
fact[0] = inv[0] = invfact[0] = 1;
inv[1] = 1;
for (ll i = 0; i < n; i++) {
fact[i + 1] = fact[i] * (i + 1) % mod;
if (i > 0)
inv[i + 1] = mod - inv[mod % (i + 1)] * (mod / (i + 1)) % mod;
invfact[i + 1] = invfact[i] * inv[i + 1] % mod;
}
}
ll perm(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return fact[n] * invfact[n - k] % mod;
}
ll comb(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return (fact[n] * invfact[n - k] % mod) * invfact[k] % mod;
}
ll powmod(ll n, ll k) {
k %= mod - 1;
if (k < 0)
k += mod - 1;
ll ret = 1;
while (k) {
if (k & 1)
ret = ret * n % mod;
n = n * n % mod;
k >>= 1;
}
return ret;
}
ll cal(ll s, ll t) {
return comb(s + 1 + t + 1, s + 1) - 1;
;
}
int main() {
int i, j;
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
Mod_build();
ll ans = mod + mod + cal(r2, c2) + cal(r1 - 1, c1 - 1) - cal(r1 - 1, c2) -
cal(r2, c1 - 1);
cout << ans % mod << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define fi first
#define se second
typedef pair<ll, ll> P;
using VP = vector<P>;
using VVP = vector<VP>;
using VI = vector<ll>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
const int inf = 1e9 + 7;
const ll INF = 1LL << 61;
const ll mod = 1e9 + 7;
vector<ll> inv, fact, invfact;
void Mod_build(int n = 3010101) {
fact.resize(n + 1);
inv.resize(n + 1);
invfact.resize(n + 1);
fact[0] = inv[0] = invfact[0] = 1;
inv[1] = 1;
for (ll i = 0; i < n; i++) {
fact[i + 1] = fact[i] * (i + 1) % mod;
if (i > 0)
inv[i + 1] = mod - inv[mod % (i + 1)] * (mod / (i + 1)) % mod;
invfact[i + 1] = invfact[i] * inv[i + 1] % mod;
}
}
ll perm(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return fact[n] * invfact[n - k] % mod;
}
ll comb(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return (fact[n] * invfact[n - k] % mod) * invfact[k] % mod;
}
ll powmod(ll n, ll k) {
k %= mod - 1;
if (k < 0)
k += mod - 1;
ll ret = 1;
while (k) {
if (k & 1)
ret = ret * n % mod;
n = n * n % mod;
k >>= 1;
}
return ret;
}
ll cal(ll s, ll t) {
return comb(s + 1 + t + 1, s + 1) - 1;
;
}
int main() {
int i, j;
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
Mod_build();
ll ans = mod + mod + cal(r2, c2) + cal(r1 - 1, c1 - 1) - cal(r1 - 1, c2) -
cal(r2, c1 - 1);
cout << ans % mod << endl;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
template <class Read> void in(Read &x) {
x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
f |= (ch == '-');
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
x = f ? -x : x;
return;
}
#define int long long
const int M = 1e9 + 7;
int r1, r2, c1, c2, n, f[1000005], ans, sum;
int ksm(int x, int y) {
int s = 1;
while (y) {
if (y & 1)
s = (s * x) % M;
x = (x * x) % M;
y >>= 1;
}
return s;
}
int work(int x, int y) {
return f[x] * ksm(f[y], M - 2) % M * ksm(f[x - y], M - 2) % M;
}
signed main() {
in(r1);
in(c1);
in(r2);
in(c2);
n = max(c1, c2) + r2 + 2;
f[0] = 1;
for (int i = 1; i <= n; i++)
f[i] = (f[i - 1] * i) % M;
for (int i = r1; i <= r2; i++)
ans = (ans + work(i + c2 + 1, i + 1)) % M;
for (int i = r1; i <= r2; i++)
sum = (sum + work(i + c1, i + 1)) % M;
cout << (ans - sum + M) % M << endl;
return 0;
}
| #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <vector>
using namespace std;
typedef long long ll;
template <class Read> void in(Read &x) {
x = 0;
int f = 0;
char ch = getchar();
while (ch < '0' || ch > '9') {
f |= (ch == '-');
ch = getchar();
}
while (ch >= '0' && ch <= '9') {
x = (x << 1) + (x << 3) + (ch ^ 48);
ch = getchar();
}
x = f ? -x : x;
return;
}
#define int long long
const int M = 1e9 + 7;
int r1, r2, c1, c2, n, f[5000005], ans, sum;
int ksm(int x, int y) {
int s = 1;
while (y) {
if (y & 1)
s = (s * x) % M;
x = (x * x) % M;
y >>= 1;
}
return s;
}
int work(int x, int y) {
return f[x] * ksm(f[y], M - 2) % M * ksm(f[x - y], M - 2) % M;
}
signed main() {
in(r1);
in(c1);
in(r2);
in(c2);
n = max(c1, c2) + r2 + 2;
f[0] = 1;
for (int i = 1; i <= n; i++)
f[i] = (f[i - 1] * i) % M;
for (int i = r1; i <= r2; i++)
ans = (ans + work(i + c2 + 1, i + 1)) % M;
for (int i = r1; i <= r2; i++)
sum = (sum + work(i + c1, i + 1)) % M;
cout << (ans - sum + M) % M << endl;
return 0;
}
| replace | 28 | 29 | 28 | 29 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
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;
}
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
//--------------------------------------------------------------------------------//
ll modpow(ll a, ll n, ll mod_) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod_;
a = a * a % mod_;
n >>= 1;
}
return res;
}
// const ll mod = 998244353;
const ll mod = 1e9 + 7;
const ll MAX_SIZE = 1000005;
array<ll, MAX_SIZE> fac, inv, finv;
ll fac_init() {
// combination init
fac[0] = 1;
for (ll i = 1; i < MAX_SIZE; i++)
fac[i] = fac[i - 1] * i % mod;
finv[0] = modpow(fac[MAX_SIZE - 1], mod - 2, mod);
repe(i, 1, MAX_SIZE) finv[i] = finv[i - 1] * (MAX_SIZE - i) % mod;
reverse(all(finv));
// inv init
repe(i, 1, MAX_SIZE) inv[i] = modpow(i, mod - 2, mod);
}
ll perm(ll a, ll b) { return fac[a] * finv[a - b] % mod; }
ll comb(ll a, ll b) { return fac[a] * finv[b] % mod * finv[a - b] % mod; }
ll f(ll a, ll b) {
return (a != 1) ? comb(a + b + 2, b + 1) - (a + b + 2)
: b * (b + 3) / 2 % mod;
}
int main() {
init();
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
fac_init();
ll ans = (f(r2, c2) - f(r2, c1 - 1) - f(r1 - 1, c2) + f(r1 - 1, c1 - 1) +
5 * mod) %
mod;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vl = vector<ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vector<vector<T>>;
const ll MOD = 1e9 + 7;
const ll INF = 1e16;
const ld EPS = 1e-11;
const ld PI = acos(-1.0L);
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define repr(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repe(i, l, r) for (ll i = (l); i < (r); i++)
#define reper(i, l, r) for (ll i = (r)-1; i >= (l); i--)
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;
}
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
//--------------------------------------------------------------------------------//
ll modpow(ll a, ll n, ll mod_) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod_;
a = a * a % mod_;
n >>= 1;
}
return res;
}
// const ll mod = 998244353;
const ll mod = 1e9 + 7;
const ll MAX_SIZE = 2000005;
array<ll, MAX_SIZE> fac, inv, finv;
ll fac_init() {
// combination init
fac[0] = 1;
for (ll i = 1; i < MAX_SIZE; i++)
fac[i] = fac[i - 1] * i % mod;
finv[0] = modpow(fac[MAX_SIZE - 1], mod - 2, mod);
repe(i, 1, MAX_SIZE) finv[i] = finv[i - 1] * (MAX_SIZE - i) % mod;
reverse(all(finv));
// inv init
repe(i, 1, MAX_SIZE) inv[i] = modpow(i, mod - 2, mod);
}
ll perm(ll a, ll b) { return fac[a] * finv[a - b] % mod; }
ll comb(ll a, ll b) { return fac[a] * finv[b] % mod * finv[a - b] % mod; }
ll f(ll a, ll b) {
return (a != 1) ? comb(a + b + 2, b + 1) - (a + b + 2)
: b * (b + 3) / 2 % mod;
}
int main() {
init();
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
fac_init();
ll ans = (f(r2, c2) - f(r2, c1 - 1) - f(r1 - 1, c2) + f(r1 - 1, c1 - 1) +
5 * mod) %
mod;
cout << ans << endl;
} | replace | 53 | 54 | 53 | 54 | 0 | |
p02782 | C++ | Runtime Error | // 引用:http://drken1215.hatenablog.com/entry/2018/06/08/210000
#include <iostream>
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long f(int r, int c) { return COM(r + c, c); }
signed main() {
// 前処理
COMinit();
// 計算例
// cout << COM(100000, 50000) << endl;
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
long long ans = 0;
for (int c = c1 + 1; c <= c2 + 1; c++) {
ans += f(r2, c);
ans %= MOD;
}
for (int c = c1 + 1; c <= c2 + 1; c++) {
ans += MOD - f(r1 - 1, c);
ans %= MOD;
}
cout << ans << endl;
return 0;
} | // 引用:http://drken1215.hatenablog.com/entry/2018/06/08/210000
#include <iostream>
using namespace std;
const int MAX = 2510000;
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;
}
long long f(int r, int c) { return COM(r + c, c); }
signed main() {
// 前処理
COMinit();
// 計算例
// cout << COM(100000, 50000) << endl;
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
long long ans = 0;
for (int c = c1 + 1; c <= c2 + 1; c++) {
ans += f(r2, c);
ans %= MOD;
}
for (int c = c1 + 1; c <= c2 + 1; c++) {
ans += MOD - f(r1 - 1, c);
ans %= MOD;
}
cout << ans << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02782 | C++ | Runtime Error | #ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
#define eb emplace_back
#define SZ(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const long long INF = 1e+18 + 1;
// long long INF=(1LL<<31)-1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
// ll MOD=1000000007LL;
// const ll MOD=998244353LL;
// const ll MOD=1777777777LL;
// const ll MAX_V=114514LL;
// const ll MAX = 500010LL;
const ll mod = MOD;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
vl dx = {0, 0, 1, -1};
vl dy = {1, -1, 0, 0};
// 素因数分解O(√n)
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
const ll MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// finvが階乗の逆元
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
/*ll N=2000010;
vl arr(N);
void Eratosthenes(){
for(ll i = 0; i < N; i++){
arr[i] = 1;
}
arr[1]=0;
for(ll i = 2; i < sqrt(N); i++){
if(arr[i]){
for(ll j = 0; i * (j + 2) < N; j++){
arr[i *(j + 2)] = 0;
}
}
}
}*/
// 素数判定O(√n)
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
/* SegTree<X>(n,fx,ex): モノイド(集合X, 二項演算fx,
単位元ex)についてサイズnで構築 set(int i, X x), build():
i番目の要素をxにセット。まとめてセグ木を構築する。O(n) update(i,x): i
番目の要素を x に更新。O(log(n)) query(a,b): [a,b)
全てにfxを作用させた値を取得。O(log(n))
*/
template <typename X> struct SegTree {
using FX = function<X(X, X)>;
int n;
FX fx;
const X ex;
vector<X> dat;
SegTree(int n_, FX fx_, X ex_) : n(), fx(fx_), ex(ex_), dat(n_ * 4, ex_) {
int x = 1;
while (n_ > x) {
x *= 2;
}
n = x;
}
void set(int i, X x) { dat[i + n - 1] = x; }
void build() {
for (int k = n - 2; k >= 0; k--)
dat[k] = fx(dat[2 * k + 1], dat[2 * k + 2]);
}
void update(int i, X x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2; // parent
dat[i] = fx(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
// the minimum element of [a,b)
X query(int a, int b) { return query_sub(a, b, 0, 0, n); }
X query_sub(int a, int b, int k, int l, int r) {
if (r <= a || b <= l) {
return ex;
} else if (a <= l && r <= b) {
return dat[k];
} else {
X vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2);
X vr = query_sub(a, b, k * 2 + 2, (l + r) / 2, r);
return fx(vl, vr);
}
}
/* debug */
inline X operator[](int a) { return query(a, a + 1); }
void print() {
for (int i = 0; i < 2 * n - 1; ++i) {
cout << (*this)[i];
if (i != n)
cout << ",";
}
cout << endl;
}
/*
使用例
auto fx=[](int x1,int x2)->int{return max(x1,x2);};
ll ex=0;
SegTree<ll>rmq(n,fx,ex);*/
};
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout << fixed << setprecision(10);
/*--------------------------------*/
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll ans = COM(r2 + c2 + 2, r2 + 1) + (MOD - COM(r1 + c2 + 1, r1)) +
(MOD - COM(r2 + c1 + 1, c1)) + COM(r1 + c1, r1);
cout << ans % MOD << endl;
} | #ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#define PI 3.14159265359
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define bit(n, k) (((ll)n >> (ll)k) & 1) /*nのk bit目*/
#define pb push_back
#define eb emplace_back
#define SZ(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const long long INF = 1e+18 + 1;
// long long INF=(1LL<<31)-1;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vector<ll>> vvl;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
const ll MOD = 1000000007LL;
// ll MOD=1000000007LL;
// const ll MOD=998244353LL;
// const ll MOD=1777777777LL;
// const ll MAX_V=114514LL;
// const ll MAX = 500010LL;
const ll mod = MOD;
string abc = "abcdefghijklmnopqrstuvwxyz";
string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
vl dx = {0, 0, 1, -1};
vl dy = {1, -1, 0, 0};
// 素因数分解O(√n)
map<ll, ll> prime_factor(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
const ll MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
// finvが階乗の逆元
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
/*ll N=2000010;
vl arr(N);
void Eratosthenes(){
for(ll i = 0; i < N; i++){
arr[i] = 1;
}
arr[1]=0;
for(ll i = 2; i < sqrt(N); i++){
if(arr[i]){
for(ll j = 0; i * (j + 2) < N; j++){
arr[i *(j + 2)] = 0;
}
}
}
}*/
// 素数判定O(√n)
bool is_prime(ll n) {
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
/* SegTree<X>(n,fx,ex): モノイド(集合X, 二項演算fx,
単位元ex)についてサイズnで構築 set(int i, X x), build():
i番目の要素をxにセット。まとめてセグ木を構築する。O(n) update(i,x): i
番目の要素を x に更新。O(log(n)) query(a,b): [a,b)
全てにfxを作用させた値を取得。O(log(n))
*/
template <typename X> struct SegTree {
using FX = function<X(X, X)>;
int n;
FX fx;
const X ex;
vector<X> dat;
SegTree(int n_, FX fx_, X ex_) : n(), fx(fx_), ex(ex_), dat(n_ * 4, ex_) {
int x = 1;
while (n_ > x) {
x *= 2;
}
n = x;
}
void set(int i, X x) { dat[i + n - 1] = x; }
void build() {
for (int k = n - 2; k >= 0; k--)
dat[k] = fx(dat[2 * k + 1], dat[2 * k + 2]);
}
void update(int i, X x) {
i += n - 1;
dat[i] = x;
while (i > 0) {
i = (i - 1) / 2; // parent
dat[i] = fx(dat[i * 2 + 1], dat[i * 2 + 2]);
}
}
// the minimum element of [a,b)
X query(int a, int b) { return query_sub(a, b, 0, 0, n); }
X query_sub(int a, int b, int k, int l, int r) {
if (r <= a || b <= l) {
return ex;
} else if (a <= l && r <= b) {
return dat[k];
} else {
X vl = query_sub(a, b, k * 2 + 1, l, (l + r) / 2);
X vr = query_sub(a, b, k * 2 + 2, (l + r) / 2, r);
return fx(vl, vr);
}
}
/* debug */
inline X operator[](int a) { return query(a, a + 1); }
void print() {
for (int i = 0; i < 2 * n - 1; ++i) {
cout << (*this)[i];
if (i != n)
cout << ",";
}
cout << endl;
}
/*
使用例
auto fx=[](int x1,int x2)->int{return max(x1,x2);};
ll ex=0;
SegTree<ll>rmq(n,fx,ex);*/
};
int main() {
ios::sync_with_stdio(false);
std::cin.tie(nullptr);
cout << fixed << setprecision(10);
/*--------------------------------*/
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll ans = COM(r2 + c2 + 2, r2 + 1) + (MOD - COM(r1 + c2 + 1, r1)) +
(MOD - COM(r2 + c1 + 1, c1)) + COM(r1 + c1, r1);
cout << ans % MOD << endl;
} | replace | 47 | 48 | 47 | 48 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define sum(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(), a.end(), key)
#define ub(a, key) upper_bound(a.begin(), a.end(), key)
#define count(a, key) count(v.begin(), v.end(), 1)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>; // to cost
using UnWeightedGraph = vector<vector<int>>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
void YN(bool flg) { cout << (flg ? "YES" : "NO") << '\n'; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << '\n'; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << '\n'; }
template <typename T> int getIndexOfLowerBound(vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <typename T, typename U> int getIndexOfUpperBound(vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin();
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<vector<T>> &df) {
for (int i = 0; i < df.size(); i++)
for (int j = 0; j < df[i].size(); j++)
is >> df[i][j];
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT << '{';
os << pair_var.first;
DUMPOUT << ',';
os << " " << pair_var.second;
DUMPOUT << '}';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT << '[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT << ']';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto &vec : df)
os << vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() { DUMPOUT << '#' << endl; }
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int f(int a, int b) {
if (b == 1)
return (a * (a + 3) / 2) % MOD;
return (COM(a + b + 2, a + 1) - a - b - 2) % MOD;
}
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
print((f(r2, c2) - f(r1 - 1, c2) - f(r2, c1 - 1) + MOD + f(r1 - 1, c1 - 1)) %
MOD);
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rrep(i, n) for (int(i) = ((n)-1); (i) >= 0; (i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define sum(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(), a.end(), key)
#define ub(a, key) upper_bound(a.begin(), a.end(), key)
#define count(a, key) count(v.begin(), v.end(), 1)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define F first
#define S second
using P = pair<int, int>;
using WeightedGraph = vector<vector<P>>; // to cost
using UnWeightedGraph = vector<vector<int>>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
void YN(bool flg) { cout << (flg ? "YES" : "NO") << '\n'; }
void Yn(bool flg) { cout << (flg ? "Yes" : "No") << '\n'; }
void yn(bool flg) { cout << (flg ? "yes" : "no") << '\n'; }
template <typename T> int getIndexOfLowerBound(vector<T> &v, T x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <typename T, typename U> int getIndexOfUpperBound(vector<T> &v, T x) {
return upper_bound(v.begin(), v.end(), x) - v.begin();
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec)
is >> x;
return is;
}
template <typename T> istream &operator>>(istream &is, vector<vector<T>> &df) {
for (int i = 0; i < df.size(); i++)
for (int j = 0; j < df[i].size(); j++)
is >> df[i][j];
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT << '{';
os << pair_var.first;
DUMPOUT << ',';
os << " " << pair_var.second;
DUMPOUT << '}';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT << '[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT << ']';
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto &vec : df)
os << vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end())
DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() { cout << endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail) != 0)
cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() { DUMPOUT << '#' << endl; }
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
const int MAX = 5000000;
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 f(int a, int b) {
if (b == 1)
return (a * (a + 3) / 2) % MOD;
return (COM(a + b + 2, a + 1) - a - b - 2) % MOD;
}
signed main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
print((f(r2, c2) - f(r1 - 1, c2) - f(r2, c1 - 1) + MOD + f(r1 - 1, c1 - 1)) %
MOD);
}
| replace | 134 | 135 | 134 | 135 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define reprev(i, n) for (int i = (n - 1LL); i >= 0; --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;
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef long double ld;
constexpr int MOD = 1000000007;
// + - * / ^
int mod(int a) {
int res = a % MOD;
if (res < 0) {
return res + MOD;
}
return res;
}
int mul_mod(int a, int b) {
ll res = ((ll)a * (ll)b) % MOD;
return mod((int)res);
}
int pow_mod(int a, int b) {
ll res = 1;
while (b > 0) {
if (b & 1) {
res = res * (ll)a % (ll)MOD;
}
a = mul_mod(a, a);
b >>= 1;
}
return (int)res;
}
int inv_mod(int a) { return pow_mod(a, MOD - 2); }
int div_mod(int a, int b) { return mul_mod(a, inv_mod(b)); }
// ! C
constexpr int FAC_MAX = 300000;
ll fac[FAC_MAX], finv[FAC_MAX], inv[FAC_MAX];
void com_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < FAC_MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll com_mod(int a, int b) {
if (a < b)
return 0;
if (a < 0 || b < 0)
return 0;
return fac[a] * (finv[b] * finv[a - b] % MOD) % MOD;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
com_init();
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
int ans = 0;
repp(i, c1, c2 + 1) {
ans = mod(ans + com_mod(r2 + i + 1, i + 1));
ans = mod(ans - com_mod(r1 + i, i + 1));
}
cout << ans << '\n';
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#ifdef LOCAL
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#else
#define eprintf(...) 42
#endif
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define repp(i, m, n) for (int i = m, i##_len = (n); i < i##_len; ++i)
#define reprev(i, n) for (int i = (n - 1LL); i >= 0; --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;
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;
typedef long double ld;
constexpr int MOD = 1000000007;
// + - * / ^
int mod(int a) {
int res = a % MOD;
if (res < 0) {
return res + MOD;
}
return res;
}
int mul_mod(int a, int b) {
ll res = ((ll)a * (ll)b) % MOD;
return mod((int)res);
}
int pow_mod(int a, int b) {
ll res = 1;
while (b > 0) {
if (b & 1) {
res = res * (ll)a % (ll)MOD;
}
a = mul_mod(a, a);
b >>= 1;
}
return (int)res;
}
int inv_mod(int a) { return pow_mod(a, MOD - 2); }
int div_mod(int a, int b) { return mul_mod(a, inv_mod(b)); }
// ! C
constexpr int FAC_MAX = 3000000;
ll fac[FAC_MAX], finv[FAC_MAX], inv[FAC_MAX];
void com_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < FAC_MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll com_mod(int a, int b) {
if (a < b)
return 0;
if (a < 0 || b < 0)
return 0;
return fac[a] * (finv[b] * finv[a - b] % MOD) % MOD;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
com_init();
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
int ans = 0;
repp(i, c1, c2 + 1) {
ans = mod(ans + com_mod(r2 + i + 1, i + 1));
ans = mod(ans - com_mod(r1 + i, i + 1));
}
cout << ans << '\n';
return 0;
} | replace | 83 | 84 | 83 | 84 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const bool b) { return (b ? "true" : "false"); }
string to_string(const char *s) { return to_string((string)s); }
string to_string(const char c) {
string s = "'";
s += c;
s += "'";
return s;
}
template <class T, class U> string to_string(const pair<T, U> &p) {
string s = "(";
s += to_string(p.first);
s += ", ";
s += to_string(p.second);
s += ")";
return s;
}
template <class T> string to_string(const T &a) {
bool first = true;
string s = "{";
for (const auto &x : a) {
if (!first) {
s += ", ";
}
first = false;
s += to_string(x);
}
s += "}";
return s;
}
void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head head, Tail... tail) {
cerr << ' ' << to_string(head);
debug_out(tail...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "] = ", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
using ll = long long;
using ld = long double;
const int mod = 1e9 + 7;
const int inf = 1e9 + 100;
const ll inf64 = 7e18l;
int mult(int x, int y) { return 1ll * x * y % mod; }
int add(int x, int y) {
x += y;
if (x >= mod) {
return x - mod;
}
return x;
}
int sub(int x, int y) {
x -= y;
if (x < 0) {
return x + mod;
}
return x;
}
void add_self(int &x, int y) { x = add(x, y); }
int bin_pow(int x, int y) {
if (y == 0) {
return 1;
}
if (y % 2 == 0) {
return bin_pow(mult(x, x), y / 2);
}
return mult(x, bin_pow(x, y - 1));
}
int inv(int x) { return bin_pow(x, mod - 2); }
const int maxn = 1e6 + 5;
vector<int> fact(maxn), inv_fact(maxn);
int C(int x, int y) {
assert(x >= y);
return mult(fact[x], mult(inv_fact[y], inv_fact[x - y]));
}
int solve_function(int k, int n) { return C(k + n + 1, k + 1); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
fact[0] = 1;
for (int i = 1; i < maxn; ++i) {
fact[i] = mult(fact[i - 1], i);
}
for (int i = 0; i < maxn; ++i) {
inv_fact[i] = inv(fact[i]);
}
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
int answer = 0;
for (int i = r1; i <= r2; ++i) {
int x2 = solve_function(i, c2);
int x1 = solve_function(i, c1 - 1);
add_self(answer, sub(x2, x1));
}
cout << answer << '\n';
//~ int answer2 = 0;
//~ for (int i = r1; i <= r2; ++i) {
//~ for (int j = c1; j <= c2; ++j) {
//~ add_self(answer2, C(i + j, i));
//~ }
//~ }
//~ cout << answer2 << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
string to_string(const string &s) { return '"' + s + '"'; }
string to_string(const bool b) { return (b ? "true" : "false"); }
string to_string(const char *s) { return to_string((string)s); }
string to_string(const char c) {
string s = "'";
s += c;
s += "'";
return s;
}
template <class T, class U> string to_string(const pair<T, U> &p) {
string s = "(";
s += to_string(p.first);
s += ", ";
s += to_string(p.second);
s += ")";
return s;
}
template <class T> string to_string(const T &a) {
bool first = true;
string s = "{";
for (const auto &x : a) {
if (!first) {
s += ", ";
}
first = false;
s += to_string(x);
}
s += "}";
return s;
}
void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head head, Tail... tail) {
cerr << ' ' << to_string(head);
debug_out(tail...);
}
#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "] = ", debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
using ll = long long;
using ld = long double;
const int mod = 1e9 + 7;
const int inf = 1e9 + 100;
const ll inf64 = 7e18l;
int mult(int x, int y) { return 1ll * x * y % mod; }
int add(int x, int y) {
x += y;
if (x >= mod) {
return x - mod;
}
return x;
}
int sub(int x, int y) {
x -= y;
if (x < 0) {
return x + mod;
}
return x;
}
void add_self(int &x, int y) { x = add(x, y); }
int bin_pow(int x, int y) {
if (y == 0) {
return 1;
}
if (y % 2 == 0) {
return bin_pow(mult(x, x), y / 2);
}
return mult(x, bin_pow(x, y - 1));
}
int inv(int x) { return bin_pow(x, mod - 2); }
const int maxn = 4e6 + 5;
vector<int> fact(maxn), inv_fact(maxn);
int C(int x, int y) {
assert(x >= y);
return mult(fact[x], mult(inv_fact[y], inv_fact[x - y]));
}
int solve_function(int k, int n) { return C(k + n + 1, k + 1); }
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
fact[0] = 1;
for (int i = 1; i < maxn; ++i) {
fact[i] = mult(fact[i - 1], i);
}
for (int i = 0; i < maxn; ++i) {
inv_fact[i] = inv(fact[i]);
}
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
int answer = 0;
for (int i = r1; i <= r2; ++i) {
int x2 = solve_function(i, c2);
int x1 = solve_function(i, c1 - 1);
add_self(answer, sub(x2, x1));
}
cout << answer << '\n';
//~ int answer2 = 0;
//~ for (int i = r1; i <= r2; ++i) {
//~ for (int j = c1; j <= c2; ++j) {
//~ add_self(answer2, C(i + j, i));
//~ }
//~ }
//~ cout << answer2 << '\n';
return 0;
}
| replace | 73 | 74 | 73 | 74 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define Rep(i, a, b) for (ll i = a; i < b; ++i)
#define rep(i, b) Rep(i, 0, b)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
using ll = long long;
constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
namespace {
template <typename T> void chmax(T &a, T b) { a = std::max(a, b); }
template <typename T> void chmin(T &a, T b) { a = std::min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
void Cout(long long x, const char *end = "\n") { std::cout << x << end; }
template <typename T> void Cout(const T &x, const char *end = "\n") {
std::cout << x << end;
}
template <typename T>
void Cout(const std::vector<T> &x, const char *sep = " ",
const char *end = "\n") {
for (std::size_t i = 0, sz = x.size(); i < sz; i++) {
std::cout << x[i] << (i == sz - 1 ? end : sep);
}
}
// 標準入出力
struct inp {
std::size_t sz;
inp(std::size_t _sz = 1) : sz(_sz) {}
template <typename T> operator T() const {
T a;
std::cin >> a;
return a;
}
template <typename T> operator std::vector<T>() const {
std::vector<T> a(sz);
for (std::size_t i = 0; i < sz; i++)
std::cin >> a[i];
return a;
}
};
// 2次元用の標準入出力
template <typename T> struct inpn {
std::size_t szi, szj;
inpn(std::size_t _szi, std::size_t _szj) : szi(_szi), szj(_szj) {}
operator std::vector<std::vector<T>>() const {
std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
for (std::size_t i = 0; i < szi; ++i)
for (std::size_t j = 0; j < szj; ++j)
cin >> a[i][j];
return a;
}
};
inp inp1; // input one
// けんちょんさんのを改造した tada
// Combination を高速にテーブル化させるライブラリ
// MOD >= 1 の場合は，MODで割った余りを返す O(n)
// MOD <= 0 の場合は，余りを考慮しない O(n^2) オーバーフローに注意
template <int MOD> class COM {
public:
COM(long long max_n) noexcept : kMax_(max_n * 4LL + 1LL) {
if (MOD >= 1)
COMInit();
else
COMInitNoMod();
};
// 二項係数計算
long long Com(int n, int k) {
if (n < k)
return 0LL;
if (n < 0 || k < 0)
return 0LL;
if (MOD >= 1)
return fac_[n] * (finv_[k] * finv_[n - k] % MOD) % MOD;
else
return com_table_[n * kMax_ + k];
}
// 重複組み合わせ
long long H(int n, int k) { return Com(n + k - 1, k); }
private:
void COMInit() {
fac_.resize(kMax_);
finv_.resize(kMax_);
inv_.resize(kMax_);
fac_[0] = fac_[1] = 1;
finv_[0] = finv_[1] = 1;
inv_[1] = 1;
for (int i = 2; i < kMax_; ++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;
}
}
void COMInitNoMod() {
com_table_ = std::vector<long long>(kMax_ * kMax_, 0LL);
for (int i = 0; i < kMax_; ++i) {
for (int j = 0; j <= i; ++j) {
if (j == 0 || j == i)
com_table_[i * kMax_ + j] = 1LL;
else {
com_table_[i * kMax_ + j] = // パスカルの三角形を利用している
(com_table_[(i - 1) * kMax_ + j - 1] +
com_table_[(i - 1) * kMax_ + j]);
}
}
}
// rep(i, kMax_) {
// rep(j, i + 1) {
// cout << com_table_[i * kMax_ + j] << " ";
// }
// cout << endl;
// }
}
std::vector<long long> fac_, finv_, inv_;
std::vector<long long> com_table_;
const long long kMax_;
};
} // namespace
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
// f(r, c) = COM(r + c, r)
int height = r2 - r1;
int width = c2 - c1;
COM<mod> com(height + width);
ll ans = 0LL;
// S(p) = C(1, y) + C(2, y) + ... + C(p, y) として (もちろんC(a, b) かつ a < b
// = 0) S(b) - S(a - 1) を計算するのが定石らしい さらに S(p) = C(p + 1, y + 1)
// が成り立つらしい パスカルの三角形を見るとわかりやすい C(p + 1, y + 1) =
// C(1, y) + C(2, y) + ... C(p, y)
for (int i = r1; i <= r2; ++i) {
ans += (com.Com(c2 + i + 1, i + 1) - com.Com(c1 + i, i + 1) + mod) % mod;
ans %= mod;
// for (int j = c1; j <= c2; ++j) {
// ans += com.Com(i + j, i);
// ans %= mod;
// }
}
Cout(ans);
return 0;
}
| #include <algorithm>
#include <array>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define Rep(i, a, b) for (ll i = a; i < b; ++i)
#define rep(i, b) Rep(i, 0, b)
#define allof(a) (a).begin(), (a).end()
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
using ll = long long;
constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 1e9 + 7;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr int dy[] = {0, -1, 0, 1, 1, -1, -1, 1};
namespace {
template <typename T> void chmax(T &a, T b) { a = std::max(a, b); }
template <typename T> void chmin(T &a, T b) { a = std::min(a, b); }
template <typename T> void chadd(T &a, T b) { a = a + b; }
void Cout(long long x, const char *end = "\n") { std::cout << x << end; }
template <typename T> void Cout(const T &x, const char *end = "\n") {
std::cout << x << end;
}
template <typename T>
void Cout(const std::vector<T> &x, const char *sep = " ",
const char *end = "\n") {
for (std::size_t i = 0, sz = x.size(); i < sz; i++) {
std::cout << x[i] << (i == sz - 1 ? end : sep);
}
}
// 標準入出力
struct inp {
std::size_t sz;
inp(std::size_t _sz = 1) : sz(_sz) {}
template <typename T> operator T() const {
T a;
std::cin >> a;
return a;
}
template <typename T> operator std::vector<T>() const {
std::vector<T> a(sz);
for (std::size_t i = 0; i < sz; i++)
std::cin >> a[i];
return a;
}
};
// 2次元用の標準入出力
template <typename T> struct inpn {
std::size_t szi, szj;
inpn(std::size_t _szi, std::size_t _szj) : szi(_szi), szj(_szj) {}
operator std::vector<std::vector<T>>() const {
std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
for (std::size_t i = 0; i < szi; ++i)
for (std::size_t j = 0; j < szj; ++j)
cin >> a[i][j];
return a;
}
};
inp inp1; // input one
// けんちょんさんのを改造した tada
// Combination を高速にテーブル化させるライブラリ
// MOD >= 1 の場合は，MODで割った余りを返す O(n)
// MOD <= 0 の場合は，余りを考慮しない O(n^2) オーバーフローに注意
template <int MOD> class COM {
public:
COM(long long max_n) noexcept : kMax_(max_n * 4LL + 1LL) {
if (MOD >= 1)
COMInit();
else
COMInitNoMod();
};
// 二項係数計算
long long Com(int n, int k) {
if (n < k)
return 0LL;
if (n < 0 || k < 0)
return 0LL;
if (MOD >= 1)
return fac_[n] * (finv_[k] * finv_[n - k] % MOD) % MOD;
else
return com_table_[n * kMax_ + k];
}
// 重複組み合わせ
long long H(int n, int k) { return Com(n + k - 1, k); }
private:
void COMInit() {
fac_.resize(kMax_);
finv_.resize(kMax_);
inv_.resize(kMax_);
fac_[0] = fac_[1] = 1;
finv_[0] = finv_[1] = 1;
inv_[1] = 1;
for (int i = 2; i < kMax_; ++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;
}
}
void COMInitNoMod() {
com_table_ = std::vector<long long>(kMax_ * kMax_, 0LL);
for (int i = 0; i < kMax_; ++i) {
for (int j = 0; j <= i; ++j) {
if (j == 0 || j == i)
com_table_[i * kMax_ + j] = 1LL;
else {
com_table_[i * kMax_ + j] = // パスカルの三角形を利用している
(com_table_[(i - 1) * kMax_ + j - 1] +
com_table_[(i - 1) * kMax_ + j]);
}
}
}
// rep(i, kMax_) {
// rep(j, i + 1) {
// cout << com_table_[i * kMax_ + j] << " ";
// }
// cout << endl;
// }
}
std::vector<long long> fac_, finv_, inv_;
std::vector<long long> com_table_;
const long long kMax_;
};
} // namespace
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
// f(r, c) = COM(r + c, r)
int height = r2;
int width = c2;
COM<mod> com(height + width);
ll ans = 0LL;
// S(p) = C(1, y) + C(2, y) + ... + C(p, y) として (もちろんC(a, b) かつ a < b
// = 0) S(b) - S(a - 1) を計算するのが定石らしい さらに S(p) = C(p + 1, y + 1)
// が成り立つらしい パスカルの三角形を見るとわかりやすい C(p + 1, y + 1) =
// C(1, y) + C(2, y) + ... C(p, y)
for (int i = r1; i <= r2; ++i) {
ans += (com.Com(c2 + i + 1, i + 1) - com.Com(c1 + i, i + 1) + mod) % mod;
ans %= mod;
// for (int j = c1; j <= c2; ++j) {
// ans += com.Com(i + j, i);
// ans %= mod;
// }
}
Cout(ans);
return 0;
}
| replace | 171 | 173 | 171 | 173 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 1e6 + 7, M = 1e9 + 7;
LL fac[N], invfac[N];
LL power(LL a, LL p) {
if (p == 0)
return 1;
LL ans = power(a, p / 2);
ans = (ans * ans) % M;
if (p % 2)
ans = (ans * a) % M;
return ans;
}
void pre() {
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = (fac[i - 1] * i) % M;
invfac[N - 1] = power(fac[N - 1], M - 2);
for (int i = N - 2; i >= 0; i--)
invfac[i] = (invfac[i + 1] * (i + 1)) % M;
}
LL C(int n, int r) {
if (r < 0 || r > n)
return 0;
LL num = fac[n];
LL denom = (invfac[r] * invfac[n - r]) % M;
return (num * denom) % M;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
pre();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r1--;
c1--;
LL ans = C(r2 + c2 + 2, r2 + 1) - C(r1 + c2 + 2, r1 + 1) -
C(r2 + c1 + 2, r2 + 1) + C(r1 + c1 + 2, r1 + 1);
ans = (ans % M + M) % M;
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2e6 + 7, M = 1e9 + 7;
LL fac[N], invfac[N];
LL power(LL a, LL p) {
if (p == 0)
return 1;
LL ans = power(a, p / 2);
ans = (ans * ans) % M;
if (p % 2)
ans = (ans * a) % M;
return ans;
}
void pre() {
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = (fac[i - 1] * i) % M;
invfac[N - 1] = power(fac[N - 1], M - 2);
for (int i = N - 2; i >= 0; i--)
invfac[i] = (invfac[i + 1] * (i + 1)) % M;
}
LL C(int n, int r) {
if (r < 0 || r > n)
return 0;
LL num = fac[n];
LL denom = (invfac[r] * invfac[n - r]) % M;
return (num * denom) % M;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
pre();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r1--;
c1--;
LL ans = C(r2 + c2 + 2, r2 + 1) - C(r1 + c2 + 2, r1 + 1) -
C(r2 + c1 + 2, r2 + 1) + C(r1 + c1 + 2, r1 + 1);
ans = (ans % M + M) % M;
cout << ans << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02782 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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<1000000007>;
// 二項係数ライブラリ
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 前処理COMinit()忘れずに
void solve() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
mint ans = 0;
for (int i = r1 + 1; i <= r2 + 1; i++) {
ans += COM(i + c2, c2) - COM(i + c1 - 1, c1 - 1);
}
cout << ans << endl;
}
int main() {
solve();
return 0;
} | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
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<1000000007>;
// 二項係数ライブラリ
const int MAX = 3000000;
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;
}
// 前処理COMinit()忘れずに
void solve() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
mint ans = 0;
for (int i = r1 + 1; i <= r2 + 1; i++) {
ans += COM(i + c2, c2) - COM(i + c1 - 1, c1 - 1);
}
cout << ans << endl;
}
int main() {
solve();
return 0;
} | replace | 69 | 70 | 69 | 70 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define INF (int)9e18
#define HELL (int)(1e9 + 7)
#define int long long
#define double long double
#define uint unsigned long long
#define deb(x) cerr << #x << " => " << x << "\n"
#define deba(x) \
cerr << #x << "\n"; \
for (auto a : x) \
cerr << a << " "; \
cerr << "\n";
#define debm(x) \
cerr << #x << "\n"; \
for (auto a : x) { \
for (auto b : a) \
cerr << b << " "; \
cerr << "\n"; \
}
#define getMat(x, n, m, val) vector<vector<int>> x(n, vector<int>(m, val))
#define fastio \
ios_base ::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define pout cout << fixed << setprecision(10)
int fastpow(int a, int b, int m) {
int res = 1;
a %= m;
while (b > 0) {
if (b & 1)
res = (res * a) % m;
a = (a * a) % m;
b >>= 1;
}
return res;
}
vector<int> fact(1e6 + 5);
int nck(int n, int k) {
return ((fastpow(fact[n - k], HELL - 2, HELL)) *
((fact[n] * fastpow(fact[k], HELL - 2, HELL)) % HELL)) %
HELL;
}
int now() {
return chrono::duration_cast<chrono::milliseconds>(
chrono::system_clock::now().time_since_epoch())
.count();
}
int32_t main() {
fastio;
time_t start = now();
fact[0] = 1;
for (int i = 1; i < fact.size(); i++) {
fact[i] = (i * fact[i - 1]) % HELL;
}
// using hockey stick identity
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int res = 0;
for (int i = r1; i <= r2; i++) {
res = (res + nck(i + c2 + 1, i + 1)) % HELL;
res = (res + HELL - nck(i + c1, i + 1)) % HELL;
}
cout << res << endl;
cerr << "TIME => " << now() - start << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define INF (int)9e18
#define HELL (int)(1e9 + 7)
#define int long long
#define double long double
#define uint unsigned long long
#define deb(x) cerr << #x << " => " << x << "\n"
#define deba(x) \
cerr << #x << "\n"; \
for (auto a : x) \
cerr << a << " "; \
cerr << "\n";
#define debm(x) \
cerr << #x << "\n"; \
for (auto a : x) { \
for (auto b : a) \
cerr << b << " "; \
cerr << "\n"; \
}
#define getMat(x, n, m, val) vector<vector<int>> x(n, vector<int>(m, val))
#define fastio \
ios_base ::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define pout cout << fixed << setprecision(10)
int fastpow(int a, int b, int m) {
int res = 1;
a %= m;
while (b > 0) {
if (b & 1)
res = (res * a) % m;
a = (a * a) % m;
b >>= 1;
}
return res;
}
vector<int> fact(4e6 + 5);
int nck(int n, int k) {
return ((fastpow(fact[n - k], HELL - 2, HELL)) *
((fact[n] * fastpow(fact[k], HELL - 2, HELL)) % HELL)) %
HELL;
}
int now() {
return chrono::duration_cast<chrono::milliseconds>(
chrono::system_clock::now().time_since_epoch())
.count();
}
int32_t main() {
fastio;
time_t start = now();
fact[0] = 1;
for (int i = 1; i < fact.size(); i++) {
fact[i] = (i * fact[i - 1]) % HELL;
}
// using hockey stick identity
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int res = 0;
for (int i = r1; i <= r2; i++) {
res = (res + nck(i + c2 + 1, i + 1)) % HELL;
res = (res + HELL - nck(i + c1, i + 1)) % HELL;
}
cout << res << endl;
cerr << "TIME => " << now() - start << endl;
return 0;
} | replace | 41 | 42 | 41 | 42 | 0 | TIME => 17
|
p02782 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using LLP = pair<long long, long long>;
#define REP(i, x, n) for (int i = (x), i##_len = (int)(n); i < i##_len; ++i)
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rreps(i, n) for (int i = (int)(n); i > 0; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())
#define REVERSE(x) reverse((x).begin(), (x).end())
#define TWINS(x) cout << ((x) ? "Yay!" : ":(") << '\n'
constexpr int IINF = (1 << 30) - 1;
constexpr long long LLINF = 1LL << 61;
constexpr double EPS = 1e-10;
constexpr int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
constexpr int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <long long modulus> class ModInt {
long long num;
long long mod(long long n) {
if (n < 0LL) {
n = (n % modulus) + modulus;
}
return n % modulus;
}
long long ext_gcd(long long a, long long b, long long &x, long long &y) {
if (b == 0LL) {
x = 1;
y = 0;
return a;
}
long long d = ext_gcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
long long get_inv(long long n) {
long long x, y;
ext_gcd(n, modulus, x, y);
return mod(x);
}
public:
constexpr ModInt(const long long n = 0LL) noexcept : num(mod(n)) {}
long long get(void) { return num; }
ModInt &operator+=(const ModInt &rhs) {
num += rhs.num;
if (num >= modulus) {
num -= modulus;
}
return *this;
}
ModInt &operator-=(const ModInt &rhs) {
if (num < rhs.num) {
num += modulus;
}
num -= rhs.num;
return *this;
}
ModInt &operator*=(const ModInt &rhs) {
num = num * rhs.num % modulus;
return *this;
}
ModInt &operator/=(const ModInt &rhs) {
long long inv = get_inv(rhs.num);
num = num * inv % modulus;
return *this;
}
template <typename T> ModInt &operator+=(const T &rhs) {
return *this += ModInt(rhs);
}
template <typename T> ModInt &operator-=(const T &rhs) {
return *this -= ModInt(rhs);
}
template <typename T> ModInt &operator*=(const T &rhs) {
return *this *= ModInt(rhs);
}
template <typename T> ModInt &operator/=(const T &rhs) {
return *this /= ModInt(rhs);
}
template <typename T> ModInt operator+(const T &rhs) const {
return ModInt(*this) += ModInt(rhs);
}
template <typename T> ModInt operator-(const T &rhs) const {
return ModInt(*this) -= ModInt(rhs);
}
template <typename T> ModInt operator*(const T &rhs) const {
return ModInt(*this) *= ModInt(rhs);
}
template <typename T> ModInt operator/(const T &rhs) const {
return ModInt(*this) /= ModInt(rhs);
}
ModInt &operator=(const ModInt &rhs) {
num = rhs.num;
return *this;
}
template <typename T> ModInt &operator=(const T &rhs) {
num = mod(rhs);
return *this;
}
bool operator<(const ModInt &rhs) const { return num < rhs.num; }
};
template <long long modulus>
std::istream &operator>>(std::istream &lhs, ModInt<modulus> &rhs) {
long long val;
lhs >> val;
rhs = val;
return lhs;
}
template <long long modulus>
std::ostream &operator<<(std::ostream &lhs, ModInt<modulus> rhs) {
lhs << rhs.get();
return lhs;
}
using mint = ModInt<1000000007LL>;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
constexpr int m = 1010101;
vector<mint> fact(m + 1);
fact[0] = 1;
reps(i, m) { fact[i] = fact[i - 1] * i; }
vector<mint> inv(m + 1);
inv[m] = mint(1) / fact[m];
rreps(i, m) { inv[i - 1] = inv[i] * i; }
auto comb = [&](int r, int c) { return fact[r] * inv[c] * inv[r - c]; };
mint ans = comb(r2 + c2 + 2, r2 + 1) - comb(r2 + c1 + 1, r2 + 1) -
comb(r1 + c2 + 1, c2 + 1) + comb(r1 + c1, r1);
cout << ans << endl;
cout << flush;
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using LLP = pair<long long, long long>;
#define REP(i, x, n) for (int i = (x), i##_len = (int)(n); i < i##_len; ++i)
#define rep(i, n) for (int i = 0, i##_len = (int)(n); i < i##_len; ++i)
#define reps(i, n) for (int i = 1, i##_len = (int)(n); i <= i##_len; ++i)
#define rrep(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define rreps(i, n) for (int i = (int)(n); i > 0; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())
#define REVERSE(x) reverse((x).begin(), (x).end())
#define TWINS(x) cout << ((x) ? "Yay!" : ":(") << '\n'
constexpr int IINF = (1 << 30) - 1;
constexpr long long LLINF = 1LL << 61;
constexpr double EPS = 1e-10;
constexpr int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
constexpr int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1},
dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <long long modulus> class ModInt {
long long num;
long long mod(long long n) {
if (n < 0LL) {
n = (n % modulus) + modulus;
}
return n % modulus;
}
long long ext_gcd(long long a, long long b, long long &x, long long &y) {
if (b == 0LL) {
x = 1;
y = 0;
return a;
}
long long d = ext_gcd(b, a % b, y, x);
y -= a / b * x;
return d;
}
long long get_inv(long long n) {
long long x, y;
ext_gcd(n, modulus, x, y);
return mod(x);
}
public:
constexpr ModInt(const long long n = 0LL) noexcept : num(mod(n)) {}
long long get(void) { return num; }
ModInt &operator+=(const ModInt &rhs) {
num += rhs.num;
if (num >= modulus) {
num -= modulus;
}
return *this;
}
ModInt &operator-=(const ModInt &rhs) {
if (num < rhs.num) {
num += modulus;
}
num -= rhs.num;
return *this;
}
ModInt &operator*=(const ModInt &rhs) {
num = num * rhs.num % modulus;
return *this;
}
ModInt &operator/=(const ModInt &rhs) {
long long inv = get_inv(rhs.num);
num = num * inv % modulus;
return *this;
}
template <typename T> ModInt &operator+=(const T &rhs) {
return *this += ModInt(rhs);
}
template <typename T> ModInt &operator-=(const T &rhs) {
return *this -= ModInt(rhs);
}
template <typename T> ModInt &operator*=(const T &rhs) {
return *this *= ModInt(rhs);
}
template <typename T> ModInt &operator/=(const T &rhs) {
return *this /= ModInt(rhs);
}
template <typename T> ModInt operator+(const T &rhs) const {
return ModInt(*this) += ModInt(rhs);
}
template <typename T> ModInt operator-(const T &rhs) const {
return ModInt(*this) -= ModInt(rhs);
}
template <typename T> ModInt operator*(const T &rhs) const {
return ModInt(*this) *= ModInt(rhs);
}
template <typename T> ModInt operator/(const T &rhs) const {
return ModInt(*this) /= ModInt(rhs);
}
ModInt &operator=(const ModInt &rhs) {
num = rhs.num;
return *this;
}
template <typename T> ModInt &operator=(const T &rhs) {
num = mod(rhs);
return *this;
}
bool operator<(const ModInt &rhs) const { return num < rhs.num; }
};
template <long long modulus>
std::istream &operator>>(std::istream &lhs, ModInt<modulus> &rhs) {
long long val;
lhs >> val;
rhs = val;
return lhs;
}
template <long long modulus>
std::ostream &operator<<(std::ostream &lhs, ModInt<modulus> rhs) {
lhs << rhs.get();
return lhs;
}
using mint = ModInt<1000000007LL>;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (b < a) {
a = b;
return true;
}
return false;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
constexpr int m = 2020202;
vector<mint> fact(m + 1);
fact[0] = 1;
reps(i, m) { fact[i] = fact[i - 1] * i; }
vector<mint> inv(m + 1);
inv[m] = mint(1) / fact[m];
rreps(i, m) { inv[i - 1] = inv[i] * i; }
auto comb = [&](int r, int c) { return fact[r] * inv[c] * inv[r - c]; };
mint ans = comb(r2 + c2 + 2, r2 + 1) - comb(r2 + c1 + 1, r2 + 1) -
comb(r1 + c2 + 1, c2 + 1) + comb(r1 + c1, r1);
cout << ans << endl;
cout << flush;
return 0;
} | replace | 190 | 191 | 190 | 191 | 0 | |
p02782 | C++ | Runtime Error | #include "bits/stdc++.h"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (i64 i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, s, t) for (i64 i = (s), i##_limit = (t); i <= i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#ifndef DBG
#define trace(...)
#endif
using namespace std;
using i64 = int_fast64_t;
using pii = pair<i64, i64>;
template <class T, class U> inline bool chmax(T &a, const U &b) {
return b > a && (a = b, true);
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return b < a && (a = b, true);
}
constexpr int INF = 0x3f3f3f3f;
constexpr i64 LINF = 0x3f3f3f3f3f3f3f3fLL;
template <class T> inline vector<T> make_v(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto make_v(const T &initValue, size_t sz, Args... args) {
return vector<decltype(make_v<T>(initValue, args...))>(
sz, make_v<T>(initValue, args...));
}
inline void read() {}
template <class Head, class... Tail>
inline void read(Head &head, Tail &...tail) {
cin >> head;
read(tail...);
}
inline void print() { cout << "\n"; }
template <class Head, class... Tail>
inline void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail))
cout << ' ';
print(forward<Tail>(tail)...);
}
template <class T>
inline ostream &operator<<(ostream &out, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e : vec)
out << e << delim[&e == &vec.back()];
return out;
}
// }}} End Header
constexpr int MOD = int(1e9) + 7;
// ModInt {{{
template <int64_t MOD> class ModInt {
int64_t value;
public:
// constructor
inline ModInt(int64_t val = 0) noexcept
: value((val >= MOD) ? (val % MOD)
: (val < 0) ? ((val + MOD) % MOD)
: val) {}
// プリミティブ整数型へのキャスト (型の明示:必要)
template <class Int> explicit inline operator Int() const noexcept {
return static_cast<Int>(value);
}
inline ModInt inv() const noexcept {
return ModInt<MOD>::pow(value, MOD - 2);
}
inline ModInt &operator+=(ModInt x) noexcept {
if ((value += x.value) >= MOD)
value -= MOD;
return *this;
}
inline ModInt &operator-=(ModInt x) noexcept {
if ((value -= x.value) < 0)
value += MOD;
return *this;
}
inline ModInt &operator*=(ModInt x) noexcept {
value = (value * x.value) % MOD;
return *this;
}
inline ModInt &operator/=(ModInt x) noexcept {
value = (value * x.inv().value) % MOD;
return *this;
}
inline ModInt operator+(ModInt x) const noexcept {
return ModInt(*this) += x;
}
inline ModInt operator-(ModInt x) const noexcept {
return ModInt(*this) -= x;
}
inline ModInt operator*(ModInt x) const noexcept {
return ModInt(*this) *= x;
}
inline ModInt operator/(ModInt x) const noexcept {
return ModInt(*this) /= x;
}
inline bool operator==(ModInt x) const noexcept { return value == x.value; }
inline bool operator!=(ModInt x) const noexcept {
return !(this->operator==(x));
}
friend ostream &operator<<(ostream &os, ModInt x) noexcept {
os << x.value;
return os;
}
friend istream &operator>>(istream &is, ModInt &x) noexcept {
is >> x.value;
x.value %= MOD;
return is;
}
static constexpr inline ModInt pow(int64_t n, int64_t p) noexcept {
int64_t ret = 1;
for (; p > 0; p >>= 1) {
if (p & 1)
ret = (ret * n) % MOD;
n = (n * n) % MOD;
}
return ret;
}
};
// }}}
using modint = ModInt<MOD>;
// Factorial, InvFact {{{
template <size_t N, int MOD> struct Factorial {
uint_fast64_t f[N + 1];
inline Factorial() : f{1} {
for (int i = 1; i <= N; ++i)
f[i] = (f[i - 1] * i) % MOD;
}
constexpr inline ModInt<MOD> operator[](size_t i) const { return f[i]; }
};
template <size_t N, int MOD> struct InvFact {
uint_fast64_t inv[N + 1];
uint_fast64_t f[N + 1];
inline InvFact() : inv{0, 1}, f{1, 1} {
for (int i = 2; i <= N; ++i) {
inv[i] = (MOD - MOD / i) * inv[MOD % i] % MOD;
f[i] = f[i - 1] * inv[i] % MOD;
}
}
constexpr inline ModInt<MOD> operator[](size_t i) const { return f[i]; }
};
// }}}
Factorial<1000100, MOD> fact;
InvFact<1000100, MOD> invFact;
ModInt<MOD> nCr(int n, int r) {
return (r < 0 || n < r) ? 0 : (fact[n] * (invFact[r] * invFact[n - r]));
}
ModInt<MOD> nPr(int n, int r) {
return (r < 0 || n < r) ? 0 : (fact[n] * invFact[n - r]);
}
ModInt<MOD> nHr(int n, int r) { return nCr(n + r - 1, r); }
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
i64 r1, c1, r2, c2;
read(r1, c1, r2, c2);
modint ans = 0;
reps(y, r1, r2) {
const i64 h = y;
const auto f = [&h](i64 w) -> modint {
return (modint(w + 1) * fact[w + h + 1]) /
(modint(h + 1) * fact[w + 1] * fact[h]);
};
ans += f(c2) - f(c1 - 1);
}
print(ans);
return 0;
}
| #include "bits/stdc++.h"
// Begin Header {{{
#define all(x) (x).begin(), (x).end()
#define rep(i, n) for (i64 i = 0, i##_limit = (n); i < i##_limit; ++i)
#define reps(i, s, t) for (i64 i = (s), i##_limit = (t); i <= i##_limit; ++i)
#define repr(i, s, t) for (i64 i = (s), i##_limit = (t); i >= i##_limit; --i)
#ifndef DBG
#define trace(...)
#endif
using namespace std;
using i64 = int_fast64_t;
using pii = pair<i64, i64>;
template <class T, class U> inline bool chmax(T &a, const U &b) {
return b > a && (a = b, true);
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return b < a && (a = b, true);
}
constexpr int INF = 0x3f3f3f3f;
constexpr i64 LINF = 0x3f3f3f3f3f3f3f3fLL;
template <class T> inline vector<T> make_v(const T &initValue, size_t sz) {
return vector<T>(sz, initValue);
}
template <class T, class... Args>
inline auto make_v(const T &initValue, size_t sz, Args... args) {
return vector<decltype(make_v<T>(initValue, args...))>(
sz, make_v<T>(initValue, args...));
}
inline void read() {}
template <class Head, class... Tail>
inline void read(Head &head, Tail &...tail) {
cin >> head;
read(tail...);
}
inline void print() { cout << "\n"; }
template <class Head, class... Tail>
inline void print(Head &&head, Tail &&...tail) {
cout << head;
if (sizeof...(tail))
cout << ' ';
print(forward<Tail>(tail)...);
}
template <class T>
inline ostream &operator<<(ostream &out, const vector<T> &vec) {
static constexpr const char *delim[] = {" ", ""};
for (const auto &e : vec)
out << e << delim[&e == &vec.back()];
return out;
}
// }}} End Header
constexpr int MOD = int(1e9) + 7;
// ModInt {{{
template <int64_t MOD> class ModInt {
int64_t value;
public:
// constructor
inline ModInt(int64_t val = 0) noexcept
: value((val >= MOD) ? (val % MOD)
: (val < 0) ? ((val + MOD) % MOD)
: val) {}
// プリミティブ整数型へのキャスト (型の明示:必要)
template <class Int> explicit inline operator Int() const noexcept {
return static_cast<Int>(value);
}
inline ModInt inv() const noexcept {
return ModInt<MOD>::pow(value, MOD - 2);
}
inline ModInt &operator+=(ModInt x) noexcept {
if ((value += x.value) >= MOD)
value -= MOD;
return *this;
}
inline ModInt &operator-=(ModInt x) noexcept {
if ((value -= x.value) < 0)
value += MOD;
return *this;
}
inline ModInt &operator*=(ModInt x) noexcept {
value = (value * x.value) % MOD;
return *this;
}
inline ModInt &operator/=(ModInt x) noexcept {
value = (value * x.inv().value) % MOD;
return *this;
}
inline ModInt operator+(ModInt x) const noexcept {
return ModInt(*this) += x;
}
inline ModInt operator-(ModInt x) const noexcept {
return ModInt(*this) -= x;
}
inline ModInt operator*(ModInt x) const noexcept {
return ModInt(*this) *= x;
}
inline ModInt operator/(ModInt x) const noexcept {
return ModInt(*this) /= x;
}
inline bool operator==(ModInt x) const noexcept { return value == x.value; }
inline bool operator!=(ModInt x) const noexcept {
return !(this->operator==(x));
}
friend ostream &operator<<(ostream &os, ModInt x) noexcept {
os << x.value;
return os;
}
friend istream &operator>>(istream &is, ModInt &x) noexcept {
is >> x.value;
x.value %= MOD;
return is;
}
static constexpr inline ModInt pow(int64_t n, int64_t p) noexcept {
int64_t ret = 1;
for (; p > 0; p >>= 1) {
if (p & 1)
ret = (ret * n) % MOD;
n = (n * n) % MOD;
}
return ret;
}
};
// }}}
using modint = ModInt<MOD>;
// Factorial, InvFact {{{
template <size_t N, int MOD> struct Factorial {
uint_fast64_t f[N + 1];
inline Factorial() : f{1} {
for (int i = 1; i <= N; ++i)
f[i] = (f[i - 1] * i) % MOD;
}
constexpr inline ModInt<MOD> operator[](size_t i) const { return f[i]; }
};
template <size_t N, int MOD> struct InvFact {
uint_fast64_t inv[N + 1];
uint_fast64_t f[N + 1];
inline InvFact() : inv{0, 1}, f{1, 1} {
for (int i = 2; i <= N; ++i) {
inv[i] = (MOD - MOD / i) * inv[MOD % i] % MOD;
f[i] = f[i - 1] * inv[i] % MOD;
}
}
constexpr inline ModInt<MOD> operator[](size_t i) const { return f[i]; }
};
// }}}
Factorial<2000100, MOD> fact;
InvFact<2000100, MOD> invFact;
ModInt<MOD> nCr(int n, int r) {
return (r < 0 || n < r) ? 0 : (fact[n] * (invFact[r] * invFact[n - r]));
}
ModInt<MOD> nPr(int n, int r) {
return (r < 0 || n < r) ? 0 : (fact[n] * invFact[n - r]);
}
ModInt<MOD> nHr(int n, int r) { return nCr(n + r - 1, r); }
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
i64 r1, c1, r2, c2;
read(r1, c1, r2, c2);
modint ans = 0;
reps(y, r1, r2) {
const i64 h = y;
const auto f = [&h](i64 w) -> modint {
return (modint(w + 1) * fact[w + h + 1]) /
(modint(h + 1) * fact[w + 1] * fact[h]);
};
ans += f(c2) - f(c1 - 1);
}
print(ans);
return 0;
}
| replace | 165 | 167 | 165 | 167 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define de(a) cout << #a << " = " << a << endl
#define dd(a) cout << #a << " = " << a << " "
#define optimiza_io \
cin.tie(0); \
ios_base::sync_with_stdio(0);
#define fileinput(s) freopen(s, "r", stdin)
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
typedef long long ll;
const ll mod = 1000000007;
vector<int> fact;
vector<int> inv;
void printArr(vector<int> arr, int n) {
cout << "\n------------------------------------\n";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << "\n------------------------------------\n";
}
ll modpow(ll a, ll b) {
ll c = 1;
while (b) {
if (b & 1)
c = 1LL * c * a % mod;
a = 1LL * a * a % mod;
b >>= 1;
}
return c;
}
ll ncr(ll n, ll k) { return 1LL * fact[n] * inv[k] % mod * inv[n - k] % mod; }
void init() {
int maxn = 1000000 + 10;
fact.assign(maxn, 1);
inv.assign(maxn, 1);
for (int i = 1; i < maxn; ++i)
fact[i] = 1LL * fact[i - 1] * i % mod;
inv[maxn - 1] = modpow(fact[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; --i)
inv[i] = 1LL * inv[i + 1] * (i + 1) % mod;
// printArr(fact,10);
}
int main() {
optimiza_io
int r1,
c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
init();
ll ans1 = 0;
ll p1 = ncr(r2 + c2 + 2, c2 + 1);
ll p2 = ncr(r1 + c2 + 1, c2 + 1);
ll p3 = ncr(r2 + c1 + 1, c1);
ll p4 = ncr(c1 + r1, c1);
ans1 = p1 + p4 - p3 - p2;
while (ans1 <= 0)
ans1 += mod;
ans1 = (ans1 % mod);
cout << ans1 << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define de(a) cout << #a << " = " << a << endl
#define dd(a) cout << #a << " = " << a << " "
#define optimiza_io \
cin.tie(0); \
ios_base::sync_with_stdio(0);
#define fileinput(s) freopen(s, "r", stdin)
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
typedef long long ll;
const ll mod = 1000000007;
vector<int> fact;
vector<int> inv;
void printArr(vector<int> arr, int n) {
cout << "\n------------------------------------\n";
for (int i = 0; i < n; i++)
cout << arr[i] << " ";
cout << "\n------------------------------------\n";
}
ll modpow(ll a, ll b) {
ll c = 1;
while (b) {
if (b & 1)
c = 1LL * c * a % mod;
a = 1LL * a * a % mod;
b >>= 1;
}
return c;
}
ll ncr(ll n, ll k) { return 1LL * fact[n] * inv[k] % mod * inv[n - k] % mod; }
void init() {
int maxn = 2000000 + 10;
fact.assign(maxn, 1);
inv.assign(maxn, 1);
for (int i = 1; i < maxn; ++i)
fact[i] = 1LL * fact[i - 1] * i % mod;
inv[maxn - 1] = modpow(fact[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; --i)
inv[i] = 1LL * inv[i + 1] * (i + 1) % mod;
// printArr(fact,10);
}
int main() {
optimiza_io
int r1,
c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
init();
ll ans1 = 0;
ll p1 = ncr(r2 + c2 + 2, c2 + 1);
ll p2 = ncr(r1 + c2 + 1, c2 + 1);
ll p3 = ncr(r2 + c1 + 1, c1);
ll p4 = ncr(c1 + r1, c1);
ans1 = p1 + p4 - p3 - p2;
while (ans1 <= 0)
ans1 += mod;
ans1 = (ans1 % mod);
cout << ans1 << endl;
return 0;
}
| replace | 46 | 47 | 46 | 47 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL << ((ll)n))
#define SHIFT_LEFT(n) (1LL << ((ll)n))
#define SUBS(s, f, t) ((s).substr((f)-1, (t) - (f) + 1))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
ll mod_div(ll a, ll b) {
ll tmp = MOD - 2, c = b, ret = 1;
while (tmp > 0) {
if (tmp & 1) {
ret *= c;
ret %= MOD;
}
c *= c;
c %= MOD;
tmp >>= 1;
}
return a * ret % MOD;
}
#define MAX_K 1000100
vector<ll> kaijo(MAX_K);
ll combination(ll n, ll r) {
if (n < r || n < 0 || r < 0)
return 0;
if (kaijo[0] != 1) {
kaijo[0] = 1;
for (ll i = 1; i < MAX_K; i++)
kaijo[i] = (kaijo[i - 1] * i) % MOD;
}
ll ret = kaijo[n];
long long tmp = (kaijo[r] * kaijo[n - r]) % MOD;
return mod_div(ret, tmp);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = 0;
for (ll i = 1; i <= r2 + 1; i++) {
ans += combination(c2 + i, i);
// cout<<combination(c2+i,i)<<" "<<i<<" "<<c2<<endl;
ans %= MOD;
}
// cout<<ans<<endl;
for (ll i = 1; i <= r1; i++) {
ans -= combination(c2 + i, i);
ans += MOD;
ans %= MOD;
}
for (ll i = 1; i <= c1; i++) {
ans -= combination(r2 + i, i);
ans += MOD;
ans %= MOD;
}
// cout<<ans<<endl;
for (ll i = 1; i <= r1; i++) {
ans += combination(c1 + i - 1, i);
}
cout << ans % MOD << endl;
return 0;
}
| #include <bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define BITLE(n) (1LL << ((ll)n))
#define SHIFT_LEFT(n) (1LL << ((ll)n))
#define SUBS(s, f, t) ((s).substr((f)-1, (t) - (f) + 1))
#define ALL(a) (a).begin(), (a).end()
using namespace std;
ll mod_div(ll a, ll b) {
ll tmp = MOD - 2, c = b, ret = 1;
while (tmp > 0) {
if (tmp & 1) {
ret *= c;
ret %= MOD;
}
c *= c;
c %= MOD;
tmp >>= 1;
}
return a * ret % MOD;
}
#define MAX_K 2000100
vector<ll> kaijo(MAX_K);
ll combination(ll n, ll r) {
if (n < r || n < 0 || r < 0)
return 0;
if (kaijo[0] != 1) {
kaijo[0] = 1;
for (ll i = 1; i < MAX_K; i++)
kaijo[i] = (kaijo[i - 1] * i) % MOD;
}
ll ret = kaijo[n];
long long tmp = (kaijo[r] * kaijo[n - r]) % MOD;
return mod_div(ret, tmp);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = 0;
for (ll i = 1; i <= r2 + 1; i++) {
ans += combination(c2 + i, i);
// cout<<combination(c2+i,i)<<" "<<i<<" "<<c2<<endl;
ans %= MOD;
}
// cout<<ans<<endl;
for (ll i = 1; i <= r1; i++) {
ans -= combination(c2 + i, i);
ans += MOD;
ans %= MOD;
}
for (ll i = 1; i <= c1; i++) {
ans -= combination(r2 + i, i);
ans += MOD;
ans %= MOD;
}
// cout<<ans<<endl;
for (ll i = 1; i <= r1; i++) {
ans += combination(c1 + i - 1, i);
}
cout << ans % MOD << endl;
return 0;
}
| replace | 30 | 31 | 30 | 31 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define pll pair<ll, ll>
#define pint pll
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
const int MAX = 1010000;
const int MOD = 1e9 + 7;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[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;
}
ll ans(ll r, ll c) {
ll ret = 0;
if (r == 1) {
ret = c * (c + 3);
ret %= mod;
ret *= inv[2];
ret %= mod;
return ret;
}
ret = COM(c + r + 2, r + 1);
ll t = r + c + 2;
t %= mod;
t *= -1;
t += mod;
t %= mod;
ret += t;
ret %= mod;
return ret;
}
int main() {
COMinit();
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll x = ans(r2, c2), y = ans(r1 - 1, c1 - 1), z = mod - ans(r1 - 1, c2),
w = mod - ans(r2, c1 - 1);
z += w;
z %= mod;
x += z;
x %= mod;
x += y;
x %= mod;
cout << x << endl;
return 0;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define pll pair<ll, ll>
#define pint pll
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
const int MAX = 3010000;
const int MOD = 1e9 + 7;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[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;
}
ll ans(ll r, ll c) {
ll ret = 0;
if (r == 1) {
ret = c * (c + 3);
ret %= mod;
ret *= inv[2];
ret %= mod;
return ret;
}
ret = COM(c + r + 2, r + 1);
ll t = r + c + 2;
t %= mod;
t *= -1;
t += mod;
t %= mod;
ret += t;
ret %= mod;
return ret;
}
int main() {
COMinit();
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll x = ans(r2, c2), y = ans(r1 - 1, c1 - 1), z = mod - ans(r1 - 1, c2),
w = mod - ans(r2, c1 - 1);
z += w;
z %= mod;
x += z;
x %= mod;
x += y;
x %= mod;
cout << x << endl;
return 0;
} | replace | 26 | 27 | 26 | 27 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#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 reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
using namespace std;
using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() {
cout << "Yes" << '\n';
exit(0);
}
inline void no() {
cout << "No" << '\n';
exit(0);
}
inline i64 gcd(i64 a, i64 b) {
if (min(a, b) == 0)
return max(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
inline i64 lcm(i64 a, i64 b) {
if (min(a, b) == 0)
return max(a, b);
return a / gcd(a, b) * b;
}
inline u64 xorshift() {
static u64 x = 88172645463325252ull;
x = x ^ (x << 7);
return x = x ^ (x >> 9);
}
template <typename T>
class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T>
class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) {
if (x < y)
x = y;
}
template <typename T> inline void amin(T &x, T y) {
if (x > y)
x = y;
}
template <typename T> inline T exp(T x, i64 n, T e = 1) {
T r = e;
while (n > 0) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
template <typename T> inline T bis(T ok, T ng, function<bool(T)> f, T eps = 1) {
while (abs(ok - ng) > eps) {
T mi = (ok + ng) / 2;
(f(mi) ? ok : ng) = mi;
}
return ok;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
each(x, v) is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
rep(i, v.size()) {
if (i)
os << ' ';
os << v[i];
}
return os;
}
void solve();
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(16);
solve();
return 0;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long a) {
x = a % mod;
if (x < 0)
x += mod;
}
ModInt &operator+=(ModInt that) {
x = (x + that.x) % mod;
return *this;
}
ModInt &operator-=(ModInt that) {
x = (x + mod - that.x) % mod;
return *this;
}
ModInt &operator*=(ModInt that) {
x = (long long)x * that.x % mod;
return *this;
}
ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
ModInt inverse() {
int a = x, b = mod, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
u -= t * v;
swap(a, b);
swap(u, v);
}
return ModInt(u);
}
#define op(o, p) \
ModInt operator o(ModInt that) { return ModInt(*this) p that; }
op(+, +=) op(-, -=) op(*, *=) op(/, /=)
#undef op
friend ostream &
operator<<(ostream &os, ModInt m) {
return os << m.x;
}
};
using mint = ModInt<1000000007>;
template <typename T> struct ModCalc {
vector<T> fac, finv;
ModCalc(int max) {
fac = vector<T>(max + 1);
finv = vector<T>(max + 1);
fac[0] = 1;
reps(i, max) fac[i] = fac[i - 1] * i;
finv[max] = (T)1 / fac[max];
rreps(i, max) finv[i - 1] = finv[i] * i;
}
T com(int a, int b) {
if (a < 0 || b < 0 || b > a)
return 0;
return fac[a] * finv[a - b] * finv[b];
}
};
using mcalc = ModCalc<mint>;
auto mc = mcalc(200010);
void solve() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r2++, c2++;
mint ans = 0;
ans += mc.com(r2 + c2, r2);
ans -= mc.com(r1 + c2, r1);
ans -= mc.com(r2 + c1, r2);
ans += mc.com(r1 + c1, r1);
cout << ans << endl;
}
| #include <bits/stdc++.h>
#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 reps(i, n) for (int i = 1; i <= int(n); i++)
#define rreps(i, n) for (int i = int(n); i >= 1; i--)
#define repc(i, n) for (int i = 0; i <= int(n); i++)
#define rrepc(i, n) for (int i = int(n); i >= 0; i--)
#define repi(i, a, b) for (int i = int(a); i < int(b); i++)
#define repic(i, a, b) for (int i = int(a); i <= int(b); i++)
#define each(x, y) for (auto &x : y)
#define all(a) (a).begin(), (a).end()
#define bit32(x) (1 << (x))
#define bit64(x) (1ll << (x))
using namespace std;
using i32 = int;
using i64 = long long;
using u64 = unsigned long long;
using f80 = long double;
using vi32 = vector<i32>;
using vi64 = vector<i64>;
using vu64 = vector<u64>;
using vf80 = vector<f80>;
using vstr = vector<string>;
inline void yes() {
cout << "Yes" << '\n';
exit(0);
}
inline void no() {
cout << "No" << '\n';
exit(0);
}
inline i64 gcd(i64 a, i64 b) {
if (min(a, b) == 0)
return max(a, b);
if (a % b == 0)
return b;
return gcd(b, a % b);
}
inline i64 lcm(i64 a, i64 b) {
if (min(a, b) == 0)
return max(a, b);
return a / gcd(a, b) * b;
}
inline u64 xorshift() {
static u64 x = 88172645463325252ull;
x = x ^ (x << 7);
return x = x ^ (x >> 9);
}
template <typename T>
class pqasc : public priority_queue<T, vector<T>, greater<T>> {};
template <typename T>
class pqdesc : public priority_queue<T, vector<T>, less<T>> {};
template <typename T> inline void amax(T &x, T y) {
if (x < y)
x = y;
}
template <typename T> inline void amin(T &x, T y) {
if (x > y)
x = y;
}
template <typename T> inline T exp(T x, i64 n, T e = 1) {
T r = e;
while (n > 0) {
if (n & 1)
r *= x;
x *= x;
n >>= 1;
}
return r;
}
template <typename T> inline T bis(T ok, T ng, function<bool(T)> f, T eps = 1) {
while (abs(ok - ng) > eps) {
T mi = (ok + ng) / 2;
(f(mi) ? ok : ng) = mi;
}
return ok;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
each(x, v) is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
rep(i, v.size()) {
if (i)
os << ' ';
os << v[i];
}
return os;
}
void solve();
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout << fixed << setprecision(16);
solve();
return 0;
}
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long a) {
x = a % mod;
if (x < 0)
x += mod;
}
ModInt &operator+=(ModInt that) {
x = (x + that.x) % mod;
return *this;
}
ModInt &operator-=(ModInt that) {
x = (x + mod - that.x) % mod;
return *this;
}
ModInt &operator*=(ModInt that) {
x = (long long)x * that.x % mod;
return *this;
}
ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
ModInt inverse() {
int a = x, b = mod, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
u -= t * v;
swap(a, b);
swap(u, v);
}
return ModInt(u);
}
#define op(o, p) \
ModInt operator o(ModInt that) { return ModInt(*this) p that; }
op(+, +=) op(-, -=) op(*, *=) op(/, /=)
#undef op
friend ostream &
operator<<(ostream &os, ModInt m) {
return os << m.x;
}
};
using mint = ModInt<1000000007>;
template <typename T> struct ModCalc {
vector<T> fac, finv;
ModCalc(int max) {
fac = vector<T>(max + 1);
finv = vector<T>(max + 1);
fac[0] = 1;
reps(i, max) fac[i] = fac[i - 1] * i;
finv[max] = (T)1 / fac[max];
rreps(i, max) finv[i - 1] = finv[i] * i;
}
T com(int a, int b) {
if (a < 0 || b < 0 || b > a)
return 0;
return fac[a] * finv[a - b] * finv[b];
}
};
using mcalc = ModCalc<mint>;
auto mc = mcalc(2000010);
void solve() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r2++, c2++;
mint ans = 0;
ans += mc.com(r2 + c2, r2);
ans -= mc.com(r1 + c2, r1);
ans -= mc.com(r2 + c1, r2);
ans += mc.com(r1 + c1, r1);
cout << ans << endl;
}
| replace | 164 | 165 | 164 | 165 | 0 | |
p02782 | C++ | Runtime Error | // #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define N 1000000007
#define N2 998244353
#define Nmax 1000005
#define INF (ll)1e18
#define pll pair<ll, ll>
#define mp make_pair
#define fi first
#define se second
#define vv vector
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
#define repr(i, n) repr2(i, n, 0)
#define repr2(i, m, n) for (ll i = m; i >= (n); i--)
#define get(n) \
ll(n); \
scanf("%lld", &(n));
#define get2(n, k) \
ll(n), (k); \
scanf("%lld%lld", &(n), &(k));
#define get3(n, m, k) \
ll(n), (m), (k); \
scanf("%lld%lld%lld", &(n), &(m), &(k));
#define gets(s) \
string(s); \
cin >> (s);
#define ALL(c) (c).begin(), (c).end()
#define fill_nums(A, n) \
vector<ll> A((n)); \
for (ll i = 0; i < n; i++) \
scanf("%lld", &A[i]);
#define fill_edges(adj, m) \
for (ll i = 0; i < m; i++) { \
ll a, b; \
scanf("%lld %lld", &a, &b); \
adj[a - 1].pb(b - 1); \
adj[b - 1].pb(a - 1); \
}
#define fill_direct(adj, m) \
for (ll i = 0; i < m; i++) { \
ll a, b; \
scanf("%lld %lld", &a, &b); \
adj[a - 1].pb(b - 1); \
}
#define StarBurstStream \
ios_base::sync_with_stdio(false); \
cin.tie(0); // cout.tie(0);
#define pi 3.1415926535897
#define db long double /* print with %Lf */
#define EPS 1e-9
#define flu fflush(stdout)
#define imp \
{ \
cout << "0\n"; \
return 0; \
}
#define yup \
{ \
cout << "YES\n"; \
return 0; \
}
#define debug_vec(vec, n) \
{ \
rep(idxi, n) cout << vec[idxi] << " "; \
cout << "\n"; \
}
#define debug_pvec(vec, n) \
{ \
rep(idxi, n) cout << vec[idxi].fi << "-" << vec[idxi].se << " "; \
cout << "\n"; \
}
#define debug_set(seta) \
{ \
cout << seta.size() << "\n"; \
for (auto idxi : seta) \
cout << idxi << " "; \
cout << "\n"; \
}
#define debug_map(mappa) \
{ \
cout << mappa.size() << "\n"; \
for (auto idxi : mappa) \
cout << idxi.fi << "-" << idxi.se << " "; \
cout << "\n"; \
}
#define debug_vecvec(vec, n) \
{ \
rep(idxi, n) { \
for (auto idxi2 : vec[idxi]) \
cout << idxi2 << " "; \
cout << "\n"; \
} \
}
// LOOK AT THESE BEFORE SUBMISSION
// LOOK AT THESE BEFORE SUBMISSION
// ============================================================
// Nmax value and is index access offset taking it beyond Nmax.
// Precision error in case of real numbers.
// N vs N2 chosen correctly.
// Modulo applied everywhere.
// Flush in case of interactive.
// Don't erase value in multiset.
// Check for array indices out of bound (in pre or suff sums).
// Correct return value for functions.
// Confirm the letter case of yes and no.
// Dont paste code two times in the text file.
// ============================================================
vector<ll> facts, invfacts;
ll power(ll x, ll n, ll d) {
ll val = (x % d), res = 1;
while (n > 0) {
if (n & 1)
res = (res * val) % d;
val = (val * val) % d;
n = n >> 1;
}
return (res + d) % d;
}
ll nck(ll n, ll k, ll d) {
if (k > n)
return 0;
return (facts[n] * invfacts[k] % d * invfacts[n - k] % d + d) % d;
}
ll npk(ll n, ll k, ll d) {
if (k > n)
return 0;
return (facts[n] * invfacts[n - k] % d + d) % d;
}
void initialize_facts(ll n, ll mod) {
facts.resize(n + 1);
invfacts.resize(n + 1);
facts[0] = 1;
invfacts[0] = 1;
for (ll i = 1; i <= n; i++) {
facts[i] = (facts[i - 1] * i) % mod;
invfacts[i] = power(facts[i], mod - 2, mod);
}
}
int main() {
initialize_facts(Nmax, N);
get2(r1, c1);
get2(r2, c2);
ll diff = r2 - r1, diff2 = c2 - c1;
ll ans = 0;
rep(i, diff + 1) {
ll up = r1 + i + c1;
ans = (ans + nck(up + diff2 + 1, c1 + diff2, N)) % N;
ans = (ans - nck(up, c1 - 1, N)) % N;
}
printf("%lld\n", (ans + N) % N);
return 0;
} | // #pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define N 1000000007
#define N2 998244353
#define Nmax 3000005
#define INF (ll)1e18
#define pll pair<ll, ll>
#define mp make_pair
#define fi first
#define se second
#define vv vector
#define rep(i, n) rep2(i, 0, n)
#define rep2(i, m, n) for (ll i = m; i < (n); i++)
#define repr(i, n) repr2(i, n, 0)
#define repr2(i, m, n) for (ll i = m; i >= (n); i--)
#define get(n) \
ll(n); \
scanf("%lld", &(n));
#define get2(n, k) \
ll(n), (k); \
scanf("%lld%lld", &(n), &(k));
#define get3(n, m, k) \
ll(n), (m), (k); \
scanf("%lld%lld%lld", &(n), &(m), &(k));
#define gets(s) \
string(s); \
cin >> (s);
#define ALL(c) (c).begin(), (c).end()
#define fill_nums(A, n) \
vector<ll> A((n)); \
for (ll i = 0; i < n; i++) \
scanf("%lld", &A[i]);
#define fill_edges(adj, m) \
for (ll i = 0; i < m; i++) { \
ll a, b; \
scanf("%lld %lld", &a, &b); \
adj[a - 1].pb(b - 1); \
adj[b - 1].pb(a - 1); \
}
#define fill_direct(adj, m) \
for (ll i = 0; i < m; i++) { \
ll a, b; \
scanf("%lld %lld", &a, &b); \
adj[a - 1].pb(b - 1); \
}
#define StarBurstStream \
ios_base::sync_with_stdio(false); \
cin.tie(0); // cout.tie(0);
#define pi 3.1415926535897
#define db long double /* print with %Lf */
#define EPS 1e-9
#define flu fflush(stdout)
#define imp \
{ \
cout << "0\n"; \
return 0; \
}
#define yup \
{ \
cout << "YES\n"; \
return 0; \
}
#define debug_vec(vec, n) \
{ \
rep(idxi, n) cout << vec[idxi] << " "; \
cout << "\n"; \
}
#define debug_pvec(vec, n) \
{ \
rep(idxi, n) cout << vec[idxi].fi << "-" << vec[idxi].se << " "; \
cout << "\n"; \
}
#define debug_set(seta) \
{ \
cout << seta.size() << "\n"; \
for (auto idxi : seta) \
cout << idxi << " "; \
cout << "\n"; \
}
#define debug_map(mappa) \
{ \
cout << mappa.size() << "\n"; \
for (auto idxi : mappa) \
cout << idxi.fi << "-" << idxi.se << " "; \
cout << "\n"; \
}
#define debug_vecvec(vec, n) \
{ \
rep(idxi, n) { \
for (auto idxi2 : vec[idxi]) \
cout << idxi2 << " "; \
cout << "\n"; \
} \
}
// LOOK AT THESE BEFORE SUBMISSION
// LOOK AT THESE BEFORE SUBMISSION
// ============================================================
// Nmax value and is index access offset taking it beyond Nmax.
// Precision error in case of real numbers.
// N vs N2 chosen correctly.
// Modulo applied everywhere.
// Flush in case of interactive.
// Don't erase value in multiset.
// Check for array indices out of bound (in pre or suff sums).
// Correct return value for functions.
// Confirm the letter case of yes and no.
// Dont paste code two times in the text file.
// ============================================================
vector<ll> facts, invfacts;
ll power(ll x, ll n, ll d) {
ll val = (x % d), res = 1;
while (n > 0) {
if (n & 1)
res = (res * val) % d;
val = (val * val) % d;
n = n >> 1;
}
return (res + d) % d;
}
ll nck(ll n, ll k, ll d) {
if (k > n)
return 0;
return (facts[n] * invfacts[k] % d * invfacts[n - k] % d + d) % d;
}
ll npk(ll n, ll k, ll d) {
if (k > n)
return 0;
return (facts[n] * invfacts[n - k] % d + d) % d;
}
void initialize_facts(ll n, ll mod) {
facts.resize(n + 1);
invfacts.resize(n + 1);
facts[0] = 1;
invfacts[0] = 1;
for (ll i = 1; i <= n; i++) {
facts[i] = (facts[i - 1] * i) % mod;
invfacts[i] = power(facts[i], mod - 2, mod);
}
}
int main() {
initialize_facts(Nmax, N);
get2(r1, c1);
get2(r2, c2);
ll diff = r2 - r1, diff2 = c2 - c1;
ll ans = 0;
rep(i, diff + 1) {
ll up = r1 + i + c1;
ans = (ans + nck(up + diff2 + 1, c1 + diff2, N)) % N;
ans = (ans - nck(up, c1 - 1, N)) % N;
}
printf("%lld\n", (ans + N) % N);
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
typedef long long LL;
LL n, k;
const LL mof = 1e9 + 7;
LL p = mof;
const LL maxn = 1e6;
inline LL pow_mod(LL a, LL k, LL mo) {
LL ans = 1;
while (k) {
if (k % 2)
ans = ans * a % mo;
a = a * a % mo;
k >>= 1;
}
return ans % mo;
}
LL jc[maxn + 7];
inline LL inv(LL x) { return pow_mod(x, mof - 2, mof); }
LL Inv[maxn + 7];
LL C(LL N, LL k) {
if (k > N || k < 0)
return 0;
if (k == 0 || k == N)
return 1;
LL ans = 1;
ans = ans * jc[N] * Inv[k] % mof * Inv[N - k] % mof;
return ans;
}
void init() {
jc[1] = jc[0] = 1;
for (LL i = 2; i <= maxn; ++i)
jc[i] = jc[i - 1] * i % mof;
for (int i = 0; i <= maxn; ++i)
Inv[i] = inv(jc[i]);
}
void solve(int r1, int r2, int c1, int c2) {
auto ret = C(c2 + r2 + 2, c2 + 1) - C(c2 + r1 + 1, c2 + 1) -
C(c1 + r2 + 1, c1) + C(c1 + r1, c1);
ret = (ret % MOD + MOD) % MOD;
cout << ret << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
init();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
solve(r1, r2, c1, c2);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
typedef long long LL;
LL n, k;
const LL mof = 1e9 + 7;
const LL maxn = 2e6 + 5;
inline LL pow_mod(LL a, LL k, LL mo) {
LL ans = 1;
while (k) {
if (k % 2)
ans = ans * a % mo;
a = a * a % mo;
k >>= 1;
}
return ans % mo;
}
LL jc[maxn + 7];
inline LL inv(LL x) { return pow_mod(x, mof - 2, mof); }
LL Inv[maxn + 7];
LL C(LL N, LL k) {
if (k > N || k < 0)
return 0;
if (k == 0 || k == N)
return 1;
LL ans = 1;
ans = ans * jc[N] * Inv[k] % mof * Inv[N - k] % mof;
return ans;
}
void init() {
jc[1] = jc[0] = 1;
for (LL i = 2; i <= maxn; ++i)
jc[i] = jc[i - 1] * i % mof;
for (int i = 0; i <= maxn; ++i)
Inv[i] = inv(jc[i]);
}
void solve(int r1, int r2, int c1, int c2) {
auto ret = C(c2 + r2 + 2, c2 + 1) - C(c2 + r1 + 1, c2 + 1) -
C(c1 + r2 + 1, c1) + C(c1 + r1, c1);
ret = (ret % MOD + MOD) % MOD;
cout << ret << endl;
}
// Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You
// use the default template now. You can remove this line by using your custom
// template)
int main() {
init();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
solve(r1, r2, c1, c2);
return 0;
}
| replace | 8 | 10 | 8 | 9 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
template <uint_fast64_t MOD> class ModInt {
using u64 = uint_fast64_t;
public:
u64 val;
ModInt(const u64 x = 0) : val(x % MOD) {}
constexpr u64 &value() { return val; }
constexpr ModInt operator-() { return val ? MOD - val : 0; }
constexpr ModInt operator+(const ModInt &rhs) const {
return ModInt(*this) += rhs;
}
constexpr ModInt operator-(const ModInt &rhs) const {
return ModInt(*this) -= rhs;
}
constexpr ModInt operator*(const ModInt &rhs) const {
return ModInt(*this) *= rhs;
}
constexpr ModInt operator/(const ModInt &rhs) const {
return ModInt(*this) /= rhs;
}
constexpr ModInt &operator+=(const ModInt &rhs) {
val += rhs.val;
if (val >= MOD) {
val -= MOD;
}
return *this;
}
constexpr ModInt &operator-=(const ModInt &rhs) {
if (val < rhs.val) {
val += MOD;
}
val -= rhs.val;
return *this;
}
constexpr ModInt &operator*=(const ModInt &rhs) {
val = val * rhs.val % MOD;
return *this;
}
constexpr ModInt &operator/=(const ModInt &rhs) {
*this *= rhs.inv();
return *this;
}
constexpr bool operator==(const ModInt &rhs) { return this->a == rhs.a; }
constexpr bool operator!=(const ModInt &rhs) { return this->a != rhs.a; }
friend constexpr ostream &operator<<(ostream &os, const ModInt<MOD> &x) {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, ModInt<MOD> &x) {
return is >> x.val;
}
constexpr ModInt inv() const {
u64 x = val, y = MOD, u = 1, v = 0, t = 0;
while (y > 0) {
t = x / y;
x -= t * y;
swap(x, y);
u -= t * v;
swap(u, v);
}
return ModInt(u);
}
constexpr ModInt pow(int e) const {
u64 x = 1, p = val;
while (e > 0) {
if (e % 2 == 0) {
p = (p * p) % MOD;
e /= 2;
} else {
x = (x * p) % MOD;
e--;
}
}
return ModInt(x);
}
};
// 二項係数（nCk mod.p;1<=k<=n<=1e7,pは素数）for ModInt
template <class T> struct BiCoefficient {
vector<T> fac, finv, inv;
BiCoefficient(const int MAX) : fac(MAX), finv(MAX), inv(MAX) {
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] = -inv[MOD % i] * (MOD / i);
finv[i] = finv[i - 1] * inv[i];
}
}
T 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];
}
};
using mint = ModInt<MOD>;
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
BiCoefficient<mint> biCoef(1100000);
auto f = [&](ll r, ll c) { return biCoef.comb(r + c, r); };
mint res = 0;
for (ll c = c1 + 1; c <= c2 + 1; c++) {
res += f(r2, c) - f(r1 - 1, c);
}
cout << res << endl;
return 0;
} | #include <algorithm>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for (int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;
template <uint_fast64_t MOD> class ModInt {
using u64 = uint_fast64_t;
public:
u64 val;
ModInt(const u64 x = 0) : val(x % MOD) {}
constexpr u64 &value() { return val; }
constexpr ModInt operator-() { return val ? MOD - val : 0; }
constexpr ModInt operator+(const ModInt &rhs) const {
return ModInt(*this) += rhs;
}
constexpr ModInt operator-(const ModInt &rhs) const {
return ModInt(*this) -= rhs;
}
constexpr ModInt operator*(const ModInt &rhs) const {
return ModInt(*this) *= rhs;
}
constexpr ModInt operator/(const ModInt &rhs) const {
return ModInt(*this) /= rhs;
}
constexpr ModInt &operator+=(const ModInt &rhs) {
val += rhs.val;
if (val >= MOD) {
val -= MOD;
}
return *this;
}
constexpr ModInt &operator-=(const ModInt &rhs) {
if (val < rhs.val) {
val += MOD;
}
val -= rhs.val;
return *this;
}
constexpr ModInt &operator*=(const ModInt &rhs) {
val = val * rhs.val % MOD;
return *this;
}
constexpr ModInt &operator/=(const ModInt &rhs) {
*this *= rhs.inv();
return *this;
}
constexpr bool operator==(const ModInt &rhs) { return this->a == rhs.a; }
constexpr bool operator!=(const ModInt &rhs) { return this->a != rhs.a; }
friend constexpr ostream &operator<<(ostream &os, const ModInt<MOD> &x) {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, ModInt<MOD> &x) {
return is >> x.val;
}
constexpr ModInt inv() const {
u64 x = val, y = MOD, u = 1, v = 0, t = 0;
while (y > 0) {
t = x / y;
x -= t * y;
swap(x, y);
u -= t * v;
swap(u, v);
}
return ModInt(u);
}
constexpr ModInt pow(int e) const {
u64 x = 1, p = val;
while (e > 0) {
if (e % 2 == 0) {
p = (p * p) % MOD;
e /= 2;
} else {
x = (x * p) % MOD;
e--;
}
}
return ModInt(x);
}
};
// 二項係数（nCk mod.p;1<=k<=n<=1e7,pは素数）for ModInt
template <class T> struct BiCoefficient {
vector<T> fac, finv, inv;
BiCoefficient(const int MAX) : fac(MAX), finv(MAX), inv(MAX) {
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] = -inv[MOD % i] * (MOD / i);
finv[i] = finv[i - 1] * inv[i];
}
}
T 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];
}
};
using mint = ModInt<MOD>;
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
BiCoefficient<mint> biCoef(2100000);
auto f = [&](ll r, ll c) { return biCoef.comb(r + c, r); };
mint res = 0;
for (ll c = c1 + 1; c <= c2 + 1; c++) {
res += f(r2, c) - f(r1 - 1, c);
}
cout << res << endl;
return 0;
} | replace | 133 | 134 | 133 | 134 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<char>>;
using vbo = vector<bool>;
using vvbo = vector<vector<bool>>;
using vpii = vector<pair<int, int>>;
using pqsin = priority_queue<int, vector<int>, greater<int>>;
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define decp(n) cout << fixed << setprecision((int)n)
const ll inf = 1e9 + 7;
const ll INF = 1e18;
const ll mod = 998244353;
const int MAX = 1000010;
vll fac(MAX);
vll finv(MAX);
vll inv(MAX);
void combinit(ll m) {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
finv[1] = 1;
inv[1] = 1;
rep2(i, 2, MAX) {
fac[i] = fac[i - 1] * i % m;
inv[i] = m - inv[m % i] * (m / i) % m;
finv[i] = finv[i - 1] * inv[i] % m;
}
}
ll combi(ll n, ll k, ll m = inf) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % m) % m;
}
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
combinit(inf);
ll ans = (ll)0, tmp;
for (ll j = c1; j <= c2; j++) {
tmp = combi(r2 + j + (ll)1, r2) - combi(r1 + j, r1 - (ll)1);
if (tmp < 0)
tmp += inf;
ans += tmp;
}
cout << ans % inf << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<char>>;
using vbo = vector<bool>;
using vvbo = vector<vector<bool>>;
using vpii = vector<pair<int, int>>;
using pqsin = priority_queue<int, vector<int>, greater<int>>;
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define decp(n) cout << fixed << setprecision((int)n)
const ll inf = 1e9 + 7;
const ll INF = 1e18;
const ll mod = 998244353;
const int MAX = 2000010;
vll fac(MAX);
vll finv(MAX);
vll inv(MAX);
void combinit(ll m) {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
finv[1] = 1;
inv[1] = 1;
rep2(i, 2, MAX) {
fac[i] = fac[i - 1] * i % m;
inv[i] = m - inv[m % i] * (m / i) % m;
finv[i] = finv[i - 1] * inv[i] % m;
}
}
ll combi(ll n, ll k, ll m = inf) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % m) % m;
}
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
combinit(inf);
ll ans = (ll)0, tmp;
for (ll j = c1; j <= c2; j++) {
tmp = combi(r2 + j + (ll)1, r2) - combi(r1 + j, r1 - (ll)1);
if (tmp < 0)
tmp += inf;
ans += tmp;
}
cout << ans % inf << endl;
} | replace | 24 | 25 | 24 | 25 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
static const double EPS = 1e-9;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T> void amin(T &a, T v) {
if (a > v)
a = v;
}
template <class T> void amax(T &a, T v) {
if (a < v)
a = v;
}
int ROUND(double x) { return (int)(x + 0.5); }
bool ISINT(double x) { return fabs(ROUND(x) - x) <= EPS; }
bool ISEQUAL(double x, double y) {
return fabs(x - y) <= EPS * max(1.0, max(fabs(x), fabs(y)));
}
double SQSUM(double x, double y) { return x * x + y * y; }
template <class T> vector<T> make_vector(int n, T t) { return vector<T>(n, t); }
template <class... Ts> auto make_vector(int n, Ts... ts) {
return vector<decltype(make_vector(ts...))>(n, make_vector(ts...));
}
#define PI (acos(-1))
#define ARRAY_NUM(a) (sizeof(a) / sizeof(a[0]))
#define NG (-1)
#define BIG ((int)1e9 + 10)
#define BIGLL ((ll)4e18)
#define SZ(a) ((int)(a).size())
#define SQ(a) ((a) * (a))
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define BitSet(arg, posn) ((arg) |= (1LL << (posn)))
#define BitClr(arg, posn) ((arg) &= ~(1LL << (posn)))
#define BitFlp(arg, posn) ((arg) ^= (1LL << (posn)))
#define IsBit(arg, posn) static_cast<bool>((arg) & (1LL << (posn)))
// #define DEBUG(x) cerr<<#x<<": "<<(x)<<endl
// #define DEBUG_VEC(v) cerr<<#v<<": ";REP(__i,(v).size())cerr<<((v)[__i])<<",
// ";cerr<<endl
typedef unsigned long long ull;
typedef long long ll;
struct in {
int n;
in() {}
in(int n_) : n(n_){};
template <class T> operator T() {
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
vector<T> ret(n);
for (int i = 0; i < n; i++)
cin >> ret[i];
return ret;
}
};
// modint: mod 計算を int を扱うように扱える構造体
template <int MOD> struct ModInt {
long long val;
constexpr ModInt(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr ModInt operator-() const noexcept { return val ? MOD - val : 0; }
constexpr ModInt operator+(const ModInt &r) const noexcept {
return ModInt(*this) += r;
}
constexpr ModInt operator-(const ModInt &r) const noexcept {
return ModInt(*this) -= r;
}
constexpr ModInt operator*(const ModInt &r) const noexcept {
return ModInt(*this) *= r;
}
constexpr ModInt operator/(const ModInt &r) const noexcept {
return ModInt(*this) /= r;
}
constexpr ModInt &operator+=(const ModInt &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr ModInt &operator-=(const ModInt &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr ModInt &operator*=(const ModInt &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr ModInt &operator/=(const ModInt &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 ModInt &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const ModInt &r) const noexcept {
return this->val != r.val;
}
friend ostream &operator<<(ostream &os, const ModInt<MOD> &x) noexcept {
return os << x.val;
}
friend istream &operator>>(istream &is, ModInt<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr ModInt<MOD> modpow(const ModInt<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;
}
};
// 二項係数ライブラリ
template <class T> struct BiCoef {
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : mFact(n, 1), mInv(n, 1), mFInv(n, 1) {
Init(n);
}
constexpr void Init(int n) noexcept {
mFact.assign(n, 1), mInv.assign(n, 1), mFInv.assign(n, 1);
int factMod = mFact[0].getmod();
for (int i = 2; i < n; i++) {
mFact[i] = mFact[i - 1] * i;
mInv[i] = -mInv[factMod % i] * (factMod / i);
mFInv[i] = mFInv[i - 1] * mInv[i];
}
}
constexpr T Fact(int n) const noexcept {
if (n < 0)
return 0;
return mFact[n];
}
constexpr T Comb(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return mFact[n] * mFInv[k] * mFInv[n - k];
}
constexpr T Perm(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return mFact[n] * mFInv[k] * mFInv[n - k];
}
constexpr T Homo(int n, int r) const {
if (n < 0 || r < 0)
return 0;
return r == 0 ? 1 : Comb(n + r - 1, r);
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return mInv[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return mFInv[n];
}
vector<T> mFact;
vector<T> mInv;
vector<T> mFInv;
};
const int MOD = 1000000007;
using mint = ModInt<MOD>;
BiCoef<mint> bc(1234567); // 1M * 3 * 8B(ll) = 24MB
mint func(ll r, ll c) {
mint ret = 0;
if (r < c) {
swap(r, c);
}
for (int i = 1; i <= c + 1; i++) {
ret += bc.Comb(r + i, i);
}
// cerr << " r=" << r << " c=" << c << " ret=" << ret << endl;
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ret = 0;
ret +=
func(r2, c2) - func(r2, c1 - 1) - func(r1 - 1, c2) + func(r1 - 1, c1 - 1);
cout << setprecision(20) << ret << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
static const double EPS = 1e-9;
template <class T> bool INRANGE(T x, T a, T b) { return a <= x && x <= b; }
template <class T> void amin(T &a, T v) {
if (a > v)
a = v;
}
template <class T> void amax(T &a, T v) {
if (a < v)
a = v;
}
int ROUND(double x) { return (int)(x + 0.5); }
bool ISINT(double x) { return fabs(ROUND(x) - x) <= EPS; }
bool ISEQUAL(double x, double y) {
return fabs(x - y) <= EPS * max(1.0, max(fabs(x), fabs(y)));
}
double SQSUM(double x, double y) { return x * x + y * y; }
template <class T> vector<T> make_vector(int n, T t) { return vector<T>(n, t); }
template <class... Ts> auto make_vector(int n, Ts... ts) {
return vector<decltype(make_vector(ts...))>(n, make_vector(ts...));
}
#define PI (acos(-1))
#define ARRAY_NUM(a) (sizeof(a) / sizeof(a[0]))
#define NG (-1)
#define BIG ((int)1e9 + 10)
#define BIGLL ((ll)4e18)
#define SZ(a) ((int)(a).size())
#define SQ(a) ((a) * (a))
#define REP(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define ALL(x) (x).begin(), (x).end()
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define POSSIBLE(n) cout << ((n) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define BitSet(arg, posn) ((arg) |= (1LL << (posn)))
#define BitClr(arg, posn) ((arg) &= ~(1LL << (posn)))
#define BitFlp(arg, posn) ((arg) ^= (1LL << (posn)))
#define IsBit(arg, posn) static_cast<bool>((arg) & (1LL << (posn)))
// #define DEBUG(x) cerr<<#x<<": "<<(x)<<endl
// #define DEBUG_VEC(v) cerr<<#v<<": ";REP(__i,(v).size())cerr<<((v)[__i])<<",
// ";cerr<<endl
typedef unsigned long long ull;
typedef long long ll;
struct in {
int n;
in() {}
in(int n_) : n(n_){};
template <class T> operator T() {
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
vector<T> ret(n);
for (int i = 0; i < n; i++)
cin >> ret[i];
return ret;
}
};
// modint: mod 計算を int を扱うように扱える構造体
template <int MOD> struct ModInt {
long long val;
constexpr ModInt(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr ModInt operator-() const noexcept { return val ? MOD - val : 0; }
constexpr ModInt operator+(const ModInt &r) const noexcept {
return ModInt(*this) += r;
}
constexpr ModInt operator-(const ModInt &r) const noexcept {
return ModInt(*this) -= r;
}
constexpr ModInt operator*(const ModInt &r) const noexcept {
return ModInt(*this) *= r;
}
constexpr ModInt operator/(const ModInt &r) const noexcept {
return ModInt(*this) /= r;
}
constexpr ModInt &operator+=(const ModInt &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr ModInt &operator-=(const ModInt &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr ModInt &operator*=(const ModInt &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr ModInt &operator/=(const ModInt &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 ModInt &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const ModInt &r) const noexcept {
return this->val != r.val;
}
friend ostream &operator<<(ostream &os, const ModInt<MOD> &x) noexcept {
return os << x.val;
}
friend istream &operator>>(istream &is, ModInt<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr ModInt<MOD> modpow(const ModInt<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;
}
};
// 二項係数ライブラリ
template <class T> struct BiCoef {
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : mFact(n, 1), mInv(n, 1), mFInv(n, 1) {
Init(n);
}
constexpr void Init(int n) noexcept {
mFact.assign(n, 1), mInv.assign(n, 1), mFInv.assign(n, 1);
int factMod = mFact[0].getmod();
for (int i = 2; i < n; i++) {
mFact[i] = mFact[i - 1] * i;
mInv[i] = -mInv[factMod % i] * (factMod / i);
mFInv[i] = mFInv[i - 1] * mInv[i];
}
}
constexpr T Fact(int n) const noexcept {
if (n < 0)
return 0;
return mFact[n];
}
constexpr T Comb(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return mFact[n] * mFInv[k] * mFInv[n - k];
}
constexpr T Perm(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return mFact[n] * mFInv[k] * mFInv[n - k];
}
constexpr T Homo(int n, int r) const {
if (n < 0 || r < 0)
return 0;
return r == 0 ? 1 : Comb(n + r - 1, r);
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return mInv[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return mFInv[n];
}
vector<T> mFact;
vector<T> mInv;
vector<T> mFInv;
};
const int MOD = 1000000007;
using mint = ModInt<MOD>;
BiCoef<mint> bc(2234567); // 1M * 3 * 8B(ll) = 24MB
mint func(ll r, ll c) {
mint ret = 0;
if (r < c) {
swap(r, c);
}
for (int i = 1; i <= c + 1; i++) {
ret += bc.Comb(r + i, i);
}
// cerr << " r=" << r << " c=" << c << " ret=" << ret << endl;
return ret;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ret = 0;
ret +=
func(r2, c2) - func(r2, c1 - 1) - func(r1 - 1, c2) + func(r1 - 1, c1 - 1);
cout << setprecision(20) << ret << endl;
return 0;
}
| replace | 229 | 230 | 229 | 230 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mem(a, b) memset(a, b, sizeof(a))
#define pii pair<int, int>
#define int long long
#define gcd __gcd
const int inf = 0x3f3f3f3f;
const int maxn = 1001110;
const int M = 1e9 + 7;
int n, m;
int sum[maxn];
int inv[maxn];
int sinv[maxn];
int solve(int x, int y) {
int ans = 0;
for (int i = 0; i <= x; i++) {
ans = (ans + (sum[i + y + 1] * sinv[i + 1]) % M) % M;
}
return ans * sinv[y] % M;
}
signed main() {
sum[0] = sum[1] = 1;
inv[0] = inv[1] = 1;
sinv[0] = sinv[1] = 1;
for (int i = 2; i < maxn; i++) {
sum[i] = sum[i - 1] * i % M;
inv[i] = (M - M / i) * inv[M % i] % M;
sinv[i] = (inv[i] * sinv[i - 1]) % M;
}
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int ans = solve(r2, c2);
int a = 0, b = 0, c = 0;
if (r1)
a = solve(r1 - 1, c2);
if (c1)
b = solve(r2, c1 - 1);
if (r1 && c1)
c = solve(r1 - 1, c1 - 1);
// cout<<ans<<' '<<a<<' '<<b<<' '<<c<<endl;
ans = ((ans - a - b + c) % M + M) % M;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mem(a, b) memset(a, b, sizeof(a))
#define pii pair<int, int>
#define int long long
#define gcd __gcd
const int inf = 0x3f3f3f3f;
const int maxn = 2001110;
const int M = 1e9 + 7;
int n, m;
int sum[maxn];
int inv[maxn];
int sinv[maxn];
int solve(int x, int y) {
int ans = 0;
for (int i = 0; i <= x; i++) {
ans = (ans + (sum[i + y + 1] * sinv[i + 1]) % M) % M;
}
return ans * sinv[y] % M;
}
signed main() {
sum[0] = sum[1] = 1;
inv[0] = inv[1] = 1;
sinv[0] = sinv[1] = 1;
for (int i = 2; i < maxn; i++) {
sum[i] = sum[i - 1] * i % M;
inv[i] = (M - M / i) * inv[M % i] % M;
sinv[i] = (inv[i] * sinv[i - 1]) % M;
}
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int ans = solve(r2, c2);
int a = 0, b = 0, c = 0;
if (r1)
a = solve(r1 - 1, c2);
if (c1)
b = solve(r2, c1 - 1);
if (r1 && c1)
c = solve(r1 - 1, c1 - 1);
// cout<<ans<<' '<<a<<' '<<b<<' '<<c<<endl;
ans = ((ans - a - b + c) % M + M) % M;
cout << ans << endl;
return 0;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repo(i, n) for (int i = 1; i <= n; i++)
#define ssort(a) sort(a.begin(), a.end())
#define INF 1001001001
#define INFll 100100100100100
// debug用
#define PrintVec(x) \
for (auto elementPrintVec : x) { \
cout << elementPrintVec << " "; \
} \
cout << endl;
using namespace std;
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
#include <iostream>
using namespace std;
/*
1≤k≤n≤10^7
p は素数 (上の実装ではさらに p>n を仮定している)
*/
const int MAX = 510000; // 階乗の配列数
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// mod. m での a の逆元 a^{-1} を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
if (a < n)
return 0;
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll ans = 0;
for (int x = r1; x <= r2; x++) {
ans += COM((ll)(x + 1 + c2), (ll)c2) - COM((ll)(x + c1), (ll)(x + 1));
ans += mod;
ans %= mod;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define repo(i, n) for (int i = 1; i <= n; i++)
#define ssort(a) sort(a.begin(), a.end())
#define INF 1001001001
#define INFll 100100100100100
// debug用
#define PrintVec(x) \
for (auto elementPrintVec : x) { \
cout << elementPrintVec << " "; \
} \
cout << endl;
using namespace std;
using ull = unsigned long long;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
#include <iostream>
using namespace std;
/*
1≤k≤n≤10^7
p は素数 (上の実装ではさらに p>n を仮定している)
*/
const int MAX = 2000100; // 階乗の配列数
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;
}
// mod. m での a の逆元 a^{-1} を計算する
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
// a^n mod を計算する
long long modpow(long long a, long long n, long long mod) {
if (a < n)
return 0;
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll ans = 0;
for (int x = r1; x <= r2; x++) {
ans += COM((ll)(x + 1 + c2), (ll)c2) - COM((ll)(x + c1), (ll)(x + 1));
ans += mod;
ans %= mod;
}
cout << ans << endl;
return 0;
}
| replace | 26 | 27 | 26 | 27 | 0 | |
p02782 | C++ | Runtime Error | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,tune=native")
// #pragma comment(linker, "/stack:200000000"]
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) \
for (auto &x : v) \
cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)
#define int ll
using namespace std;
#ifdef __LOCAL
#define dbg(x) cerr << #x << " : " << x << '\n'
const int maxn = 20;
#else
#define dbg(x)
const int maxn = 1e6 + 20;
#endif
// tg: @galebickosikasa
const ll inf = (ll)2e9;
const ld pi = asin(1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
ll mult(ll a, ll b) { return a * b % mod; }
ll add(ll a, ll b) {
int c = a + b;
if (c >= mod)
c -= mod;
return c;
}
ll powmod(ll a, ll n) {
if (n == 0)
return 1;
if (n % 2)
return mult(a, powmod(a, n - 1));
ll b = powmod(a, n / 2);
return mult(b, b);
}
ll inv(int a) { return powmod(a, mod - 2); }
int f[maxn], rev[maxn];
int C(int n, int k) { return mult(f[n], mult(rev[k], rev[n - k])); }
int S(int i, int j) {
if (i < 0 || j < 0)
return 0;
return C(i + j + 2, i + 1);
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
f[0] = 1;
fl(i, 1, maxn) {
f[i] = mult(f[i - 1], i);
rev[i] = inv(f[i]);
}
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int ans = S(r2, c2) - S(r1 - 1, c2) - S(r2, c1 - 1) + S(r1 - 1, c1 - 1);
ans %= mod;
if (ans < 0)
ans += mod;
cout << ans;
} | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target( \
"sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx,tune=native")
// #pragma comment(linker, "/stack:200000000"]
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) \
for (auto &x : v) \
cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)
#define int ll
using namespace std;
#ifdef __LOCAL
#define dbg(x) cerr << #x << " : " << x << '\n'
const int maxn = 20;
#else
#define dbg(x)
const int maxn = 2e6 + 20;
#endif
// tg: @galebickosikasa
const ll inf = (ll)2e9;
const ld pi = asin(1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
ll mult(ll a, ll b) { return a * b % mod; }
ll add(ll a, ll b) {
int c = a + b;
if (c >= mod)
c -= mod;
return c;
}
ll powmod(ll a, ll n) {
if (n == 0)
return 1;
if (n % 2)
return mult(a, powmod(a, n - 1));
ll b = powmod(a, n / 2);
return mult(b, b);
}
ll inv(int a) { return powmod(a, mod - 2); }
int f[maxn], rev[maxn];
int C(int n, int k) { return mult(f[n], mult(rev[k], rev[n - k])); }
int S(int i, int j) {
if (i < 0 || j < 0)
return 0;
return C(i + j + 2, i + 1);
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
f[0] = 1;
fl(i, 1, maxn) {
f[i] = mult(f[i - 1], i);
rev[i] = inv(f[i]);
}
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int ans = S(r2, c2) - S(r1 - 1, c2) - S(r2, c1 - 1) + S(r1 - 1, c1 - 1);
ans %= mod;
if (ans < 0)
ans += mod;
cout << ans;
} | replace | 46 | 47 | 46 | 47 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define fill(a) memset(a, 0, sizeof(a))
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define endl '\n'
#define init(n) \
int n; \
cin >> n; \
int a[n]; \
rep(i, n) cin >> a[i];
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long int> vll;
typedef vector<pii> vii;
ll p = 1000000007;
ll const N = 1e6 + 1;
ll fac[N];
ll invfac[N];
ll add(ll a, ll b) {
ll t = (a + b);
if (t >= p)
t -= p;
return t;
}
ll sub(ll a, ll b) {
ll t = a - b + p;
t = t % p;
return t;
}
ll power(ll a, ll x) {
ll r = 1;
while (x != 0) {
if (x % 2 == 1) {
r = r * a;
r %= p;
}
a = a * a;
a %= p;
x = x / 2;
}
return r;
}
ll mul(ll a, ll b) {
ll t = (a * b);
if (t >= p)
t %= p;
return t;
}
ll divide(ll a, ll b) { return mul(a, power(b, p - 2)); }
ll ncr(ll n, ll r) {
if (n < r)
return 0;
return mul(fac[n], mul(invfac[n - r], invfac[r]));
}
ll calc(ll r, ll c) {
if (r < 0 || c < 0)
return 0;
ll temp = 0;
ll r1 = r, c1 = c;
while (1) {
if (r < 0 || c < 0)
break;
temp = add(temp, ncr(r + c + 1, c + 1));
r--;
c--;
}
r = r1;
c = c1;
while (1) {
if (r < 0 || c < 0)
break;
temp = add(temp, ncr(r + c + 1, r + 1));
r--;
c--;
}
cout << temp << endl;
r = r1;
c = c1;
while (1) {
if (r < 0 || c < 0)
break;
temp = sub(temp, ncr(r + c, r));
r--;
c--;
}
// if(r!=c)temp++;
return temp % p;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int T = 1;
// cin>>T;
while (T--) {
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
fac[0] = 1;
for (ll i = 1; i < N; i++) {
fac[i] = fac[i - 1] * i;
fac[i] %= p;
}
for (ll i = 0; i < N; i++) {
invfac[i] = power(fac[i], p - 2);
}
ll ans = 0;
for (ll i = r1; i <= r2; i++) {
ans = add(ans, ncr(i + c2 + 1, i + 1));
}
c1--;
for (ll i = r1; i <= r2; i++) {
ans = sub(ans, ncr(i + c1 + 1, i + 1));
}
cout << ans << endl;
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define repA(i, a, n) for (int i = a; i <= (n); ++i)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
#define fill(a) memset(a, 0, sizeof(a))
#define fst first
#define snd second
#define mp make_pair
#define pb push_back
#define endl '\n'
#define init(n) \
int n; \
cin >> n; \
int a[n]; \
rep(i, n) cin >> a[i];
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<long long int> vll;
typedef vector<pii> vii;
ll p = 1000000007;
ll const N = 2e6 + 15;
ll fac[N];
ll invfac[N];
ll add(ll a, ll b) {
ll t = (a + b);
if (t >= p)
t -= p;
return t;
}
ll sub(ll a, ll b) {
ll t = a - b + p;
t = t % p;
return t;
}
ll power(ll a, ll x) {
ll r = 1;
while (x != 0) {
if (x % 2 == 1) {
r = r * a;
r %= p;
}
a = a * a;
a %= p;
x = x / 2;
}
return r;
}
ll mul(ll a, ll b) {
ll t = (a * b);
if (t >= p)
t %= p;
return t;
}
ll divide(ll a, ll b) { return mul(a, power(b, p - 2)); }
ll ncr(ll n, ll r) {
if (n < r)
return 0;
return mul(fac[n], mul(invfac[n - r], invfac[r]));
}
ll calc(ll r, ll c) {
if (r < 0 || c < 0)
return 0;
ll temp = 0;
ll r1 = r, c1 = c;
while (1) {
if (r < 0 || c < 0)
break;
temp = add(temp, ncr(r + c + 1, c + 1));
r--;
c--;
}
r = r1;
c = c1;
while (1) {
if (r < 0 || c < 0)
break;
temp = add(temp, ncr(r + c + 1, r + 1));
r--;
c--;
}
cout << temp << endl;
r = r1;
c = c1;
while (1) {
if (r < 0 || c < 0)
break;
temp = sub(temp, ncr(r + c, r));
r--;
c--;
}
// if(r!=c)temp++;
return temp % p;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
cin.exceptions(cin.failbit);
int T = 1;
// cin>>T;
while (T--) {
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
fac[0] = 1;
for (ll i = 1; i < N; i++) {
fac[i] = fac[i - 1] * i;
fac[i] %= p;
}
for (ll i = 0; i < N; i++) {
invfac[i] = power(fac[i], p - 2);
}
ll ans = 0;
for (ll i = r1; i <= r2; i++) {
ans = add(ans, ncr(i + c2 + 1, i + 1));
}
c1--;
for (ll i = r1; i <= r2; i++) {
ans = sub(ans, ncr(i + c1 + 1, i + 1));
}
cout << ans << endl;
}
return 0;
} | replace | 25 | 26 | 25 | 26 | 0 | |
p02782 | C++ | Runtime Error | // ABEY SAALE
// QUESTION KHUD KR SOLUTION KYU DEKH RHA H
// MAAF KIJIYEGA ME GUSSE ME IDHAR UDHAR NIKAL JATA HU
#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];
void pre() {
fac[0] = 1;
fac[1] = 1;
for (int i = 2; i < 2000005; i++)
fac[i] = (i * fac[i - 1]) % mod;
}
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;
}
// DEKHIYE JI WALID JO THE ABBA HAMARE WO YEH function CHHOD KR GYE THE
signed main() {
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
senky_bansal IIIT_ALLAHABAD
pre();
ll t;
// cin>>t;
t = 1;
while (t--) {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = 0;
for (int i = c1; i <= c2; i++) {
ll p1 = (ncr(r2 + i + 1, i + 1) - ncr(r1 + i, i + 1) + mod) % mod;
p1 += mod;
p1 %= mod;
ans += p1;
ans %= mod;
}
cout << ans % mod;
}
}
| // ABEY SAALE
// QUESTION KHUD KR SOLUTION KYU DEKH RHA H
// MAAF KIJIYEGA ME GUSSE ME IDHAR UDHAR NIKAL JATA HU
#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];
void pre() {
fac[0] = 1;
fac[1] = 1;
for (int i = 2; i < 2000005; i++)
fac[i] = (i * fac[i - 1]) % mod;
}
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;
}
// DEKHIYE JI WALID JO THE ABBA HAMARE WO YEH function CHHOD KR GYE THE
signed main() {
senky_bansal IIIT_ALLAHABAD
pre();
ll t;
// cin>>t;
t = 1;
while (t--) {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = 0;
for (int i = c1; i <= c2; i++) {
ll p1 = (ncr(r2 + i + 1, i + 1) - ncr(r1 + i, i + 1) + mod) % mod;
p1 += mod;
p1 %= mod;
ans += p1;
ans %= mod;
}
cout << ans % mod;
}
}
| delete | 46 | 51 | 46 | 46 | -11 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
const int mod = 1e9 + 7;
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<mod>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
// r1++;c1++;r2++;c2++;
vector<modint> fact(r2 + c2 + 4);
vector<modint> inv(r2 + c2 + 4);
fact[0] = 1;
rep1(i, r2 + c2 + 4) fact[i] = fact[i - 1] * ((modint)i);
rep(i, r2 + c2 + 5) {
inv[i] = 1;
inv[i] /= fact[i];
}
modint ans = 0;
ans = (fact[r2 + c2 + 2] * inv[r2 + 1] * inv[c2 + 1] +
fact[r1 + c1] * inv[r1] * inv[c1] -
fact[r2 + c1 + 1] * inv[r2 + 1] * inv[c1] -
fact[r1 + c2 + 1] * inv[r1] * inv[c2 + 1]);
cout << ans << endl;
// cout << endl << endl;
// cout << static_cast<double>(clock()) / CLOCKS_PER_SEC << "s"<<endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mp make_pair
#define pb push_back
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
const int mod = 1e9 + 7;
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<mod>;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
// r1++;c1++;r2++;c2++;
vector<modint> fact(r2 + c2 + 4);
vector<modint> inv(r2 + c2 + 4);
fact[0] = 1;
rep1(i, r2 + c2 + 3) fact[i] = fact[i - 1] * ((modint)i);
rep(i, r2 + c2 + 4) {
inv[i] = 1;
inv[i] /= fact[i];
}
modint ans = 0;
ans = (fact[r2 + c2 + 2] * inv[r2 + 1] * inv[c2 + 1] +
fact[r1 + c1] * inv[r1] * inv[c1] -
fact[r2 + c1 + 1] * inv[r2 + 1] * inv[c1] -
fact[r1 + c2 + 1] * inv[r1] * inv[c2 + 1]);
cout << ans << endl;
// cout << endl << endl;
// cout << static_cast<double>(clock()) / CLOCKS_PER_SEC << "s"<<endl;
return 0;
}
| replace | 96 | 98 | 96 | 98 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
using namespace std;
const int mod = 1'000'000'007;
const int size_max = 1'000'005;
long long fac[size_max], finv[size_max];
long long mpow(int a, int b);
void com_init();
long long com(int n, int k);
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r1--;
c1--;
com_init();
long long ans = com(r2 + c2 + 2, r2 + 1) - 1;
ans -= com(r1 + c2 + 2, r1 + 1) - 1;
ans -= com(r2 + c1 + 2, r2 + 1) - 1;
ans += com(r1 + c1 + 2, r1 + 1) - 1;
ans += mod;
ans %= mod;
cout << ans << endl;
return 0;
}
long long mpow(int a, int b) {
long long t = a;
long long ans = 1;
for (int i = 0; i < 31; i++) {
if ((b & 1) == 1) {
ans *= t;
ans %= mod;
}
t *= t;
t %= mod;
b >>= 1;
}
return ans;
}
void com_init() {
fac[0] = fac[1] = 1;
for (int i = 2; i < size_max; i++) {
fac[i] = fac[i - 1] * i;
fac[i] %= mod;
}
finv[size_max - 1] = mpow(fac[size_max - 1], mod - 2);
for (int i = size_max - 2; i >= 2; i--) {
finv[i] = finv[i + 1] * (i + 1) % mod;
}
finv[0] = finv[1] = 1;
}
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;
} | #include <algorithm>
#include <iostream>
using namespace std;
const int mod = 1'000'000'007;
const int size_max = 2'000'005;
long long fac[size_max], finv[size_max];
long long mpow(int a, int b);
void com_init();
long long com(int n, int k);
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r1--;
c1--;
com_init();
long long ans = com(r2 + c2 + 2, r2 + 1) - 1;
ans -= com(r1 + c2 + 2, r1 + 1) - 1;
ans -= com(r2 + c1 + 2, r2 + 1) - 1;
ans += com(r1 + c1 + 2, r1 + 1) - 1;
ans += mod;
ans %= mod;
cout << ans << endl;
return 0;
}
long long mpow(int a, int b) {
long long t = a;
long long ans = 1;
for (int i = 0; i < 31; i++) {
if ((b & 1) == 1) {
ans *= t;
ans %= mod;
}
t *= t;
t %= mod;
b >>= 1;
}
return ans;
}
void com_init() {
fac[0] = fac[1] = 1;
for (int i = 2; i < size_max; i++) {
fac[i] = fac[i - 1] * i;
fac[i] %= mod;
}
finv[size_max - 1] = mpow(fac[size_max - 1], mod - 2);
for (int i = size_max - 2; i >= 2; i--) {
finv[i] = finv[i + 1] * (i + 1) % mod;
}
finv[0] = finv[1] = 1;
}
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;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02782 | C++ | Runtime Error | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T>
using Tree =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 1000001; // check the limits, dummy
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 inv(ll base) {
int g = MOD, r = base, x = 0, y = 1;
while (r != 0) {
int q = g / r;
g %= r;
swap(g, r);
x -= q * y;
swap(x, y);
}
return x < 0 ? x + MOD : x;
}
ll mul(ll A, ll B) { return (A * B) % MOD; }
ll add(ll A, ll B) { return (A + B) % MOD; }
ll dvd(ll A, ll B) { return mul(A, inv(B)); }
ll sub(ll A, ll B) { return (A - B + MOD) % MOD; }
ll *facs = new ll[MX];
ll *facInvs = new ll[MX];
ll choose(ll a, ll b) {
if (b > a)
return 0;
if (a < 0)
return 0;
if (b < 0)
return 0;
ll cur = facs[a];
cur = mul(cur, facInvs[b]);
cur = mul(cur, facInvs[a - b]);
return cur;
}
void initFacs() {
facs[0] = 1;
facInvs[0] = 1;
FOR(i, 1, MX) {
facs[i] = (facs[i - 1] * i) % MOD;
facInvs[i] = inv(facs[i]);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
initFacs();
ll R1, R2, C1, C2;
cin >> R1 >> C1 >> R2 >> C2;
ll ans = 0;
R1--;
FOR(i, C1, C2 + 1) {
ans += choose(i + R2 + 1, R2);
ans += MOD - choose(i + R1 + 1, R1);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
// read the question correctly (ll vs int)
// template by bqi343
| #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
typedef complex<ld> cd;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<ld> vd;
typedef vector<ll> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<cd> vcd;
template <class T>
using Tree =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define FOR(i, a, b) for (int i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const ll INF = 1e18;
const int MX = 3000001; // check the limits, dummy
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 inv(ll base) {
int g = MOD, r = base, x = 0, y = 1;
while (r != 0) {
int q = g / r;
g %= r;
swap(g, r);
x -= q * y;
swap(x, y);
}
return x < 0 ? x + MOD : x;
}
ll mul(ll A, ll B) { return (A * B) % MOD; }
ll add(ll A, ll B) { return (A + B) % MOD; }
ll dvd(ll A, ll B) { return mul(A, inv(B)); }
ll sub(ll A, ll B) { return (A - B + MOD) % MOD; }
ll *facs = new ll[MX];
ll *facInvs = new ll[MX];
ll choose(ll a, ll b) {
if (b > a)
return 0;
if (a < 0)
return 0;
if (b < 0)
return 0;
ll cur = facs[a];
cur = mul(cur, facInvs[b]);
cur = mul(cur, facInvs[a - b]);
return cur;
}
void initFacs() {
facs[0] = 1;
facInvs[0] = 1;
FOR(i, 1, MX) {
facs[i] = (facs[i - 1] * i) % MOD;
facInvs[i] = inv(facs[i]);
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
initFacs();
ll R1, R2, C1, C2;
cin >> R1 >> C1 >> R2 >> C2;
ll ans = 0;
R1--;
FOR(i, C1, C2 + 1) {
ans += choose(i + R2 + 1, R2);
ans += MOD - choose(i + R1 + 1, R1);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
// read the question correctly (ll vs int)
// template by bqi343
| replace | 47 | 48 | 47 | 48 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
#include <cassert>
#define MAX 2000000 // 階乗をいくつまで計算するか
class modlong {
long val;
static long *invs, *facts, *finvs;
// 階乗, 逆元, 階乗の逆元をMAXまで求める
bool initModlong() {
invs[1] = facts[0] = facts[1] = finvs[0] = finvs[1] = 1;
for (int i = 2; i <= MAX; i++) {
invs[i] = -invs[MOD % i] * (MOD / i) % MOD;
facts[i] = facts[i - 1] * i % MOD;
finvs[i] = finvs[i - 1] * invs[i] % MOD;
}
return true;
}
public:
static long MOD; // modの元
// 初期化 値を引数に与えなかった場合はval=0としておく
modlong(long init = 0) : val(init) {
static bool call_once =
initModlong(); // static変数の性質により一度だけ呼ばれる
assert(call_once); // unusedの回避
if (val < 0 || val >= MOD)
val %= MOD;
if (val < 0)
val += MOD; // 0以上であることを保証
}
// longへのキャスト operator long()で定義すると modlong +
// longとかができなくなる
inline long tol() { return this->val; }
// 代入
void operator=(const modlong &r) { this->val = r.val; }
void operator=(const long &r) { *this = modlong(r); }
// 足し算; 符号反転; 引き算
modlong operator+(const modlong &r) {
long ans = this->val + r.val;
if (ans >= MOD)
ans -= MOD;
return modlong(ans);
}
modlong operator-() {
long ans = MOD - this->val;
return modlong(ans);
}
modlong operator-(const modlong &r) {
modlong rr = r;
return *this + (-rr);
}
// かけ算; 逆元; わり算
modlong operator*(const modlong &r) {
long ans = this->val * r.val;
return modlong(ans);
}
modlong inv() {
assert(*this != 0);
if (*this == 1)
return modlong(1);
modlong p, q = *this, m(0), n(1), r, c;
p.val = MOD; // p=modとかくとp.val=mod%mod=0となってしまう
while (q > MAX) {
r = p.val % q.val; // r.val=p.val % q.val
// とかくよりもこのほうが代入時に%modされるので安全
c = m.val - n.val * (p.val / q.val);
p = q, q = r, m = n, n = c;
}
return n * invs[q.val];
}
modlong operator/(const modlong &r) { return *this * modlong(r).inv(); }
modlong operator%(const modlong &r) { return modlong(this->val % r.val); }
// ++ -- 前付きと後ろ付き
void operator++() { ++this->val; }
void operator++(int a) {
a = 0;
this->val++;
} // a使ってなくねっていうwarningをsilenceするためにaをいじってる
void operator--() { --this->val; }
void operator--(int a) {
a = 0;
this->val--;
}
// 四則演算&代入
void operator+=(const modlong &r) { *this = *this + r; }
void operator-=(const modlong &r) { *this = *this - r; }
void operator*=(const modlong &r) { *this = *this * r; }
void operator/=(const modlong &r) { *this = *this / r; }
void operator%=(const modlong &r) { *this = *this % r; }
// べき乗
modlong pow(long n) {
if (n < 0)
return inv().pow(-n); // 逆元の-n乗
else if (n == 0)
return modlong(1);
modlong half = pow(n / 2);
if (n % 2)
return *this * half * half;
else
return half * half;
}
modlong pow(modlong n) { return pow(n.val); }
// コンビネーション
modlong comb(modlong _k) {
assert(this->val <= MAX);
const long n = this->val, k = _k.val;
if (k < 0 || k > n)
return 0;
if (k == 0 || k == n)
return 1;
return modlong(facts[n]) * finvs[k] * finvs[n - k];
}
// 階乗
modlong fact() {
assert(this->val <= MAX);
return modlong(facts[this->val]);
}
friend bool operator<(const modlong &l, const modlong &r);
friend bool operator>(const modlong &l, const modlong &r);
friend bool operator==(const modlong &l, const modlong &r);
friend bool operator!=(const modlong &l, const modlong &r);
friend bool operator<=(const modlong &l, const modlong &r);
friend bool operator>=(const modlong &l, const modlong &r);
friend ostream &operator<<(ostream &os, const modlong &out);
friend istream &operator>>(istream &is, modlong &out);
};
// 比較
bool operator<(const modlong &l, const modlong &r) { return l.val < r.val; }
bool operator>(const modlong &l, const modlong &r) { return l.val > r.val; }
bool operator==(const modlong &l, const modlong &r) { return l.val == r.val; }
bool operator!=(const modlong &l, const modlong &r) { return !(l == r); }
bool operator<=(const modlong &l, const modlong &r) { return !(l > r); }
bool operator>=(const modlong &l, const modlong &r) { return !(l < r); }
// cout、cerr、cin用の演算子たち
ostream &operator<<(ostream &os, const modlong &out) {
os << out.val;
return os;
}
istream &operator>>(istream &is, modlong &in) {
long inl;
is >> inl;
in.val = inl % modlong::MOD;
return is;
}
// コンビネーション
inline modlong modComb(long n, long k) { return modlong(n).comb(k); }
// 階乗
inline modlong modFact(long n) { return modlong(n).fact(); }
// static変数たち
long *modlong::invs = new long[MAX + 1], *modlong::facts = new long[MAX + 1],
*modlong::finvs = new long[MAX + 1];
long modlong::MOD = (long)1e9 + 7;
modlong rect(int r, int c) { return modComb(r + c + 2, r + 1) - 1; }
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
cout << rect(r2, c2) - rect(r1 - 1, c2) - rect(r2, c1 - 1) +
rect(r1 - 1, c1 - 1)
<< '\n';
return 0;
} | #include <algorithm>
#include <iostream>
#include <queue>
#include <string>
#include <vector>
using ll = long long;
using namespace std;
#include <cassert>
#define MAX 2000010 // 階乗をいくつまで計算するか
class modlong {
long val;
static long *invs, *facts, *finvs;
// 階乗, 逆元, 階乗の逆元をMAXまで求める
bool initModlong() {
invs[1] = facts[0] = facts[1] = finvs[0] = finvs[1] = 1;
for (int i = 2; i <= MAX; i++) {
invs[i] = -invs[MOD % i] * (MOD / i) % MOD;
facts[i] = facts[i - 1] * i % MOD;
finvs[i] = finvs[i - 1] * invs[i] % MOD;
}
return true;
}
public:
static long MOD; // modの元
// 初期化 値を引数に与えなかった場合はval=0としておく
modlong(long init = 0) : val(init) {
static bool call_once =
initModlong(); // static変数の性質により一度だけ呼ばれる
assert(call_once); // unusedの回避
if (val < 0 || val >= MOD)
val %= MOD;
if (val < 0)
val += MOD; // 0以上であることを保証
}
// longへのキャスト operator long()で定義すると modlong +
// longとかができなくなる
inline long tol() { return this->val; }
// 代入
void operator=(const modlong &r) { this->val = r.val; }
void operator=(const long &r) { *this = modlong(r); }
// 足し算; 符号反転; 引き算
modlong operator+(const modlong &r) {
long ans = this->val + r.val;
if (ans >= MOD)
ans -= MOD;
return modlong(ans);
}
modlong operator-() {
long ans = MOD - this->val;
return modlong(ans);
}
modlong operator-(const modlong &r) {
modlong rr = r;
return *this + (-rr);
}
// かけ算; 逆元; わり算
modlong operator*(const modlong &r) {
long ans = this->val * r.val;
return modlong(ans);
}
modlong inv() {
assert(*this != 0);
if (*this == 1)
return modlong(1);
modlong p, q = *this, m(0), n(1), r, c;
p.val = MOD; // p=modとかくとp.val=mod%mod=0となってしまう
while (q > MAX) {
r = p.val % q.val; // r.val=p.val % q.val
// とかくよりもこのほうが代入時に%modされるので安全
c = m.val - n.val * (p.val / q.val);
p = q, q = r, m = n, n = c;
}
return n * invs[q.val];
}
modlong operator/(const modlong &r) { return *this * modlong(r).inv(); }
modlong operator%(const modlong &r) { return modlong(this->val % r.val); }
// ++ -- 前付きと後ろ付き
void operator++() { ++this->val; }
void operator++(int a) {
a = 0;
this->val++;
} // a使ってなくねっていうwarningをsilenceするためにaをいじってる
void operator--() { --this->val; }
void operator--(int a) {
a = 0;
this->val--;
}
// 四則演算&代入
void operator+=(const modlong &r) { *this = *this + r; }
void operator-=(const modlong &r) { *this = *this - r; }
void operator*=(const modlong &r) { *this = *this * r; }
void operator/=(const modlong &r) { *this = *this / r; }
void operator%=(const modlong &r) { *this = *this % r; }
// べき乗
modlong pow(long n) {
if (n < 0)
return inv().pow(-n); // 逆元の-n乗
else if (n == 0)
return modlong(1);
modlong half = pow(n / 2);
if (n % 2)
return *this * half * half;
else
return half * half;
}
modlong pow(modlong n) { return pow(n.val); }
// コンビネーション
modlong comb(modlong _k) {
assert(this->val <= MAX);
const long n = this->val, k = _k.val;
if (k < 0 || k > n)
return 0;
if (k == 0 || k == n)
return 1;
return modlong(facts[n]) * finvs[k] * finvs[n - k];
}
// 階乗
modlong fact() {
assert(this->val <= MAX);
return modlong(facts[this->val]);
}
friend bool operator<(const modlong &l, const modlong &r);
friend bool operator>(const modlong &l, const modlong &r);
friend bool operator==(const modlong &l, const modlong &r);
friend bool operator!=(const modlong &l, const modlong &r);
friend bool operator<=(const modlong &l, const modlong &r);
friend bool operator>=(const modlong &l, const modlong &r);
friend ostream &operator<<(ostream &os, const modlong &out);
friend istream &operator>>(istream &is, modlong &out);
};
// 比較
bool operator<(const modlong &l, const modlong &r) { return l.val < r.val; }
bool operator>(const modlong &l, const modlong &r) { return l.val > r.val; }
bool operator==(const modlong &l, const modlong &r) { return l.val == r.val; }
bool operator!=(const modlong &l, const modlong &r) { return !(l == r); }
bool operator<=(const modlong &l, const modlong &r) { return !(l > r); }
bool operator>=(const modlong &l, const modlong &r) { return !(l < r); }
// cout、cerr、cin用の演算子たち
ostream &operator<<(ostream &os, const modlong &out) {
os << out.val;
return os;
}
istream &operator>>(istream &is, modlong &in) {
long inl;
is >> inl;
in.val = inl % modlong::MOD;
return is;
}
// コンビネーション
inline modlong modComb(long n, long k) { return modlong(n).comb(k); }
// 階乗
inline modlong modFact(long n) { return modlong(n).fact(); }
// static変数たち
long *modlong::invs = new long[MAX + 1], *modlong::facts = new long[MAX + 1],
*modlong::finvs = new long[MAX + 1];
long modlong::MOD = (long)1e9 + 7;
modlong rect(int r, int c) { return modComb(r + c + 2, r + 1) - 1; }
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
cout << rect(r2, c2) - rect(r1 - 1, c2) - rect(r2, c1 - 1) +
rect(r1 - 1, c1 - 1)
<< '\n';
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02782 | C++ | Runtime Error | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define int long long
#define double long double
#define mp make_pair
#define all(a) a.begin(), a.end()
#define pb push_back
#define debug(x) cerr << #x << ": " << x << '\n';
#define ppoint(p) cout << #p << ' ' << p.x << ' ' << p.y << '\n';
#define fi first
#define se second
#define FOR(i, n) for (int i = 0; i < n; ++i)
// typedef long long ll;
typedef pair<int, int> pii;
template <typename T1, typename T2> inline bool chkmin(T1 &x, T2 y) {
return y < x ? (x = y, true) : false;
};
template <typename T1, typename T2> inline bool chkmax(T1 &x, T2 y) {
return y > x ? (x = y, true) : false;
};
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
int f[N], rf[N];
int mult(int a, int b) { return a * b % mod; }
int c(int n, int k) { return mult(mult(f[n], rf[k]), rf[n - k]); }
int binpow(int a, int b) {
if (b == 0)
return 1;
if (b & 1)
return mult(binpow(a, b - 1), a);
return binpow(mult(a, a), b / 2);
}
int get(int a, int b) {
int res = 0;
for (int i = 1; i <= a + 1; i++) {
res += c(i + b, i);
}
return res;
}
int md(int x) {
x %= mod;
x += mod;
x %= mod;
return x;
}
signed main() {
fast();
f[0] = 1;
for (int i = 1; i < N; i++)
f[i] = mult(i, f[i - 1]);
rf[N - 1] = binpow(f[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--)
rf[i] = mult(i + 1, rf[i + 1]);
for (int i = N - 10; i <= N - 1; i++) {
// debug(mult(f[i], rf[i]))
}
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
cout << md(get(r2, c2) - get(r1 - 1, c2) - get(r2, c1 - 1) +
get(r1 - 1, c1 - 1))
<< '\n';
return 0;
} | #define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define int long long
#define double long double
#define mp make_pair
#define all(a) a.begin(), a.end()
#define pb push_back
#define debug(x) cerr << #x << ": " << x << '\n';
#define ppoint(p) cout << #p << ' ' << p.x << ' ' << p.y << '\n';
#define fi first
#define se second
#define FOR(i, n) for (int i = 0; i < n; ++i)
// typedef long long ll;
typedef pair<int, int> pii;
template <typename T1, typename T2> inline bool chkmin(T1 &x, T2 y) {
return y < x ? (x = y, true) : false;
};
template <typename T1, typename T2> inline bool chkmax(T1 &x, T2 y) {
return y > x ? (x = y, true) : false;
};
void fast() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
const int mod = 1e9 + 7;
const int N = 2e6 + 10;
int f[N], rf[N];
int mult(int a, int b) { return a * b % mod; }
int c(int n, int k) { return mult(mult(f[n], rf[k]), rf[n - k]); }
int binpow(int a, int b) {
if (b == 0)
return 1;
if (b & 1)
return mult(binpow(a, b - 1), a);
return binpow(mult(a, a), b / 2);
}
int get(int a, int b) {
int res = 0;
for (int i = 1; i <= a + 1; i++) {
res += c(i + b, i);
}
return res;
}
int md(int x) {
x %= mod;
x += mod;
x %= mod;
return x;
}
signed main() {
fast();
f[0] = 1;
for (int i = 1; i < N; i++)
f[i] = mult(i, f[i - 1]);
rf[N - 1] = binpow(f[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--)
rf[i] = mult(i + 1, rf[i + 1]);
for (int i = N - 10; i <= N - 1; i++) {
// debug(mult(f[i], rf[i]))
}
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
cout << md(get(r2, c2) - get(r1 - 1, c2) - get(r2, c1 - 1) +
get(r1 - 1, c1 - 1))
<< '\n';
return 0;
} | replace | 48 | 49 | 48 | 49 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7, N = 1e6 + 5;
template <int MOD = 1000000007> struct Modular {
int value;
static const int MOD_value = MOD;
Modular(long long v = 0) {
value = v % MOD;
if (value < 0)
value += MOD;
}
Modular(long long a, long long b) : value(0) {
*this += a;
*this /= b;
}
Modular &operator+=(Modular const &b) {
value += b.value;
if (value >= MOD)
value -= MOD;
return *this;
}
Modular &operator-=(Modular const &b) {
value -= b.value;
if (value < 0)
value += MOD;
return *this;
}
Modular &operator*=(Modular const &b) {
value = (long long)value * b.value % MOD;
return *this;
}
friend Modular mexp(Modular a, long long e) {
Modular res = 1;
while (e) {
if (e & 1)
res *= a;
a *= a;
e >>= 1;
}
return res;
}
friend Modular inverse(Modular a) { return mexp(a, MOD - 2); }
Modular &operator/=(Modular const &b) { return *this *= inverse(b); }
friend Modular operator+(Modular a, Modular const b) { return a += b; }
friend Modular operator-(Modular a, Modular const b) { return a -= b; }
friend Modular operator-(Modular const a) { return 0 - a; }
friend Modular operator*(Modular a, Modular const b) { return a *= b; }
friend Modular operator/(Modular a, Modular const b) { return a /= b; }
friend std::ostream &operator<<(std::ostream &os, Modular const &a) {
return os << a.value;
}
friend bool operator==(Modular const &a, Modular const &b) {
return a.value == b.value;
}
friend bool operator!=(Modular const &a, Modular const &b) {
return a.value != b.value;
}
};
Modular<M> ans = 0, fact[N];
int main() {
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
fact[0] = 1;
for (int i = 1; i < N; ++i) {
fact[i] = fact[i - 1] * i;
}
for (int i = c1; i <= c2; ++i) {
Modular<M> l = fact[i + r1] / (fact[i + 1] * fact[r1 - 1]);
Modular<M> r = fact[r2 + i + 1] / (fact[i + 1] * fact[r2]);
ans += r - l;
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
const int M = 1e9 + 7, N = 3e6 + 5;
template <int MOD = 1000000007> struct Modular {
int value;
static const int MOD_value = MOD;
Modular(long long v = 0) {
value = v % MOD;
if (value < 0)
value += MOD;
}
Modular(long long a, long long b) : value(0) {
*this += a;
*this /= b;
}
Modular &operator+=(Modular const &b) {
value += b.value;
if (value >= MOD)
value -= MOD;
return *this;
}
Modular &operator-=(Modular const &b) {
value -= b.value;
if (value < 0)
value += MOD;
return *this;
}
Modular &operator*=(Modular const &b) {
value = (long long)value * b.value % MOD;
return *this;
}
friend Modular mexp(Modular a, long long e) {
Modular res = 1;
while (e) {
if (e & 1)
res *= a;
a *= a;
e >>= 1;
}
return res;
}
friend Modular inverse(Modular a) { return mexp(a, MOD - 2); }
Modular &operator/=(Modular const &b) { return *this *= inverse(b); }
friend Modular operator+(Modular a, Modular const b) { return a += b; }
friend Modular operator-(Modular a, Modular const b) { return a -= b; }
friend Modular operator-(Modular const a) { return 0 - a; }
friend Modular operator*(Modular a, Modular const b) { return a *= b; }
friend Modular operator/(Modular a, Modular const b) { return a /= b; }
friend std::ostream &operator<<(std::ostream &os, Modular const &a) {
return os << a.value;
}
friend bool operator==(Modular const &a, Modular const &b) {
return a.value == b.value;
}
friend bool operator!=(Modular const &a, Modular const &b) {
return a.value != b.value;
}
};
Modular<M> ans = 0, fact[N];
int main() {
ios::sync_with_stdio(false);
cout.tie(nullptr);
cin.tie(nullptr);
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
fact[0] = 1;
for (int i = 1; i < N; ++i) {
fact[i] = fact[i - 1] * i;
}
for (int i = c1; i <= c2; ++i) {
Modular<M> l = fact[i + r1] / (fact[i + 1] * fact[r1 - 1]);
Modular<M> r = fact[r2 + i + 1] / (fact[i + 1] * fact[r2]);
ans += r - l;
}
cout << ans << '\n';
}
| replace | 2 | 3 | 2 | 3 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.