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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02632 | C++ | Runtime Error | #pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define PI acos(-1.0)
#define No cout << "No\n";
#define Yes cout << "Yes\n";
#define no cout << "no\n";
#define yes cout << "yes\n";
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define MOD (int)1000000007
#define int long long
#define ll long long
#define pii pair<int, int>
#define fi first
#define se second
#define sf(a) scanf("%lld", &a)
#define pf(a) printf("%lld ", a)
#define case(a) cout << "Case #" << a << ":\n";
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define pb emplace_back
#define mp make_pair
#define mem(arr) memset(arr, 0, sizeof(arr))
#define mem1(arr) memset(arr, -1, sizeof(arr))
#define all(a) a.begin(), a.end()
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, a, b) for (int i = a; i <= b; i++)
#define loopr(i, a, b) for (int i = a; i >= b; i--)
#define rr return 0
#define prec(n) fixed << setprecision(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define inf (int)(1e18)
#define vi vector<int>
#define endl "\n"
#define vii vector<pii>
#define sz(s) s.size()
#define bits(n) __builtin_popcount(n)
#define lcm(a, b) (a * (b / gcd(a, b)))
#define MX 500005
int gcd(int a, int b) { return __gcd(a, b); }
inline void normal(ll &a) {
a %= MOD;
(a < 0) && (a += MOD);
}
inline ll modMul(ll a, ll b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
return (a * b) % MOD;
}
inline ll modAdd(ll a, ll b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
return (a + b) % MOD;
}
inline ll modSub(ll a, ll b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
a -= b;
normal(a);
return a;
}
inline ll modPow(ll b, ll p) {
ll r = 1;
while (p) {
if (p & 1LL)
r = modMul(r, b);
b = modMul(b, b);
p >>= 1LL;
}
return r;
}
inline ll modInverse(ll a) { return modPow(a, MOD - 2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
const double eps = 1e-9;
int dx[5] = {+1, +0, -1, -0};
int dy[5] = {+0, +1, -0, -1};
int XX[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int YY[] = {-1, 0, 1, -1, 1, -1, 0, 1};
bool Equal(double x, double y) {
return fabs(x - y) < eps; /// x==y
}
bool Greater(double x, double y) {
return x - eps > y; /// x>y
}
bool Lesser(double x, double y) {
return x + eps < y; /// x<y
}
struct point {
double x, y, ang;
};
/// Write what you need -->
/// nt, ft, kmp, tri, sufarr, ub_lb, lis
/// Template Ends Here////////////////////////////
const int N = 1000006;
int fact[N], inv[N];
int ncr(int n, int r) {
if (r > n)
return 0;
return (fact[n] % MOD * inv[r] % MOD * inv[n - r] % MOD) % MOD;
}
signed main() {
// root = new trinode();
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// FASTIO
int k;
cin >> k;
string s;
cin >> s;
int n = sz(s);
fact[0] = 1;
for1(i, n + k) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
}
for0(i, n + k + 1) {
inv[i] = modInverse(fact[i]);
inv[i] %= MOD;
}
int ans = 0;
for (int i = k; i >= 0; i--) {
int temp = modMul(modPow(26, i), modPow(25, k - i));
temp = modMul(temp, ncr(n + k - i - 1, n - 1));
ans = modAdd(ans, temp);
}
cout << ans;
// tridel(root);
}
| #pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")
#include <algorithm>
#include <bits/stdc++.h>
#include <unordered_map>
#include <unordered_set>
using namespace std;
#define PI acos(-1.0)
#define No cout << "No\n";
#define Yes cout << "Yes\n";
#define no cout << "no\n";
#define yes cout << "yes\n";
#define NO cout << "NO\n";
#define YES cout << "YES\n";
#define MOD (int)1000000007
#define int long long
#define ll long long
#define pii pair<int, int>
#define fi first
#define se second
#define sf(a) scanf("%lld", &a)
#define pf(a) printf("%lld ", a)
#define case(a) cout << "Case #" << a << ":\n";
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
#define pb emplace_back
#define mp make_pair
#define mem(arr) memset(arr, 0, sizeof(arr))
#define mem1(arr) memset(arr, -1, sizeof(arr))
#define all(a) a.begin(), a.end()
#define for0(i, n) for (int i = 0; i < n; i++)
#define for1(i, n) for (int i = 1; i <= n; i++)
#define loop(i, a, b) for (int i = a; i <= b; i++)
#define loopr(i, a, b) for (int i = a; i >= b; i--)
#define rr return 0
#define prec(n) fixed << setprecision(n)
#define maxpq priority_queue<int>
#define minpq priority_queue<int, vector<int>, greater<int>>
#define inf (int)(1e18)
#define vi vector<int>
#define endl "\n"
#define vii vector<pii>
#define sz(s) s.size()
#define bits(n) __builtin_popcount(n)
#define lcm(a, b) (a * (b / gcd(a, b)))
#define MX 500005
int gcd(int a, int b) { return __gcd(a, b); }
inline void normal(ll &a) {
a %= MOD;
(a < 0) && (a += MOD);
}
inline ll modMul(ll a, ll b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
return (a * b) % MOD;
}
inline ll modAdd(ll a, ll b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
return (a + b) % MOD;
}
inline ll modSub(ll a, ll b) {
a %= MOD, b %= MOD;
normal(a), normal(b);
a -= b;
normal(a);
return a;
}
inline ll modPow(ll b, ll p) {
ll r = 1;
while (p) {
if (p & 1LL)
r = modMul(r, b);
b = modMul(b, b);
p >>= 1LL;
}
return r;
}
inline ll modInverse(ll a) { return modPow(a, MOD - 2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
const double eps = 1e-9;
int dx[5] = {+1, +0, -1, -0};
int dy[5] = {+0, +1, -0, -1};
int XX[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int YY[] = {-1, 0, 1, -1, 1, -1, 0, 1};
bool Equal(double x, double y) {
return fabs(x - y) < eps; /// x==y
}
bool Greater(double x, double y) {
return x - eps > y; /// x>y
}
bool Lesser(double x, double y) {
return x + eps < y; /// x<y
}
struct point {
double x, y, ang;
};
/// Write what you need -->
/// nt, ft, kmp, tri, sufarr, ub_lb, lis
/// Template Ends Here////////////////////////////
const int N = 2000006;
int fact[N], inv[N];
int ncr(int n, int r) {
if (r > n)
return 0;
return (fact[n] % MOD * inv[r] % MOD * inv[n - r] % MOD) % MOD;
}
signed main() {
// root = new trinode();
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// FASTIO
int k;
cin >> k;
string s;
cin >> s;
int n = sz(s);
fact[0] = 1;
for1(i, n + k) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
}
for0(i, n + k + 1) {
inv[i] = modInverse(fact[i]);
inv[i] %= MOD;
}
int ans = 0;
for (int i = k; i >= 0; i--) {
int temp = modMul(modPow(26, i), modPow(25, k - i));
temp = modMul(temp, ncr(n + k - i - 1, n - 1));
ans = modAdd(ans, temp);
}
cout << ans;
// tridel(root);
}
| replace | 110 | 111 | 110 | 111 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <string>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = {1, 0, -1, 0}, dj[4] = {0, 1, 0, -1};
#define N 200007
ll fac[N], inv[N], finv[N];
void cominit(int n) {
int i;
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (i = 2; i < n + 2; 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;
}
return;
}
ll com(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
if (r == 0 || r == n)
return 1;
return (fac[n] * finv[r]) % mod * finv[n - r] % mod;
}
ll ml_pow(ll n, ll k, int p) {
ll y, res;
res = 1;
y = n;
while (k > 0) {
if (k % 2 == 1) {
res = res * y % p;
}
y = y * y % p;
k /= 2;
}
return res;
}
int main(void) {
int n, k, i, ans;
string s;
scanf("%d", &k);
cin >> s;
n = s.size();
cominit(n + k);
ans = 0;
for (i = n; i <= n + k; i++) {
ans = (ans + com(i - 1, n - 1) * ml_pow(25, i - n, mod) % mod *
ml_pow(26, n + k - i, mod) % mod) %
mod;
}
printf("%d\n", ans);
return 0;
} | #include <algorithm>
#include <iostream>
#include <string>
#define flush fflush(stdout)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<ll, ll> Pl;
const int mod = (int)1e9 + 7, INF = (int)1e9;
const int di[4] = {1, 0, -1, 0}, dj[4] = {0, 1, 0, -1};
#define N 2000007
ll fac[N], inv[N], finv[N];
void cominit(int n) {
int i;
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (i = 2; i < n + 2; 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;
}
return;
}
ll com(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
if (r == 0 || r == n)
return 1;
return (fac[n] * finv[r]) % mod * finv[n - r] % mod;
}
ll ml_pow(ll n, ll k, int p) {
ll y, res;
res = 1;
y = n;
while (k > 0) {
if (k % 2 == 1) {
res = res * y % p;
}
y = y * y % p;
k /= 2;
}
return res;
}
int main(void) {
int n, k, i, ans;
string s;
scanf("%d", &k);
cin >> s;
n = s.size();
cominit(n + k);
ans = 0;
for (i = n; i <= n + k; i++) {
ans = (ans + com(i - 1, n - 1) * ml_pow(25, i - n, mod) % mod *
ml_pow(26, n + k - i, mod) % mod) %
mod;
}
printf("%d\n", ans);
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1 << 20, mod = 1e9 + 7;
int fact[maxn], inv[maxn];
void pre() {
for (int i = 0; i < maxn; i++)
if (i < 2)
fact[i] = inv[i] = 1;
else
fact[i] = i, inv[i] = mod - (mod / i) * 1ll * inv[mod % i] % mod;
for (int i = 1; i < maxn; i++)
fact[i] = fact[i] * 1ll * fact[i - 1] % mod,
inv[i] = inv[i] * 1ll * inv[i - 1] % mod;
}
int bp(int a, int p) {
int r = 1;
while (p) {
if (p & 1)
r = r * 1ll * a % mod;
a = a * 1ll * a % mod, p >>= 1;
}
return r;
}
int nck(int i, int j) {
if (i < j || j < 0)
return 0;
int t = fact[i] * 1ll * inv[j] % mod;
return t * 1ll * inv[i - j] % mod;
}
int get(int i, int j) {
int t = bp(25, i - j);
return t * 1ll * nck(i, j) % mod;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
pre();
int ans = 0, n, k;
string s;
cin >> k >> s;
n = s.size();
for (int i = n; i <= n + k; i++)
ans = (ans + get(n + k, i)) % mod;
cout << ans;
return 0;
}
// cacyaa
// 128 + 2 + 128*
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 1 << 22, mod = 1e9 + 7;
int fact[maxn], inv[maxn];
void pre() {
for (int i = 0; i < maxn; i++)
if (i < 2)
fact[i] = inv[i] = 1;
else
fact[i] = i, inv[i] = mod - (mod / i) * 1ll * inv[mod % i] % mod;
for (int i = 1; i < maxn; i++)
fact[i] = fact[i] * 1ll * fact[i - 1] % mod,
inv[i] = inv[i] * 1ll * inv[i - 1] % mod;
}
int bp(int a, int p) {
int r = 1;
while (p) {
if (p & 1)
r = r * 1ll * a % mod;
a = a * 1ll * a % mod, p >>= 1;
}
return r;
}
int nck(int i, int j) {
if (i < j || j < 0)
return 0;
int t = fact[i] * 1ll * inv[j] % mod;
return t * 1ll * inv[i - j] % mod;
}
int get(int i, int j) {
int t = bp(25, i - j);
return t * 1ll * nck(i, j) % mod;
}
int main() {
cin.tie(0)->sync_with_stdio(0);
pre();
int ans = 0, n, k;
string s;
cin >> k >> s;
n = s.size();
for (int i = n; i <= n + k; i++)
ans = (ans + get(n + k, i)) % mod;
cout << ans;
return 0;
}
// cacyaa
// 128 + 2 + 128*
| replace | 2 | 3 | 2 | 3 | 0 | |
p02632 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#define VI vector<int>
#define G(size_1) vector<vector<int>>(size_1, vector<int>())
#define SZ(x) ((int)(x).size())
#define READ \
({ \
int t; \
cin >> t; \
t; \
})
#define PII pair<int, int>
#define FOR(i, _begin, _end) \
for (__typeof(_end) end = _end, begin = _begin, \
i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i, end) for (__typeof(end) i = 0, _len = (end); i < (_len); i += 1)
#define ALL(x) (x).begin(), (x).end()
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define MOD(x, m) ((((x) % (m)) + (m)) % (m))
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EB emplace_back
#define PB push_back
#define fcout cout << fixed << setprecision(12)
#define fcerr cerr << fixed << setprecision(12)
#define print(x) cout << (x) << endl
#define fprint(x) cout << fixed << setprecision(12) << (x) << endl
#define BYE(a) \
do { \
cout << (a) << endl; \
return; \
} while (false)
#ifdef DEBUG
#define ERR(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
_err(cerr, _it, args); \
}
#define DBG(x) cerr << #x << " is " << x << endl;
#else
#define DBG(x) {};
#define ERR(args...) {};
#endif
void _err(std::ostream &cerr, istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void _err(std::ostream &cerr, istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " ";
_err(cerr, ++it, args...);
}
const double pi = 2 * acos(.0);
const int inf = 0x3f3f3f3f;
const ll mod = (ll)(1e9) + 7;
template <class T> bool Chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool Chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &V) {
for (auto &&ele : V)
is >> ele;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> V) {
os << "[";
int cnt = 0;
T curr;
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
if (V[i] == curr)
cnt++;
else
cnt = 0;
if (cnt == 4)
os << "... ";
if (cnt < 4)
os << i << ":" << V[i] << " ";
curr = V[i];
}
os << V.size() - 1 << ":" << V.back();
}
os << "]\n";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> P) {
os << "(";
os << P.first << "," << P.second;
os << ")";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const set<T, U> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template <typename K, typename H, typename P>
ostream &operator<<(ostream &os, const unordered_set<K, H, P> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template <typename K, typename C>
ostream &operator<<(ostream &os, const multiset<K, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const unordered_map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> V) {
os << "[";
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
os << V[i] << "->";
}
if (!V.empty())
os << V.back();
}
os << "]\n";
return os;
};
template <typename T, typename Cont, typename Comp>
ostream &operator<<(ostream &os, const priority_queue<T, Cont, Comp> V) {
priority_queue<T, Cont, Comp> _V = V;
os << "[";
if (!_V.empty()) {
while (_V.size() > 1) {
os << _V.top() << "->";
_V.pop();
}
os << _V.top();
}
os << "]\n";
return os;
};
template <class F> struct y_combinator {
F f; // the lambda will be stored here
// a forwarding operator():
template <class... Args> decltype(auto) operator()(Args &&...args) const {
// we pass ourselves to f, then the arguments.
// the lambda should take the first argument as `auto&& recurse` or similar.
return f(*this, std::forward<Args>(args)...);
}
};
// helper function that deduces the type of the lambda:
template <class F> y_combinator<std::decay_t<F>> recursive(F &&f) {
return {std::forward<F>(f)};
}
struct hash_pair {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
template <typename T, typename U> std::vector<T> multi_vector(int n, U v) {
return std::vector<T>(n, v);
}
template <typename U, typename... Args> auto multi_vector(int n, Args... args) {
auto val = multi_vector<U>(std::forward<Args>(args)...);
return std::vector<decltype(val)>(n, std::move(val));
}
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) {}
explicit operator int() const { return x; }
explicit operator long long() const { return x; }
explicit operator double() const { return x; }
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 = 1000010;
const int 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(); }
class FStrivore {
public:
void solve(std::istream &cin, std::ostream &cout, std::ostream &cerr) {
int K;
cin >> K;
string s;
cin >> s;
int S = SZ(s);
mint sum = 0;
FOR(n, S, K + S + 1) {
sum += mint(n - 1).choose(S - 1) * mint(25).pow(n - S) *
mint(26).pow(K + S - n);
}
print(sum);
}
};
#undef int
int main() {
FStrivore solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
std::ostringstream err;
in.tie(0);
ios::sync_with_stdio(0);
solver.solve(in, out, err);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")
#define VI vector<int>
#define G(size_1) vector<vector<int>>(size_1, vector<int>())
#define SZ(x) ((int)(x).size())
#define READ \
({ \
int t; \
cin >> t; \
t; \
})
#define PII pair<int, int>
#define FOR(i, _begin, _end) \
for (__typeof(_end) end = _end, begin = _begin, \
i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i, end) for (__typeof(end) i = 0, _len = (end); i < (_len); i += 1)
#define ALL(x) (x).begin(), (x).end()
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define MOD(x, m) ((((x) % (m)) + (m)) % (m))
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EB emplace_back
#define PB push_back
#define fcout cout << fixed << setprecision(12)
#define fcerr cerr << fixed << setprecision(12)
#define print(x) cout << (x) << endl
#define fprint(x) cout << fixed << setprecision(12) << (x) << endl
#define BYE(a) \
do { \
cout << (a) << endl; \
return; \
} while (false)
#ifdef DEBUG
#define ERR(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
_err(cerr, _it, args); \
}
#define DBG(x) cerr << #x << " is " << x << endl;
#else
#define DBG(x) {};
#define ERR(args...) {};
#endif
void _err(std::ostream &cerr, istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void _err(std::ostream &cerr, istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " ";
_err(cerr, ++it, args...);
}
const double pi = 2 * acos(.0);
const int inf = 0x3f3f3f3f;
const ll mod = (ll)(1e9) + 7;
template <class T> bool Chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool Chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> istream &operator>>(istream &is, vector<T> &V) {
for (auto &&ele : V)
is >> ele;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> V) {
os << "[";
int cnt = 0;
T curr;
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
if (V[i] == curr)
cnt++;
else
cnt = 0;
if (cnt == 4)
os << "... ";
if (cnt < 4)
os << i << ":" << V[i] << " ";
curr = V[i];
}
os << V.size() - 1 << ":" << V.back();
}
os << "]\n";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> P) {
os << "(";
os << P.first << "," << P.second;
os << ")";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const set<T, U> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template <typename K, typename H, typename P>
ostream &operator<<(ostream &os, const unordered_set<K, H, P> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}\n";
return os;
}
template <typename K, typename C>
ostream &operator<<(ostream &os, const multiset<K, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const unordered_map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}\n";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> V) {
os << "[";
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
os << V[i] << "->";
}
if (!V.empty())
os << V.back();
}
os << "]\n";
return os;
};
template <typename T, typename Cont, typename Comp>
ostream &operator<<(ostream &os, const priority_queue<T, Cont, Comp> V) {
priority_queue<T, Cont, Comp> _V = V;
os << "[";
if (!_V.empty()) {
while (_V.size() > 1) {
os << _V.top() << "->";
_V.pop();
}
os << _V.top();
}
os << "]\n";
return os;
};
template <class F> struct y_combinator {
F f; // the lambda will be stored here
// a forwarding operator():
template <class... Args> decltype(auto) operator()(Args &&...args) const {
// we pass ourselves to f, then the arguments.
// the lambda should take the first argument as `auto&& recurse` or similar.
return f(*this, std::forward<Args>(args)...);
}
};
// helper function that deduces the type of the lambda:
template <class F> y_combinator<std::decay_t<F>> recursive(F &&f) {
return {std::forward<F>(f)};
}
struct hash_pair {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
template <typename T, typename U> std::vector<T> multi_vector(int n, U v) {
return std::vector<T>(n, v);
}
template <typename U, typename... Args> auto multi_vector(int n, Args... args) {
auto val = multi_vector<U>(std::forward<Args>(args)...);
return std::vector<decltype(val)>(n, std::move(val));
}
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) {}
explicit operator int() const { return x; }
explicit operator long long() const { return x; }
explicit operator double() const { return x; }
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 = 3000010;
const int 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(); }
class FStrivore {
public:
void solve(std::istream &cin, std::ostream &cout, std::ostream &cerr) {
int K;
cin >> K;
string s;
cin >> s;
int S = SZ(s);
mint sum = 0;
FOR(n, S, K + S + 1) {
sum += mint(n - 1).choose(S - 1) * mint(25).pow(n - S) *
mint(26).pow(K + S - n);
}
print(sum);
}
};
#undef int
int main() {
FStrivore solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
std::ostringstream err;
in.tie(0);
ios::sync_with_stdio(0);
solver.solve(in, out, err);
return 0;
}
| replace | 419 | 420 | 419 | 420 | 0 | |
p02632 | C++ | Runtime Error | // Mandelbrot: z(n+1) = (z(n))^2 + c
// Rick: I programmed you to believe that
// #include <boost/multiprecision/cpp_int.hpp>
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
typedef long long int ll;
typedef double db;
// __int128 s128;
// __uint128_t u128;
typedef unsigned long long u64;
#define int long long int
#define PI 3.14159265359
#define sz(a) (ll) a.size()
#define lt(a) (ll) a.length()
#define pll pair<ll, ll>
#define tc(x) \
ll x; \
cin >> x; \
while (x--)
#define f(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define bac(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
#define print(a) \
for (auto x : a) \
cout << x << " "; \
cout << endl
#define mll map<ll, ll>
#define umll unordered_map<ll, ll>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define mt make_tuple
#define eb emplace_back
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define setbits(a) __builtin_popcountll(a)
#define ps(x, y) fixed << setprecision(y) << x;
#define F first
#define S second
#define teevra_gati \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define P 1000000007
#define Q 1000000006
#define inf 1e18
#define N 1000005
// using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
mt19937 rng(chrono::steady_clock::now()
.time_since_epoch()
.count()); // shuffle(all(v), rng);
ll fact[N];
ll powMod(ll a, ll b, ll m) {
a %= m;
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll modInverse(ll n, ll p) { return powMod(n, p - 2, p); }
ll nCrModPFermat(ll n, ll r, ll p) {
if (r == 0)
return 1;
ll r1 = fact[n];
ll r2 = fact[r];
ll r3 = fact[n - r];
return (r1 * modInverse(r2, p) % p * modInverse(r3, p) % p) % p;
}
void solve() {
ll k, l, ans = 0;
string s;
cin >> k >> s;
l = lt(s);
f(i, 0, k + 1) {
ll a = nCrModPFermat(l + k - i - 1, l - 1, P);
ll b = (powMod(26, i, P) * powMod(25, k - i, P)) % P;
(ans += (a * b) % P) %= P;
}
cout << ans;
}
signed main() {
teevra_gati
fact[0] = 1;
f(i, 1, N) fact[i] = (i * fact[i - 1]) % P;
solve();
return 0;
} | // Mandelbrot: z(n+1) = (z(n))^2 + c
// Rick: I programmed you to believe that
// #include <boost/multiprecision/cpp_int.hpp>
#include "bits/stdc++.h"
#include "ext/pb_ds/assoc_container.hpp"
#include "ext/pb_ds/tree_policy.hpp"
typedef long long int ll;
typedef double db;
// __int128 s128;
// __uint128_t u128;
typedef unsigned long long u64;
#define int long long int
#define PI 3.14159265359
#define sz(a) (ll) a.size()
#define lt(a) (ll) a.length()
#define pll pair<ll, ll>
#define tc(x) \
ll x; \
cin >> x; \
while (x--)
#define f(i, a, b) for (ll i = (ll)a; i < (ll)b; i++)
#define bac(i, a, b) for (ll i = (ll)a; i >= (ll)b; i--)
#define print(a) \
for (auto x : a) \
cout << x << " "; \
cout << endl
#define mll map<ll, ll>
#define umll unordered_map<ll, ll>
#define vl vector<ll>
#define vvl vector<vector<ll>>
#define mt make_tuple
#define eb emplace_back
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define all(a) a.begin(), a.end()
#define setbits(a) __builtin_popcountll(a)
#define ps(x, y) fixed << setprecision(y) << x;
#define F first
#define S second
#define teevra_gati \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define P 1000000007
#define Q 1000000006
#define inf 1e18
#define N 3000005
// using namespace boost::multiprecision;
using namespace __gnu_pbds;
using namespace std;
mt19937 rng(chrono::steady_clock::now()
.time_since_epoch()
.count()); // shuffle(all(v), rng);
ll fact[N];
ll powMod(ll a, ll b, ll m) {
a %= m;
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % m;
a = a * a % m;
b >>= 1;
}
return res;
}
ll modInverse(ll n, ll p) { return powMod(n, p - 2, p); }
ll nCrModPFermat(ll n, ll r, ll p) {
if (r == 0)
return 1;
ll r1 = fact[n];
ll r2 = fact[r];
ll r3 = fact[n - r];
return (r1 * modInverse(r2, p) % p * modInverse(r3, p) % p) % p;
}
void solve() {
ll k, l, ans = 0;
string s;
cin >> k >> s;
l = lt(s);
f(i, 0, k + 1) {
ll a = nCrModPFermat(l + k - i - 1, l - 1, P);
ll b = (powMod(26, i, P) * powMod(25, k - i, P)) % P;
(ans += (a * b) % P) %= P;
}
cout << ans;
}
signed main() {
teevra_gati
fact[0] = 1;
f(i, 1, N) fact[i] = (i * fact[i - 1]) % P;
solve();
return 0;
} | replace | 47 | 48 | 47 | 48 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 2000100
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
// BELOW
struct mint {
int x; // typedef long long int;
mint(int x = 0) : x((x % MOD + MOD) % MOD) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(int t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int PERM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[n - k] % MOD) % MOD;
}
int MCOM(int n, int k) {
// n個のものから重複を許してr個選ぶ。
// Choose R from N types of things, allowing for duplication.
return COM(n + k - 1, k);
}
// solve
//-----CODE------//
void solve(void) {
int k;
cin >> k;
string str;
cin >> str;
mint res = 0;
int n = str.size();
COMinit();
for (int i = 0; i <= k; i++) {
res +=
mint(COM(n + k - i - 1, n - 1)) * mint(26).pow(i) * mint(25).pow(k - i);
}
cout << res.x << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int ll
#define ll long long
#define I32_MAX 2147483647
#define I64_MAX 9223372036854775807LL
#define I64_MAX2 1223372036854775807LL
#define INF I64_MAX2
#define MOD 1000000007
// #define MOD 998244353
#define MEM_SIZE 2000100
#define DEBUG_OUT true
#define ALL(x) (x).begin(), (x).end()
template <typename T> void DEBUG(T e) {
if (DEBUG_OUT == false)
return;
std::cout << e << " ";
}
template <typename T> void DEBUG(const std::vector<T> &v) {
if (DEBUG_OUT == false)
return;
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void DEBUG(const std::vector<std::vector<T>> &vv) {
if (DEBUG_OUT == false)
return;
for (const auto &v : vv) {
DEBUG(v);
}
}
template <class T, class... Ts> void DEBUG(T d, Ts... e) {
if (DEBUG_OUT == false)
return;
DEBUG(d);
DEBUG(e...);
}
template <class T> void corner(bool flg, T hoge) {
if (flg) {
cout << hoge << endl;
abort();
}
}
template <typename T1, typename T2> inline bool chmax(T1 &a, T2 b) {
return a < b && (a = b, true);
}
template <typename T1, typename T2> inline bool chmin(T1 &a, T2 b) {
return a > b && (a = b, true);
}
// BELOW
struct mint {
int x; // typedef long long int;
mint(int x = 0) : x((x % MOD + MOD) % MOD) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(int t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
const int MAX = 2010000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int PERM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[n - k] % MOD) % MOD;
}
int MCOM(int n, int k) {
// n個のものから重複を許してr個選ぶ。
// Choose R from N types of things, allowing for duplication.
return COM(n + k - 1, k);
}
// solve
//-----CODE------//
void solve(void) {
int k;
cin >> k;
string str;
cin >> str;
mint res = 0;
int n = str.size();
COMinit();
for (int i = 0; i <= k; i++) {
res +=
mint(COM(n + k - i - 1, n - 1)) * mint(26).pow(i) * mint(25).pow(k - i);
}
cout << res.x << endl;
return;
}
int32_t main(int32_t argc, const char *argv[]) {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed;
std::cout << std::setprecision(11);
solve();
return 0;
}
| replace | 103 | 104 | 103 | 104 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
// #define i_7 998'244'353
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
// typedef long long ll;
long long po(long a, long b) {
if (b == 0) {
return 1;
}
long long z = po(a, b / 2);
z = mod(z * z);
if (b % 2 != 0) {
z = mod(a * z);
}
return z;
}
// 配列のSIZEは問題ごとに定義する必要がある。
const int SIZE = 200010;
long long inv[SIZE + 1]; // 各iの逆元を格納する配列。
long long kai[SIZE + 1]; // i!のmodを格納する配列。
long long invkai[SIZE + 1]; // 各i!の逆元を格納する配列。
const int MOD = i_7;
void invinit() { // 上の配列を初期化する関数。
inv[1] = 1;
for (int i = 2; i <= SIZE; i++) {
inv[i] = MOD - ((MOD / i) * inv[MOD % i]) % MOD;
}
kai[0] = invkai[0] = 1;
for (int i = 1; i <= SIZE; i++) {
kai[i] = (kai[i - 1] * i) % MOD;
invkai[i] = (invkai[i - 1] * inv[i]) % MOD;
}
}
long long comb(long long a, long long b) {
if (b < 0 || a < b) {
return 0;
}
return mod(kai[a] * mod(invkai[b] * invkai[a - b]));
}
int main() {
invinit();
using namespace std;
long long n, k;
cin >> k;
string s;
cin >> s;
n = s.size();
long long ans = 0;
for (long long i = 0; i <= k; i++) {
long long c = comb(n + k - i - 1, n - 1);
long long temp = mod(po(25, k - i) * po(26, i));
ans += mod(c * temp);
ans = mod(ans);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPP(i, n) for (int i = 1; i <= n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
long long INF = (long long)1E17;
#define i_7 (long long)(1E9 + 7)
// #define i_7 998'244'353
long mod(long a) {
long long c = a % i_7;
if (c >= 0)
return c;
return c + i_7;
}
// typedef long long ll;
long long po(long a, long b) {
if (b == 0) {
return 1;
}
long long z = po(a, b / 2);
z = mod(z * z);
if (b % 2 != 0) {
z = mod(a * z);
}
return z;
}
// 配列のSIZEは問題ごとに定義する必要がある。
const int SIZE = 2000010;
long long inv[SIZE + 1]; // 各iの逆元を格納する配列。
long long kai[SIZE + 1]; // i!のmodを格納する配列。
long long invkai[SIZE + 1]; // 各i!の逆元を格納する配列。
const int MOD = i_7;
void invinit() { // 上の配列を初期化する関数。
inv[1] = 1;
for (int i = 2; i <= SIZE; i++) {
inv[i] = MOD - ((MOD / i) * inv[MOD % i]) % MOD;
}
kai[0] = invkai[0] = 1;
for (int i = 1; i <= SIZE; i++) {
kai[i] = (kai[i - 1] * i) % MOD;
invkai[i] = (invkai[i - 1] * inv[i]) % MOD;
}
}
long long comb(long long a, long long b) {
if (b < 0 || a < b) {
return 0;
}
return mod(kai[a] * mod(invkai[b] * invkai[a - b]));
}
int main() {
invinit();
using namespace std;
long long n, k;
cin >> k;
string s;
cin >> s;
n = s.size();
long long ans = 0;
for (long long i = 0; i <= k; i++) {
long long c = comb(n + k - i - 1, n - 1);
long long temp = mod(po(25, k - i) * po(26, i));
ans += mod(c * temp);
ans = mod(ans);
}
cout << ans << endl;
return 0;
}
| replace | 29 | 30 | 29 | 30 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll k;
char s[1000010];
ll fac[1000010], ifac[1000010], inv[1000010];
ll n;
ll ans;
ll ksm(ll a, ll b, ll m) {
ll ret = 1;
while (b) {
if (b & 1)
ret = (ret * a) % m;
a = (a * a) % m;
b >>= 1;
}
return ret;
}
ll C(ll i, ll j) { return fac[i] * ifac[j] % mod * ifac[i - j] % mod; }
int main() {
scanf("%lld", &k);
scanf("%s", s + 1);
n = strlen(s + 1);
fac[0] = ifac[0] = inv[1] = 1;
for (ll i = 2; i <= n + k; i++) {
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
}
for (ll i = 1; i <= n + k; i++) {
fac[i] = fac[i - 1] * i % mod;
ifac[i] = ifac[i - 1] * inv[i] % mod;
}
for (ll i = 0; i <= k; i++) {
ans = (ans + ksm(26, i, mod) * C(n + k - i - 1, n - 1) % mod *
ksm(25, k - i, mod)) %
mod;
}
printf("%lld", ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
ll k;
char s[1000010];
ll fac[2000010], ifac[2000010], inv[2000010];
ll n;
ll ans;
ll ksm(ll a, ll b, ll m) {
ll ret = 1;
while (b) {
if (b & 1)
ret = (ret * a) % m;
a = (a * a) % m;
b >>= 1;
}
return ret;
}
ll C(ll i, ll j) { return fac[i] * ifac[j] % mod * ifac[i - j] % mod; }
int main() {
scanf("%lld", &k);
scanf("%s", s + 1);
n = strlen(s + 1);
fac[0] = ifac[0] = inv[1] = 1;
for (ll i = 2; i <= n + k; i++) {
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
}
for (ll i = 1; i <= n + k; i++) {
fac[i] = fac[i - 1] * i % mod;
ifac[i] = ifac[i - 1] * inv[i] % mod;
}
for (ll i = 0; i <= k; i++) {
ans = (ans + ksm(26, i, mod) * C(n + k - i - 1, n - 1) % mod *
ksm(25, k - i, mod)) %
mod;
}
printf("%lld", ans);
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.end()) - arr.begin())
#define getbit(x, i) (((x) >> (i)) & 1)
template <typename T> vector<T> readvector(size_t sz) {
vector<T> res(sz);
for (size_t i = 0; i < sz; ++i) {
cin >> res[i];
}
return res;
}
template <typename T>
std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
std::copy(v.begin(), v.end(), std::ostream_iterator<T>(out, " "));
return out;
}
int mylog(int n) { return 63 - __builtin_clzll(n); }
inline int binPow(int x, int deg, int mod) {
int ans = 1;
for (int i = sizeof(deg) * CHAR_BIT - 1; i >= 0; i--) {
ans *= ans;
ans %= mod;
if (getbit(deg, i))
ans *= x;
ans %= mod;
}
return ans;
}
/** Interface */
inline int readInt();
inline int readUInt();
inline void readWord(char *s);
inline int fast_readchar(); // you may use readchar() instead of it
inline void writeInt(int x);
inline void fast_writechar(int x); // you may use putchar() instead of it
inline void writeWord(const char *s);
inline void fast_flush();
// ====================== END ======================
const int MAXN = 5e5 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e18;
int fact[MAXN], inv_fact[MAXN];
int fpow1[MAXN], fpow2[MAXN];
void precalc() {
fpow1[0] = fpow2[0] = 1;
for (int i = 1; i < MAXN; i++) {
fpow1[i] = (fpow1[i - 1] * 26) % MOD;
fpow2[i] = (fpow2[i - 1] * 25) % MOD;
}
fact[0] = 1;
for (int i = 1; i < MAXN; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
}
inv_fact[MAXN - 1] = binPow(fact[MAXN - 1], MOD - 2, MOD);
for (int i = MAXN - 1; i > 0; i--) {
inv_fact[i - 1] = (inv_fact[i] * i) % MOD;
}
}
int c(int n, int k) {
return ((fact[n] * inv_fact[k]) % MOD * inv_fact[n - k]) % MOD;
}
int f(int n, int m) {
int ans = 0;
for (int i = 0; i <= n; i++) {
ans += ((i % 2 == 0 ? 1 : -1) * c(n, i) * fact[m - i]) % MOD;
// cout << ans << endl;
}
ans = (ans % MOD) + MOD;
ans %= MOD;
// cout << ans << endl;
return (ans * inv_fact[m - n]) % MOD;
}
void solve() {
precalc();
// for (int i = 1; i < 100; i++) {
// cout << f(1, i) << endl;
// }
int n;
string s;
cin >> n >> s;
int ans = 0;
for (int i = 0; i <= n; i++) {
ans +=
((fpow1[n - i] * fpow2[i]) % MOD) * c(i + s.size() - 1, s.size() - 1);
ans %= MOD;
}
cout << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// t = readInt();
// cin >> t;
for (int i = 1; i <= t; ++i) {
// cout << "Case #" << i << ": ";
solve();
}
// fast_flush();
return 0;
}
/** Read */
static const int buf_size = 4096;
inline int fast_readchar() {
static char buf[buf_size];
static int len = 0, pos = 0;
if (pos == len)
pos = 0, len = fread(buf, 1, buf_size, stdin);
if (pos == len)
return -1;
return buf[pos++];
}
inline int readUInt() {
int c = fast_readchar(), x = 0;
while (c <= 32)
c = fast_readchar();
while ('0' <= c && c <= '9')
x = x * 10 + c - '0', c = fast_readchar();
return x;
}
inline int readInt() {
int s = 1, c = fast_readchar();
int x = 0;
while (c <= 32)
c = fast_readchar();
if (c == '-')
s = -1, c = fast_readchar();
while ('0' <= c && c <= '9')
x = x * 10 + c - '0', c = fast_readchar();
return x * s;
}
inline void readWord(char *s) {
int c = fast_readchar();
while (c <= 32)
c = fast_readchar();
while (c > 32)
*s++ = c, c = fast_readchar();
*s = 0;
}
/** Write */
static int write_pos = 0;
static char write_buf[buf_size];
inline void fast_writechar(int x) {
if (write_pos == buf_size)
fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
write_buf[write_pos++] = x;
}
inline void fast_flush() {
if (write_pos)
fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
}
inline void writeInt(int x) {
if (x < 0)
fast_writechar('-'), x = -x;
char s[24];
int n = 0;
while (x || !n)
s[n++] = '0' + x % 10, x /= 10;
while (n--)
fast_writechar(s[n]);
}
inline void writeWord(const char *s) {
while (*s)
fast_writechar(*s++);
}
| #include <bits/stdc++.h>
#define int long long
#define x first
#define y second
#define getbit(x, i) (((x) >> (i)) & 1)
using namespace std;
typedef pair<int, int> pii;
#define hashset unordered_set
#define hashmap unordered_map
#define newline fast_writechar('\n')
#define unify(arr) arr.resize(unique(arr.begin(), arr.end()) - arr.begin())
#define getbit(x, i) (((x) >> (i)) & 1)
template <typename T> vector<T> readvector(size_t sz) {
vector<T> res(sz);
for (size_t i = 0; i < sz; ++i) {
cin >> res[i];
}
return res;
}
template <typename T>
std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
std::copy(v.begin(), v.end(), std::ostream_iterator<T>(out, " "));
return out;
}
int mylog(int n) { return 63 - __builtin_clzll(n); }
inline int binPow(int x, int deg, int mod) {
int ans = 1;
for (int i = sizeof(deg) * CHAR_BIT - 1; i >= 0; i--) {
ans *= ans;
ans %= mod;
if (getbit(deg, i))
ans *= x;
ans %= mod;
}
return ans;
}
/** Interface */
inline int readInt();
inline int readUInt();
inline void readWord(char *s);
inline int fast_readchar(); // you may use readchar() instead of it
inline void writeInt(int x);
inline void fast_writechar(int x); // you may use putchar() instead of it
inline void writeWord(const char *s);
inline void fast_flush();
// ====================== END ======================
const int MAXN = 2e6 + 10;
const int MOD = 1e9 + 7;
const int INF = 1e18;
int fact[MAXN], inv_fact[MAXN];
int fpow1[MAXN], fpow2[MAXN];
void precalc() {
fpow1[0] = fpow2[0] = 1;
for (int i = 1; i < MAXN; i++) {
fpow1[i] = (fpow1[i - 1] * 26) % MOD;
fpow2[i] = (fpow2[i - 1] * 25) % MOD;
}
fact[0] = 1;
for (int i = 1; i < MAXN; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
}
inv_fact[MAXN - 1] = binPow(fact[MAXN - 1], MOD - 2, MOD);
for (int i = MAXN - 1; i > 0; i--) {
inv_fact[i - 1] = (inv_fact[i] * i) % MOD;
}
}
int c(int n, int k) {
return ((fact[n] * inv_fact[k]) % MOD * inv_fact[n - k]) % MOD;
}
int f(int n, int m) {
int ans = 0;
for (int i = 0; i <= n; i++) {
ans += ((i % 2 == 0 ? 1 : -1) * c(n, i) * fact[m - i]) % MOD;
// cout << ans << endl;
}
ans = (ans % MOD) + MOD;
ans %= MOD;
// cout << ans << endl;
return (ans * inv_fact[m - n]) % MOD;
}
void solve() {
precalc();
// for (int i = 1; i < 100; i++) {
// cout << f(1, i) << endl;
// }
int n;
string s;
cin >> n >> s;
int ans = 0;
for (int i = 0; i <= n; i++) {
ans +=
((fpow1[n - i] * fpow2[i]) % MOD) * c(i + s.size() - 1, s.size() - 1);
ans %= MOD;
}
cout << ans << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// t = readInt();
// cin >> t;
for (int i = 1; i <= t; ++i) {
// cout << "Case #" << i << ": ";
solve();
}
// fast_flush();
return 0;
}
/** Read */
static const int buf_size = 4096;
inline int fast_readchar() {
static char buf[buf_size];
static int len = 0, pos = 0;
if (pos == len)
pos = 0, len = fread(buf, 1, buf_size, stdin);
if (pos == len)
return -1;
return buf[pos++];
}
inline int readUInt() {
int c = fast_readchar(), x = 0;
while (c <= 32)
c = fast_readchar();
while ('0' <= c && c <= '9')
x = x * 10 + c - '0', c = fast_readchar();
return x;
}
inline int readInt() {
int s = 1, c = fast_readchar();
int x = 0;
while (c <= 32)
c = fast_readchar();
if (c == '-')
s = -1, c = fast_readchar();
while ('0' <= c && c <= '9')
x = x * 10 + c - '0', c = fast_readchar();
return x * s;
}
inline void readWord(char *s) {
int c = fast_readchar();
while (c <= 32)
c = fast_readchar();
while (c > 32)
*s++ = c, c = fast_readchar();
*s = 0;
}
/** Write */
static int write_pos = 0;
static char write_buf[buf_size];
inline void fast_writechar(int x) {
if (write_pos == buf_size)
fwrite(write_buf, 1, buf_size, stdout), write_pos = 0;
write_buf[write_pos++] = x;
}
inline void fast_flush() {
if (write_pos)
fwrite(write_buf, 1, write_pos, stdout), write_pos = 0;
}
inline void writeInt(int x) {
if (x < 0)
fast_writechar('-'), x = -x;
char s[24];
int n = 0;
while (x || !n)
s[n++] = '0' + x % 10, x /= 10;
while (n--)
fast_writechar(s[n]);
}
inline void writeWord(const char *s) {
while (*s)
fast_writechar(*s++);
}
| replace | 53 | 54 | 53 | 54 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long int;
using vec = vector<int>;
using P = pair<int, int>;
const int mod = 1e9 + 7;
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; }
const int MAX_N = 1e6 + 5;
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];
}
} c(MAX_N);
int main() {
int k;
cin >> k;
string s;
cin >> s;
mint ans = 0;
int n = s.size();
rep(i, k + 1) {
mint now = mint(25).pow(i);
now *= mint(26).pow(k - i);
now *= c(n + i - 1, i);
ans += now;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
using ll = long long int;
using vec = vector<int>;
using P = pair<int, int>;
const int mod = 1e9 + 7;
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; }
const int MAX_N = 2e6 + 5;
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];
}
} c(MAX_N);
int main() {
int k;
cin >> k;
string s;
cin >> s;
mint ans = 0;
int n = s.size();
rep(i, k + 1) {
mint now = mint(25).pow(i);
now *= mint(26).pow(k - i);
now *= c(n + i - 1, i);
ans += now;
}
cout << ans << endl;
}
| replace | 48 | 49 | 48 | 49 | 0 | |
p02632 | C++ | Runtime Error | // Coded by Abhijay Mitra
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <vector>
// #include <bits/stdc++.h>
#define double long double
#define int long long int
#define ll int
#define ibs ios_base::sync_with_stdio(false)
#define cti cin.tie(0)
#define bp __builtin_popcount
#define pb push_back
#define res(v) v.resize(unique(v.begin(), v.end()) - v.begin());
#define cnt_res(v) std::distance(v.begin(), std::unique(v.begin(), v.end()));
#define timer \
cerr << "Time elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using pii = std::pair<int, int>;
using vpii = std::vector<pii>;
using vvpii = std::vector<vpii>;
#define mp make_pair
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, b, a) for (int i = b; i >= a; i--)
#define all(x) x.begin(), x.end()
using namespace std;
const int N = 1e6 + 10;
const int inf = /*0x3f3f3f3f*/ 1e18 + 10;
// const ll M = 998244353 ; // Mulo
const int M = 1e9 + 7; // Mulo
const double Pi = 3.14159265;
#define F first
#define S second
int mul(int a, int b) { return ((a % M) * (b % M)) % M; }
int add(int a, int b) { return ((a % M) + (b % M)) % M; }
ll powM(ll a, int n) {
ll x = 1;
while (n > 0) {
if (n & 1)
x = x * a % M;
a = a * a % M;
n >>= 1;
}
return x;
}
int invM(int x) { return powM(x, M - 2); }
int f[N], b[N];
void binomialCoeff(int n) {
f[0] = b[0] = 1;
rep(i, 1, N - 1) {
f[i] = mul(f[i - 1], i);
b[i] = invM(f[i]);
}
// per(i,N-2,0)b[i]=mul(b[i+1],i+1);
// rep(i,1,n){
// C[i]=mul(mul(f[n],b[n-i]),b[i]);
// }
}
int C(int n, int i) {
if (i < 0 or n < i)
return 0;
return mul(mul(f[n], b[n - i]), b[i]);
}
void solve() {
int n, k;
cin >> k;
string s;
cin >> s;
n = s.length();
binomialCoeff(n + k);
int ans = 0;
rep(i, n, n + k) { ans = add(ans, mul(powM(25, n + k - i), C(n + k, i))); }
cout << ans;
}
int32_t main() {
ibs;
cti;
solve()
/*,cout<<"\n"*/;
// cout<<"\n";
int xx = 0;
// int t;cin>>t;while(t--){/*xx++;cout<<"Case
// "<<xx<<":\n"*/;solve();cout<<"\n";}
return 0;
} | // Coded by Abhijay Mitra
#include <algorithm>
#include <bitset>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdlib.h>
#include <vector>
// #include <bits/stdc++.h>
#define double long double
#define int long long int
#define ll int
#define ibs ios_base::sync_with_stdio(false)
#define cti cin.tie(0)
#define bp __builtin_popcount
#define pb push_back
#define res(v) v.resize(unique(v.begin(), v.end()) - v.begin());
#define cnt_res(v) std::distance(v.begin(), std::unique(v.begin(), v.end()));
#define timer \
cerr << "Time elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using pii = std::pair<int, int>;
using vpii = std::vector<pii>;
using vvpii = std::vector<vpii>;
#define mp make_pair
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, b, a) for (int i = b; i >= a; i--)
#define all(x) x.begin(), x.end()
using namespace std;
const int N = 2e6 + 10;
const int inf = /*0x3f3f3f3f*/ 1e18 + 10;
// const ll M = 998244353 ; // Mulo
const int M = 1e9 + 7; // Mulo
const double Pi = 3.14159265;
#define F first
#define S second
int mul(int a, int b) { return ((a % M) * (b % M)) % M; }
int add(int a, int b) { return ((a % M) + (b % M)) % M; }
ll powM(ll a, int n) {
ll x = 1;
while (n > 0) {
if (n & 1)
x = x * a % M;
a = a * a % M;
n >>= 1;
}
return x;
}
int invM(int x) { return powM(x, M - 2); }
int f[N], b[N];
void binomialCoeff(int n) {
f[0] = b[0] = 1;
rep(i, 1, N - 1) {
f[i] = mul(f[i - 1], i);
b[i] = invM(f[i]);
}
// per(i,N-2,0)b[i]=mul(b[i+1],i+1);
// rep(i,1,n){
// C[i]=mul(mul(f[n],b[n-i]),b[i]);
// }
}
int C(int n, int i) {
if (i < 0 or n < i)
return 0;
return mul(mul(f[n], b[n - i]), b[i]);
}
void solve() {
int n, k;
cin >> k;
string s;
cin >> s;
n = s.length();
binomialCoeff(n + k);
int ans = 0;
rep(i, n, n + k) { ans = add(ans, mul(powM(25, n + k - i), C(n + k, i))); }
cout << ans;
}
int32_t main() {
ibs;
cti;
solve()
/*,cout<<"\n"*/;
// cout<<"\n";
int xx = 0;
// int t;cin>>t;while(t--){/*xx++;cout<<"Case
// "<<xx<<":\n"*/;solve();cout<<"\n";}
return 0;
} | replace | 39 | 40 | 39 | 40 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i <= (ll)(n); i++)
#define per(i, j, n) for (ll i = (ll)(j); (ll)(n) <= i; i--)
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (ll)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (ll)(key)))
#define pb emplace_back
#define mp std::make_pair
//
#define endl "\n"
// using std::endl;
using std::cin;
using std::cout;
using std::lower_bound;
using std::string;
using std::upper_bound;
using std::vector;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll, ll>;
//
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD=998244353;
// constexpr ll MOD=10000000;
// constexpr ll MOD=1e5;
constexpr ll MAX = 1e6;
constexpr ll INF = (1ll << 60);
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <typename T> struct Segment_tree {
ll N;
T mem;
vector<T> node;
Segment_tree(vector<T> &X, T m) : mem(m) {
ll sz = X.size();
N = 1;
while (N < sz)
N *= 2;
node.resize(2 * N - 1, mem);
rep(i, 0, sz) node[N - 1 + i] = X[i];
per(i, N - 2, 0) { node[i] = Compare(node[i * 2 + 1], node[i * 2 + 2]); }
}
T Compare(T &A, T &B) { return std::min(A, B); }
void update(ll X, T val) {
X += N - 1;
node[X] = val;
while (X > 0) {
X = (X - 1) / 2;
node[X] = Compare(node[X * 2 + 1], node[X * 2 + 2]);
}
}
T Query(ll a, ll b, ll now, ll l, ll r) { //[a,b),[l,r)
if (r < 0)
r = N;
if (r <= a || b <= l)
return mem;
if (a <= l && r <= b)
return node[now];
auto vl = Query(a, b, now * 2 + 1, l, (l + r) / 2),
vr = Query(a, b, now * 2 + 2, (l + r) / 2, r);
return Compare(vl, vr);
}
};
struct Binary_indexed_tree {
int N;
vi bit;
Binary_indexed_tree(int n) : N(n) { bit.resize(N + 1, 0); }
void add(int x, int a) {
for (x; x <= N; x += (x & -x))
bit[x] += a;
}
ll sum(int x) {
ll ret = 0;
for (x; x > 0; x -= (x & -x))
ret += bit[x];
return ret;
}
ll lower_bound(ll X) {
if (sum(N) < X)
return -1;
ll ret = 0, memo = 1, sum = 0;
while (memo * 2 <= N)
memo *= 2;
while (memo > 0) {
if (memo + ret <= N && sum + bit[memo + ret] < X) {
sum += bit[memo + ret];
ret += memo;
}
memo /= 2;
}
return ret + 1;
}
};
struct Union_Find {
ll N;
vi par;
vi siz;
Union_Find(int n) : N(n) {
par.resize(N);
siz.resize(N, 1);
rep(i, 0, N) par[i] = i;
}
ll root(ll X) {
if (par[X] == X)
return X;
return par[X] = root(par[X]);
}
bool same(ll X, ll Y) { return root(X) == root(Y); }
void unite(ll X, ll Y) {
X = root(X);
Y = root(Y);
if (X == Y)
return;
par[X] = Y;
siz[Y] += siz[X];
siz[X] = 0;
}
ll size(ll X) { return siz[root(X)]; }
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
vi fac, finv, inv;
void COMinit() {
fac.resize(MAX);
finv.resize(MAX);
inv.resize(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 % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(ll n, ll r) {
if (n < r || n < 0 || r < 0)
return 0;
return fac[n] * finv[r] % MOD * finv[n - r] % MOD;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
ll K;
cin >> K;
string S;
cin >> S;
ll N = S.size();
ll ans = 0;
COMinit();
REP(i, 0, K) {
ans += modpow(25, K - i, MOD) * modpow(26, i, MOD) % MOD *
COM(K - i + N - 1, N - 1) % MOD;
ans %= MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
// using namespace std;
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define rep(i, j, n) for (ll i = (ll)(j); i < (ll)(n); i++)
#define REP(i, j, n) for (ll i = (ll)(j); i <= (ll)(n); i++)
#define per(i, j, n) for (ll i = (ll)(j); (ll)(n) <= i; i--)
#define ll long long
#define ALL(a) (a).begin(), (a).end()
#define disup(A, key) distance(A.begin(), upper_bound(ALL(A), (ll)(key)))
#define dislow(A, key) distance(A.begin(), lower_bound(ALL(A), (ll)(key)))
#define pb emplace_back
#define mp std::make_pair
//
#define endl "\n"
// using std::endl;
using std::cin;
using std::cout;
using std::lower_bound;
using std::string;
using std::upper_bound;
using std::vector;
using vi = vector<ll>;
using vii = vector<vi>;
using pii = std::pair<ll, ll>;
//
constexpr ll MOD = 1e9 + 7;
// constexpr ll MOD=998244353;
// constexpr ll MOD=10000000;
// constexpr ll MOD=1e5;
constexpr ll MAX = 1e7;
constexpr ll INF = (1ll << 60);
template <class T>
class prique : public std::priority_queue<T, std::vector<T>, std::greater<T>> {
};
template <typename T> struct Segment_tree {
ll N;
T mem;
vector<T> node;
Segment_tree(vector<T> &X, T m) : mem(m) {
ll sz = X.size();
N = 1;
while (N < sz)
N *= 2;
node.resize(2 * N - 1, mem);
rep(i, 0, sz) node[N - 1 + i] = X[i];
per(i, N - 2, 0) { node[i] = Compare(node[i * 2 + 1], node[i * 2 + 2]); }
}
T Compare(T &A, T &B) { return std::min(A, B); }
void update(ll X, T val) {
X += N - 1;
node[X] = val;
while (X > 0) {
X = (X - 1) / 2;
node[X] = Compare(node[X * 2 + 1], node[X * 2 + 2]);
}
}
T Query(ll a, ll b, ll now, ll l, ll r) { //[a,b),[l,r)
if (r < 0)
r = N;
if (r <= a || b <= l)
return mem;
if (a <= l && r <= b)
return node[now];
auto vl = Query(a, b, now * 2 + 1, l, (l + r) / 2),
vr = Query(a, b, now * 2 + 2, (l + r) / 2, r);
return Compare(vl, vr);
}
};
struct Binary_indexed_tree {
int N;
vi bit;
Binary_indexed_tree(int n) : N(n) { bit.resize(N + 1, 0); }
void add(int x, int a) {
for (x; x <= N; x += (x & -x))
bit[x] += a;
}
ll sum(int x) {
ll ret = 0;
for (x; x > 0; x -= (x & -x))
ret += bit[x];
return ret;
}
ll lower_bound(ll X) {
if (sum(N) < X)
return -1;
ll ret = 0, memo = 1, sum = 0;
while (memo * 2 <= N)
memo *= 2;
while (memo > 0) {
if (memo + ret <= N && sum + bit[memo + ret] < X) {
sum += bit[memo + ret];
ret += memo;
}
memo /= 2;
}
return ret + 1;
}
};
struct Union_Find {
ll N;
vi par;
vi siz;
Union_Find(int n) : N(n) {
par.resize(N);
siz.resize(N, 1);
rep(i, 0, N) par[i] = i;
}
ll root(ll X) {
if (par[X] == X)
return X;
return par[X] = root(par[X]);
}
bool same(ll X, ll Y) { return root(X) == root(Y); }
void unite(ll X, ll Y) {
X = root(X);
Y = root(Y);
if (X == Y)
return;
par[X] = Y;
siz[Y] += siz[X];
siz[X] = 0;
}
ll size(ll X) { return siz[root(X)]; }
};
long long modpow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
vi fac, finv, inv;
void COMinit() {
fac.resize(MAX);
finv.resize(MAX);
inv.resize(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 % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(ll n, ll r) {
if (n < r || n < 0 || r < 0)
return 0;
return fac[n] * finv[r] % MOD * finv[n - r] % MOD;
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(nullptr);
ll K;
cin >> K;
string S;
cin >> S;
ll N = S.size();
ll ans = 0;
COMinit();
REP(i, 0, K) {
ans += modpow(25, K - i, MOD) * modpow(26, i, MOD) % MOD *
COM(K - i + N - 1, N - 1) % MOD;
ans %= MOD;
}
cout << ans << endl;
}
| replace | 32 | 33 | 32 | 33 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAX = 1e6 + 5;
int fact[MAX];
int inv[MAX];
int Power(int n, int x) {
if (x == 0) {
return 1;
} else if (x & 1) {
return 1ll * n * Power(n, x - 1) % MOD;
} else {
int res = Power(n, x / 2);
return 1ll * res * res % MOD;
}
}
int C(int n, int r) {
if (r > n || r < 0) {
return 0;
}
return 1ll * fact[n] * inv[r] % MOD * inv[n - r] % MOD;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
fact[0] = inv[0] = 1;
for (int i = 1; i < MAX; i++) {
fact[i] = 1ll * i * fact[i - 1] % MOD;
inv[i] = Power(fact[i], MOD - 2);
}
int K;
cin >> K;
string S;
cin >> S;
int ans = 0;
for (int i = 0; i <= K; i++) {
ans += 1ll * Power(26, i) * Power(25, K - i) % MOD *
C(K - i + int(S.size()) - 1, int(S.size()) - 1) % MOD;
if (ans >= MOD) {
ans -= MOD;
}
}
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1e9 + 7;
const int MAX = 3e6 + 5;
int fact[MAX];
int inv[MAX];
int Power(int n, int x) {
if (x == 0) {
return 1;
} else if (x & 1) {
return 1ll * n * Power(n, x - 1) % MOD;
} else {
int res = Power(n, x / 2);
return 1ll * res * res % MOD;
}
}
int C(int n, int r) {
if (r > n || r < 0) {
return 0;
}
return 1ll * fact[n] * inv[r] % MOD * inv[n - r] % MOD;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
fact[0] = inv[0] = 1;
for (int i = 1; i < MAX; i++) {
fact[i] = 1ll * i * fact[i - 1] % MOD;
inv[i] = Power(fact[i], MOD - 2);
}
int K;
cin >> K;
string S;
cin >> S;
int ans = 0;
for (int i = 0; i <= K; i++) {
ans += 1ll * Power(26, i) * Power(25, K - i) % MOD *
C(K - i + int(S.size()) - 1, int(S.size()) - 1) % MOD;
if (ans >= MOD) {
ans -= MOD;
}
}
cout << ans << "\n";
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1 << (n))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
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; }
int const INF = 1001001001;
// modint: mod 計算を int を扱うように扱える構造体
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
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;
}
};
const int MOD = 1000000007;
using mint = Fp<MOD>;
// 二項係数ライブラリ
// main(){ BiCoef<mint> bc(510000);
// res = bc.com(n,k);}
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];
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
BiCoef<mint> bc(1000000);
int k;
cin >> k;
string s;
cin >> s;
int n = SZ(s);
mint res = 0;
for (int i = 0; i <= k; ++i) {
res += bc.com(n + k - i - 1, n - 1) * modpow((mint)25, k - i) *
modpow((mint)26, i);
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = 1; i <= (n); ++i)
#define drep(i, n) for (int i = (n)-1; i >= 0; --i)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define bit(n) (1 << (n))
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<bool> vb;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
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; }
int const INF = 1001001001;
// modint: mod 計算を int を扱うように扱える構造体
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
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;
}
};
const int MOD = 1000000007;
using mint = Fp<MOD>;
// 二項係数ライブラリ
// main(){ BiCoef<mint> bc(510000);
// res = bc.com(n,k);}
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];
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
BiCoef<mint> bc(2000005);
int k;
cin >> k;
string s;
cin >> s;
int n = SZ(s);
mint res = 0;
for (int i = 0; i <= k; ++i) {
res += bc.com(n + k - i - 1, n - 1) * modpow((mint)25, k - i) *
modpow((mint)26, i);
}
cout << res << endl;
return 0;
} | replace | 143 | 144 | 143 | 144 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rep2(i, l, r) for (int i = int(l); i < int(r); i++)
#define repr(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define repr2(i, l, r) for (int i = int(r) - 1; i >= int(l); i--)
#define SZ(x) int(x.size())
constexpr int inf9 = 1e9;
constexpr lint inf18 = 1e18;
inline void YES(bool condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
inline void Yes(bool condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
inline void assertNO(bool condition) {
if (!condition) {
cout << "NO" << endl;
exit(0);
}
}
inline void assertNo(bool condition) {
if (!condition) {
cout << "No" << endl;
exit(0);
}
}
inline void assertm1(bool condition) {
if (!condition) {
cout << -1 << endl;
exit(0);
}
}
lint power(lint base, lint exponent, lint module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
lint root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
struct position {
int y, x;
};
position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}};
double euclidean(position first, position second) {
return sqrt((second.x - first.x) * (second.x - first.x) +
(second.y - first.y) * (second.y - first.y));
}
template <class T, class U> string to_string(pair<T, U> x) {
return to_string(x.first) + "," + to_string(x.second);
}
string to_string(string x) { return x; }
template <class T> string to_string(complex<T> x) {
return to_string(make_pair(x.real(), x.imag()));
}
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
cout << (i == start ? "" : " ") << (*i);
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class T> T gcd(T a, T b) {
if (b)
return gcd(b, a % b);
else
return a;
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
struct combination {
vector<lint> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
lint P(int n, int r) {
if (r < 0 || n < r)
return 0;
return (fact[n] * inv[n - r] % mod);
}
lint C(int p, int q) {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
template <class itr> bool next_sequence(itr first, itr last, int max_bound) {
itr now = last;
while (now != first) {
now--;
(*now)++;
if ((*now) == max_bound) {
(*now) = 0;
} else {
return true;
}
}
return false;
}
template <class itr, class itr2>
bool next_sequence2(itr first, itr last, itr2 first2, itr2 last2) {
itr now = last;
itr2 now2 = last2;
while (now != first) {
now--, now2--;
(*now)++;
if ((*now) == (*now2)) {
(*now) = 0;
} else {
return true;
}
}
return false;
}
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;
}
inline int at(lint i, int j) { return (i >> j) & 1; }
random_device rnd;
bool is_in_board(lint y, lint x, lint H, lint W) {
return (0 <= y && y < H && 0 <= x && x < W);
}
// F問題でサンプルの説明文ちょっと見ちゃったけどもう多分解けてるから許して
combination table(1e6 + 1000);
lint get_ans(int k, int s) {
lint ans = 0, mul = 1;
rep(i, k + 1) {
ans += mul * table.C(k + s, i) % mod;
ans %= mod;
mul *= 25;
mul %= mod;
}
return ans;
}
int main() {
int K;
string S;
cin >> K >> S;
cout << get_ans(K, int(S.size())) << endl;
/*int a = SZ(S), b = SZ(S) + K;
//int a = 10, b = 10;
int chars = 26;
lint dp[a + 1][b + 1];
rep(i, a + 1){
dp[i][0] = 0;
}
dp[0][0] = 1;
rep(i, b){
dp[0][i + 1] = dp[0][i] * chars;
}
rep2(i, 1, a + 1){
rep2(j, 1, b + 1){
dp[i][j] = (dp[i - 1][j - 1] + dp[i][j - 1] * (chars - 1));
}
}
/*rep(i, a + 1){
array_output(dp[i] + i, dp[i] + b + 1);
}
cout << endl;
rep(i, a + 1){
rep2(j, i, b + 1){
cout << get_ans(i, j) << (j < b ? " " : "\n");
}
}
cout << endl;
cout << dp[a][b] << endl;*/
}
| #include <bits/stdc++.h>
using namespace std;
using lint = long long;
constexpr lint mod = 1e9 + 7;
#define all(x) (x).begin(), (x).end()
#define bitcount(n) __builtin_popcountl((lint)(n))
#define fcout cout << fixed << setprecision(15)
#define highest(x) (63 - __builtin_clzl(x))
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define rep2(i, l, r) for (int i = int(l); i < int(r); i++)
#define repr(i, n) for (int i = int(n) - 1; i >= 0; i--)
#define repr2(i, l, r) for (int i = int(r) - 1; i >= int(l); i--)
#define SZ(x) int(x.size())
constexpr int inf9 = 1e9;
constexpr lint inf18 = 1e18;
inline void YES(bool condition) {
if (condition)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
inline void Yes(bool condition) {
if (condition)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
inline void assertNO(bool condition) {
if (!condition) {
cout << "NO" << endl;
exit(0);
}
}
inline void assertNo(bool condition) {
if (!condition) {
cout << "No" << endl;
exit(0);
}
}
inline void assertm1(bool condition) {
if (!condition) {
cout << -1 << endl;
exit(0);
}
}
lint power(lint base, lint exponent, lint module) {
if (exponent % 2) {
return power(base, exponent - 1, module) * base % module;
} else if (exponent) {
lint root_ans = power(base, exponent / 2, module);
return root_ans * root_ans % module;
} else {
return 1;
}
}
struct position {
int y, x;
};
position mv[4] = {{0, -1}, {1, 0}, {0, 1}, {-1, 0}};
double euclidean(position first, position second) {
return sqrt((second.x - first.x) * (second.x - first.x) +
(second.y - first.y) * (second.y - first.y));
}
template <class T, class U> string to_string(pair<T, U> x) {
return to_string(x.first) + "," + to_string(x.second);
}
string to_string(string x) { return x; }
template <class T> string to_string(complex<T> x) {
return to_string(make_pair(x.real(), x.imag()));
}
template <class itr> void array_output(itr start, itr goal) {
string ans;
for (auto i = start; i != goal; i++)
cout << (i == start ? "" : " ") << (*i);
if (!ans.empty())
ans.pop_back();
cout << ans << endl;
}
template <class itr> void cins(itr first, itr last) {
for (auto i = first; i != last; i++) {
cin >> (*i);
}
}
template <class T> T gcd(T a, T b) {
if (b)
return gcd(b, a % b);
else
return a;
}
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
struct combination {
vector<lint> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2, mod);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
lint P(int n, int r) {
if (r < 0 || n < r)
return 0;
return (fact[n] * inv[n - r] % mod);
}
lint C(int p, int q) {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
template <class itr> bool next_sequence(itr first, itr last, int max_bound) {
itr now = last;
while (now != first) {
now--;
(*now)++;
if ((*now) == max_bound) {
(*now) = 0;
} else {
return true;
}
}
return false;
}
template <class itr, class itr2>
bool next_sequence2(itr first, itr last, itr2 first2, itr2 last2) {
itr now = last;
itr2 now2 = last2;
while (now != first) {
now--, now2--;
(*now)++;
if ((*now) == (*now2)) {
(*now) = 0;
} else {
return true;
}
}
return false;
}
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;
}
inline int at(lint i, int j) { return (i >> j) & 1; }
random_device rnd;
bool is_in_board(lint y, lint x, lint H, lint W) {
return (0 <= y && y < H && 0 <= x && x < W);
}
// F問題でサンプルの説明文ちょっと見ちゃったけどもう多分解けてるから許して
combination table(3e6);
lint get_ans(int k, int s) {
lint ans = 0, mul = 1;
rep(i, k + 1) {
ans += mul * table.C(k + s, i) % mod;
ans %= mod;
mul *= 25;
mul %= mod;
}
return ans;
}
int main() {
int K;
string S;
cin >> K >> S;
cout << get_ans(K, int(S.size())) << endl;
/*int a = SZ(S), b = SZ(S) + K;
//int a = 10, b = 10;
int chars = 26;
lint dp[a + 1][b + 1];
rep(i, a + 1){
dp[i][0] = 0;
}
dp[0][0] = 1;
rep(i, b){
dp[0][i + 1] = dp[0][i] * chars;
}
rep2(i, 1, a + 1){
rep2(j, 1, b + 1){
dp[i][j] = (dp[i - 1][j - 1] + dp[i][j - 1] * (chars - 1));
}
}
/*rep(i, a + 1){
array_output(dp[i] + i, dp[i] + b + 1);
}
cout << endl;
rep(i, a + 1){
rep2(j, i, b + 1){
cout << get_ans(i, j) << (j < b ? " " : "\n");
}
}
cout << endl;
cout << dp[a][b] << endl;*/
}
| replace | 163 | 164 | 163 | 164 | 0 | |
p02632 | C++ | Runtime Error | #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T> using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T> constexpr bool chmax(S &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename S, typename T> constexpr bool chmin(S &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T> bool print_(const T &a) {
cout << a;
return true;
}
template <typename T> bool print_(const vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back()) {
cout << " ";
}
}
return false;
}
template <typename T> bool print_(const vector<vector<T>> &vv) {
for (auto &v : vv) {
for (auto &a : v) {
cout << a;
if (&a != &v.back()) {
cout << " ";
}
}
if (&v != &vv.back()) {
cout << "\n";
}
}
return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&...tail) {
bool f = print_(head);
if (sizeof...(tail) != 0) {
cout << (f ? " " : "\n");
}
print(forward<Tail>(tail)...);
}
#pragma endregion
// ModInt
// 参考：https://ei1333.github.io/luzhiled/snippets/math/mod-int.html
// modはコンパイル時に決定
template <ll mod> struct ModInt {
ll x;
ModInt() : x(0) {}
ModInt(ll y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
constexpr ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
constexpr ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
constexpr ModInt &operator*=(const ModInt &p) {
x = x * p.x % mod;
return *this;
}
constexpr ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
constexpr ModInt operator-() { return ModInt(-x); }
constexpr ModInt operator+(const ModInt &p) { return ModInt(*this) += p; }
constexpr ModInt operator-(const ModInt &p) { return ModInt(*this) -= p; }
constexpr ModInt operator*(const ModInt &p) { return ModInt(*this) *= p; }
constexpr ModInt operator/(const ModInt &p) { return ModInt(*this) /= p; }
constexpr bool operator==(const ModInt &p) { return x == p.x; }
constexpr bool operator!=(const ModInt &p) { return x != p.x; }
constexpr ModInt inverse() const {
ll 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);
}
constexpr ModInt pow(ll n) {
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) {
ll t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
};
using mint = ModInt<MOD>;
using vm = vector<mint>;
using vvm = vector<vm>;
constexpr int MAX_FAC = 200010;
mint fac[MAX_FAC], facinv[MAX_FAC];
void combInit() {
fac[0] = mint(1);
for (int i = 0; i < MAX_FAC - 1; i++) {
fac[i + 1] = fac[i] * (i + 1);
}
facinv[MAX_FAC - 1] = fac[MAX_FAC - 1].inverse();
for (int i = MAX_FAC - 2; i >= 0; i--) {
facinv[i] = facinv[i + 1] * (i + 1);
}
}
mint comb(const ll a, const ll b) {
assert(a < MAX_FAC);
assert(b < MAX_FAC);
if (a < 0 || b < 0 || b > a) {
return mint(0);
}
mint ret(1);
ret *= fac[a];
ret *= facinv[b];
ret *= facinv[a - b];
return ret;
}
mint multicomb(const ll a, const ll b) { return comb(a + b - 1, b); }
void Pr(bool f) {
cout << (f ? "Yes" : "No") << "\n";
exit(0);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll k;
cin >> k;
string s;
cin >> s;
ll n = SZ(s);
mint ans = 0;
combInit();
rep(i, k + 1) {
ans += mint(25).pow(i) * mint(26).pow(k - i) * comb(i + n - 1, n - 1);
}
print(ans);
}
| #pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T> using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T> constexpr bool chmax(S &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename S, typename T> constexpr bool chmin(S &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T> bool print_(const T &a) {
cout << a;
return true;
}
template <typename T> bool print_(const vector<T> &vec) {
for (auto &a : vec) {
cout << a;
if (&a != &vec.back()) {
cout << " ";
}
}
return false;
}
template <typename T> bool print_(const vector<vector<T>> &vv) {
for (auto &v : vv) {
for (auto &a : v) {
cout << a;
if (&a != &v.back()) {
cout << " ";
}
}
if (&v != &vv.back()) {
cout << "\n";
}
}
return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&...tail) {
bool f = print_(head);
if (sizeof...(tail) != 0) {
cout << (f ? " " : "\n");
}
print(forward<Tail>(tail)...);
}
#pragma endregion
// ModInt
// 参考：https://ei1333.github.io/luzhiled/snippets/math/mod-int.html
// modはコンパイル時に決定
template <ll mod> struct ModInt {
ll x;
ModInt() : x(0) {}
ModInt(ll y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
constexpr ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
constexpr ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
constexpr ModInt &operator*=(const ModInt &p) {
x = x * p.x % mod;
return *this;
}
constexpr ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
constexpr ModInt operator-() { return ModInt(-x); }
constexpr ModInt operator+(const ModInt &p) { return ModInt(*this) += p; }
constexpr ModInt operator-(const ModInt &p) { return ModInt(*this) -= p; }
constexpr ModInt operator*(const ModInt &p) { return ModInt(*this) *= p; }
constexpr ModInt operator/(const ModInt &p) { return ModInt(*this) /= p; }
constexpr bool operator==(const ModInt &p) { return x == p.x; }
constexpr bool operator!=(const ModInt &p) { return x != p.x; }
constexpr ModInt inverse() const {
ll 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);
}
constexpr ModInt pow(ll n) {
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) {
ll t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
};
using mint = ModInt<MOD>;
using vm = vector<mint>;
using vvm = vector<vm>;
constexpr int MAX_FAC = 2000010;
mint fac[MAX_FAC], facinv[MAX_FAC];
void combInit() {
fac[0] = mint(1);
for (int i = 0; i < MAX_FAC - 1; i++) {
fac[i + 1] = fac[i] * (i + 1);
}
facinv[MAX_FAC - 1] = fac[MAX_FAC - 1].inverse();
for (int i = MAX_FAC - 2; i >= 0; i--) {
facinv[i] = facinv[i + 1] * (i + 1);
}
}
mint comb(const ll a, const ll b) {
assert(a < MAX_FAC);
assert(b < MAX_FAC);
if (a < 0 || b < 0 || b > a) {
return mint(0);
}
mint ret(1);
ret *= fac[a];
ret *= facinv[b];
ret *= facinv[a - b];
return ret;
}
mint multicomb(const ll a, const ll b) { return comb(a + b - 1, b); }
void Pr(bool f) {
cout << (f ? "Yes" : "No") << "\n";
exit(0);
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
ll k;
cin >> k;
string s;
cin >> s;
ll n = SZ(s);
mint ans = 0;
combInit();
rep(i, k + 1) {
ans += mint(25).pow(i) * mint(26).pow(k - i) * comb(i + n - 1, n - 1);
}
print(ans);
}
| replace | 156 | 157 | 156 | 157 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
const int MOD = 1e9 + 7;
const int MAXR = 1010000;
template <ll mod> class modint {
public:
ll val = 0;
// コンストラクタ
modint(ll x = 0) {
while (x < 0)
x += mod;
val = x % mod;
}
// コピーコンストラクタ
modint(const modint &r) { val = r.val; }
// 算術演算子
modint operator-() { return modint(-val); } // 単項
modint operator+(const modint &r) { return modint(*this) += r; }
modint operator-(const modint &r) { return modint(*this) -= r; }
modint operator*(const modint &r) { return modint(*this) *= r; }
modint operator/(const modint &r) { return modint(*this) /= r; }
// 代入演算子
modint &operator+=(const modint &r) {
val += r.val;
if (val >= mod)
val -= mod;
return *this;
}
modint &operator-=(const modint &r) {
if (val < r.val)
val += mod;
val -= r.val;
return *this;
}
modint &operator*=(const modint &r) {
val = val * r.val % mod;
return *this;
}
modint &operator/=(const modint &r) {
ll a = r.val, b = mod, u = 1, v = 0;
while (b) {
ll 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;
}
// 等価比較演算子
bool operator==(const modint &r) { return this->val == r.val; }
bool operator<(const modint &r) { return this->val < r.val; }
bool operator!=(const modint &r) { return this->val != r.val; }
};
using mint = modint<MOD>;
// 入出力ストリーム
istream &operator>>(istream &is, mint &x) { // xにconst付けない
ll t;
is >> t;
x = t;
return (is);
}
ostream &operator<<(ostream &os, const mint &x) { return os << x.val; }
// 累乗
mint modpow(const mint &a, ll n) {
if (n == 0)
return 1;
mint t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
// 二項係数の計算
mint fac[MAXR + 1], finv[MAXR + 1], inv[MAXR + 1];
// テーブルの作成
void com_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, MAXR) {
fac[i] = fac[i - 1] * mint(i);
inv[i] = -inv[MOD % i] * mint(MOD / i);
finv[i] = finv[i - 1] * inv[i];
}
}
// 演算部分
mint com(ll n, ll k) {
if (n < k)
return 0;
if (n < 0)
return 0;
if (k == 0)
return 1;
return fac[n] * finv[k] * finv[n - k];
}
int main() {
com_init();
int K;
cin >> K;
string S;
cin >> S;
int s = S.size();
mint ans = 0;
REP(x, K + 1) {
ans += com(s - 1 + x, s - 1) * modpow(25, x) * modpow(26, K - x);
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(obj) (obj).begin(), (obj).end()
#define INF 1e9
typedef long long ll;
const int MOD = 1e9 + 7;
const int MAXR = 3010000;
template <ll mod> class modint {
public:
ll val = 0;
// コンストラクタ
modint(ll x = 0) {
while (x < 0)
x += mod;
val = x % mod;
}
// コピーコンストラクタ
modint(const modint &r) { val = r.val; }
// 算術演算子
modint operator-() { return modint(-val); } // 単項
modint operator+(const modint &r) { return modint(*this) += r; }
modint operator-(const modint &r) { return modint(*this) -= r; }
modint operator*(const modint &r) { return modint(*this) *= r; }
modint operator/(const modint &r) { return modint(*this) /= r; }
// 代入演算子
modint &operator+=(const modint &r) {
val += r.val;
if (val >= mod)
val -= mod;
return *this;
}
modint &operator-=(const modint &r) {
if (val < r.val)
val += mod;
val -= r.val;
return *this;
}
modint &operator*=(const modint &r) {
val = val * r.val % mod;
return *this;
}
modint &operator/=(const modint &r) {
ll a = r.val, b = mod, u = 1, v = 0;
while (b) {
ll 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;
}
// 等価比較演算子
bool operator==(const modint &r) { return this->val == r.val; }
bool operator<(const modint &r) { return this->val < r.val; }
bool operator!=(const modint &r) { return this->val != r.val; }
};
using mint = modint<MOD>;
// 入出力ストリーム
istream &operator>>(istream &is, mint &x) { // xにconst付けない
ll t;
is >> t;
x = t;
return (is);
}
ostream &operator<<(ostream &os, const mint &x) { return os << x.val; }
// 累乗
mint modpow(const mint &a, ll n) {
if (n == 0)
return 1;
mint t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
// 二項係数の計算
mint fac[MAXR + 1], finv[MAXR + 1], inv[MAXR + 1];
// テーブルの作成
void com_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, MAXR) {
fac[i] = fac[i - 1] * mint(i);
inv[i] = -inv[MOD % i] * mint(MOD / i);
finv[i] = finv[i - 1] * inv[i];
}
}
// 演算部分
mint com(ll n, ll k) {
if (n < k)
return 0;
if (n < 0)
return 0;
if (k == 0)
return 1;
return fac[n] * finv[k] * finv[n - k];
}
int main() {
com_init();
int K;
cin >> K;
string S;
cin >> S;
int s = S.size();
mint ans = 0;
REP(x, K + 1) {
ans += com(s - 1 + x, s - 1) * modpow(25, x) * modpow(26, K - x);
}
cout << ans << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
/* template */
using ll = long long;
void debug_out() { std::cout << std::endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) \
cout << "debug: "; \
debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)
#define Rep(i, a, n) for (long long i = (long long)(a); i < (long long)(n); i++)
#define RRep(i, a, n) \
for (long long i = ((long long)(n - 1ll)); i >= (long long)(a); i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> vec) {
for (std::size_t i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
struct Edge {
int to;
ll weight;
Edge(int t, ll w) : to(t), weight(w) {}
};
struct edge {
int from;
int to;
ll weight;
edge(int f, int t, ll w) : from(f), to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
using edges = vector<edge>;
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;
}
template <class T> T lcm(T a, T b) { return (a * b) / gcd(a, b); }
ll ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
constexpr ll LNF = 1LL << 50;
constexpr int INF = 1e9 + 7;
const long double PI = 3.14159265358979323846;
vector<int> dx = {1, 0, -1, 1, -1, 0};
vector<int> dy = {1, 1, 1, 0, 0, -1};
/* template */
constexpr ll 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 { 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; }
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
// modintに依存
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(900005);
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
mint ans = 0;
Rep(i, 0, k + 1) {
mint a = mod_pow(25, k - i, mod);
a *= mod_pow(26, i, mod);
a *= comb(n + k - i - 1, n - 1);
ans += a;
}
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdlib>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string.h>
#include <string>
#include <utility>
#include <vector>
using namespace std;
/* template */
using ll = long long;
void debug_out() { std::cout << std::endl; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) {
cout << H << " ";
debug_out(T...);
}
#ifdef LOCAL
#define debug(...) \
cout << "debug: "; \
debug_out(__VA_ARGS__)
#else
#define debug(...)
#endif
#define rep(i, a, n) for (int i = (int)(a); i < (int)(n); i++)
#define rrep(i, a, n) for (int i = ((int)(n - 1)); i >= (int)(a); i--)
#define Rep(i, a, n) for (long long i = (long long)(a); i < (long long)(n); i++)
#define RRep(i, a, n) \
for (long long i = ((long long)(n - 1ll)); i >= (long long)(a); i--)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
template <typename T>
std::ostream &operator<<(std::ostream &os, std::vector<T> vec) {
for (std::size_t i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
struct Edge {
int to;
ll weight;
Edge(int t, ll w) : to(t), weight(w) {}
};
struct edge {
int from;
int to;
ll weight;
edge(int f, int t, ll w) : from(f), to(t), weight(w) {}
};
using Graph = vector<vector<Edge>>;
using graph = vector<vector<int>>;
using edges = vector<edge>;
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;
}
template <class T> T lcm(T a, T b) { return (a * b) / gcd(a, b); }
ll ctoi(char c) {
switch (c) {
case '0':
return 0;
case '1':
return 1;
case '2':
return 2;
case '3':
return 3;
case '4':
return 4;
case '5':
return 5;
case '6':
return 6;
case '7':
return 7;
case '8':
return 8;
case '9':
return 9;
default:
return 0;
}
}
constexpr ll LNF = 1LL << 50;
constexpr int INF = 1e9 + 7;
const long double PI = 3.14159265358979323846;
vector<int> dx = {1, 0, -1, 1, -1, 0};
vector<int> dy = {1, 1, 1, 0, 0, -1};
/* template */
constexpr ll 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 { 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; }
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
// modintに依存
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(5000005);
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
mint ans = 0;
Rep(i, 0, k + 1) {
mint a = mod_pow(25, k - i, mod);
a *= mod_pow(26, i, mod);
a *= comb(n + k - i - 1, n - 1);
ans += a;
}
cout << ans << endl;
}
| replace | 198 | 199 | 198 | 199 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll mpower(ll a, ll b, ll c) {
int z;
if (b == 0) {
z = 1;
z %= c;
return z;
}
if (b == 1) {
z = a;
z %= c;
return z;
} else {
return (((mpower(a, b / 2, c)) * (mpower(a, b / 2, c)) % c) *
mpower(a, b % 2, c) % c);
}
}
const int MAX = 1100000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
ll mod = 1e9 + 7;
int k;
string S;
cin >> k >> S;
int s = S.size();
ll ans = mpower(26, s + k, mod);
ll ansb = 0;
for (ll i = 0; i < s; i++) {
ansb += mpower(25, s + k - i, mod) * COM(s + k, i);
ansb %= mod;
}
ans -= ansb;
while (ans < 0) {
ans += mod;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
using namespace std;
ll mpower(ll a, ll b, ll c) {
int z;
if (b == 0) {
z = 1;
z %= c;
return z;
}
if (b == 1) {
z = a;
z %= c;
return z;
} else {
return (((mpower(a, b / 2, c)) * (mpower(a, b / 2, c)) % c) *
mpower(a, b % 2, c) % c);
}
}
const int MAX = 2100000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
COMinit();
ll mod = 1e9 + 7;
int k;
string S;
cin >> k >> S;
int s = S.size();
ll ans = mpower(26, s + k, mod);
ll ansb = 0;
for (ll i = 0; i < s; i++) {
ansb += mpower(25, s + k - i, mod) * COM(s + k, i);
ansb %= mod;
}
ans -= ansb;
while (ans < 0) {
ans += mod;
}
cout << ans << endl;
} | replace | 21 | 22 | 21 | 22 | 0 | |
p02632 | C++ | Runtime Error | #pragma GCC target("avx")
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define LD long double
#define ST string
#define BS bitset
#define PA pair<LL, LL>
#define VE vector
#define VL vector<LL>
#define VP vector<pair<LL, LL>>
#define VVL vector<vector<LL>>
#define PQ priority_queue
#define PQS priority_queue<LL, vector<LL>, greater<LL>>
#define PB push_back
#define POB pop_back
#define PF push_front
#define POF pop_front
#define EB emplace_back
#define MP make_pair
#define TS to_string
#define TU to_ullong
#define BPL __builtin_popcountll
#define FOR(i, a, n) for (i = a; i < n; ++i)
#define FORR(i, a, n) for (i = n - 1; i >= a; --i)
#define rep(i, n) FOR(i, 0, n)
#define repr(i, n) FORR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define SORT(a) sort(ALL(a))
#define REV(a) reverse(ALL(a))
#define UB(a, n) *upper_bound(ALL(a), n)
#define UBn(a, n) upper_bound(ALL(a), n) - a.begin()
#define LB(a, n) *lower_bound(ALL(a), n)
#define LBn(a, n) lower_bound(ALL(a), n) - a.begin()
#define INF 1145141919810364364LL
#define PI 3.14159265358979
#define MOD 1000000007
// #define MOD 998244353
#define ERR 0.00000001
#define FAST \
cin.tie(0); \
ios::sync_with_stdio(false)
void Yn(LL a) {
if (a)
printf("Yes\n");
else
printf("No\n");
}
void YN(LL a) {
if (a)
printf("YES\n");
else
printf("NO\n");
}
LL pwmn(LL a, LL n) {
LL ans = 1;
while (ans < a)
ans *= n;
return ans;
}
LL dig(LL n) {
LL ret = 0;
while (n)
n /= 10, ret++;
return ret;
}
LL GCD(LL a, LL b) {
LL c = 1, tmp = max(a, b);
b = min(a, b);
a = tmp;
while (c != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
LL LCM(LL a, LL b) { return a * b / GCD(a, b); }
int lcmp(const void *a, const void *b) {
if (*(LL *)a > *(LL *)b)
return 1;
if (*(LL *)a < *(LL *)b)
return -1;
return 0;
}
int lcmpr(const void *a, const void *b) {
if (*(LL *)a > *(LL *)b)
return -1;
if (*(LL *)a < *(LL *)b)
return 1;
return 0;
}
int ccmp(const void *a, const void *b) { return *(char *)a - *(char *)b; }
int ccmpr(const void *a, const void *b) { return *(char *)b - *(char *)a; }
int scmp(const void *a, const void *b) { return strcmp((char *)a, (char *)b); }
int scmpr(const void *a, const void *b) { return strcmp((char *)b, (char *)a); }
LL cmod(LL a, LL m) {
if (a % m < 0)
return a % m + abs(m);
else
return a % m;
}
LL DIV(LL a, LL d, LL m) {
LL l = m, x = 1, y = 0, k;
while (l) {
k = d / l;
d -= k * l;
swap(l, d);
x -= k * y;
swap(x, y);
}
return cmod(a * cmod(x, m), m);
}
LL POW(LL a, LL n, LL m) {
LL ans = 1;
while (n > 0) {
if (n & 1)
ans = ans * a % m;
a = a * a % m;
n >>= 1;
}
return ans;
}
VL fact, finv, inv;
void comi(LL n) {
LL i;
fact.resize(max(2LL, n + 1));
finv.resize(max(2LL, n + 1));
inv.resize(max(2LL, n + 1));
fact[0] = fact[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, n + 1) {
fact[i] = fact[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
LL com(LL n, LL k) {
if (n < k || n < 0 || k < 0)
return 0;
return fact[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool cmps(pair<LL, LL> a, pair<LL, LL> b) {
if (a.second != b.second)
return a.second < b.second;
return a.first < b.first;
}
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 (a > b) {
a = b;
return true;
}
return false;
}
#define MI modint<MOD>
template <int mod> struct modint {
int x;
modint() : x(0) {}
modint(LL n) : x(n >= 0 ? n % mod : (mod - (-n) % mod) % mod) {}
modint &operator+=(const modint &n) {
if ((x += n.x) >= mod)
x -= mod;
return *this;
}
modint &operator-=(const modint &n) {
if ((x += mod - n.x) >= mod)
x -= mod;
return *this;
}
modint &operator++() {
*this += 1;
return *this;
}
modint &operator--() {
*this -= 1;
return *this;
}
modint &operator*=(const modint &n) {
x = (int)((LL)x * n.x % mod);
return *this;
}
modint &operator/=(const modint &n) {
*this *= n.inv();
return *this;
}
modint operator-() const { return modint(-x); }
modint operator+(const modint &n) const { return modint(*this) += n; }
modint operator-(const modint &n) const { return modint(*this) -= n; }
modint operator++(int) {
modint ret(*this);
*this += 1;
return ret;
}
modint operator--(int) {
modint ret(*this);
*this -= 1;
return ret;
}
modint operator*(const modint &n) const { return modint(*this) *= n; }
modint operator/(const modint &n) const { return modint(*this) /= n; }
bool operator<(const modint &n) const { return x < n.x; }
bool operator>(const modint &n) const { return x > n.x; }
bool operator<=(const modint &n) const { return x <= n.x; }
bool operator>=(const modint &n) const { return x >= n.x; }
bool operator!=(const modint &n) const { return x != n.x; }
bool operator==(const modint &n) const { return x == n.x; }
friend istream &operator>>(istream &is, modint &n) {
LL l;
is >> l;
n = modint<mod>(l);
return is;
}
friend ostream &operator<<(ostream &os, const modint &n) { return os << n.x; }
int getmod() { return mod; }
modint inv() const {
int a = x, b = mod, c = 1, d = 0, n;
while (b) {
n = a / b;
swap(a -= n * b, b);
swap(c -= n * d, d);
}
return modint(c);
}
modint pow(LL n) const {
modint ret(1), m(x);
while (n) {
if (n & 1)
ret *= m;
m *= m;
n >>= 1;
}
return ret;
}
};
int main() {
FAST;
LL K, i, j, n;
ST S;
cin >> K >> S;
comi(200005);
MI ans;
n = S.size();
rep(i, K + 1) {
ans += (MI)com(K + n - i - 1, n - 1) * (MI)POW(26, i, MOD) *
(MI)POW(25, K - i, MOD);
}
cout << ans << endl;
}
| #pragma GCC target("avx")
// #pragma GCC target("avx512f,avx512dq,avx512cd,avx512bw,avx512vl")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define DB double
#define LD long double
#define ST string
#define BS bitset
#define PA pair<LL, LL>
#define VE vector
#define VL vector<LL>
#define VP vector<pair<LL, LL>>
#define VVL vector<vector<LL>>
#define PQ priority_queue
#define PQS priority_queue<LL, vector<LL>, greater<LL>>
#define PB push_back
#define POB pop_back
#define PF push_front
#define POF pop_front
#define EB emplace_back
#define MP make_pair
#define TS to_string
#define TU to_ullong
#define BPL __builtin_popcountll
#define FOR(i, a, n) for (i = a; i < n; ++i)
#define FORR(i, a, n) for (i = n - 1; i >= a; --i)
#define rep(i, n) FOR(i, 0, n)
#define repr(i, n) FORR(i, 0, n)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define SORT(a) sort(ALL(a))
#define REV(a) reverse(ALL(a))
#define UB(a, n) *upper_bound(ALL(a), n)
#define UBn(a, n) upper_bound(ALL(a), n) - a.begin()
#define LB(a, n) *lower_bound(ALL(a), n)
#define LBn(a, n) lower_bound(ALL(a), n) - a.begin()
#define INF 1145141919810364364LL
#define PI 3.14159265358979
#define MOD 1000000007
// #define MOD 998244353
#define ERR 0.00000001
#define FAST \
cin.tie(0); \
ios::sync_with_stdio(false)
void Yn(LL a) {
if (a)
printf("Yes\n");
else
printf("No\n");
}
void YN(LL a) {
if (a)
printf("YES\n");
else
printf("NO\n");
}
LL pwmn(LL a, LL n) {
LL ans = 1;
while (ans < a)
ans *= n;
return ans;
}
LL dig(LL n) {
LL ret = 0;
while (n)
n /= 10, ret++;
return ret;
}
LL GCD(LL a, LL b) {
LL c = 1, tmp = max(a, b);
b = min(a, b);
a = tmp;
while (c != 0) {
c = a % b;
a = b;
b = c;
}
return a;
}
LL LCM(LL a, LL b) { return a * b / GCD(a, b); }
int lcmp(const void *a, const void *b) {
if (*(LL *)a > *(LL *)b)
return 1;
if (*(LL *)a < *(LL *)b)
return -1;
return 0;
}
int lcmpr(const void *a, const void *b) {
if (*(LL *)a > *(LL *)b)
return -1;
if (*(LL *)a < *(LL *)b)
return 1;
return 0;
}
int ccmp(const void *a, const void *b) { return *(char *)a - *(char *)b; }
int ccmpr(const void *a, const void *b) { return *(char *)b - *(char *)a; }
int scmp(const void *a, const void *b) { return strcmp((char *)a, (char *)b); }
int scmpr(const void *a, const void *b) { return strcmp((char *)b, (char *)a); }
LL cmod(LL a, LL m) {
if (a % m < 0)
return a % m + abs(m);
else
return a % m;
}
LL DIV(LL a, LL d, LL m) {
LL l = m, x = 1, y = 0, k;
while (l) {
k = d / l;
d -= k * l;
swap(l, d);
x -= k * y;
swap(x, y);
}
return cmod(a * cmod(x, m), m);
}
LL POW(LL a, LL n, LL m) {
LL ans = 1;
while (n > 0) {
if (n & 1)
ans = ans * a % m;
a = a * a % m;
n >>= 1;
}
return ans;
}
VL fact, finv, inv;
void comi(LL n) {
LL i;
fact.resize(max(2LL, n + 1));
finv.resize(max(2LL, n + 1));
inv.resize(max(2LL, n + 1));
fact[0] = fact[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, n + 1) {
fact[i] = fact[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
LL com(LL n, LL k) {
if (n < k || n < 0 || k < 0)
return 0;
return fact[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
bool cmps(pair<LL, LL> a, pair<LL, LL> b) {
if (a.second != b.second)
return a.second < b.second;
return a.first < b.first;
}
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 (a > b) {
a = b;
return true;
}
return false;
}
#define MI modint<MOD>
template <int mod> struct modint {
int x;
modint() : x(0) {}
modint(LL n) : x(n >= 0 ? n % mod : (mod - (-n) % mod) % mod) {}
modint &operator+=(const modint &n) {
if ((x += n.x) >= mod)
x -= mod;
return *this;
}
modint &operator-=(const modint &n) {
if ((x += mod - n.x) >= mod)
x -= mod;
return *this;
}
modint &operator++() {
*this += 1;
return *this;
}
modint &operator--() {
*this -= 1;
return *this;
}
modint &operator*=(const modint &n) {
x = (int)((LL)x * n.x % mod);
return *this;
}
modint &operator/=(const modint &n) {
*this *= n.inv();
return *this;
}
modint operator-() const { return modint(-x); }
modint operator+(const modint &n) const { return modint(*this) += n; }
modint operator-(const modint &n) const { return modint(*this) -= n; }
modint operator++(int) {
modint ret(*this);
*this += 1;
return ret;
}
modint operator--(int) {
modint ret(*this);
*this -= 1;
return ret;
}
modint operator*(const modint &n) const { return modint(*this) *= n; }
modint operator/(const modint &n) const { return modint(*this) /= n; }
bool operator<(const modint &n) const { return x < n.x; }
bool operator>(const modint &n) const { return x > n.x; }
bool operator<=(const modint &n) const { return x <= n.x; }
bool operator>=(const modint &n) const { return x >= n.x; }
bool operator!=(const modint &n) const { return x != n.x; }
bool operator==(const modint &n) const { return x == n.x; }
friend istream &operator>>(istream &is, modint &n) {
LL l;
is >> l;
n = modint<mod>(l);
return is;
}
friend ostream &operator<<(ostream &os, const modint &n) { return os << n.x; }
int getmod() { return mod; }
modint inv() const {
int a = x, b = mod, c = 1, d = 0, n;
while (b) {
n = a / b;
swap(a -= n * b, b);
swap(c -= n * d, d);
}
return modint(c);
}
modint pow(LL n) const {
modint ret(1), m(x);
while (n) {
if (n & 1)
ret *= m;
m *= m;
n >>= 1;
}
return ret;
}
};
int main() {
FAST;
LL K, i, j, n;
ST S;
cin >> K >> S;
comi(2000005);
MI ans;
n = S.size();
rep(i, K + 1) {
ans += (MI)com(K + n - i - 1, n - 1) * (MI)POW(26, i, MOD) *
(MI)POW(25, K - i, MOD);
}
cout << ans << endl;
}
| replace | 255 | 256 | 255 | 256 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MAX = 1000005;
ll mod = 1000000007;
ll fac[MAX];
ll finv[MAX];
ll inv[MAX];
// 階乗、逆階乗のテーブル作成
void conInit() {
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;
}
}
// nCk mod
ll con(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;
}
// a^n mod を計算する
ll modPow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
conInit();
ll K;
string S;
ll sum = 0;
cin >> K;
cin >> S;
ll sNum = S.size();
for (int i = 0; i <= K; i++) {
ll sumsub = (modPow(25, i) % mod * modPow(26, K - i) % mod) % mod;
ll r = sNum - 1;
ll n = i + r;
sumsub *= con(n, r) % mod;
sum += sumsub % mod;
}
cout << sum % mod << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MAX = 2000005;
ll mod = 1000000007;
ll fac[MAX];
ll finv[MAX];
ll inv[MAX];
// 階乗、逆階乗のテーブル作成
void conInit() {
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;
}
}
// nCk mod
ll con(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;
}
// a^n mod を計算する
ll modPow(ll a, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
conInit();
ll K;
string S;
ll sum = 0;
cin >> K;
cin >> S;
ll sNum = S.size();
for (int i = 0; i <= K; i++) {
ll sumsub = (modPow(25, i) % mod * modPow(26, K - i) % mod) % mod;
ll r = sNum - 1;
ll n = i + r;
sumsub *= con(n, r) % mod;
sum += sumsub % mod;
}
cout << sum % mod << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7ll;
long long modpower(long long a, long long b) {
if (b == 0)
return 1ll;
long long x = modpower(a, b / 2ll);
x = (x * x) % mod;
if (b & 1)
return (x * a) % mod;
return (x % mod);
}
struct combination {
vector<long long> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1ll;
inv[0] = 1ll;
for (long long i = 1; i <= sz; ++i)
fact[i] = (fact[i - 1] * i) % mod;
inv[sz] = modpower(fact[sz], mod - 2ll);
for (long long i = sz - 1; i >= 1; --i)
inv[i] = (inv[i + 1] * (i + 1)) % mod;
}
long long choose(int n, int k) const {
if (k < 0 || n < k)
return 0;
return ((((fact[n] * inv[k]) % mod) * inv[n - k]) % mod);
}
};
const int MAX = 1e6 + 10;
combination comb(MAX);
int n, m;
string s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
cin >> s;
m = s.size();
n += m;
long long ans = 0ll;
for (int i = m; i <= n; ++i) {
long long x = modpower(26, n - i);
long long a = comb.choose(i - 1, m - 1);
long long y = (a * modpower(25, i - m)) % mod;
x = (x * y) % mod;
ans = (ans + x) % mod;
}
return cout << ans << "\n", 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7ll;
long long modpower(long long a, long long b) {
if (b == 0)
return 1ll;
long long x = modpower(a, b / 2ll);
x = (x * x) % mod;
if (b & 1)
return (x * a) % mod;
return (x % mod);
}
struct combination {
vector<long long> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1ll;
inv[0] = 1ll;
for (long long i = 1; i <= sz; ++i)
fact[i] = (fact[i - 1] * i) % mod;
inv[sz] = modpower(fact[sz], mod - 2ll);
for (long long i = sz - 1; i >= 1; --i)
inv[i] = (inv[i + 1] * (i + 1)) % mod;
}
long long choose(int n, int k) const {
if (k < 0 || n < k)
return 0;
return ((((fact[n] * inv[k]) % mod) * inv[n - k]) % mod);
}
};
const int MAX = 2e6 + 10;
combination comb(MAX);
int n, m;
string s;
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n;
cin >> s;
m = s.size();
n += m;
long long ans = 0ll;
for (int i = m; i <= n; ++i) {
long long x = modpower(26, n - i);
long long a = comb.choose(i - 1, m - 1);
long long y = (a * modpower(25, i - m)) % mod;
x = (x * y) % mod;
ans = (ans + x) % mod;
}
return cout << ans << "\n", 0;
} | replace | 34 | 35 | 34 | 35 | 0 | |
p02632 | C++ | Runtime Error | #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;
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// order_of_key(val): returns the number of values less than val
// find_by_order(k): returns an iterator to the kth largest element (0-based)
const ll nax = 1e6;
ll fact[nax + 1];
ll mod = 1e9 + 7;
ll power(ll x, ll y) {
ll ans = 1;
while (y) {
if (y & 1) {
ans = (ans * x) % mod;
}
y /= 2;
x = (x * x) % mod;
}
return ans;
}
ll modinverse(ll x) { return power(x, mod - 2); }
ll combi(ll n, ll r) {
return (fact[n] * modinverse((fact[r] * fact[n - r]) % mod)) % mod;
}
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll k, i;
string s;
cin >> k >> s;
fact[0] = 1;
for (i = 1; i < nax + 1; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
ll tot = power(26, k + s.length());
for (i = 0; i < s.length(); i++) {
tot = ((tot - combi(k + s.length(), i) * power(25, k + s.length() - i)) %
mod +
mod) %
mod;
}
cout << tot << "\n";
} | #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;
#define ll long long int
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define all(a) a.begin(), a.end()
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
// order_of_key(val): returns the number of values less than val
// find_by_order(k): returns an iterator to the kth largest element (0-based)
const ll nax = 3e6;
ll fact[nax + 1];
ll mod = 1e9 + 7;
ll power(ll x, ll y) {
ll ans = 1;
while (y) {
if (y & 1) {
ans = (ans * x) % mod;
}
y /= 2;
x = (x * x) % mod;
}
return ans;
}
ll modinverse(ll x) { return power(x, mod - 2); }
ll combi(ll n, ll r) {
return (fact[n] * modinverse((fact[r] * fact[n - r]) % mod)) % mod;
}
int main(void) {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll k, i;
string s;
cin >> k >> s;
fact[0] = 1;
for (i = 1; i < nax + 1; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
ll tot = power(26, k + s.length());
for (i = 0; i < s.length(); i++) {
tot = ((tot - combi(k + s.length(), i) * power(25, k + s.length() - i)) %
mod +
mod) %
mod;
}
cout << tot << "\n";
} | replace | 19 | 20 | 19 | 20 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 10;
const ll mod = 1e9 + 7;
ll fac[maxn], inv[maxn], facinv[maxn], bin25[maxn], bin26[maxn];
void pre() {
fac[0] = 1;
for (int i = 1; i < maxn; ++i)
fac[i] = fac[i - 1] * i % mod;
inv[1] = 1;
for (int i = 2; i < maxn; ++i)
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
facinv[0] = 1;
for (int i = 1; i < maxn; ++i)
facinv[i] = facinv[i - 1] * inv[i] % mod;
bin25[0] = 1;
for (int i = 1; i < maxn; ++i)
bin25[i] = bin25[i - 1] * 25 % mod;
bin26[0] = 1;
for (int i = 1; i < maxn; ++i)
bin26[i] = bin26[i - 1] * 26 % mod;
}
ll C(int n, int m) {
return n < m ? 0 : fac[n] * facinv[m] % mod * facinv[n - m] % mod;
}
ll ans;
int main() {
int k;
string s;
cin >> k >> s;
int n = s.length();
int m = k + n;
pre();
for (int i = 0; i <= k; ++i)
ans = (ans + bin26[i] * C(m - i - 1, n - 1) % mod * bin25[m - i - n]) % mod;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 2e6 + 10;
const ll mod = 1e9 + 7;
ll fac[maxn], inv[maxn], facinv[maxn], bin25[maxn], bin26[maxn];
void pre() {
fac[0] = 1;
for (int i = 1; i < maxn; ++i)
fac[i] = fac[i - 1] * i % mod;
inv[1] = 1;
for (int i = 2; i < maxn; ++i)
inv[i] = (mod - mod / i) * inv[mod % i] % mod;
facinv[0] = 1;
for (int i = 1; i < maxn; ++i)
facinv[i] = facinv[i - 1] * inv[i] % mod;
bin25[0] = 1;
for (int i = 1; i < maxn; ++i)
bin25[i] = bin25[i - 1] * 25 % mod;
bin26[0] = 1;
for (int i = 1; i < maxn; ++i)
bin26[i] = bin26[i - 1] * 26 % mod;
}
ll C(int n, int m) {
return n < m ? 0 : fac[n] * facinv[m] % mod * facinv[n - m] % mod;
}
ll ans;
int main() {
int k;
string s;
cin >> k >> s;
int n = s.length();
int m = k + n;
pre();
for (int i = 0; i <= k; ++i)
ans = (ans + bin26[i] * C(m - i - 1, n - 1) % mod * bin25[m - i - n]) % mod;
cout << ans << endl;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02632 | 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;
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;
}
vector<ll> inv, fact, invfact;
void Mod_build(int n = 1010101) {
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;
}
int main() {
Mod_build();
ios::sync_with_stdio(false);
cin.tie(nullptr);
int i, j;
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll m = n + k;
ll ans = 0;
for (i = 0; i <= m; i++) {
ll sum = comb(m - i - 1, n - 1) * powmod(25, k - i);
sum %= mod;
sum *= powmod(26, i);
sum %= mod;
ans += sum;
ans %= mod;
}
cout << ans << 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;
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;
}
vector<ll> inv, fact, invfact;
void Mod_build(int n = 2010101) {
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;
}
int main() {
Mod_build();
ios::sync_with_stdio(false);
cin.tie(nullptr);
int i, j;
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll m = n + k;
ll ans = 0;
for (i = 0; i <= m; i++) {
ll sum = comb(m - i - 1, n - 1) * powmod(25, k - i);
sum %= mod;
sum *= powmod(26, i);
sum %= mod;
ans += sum;
ans %= mod;
}
cout << ans << endl;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define INF (1ll << 60)
#define mod 1000000007
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 MAX 1000100
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
// 二項係数計算
ll combi(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;
}
// mainに COMinit(); を入れる
ll modpow(ll x, ll n) {
ll ret = 1;
while (n > 0) {
if (n & 1)
ret = ret * x % mod; // n の最下位bitが 1 ならば x^(2^i) をかける
x = x * x % mod;
n >>= 1; // n を1bit 左にずらす
}
return ret;
}
int main() {
COMinit();
ll k;
string s;
cin >> k >> s;
ll n = s.size();
ll minus = 0, ans = modpow(26ll, n + k);
rep(i, n) {
minus += (combi(n + k, i) * modpow(25ll, n + k - i)) % mod;
minus %= mod;
}
ans -= minus;
if (ans < 0)
ans += mod;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < n; i++)
#define P pair<ll, ll>
#define Graph vector<vector<ll>>
#define INF (1ll << 60)
#define mod 1000000007
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 MAX 2000100
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
// 二項係数計算
ll combi(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;
}
// mainに COMinit(); を入れる
ll modpow(ll x, ll n) {
ll ret = 1;
while (n > 0) {
if (n & 1)
ret = ret * x % mod; // n の最下位bitが 1 ならば x^(2^i) をかける
x = x * x % mod;
n >>= 1; // n を1bit 左にずらす
}
return ret;
}
int main() {
COMinit();
ll k;
string s;
cin >> k >> s;
ll n = s.size();
ll minus = 0, ans = modpow(26ll, n + k);
rep(i, n) {
minus += (combi(n + k, i) * modpow(25ll, n + k - i)) % mod;
minus %= mod;
}
ans -= minus;
if (ans < 0)
ans += mod;
cout << ans << endl;
return 0;
} | replace | 23 | 24 | 23 | 24 | 0 | |
p02632 | C++ | Runtime Error | /* #region Head */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) \
for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) \
for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
template <typename T>
istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
for (T &x : vec)
is >> x;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
os << "{";
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T>
ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
is >> pair_var.first >> pair_var.second;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
if (++itrcp != map_var.end())
os << ", ";
}
return os << "}";
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
return out_iter(os, map_var);
}
template <typename T, typename U>
ostream &operator<<(ostream &os, um<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
auto [key, value] = *itr;
os << "(" << key << ", " << value << ")";
auto itrcp = itr;
if (++itrcp != map_var.end())
os << ", ";
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) {
return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
pq<T> pq_cp(pq_var);
os << "{";
if (!pq_cp.empty()) {
os << pq_cp.top(), pq_cp.pop();
while (!pq_cp.empty())
os << ", " << pq_cp.top(), pq_cp.pop();
}
return os << "}";
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(move(tail)...);
}
// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// ローカル用
#define DEBUG_
#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
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} ATCODER_INITIALIZE;
void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }
/* #endregion */
/* #region mint */
// 自動で MOD を取る整数
struct mint {
ll x;
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;
}
// O(log(t))
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1); // ⌊t/2⌋ 乗
a *= a; // ⌊t/2⌋*2 乗
if (t & 1) // ⌊t/2⌋*2 == t-1 のとき
a *= *this; // ⌊t/2⌋*2+1 乗 => t 乗
return a;
}
// for prime mod
mint inv() const {
return pow(MOD - 2); // オイラーの定理から， x^(-1) ≡ x^(p-2)
}
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
bool operator==(const mint a) const { return this->x == a.x; }
bool operator==(const ll a) const { return this->x == a; }
// mint 入力
friend istream &operator>>(istream &is, mint &x) {
is >> x.x;
return is;
}
// mint 出力
friend ostream &operator<<(ostream &os, mint x) {
os << x.x;
return os;
}
};
/* #endregion */
/* #region Comb1 */
// 二項係数計算用クラス．1 <= k <= n <= 1e7 程度用．
class Combinaion {
private:
/* テーブルの大きさの既定値．(MAX)! まで計算できる． */
static constexpr ll MAX = 1e6 + 11;
/* 実際のテーブルの大きさ． */
ll max;
/* 階乗を格納するテーブル．fac[n] := n! % MOD. */
vc<mint> fac;
/* 階乗の逆元を格納するテーブル．finv[n] := (fac[n])^(-1). */
vc<mint> finv;
/* 各種テーブルを初期化する． */
void init(int n) {
max = n;
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
REPM(i, 2, n) fac[i] = fac[i - 1] * i;
finv[n] = fac[n].inv();
REPR(i, n, 2) finv[i - 1] = finv[i] * i;
}
public:
/* コンストラクタ． */
Combinaion(int n = MAX) : fac(n + 1), finv(n + 1) { init(n); }
/* 二項係数 nCk % MOD を計算する． */
mint operator()(ll n, ll k) const {
assert(n <= max); // ここで詰まると RE
assert(k <= max);
if (n < k || n < 0 || k < 0)
return 0;
return fac[n] * finv[k] * finv[n - k];
}
mint perm(ll n, ll k) { return fac[n] * finv[n - k]; }
// 重複組み合わせ nHr % MOD を計算する
mint homogeneous(ll n, ll r) { return (*this)(n + r - 1, r); }
};
/* #endregion */
// Problem
void solve() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = SIZE(s);
Combinaion c;
// s[n-1] の最終位置は，[n-1, n+k) の区間内
mint ret = 0;
REP(i, n - 1, n + k) {
ret += c(i, n - 1) * mint(25).pow(i - (n - 1)) *
mint(26).pow(n + k - 1 - i); //
// dump(i, n + k, c(i, n - 1), mint(25).pow(i - (n - 1)), mint(26).pow(n + k
// - 1 - i));
}
cout << ret << endl;
}
// entry point
int main() {
solve();
return 0;
}
| /* #region Head */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) \
for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) \
for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define endl '\n'
#define sqrt sqrtl
#define floor floorl
#define log2 log2l
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
template <typename T>
istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
for (T &x : vec)
is >> x;
return is;
}
template <typename T>
ostream &operator<<(ostream &os, vc<T> &vec) { // vector 出力 (for dump)
os << "{";
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T>
ostream &operator>>(ostream &os, vc<T> &vec) { // vector 出力 (inline)
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
is >> pair_var.first >> pair_var.second;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) { // pair 出力
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, T &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
if (++itrcp != map_var.end())
os << ", ";
}
return os << "}";
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
return out_iter(os, map_var);
}
template <typename T, typename U>
ostream &operator<<(ostream &os, um<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
auto [key, value] = *itr;
os << "(" << key << ", " << value << ")";
auto itrcp = itr;
if (++itrcp != map_var.end())
os << ", ";
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &set_var) {
return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, us<T> &set_var) {
return out_iter(os, set_var);
}
template <typename T> ostream &operator<<(ostream &os, pq<T> &pq_var) {
pq<T> pq_cp(pq_var);
os << "{";
if (!pq_cp.empty()) {
os << pq_cp.top(), pq_cp.pop();
while (!pq_cp.empty())
os << ", " << pq_cp.top(), pq_cp.pop();
}
return os << "}";
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0)
DUMPOUT << ", ";
dump_func(move(tail)...);
}
// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>>
bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// ローカル用
#define DEBUG_
#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
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH)
cout << unitbuf;
}
} ATCODER_INITIALIZE;
void Yn(bool p) { cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { cout << (p ? "YES" : "NO") << endl; }
/* #endregion */
/* #region mint */
// 自動で MOD を取る整数
struct mint {
ll x;
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;
}
// O(log(t))
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1); // ⌊t/2⌋ 乗
a *= a; // ⌊t/2⌋*2 乗
if (t & 1) // ⌊t/2⌋*2 == t-1 のとき
a *= *this; // ⌊t/2⌋*2+1 乗 => t 乗
return a;
}
// for prime mod
mint inv() const {
return pow(MOD - 2); // オイラーの定理から， x^(-1) ≡ x^(p-2)
}
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
bool operator==(const mint a) const { return this->x == a.x; }
bool operator==(const ll a) const { return this->x == a; }
// mint 入力
friend istream &operator>>(istream &is, mint &x) {
is >> x.x;
return is;
}
// mint 出力
friend ostream &operator<<(ostream &os, mint x) {
os << x.x;
return os;
}
};
/* #endregion */
/* #region Comb1 */
// 二項係数計算用クラス．1 <= k <= n <= 1e7 程度用．
class Combinaion {
private:
/* テーブルの大きさの既定値．(MAX)! まで計算できる． */
static constexpr ll MAX = 2e6 + 11;
/* 実際のテーブルの大きさ． */
ll max;
/* 階乗を格納するテーブル．fac[n] := n! % MOD. */
vc<mint> fac;
/* 階乗の逆元を格納するテーブル．finv[n] := (fac[n])^(-1). */
vc<mint> finv;
/* 各種テーブルを初期化する． */
void init(int n) {
max = n;
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
REPM(i, 2, n) fac[i] = fac[i - 1] * i;
finv[n] = fac[n].inv();
REPR(i, n, 2) finv[i - 1] = finv[i] * i;
}
public:
/* コンストラクタ． */
Combinaion(int n = MAX) : fac(n + 1), finv(n + 1) { init(n); }
/* 二項係数 nCk % MOD を計算する． */
mint operator()(ll n, ll k) const {
assert(n <= max); // ここで詰まると RE
assert(k <= max);
if (n < k || n < 0 || k < 0)
return 0;
return fac[n] * finv[k] * finv[n - k];
}
mint perm(ll n, ll k) { return fac[n] * finv[n - k]; }
// 重複組み合わせ nHr % MOD を計算する
mint homogeneous(ll n, ll r) { return (*this)(n + r - 1, r); }
};
/* #endregion */
// Problem
void solve() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = SIZE(s);
Combinaion c;
// s[n-1] の最終位置は，[n-1, n+k) の区間内
mint ret = 0;
REP(i, n - 1, n + k) {
ret += c(i, n - 1) * mint(25).pow(i - (n - 1)) *
mint(26).pow(n + k - 1 - i); //
// dump(i, n + k, c(i, n - 1), mint(25).pow(i - (n - 1)), mint(26).pow(n + k
// - 1 - i));
}
cout << ret << endl;
}
// entry point
int main() {
solve();
return 0;
}
| replace | 260 | 261 | 260 | 261 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MAX = 1000005;
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;
}
int main() {
int k;
cin >> k;
string s;
cin >> s;
com_init();
int N = s.size();
ll ans = 0;
for (int i = 1; i <= (k + N); i++) {
if (N <= i) {
ans += ((comb(i - 1, N - 1) * mod_pow(25, i - N)) % MOD *
mod_pow(26, k + N - i)) %
MOD;
}
ans %= MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int MAX = 2000005;
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;
}
int main() {
int k;
cin >> k;
string s;
cin >> s;
com_init();
int N = s.size();
ll ans = 0;
for (int i = 1; i <= (k + N); i++) {
if (N <= i) {
ans += ((comb(i - 1, N - 1) * mod_pow(25, i - N)) % MOD *
mod_pow(26, k + N - i)) %
MOD;
}
ans %= MOD;
}
cout << ans << endl;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long N = 1e6 + 10;
long long fact[N];
template <typename T> void add_self(T &a, T b) {
a += b;
if (a > mod) {
a -= mod;
}
}
template <typename T> void substract_self(T &a, T b) {
a -= b;
if (a < 0) {
a += mod;
}
}
template <typename T> long long mul(T a, T b) { return (a * b) % mod; }
long long power(long long a, long long b) {
long long res = 1ll;
while (b) {
if (b & 1) {
res = (res * a) % mod;
}
a = (a * a) % mod;
b >>= 1;
}
return res;
}
long long modInverse(long long a) { return power(a, (long long)(mod - 2)); }
long long nCr(long long n, long long r) {
long long val =
mul(fact[n], mul(modInverse(fact[n - r]), modInverse(fact[r])));
return val;
}
int main() {
fact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
long long n, k;
cin >> k;
string s;
cin >> s;
n = s.length();
long long sol = power(26ll, n + k);
for (int i = 0; i < n; i++) {
long long val = mul(nCr(n + k, i), power(25ll, n + k - i));
substract_self(sol, val);
}
cout << sol;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long N = 2e6 + 10;
long long fact[N];
template <typename T> void add_self(T &a, T b) {
a += b;
if (a > mod) {
a -= mod;
}
}
template <typename T> void substract_self(T &a, T b) {
a -= b;
if (a < 0) {
a += mod;
}
}
template <typename T> long long mul(T a, T b) { return (a * b) % mod; }
long long power(long long a, long long b) {
long long res = 1ll;
while (b) {
if (b & 1) {
res = (res * a) % mod;
}
a = (a * a) % mod;
b >>= 1;
}
return res;
}
long long modInverse(long long a) { return power(a, (long long)(mod - 2)); }
long long nCr(long long n, long long r) {
long long val =
mul(fact[n], mul(modInverse(fact[n - r]), modInverse(fact[r])));
return val;
}
int main() {
fact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
long long n, k;
cin >> k;
string s;
cin >> s;
n = s.length();
long long sol = power(26ll, n + k);
for (int i = 0; i < n; i++) {
long long val = mul(nCr(n + k, i), power(25ll, n + k - i));
substract_self(sol, val);
}
cout << sol;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int M = 1e6 + 5;
const int mod = 1e9 + 7;
int k, ans, f[M], inv[M];
string s;
int power(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
b >>= 1;
a = (a * a) % mod;
}
return res % mod;
}
int modInv(int a) { return power(a, mod - 2); }
void precompute() {
f[0] = f[1] = 1;
for (int i = 2; i < M; i++)
f[i] = (f[i - 1] * i) % mod;
inv[M - 1] = modInv(f[M - 1]);
for (int i = M - 2; i >= 0; i--)
inv[i] = (inv[i + 1] * (i + 1)) % mod;
}
int nCr(int n, int r) {
if (n < r)
return 0;
int res = f[n];
res = (res * inv[r]) % mod;
res = (res * inv[n - r]) % mod;
return res % mod;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
precompute();
cin >> k >> s;
int n = s.size();
for (int i = 0; i <= k; i++) {
int cur = nCr(n + k, n + i);
cur = (cur * power(25, k - i)) % mod;
ans = (ans + cur) % mod;
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int M = 2e6 + 5;
const int mod = 1e9 + 7;
int k, ans, f[M], inv[M];
string s;
int power(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
b >>= 1;
a = (a * a) % mod;
}
return res % mod;
}
int modInv(int a) { return power(a, mod - 2); }
void precompute() {
f[0] = f[1] = 1;
for (int i = 2; i < M; i++)
f[i] = (f[i - 1] * i) % mod;
inv[M - 1] = modInv(f[M - 1]);
for (int i = M - 2; i >= 0; i--)
inv[i] = (inv[i + 1] * (i + 1)) % mod;
}
int nCr(int n, int r) {
if (n < r)
return 0;
int res = f[n];
res = (res * inv[r]) % mod;
res = (res * inv[n - r]) % mod;
return res % mod;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
precompute();
cin >> k >> s;
int n = s.size();
for (int i = 0; i <= k; i++) {
int cur = nCr(n + k, n + i);
cur = (cur * power(25, k - i)) % mod;
ans = (ans + cur) % mod;
}
cout << ans << "\n";
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#ifdef _DEBUG
#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#else
#define DUMP(x)
#endif
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define EREP(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define RREP(i, a, b) for (int i = (int)(a)-1; i >= (int)(b); --i)
#define rep(i, n) REP(i, 0, n)
#define erep(i, n) EREP(i, 0, n)
#define rrep(i, n) RREP(i, n, 0)
#define ALL(r) (r).begin(), (r).end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
os << "{";
rep(i, v.size()) os << v[i] << (i == (int)v.size() - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &p) {
return (os << "(" << p.first << ", " << p.second << ")");
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &m) {
bool first = true;
os << "{";
for (const auto &e : m) {
if (!first)
os << ", ";
os << "{" << e.first << ": " << e.second << "}";
first = false;
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &s) {
os << "{";
bool first = true;
for (const auto &e : s) {
if (!first)
os << ", ";
os << e;
first = false;
}
os << "}";
return os;
}
template <typename T> T dup(T x, T y) { return (x + y - 1) / y; };
template <typename A, size_t N, typename T>
inline void arrayFill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
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 in {
const size_t n = 0;
in() = default;
in(size_t n) : n(n){};
template <typename T> operator T() {
T ret;
cin >> ret;
return ret;
}
template <typename T> operator vector<T>() {
assert(n != 0);
vector<T> ret(n);
for (T &x : ret) {
T tmp = in();
x = tmp;
}
return ret;
}
template <typename T, typename U> operator pair<T, U>() {
pair<T, U> ret;
ret.first = in();
ret.second = in();
return ret;
}
};
template <typename T> inline void out(const T x) { std::cout << x << '\n'; };
using ll = int64_t;
using vint = vector<int32_t>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pint = pair<int32_t, int32_t>;
using vpint = vector<pint>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using setint = set<int32_t>;
using qint = queue<int32_t>;
using qpint = queue<pint>;
constexpr std::int32_t INF = 1001001001;
constexpr std::int64_t LINF = 1001001001001001001;
constexpr int mod = 1'000'000'007;
// constexpr int mod = 998'244'353;
class mint {
private:
std::int64_t m_x;
public:
mint(const std::int64_t m_x = 0) : m_x((m_x % mod + mod) % mod) {}
std::int64_t get() const { return m_x; }
mint operator-() const { return mint(-m_x); }
bool operator==(const mint a) const { return m_x == a.get(); }
bool operator!=(const mint a) const { return !(*this == a); }
mint &operator+=(const mint a) {
if ((m_x += a.m_x) >= mod)
m_x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((m_x += mod - a.m_x) >= mod)
m_x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(m_x *= a.m_x) %= mod;
return *this;
}
mint &operator++() { return *this += 1; }
mint operator++(int) {
mint tmp = *this;
++*this;
return tmp;
}
mint operator--() { return *this -= 1; }
mint operator--(int) {
mint tmp = *this;
--*this;
return tmp;
}
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(const std::int64_t 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, mint &a) {
ll x;
is >> x;
a = x;
return is;
}
ostream &operator<<(ostream &os, const mint &a) {
os << a.get();
return os;
}
// require modint
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(200005);
void Main() {
int k = in();
string s = in();
int n = s.size();
mint ans = 0;
erep(i, k) {
ans += comb(n - 1 + k - i, n - 1) * mint(25).pow(k - i) * mint(26).pow(i);
}
out(ans);
}
signed main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | #include <algorithm>
#include <array>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdint>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
#ifdef _DEBUG
#define DUMP(x) std::cerr << (#x) << " = " << (x) << "\n"
#else
#define DUMP(x)
#endif
#define REP(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define EREP(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define RREP(i, a, b) for (int i = (int)(a)-1; i >= (int)(b); --i)
#define rep(i, n) REP(i, 0, n)
#define erep(i, n) EREP(i, 0, n)
#define rrep(i, n) RREP(i, n, 0)
#define ALL(r) (r).begin(), (r).end()
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
os << "{";
rep(i, v.size()) os << v[i] << (i == (int)v.size() - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &p) {
return (os << "(" << p.first << ", " << p.second << ")");
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &m) {
bool first = true;
os << "{";
for (const auto &e : m) {
if (!first)
os << ", ";
os << "{" << e.first << ": " << e.second << "}";
first = false;
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &s) {
os << "{";
bool first = true;
for (const auto &e : s) {
if (!first)
os << ", ";
os << e;
first = false;
}
os << "}";
return os;
}
template <typename T> T dup(T x, T y) { return (x + y - 1) / y; };
template <typename A, size_t N, typename T>
inline void arrayFill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
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 in {
const size_t n = 0;
in() = default;
in(size_t n) : n(n){};
template <typename T> operator T() {
T ret;
cin >> ret;
return ret;
}
template <typename T> operator vector<T>() {
assert(n != 0);
vector<T> ret(n);
for (T &x : ret) {
T tmp = in();
x = tmp;
}
return ret;
}
template <typename T, typename U> operator pair<T, U>() {
pair<T, U> ret;
ret.first = in();
ret.second = in();
return ret;
}
};
template <typename T> inline void out(const T x) { std::cout << x << '\n'; };
using ll = int64_t;
using vint = vector<int32_t>;
using vvint = vector<vint>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vstr = vector<string>;
using pint = pair<int32_t, int32_t>;
using vpint = vector<pint>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
using setint = set<int32_t>;
using qint = queue<int32_t>;
using qpint = queue<pint>;
constexpr std::int32_t INF = 1001001001;
constexpr std::int64_t LINF = 1001001001001001001;
constexpr int mod = 1'000'000'007;
// constexpr int mod = 998'244'353;
class mint {
private:
std::int64_t m_x;
public:
mint(const std::int64_t m_x = 0) : m_x((m_x % mod + mod) % mod) {}
std::int64_t get() const { return m_x; }
mint operator-() const { return mint(-m_x); }
bool operator==(const mint a) const { return m_x == a.get(); }
bool operator!=(const mint a) const { return !(*this == a); }
mint &operator+=(const mint a) {
if ((m_x += a.m_x) >= mod)
m_x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((m_x += mod - a.m_x) >= mod)
m_x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(m_x *= a.m_x) %= mod;
return *this;
}
mint &operator++() { return *this += 1; }
mint operator++(int) {
mint tmp = *this;
++*this;
return tmp;
}
mint operator--() { return *this -= 1; }
mint operator--(int) {
mint tmp = *this;
--*this;
return tmp;
}
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(const std::int64_t 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, mint &a) {
ll x;
is >> x;
a = x;
return is;
}
ostream &operator<<(ostream &os, const mint &a) {
os << a.get();
return os;
}
// require modint
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(2000005);
void Main() {
int k = in();
string s = in();
int n = s.size();
mint ans = 0;
erep(i, k) {
ans += comb(n - 1 + k - i, n - 1) * mint(25).pow(k - i) * mint(26).pow(i);
}
out(ans);
}
signed main() {
std::cin.tie(nullptr);
std::ios_base::sync_with_stdio(false);
std::cout << std::fixed << std::setprecision(15);
Main();
return 0;
} | replace | 234 | 235 | 234 | 235 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll MOD = 1e9 + 7;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
// ll comb_mod(ll a, ll b, ll mod){
// ll num = 1;
// ll div = 1;
// for(int i = 0; i < b; i++){
// num = (num * (a-i)) % mod;
// div = (div * (b-i)) % mod;
// }
//
// ll ret = (num * mod_pow(div, mod-2, mod)) % mod;
// return ret;
// }
const int MAX_N = 200000;
ll fact[MAX_N + 100];
ll frev[MAX_N + 100];
ll rev(ll a, ll p) {
if (p == 0)
return 1;
ll tmp = rev(a, p / 2);
tmp = tmp * tmp % MOD;
if (p % 2 == 1)
tmp = tmp * a % MOD;
return tmp;
}
void calc_fact() {
fact[0] = frev[0] = 1;
for (int i = 1; i <= MAX_N; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
frev[i] = rev(fact[i], MOD - 2);
}
}
ll comb(int n, int k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (n == 0 || k == 0)
return 1;
return fact[n] * frev[k] % MOD * frev[n - k] % MOD;
}
int main() {
ll K;
cin >> K;
string S;
cin >> S;
// in main function
fact[0] = frev[0] = 1;
for (int i = 1; i <= MAX_N; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
frev[i] = rev(fact[i], MOD - 2);
}
ll size = S.size();
ll ans = 0;
for (ll m = 0; m <= K; m++) {
ll right = mod_pow(26, m, MOD);
ll left = mod_pow(25, K - m, MOD);
// ll com = comb_mod(K-m+size-1, size-1, MOD);
ll com = comb(K - m + size - 1, size - 1);
ll add = right * left;
add %= MOD;
add *= com;
add %= MOD;
ans += add;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPi(i, a, b) for (int i = int(a); i < int(b); i++)
#define MEMS(a, b) memset(a, b, sizeof(a))
#define mp make_pair
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
const ll MOD = 1e9 + 7;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
// ll comb_mod(ll a, ll b, ll mod){
// ll num = 1;
// ll div = 1;
// for(int i = 0; i < b; i++){
// num = (num * (a-i)) % mod;
// div = (div * (b-i)) % mod;
// }
//
// ll ret = (num * mod_pow(div, mod-2, mod)) % mod;
// return ret;
// }
const int MAX_N = 2000000;
ll fact[MAX_N + 100];
ll frev[MAX_N + 100];
ll rev(ll a, ll p) {
if (p == 0)
return 1;
ll tmp = rev(a, p / 2);
tmp = tmp * tmp % MOD;
if (p % 2 == 1)
tmp = tmp * a % MOD;
return tmp;
}
void calc_fact() {
fact[0] = frev[0] = 1;
for (int i = 1; i <= MAX_N; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
frev[i] = rev(fact[i], MOD - 2);
}
}
ll comb(int n, int k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (n == 0 || k == 0)
return 1;
return fact[n] * frev[k] % MOD * frev[n - k] % MOD;
}
int main() {
ll K;
cin >> K;
string S;
cin >> S;
// in main function
fact[0] = frev[0] = 1;
for (int i = 1; i <= MAX_N; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
frev[i] = rev(fact[i], MOD - 2);
}
ll size = S.size();
ll ans = 0;
for (ll m = 0; m <= K; m++) {
ll right = mod_pow(26, m, MOD);
ll left = mod_pow(25, K - m, MOD);
// ll com = comb_mod(K-m+size-1, size-1, MOD);
ll com = comb(K - m + size - 1, size - 1);
ll add = right * left;
add %= MOD;
add *= com;
add %= MOD;
ans += add;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| replace | 49 | 50 | 49 | 50 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, s, n) for (int i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define outve(v) \
for (auto i : v) \
cout << i << " "; \
cout << endl
#define outmat(v) \
for (auto i : v) { \
for (auto j : i) \
cout << j << " "; \
cout << endl; \
}
#define in(n, v) \
for (int i = 0; i < (n); i++) { \
cin >> v[i]; \
}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define infi 1900000000
#define infl 1100000000000000000
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define csp << " " <<
#define outset(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vs = vector<string>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vvp = vector<vector<pair<int, int>>>;
template <typename T> using ve = vector<T>;
template <typename T> using pq2 = priority_queue<T>;
template <typename T> using pq1 = priority_queue<T, vector<T>, greater<T>>;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else
x = 1, y = 0;
return d;
}
template <typename T> T modpow(T x, T n, T m) {
if (n == 0)
return 1;
T resp = modpow(x * x % m, n / 2, m);
if (n & 1)
resp = resp * x % m;
return resp;
}
template <typename T> T modinverse(T a, T m) {
T x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
struct combination {
ll M = mod;
vector<ll> fact, ifact;
combination(ll n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
ifact[0] = 1;
for (ll i = 0; i < n; i++) {
fact[i + 1] = fact[i] * (i + 1) % M;
ifact[i + 1] = ifact[i] * modpow(i + 1, M - 2, M) % M;
}
}
ll com(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifact[a - b] * ifact[b] % M;
return tmp * fact[a] % M;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll K;
cin >> K;
string S;
cin >> S;
ll N = ll(S.length());
combination C(1000003);
ll ans = 0;
for (ll i = 0; i <= K; i++) {
ll an = 1;
an *= modpow<ll>(26, i, mod);
an %= mod;
an *= C.com(N + K - i - 1, N - 1);
an %= mod;
an *= modpow<ll>(25, K - i, mod);
an %= mod;
// cout << an << endl;
ans += an;
ans %= mod;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define reps(i, s, n) for (int i = (s); i < (n); i++)
#define all(v) v.begin(), v.end()
#define outve(v) \
for (auto i : v) \
cout << i << " "; \
cout << endl
#define outmat(v) \
for (auto i : v) { \
for (auto j : i) \
cout << j << " "; \
cout << endl; \
}
#define in(n, v) \
for (int i = 0; i < (n); i++) { \
cin >> v[i]; \
}
#define out(n) cout << (n) << endl
#define fi first
#define se second
#define pb push_back
#define mod 1000000007
#define infi 1900000000
#define infl 1100000000000000000
#define cyes cout << "Yes" << endl
#define cno cout << "No" << endl
#define csp << " " <<
#define outset(n) cout << fixed << setprecision(n);
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vs = vector<string>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vvp = vector<vector<pair<int, int>>>;
template <typename T> using ve = vector<T>;
template <typename T> using pq2 = priority_queue<T>;
template <typename T> using pq1 = priority_queue<T, vector<T>, greater<T>>;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> T gcd(T a, T b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
template <typename T> T lcm(T a, T b) { return a * b / gcd(a, b); }
template <typename T> T extgcd(T a, T b, T &x, T &y) {
T d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else
x = 1, y = 0;
return d;
}
template <typename T> T modpow(T x, T n, T m) {
if (n == 0)
return 1;
T resp = modpow(x * x % m, n / 2, m);
if (n & 1)
resp = resp * x % m;
return resp;
}
template <typename T> T modinverse(T a, T m) {
T x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
struct combination {
ll M = mod;
vector<ll> fact, ifact;
combination(ll n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
ifact[0] = 1;
for (ll i = 0; i < n; i++) {
fact[i + 1] = fact[i] * (i + 1) % M;
ifact[i + 1] = ifact[i] * modpow(i + 1, M - 2, M) % M;
}
}
ll com(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifact[a - b] * ifact[b] % M;
return tmp * fact[a] % M;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll K;
cin >> K;
string S;
cin >> S;
ll N = ll(S.length());
combination C(2000003);
ll ans = 0;
for (ll i = 0; i <= K; i++) {
ll an = 1;
an *= modpow<ll>(26, i, mod);
an %= mod;
an *= C.com(N + K - i - 1, N - 1);
an %= mod;
an *= modpow<ll>(25, K - i, mod);
an %= mod;
// cout << an << endl;
ans += an;
ans %= mod;
}
cout << ans << endl;
return 0;
}
| replace | 118 | 119 | 118 | 119 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T1, typename T2> bool chmin(T1 &a, T2 b) {
if (a <= b)
return 0;
a = b;
return 1;
}
template <typename T1, typename T2> bool chmax(T1 &a, T2 b) {
if (a >= b)
return 0;
a = b;
return 1;
}
int dx[4] = {0, 1, -1, 0};
int dy[4] = {1, 0, 0, -1};
long double eps = 1e-6;
long double pi = acos(-1);
template <int mod = 1000000007> 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; }
};
const int MAX = 510000;
const int mod = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
// 二項係数計算
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
// const int mod = 998244353;
using mint = ModInt<mod>;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
ll k;
string s;
COMinit();
cin >> k >> s;
int n = s.size();
mint ans = 0;
mint beki = 1;
mint beki2 = mint(25).pow(k);
for (int i = 0; i <= k; i++) {
ans += beki * beki2 * mint(COM(n - 1 + k - i, k - i));
beki *= mint(26);
beki2 /= mint(25);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T1, typename T2> bool chmin(T1 &a, T2 b) {
if (a <= b)
return 0;
a = b;
return 1;
}
template <typename T1, typename T2> bool chmax(T1 &a, T2 b) {
if (a >= b)
return 0;
a = b;
return 1;
}
int dx[4] = {0, 1, -1, 0};
int dy[4] = {1, 0, 0, -1};
long double eps = 1e-6;
long double pi = acos(-1);
template <int mod = 1000000007> 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; }
};
const int MAX = 2010000;
const int mod = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
// 二項係数計算
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
// const int mod = 998244353;
using mint = ModInt<mod>;
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(20);
ll k;
string s;
COMinit();
cin >> k >> s;
int n = s.size();
mint ans = 0;
mint beki = 1;
mint beki2 = mint(25).pow(k);
for (int i = 0; i <= k; i++) {
ans += beki * beki2 * mint(COM(n - 1 + k - i, k - i));
beki *= mint(26);
beki2 /= mint(25);
}
cout << ans << endl;
} | replace | 84 | 85 | 84 | 85 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
const long long mod = 1000000007;
// auto mod int
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; }
// combination mod prime
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];
}
};
int main() {
int k;
string s;
cin >> k >> s;
int n = sz(s);
combination c(n * k);
mint ans = 0;
rep(i, k + 1) {
mint now = mint(26).pow(k - i);
now *= mint(25).pow(i);
now *= c(i + n - 1, i);
ans += now;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
#define ull unsigned long long
#define ld long double
#define vi vector<int>
#define vll vector<ll>
#define vc vector<char>
#define vs vector<string>
#define vpii vector<pii>
#define vpll vector<pll>
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; i++)
#define rep1(i, n) for (int i = 1, i##_len = (n); i <= i##_len; i++)
#define repr(i, n) for (int i = ((int)(n)-1); i >= 0; i--)
#define rep1r(i, n) for (int i = ((int)(n)); i >= 1; i--)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define RSORT(x) sort(rall(x));
#define pb push_back
#define mp make_pair
#define INF (1e9)
#define PI (acos(-1))
#define EPS (1e-7)
ull gcd(ull a, ull b) { return b ? gcd(b, a % b) : a; }
ull lcm(ull a, ull b) { return a / gcd(a, b) * b; }
const long long mod = 1000000007;
// auto mod int
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; }
// combination mod prime
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];
}
};
int main() {
int k;
string s;
cin >> k >> s;
int n = sz(s);
combination c(n + k);
mint ans = 0;
rep(i, k + 1) {
mint now = mint(26).pow(k - i);
now *= mint(25).pow(i);
now *= c(i + n - 1, i);
ans += now;
}
cout << ans << endl;
return 0;
}
| replace | 102 | 103 | 102 | 103 | 0 | |
p02632 | C++ | Runtime Error |
/*****/
#define TRUE true
#define FALSE false
#include <bits/stdc++.h>
/**/
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
/**/
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<long long, long long>;
template <class T> using vec = vector<T>;
template <class T> using vec2 = vector<vector<T>>;
template <class T> using vec3 = vector<vector<vector<T>>>;
constexpr int INF = numeric_limits<int>::max();
constexpr ll INFL = numeric_limits<ll>::max();
constexpr ll MOD = 1000000007; // 10^9+7
#ifdef TRUE
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define rrep1(i, n) for (ll i = (n); i > 0; --i)
#define step(i, a, n) for (ll i = (a), i##_len = (a) + (n); i < i##_len; ++i)
#define rstep(i, a, n) \
for (ll i = (a) + (n)-1, i##_len = (a); i >= i##_len; --i)
#define range(i, a, b) for (ll i = (a), i##_len = (b); i < i##_len; ++i)
#define rrange(i, a, b) for (ll i = (b)-1, i##_len = (a); i >= i##_len; --i)
std::string strMulti(const int n, const std::string &t) {
std::string out = "";
for (int i = 0; i < n; i++) {
out += t;
}
return out;
}
std::string tab(const int n) { return string(n, '\t'); }
std::string join(const vector<string> &v, const char *delim = 0) {
std::string s;
if (!v.empty()) {
s += v[0];
for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
if (delim)
s += delim;
s += v[i];
}
}
return s;
}
string to_string(string &s) { return '"' + s + '"'; }
string to_string(char &c) { return string({'\'', c, '\''}); }
template <class T1, class T2> string to_string(pair<T1, T2> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <class Tuple, size_t... I>
string _to_string_tuple(Tuple &&t, std::index_sequence<I...>) {
return "(" + join({to_string(std::get<I>(t))...}, ", ") + ")";
}
template <class... Args> string to_string(tuple<Args...> t) {
return _to_string_tuple(
std::forward<tuple<Args...>>(t),
std::make_index_sequence<
std::tuple_size<std::decay_t<tuple<Args...>>>::value>{});
}
template <class T> string to_string(vector<T> ar) {
vector<string> texts(ar.size());
for (size_t i = 0; i < ar.size(); ++i) {
texts[i] = to_string(ar[i]);
}
return "{" + join(texts, ", ") + "}";
}
template <class T> string to_string(initializer_list<T> il) {
vector<string> texts(il.size());
size_t i = 0;
for (T v : il) {
texts[i] = to_string(v);
i++;
}
return "{" + join(texts, ", ") + "}";
}
void debug(string name);
void debugn(string name);
template <class T> void debug(string name, T v);
template <class T> void debugn(string name, T v);
template <class T> void debug(string name, initializer_list<T> il);
template <class T> void debugn(string name, initializer_list<T> il);
template <class... Args> void debug(string name, Args... args);
template <class... Args> void debugn(string name, Args... args);
void debugdo(function<void()> func);
#ifdef DEBUG_BUILD
#define debugvar(x) debugn(#x, (x))
#define debugvartab(x, t) debugn(tab(t) + #x, (x))
void debug(string name) { std::cerr << name; }
void debugn(string name) { std::cerr << name << '\n'; }
template <class T> void debug(string name, T v) {
std::cerr << name << " = " << to_string(v);
}
template <class T> void debugn(string name, T v) {
std::cerr << name << " = " << to_string(v) << '\n';
}
template <class T> void debug(string name, initializer_list<T> il) {
std::cerr << name << " = " << to_string(il);
}
template <class T> void debugn(string name, initializer_list<T> il) {
std::cerr << name << " = " << to_string(il) << '\n';
}
template <class... Args> void debug(string name, Args... args) {
std::cerr << name << " = " << to_string(tuple<Args...>(args...));
}
template <class... Args> void debugn(string name, Args... args) {
std::cerr << name << " = " << to_string(tuple<Args...>(args...)) << '\n';
}
void debugdo(function<void()> func) { func(); }
#else
#define debugvar(x)
#define debugvartab(x, t)
void debug(string name) {}
void debugln(string name) {}
template <class T> void debug(string name, T v) {}
template <class T> void debugn(string name, T v) {}
template <class T> void debug(string name, initializer_list<T> il) {}
template <class T> void debugn(string name, initializer_list<T> il) {}
template <class... Args> void debug(string name, Args... args) {}
template <class... Args> void debugn(string name, Args... args) {}
void debugdo(function<void()> func) {}
#endif
#define all(x) (x).begin(), (x).end()
#define pair(a, b) make_pair(a, b)
template <class T> bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> T divup(const T a, const T b) {
if (a % b == 0) {
return a / b;
}
return a / b + 1;
}
template <class T> bool cmp_2nd(pair<T, T> a, pair<T, T> b) {
if (a.second != b.second) {
return a.second < b.second;
}
return a.first < b.first;
}
ll modpow(ll x, ll n, const ll &p) {
ll ret = 1;
while (n > 0) {
if (n & 1) {
(ret *= x) %= p;
}
(x *= x) %= p;
n >>= 1;
}
return ret;
}
template <class T> T modinv(T a, const T &p) {
T b = p, u = 1, v = 0;
while (b) {
T t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= p;
if (u < 0) {
u += p;
}
return u;
}
template <class T> T math_P(T m, T n) {
T ret = 1;
for (T i = m; i > m - n; i--) {
ret *= i;
}
return ret;
}
template <class T> T math_C(T m, T n) {
T ret = math_P(m, n);
for (T i = 2; i <= n; i++) {
ret /= i;
}
return ret;
}
ll extended_euclidean(ll u, ll v) {
ll r0 = u;
ll r1 = v;
ll s0 = 1;
ll s1 = 0;
ll t0 = 0;
ll t1 = 1;
while (r1 != 0) {
ll q = r0 / r1;
ll r = r0 - q * r1;
ll s = s0 - q * s1;
ll t = t0 - q * t1;
r0 = r1;
s0 = s1;
t0 = t1;
r1 = r;
s1 = s;
t1 = t;
}
if (t0 < 0) {
return t0 + u;
} else {
return t0;
}
}
ll math_C_mod(ll n, ll c, const ll &p) {
ll upe = 1;
ll dow = 1;
for (ll i = 1; i < c + 1; ++i) {
upe = upe * n % p;
dow = dow * i % p;
n -= 1;
}
return (upe * extended_euclidean(p, dow)) % p;
}
template <class T> T math_gcd(T a, T b) {
if (b == 0) {
return a;
} else {
return math_gcd(b, a % b);
}
}
template <class T> T math_lcm(T a, T b) { return a / math_gcd(a, b) * b; }
template <class T> T SumStep(T a, T n, T d) {
return n * (2 * a + (n - 1) * d) / 2;
}
template <class T> T SumRange(T a, T b, T d) {
return SumStep(a, (b - a) / d, d);
}
#endif
/*****/
constexpr ll COMMax = 510000;
long long fac[COMMax], finv[COMMax], inv[COMMax];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < COMMax; 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;
}
void Main() {
COMinit();
ll K;
string S;
cin >> K >> S;
ll N = S.size();
ll ret = 0;
rep(i, K + 1) {
if (i % 10000 == 0)
debugvar(i);
ll p = modpow(25, i, MOD);
p *= COM(i + N - 1, N - 1);
p %= MOD;
p *= modpow(26, K - i, MOD);
p %= MOD;
ret += p;
ret %= MOD;
}
ret %= MOD;
cout << ret << endl;
}
/*****/
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed << std::setprecision(10);
Main();
std::cerr << flush;
std::cout << flush;
return 0;
}
|
/*****/
#define TRUE true
#define FALSE false
#include <bits/stdc++.h>
/**/
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
/**/
using namespace std;
using ll = long long;
using ld = long double;
using pint = pair<int, int>;
using pll = pair<long long, long long>;
template <class T> using vec = vector<T>;
template <class T> using vec2 = vector<vector<T>>;
template <class T> using vec3 = vector<vector<vector<T>>>;
constexpr int INF = numeric_limits<int>::max();
constexpr ll INFL = numeric_limits<ll>::max();
constexpr ll MOD = 1000000007; // 10^9+7
#ifdef TRUE
#define rep(i, n) for (ll i = 0, i##_len = (n); i < i##_len; ++i)
#define rep1(i, n) for (ll i = 1, i##_len = (n); i <= i##_len; ++i)
#define rrep(i, n) for (ll i = (n)-1; i >= 0; --i)
#define rrep1(i, n) for (ll i = (n); i > 0; --i)
#define step(i, a, n) for (ll i = (a), i##_len = (a) + (n); i < i##_len; ++i)
#define rstep(i, a, n) \
for (ll i = (a) + (n)-1, i##_len = (a); i >= i##_len; --i)
#define range(i, a, b) for (ll i = (a), i##_len = (b); i < i##_len; ++i)
#define rrange(i, a, b) for (ll i = (b)-1, i##_len = (a); i >= i##_len; --i)
std::string strMulti(const int n, const std::string &t) {
std::string out = "";
for (int i = 0; i < n; i++) {
out += t;
}
return out;
}
std::string tab(const int n) { return string(n, '\t'); }
std::string join(const vector<string> &v, const char *delim = 0) {
std::string s;
if (!v.empty()) {
s += v[0];
for (decltype(v.size()) i = 1, c = v.size(); i < c; ++i) {
if (delim)
s += delim;
s += v[i];
}
}
return s;
}
string to_string(string &s) { return '"' + s + '"'; }
string to_string(char &c) { return string({'\'', c, '\''}); }
template <class T1, class T2> string to_string(pair<T1, T2> p) {
return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <class Tuple, size_t... I>
string _to_string_tuple(Tuple &&t, std::index_sequence<I...>) {
return "(" + join({to_string(std::get<I>(t))...}, ", ") + ")";
}
template <class... Args> string to_string(tuple<Args...> t) {
return _to_string_tuple(
std::forward<tuple<Args...>>(t),
std::make_index_sequence<
std::tuple_size<std::decay_t<tuple<Args...>>>::value>{});
}
template <class T> string to_string(vector<T> ar) {
vector<string> texts(ar.size());
for (size_t i = 0; i < ar.size(); ++i) {
texts[i] = to_string(ar[i]);
}
return "{" + join(texts, ", ") + "}";
}
template <class T> string to_string(initializer_list<T> il) {
vector<string> texts(il.size());
size_t i = 0;
for (T v : il) {
texts[i] = to_string(v);
i++;
}
return "{" + join(texts, ", ") + "}";
}
void debug(string name);
void debugn(string name);
template <class T> void debug(string name, T v);
template <class T> void debugn(string name, T v);
template <class T> void debug(string name, initializer_list<T> il);
template <class T> void debugn(string name, initializer_list<T> il);
template <class... Args> void debug(string name, Args... args);
template <class... Args> void debugn(string name, Args... args);
void debugdo(function<void()> func);
#ifdef DEBUG_BUILD
#define debugvar(x) debugn(#x, (x))
#define debugvartab(x, t) debugn(tab(t) + #x, (x))
void debug(string name) { std::cerr << name; }
void debugn(string name) { std::cerr << name << '\n'; }
template <class T> void debug(string name, T v) {
std::cerr << name << " = " << to_string(v);
}
template <class T> void debugn(string name, T v) {
std::cerr << name << " = " << to_string(v) << '\n';
}
template <class T> void debug(string name, initializer_list<T> il) {
std::cerr << name << " = " << to_string(il);
}
template <class T> void debugn(string name, initializer_list<T> il) {
std::cerr << name << " = " << to_string(il) << '\n';
}
template <class... Args> void debug(string name, Args... args) {
std::cerr << name << " = " << to_string(tuple<Args...>(args...));
}
template <class... Args> void debugn(string name, Args... args) {
std::cerr << name << " = " << to_string(tuple<Args...>(args...)) << '\n';
}
void debugdo(function<void()> func) { func(); }
#else
#define debugvar(x)
#define debugvartab(x, t)
void debug(string name) {}
void debugln(string name) {}
template <class T> void debug(string name, T v) {}
template <class T> void debugn(string name, T v) {}
template <class T> void debug(string name, initializer_list<T> il) {}
template <class T> void debugn(string name, initializer_list<T> il) {}
template <class... Args> void debug(string name, Args... args) {}
template <class... Args> void debugn(string name, Args... args) {}
void debugdo(function<void()> func) {}
#endif
#define all(x) (x).begin(), (x).end()
#define pair(a, b) make_pair(a, b)
template <class T> bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> T divup(const T a, const T b) {
if (a % b == 0) {
return a / b;
}
return a / b + 1;
}
template <class T> bool cmp_2nd(pair<T, T> a, pair<T, T> b) {
if (a.second != b.second) {
return a.second < b.second;
}
return a.first < b.first;
}
ll modpow(ll x, ll n, const ll &p) {
ll ret = 1;
while (n > 0) {
if (n & 1) {
(ret *= x) %= p;
}
(x *= x) %= p;
n >>= 1;
}
return ret;
}
template <class T> T modinv(T a, const T &p) {
T b = p, u = 1, v = 0;
while (b) {
T t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= p;
if (u < 0) {
u += p;
}
return u;
}
template <class T> T math_P(T m, T n) {
T ret = 1;
for (T i = m; i > m - n; i--) {
ret *= i;
}
return ret;
}
template <class T> T math_C(T m, T n) {
T ret = math_P(m, n);
for (T i = 2; i <= n; i++) {
ret /= i;
}
return ret;
}
ll extended_euclidean(ll u, ll v) {
ll r0 = u;
ll r1 = v;
ll s0 = 1;
ll s1 = 0;
ll t0 = 0;
ll t1 = 1;
while (r1 != 0) {
ll q = r0 / r1;
ll r = r0 - q * r1;
ll s = s0 - q * s1;
ll t = t0 - q * t1;
r0 = r1;
s0 = s1;
t0 = t1;
r1 = r;
s1 = s;
t1 = t;
}
if (t0 < 0) {
return t0 + u;
} else {
return t0;
}
}
ll math_C_mod(ll n, ll c, const ll &p) {
ll upe = 1;
ll dow = 1;
for (ll i = 1; i < c + 1; ++i) {
upe = upe * n % p;
dow = dow * i % p;
n -= 1;
}
return (upe * extended_euclidean(p, dow)) % p;
}
template <class T> T math_gcd(T a, T b) {
if (b == 0) {
return a;
} else {
return math_gcd(b, a % b);
}
}
template <class T> T math_lcm(T a, T b) { return a / math_gcd(a, b) * b; }
template <class T> T SumStep(T a, T n, T d) {
return n * (2 * a + (n - 1) * d) / 2;
}
template <class T> T SumRange(T a, T b, T d) {
return SumStep(a, (b - a) / d, d);
}
#endif
/*****/
constexpr ll COMMax = 3010000;
long long fac[COMMax], finv[COMMax], inv[COMMax];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < COMMax; 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;
}
void Main() {
COMinit();
ll K;
string S;
cin >> K >> S;
ll N = S.size();
ll ret = 0;
rep(i, K + 1) {
if (i % 10000 == 0)
debugvar(i);
ll p = modpow(25, i, MOD);
p *= COM(i + N - 1, N - 1);
p %= MOD;
p *= modpow(26, K - i, MOD);
p %= MOD;
ret += p;
ret %= MOD;
}
ret %= MOD;
cout << ret << endl;
}
/*****/
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
std::cout << std::fixed << std::setprecision(10);
Main();
std::cerr << flush;
std::cout << flush;
return 0;
}
| replace | 263 | 264 | 263 | 264 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
// const int nax = 1e6+5;
#define inf 4e18
#define display(v) \
for (int i = 0; i < v.size(); ++i) \
cout << v[i] << " "
#define all(v) v.begin(), v.end()
ll sqr(ll x) { return x * x; }
inline ll add(ll a, ll b) {
ll c = a + b;
if (c >= MOD)
c -= MOD;
return c;
}
inline ll mul(ll a, ll b) { return (a * 1ll * b) % MOD; }
inline ll sub(ll a, ll b) {
ll c = a - b;
if (c < 0)
c += MOD;
return c;
}
const int nax = 1000 * 1000 + 10;
const int MAX_ = 1e6 + 2;
ll fac[MAX_];
ll inv[MAX_];
ll facinv[MAX_];
ll power(ll a, ll b) {
ll ans = 1LL;
while (b) {
if (b & 1) {
ans = mul(ans, a);
b--;
} else {
a = mul(a, a);
b /= 2;
}
}
return ans;
}
void furious() {
fac[1] = 1;
fac[0] = 1;
inv[0] = inv[1] = 1;
facinv[0] = facinv[1] = 1;
for (int i = 2; i < MAX_; i++) {
fac[i] = (i * fac[i - 1]) % MOD;
inv[i] = (inv[MOD % i] * (MOD - MOD / i)) % MOD;
facinv[i] = (inv[i] * facinv[i - 1]) % MOD;
}
}
ll ncrm(ll n, ll r) {
if (n == r || r == 0) {
return 1;
}
if (n < r) {
return 0;
}
return mul(fac[n], mul(facinv[r], facinv[n - r]));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
furious();
ll k;
cin >> k;
string str;
cin >> str;
ll n = str.size();
n += k;
ll pos = power(26, n);
for (int i = 0; i < str.size(); ++i) {
ll val = mul(ncrm(n, i), power(25, n - i));
pos = sub(pos, val);
}
cout << pos;
return 0;
}
// Химаншу
| #include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define ff first
#define ss second
#define pb push_back
#define MOD 1000000007
// const int nax = 1e6+5;
#define inf 4e18
#define display(v) \
for (int i = 0; i < v.size(); ++i) \
cout << v[i] << " "
#define all(v) v.begin(), v.end()
ll sqr(ll x) { return x * x; }
inline ll add(ll a, ll b) {
ll c = a + b;
if (c >= MOD)
c -= MOD;
return c;
}
inline ll mul(ll a, ll b) { return (a * 1ll * b) % MOD; }
inline ll sub(ll a, ll b) {
ll c = a - b;
if (c < 0)
c += MOD;
return c;
}
const int nax = 1000 * 1000 + 10;
const int MAX_ = 5e6 + 2;
ll fac[MAX_];
ll inv[MAX_];
ll facinv[MAX_];
ll power(ll a, ll b) {
ll ans = 1LL;
while (b) {
if (b & 1) {
ans = mul(ans, a);
b--;
} else {
a = mul(a, a);
b /= 2;
}
}
return ans;
}
void furious() {
fac[1] = 1;
fac[0] = 1;
inv[0] = inv[1] = 1;
facinv[0] = facinv[1] = 1;
for (int i = 2; i < MAX_; i++) {
fac[i] = (i * fac[i - 1]) % MOD;
inv[i] = (inv[MOD % i] * (MOD - MOD / i)) % MOD;
facinv[i] = (inv[i] * facinv[i - 1]) % MOD;
}
}
ll ncrm(ll n, ll r) {
if (n == r || r == 0) {
return 1;
}
if (n < r) {
return 0;
}
return mul(fac[n], mul(facinv[r], facinv[n - r]));
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
furious();
ll k;
cin >> k;
string str;
cin >> str;
ll n = str.size();
n += k;
ll pos = power(26, n);
for (int i = 0; i < str.size(); ++i) {
ll val = mul(ncrm(n, i), power(25, n - i));
pos = sub(pos, val);
}
cout << pos;
return 0;
}
// Химаншу
| replace | 34 | 35 | 34 | 35 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int k, n, l;
long long res, MOD = 1000000007, p25[1000100], comb;
long long inv[1000100];
void init_math(int N) {
inv[1] = 1LL;
for (int i = 2; i <= N; i++)
inv[i] = (MOD - ((MOD / i) * inv[MOD % i]) % MOD);
}
string s;
int main() {
cin >> k >> s;
n = s.size() + k;
l = s.size();
init_math(n);
p25[0] = 1;
for (int x = 1; x <= n; x++)
p25[x] = (p25[x - 1] * 25LL) % MOD;
comb = 1;
for (int x = 1; x <= n; x++) {
comb = (comb * (long long)(n - x + 1)) % MOD;
comb = (comb * inv[x]) % MOD;
if (x >= l)
res = (res + comb * p25[n - x] % MOD) % MOD;
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int k, n, l;
long long res, MOD = 1000000007, p25[2000100], comb;
long long inv[2000100];
void init_math(int N) {
inv[1] = 1LL;
for (int i = 2; i <= N; i++)
inv[i] = (MOD - ((MOD / i) * inv[MOD % i]) % MOD);
}
string s;
int main() {
cin >> k >> s;
n = s.size() + k;
l = s.size();
init_math(n);
p25[0] = 1;
for (int x = 1; x <= n; x++)
p25[x] = (p25[x - 1] * 25LL) % MOD;
comb = 1;
for (int x = 1; x <= n; x++) {
comb = (comb * (long long)(n - x + 1)) % MOD;
comb = (comb * inv[x]) % MOD;
if (x >= l)
res = (res + comb * p25[n - x] % MOD) % MOD;
}
cout << res << endl;
return 0;
}
| replace | 3 | 5 | 3 | 5 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
ll modpow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
const ll MAX = 1000000;
ll fac[MAX], finv[MAX], inv[MAX];
// nCk初期化
void nCkInit(const ll MOD) { // O(max(n,r)logmax(n,r) mは素数)
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll nCk(ll n, ll k, const ll MOD) { // init後,O(1)
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll K;
string S;
map<char, ll> mp;
int main() {
cin >> K >> S;
nCkInit(MOD);
ll ans = 0;
for (ll i = 0; i <= K; i++) {
ans = (ans + nCk(K + S.length() - 1 - i, S.length() - 1, MOD) *
modpow(25, K - i, MOD) % MOD * modpow(26, i, MOD) % MOD) %
MOD;
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <cassert>
#include <complex>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string.h>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll INF = 2e18;
const ll MOD = 1e9 + 7;
ll modpow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
const ll MAX = 2000000;
ll fac[MAX], finv[MAX], inv[MAX];
// nCk初期化
void nCkInit(const ll MOD) { // O(max(n,r)logmax(n,r) mは素数)
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll nCk(ll n, ll k, const ll MOD) { // init後,O(1)
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll K;
string S;
map<char, ll> mp;
int main() {
cin >> K >> S;
nCkInit(MOD);
ll ans = 0;
for (ll i = 0; i <= K; i++) {
ans = (ans + nCk(K + S.length() - 1 - i, S.length() - 1, MOD) *
modpow(25, K - i, MOD) % MOD * modpow(26, i, MOD) % MOD) %
MOD;
}
cout << ans << endl;
return 0;
} | replace | 32 | 33 | 32 | 33 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int M = 1e9 + 7;
ll mul(ll a, ll b) { return (a * b) % M; }
ll mod_pow(ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1)
r = mul(r, a);
b >>= 1;
a = mul(a, a);
}
return r;
}
struct combination {
vector<int> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < M);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = mul(fact[i - 1], i);
ifact[n] = mod_pow(fact[n], M - 2);
for (int i = n; i >= 1; --i)
ifact[i - 1] = mul(ifact[i], i);
}
int operator()(int n, int k) {
assert(k >= 0 && k <= n);
return mul(fact[n], mul(ifact[k], ifact[n - k]));
}
} C(200005);
void solve() {
int k;
string s;
cin >> k >> s;
int n = s.size();
ll ans = 0;
for (int i = 0; i <= k; ++i) {
ll now = mod_pow(25, i);
now = (now * mod_pow(26, k - i)) % M;
now = (now * C(n - 1 + i, n - 1)) % M;
ans = (ans + now) % M;
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
solve();
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
const int M = 1e9 + 7;
ll mul(ll a, ll b) { return (a * b) % M; }
ll mod_pow(ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1)
r = mul(r, a);
b >>= 1;
a = mul(a, a);
}
return r;
}
struct combination {
vector<int> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < M);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = mul(fact[i - 1], i);
ifact[n] = mod_pow(fact[n], M - 2);
for (int i = n; i >= 1; --i)
ifact[i - 1] = mul(ifact[i], i);
}
int operator()(int n, int k) {
assert(k >= 0 && k <= n);
return mul(fact[n], mul(ifact[k], ifact[n - k]));
}
} C(2000005);
void solve() {
int k;
string s;
cin >> k >> s;
int n = s.size();
ll ans = 0;
for (int i = 0; i <= k; ++i) {
ll now = mod_pow(25, i);
now = (now * mod_pow(26, k - i)) % M;
now = (now * C(n - 1 + i, n - 1)) % M;
ans = (ans + now) % M;
}
cout << ans << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
solve();
} | replace | 33 | 34 | 33 | 34 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
constexpr int MOD = 1000000007;
constexpr int MAX = 100005;
ll f[MAX];
void init() {
f[0] = 1;
for (int i = 1; i < MAX; i++)
f[i] = (f[i - 1] * i) % MOD;
}
ll inv(ll x) {
ll res = 1;
ll k = MOD - 2;
ll y = x;
while (k) {
if (k & 1)
res = (res * y) % MOD;
y = (y * y) % MOD;
k /= 2;
}
return res;
}
ll C(int n, int k) {
ll a = f[n];
ll b = f[n - k];
ll c = f[k];
ll bc = (b * c) % MOD;
return (a * inv(bc)) % MOD;
}
ll powmod(ll a, ll n, ll m = MOD) {
ll ret = 1;
for (; n > 0; n >>= 1, a = a * a % m) {
if (n % 2 == 1) {
ret = ret * a % m;
}
}
return ret;
}
int main() {
init();
int k;
cin >> k;
string s;
cin >> s;
int n = s.size() + k, m = s.size();
ll ans = 0;
for (int i = m; i <= n; i++) {
ll d = C(i - 1, m - 1) * powmod(25, i - m);
d %= MOD;
d *= powmod(26, n - i);
d %= MOD;
ans += d;
ans %= MOD;
// cout << i << " " << d << " " << ans << endl;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<int, int>;
constexpr int MOD = 1000000007;
constexpr int MAX = 2000005;
ll f[MAX];
void init() {
f[0] = 1;
for (int i = 1; i < MAX; i++)
f[i] = (f[i - 1] * i) % MOD;
}
ll inv(ll x) {
ll res = 1;
ll k = MOD - 2;
ll y = x;
while (k) {
if (k & 1)
res = (res * y) % MOD;
y = (y * y) % MOD;
k /= 2;
}
return res;
}
ll C(int n, int k) {
ll a = f[n];
ll b = f[n - k];
ll c = f[k];
ll bc = (b * c) % MOD;
return (a * inv(bc)) % MOD;
}
ll powmod(ll a, ll n, ll m = MOD) {
ll ret = 1;
for (; n > 0; n >>= 1, a = a * a % m) {
if (n % 2 == 1) {
ret = ret * a % m;
}
}
return ret;
}
int main() {
init();
int k;
cin >> k;
string s;
cin >> s;
int n = s.size() + k, m = s.size();
ll ans = 0;
for (int i = m; i <= n; i++) {
ll d = C(i - 1, m - 1) * powmod(25, i - m);
d %= MOD;
d *= powmod(26, n - i);
d %= MOD;
ans += d;
ans %= MOD;
// cout << i << " " << d << " " << ans << endl;
}
cout << ans << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define Per(i, sta, n) for (int i = n - 1; i >= sta; i--)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
template <int mod> struct ModInt {
long long x;
ModInt() : x(0) {}
ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
explicit operator int() const { return x; }
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;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return ModInt(u);
}
ModInt power(long long p) const {
int a = x;
if (p == 0)
return 1;
if (p == 1)
return ModInt(a);
if (p % 2 == 1)
return (ModInt(a) * ModInt(a)).power(p / 2) * ModInt(a);
else
return (ModInt(a) * ModInt(a)).power(p / 2);
}
ModInt power(const ModInt p) const { return ((ModInt)x).power(p.x); }
friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
using modint = ModInt<mod>;
struct ModFac {
public:
vector<modint> f, i_f;
int n;
ModFac(int n_) {
n = n_;
f.resize(n + 1, 1);
i_f.resize(n + 1, 1);
for (int i = 0; i < n; i++) {
f[i + 1] = f[i] * (modint)(i + 1);
}
i_f[n] = f[n].power(mod - 2);
for (int i = n - 1; i >= 0; i--) {
i_f[i] = i_f[i + 1] * (modint)(i + 1);
}
}
ModFac(modint n_) {
n = (int)n_;
f.resize(n + 1, 1);
i_f.resize(n + 1, 1);
for (int i = 0; i < n; i++) {
f[i + 1] = f[i] * (modint)(i + 1);
}
i_f[n] = f[n].power(mod - 2);
for (int i = n - 1; i >= 0; i--) {
i_f[i] = i_f[i + 1] * (modint)(i + 1);
}
}
modint factorial(int x) {
// cout << f.size() << endl;
return f[x];
}
modint inv_factorial(int x) { return i_f[x]; }
modint comb(int m, int k) {
if (m < 0 or k < 0)
return 0;
if (m < k)
return 0;
return f[m] * i_f[k] * i_f[m - k];
}
};
int n, k;
ModFac MF(200010);
modint ans[200010];
void solve() {
cin >> k;
string s;
cin >> s;
n = s.length();
rep(i, n + k + 1) {
ans[i] = MF.comb(n + k, i) * ((modint)25).power(n + k - i);
}
modint A = 0;
Rep(i, n, n + k + 1) { A += ans[i]; }
cout << A << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(50);
solve();
} | #include <algorithm>
#include <bitset>
#include <ciso646>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop \
char nyaa; \
cin >> nyaa;
#define rep(i, n) for (int i = 0; i < n; i++)
#define per(i, n) for (int i = n - 1; i >= 0; i--)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define Per(i, sta, n) for (int i = n - 1; i >= sta; i--)
#define rep1(i, n) for (int i = 1; i <= n; i++)
#define per1(i, n) for (int i = n; i >= 1; i--)
#define Rep1(i, sta, n) for (int i = sta; i <= n; i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
template <int mod> struct ModInt {
long long x;
ModInt() : x(0) {}
ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
explicit operator int() const { return x; }
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;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return ModInt(u);
}
ModInt power(long long p) const {
int a = x;
if (p == 0)
return 1;
if (p == 1)
return ModInt(a);
if (p % 2 == 1)
return (ModInt(a) * ModInt(a)).power(p / 2) * ModInt(a);
else
return (ModInt(a) * ModInt(a)).power(p / 2);
}
ModInt power(const ModInt p) const { return ((ModInt)x).power(p.x); }
friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt<mod> &a) {
long long x;
is >> x;
a = ModInt<mod>(x);
return (is);
}
};
using modint = ModInt<mod>;
struct ModFac {
public:
vector<modint> f, i_f;
int n;
ModFac(int n_) {
n = n_;
f.resize(n + 1, 1);
i_f.resize(n + 1, 1);
for (int i = 0; i < n; i++) {
f[i + 1] = f[i] * (modint)(i + 1);
}
i_f[n] = f[n].power(mod - 2);
for (int i = n - 1; i >= 0; i--) {
i_f[i] = i_f[i + 1] * (modint)(i + 1);
}
}
ModFac(modint n_) {
n = (int)n_;
f.resize(n + 1, 1);
i_f.resize(n + 1, 1);
for (int i = 0; i < n; i++) {
f[i + 1] = f[i] * (modint)(i + 1);
}
i_f[n] = f[n].power(mod - 2);
for (int i = n - 1; i >= 0; i--) {
i_f[i] = i_f[i + 1] * (modint)(i + 1);
}
}
modint factorial(int x) {
// cout << f.size() << endl;
return f[x];
}
modint inv_factorial(int x) { return i_f[x]; }
modint comb(int m, int k) {
if (m < 0 or k < 0)
return 0;
if (m < k)
return 0;
return f[m] * i_f[k] * i_f[m - k];
}
};
int n, k;
ModFac MF(2000010);
modint ans[2000010];
void solve() {
cin >> k;
string s;
cin >> s;
n = s.length();
rep(i, n + k + 1) {
ans[i] = MF.comb(n + k, i) * ((modint)25).power(n + k - i);
}
modint A = 0;
Rep(i, n, n + k + 1) { A += ans[i]; }
cout << A << endl;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(50);
solve();
} | replace | 164 | 166 | 164 | 166 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define MP make_pair
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define DB(x) cerr << #x << " = " << x << endl
#define DB2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n";
#define DEBUG \
int x12345; \
cin >> x12345;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
const long long MOD = 1e9 + 7;
///////////////////////////////////////////////
// for template
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;
}
///////////////////////////////////////////////
/// 🍈( '-' 🍈 |AC|
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += 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 = val % MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD * ((-val + MOD - 1) / MOD);
val = 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 istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> 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 NMAX = 1010000;
ll fac[NMAX], finv[NMAX], inv[NMAX];
void combinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i <= NMAX - 1; ++i) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long comb(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
int main() {
combinit();
ll K;
cin >> K;
string S;
cin >> S;
ll N = S.length();
mint ans = 0;
FORq(l, N, N + K) {
ans += (mint)comb(l - 1, N - 1) * modpow((mint)25, l - N) *
modpow((mint)26, N + K - l);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPr(i, n) for (int i = (n)-1; i >= 0; --i)
#define FORq(i, m, n) for (int i = (m); i <= (n); ++i)
#define FORqr(i, m, n) for (int i = (n); i >= (m); --i)
#define MP make_pair
#define SIN(x, S) (S.count(x) != 0)
#define M0(x) memset(x, 0, sizeof(x))
#define FILL(x, y) memset(x, y, sizeof(x))
#define MM(x) memset(x, -1, sizeof(x))
#define ALL(x) (x).begin(), (x).end()
#define DB(x) cerr << #x << " = " << x << endl
#define DB2(x, y) \
cerr << "(" << #x << ", " << #y << ") = (" << x << ", " << y << ")\n";
#define DEBUG \
int x12345; \
cin >> x12345;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef long long ll;
typedef long long integer;
const long long MOD = 1e9 + 7;
///////////////////////////////////////////////
// for template
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;
}
///////////////////////////////////////////////
/// 🍈( '-' 🍈 |AC|
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += 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 = val % MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD * ((-val + MOD - 1) / MOD);
val = 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 istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> 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 NMAX = 3010000;
ll fac[NMAX], finv[NMAX], inv[NMAX];
void combinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i <= NMAX - 1; ++i) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long comb(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD;
}
int main() {
combinit();
ll K;
cin >> K;
string S;
cin >> S;
ll N = S.length();
mint ans = 0;
FORq(l, N, N + K) {
ans += (mint)comb(l - 1, N - 1) * modpow((mint)25, l - N) *
modpow((mint)26, N + K - l);
}
cout << ans << endl;
} | replace | 131 | 132 | 131 | 132 | 0 | |
p02632 | C++ | Runtime Error | #ifndef Local
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx")
#endif
#include <bits/stdc++.h>
using namespace std;
#define popCnt(x) (__builtin_popcountll(x))
#define sz(x) ((int)(x.size()))
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
typedef long long Long;
typedef double Double;
template <class U, class V> istream &operator>>(istream &is, pair<U, V> &p) {
is >> p.first >> p.second;
return is;
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) {
is >> x;
}
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto &x : v) {
os << x << " ";
}
return os;
}
const int MOD = round(1e9 + 7);
int power(int base, int p) {
if (p == 0)
return 1;
int res = power(base, p / 2);
res = 1LL * res * res % MOD;
if (p & 1) {
res = 1LL * res * base % MOD;
}
return res;
}
int modInverse(int x) { return power(x, MOD - 2); }
const int FN = 1e6 + 5;
int fact[FN];
int inv_fact[FN];
void buildFactorial() {
fact[0] = 1;
inv_fact[0] = 1;
for (int i = 1; i < FN; ++i) {
fact[i] = 1LL * i * fact[i - 1] % MOD;
inv_fact[i] = modInverse(fact[i]);
}
}
int nCr(int n, int r) {
if (r > n)
return 0;
int res = fact[n];
res = 1LL * res * inv_fact[r] % MOD;
res = 1LL * res * inv_fact[n - r] % MOD;
return res;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifdef Local
freopen("test.in", "r", stdin);
#else
#define endl '\n'
#endif
buildFactorial();
int k;
string s;
cin >> k >> s;
int res = 0;
for (int i = 0; i <= k; ++i) {
int tmp = power(26, i);
tmp = 1LL * tmp * power(25, k - i) % MOD;
tmp = 1LL * tmp * nCr(k - i + sz(s) - 1, k - i) % MOD;
res = (res + tmp) % MOD;
}
cout << res << endl;
return 0;
} | #ifndef Local
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.2,popcnt,abm,mmx,avx")
#endif
#include <bits/stdc++.h>
using namespace std;
#define popCnt(x) (__builtin_popcountll(x))
#define sz(x) ((int)(x.size()))
#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)
typedef long long Long;
typedef double Double;
template <class U, class V> istream &operator>>(istream &is, pair<U, V> &p) {
is >> p.first >> p.second;
return is;
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v) {
is >> x;
}
return is;
}
template <class T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto &x : v) {
os << x << " ";
}
return os;
}
const int MOD = round(1e9 + 7);
int power(int base, int p) {
if (p == 0)
return 1;
int res = power(base, p / 2);
res = 1LL * res * res % MOD;
if (p & 1) {
res = 1LL * res * base % MOD;
}
return res;
}
int modInverse(int x) { return power(x, MOD - 2); }
const int FN = 2e6 + 5;
int fact[FN];
int inv_fact[FN];
void buildFactorial() {
fact[0] = 1;
inv_fact[0] = 1;
for (int i = 1; i < FN; ++i) {
fact[i] = 1LL * i * fact[i - 1] % MOD;
inv_fact[i] = modInverse(fact[i]);
}
}
int nCr(int n, int r) {
if (r > n)
return 0;
int res = fact[n];
res = 1LL * res * inv_fact[r] % MOD;
res = 1LL * res * inv_fact[n - r] % MOD;
return res;
}
int main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#ifdef Local
freopen("test.in", "r", stdin);
#else
#define endl '\n'
#endif
buildFactorial();
int k;
string s;
cin >> k >> s;
int res = 0;
for (int i = 0; i <= k; ++i) {
int tmp = power(26, i);
tmp = 1LL * tmp * power(25, k - i) % MOD;
tmp = 1LL * tmp * nCr(k - i + sz(s) - 1, k - i) % MOD;
res = (res + tmp) % MOD;
}
cout << res << endl;
return 0;
} | replace | 49 | 50 | 49 | 50 | 0 | |
p02632 | C++ | Runtime Error |
// Problem : F - Strivore
// Contest : AtCoder - AtCoder Beginner Contest 171
// URL : https://atcoder.jp/contests/abc171/tasks/abc171_f
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define int long long
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define db1(x) cout << #x << "=" << x << endl
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< endl
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rep2(i, a, b) for (int i = a; i >= b; i--)
#define die return 0;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
const int MAX = 1e6;
ll modulo(ll a, ll b, ll n) {
ll x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y) % n; // multiplying with base
}
y = (y * y) % n; // squaring the base
b /= 2;
}
return x % n;
}
vector<int> fact(MAX + 1), finv(MAX + 1);
void pre() {
fact[0] = 1, finv[0] = 1;
for (int i = 1; i <= MAX; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
}
for (int i = 1; i <= MAX; i++) {
finv[i] = modulo(fact[i], MOD - 2, MOD);
}
}
int nCr(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
if (r == 0 || r == n)
return 1;
return ((((fact[n] * finv[r]) % MOD) * finv[n - r]) % MOD);
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int testcases;
testcases = 1;
// cin>>testcases;
while (testcases--) {
pre();
int k;
string str;
cin >> k;
cin >> str;
int ans = 0;
int len = str.length();
int fin = len + k;
for (int i = len; i <= fin; i++) {
int last = fin - i;
int temp = modulo(26, last, MOD);
temp = (temp * modulo(25, fin - last - len, MOD)) % MOD;
temp = (temp * nCr(i - 1, len - 1)) % MOD;
ans = (ans + temp) % MOD;
}
cout << ans << '\n';
}
return 0;
}
|
// Problem : F - Strivore
// Contest : AtCoder - AtCoder Beginner Contest 171
// URL : https://atcoder.jp/contests/abc171/tasks/abc171_f
// Memory Limit : 1024 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)
#include <bits/stdc++.h>
#define int long long
#define sz(a) int((a).size())
#define pb push_back
#define mp make_pair
#define db1(x) cout << #x << "=" << x << endl
#define db2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
#define db3(x, y, z) \
cout << #x << "=" << x << "," << #y << "=" << y << "," << #z << "=" << z \
<< endl
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rep2(i, a, b) for (int i = a; i >= b; i--)
#define die return 0;
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
const int MAX = 2e6 + 7;
ll modulo(ll a, ll b, ll n) {
ll x = 1, y = a;
while (b > 0) {
if (b % 2 == 1) {
x = (x * y) % n; // multiplying with base
}
y = (y * y) % n; // squaring the base
b /= 2;
}
return x % n;
}
vector<int> fact(MAX + 1), finv(MAX + 1);
void pre() {
fact[0] = 1, finv[0] = 1;
for (int i = 1; i <= MAX; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
}
for (int i = 1; i <= MAX; i++) {
finv[i] = modulo(fact[i], MOD - 2, MOD);
}
}
int nCr(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
if (r == 0 || r == n)
return 1;
return ((((fact[n] * finv[r]) % MOD) * finv[n - r]) % MOD);
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int testcases;
testcases = 1;
// cin>>testcases;
while (testcases--) {
pre();
int k;
string str;
cin >> k;
cin >> str;
int ans = 0;
int len = str.length();
int fin = len + k;
for (int i = len; i <= fin; i++) {
int last = fin - i;
int temp = modulo(26, last, MOD);
temp = (temp * modulo(25, fin - last - len, MOD)) % MOD;
temp = (temp * nCr(i - 1, len - 1)) % MOD;
ans = (ans + temp) % MOD;
}
cout << ans << '\n';
}
return 0;
}
| replace | 30 | 31 | 30 | 31 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define rep(i, a, b) for (i = a; i < b; i++)
#define per(i, a, b) for (i = a; i >= b; i--)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define trav(x, it) for (auto it = x.begin(); it != x.end(); it++)
#define pr(x) cout << #x << " = " << x << endl
#define fill(x, y) memset(x, y, sizeof(x))
#define endl "\n"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
const ld eps = 1e-7;
const ll mod = 1000000007;
const ll N = 998244353;
ll binpow(ll b, ll p) {
ll ans = 1;
while (p > 0) {
if (p & 1)
ans = (ans * b) % mod;
b = (b * b) % mod;
p >>= 1;
}
return ans;
}
ll modinv(ll x) { return binpow(x, mod - 2); }
const int mxn = 1e6 + 10;
ll fac[mxn];
ll invfac[mxn];
ll ncr(ll n, ll r) {
if (r > n)
return 0;
return (((fac[n] * invfac[n - r]) % mod) * invfac[r]) % mod;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll k, n, ans = 1, i, rem = 0, val, len;
fac[0] = invfac[0] = fac[1] = invfac[1] = 1;
rep(i, 2, mxn) {
fac[i] = (fac[i - 1] * i) % mod;
invfac[i] = modinv(fac[i]);
}
string s;
cin >> k >> s;
n = s.length() + k;
len = s.length();
rep(i, 0, len) {
val = (ncr(n, i) * binpow(25LL, n - i)) % mod;
rem = (rem + val) % mod;
}
ans = (binpow(26LL, n) - rem + mod) % mod;
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define rep(i, a, b) for (i = a; i < b; i++)
#define per(i, a, b) for (i = a; i >= b; i--)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define trav(x, it) for (auto it = x.begin(); it != x.end(); it++)
#define pr(x) cout << #x << " = " << x << endl
#define fill(x, y) memset(x, y, sizeof(x))
#define endl "\n"
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
const ld eps = 1e-7;
const ll mod = 1000000007;
const ll N = 998244353;
ll binpow(ll b, ll p) {
ll ans = 1;
while (p > 0) {
if (p & 1)
ans = (ans * b) % mod;
b = (b * b) % mod;
p >>= 1;
}
return ans;
}
ll modinv(ll x) { return binpow(x, mod - 2); }
const int mxn = 2e6 + 10;
ll fac[mxn];
ll invfac[mxn];
ll ncr(ll n, ll r) {
if (r > n)
return 0;
return (((fac[n] * invfac[n - r]) % mod) * invfac[r]) % mod;
}
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll k, n, ans = 1, i, rem = 0, val, len;
fac[0] = invfac[0] = fac[1] = invfac[1] = 1;
rep(i, 2, mxn) {
fac[i] = (fac[i - 1] * i) % mod;
invfac[i] = modinv(fac[i]);
}
string s;
cin >> k >> s;
n = s.length() + k;
len = s.length();
rep(i, 0, len) {
val = (ncr(n, i) * binpow(25LL, n - i)) % mod;
rem = (rem + val) % mod;
}
ans = (binpow(26LL, n) - rem + mod) % mod;
cout << ans << endl;
} | replace | 40 | 41 | 40 | 41 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(), (v).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;
}
const ll INF = 1LL << 60;
const int inf = (1 << 30) - 1;
const int mod = 1e9 + 7;
int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
const int nmax = 1000005;
ll fac[nmax], finv[nmax], inv[nmax];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < nmax; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll com(int n, int k) {
if (n < k || n < 0 || k < 0) {
return 0;
}
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
// 繰り返し二乗法 n*nが64bitにおさまる必要
ll pow_mod(ll n, ll k, ll m) {
ll res = 1;
for (; k > 0; k >>= 1) {
if (k & 1) {
res = (res * n) % m;
}
n = (n * n) % m;
}
return res;
}
// 逆元
ll mod_inverse(ll a, ll m) { return pow_mod(a, m - 2, m); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
COMinit();
ll ans = 0;
REP(i, k + 1) {
(ans += com(n - 1 + k - i, n - 1) * pow_mod(25, k - i, mod) % mod *
pow_mod(26, i, mod) % mod) %= mod;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(), (v).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;
}
const ll INF = 1LL << 60;
const int inf = (1 << 30) - 1;
const int mod = 1e9 + 7;
int dx[8] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
const int nmax = 2000005;
ll fac[nmax], finv[nmax], inv[nmax];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < nmax; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll com(int n, int k) {
if (n < k || n < 0 || k < 0) {
return 0;
}
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
// 繰り返し二乗法 n*nが64bitにおさまる必要
ll pow_mod(ll n, ll k, ll m) {
ll res = 1;
for (; k > 0; k >>= 1) {
if (k & 1) {
res = (res * n) % m;
}
n = (n * n) % m;
}
return res;
}
// 逆元
ll mod_inverse(ll a, ll m) { return pow_mod(a, m - 2, m); }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
COMinit();
ll ans = 0;
REP(i, k + 1) {
(ans += com(n - 1 + k - i, n - 1) * pow_mod(25, k - i, mod) % mod *
pow_mod(26, i, mod) % mod) %= mod;
}
cout << ans << endl;
} | replace | 28 | 29 | 28 | 29 | 0 | |
p02632 | C++ | Runtime Error | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MAX = 1001000;
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 modpow(int x, int r) {
if (r == 0) {
return 1;
} else if (r % 2 == 0) {
long long tmp = modpow(x, r / 2);
return tmp % mod * tmp % mod;
} else {
return x % mod * modpow(x, r - 1) % mod;
}
}
int main() {
COMinit();
long long K;
string S;
cin >> K >> S;
long long L = S.length() + K;
long long N = S.length();
long long ans = 0;
for (long long i = N; i <= L; i++) {
// S_N以降の文字数
long long p = L - i;
ans += COM(L - p - 1, N - 1) % mod * modpow(25, K - p) % mod *
modpow(26, p) % mod;
ans %= mod;
}
cout << ans << endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
const int MAX = 10000000;
const int mod = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
long long modpow(int x, int r) {
if (r == 0) {
return 1;
} else if (r % 2 == 0) {
long long tmp = modpow(x, r / 2);
return tmp % mod * tmp % mod;
} else {
return x % mod * modpow(x, r - 1) % mod;
}
}
int main() {
COMinit();
long long K;
string S;
cin >> K >> S;
long long L = S.length() + K;
long long N = S.length();
long long ans = 0;
for (long long i = N; i <= L; i++) {
// S_N以降の文字数
long long p = L - i;
ans += COM(L - p - 1, N - 1) % mod * modpow(25, K - p) % mod *
modpow(26, p) % mod;
ans %= mod;
}
cout << ans << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FASTIO \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define LL long long int
using namespace std;
const int N = 1e6 + 5;
const int oo = 1e9 + 5;
const int MOD = 1e9 + 7;
LL powermod(LL a, LL b) {
if (b == 0)
return 1;
LL res = powermod(a, b / 2);
res = (res * res) % MOD;
if (b & 1)
res = (res * a) % MOD;
return res;
}
int fac[N], invfac[N];
void pre() {
fac[0] = 1;
for (int i = 1; i < N; ++i)
fac[i] = (fac[i - 1] * 1LL * i) % MOD;
invfac[N - 1] = powermod(fac[N - 1], MOD - 2);
for (int i = N - 2; i >= 0; --i) {
invfac[i] = (invfac[i + 1] * 1LL * (i + 1)) % MOD;
}
}
LL ncr(int n, int r) {
if (r < 0 || r > n)
return 0;
LL ans = (fac[n] * 1LL * invfac[r]) % MOD;
ans = (ans * 1LL * invfac[n - r]) % MOD;
return ans;
}
void solve() {
int k;
cin >> k;
string str;
cin >> str;
int s = str.size();
LL ans = 0, sixinv = powermod(26, MOD - 2), have = 1, have2 = powermod(26, k);
for (int i = 0; i <= k; ++i) {
ans += ((ncr(s + i - 1, s - 1) * have) % MOD * have2) % MOD;
have2 = (have2 * sixinv) % MOD;
have = (have * 25) % MOD;
if (ans >= MOD)
ans -= MOD;
}
cout << ans << '\n';
}
int main() {
FASTIO;
pre();
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
} | #include <bits/stdc++.h>
#define FASTIO \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define LL long long int
using namespace std;
const int N = 3e6 + 5;
const int oo = 1e9 + 5;
const int MOD = 1e9 + 7;
LL powermod(LL a, LL b) {
if (b == 0)
return 1;
LL res = powermod(a, b / 2);
res = (res * res) % MOD;
if (b & 1)
res = (res * a) % MOD;
return res;
}
int fac[N], invfac[N];
void pre() {
fac[0] = 1;
for (int i = 1; i < N; ++i)
fac[i] = (fac[i - 1] * 1LL * i) % MOD;
invfac[N - 1] = powermod(fac[N - 1], MOD - 2);
for (int i = N - 2; i >= 0; --i) {
invfac[i] = (invfac[i + 1] * 1LL * (i + 1)) % MOD;
}
}
LL ncr(int n, int r) {
if (r < 0 || r > n)
return 0;
LL ans = (fac[n] * 1LL * invfac[r]) % MOD;
ans = (ans * 1LL * invfac[n - r]) % MOD;
return ans;
}
void solve() {
int k;
cin >> k;
string str;
cin >> str;
int s = str.size();
LL ans = 0, sixinv = powermod(26, MOD - 2), have = 1, have2 = powermod(26, k);
for (int i = 0; i <= k; ++i) {
ans += ((ncr(s + i - 1, s - 1) * have) % MOD * have2) % MOD;
have2 = (have2 * sixinv) % MOD;
have = (have * 25) % MOD;
if (ans >= MOD)
ans -= MOD;
}
cout << ans << '\n';
}
int main() {
FASTIO;
pre();
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define all(x) (x).begin(), (x).end()
const int INF = 1e9 + 5;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
ll fac[N];
ll mul(ll a, ll b) { return a * b % mod; }
ll poww(ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1)
r = mul(r, a);
a = mul(a, a);
b >>= 1;
}
return r;
}
ll inv(ll x) { return poww(x, mod - 2); }
void add_self(ll &a, ll b) {
a += b;
a %= mod;
}
void init() {
fac[0] = fac[1] = 1;
for (int i = 2; i < N; ++i) {
fac[i] = mul(fac[i - 1], 1ll * i);
}
}
ll bino(ll n, ll k) {
if (k < 0)
return 1;
if (!k)
return 1;
return mul(fac[n], mul(inv(fac[n - k]), inv(fac[k])));
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
init();
ll k;
string s;
cin >> k >> s;
ll n = (ll)s.size();
ll ans = 0;
for (ll last = 0; last <= k; ++last) {
ll ch26 = poww(26, last);
ll ch25 = poww(25, k - last);
ll chpos = bino(k + n - last - 1, n - 1);
ll cur = mul(ch26, mul(ch25, chpos));
add_self(ans, cur);
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define endl '\n'
#define all(x) (x).begin(), (x).end()
const int INF = 1e9 + 5;
const int N = 2e6 + 10;
const ll mod = 1e9 + 7;
ll fac[N];
ll mul(ll a, ll b) { return a * b % mod; }
ll poww(ll a, ll b) {
ll r = 1;
while (b) {
if (b & 1)
r = mul(r, a);
a = mul(a, a);
b >>= 1;
}
return r;
}
ll inv(ll x) { return poww(x, mod - 2); }
void add_self(ll &a, ll b) {
a += b;
a %= mod;
}
void init() {
fac[0] = fac[1] = 1;
for (int i = 2; i < N; ++i) {
fac[i] = mul(fac[i - 1], 1ll * i);
}
}
ll bino(ll n, ll k) {
if (k < 0)
return 1;
if (!k)
return 1;
return mul(fac[n], mul(inv(fac[n - k]), inv(fac[k])));
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
init();
ll k;
string s;
cin >> k >> s;
ll n = (ll)s.size();
ll ans = 0;
for (ll last = 0; last <= k; ++last) {
ll ch26 = poww(26, last);
ll ch25 = poww(25, k - last);
ll chpos = bino(k + n - last - 1, n - 1);
ll cur = mul(ch26, mul(ch25, chpos));
add_self(ans, cur);
}
cout << ans;
return 0;
}
| replace | 6 | 8 | 6 | 8 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define db(a) cout << fixed << #a << " = " << a << endl;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD = 1e9 + 7;
const int MAXN = 1e6 + 10;
ll fact[MAXN];
ll powd[MAXN];
ll b_pow(ll x, ll m) {
if (m == 1LL)
return x % MOD;
if (m == 0LL)
return 1LL;
if (m % 2LL == 0LL) {
return b_pow((x * x) % MOD, m / 2LL) % MOD;
} else {
return (x * b_pow((x * x) % MOD, m / 2LL)) % MOD;
}
}
ll inverse(ll x) {
if (x == 0)
return 1LL;
return b_pow(x, MOD - 2) % MOD;
}
ll nCk(ll n, ll k) {
if (n < k)
return 0LL;
return (((fact[n] % MOD) * inverse(fact[n - k])) % MOD * inverse(fact[k])) %
MOD;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
fact[0] = 1;
powd[0] = 1;
for (ll i = 1; i < MAXN - 1; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
powd[i] = powd[i - 1] * 25;
powd[i] %= MOD;
}
ll n;
cin >> n;
string S;
cin >> S;
ll k = S.size();
ll r = 0;
n += k;
for (int j = 0; j <= n - k; j++) {
// db(nCk(n, j + k)*powd[n - k - j]);
r += nCk(n, j + k) * powd[n - k - j];
r %= MOD;
}
cout << r << endl;
}
| #include <bits/stdc++.h>
#define all(a) a.begin(), a.end()
#define db(a) cout << fixed << #a << " = " << a << endl;
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const ll MOD = 1e9 + 7;
const int MAXN = 2e6 + 10;
ll fact[MAXN];
ll powd[MAXN];
ll b_pow(ll x, ll m) {
if (m == 1LL)
return x % MOD;
if (m == 0LL)
return 1LL;
if (m % 2LL == 0LL) {
return b_pow((x * x) % MOD, m / 2LL) % MOD;
} else {
return (x * b_pow((x * x) % MOD, m / 2LL)) % MOD;
}
}
ll inverse(ll x) {
if (x == 0)
return 1LL;
return b_pow(x, MOD - 2) % MOD;
}
ll nCk(ll n, ll k) {
if (n < k)
return 0LL;
return (((fact[n] % MOD) * inverse(fact[n - k])) % MOD * inverse(fact[k])) %
MOD;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
fact[0] = 1;
powd[0] = 1;
for (ll i = 1; i < MAXN - 1; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
powd[i] = powd[i - 1] * 25;
powd[i] %= MOD;
}
ll n;
cin >> n;
string S;
cin >> S;
ll k = S.size();
ll r = 0;
n += k;
for (int j = 0; j <= n - k; j++) {
// db(nCk(n, j + k)*powd[n - k - j]);
r += nCk(n, j + k) * powd[n - k - j];
r %= MOD;
}
cout << r << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02632 | C++ | Runtime Error | // Problem Link:
// Tutorial Link:
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define pLL pair<LL, LL>
#define ff first
#define ss second
#define rep(i, a, b) for (LL i = a; i <= b; ++i)
#define repb(i, a, b) for (LL i = a; i >= b; --i)
#define ld double
#define mp make_pair
#define vLL vector<LL>
#define vpLL vector<pLL>
#define vld vector<ld>
#define pld pair<ld, ld>
#define vpld vector<pld>
#define SLL set<LL>
#define SpLL set<pLL>
#define FIO ios::sync_with_stdio(false)
#define mod 1000000007
LL poww(LL a, LL n) {
if (n == 0)
return 1;
LL val = poww(a, n / 2);
if (n % 2 == 0)
return (val * val) % mod;
else
return (((val * val) % mod) * a) % mod;
}
LL k, n, fact[1000005], inv[1000005];
string s;
inline LL comb(LL n, LL k) {
if (n == 0 || k == 0 || n - k < 0)
return 1;
return (((fact[n] * inv[k]) % mod) * inv[n - k]) % mod;
}
int main() {
FIO;
cin >> k >> s;
fact[0] = 1;
inv[0] = 1;
n = s.length();
rep(i, 1, n + k + 2) {
fact[i] = (fact[i - 1] * i) % mod;
inv[i] = poww(fact[i], mod - 2);
}
LL ans = poww(26LL, n + k);
rep(i, 0, n - 1) {
LL val = comb(n + k, i);
val = (val * poww(25, n + k - i)) % mod;
ans = (ans + mod - val) % mod;
}
cout << ans << endl;
} | // Problem Link:
// Tutorial Link:
#include <bits/stdc++.h>
using namespace std;
#define LL long long
#define pb push_back
#define pLL pair<LL, LL>
#define ff first
#define ss second
#define rep(i, a, b) for (LL i = a; i <= b; ++i)
#define repb(i, a, b) for (LL i = a; i >= b; --i)
#define ld double
#define mp make_pair
#define vLL vector<LL>
#define vpLL vector<pLL>
#define vld vector<ld>
#define pld pair<ld, ld>
#define vpld vector<pld>
#define SLL set<LL>
#define SpLL set<pLL>
#define FIO ios::sync_with_stdio(false)
#define mod 1000000007
LL poww(LL a, LL n) {
if (n == 0)
return 1;
LL val = poww(a, n / 2);
if (n % 2 == 0)
return (val * val) % mod;
else
return (((val * val) % mod) * a) % mod;
}
LL k, n, fact[3000005], inv[3000005];
string s;
inline LL comb(LL n, LL k) {
if (n == 0 || k == 0 || n - k < 0)
return 1;
return (((fact[n] * inv[k]) % mod) * inv[n - k]) % mod;
}
int main() {
FIO;
cin >> k >> s;
fact[0] = 1;
inv[0] = 1;
n = s.length();
rep(i, 1, n + k + 2) {
fact[i] = (fact[i - 1] * i) % mod;
inv[i] = poww(fact[i], mod - 2);
}
LL ans = poww(26LL, n + k);
rep(i, 0, n - 1) {
LL val = comb(n + k, i);
val = (val * poww(25, n + k - i)) % mod;
ans = (ans + mod - val) % mod;
}
cout << ans << endl;
} | replace | 36 | 37 | 36 | 37 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fo(i, a, b) for ((i) = (a); i <= (b); i++)
#define rfo(i, a, b) for ((i) = (a); i >= (b); i--)
#define inrange(x, y, z) (((x) >= (y)) && ((x) <= (z)))
#define ALL(vec) ((vec).begin(), (vec).end())
#define SOR(vec) sort(ALL(vec))
#define UNI(vec) (vec).erase(unique(ALL(vec)), (vec).end())
using namespace std;
int k, n, l;
long long res, MOD = 1000000007, p25[1000100];
long long inv[1000100], fac[1000100], ifac[1000100];
void init_math(int N) {
inv[1] = 1LL;
for (int i = 2; i <= N; i++)
inv[i] = (MOD - ((MOD / i) * inv[MOD % i]) % MOD);
fac[0] = 1LL;
ifac[0] = 1LL;
for (int i = 1; i <= N; i++) {
fac[i] = (fac[i - 1] * (long long)(i)) % MOD;
ifac[i] = (ifac[i - 1] * inv[i]) % MOD;
}
}
long long C(int x, int y) {
return ((fac[x] * ifac[y]) % MOD * ifac[x - y]) % MOD;
}
string s;
int main() {
#ifdef FILIN
#ifndef DavidDesktop
freopen(FILIN, "r", stdin);
freopen(FILOUT, "w", stdout);
#endif
#endif
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> k >> s;
n = s.size() + k;
l = s.size();
init_math(n);
p25[0] = 1;
for (int x = 1; x <= n; x++) {
p25[x] = (p25[x - 1] * 25LL) % MOD;
}
for (int x = l; x <= n; x++) {
res = (res + C(n, x) * p25[n - x] % MOD) % MOD;
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
#define fo(i, a, b) for ((i) = (a); i <= (b); i++)
#define rfo(i, a, b) for ((i) = (a); i >= (b); i--)
#define inrange(x, y, z) (((x) >= (y)) && ((x) <= (z)))
#define ALL(vec) ((vec).begin(), (vec).end())
#define SOR(vec) sort(ALL(vec))
#define UNI(vec) (vec).erase(unique(ALL(vec)), (vec).end())
using namespace std;
int k, n, l;
long long res, MOD = 1000000007, p25[2000100];
long long inv[2000100], fac[2000100], ifac[2000100];
void init_math(int N) {
inv[1] = 1LL;
for (int i = 2; i <= N; i++)
inv[i] = (MOD - ((MOD / i) * inv[MOD % i]) % MOD);
fac[0] = 1LL;
ifac[0] = 1LL;
for (int i = 1; i <= N; i++) {
fac[i] = (fac[i - 1] * (long long)(i)) % MOD;
ifac[i] = (ifac[i - 1] * inv[i]) % MOD;
}
}
long long C(int x, int y) {
return ((fac[x] * ifac[y]) % MOD * ifac[x - y]) % MOD;
}
string s;
int main() {
#ifdef FILIN
#ifndef DavidDesktop
freopen(FILIN, "r", stdin);
freopen(FILOUT, "w", stdout);
#endif
#endif
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
cin >> k >> s;
n = s.size() + k;
l = s.size();
init_math(n);
p25[0] = 1;
for (int x = 1; x <= n; x++) {
p25[x] = (p25[x - 1] * 25LL) % MOD;
}
for (int x = l; x <= n; x++) {
res = (res + C(n, x) * p25[n - x] % MOD) % MOD;
}
cout << res << endl;
return 0;
}
| replace | 9 | 11 | 9 | 11 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double ld;
#define double long double
#define pii pair<int, int>
#define pdd pair<double, double>
#define pll pair<ll, ll>
#define sz(x) ((long long)x.size())
#define fr(a, b, c) for (int a = b; a <= c; a++)
#define frev(a, b, c) for (int a = c; a >= b; a--)
#define rep(a, b, c) for (int a = b; a < c; a++)
#define trav(a, x) for (auto &a : x)
#define all(con) con.begin(), con.end()
#define deb(x) cout << x << endl
#define done(x) \
{ \
cout << x << endl; \
return; \
}
const ll infl = 0x3f3f3f3f3f3f3f3fLL;
const int infi = 0x3f3f3f3f;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
// const int mod = 998244353;
const int mod = 1e9 + 7;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<pair<int, int>> vpii;
typedef map<int, int> mii;
typedef set<int> si;
typedef set<pair<int, int>> spii;
typedef queue<int> qi;
const int N = 1e6 + 5;
int dp[N];
void pre() {
dp[0] = 1;
rep(i, 1, N) dp[i] = dp[i - 1] * i % mod;
}
int powm(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
int divide(int a, int b) { return (a % mod) * powm(b, mod - 2) % mod; }
int ncr(int x, int y) { return divide(dp[x], dp[y] * dp[x - y] % mod); }
void solve() {
pre();
int k;
cin >> k;
string s;
cin >> s;
int n = sz(s), ans = powm(26, n + k);
rep(i, 0, n) ans =
(ans - ncr(n + k, i) * powm(25, n + k - i) % mod + mod) % mod;
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// srand(chrono::high_resolution_clock::now().time_since_epoch().count());
cout << fixed << setprecision(15);
int t = 1;
// cin >> t;
while (t--)
solve();
#ifdef aa
cout << endl
<< endl
<< endl
<< endl
<< "Time elapsed: " << (double)(clock() - clk) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
int norm(int a) {
while (a >= mod)
a -= mod;
while (a < 0)
a += mod;
return a;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
| #include <bits/stdc++.h>
using namespace std;
#ifndef aa
#define trace(...)
#define endl '\n'
#endif
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define fi first
#define se second
#define int long long
typedef long long ll;
typedef long double ld;
#define double long double
#define pii pair<int, int>
#define pdd pair<double, double>
#define pll pair<ll, ll>
#define sz(x) ((long long)x.size())
#define fr(a, b, c) for (int a = b; a <= c; a++)
#define frev(a, b, c) for (int a = c; a >= b; a--)
#define rep(a, b, c) for (int a = b; a < c; a++)
#define trav(a, x) for (auto &a : x)
#define all(con) con.begin(), con.end()
#define deb(x) cout << x << endl
#define done(x) \
{ \
cout << x << endl; \
return; \
}
const ll infl = 0x3f3f3f3f3f3f3f3fLL;
const int infi = 0x3f3f3f3f;
mt19937_64 mt(chrono::steady_clock::now().time_since_epoch().count());
// const int mod = 998244353;
const int mod = 1e9 + 7;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<pair<int, int>> vpii;
typedef map<int, int> mii;
typedef set<int> si;
typedef set<pair<int, int>> spii;
typedef queue<int> qi;
const int N = 2e6 + 5;
int dp[N];
void pre() {
dp[0] = 1;
rep(i, 1, N) dp[i] = dp[i - 1] * i % mod;
}
int powm(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = (res * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
int divide(int a, int b) { return (a % mod) * powm(b, mod - 2) % mod; }
int ncr(int x, int y) { return divide(dp[x], dp[y] * dp[x - y] % mod); }
void solve() {
pre();
int k;
cin >> k;
string s;
cin >> s;
int n = sz(s), ans = powm(26, n + k);
rep(i, 0, n) ans =
(ans - ncr(n + k, i) * powm(25, n + k - i) % mod + mod) % mod;
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
// srand(chrono::high_resolution_clock::now().time_since_epoch().count());
cout << fixed << setprecision(15);
int t = 1;
// cin >> t;
while (t--)
solve();
#ifdef aa
cout << endl
<< endl
<< endl
<< endl
<< "Time elapsed: " << (double)(clock() - clk) / CLOCKS_PER_SEC << endl;
#endif
return 0;
}
int norm(int a) {
while (a >= mod)
a -= mod;
while (a < 0)
a += mod;
return a;
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
| replace | 45 | 46 | 45 | 46 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 1e6 + 5;
const int INF = 0x3f3f3f3f;
const ll p = 1e9 + 7;
#define DEBUG(x) cout << x << '\n'
int F[MAXN], Finv[MAXN], inv[MAXN];
void init() {
F[0] = Finv[0] = inv[1] = 1;
for (int i = 2; i < MAXN; i++)
inv[i] = (p - p / i) * 1ll * inv[p % i] % p;
for (int i = 1; i < MAXN; i++) {
F[i] = F[i - 1] * 1ll * i % p;
Finv[i] = Finv[i - 1] * 1ll * inv[i] % p;
}
}
int C(int n, int m) { return F[n] * 1ll * Finv[n - m] % p * Finv[m] % p; }
ll f_pow(ll a, ll b) {
ll res = 1;
for (; b; b >>= 1, a = a * a % p)
if (b & 1)
res = res * a % p;
return res;
}
void run() {
int n, k;
string s;
cin >> k >> s;
init();
n = s.size();
int ans = 0;
for (int i = n; i <= n + k; i++) {
ans += C(i - 1, n - 1) * f_pow(26, n + k - i) % p * f_pow(25, i - n) % p;
ans %= p;
}
cout << ans;
}
int main() {
#ifdef Irene
freopen("in.txt", "r", stdin);
#endif // Irene
ios::sync_with_stdio(false);
run();
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MAXN = 2e6 + 5;
const int INF = 0x3f3f3f3f;
const ll p = 1e9 + 7;
#define DEBUG(x) cout << x << '\n'
int F[MAXN], Finv[MAXN], inv[MAXN];
void init() {
F[0] = Finv[0] = inv[1] = 1;
for (int i = 2; i < MAXN; i++)
inv[i] = (p - p / i) * 1ll * inv[p % i] % p;
for (int i = 1; i < MAXN; i++) {
F[i] = F[i - 1] * 1ll * i % p;
Finv[i] = Finv[i - 1] * 1ll * inv[i] % p;
}
}
int C(int n, int m) { return F[n] * 1ll * Finv[n - m] % p * Finv[m] % p; }
ll f_pow(ll a, ll b) {
ll res = 1;
for (; b; b >>= 1, a = a * a % p)
if (b & 1)
res = res * a % p;
return res;
}
void run() {
int n, k;
string s;
cin >> k >> s;
init();
n = s.size();
int ans = 0;
for (int i = n; i <= n + k; i++) {
ans += C(i - 1, n - 1) * f_pow(26, n + k - i) % p * f_pow(25, i - n) % p;
ans %= p;
}
cout << ans;
}
int main() {
#ifdef Irene
freopen("in.txt", "r", stdin);
#endif // Irene
ios::sync_with_stdio(false);
run();
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
const long long MOD = 1e9 + 7;
// const long long MOD=998244353;
const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
#define LOCAL
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < v.size(); ++i) {
os << v[i] << (i + 1 == v.size() ? "" : " ");
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
cout << '(' << p.first << ',' << p.second << ')';
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &m) {
os << '{';
for (auto itr = m.begin(); itr != m.end(); ++itr) {
os << '(' << itr->first << ',' << itr->second << ')';
if (++itr != m.end())
os << ',';
--itr;
}
os << '}';
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &s) {
os << '{';
for (auto itr = s.begin(); itr != s.end(); ++itr) {
os << *itr;
if (++itr != s.end())
os << ',';
--itr;
}
os << '}';
return os;
}
void debug_out() { cerr << '\n'; }
template <class Head, class... Tail>
void debug_out(Head &&head, Tail &&...tail) {
cerr << head;
if (sizeof...(Tail) > 0)
cerr << ", ";
debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) \
cerr << " "; \
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" \
<< '\n'; \
cerr << " "; \
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }
template <class T1, class T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#pragma endregion
template <uint_fast64_t Modulus> class modint {
using u64 = uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept
: a(((x % Modulus) + Modulus) % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint &operator+=(const modint &rhs) noexcept {
a += rhs.a;
if (a >= Modulus)
a -= Modulus;
return *this;
}
constexpr modint operator+(const modint &rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint &operator++() noexcept { return ++a, *this; }
constexpr modint operator++(int) noexcept {
modint t = *this;
return ++a, t;
}
constexpr modint &operator-=(const modint &rhs) noexcept {
if (a < rhs.a)
a += Modulus;
a -= rhs.a;
return *this;
}
constexpr modint operator-(const modint &rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint &operator--() noexcept { return --a, *this; }
constexpr modint operator--(int) noexcept {
modint t = *this;
return --a, t;
}
constexpr modint &operator*=(const modint &rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint operator*(const modint &rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp & 1)
*this *= rhs;
rhs *= rhs;
exp >>= 1;
}
return *this;
}
constexpr modint operator/(const modint &rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint operator-() const noexcept { return modint(Modulus - a); }
constexpr bool operator==(const modint &rhs) const noexcept {
return a == rhs.a;
}
constexpr bool operator!=(const modint &rhs) const noexcept {
return a != rhs.a;
}
constexpr bool operator!() const noexcept { return !a; }
friend constexpr modint pow(modint rhs, long long exp) noexcept {
modint res{1};
while (exp) {
if (exp & 1)
res *= rhs;
rhs *= rhs;
exp >>= 1;
}
return res;
}
template <class T> friend constexpr modint operator+(T x, modint y) noexcept {
return modint(x) + y;
}
template <class T> friend constexpr modint operator-(T x, modint y) noexcept {
return modint(x) - y;
}
template <class T> friend constexpr modint operator*(T x, modint y) noexcept {
return modint(x) * y;
}
template <class T> friend constexpr modint operator/(T x, modint y) noexcept {
return modint(x) / y;
}
friend ostream &operator<<(ostream &s, const modint &rhs) noexcept {
return s << rhs.a;
}
friend istream &operator>>(istream &s, modint &rhs) noexcept {
u64 a;
rhs = modint{(s >> a, a)};
return s;
}
};
using mint = modint<MOD>;
const int MAX = 5e5 + 10;
vector<mint> fac(MAX), finv(MAX), inv(MAX);
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; ++i) {
fac[i] = fac[i - 1] * i;
inv[i] = -inv[MOD % i] * (MOD / i);
finv[i] = finv[i - 1] * inv[i];
}
}
mint COM(int n, int k) {
if (n < k || n < 0 || k < 0)
return 0;
return fac[n] * finv[k] * finv[n - k];
}
// Be careful with the value of MAX and conducting COMinit()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
COMinit();
int K;
string S;
cin >> K >> S;
int n = S.size();
mint ans = 0;
for (int i = n; i <= K + n; ++i)
ans += COM(K + n, i) * pow((mint)25, K + n - i);
cout << ans << '\n';
} | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
const long long MOD = 1e9 + 7;
// const long long MOD=998244353;
const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
#define LOCAL
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
for (int i = 0; i < v.size(); ++i) {
os << v[i] << (i + 1 == v.size() ? "" : " ");
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
cout << '(' << p.first << ',' << p.second << ')';
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &m) {
os << '{';
for (auto itr = m.begin(); itr != m.end(); ++itr) {
os << '(' << itr->first << ',' << itr->second << ')';
if (++itr != m.end())
os << ',';
--itr;
}
os << '}';
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &s) {
os << '{';
for (auto itr = s.begin(); itr != s.end(); ++itr) {
os << *itr;
if (++itr != s.end())
os << ',';
--itr;
}
os << '}';
return os;
}
void debug_out() { cerr << '\n'; }
template <class Head, class... Tail>
void debug_out(Head &&head, Tail &&...tail) {
cerr << head;
if (sizeof...(Tail) > 0)
cerr << ", ";
debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) \
cerr << " "; \
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" \
<< '\n'; \
cerr << " "; \
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }
template <class T1, class T2> inline bool chmin(T1 &a, T2 b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T1, class T2> inline bool chmax(T1 &a, T2 b) {
if (a < b) {
a = b;
return true;
}
return false;
}
#pragma endregion
template <uint_fast64_t Modulus> class modint {
using u64 = uint_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept
: a(((x % Modulus) + Modulus) % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint &operator+=(const modint &rhs) noexcept {
a += rhs.a;
if (a >= Modulus)
a -= Modulus;
return *this;
}
constexpr modint operator+(const modint &rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint &operator++() noexcept { return ++a, *this; }
constexpr modint operator++(int) noexcept {
modint t = *this;
return ++a, t;
}
constexpr modint &operator-=(const modint &rhs) noexcept {
if (a < rhs.a)
a += Modulus;
a -= rhs.a;
return *this;
}
constexpr modint operator-(const modint &rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint &operator--() noexcept { return --a, *this; }
constexpr modint operator--(int) noexcept {
modint t = *this;
return --a, t;
}
constexpr modint &operator*=(const modint &rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint operator*(const modint &rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp & 1)
*this *= rhs;
rhs *= rhs;
exp >>= 1;
}
return *this;
}
constexpr modint operator/(const modint &rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint operator-() const noexcept { return modint(Modulus - a); }
constexpr bool operator==(const modint &rhs) const noexcept {
return a == rhs.a;
}
constexpr bool operator!=(const modint &rhs) const noexcept {
return a != rhs.a;
}
constexpr bool operator!() const noexcept { return !a; }
friend constexpr modint pow(modint rhs, long long exp) noexcept {
modint res{1};
while (exp) {
if (exp & 1)
res *= rhs;
rhs *= rhs;
exp >>= 1;
}
return res;
}
template <class T> friend constexpr modint operator+(T x, modint y) noexcept {
return modint(x) + y;
}
template <class T> friend constexpr modint operator-(T x, modint y) noexcept {
return modint(x) - y;
}
template <class T> friend constexpr modint operator*(T x, modint y) noexcept {
return modint(x) * y;
}
template <class T> friend constexpr modint operator/(T x, modint y) noexcept {
return modint(x) / y;
}
friend ostream &operator<<(ostream &s, const modint &rhs) noexcept {
return s << rhs.a;
}
friend istream &operator>>(istream &s, modint &rhs) noexcept {
u64 a;
rhs = modint{(s >> a, a)};
return s;
}
};
using mint = modint<MOD>;
const int MAX = 2e6 + 10;
vector<mint> fac(MAX), finv(MAX), inv(MAX);
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; ++i) {
fac[i] = fac[i - 1] * i;
inv[i] = -inv[MOD % i] * (MOD / i);
finv[i] = finv[i - 1] * inv[i];
}
}
mint COM(int n, int k) {
if (n < k || n < 0 || k < 0)
return 0;
return fac[n] * finv[k] * finv[n - k];
}
// Be careful with the value of MAX and conducting COMinit()
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
COMinit();
int K;
string S;
cin >> K >> S;
int n = S.size();
mint ans = 0;
for (int i = n; i <= K + n; ++i)
ans += COM(K + n, i) * pow((mint)25, K + n - i);
cout << ans << '\n';
} | replace | 192 | 193 | 192 | 193 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// #define ll long long
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) REP(i, 0, n)
#define rep_rev(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define all(x) (x).begin(), (x).end()
ll t1, t2, t3;
const ll mod = 1000000007;
const int INF = 1e9;
const ll INFLONG = 1e18;
// nの最大値が1e5の時とかは使える
const int MAX = 200001;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理 O(MAX)
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
// 前処理
COMinit();
ll k;
string s;
cin >> k;
cin >> s;
ll len1 = s.size();
ll len = len1 + k;
vector<ll> po1(len), po2(len);
po1[0] = 1;
po2[0] = 1;
rep(i, len - 1) {
po1[i + 1] = po1[i] * 25;
po1[i + 1] %= mod;
po2[i + 1] = po2[i] * 26;
po2[i + 1] %= mod;
}
ll ans = 0;
REP(i, len1 - 1, len) {
// cout << i+1 << " " << i-len1+1 << " " << len-i << endl;
// cout << COM(i,i-len1+1) << " " << po1[i-len1+1] << " " << po2[len-i-1] <<
// endl;
ans += (COM(i, i - len1 + 1) * po1[i - len1 + 1] % mod) * po2[len - i - 1];
ans %= mod;
// cout << ans << endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// #define ll long long
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
#define rep(i, n) REP(i, 0, n)
#define rep_rev(i, n) for (int(i) = (int)(n)-1; (i) >= 0; --(i))
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define all(x) (x).begin(), (x).end()
ll t1, t2, t3;
const ll mod = 1000000007;
const int INF = 1e9;
const ll INFLONG = 1e18;
// nの最大値が1e5の時とかは使える
const int MAX = 2000001;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理 O(MAX)
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
// 前処理
COMinit();
ll k;
string s;
cin >> k;
cin >> s;
ll len1 = s.size();
ll len = len1 + k;
vector<ll> po1(len), po2(len);
po1[0] = 1;
po2[0] = 1;
rep(i, len - 1) {
po1[i + 1] = po1[i] * 25;
po1[i + 1] %= mod;
po2[i + 1] = po2[i] * 26;
po2[i + 1] %= mod;
}
ll ans = 0;
REP(i, len1 - 1, len) {
// cout << i+1 << " " << i-len1+1 << " " << len-i << endl;
// cout << COM(i,i-len1+1) << " " << po1[i-len1+1] << " " << po2[len-i-1] <<
// endl;
ans += (COM(i, i - len1 + 1) * po1[i - len1 + 1] % mod) * po2[len - i - 1];
ans %= mod;
// cout << ans << endl;
}
cout << ans << endl;
} | replace | 31 | 32 | 31 | 32 | 0 | |
p02632 | C++ | Time Limit Exceeded | #include <stdio.h>
#define ULL unsigned long long
#define MOD 1000000007
#define MAX 30000000
ULL RepSq(ULL n, ULL m, ULL mod);
void nCk_init(int mod);
ULL nCk(int n, int k, int mod);
ULL fac[MAX], finv[MAX], inv[MAX];
int main() {
nCk_init(MOD);
int K, a, iCnt = 0;
scanf("%d", &K);
getchar();
while ((a = getchar()) != '\n')
iCnt++;
ULL ans = 0;
for (int i = 0; i <= K; i++) {
// inserted place patterns
ULL tmpChairs4OtherLetters = iCnt + K - i - 1;
ULL insPlacePatterns = nCk((int)tmpChairs4OtherLetters, iCnt - 1, MOD);
// inserted letter patterns
ULL insLetsBeforeLastLet = K - i;
ULL insLetPatterns = RepSq((ULL)26, (ULL)i, (ULL)MOD);
insLetPatterns *= RepSq((ULL)25, insLetsBeforeLastLet, (ULL)MOD);
insLetPatterns %= MOD;
ans += (insPlacePatterns * insLetPatterns % MOD);
ans %= MOD;
}
printf("%lld\n", ans);
return 0;
}
ULL RepSq(ULL x, ULL n, ULL mod) {
if (n == 0)
return 1;
ULL ret = 1;
while (0 < n) {
if (n & 1)
ret = ret * x % mod;
x = x * x % mod;
n >>= 1;
}
return ret;
}
void nCk_init(int mod) {
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;
}
}
ULL nCk(int n, int k, int mod) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
// Fermat's little theorem
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
| #include <stdio.h>
#define ULL unsigned long long
#define MOD 1000000007
#define MAX 10000000
ULL RepSq(ULL n, ULL m, ULL mod);
void nCk_init(int mod);
ULL nCk(int n, int k, int mod);
ULL fac[MAX], finv[MAX], inv[MAX];
int main() {
nCk_init(MOD);
int K, a, iCnt = 0;
scanf("%d", &K);
getchar();
while ((a = getchar()) != '\n')
iCnt++;
ULL ans = 0;
for (int i = 0; i <= K; i++) {
// inserted place patterns
ULL tmpChairs4OtherLetters = iCnt + K - i - 1;
ULL insPlacePatterns = nCk((int)tmpChairs4OtherLetters, iCnt - 1, MOD);
// inserted letter patterns
ULL insLetsBeforeLastLet = K - i;
ULL insLetPatterns = RepSq((ULL)26, (ULL)i, (ULL)MOD);
insLetPatterns *= RepSq((ULL)25, insLetsBeforeLastLet, (ULL)MOD);
insLetPatterns %= MOD;
ans += (insPlacePatterns * insLetPatterns % MOD);
ans %= MOD;
}
printf("%lld\n", ans);
return 0;
}
ULL RepSq(ULL x, ULL n, ULL mod) {
if (n == 0)
return 1;
ULL ret = 1;
while (0 < n) {
if (n & 1)
ret = ret * x % mod;
x = x * x % mod;
n >>= 1;
}
return ret;
}
void nCk_init(int mod) {
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;
}
}
ULL nCk(int n, int k, int mod) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
// Fermat's little theorem
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
| replace | 5 | 6 | 5 | 6 | TLE | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
#define inf 0x3f3f3f3f
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int N = 1e6 + 5;
const ll mod = 1e9 + 7;
int k, n;
ll ans;
string s;
int fac[N], inv[N];
int po(int x, int y) {
int res = 1;
while (y) {
if (y & 1)
res = 1ll * res * x % mod;
y >>= 1;
x = 1ll * x * x % mod;
}
return res % mod;
}
int ncr(int n, int r) {
if (r > n)
return 0;
return 1ll * fac[n] * inv[r] % mod * inv[n - r] % mod;
}
int main() {
fast cin >> k >> s;
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = 1ll * i * fac[i - 1] % mod;
inv[N - 1] = po(fac[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--)
inv[i] = 1ll * (i + 1) * (inv[i + 1]) % mod;
n = s.size();
for (int i = 0; i <= k; i++) {
ans = (ans +
1ll * po(25, k - i) * po(26, i) % mod * ncr(n - 1 + k - i, n - 1)) %
mod;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define endl "\n"
#define se second
#define ll long long
#define inf 0x3f3f3f3f
#define fast \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
const int N = 2e6 + 5;
const ll mod = 1e9 + 7;
int k, n;
ll ans;
string s;
int fac[N], inv[N];
int po(int x, int y) {
int res = 1;
while (y) {
if (y & 1)
res = 1ll * res * x % mod;
y >>= 1;
x = 1ll * x * x % mod;
}
return res % mod;
}
int ncr(int n, int r) {
if (r > n)
return 0;
return 1ll * fac[n] * inv[r] % mod * inv[n - r] % mod;
}
int main() {
fast cin >> k >> s;
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = 1ll * i * fac[i - 1] % mod;
inv[N - 1] = po(fac[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--)
inv[i] = 1ll * (i + 1) * (inv[i + 1]) % mod;
n = s.size();
for (int i = 0; i <= k; i++) {
ans = (ans +
1ll * po(25, k - i) * po(26, i) % mod * ncr(n - 1 + k - i, n - 1)) %
mod;
}
cout << ans;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srepn(i, l, n) for (int i = l; i <= (int)(n); i++)
#define drep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define drepn(i, n) for (int i = (int)(n); i >= 0; i--)
#define size(s) (int)s.size()
#define debug(var) \
do { \
std::cout << #var << " : "; \
view(var); \
} while (0)
template <typename T> void view(T e) { std::cout << e << std::endl; }
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
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 = int> using V = vector<T>;
template <class T = int> using VV = vector<V<T>>;
bool isIn(int i, int j, int h, int w) {
return i >= 0 && i < h && j >= 0 && j < w;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void err() { cout << -1 << endl; }
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define ep emplace_back
const int MOD = 1000000007;
const int INF = 1e9;
#define PI acos(-1);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int ddx[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int ddy[8] = {0, 1, -1, 0, 1, -1, 1, -1};
const ll MAX = 200000;
ll inv[MAX], fac[MAX], finv[MAX];
void settable() {
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 choose(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 n, ll k) {
ll rtn = 1;
while (k > 0) {
if (k & 1)
rtn = rtn * n % MOD;
n = n * n % MOD;
k = k >> 1;
}
return rtn;
}
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;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
settable();
int k;
string s;
cin >> k >> s;
mint ans = 0;
srepn(i, size(s), size(s) + k) {
mint now = 1;
now *= modpow(26, size(s) + k - i);
now *= modpow(25, i - size(s));
now *= choose(i - 1, size(s) - 1);
ans += now;
}
cout << ans.x << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using PLL = pair<ll, ll>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repn(i, n) for (int i = 0; i <= (int)(n); i++)
#define srep(i, l, n) for (int i = l; i < (int)(n); i++)
#define srepn(i, l, n) for (int i = l; i <= (int)(n); i++)
#define drep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define drepn(i, n) for (int i = (int)(n); i >= 0; i--)
#define size(s) (int)s.size()
#define debug(var) \
do { \
std::cout << #var << " : "; \
view(var); \
} while (0)
template <typename T> void view(T e) { std::cout << e << std::endl; }
template <typename T> void view(const std::vector<T> &v) {
for (const auto &e : v) {
std::cout << e << " ";
}
std::cout << std::endl;
}
template <typename T> void view(const std::vector<std::vector<T>> &vv) {
for (const auto &v : vv) {
view(v);
}
}
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 = int> using V = vector<T>;
template <class T = int> using VV = vector<V<T>>;
bool isIn(int i, int j, int h, int w) {
return i >= 0 && i < h && j >= 0 && j < w;
}
void Yes() { cout << "Yes" << endl; }
void No() { cout << "No" << endl; }
void YES() { cout << "YES" << endl; }
void NO() { cout << "NO" << endl; }
void err() { cout << -1 << endl; }
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define pb push_back
#define ep emplace_back
const int MOD = 1000000007;
const int INF = 1e9;
#define PI acos(-1);
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
int ddx[8] = {1, 1, 1, -1, -1, -1, 0, 0};
int ddy[8] = {0, 1, -1, 0, 1, -1, 1, -1};
const ll MAX = 2000000;
ll inv[MAX], fac[MAX], finv[MAX];
void settable() {
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 choose(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 n, ll k) {
ll rtn = 1;
while (k > 0) {
if (k & 1)
rtn = rtn * n % MOD;
n = n * n % MOD;
k = k >> 1;
}
return rtn;
}
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;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
settable();
int k;
string s;
cin >> k >> s;
mint ans = 0;
srepn(i, size(s), size(s) + k) {
mint now = 1;
now *= modpow(26, size(s) + k - i);
now *= modpow(25, i - size(s));
now *= choose(i - 1, size(s) - 1);
ans += now;
}
cout << ans.x << endl;
} | replace | 68 | 69 | 68 | 69 | 0 | |
p02632 | C++ | Runtime Error | /// kazuki08
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef long long ll;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
#define ar array
// #define inf 1000000000
#define mod 1000000007
#define dmp(x) cerr << "line " << __LINE__ << " " << #x << ":" << x << endl
#define fs first
#define sc second
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define mt make_tuple
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
template <class S, class T>
ostream &operator<<(ostream &o, const pair<S, T> &p) {
return o << "(" << p.fs << "," << p.sc << ")";
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &vc) {
o << "{";
for (const T &v : vc)
o << v << ",";
o << "}";
return o;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MAX = 1000005;
int fac[MAX], inv[MAX], finv[MAX];
void pre() {
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
inv[i] = inv[mod % i] * (mod - mod / i) % mod;
}
fac[0] = finv[0] = 1;
for (int i = 1; i < MAX; ++i) {
fac[i] = fac[i - 1] * i % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
int ncr(int n, int r) {
if (r < 0 || r > n)
return 0;
return fac[n] * finv[r] % mod * finv[n - r] % mod;
}
int modpow(int x, int n, int m) {
if (n == 0)
return 1 % m;
long long u = modpow(x, n / 2, m);
u = (u * u) % m;
if (n % 2 == 1)
u = (u * x) % m;
return u;
}
string s;
int k;
signed main() {
IOS;
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
pre();
cin >> k;
cin >> s;
int n = s.size();
int ans = modpow(26, n + k, mod);
for (int i = 0; i < n; i++) {
ans = (ans - ncr(n + k, i) * modpow(25, n + k - i, mod) % mod + mod) % mod;
}
cout << ans << endl;
return 0;
}
///....
| /// kazuki08
/*
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
typedef long long ll;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
#define ar array
// #define inf 1000000000
#define mod 1000000007
#define dmp(x) cerr << "line " << __LINE__ << " " << #x << ":" << x << endl
#define fs first
#define sc second
#define pb push_back
#define all(c) (c).begin(), (c).end()
#define mt make_tuple
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
template <class S, class T>
ostream &operator<<(ostream &o, const pair<S, T> &p) {
return o << "(" << p.fs << "," << p.sc << ")";
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &vc) {
o << "{";
for (const T &v : vc)
o << v << ",";
o << "}";
return o;
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MAX = 2000005;
int fac[MAX], inv[MAX], finv[MAX];
void pre() {
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
inv[i] = inv[mod % i] * (mod - mod / i) % mod;
}
fac[0] = finv[0] = 1;
for (int i = 1; i < MAX; ++i) {
fac[i] = fac[i - 1] * i % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
int ncr(int n, int r) {
if (r < 0 || r > n)
return 0;
return fac[n] * finv[r] % mod * finv[n - r] % mod;
}
int modpow(int x, int n, int m) {
if (n == 0)
return 1 % m;
long long u = modpow(x, n / 2, m);
u = (u * u) % m;
if (n % 2 == 1)
u = (u * x) % m;
return u;
}
string s;
int k;
signed main() {
IOS;
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
pre();
cin >> k;
cin >> s;
int n = s.size();
int ans = modpow(26, n + k, mod);
for (int i = 0; i < n; i++) {
ans = (ans - ncr(n + k, i) * modpow(25, n + k - i, mod) % mod + mod) % mod;
}
cout << ans << endl;
return 0;
}
///....
| replace | 48 | 49 | 48 | 49 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())
#define pb push_back
#define pii pair<int, int>
#define print(x) \
for (auto it : x) \
cout << it << ' ';
#define endl "\n" // TODO: remove
#define int long long
const int N = (int)(1e6) + 322;
const int inf = (int)(2e18);
const int mod = (int)(1e9) + 7; // check modulo
int fact[N], inv[N];
inline int mult(int a, int b) { return 1ll * a * b % mod; }
inline int binpow(int a, int n) {
int res = 1;
while (n) {
if (n & 1) {
res = mult(res, a);
}
a = mult(a, a);
n >>= 1;
}
return res;
}
inline int add(int a, int b) {
if (a + b >= mod)
return a + b - mod;
else
return a + b;
}
inline int sub(int a, int b) {
if (a - b < 0)
return a - b + mod;
else
return a - b;
}
inline int getinv(int a) { return binpow(a, mod - 2); }
inline int divide(int a, int b) { return mult(a, getinv(b)); }
inline int C(int n, int k) {
if (n < k)
return 0;
return mult(fact[n], mult(inv[k], inv[n - k]));
}
void init(int lim) {
fact[0] = 1;
inv[0] = 1;
for (int i = 1; i < lim; ++i) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = binpow(fact[i], mod - 2);
}
}
void solve(int test) {
init(N);
int k;
cin >> k;
string s;
cin >> s;
int n = sz(s);
k += n;
int all = binpow(26, k);
for (int i = 0; i < n; ++i) {
all = sub(all, mult(C(k, i), binpow(25, k - i)));
}
cout << all;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int test = 1; // cin >> test;
for (int tt = 1; tt <= test; ++tt) {
solve(tt);
}
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x.size())
#define pb push_back
#define pii pair<int, int>
#define print(x) \
for (auto it : x) \
cout << it << ' ';
#define endl "\n" // TODO: remove
#define int long long
const int N = (int)(2e6) + 322;
const int inf = (int)(2e18);
const int mod = (int)(1e9) + 7; // check modulo
int fact[N], inv[N];
inline int mult(int a, int b) { return 1ll * a * b % mod; }
inline int binpow(int a, int n) {
int res = 1;
while (n) {
if (n & 1) {
res = mult(res, a);
}
a = mult(a, a);
n >>= 1;
}
return res;
}
inline int add(int a, int b) {
if (a + b >= mod)
return a + b - mod;
else
return a + b;
}
inline int sub(int a, int b) {
if (a - b < 0)
return a - b + mod;
else
return a - b;
}
inline int getinv(int a) { return binpow(a, mod - 2); }
inline int divide(int a, int b) { return mult(a, getinv(b)); }
inline int C(int n, int k) {
if (n < k)
return 0;
return mult(fact[n], mult(inv[k], inv[n - k]));
}
void init(int lim) {
fact[0] = 1;
inv[0] = 1;
for (int i = 1; i < lim; ++i) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = binpow(fact[i], mod - 2);
}
}
void solve(int test) {
init(N);
int k;
cin >> k;
string s;
cin >> s;
int n = sz(s);
k += n;
int all = binpow(26, k);
for (int i = 0; i < n; ++i) {
all = sub(all, mult(C(k, i), binpow(25, k - i)));
}
cout << all;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
int test = 1; // cin >> test;
for (int tt = 1; tt <= test; ++tt) {
solve(tt);
}
return 0;
} | replace | 40 | 41 | 40 | 41 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define DEBUG(x) cout << #x << "=" << x << endl
#define DEBUG2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
typedef long long ll;
// #define LOCAL
const int MAXN = 1e6 + 10;
const ll MOD = 1e9 + 7;
ll _gcd(ll a, ll b) {
if (b == 0)
return a;
return _gcd(b, a % b);
}
ll gcd(ll a, ll b) {
a = abs(a), b = abs(b);
if (a < b)
swap(a, b);
return _gcd(a, b);
}
ll qpow(ll a, ll n) {
ll rt = 1;
while (n) {
if (n & 1)
rt = (rt * a) % MOD;
a = a * a % MOD;
n >>= 1;
}
return rt;
}
ll factor[MAXN];
void cal_factor() {
factor[0] = 1;
for (int u = 1; u < MAXN; u++) {
factor[u] = (factor[u - 1] * u) % MOD;
}
}
ll C(ll n, ll k) {
return factor[n] * qpow(factor[n - k], MOD - 2) % MOD *
qpow(factor[k], MOD - 2) % MOD;
}
void solve() {
cal_factor();
ll K, N;
string s;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> K >> s;
N = K + s.size();
ll ans = qpow(26, N);
for (ll k = 0; k < s.size(); k++) {
ans = (ans - C(N, k) * qpow(25, N - k) % MOD + MOD) % MOD;
}
cout << ans;
}
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif
solve();
} | #include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
#define DEBUG(x) cout << #x << "=" << x << endl
#define DEBUG2(x, y) cout << #x << "=" << x << "," << #y << "=" << y << endl
typedef long long ll;
// #define LOCAL
const int MAXN = 2e6 + 10;
const ll MOD = 1e9 + 7;
ll _gcd(ll a, ll b) {
if (b == 0)
return a;
return _gcd(b, a % b);
}
ll gcd(ll a, ll b) {
a = abs(a), b = abs(b);
if (a < b)
swap(a, b);
return _gcd(a, b);
}
ll qpow(ll a, ll n) {
ll rt = 1;
while (n) {
if (n & 1)
rt = (rt * a) % MOD;
a = a * a % MOD;
n >>= 1;
}
return rt;
}
ll factor[MAXN];
void cal_factor() {
factor[0] = 1;
for (int u = 1; u < MAXN; u++) {
factor[u] = (factor[u - 1] * u) % MOD;
}
}
ll C(ll n, ll k) {
return factor[n] * qpow(factor[n - k], MOD - 2) % MOD *
qpow(factor[k], MOD - 2) % MOD;
}
void solve() {
cal_factor();
ll K, N;
string s;
ios::sync_with_stdio(false);
cin.tie(0);
cin >> K >> s;
N = K + s.size();
ll ans = qpow(26, N);
for (ll k = 0; k < s.size(); k++) {
ans = (ans - C(N, k) * qpow(25, N - k) % MOD + MOD) % MOD;
}
cout << ans;
}
int main() {
#ifdef LOCAL
freopen("in.txt", "r", stdin);
#endif
solve();
} | replace | 19 | 20 | 19 | 20 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
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; }
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
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(1000005);
// nPk
mint f(int n, int k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
// 組み合わせの数nCrを計算
int calcNumOfCombination(int n, int r) {
int num = 1;
for (int i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
int main() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
mint ans = 0;
vector<mint> p(1000005);
vector<mint> P(1000005);
/*
p[0]=1;
P[0]=1;
rep(i,1000005){
p[i+1]=p[i]*25;
P[i+1]=P[i]*26;
}
*/
rep(i, k + 1) {
mint temp = mint(26).pow(i);
temp *= mint(25).pow(k - i);
mint c = comb(n + k - i - 1, n - 1);
temp *= c;
ans += temp;
// cout<<ans<<endl;
}
cout << ans.x;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (ll i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
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; }
// combination mod prime
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
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(2000005);
// nPk
mint f(int n, int k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
// 組み合わせの数nCrを計算
int calcNumOfCombination(int n, int r) {
int num = 1;
for (int i = 1; i <= r; i++) {
num = num * (n - i + 1) / i;
}
return num;
}
int main() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
mint ans = 0;
vector<mint> p(1000005);
vector<mint> P(1000005);
/*
p[0]=1;
P[0]=1;
rep(i,1000005){
p[i+1]=p[i]*25;
P[i+1]=P[i]*26;
}
*/
rep(i, k + 1) {
mint temp = mint(26).pow(i);
temp *= mint(25).pow(k - i);
mint c = comb(n + k - i - 1, n - 1);
temp *= c;
ans += temp;
// cout<<ans<<endl;
}
cout << ans.x;
}
| replace | 68 | 69 | 68 | 69 | 0 | |
p02632 | C++ | Runtime Error | #pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VPII vector<PII>
#define VPLL vector<PLL>
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr ll mod = 1e9 + 7;
constexpr int NIL = -1;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#pragma endregion
//-------------------
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
bool operator==(const mint a) const { return x == a.x; }
bool operator!=(const mint a) const { return x != a.x; }
bool operator>=(const mint a) { return (x >= a.x) ? 1 : 0; }
bool operator<(const mint a) { return !(*this >= a); }
bool operator>(const mint a) { return (x > a.x) ? 1 : 0; }
bool operator<=(const mint a) { return !(*this > a); }
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; // 2 square
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(100005);
mint f(int n, int k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
int n;
string s;
int main() {
cin.tie(0);
ios::sync_with_stdio(false); // cout << fixed << setprecision(15);
cin >> n >> s;
mint ans(0);
int sz = n + s.size();
ans += mint(26).pow(sz);
FOR(i, 0, s.size() - 1) { ans -= comb(sz, i) * (mint(25).pow(sz - i)); }
cout << ans.x << endl;
return 0;
}
| #pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FORR(x, arr) for (auto &x : arr)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VPII vector<PII>
#define VPLL vector<PLL>
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
constexpr int INF = 1 << 30;
constexpr ll LINF = 1LL << 60;
constexpr ll mod = 1e9 + 7;
constexpr int NIL = -1;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#pragma endregion
//-------------------
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
bool operator==(const mint a) const { return x == a.x; }
bool operator!=(const mint a) const { return x != a.x; }
bool operator>=(const mint a) { return (x >= a.x) ? 1 : 0; }
bool operator<(const mint a) { return !(*this >= a); }
bool operator>(const mint a) { return (x > a.x) ? 1 : 0; }
bool operator<=(const mint a) { return !(*this > a); }
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; // 2 square
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(2000005);
mint f(int n, int k) {
if (n < 0)
return 0;
// nPk = nCk * k!
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
int n;
string s;
int main() {
cin.tie(0);
ios::sync_with_stdio(false); // cout << fixed << setprecision(15);
cin >> n >> s;
mint ans(0);
int sz = n + s.size();
ans += mint(26).pow(sz);
FOR(i, 0, s.size() - 1) { ans -= comb(sz, i) * (mint(25).pow(sz - i)); }
cout << ans.x << endl;
return 0;
}
| replace | 110 | 111 | 110 | 111 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
#ifdef _DEBUG
inline void dump() { cerr << endl; }
template <typename Head> void dump(Head &&head) {
cerr << head;
dump();
}
template <typename Head, typename... Tail>
void dump(Head &&head, Tail &&...tail) {
cerr << head << ", ";
dump(forward<Tail>(tail)...);
}
#define debug(...) \
do { \
cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; \
dump(__VA_ARGS__); \
} while (false)
#else
#define dump(...)
#define debug(...)
#endif
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template <typename T> using Matrix = vector<vector<T>>;
/////////////////////////////////////////////////////////////////////
const ll inf = 1LL << 60;
const ll mod = 1000000007;
struct mint {
ll x;
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;
}
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; }
bool operator==(const mint a) const { return x == a.x; }
bool operator!=(const mint a) const { return x != a.x; }
friend ostream &operator<<(ostream &os, const mint &p) { return os << p.x; }
friend istream &operator>>(istream &is, mint &a) {
ll t;
is >> t;
a = mint(t);
return (is);
}
};
template <typename T> struct Comb {
vector<T> fact, finv, inv;
Comb(int n) : fact(n, 1), finv(n, 1), inv(n, 1) { init(n); }
void init(int n) {
fact.assign(n, 1), finv.assign(n, 1), inv.assign(n, 1);
for (ll i = 2; i < n; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
T nck(int n, int k) {
if (n < k || n < 0 || k < 0)
return 0;
return fact[n] * (finv[k] * finv[n - k] % mod) % mod;
}
T nhk(int n, int k) { return nck(n + k - 1, k); }
T npk(int n, int k) {
if (n < k || n < 0 || k < 0)
return 0;
return fact[n] * finv[n - k] % mod;
}
};
int main() {
ll k;
cin >> k;
string s;
cin >> s;
Comb<ll> c(1000010);
ll n = s.size();
mint ans = 0;
rep(i, k + 1) {
mint tmp = mint(25).pow(i) * c.nhk(n, i);
tmp *= mint(26).pow(k - i);
ans += tmp;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, a) for (int i = 0; i < (a); i++)
typedef long long ll;
#ifdef _DEBUG
inline void dump() { cerr << endl; }
template <typename Head> void dump(Head &&head) {
cerr << head;
dump();
}
template <typename Head, typename... Tail>
void dump(Head &&head, Tail &&...tail) {
cerr << head << ", ";
dump(forward<Tail>(tail)...);
}
#define debug(...) \
do { \
cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; \
dump(__VA_ARGS__); \
} while (false)
#else
#define dump(...)
#define debug(...)
#endif
template <typename T> struct edge {
int src, to;
T cost;
edge(int to, T cost) : src(-1), to(to), cost(cost) {}
edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}
edge &operator=(const int &x) {
to = x;
return *this;
}
operator int() const { return to; }
};
template <typename T> using Edges = vector<edge<T>>;
template <typename T> using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template <typename T> using Matrix = vector<vector<T>>;
/////////////////////////////////////////////////////////////////////
const ll inf = 1LL << 60;
const ll mod = 1000000007;
struct mint {
ll x;
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;
}
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; }
bool operator==(const mint a) const { return x == a.x; }
bool operator!=(const mint a) const { return x != a.x; }
friend ostream &operator<<(ostream &os, const mint &p) { return os << p.x; }
friend istream &operator>>(istream &is, mint &a) {
ll t;
is >> t;
a = mint(t);
return (is);
}
};
template <typename T> struct Comb {
vector<T> fact, finv, inv;
Comb(int n) : fact(n, 1), finv(n, 1), inv(n, 1) { init(n); }
void init(int n) {
fact.assign(n, 1), finv.assign(n, 1), inv.assign(n, 1);
for (ll i = 2; i < n; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
T nck(int n, int k) {
if (n < k || n < 0 || k < 0)
return 0;
return fact[n] * (finv[k] * finv[n - k] % mod) % mod;
}
T nhk(int n, int k) { return nck(n + k - 1, k); }
T npk(int n, int k) {
if (n < k || n < 0 || k < 0)
return 0;
return fact[n] * finv[n - k] % mod;
}
};
int main() {
ll k;
cin >> k;
string s;
cin >> s;
Comb<ll> c(2000010);
ll n = s.size();
mint ans = 0;
rep(i, k + 1) {
mint tmp = mint(25).pow(i) * c.nhk(n, i);
tmp *= mint(26).pow(k - i);
ans += tmp;
}
cout << ans << endl;
return 0;
}
| replace | 120 | 121 | 120 | 121 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 1e6 + 5;
bool cnt[30] = {};
long long fac[N] = {};
long long inv(long long x) {
if (x == 1)
return 1;
return (mod - mod / x) * inv(mod % x) % mod;
}
void init() {
fac[0] = 1;
for (long long i = 1; i < N; i++)
fac[i] = fac[i - 1] * i % mod;
}
long long ksm(long long a, long long b) {
if (b == 0)
return 1;
if (b & 1)
return a * ksm(a * a % mod, b >> 1) % mod;
return ksm(a * a % mod, b >> 1);
}
long long C(long long a, long long b) {
return fac[a] * inv(fac[b] * fac[a - b] % mod) % mod;
}
int main() {
string str;
init();
long long k, len;
cin >> k >> str;
len = str.size();
long long ans = 0;
for (long long i = len; i <= k + len; i++)
ans = (ans + (C(i - 1, len - 1) * ksm(26, len + k - i) % mod) *
ksm(25, i - len)) %
mod;
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const int N = 2e6 + 5;
long long fac[N] = {};
long long inv(long long x) {
if (x == 1)
return 1;
return (mod - mod / x) * inv(mod % x) % mod;
}
void init() {
fac[0] = 1;
for (long long i = 1; i < N; i++)
fac[i] = fac[i - 1] * i % mod;
}
long long ksm(long long a, long long b) {
if (b == 0)
return 1;
if (b & 1)
return a * ksm(a * a % mod, b >> 1) % mod;
return ksm(a * a % mod, b >> 1);
}
long long C(long long a, long long b) {
return fac[a] * inv(fac[b] * fac[a - b] % mod) % mod;
}
int main() {
string str;
init();
long long k, len;
cin >> k >> str;
len = str.size();
long long ans = 0;
for (long long i = len; i <= k + len; i++)
ans = (ans + (C(i - 1, len - 1) * ksm(26, len + k - i) % mod) *
ksm(25, i - len)) %
mod;
cout << ans << '\n';
return 0;
} | replace | 3 | 5 | 3 | 4 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
// using ll = long long;
using ull = uint64_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f64 = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ld = double;
#define X first
#define Y second
#ifndef ONLINE_JUDGE
#define FWRITE
#endif
namespace io {
#ifndef FWRITE
#include <unistd.h>
auto unistd_read = read;
auto unistd_write = write;
#endif
const int BUFSIZE = 1 << 20;
int isize, osize;
char ibuf[BUFSIZE + 10], obuf[BUFSIZE + 10];
char *is, *it, *os = obuf, *ot = obuf + BUFSIZE;
char getchar() {
if (is == it) {
is = ibuf;
#ifdef FWRITE
it = ibuf + fread(ibuf, 1, BUFSIZE, stdin);
#else
it = ibuf + unistd_read(STDIN_FILENO, ibuf, BUFSIZE);
#endif
if (is == it)
return EOF;
}
return *is++;
}
char getalpha() {
char c = getchar();
while (!isalpha(c))
c = getchar();
return c;
}
void putchar(char c) {
*os++ = c;
if (os == ot) {
#ifdef FWRITE
fwrite(obuf, 1, BUFSIZE, stdout);
#else
unistd_write(STDOUT_FILENO, obuf, BUFSIZE);
#endif
os = obuf;
}
}
int inp() {
int x = 0, f = 0;
char ch;
for (ch = getchar(); !isdigit(ch); ch = getchar()) {
if (ch == EOF)
return -1;
if (ch == '-')
f = 1;
}
for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
;
return f ? -x : x;
}
ll inp_ll() {
ll x = 0;
int f = 0;
char ch;
for (ch = getchar(); !isdigit(ch); ch = getchar())
if (ch == '-')
f = 1;
for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
;
return f ? -x : x;
}
template <class T> bool read(T &x) {
x = 0;
int f = 0;
char ch;
for (ch = getchar(); !isdigit(ch); ch = getchar()) {
if (ch == EOF)
return 0;
if (ch == '-')
f = 1;
}
for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
;
if (f)
x = -x;
return 1;
}
bool read(char *s) {
char *t = s;
char ch = getchar();
for (; ch == ' ' || ch == '\n'; ch = getchar())
;
for (; ch != ' ' && ch != '\n' && ch != EOF; ch = getchar())
*t++ = ch;
*t = 0;
return s != t;
}
template <class T, class... Args> bool read(T &x, Args &...args) {
return read(x) && read(args...);
}
template <class T> bool readln(T &x) {
x = 0;
int f = 0;
char ch;
for (ch = getchar(); !isdigit(ch); ch = getchar()) {
if (ch == EOF)
return 0;
if (ch == '-')
f = 1;
}
for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
;
if (f)
x = -x;
for (; ch != '\n' && ch != EOF; ch = getchar())
;
return 1;
}
bool readln(char *s) {
char *t = s;
while (1) {
char ch = getchar();
if (ch == '\n' || ch == EOF)
break;
*t++ = ch;
}
*t = 0;
return s != t;
}
template <class T, class... Args> bool readln(T &x, Args &...args) {
return read(x) && readln(args...);
}
template <class T> void write(T x) {
static char s[22];
static char *it = s + 20;
static char *end = s + 20;
if (x < 0) {
putchar('-');
x = -x;
}
do {
*--it = x % 10 + '0';
x /= 10;
} while (x);
/*
if (!x)
*-- it = '0';
while (x)
{
*-- it = x%10+'0';
x /= 10;
}
*/
for (; it < end; ++it)
putchar(*it);
}
void write(const char *s) {
for (; *s; ++s)
putchar(*s);
}
template <> void write(char *s) { write((const char *)s); }
template <> void write(char c) { putchar(c); }
template <class T, class... Args> void write(T x, Args... args) {
write(x);
write(args...);
}
void writeln() { putchar('\n'); }
template <class T, class... Args> void writeln(T x, Args... args) {
write(x);
writeln(args...);
}
template <class Iterator> bool input(Iterator st, Iterator ed) {
for (; st != ed; ++st) {
if (!read(*st))
return false;
}
return true;
}
template <class T> bool input(T &a) { return input(a.begin(), a.end()); }
template <class Iterator>
void print(Iterator st, Iterator ed, const char *c = " ") {
int flag = 0;
for (; st != ed; ++st) {
if (flag)
write(c);
flag = 1;
write(*st);
}
writeln();
}
template <class T> void print(const T &a, const char *c = " ") {
print(a.begin(), a.end(), c);
}
struct ender {
~ender() {
if (os != obuf)
#ifdef FWRITE
fwrite(obuf, 1, os - obuf, stdout);
#else
unistd_write(STDOUT_FILENO, obuf, os - obuf);
#endif
}
} __ender;
} // namespace io
int64_t power(int64_t a, int64_t b, int64_t p) {
if (!b)
return 1;
int64_t t = power(a, b >> 1, p);
t = t * t % p;
if (b & 1)
t = t * a % p;
return t;
}
// mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 rd(1);
using namespace io;
template <class T> inline void freshmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> inline void freshmax(T &a, const T &b) {
if (a < b)
a = b;
}
// const ll B = 31;
// const ll MOD = 998244353;
const int INF = 1000000010;
const ll INFll = 4000000000000000000LL;
const int MAXN = 500010;
int dx[] = {-1, 1, 0, 0, -1, -1, 1, 1};
int dy[] = {0, 0, -1, 1, -1, 1, -1, 1};
ld det(ld x1, ld y1, ld x2, ld y2, ld x3, ld y3) {
return x1 * y2 - x2 * y1 + x2 * y3 - x3 * y2 + x3 * y1 - x1 * y3;
}
const int MOD = 1000000007;
struct mod_int {
int val;
mod_int(long long v = 0) {
if (v < 0)
v = v % MOD + MOD;
if (v >= MOD)
v %= MOD;
val = v;
}
static int mod_inv(int a, int m = MOD) {
// https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm#Example
int g = m, r = a, 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 + m : x;
}
explicit operator int() const { return val; }
mod_int &operator+=(const mod_int &other) {
val += other.val;
if (val >= MOD)
val -= MOD;
return *this;
}
mod_int &operator-=(const mod_int &other) {
val -= other.val;
if (val < 0)
val += MOD;
return *this;
}
static unsigned fast_mod(uint64_t x, unsigned m = MOD) { return x % m; }
mod_int &operator*=(const mod_int &other) {
val = fast_mod((uint64_t)val * other.val);
return *this;
}
mod_int &operator/=(const mod_int &other) { return *this *= other.inv(); }
friend mod_int operator+(const mod_int &a, const mod_int &b) {
return mod_int(a) += b;
}
friend mod_int operator-(const mod_int &a, const mod_int &b) {
return mod_int(a) -= b;
}
friend mod_int operator*(const mod_int &a, const mod_int &b) {
return mod_int(a) *= b;
}
friend mod_int operator/(const mod_int &a, const mod_int &b) {
return mod_int(a) /= b;
}
mod_int &operator++() {
val = val == MOD - 1 ? 0 : val + 1;
return *this;
}
mod_int &operator--() {
val = val == 0 ? MOD - 1 : val - 1;
return *this;
}
mod_int operator++(int) {
mod_int before = *this;
++*this;
return before;
}
mod_int operator--(int) {
mod_int before = *this;
--*this;
return before;
}
mod_int operator-() const { return val == 0 ? 0 : MOD - val; }
bool operator==(const mod_int &other) const { return val == other.val; }
bool operator!=(const mod_int &other) const { return val != other.val; }
mod_int inv() const { return mod_inv(val); }
mod_int pow(long long p) const {
assert(p >= 0);
mod_int a = *this, result = 1;
while (p > 0) {
if (p & 1)
result *= a;
a *= a;
p >>= 1;
}
return result;
}
friend ostream &operator<<(ostream &stream, const mod_int &m) {
return stream << m.val;
}
};
vector<mod_int> inv, factorial, inv_factorial;
void prepare_factorials(int maximum) {
inv.assign(maximum + 1, 1);
// Make sure MOD is prime, which is necessary for the inverse algorithm below.
for (int p = 2; p * p <= MOD; p++)
assert(MOD % p != 0);
for (int i = 2; i <= maximum; i++)
inv[i] = inv[MOD % i] * (MOD - MOD / i);
factorial.resize(maximum + 1);
inv_factorial.resize(maximum + 1);
factorial[0] = inv_factorial[0] = 1;
for (int i = 1; i <= maximum; i++) {
factorial[i] = i * factorial[i - 1];
inv_factorial[i] = inv[i] * inv_factorial[i - 1];
}
}
mod_int choose(long long n, long long r) {
if (r < 0 || r > n)
return 0;
return factorial[n] * inv_factorial[r] * inv_factorial[n - r];
}
mod_int inv_choose(long long n, long long r) {
assert(0 <= r && r <= n);
return inv_factorial[n] * factorial[r] * factorial[n - r];
}
mod_int permute(long long n, long long k) {
if (k < 0 || k > n)
return 0;
return factorial[n] * inv_factorial[n - k];
}
mod_int inv_permute(long long n, long long k) {
assert(0 <= k && k <= n);
return inv_factorial[n] * factorial[n - k];
}
char s[MAXN];
void solve() {
int k;
read(k);
read(s);
int n = strlen(s);
int m = n + k;
prepare_factorials(m);
mod_int res = 0;
for (int i = n; i <= m; ++i) {
res +=
choose(i - 1, n - 1) * mod_int(25).pow(i - n) * mod_int(26).pow(m - i);
}
writeln(int(res));
}
int main() {
int T = 1;
// read(T);
for (int test = 1; test <= T; ++test) {
// write("Case #", test, ": ");
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
// using ll = long long;
using ull = uint64_t;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
using f64 = double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using ld = double;
#define X first
#define Y second
#ifndef ONLINE_JUDGE
#define FWRITE
#endif
namespace io {
#ifndef FWRITE
#include <unistd.h>
auto unistd_read = read;
auto unistd_write = write;
#endif
const int BUFSIZE = 1 << 20;
int isize, osize;
char ibuf[BUFSIZE + 10], obuf[BUFSIZE + 10];
char *is, *it, *os = obuf, *ot = obuf + BUFSIZE;
char getchar() {
if (is == it) {
is = ibuf;
#ifdef FWRITE
it = ibuf + fread(ibuf, 1, BUFSIZE, stdin);
#else
it = ibuf + unistd_read(STDIN_FILENO, ibuf, BUFSIZE);
#endif
if (is == it)
return EOF;
}
return *is++;
}
char getalpha() {
char c = getchar();
while (!isalpha(c))
c = getchar();
return c;
}
void putchar(char c) {
*os++ = c;
if (os == ot) {
#ifdef FWRITE
fwrite(obuf, 1, BUFSIZE, stdout);
#else
unistd_write(STDOUT_FILENO, obuf, BUFSIZE);
#endif
os = obuf;
}
}
int inp() {
int x = 0, f = 0;
char ch;
for (ch = getchar(); !isdigit(ch); ch = getchar()) {
if (ch == EOF)
return -1;
if (ch == '-')
f = 1;
}
for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
;
return f ? -x : x;
}
ll inp_ll() {
ll x = 0;
int f = 0;
char ch;
for (ch = getchar(); !isdigit(ch); ch = getchar())
if (ch == '-')
f = 1;
for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
;
return f ? -x : x;
}
template <class T> bool read(T &x) {
x = 0;
int f = 0;
char ch;
for (ch = getchar(); !isdigit(ch); ch = getchar()) {
if (ch == EOF)
return 0;
if (ch == '-')
f = 1;
}
for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
;
if (f)
x = -x;
return 1;
}
bool read(char *s) {
char *t = s;
char ch = getchar();
for (; ch == ' ' || ch == '\n'; ch = getchar())
;
for (; ch != ' ' && ch != '\n' && ch != EOF; ch = getchar())
*t++ = ch;
*t = 0;
return s != t;
}
template <class T, class... Args> bool read(T &x, Args &...args) {
return read(x) && read(args...);
}
template <class T> bool readln(T &x) {
x = 0;
int f = 0;
char ch;
for (ch = getchar(); !isdigit(ch); ch = getchar()) {
if (ch == EOF)
return 0;
if (ch == '-')
f = 1;
}
for (; isdigit(ch); x = x * 10 + ch - '0', ch = getchar())
;
if (f)
x = -x;
for (; ch != '\n' && ch != EOF; ch = getchar())
;
return 1;
}
bool readln(char *s) {
char *t = s;
while (1) {
char ch = getchar();
if (ch == '\n' || ch == EOF)
break;
*t++ = ch;
}
*t = 0;
return s != t;
}
template <class T, class... Args> bool readln(T &x, Args &...args) {
return read(x) && readln(args...);
}
template <class T> void write(T x) {
static char s[22];
static char *it = s + 20;
static char *end = s + 20;
if (x < 0) {
putchar('-');
x = -x;
}
do {
*--it = x % 10 + '0';
x /= 10;
} while (x);
/*
if (!x)
*-- it = '0';
while (x)
{
*-- it = x%10+'0';
x /= 10;
}
*/
for (; it < end; ++it)
putchar(*it);
}
void write(const char *s) {
for (; *s; ++s)
putchar(*s);
}
template <> void write(char *s) { write((const char *)s); }
template <> void write(char c) { putchar(c); }
template <class T, class... Args> void write(T x, Args... args) {
write(x);
write(args...);
}
void writeln() { putchar('\n'); }
template <class T, class... Args> void writeln(T x, Args... args) {
write(x);
writeln(args...);
}
template <class Iterator> bool input(Iterator st, Iterator ed) {
for (; st != ed; ++st) {
if (!read(*st))
return false;
}
return true;
}
template <class T> bool input(T &a) { return input(a.begin(), a.end()); }
template <class Iterator>
void print(Iterator st, Iterator ed, const char *c = " ") {
int flag = 0;
for (; st != ed; ++st) {
if (flag)
write(c);
flag = 1;
write(*st);
}
writeln();
}
template <class T> void print(const T &a, const char *c = " ") {
print(a.begin(), a.end(), c);
}
struct ender {
~ender() {
if (os != obuf)
#ifdef FWRITE
fwrite(obuf, 1, os - obuf, stdout);
#else
unistd_write(STDOUT_FILENO, obuf, os - obuf);
#endif
}
} __ender;
} // namespace io
int64_t power(int64_t a, int64_t b, int64_t p) {
if (!b)
return 1;
int64_t t = power(a, b >> 1, p);
t = t * t % p;
if (b & 1)
t = t * a % p;
return t;
}
// mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 rd(1);
using namespace io;
template <class T> inline void freshmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> inline void freshmax(T &a, const T &b) {
if (a < b)
a = b;
}
// const ll B = 31;
// const ll MOD = 998244353;
const int INF = 1000000010;
const ll INFll = 4000000000000000000LL;
const int MAXN = 1000010;
int dx[] = {-1, 1, 0, 0, -1, -1, 1, 1};
int dy[] = {0, 0, -1, 1, -1, 1, -1, 1};
ld det(ld x1, ld y1, ld x2, ld y2, ld x3, ld y3) {
return x1 * y2 - x2 * y1 + x2 * y3 - x3 * y2 + x3 * y1 - x1 * y3;
}
const int MOD = 1000000007;
struct mod_int {
int val;
mod_int(long long v = 0) {
if (v < 0)
v = v % MOD + MOD;
if (v >= MOD)
v %= MOD;
val = v;
}
static int mod_inv(int a, int m = MOD) {
// https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm#Example
int g = m, r = a, 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 + m : x;
}
explicit operator int() const { return val; }
mod_int &operator+=(const mod_int &other) {
val += other.val;
if (val >= MOD)
val -= MOD;
return *this;
}
mod_int &operator-=(const mod_int &other) {
val -= other.val;
if (val < 0)
val += MOD;
return *this;
}
static unsigned fast_mod(uint64_t x, unsigned m = MOD) { return x % m; }
mod_int &operator*=(const mod_int &other) {
val = fast_mod((uint64_t)val * other.val);
return *this;
}
mod_int &operator/=(const mod_int &other) { return *this *= other.inv(); }
friend mod_int operator+(const mod_int &a, const mod_int &b) {
return mod_int(a) += b;
}
friend mod_int operator-(const mod_int &a, const mod_int &b) {
return mod_int(a) -= b;
}
friend mod_int operator*(const mod_int &a, const mod_int &b) {
return mod_int(a) *= b;
}
friend mod_int operator/(const mod_int &a, const mod_int &b) {
return mod_int(a) /= b;
}
mod_int &operator++() {
val = val == MOD - 1 ? 0 : val + 1;
return *this;
}
mod_int &operator--() {
val = val == 0 ? MOD - 1 : val - 1;
return *this;
}
mod_int operator++(int) {
mod_int before = *this;
++*this;
return before;
}
mod_int operator--(int) {
mod_int before = *this;
--*this;
return before;
}
mod_int operator-() const { return val == 0 ? 0 : MOD - val; }
bool operator==(const mod_int &other) const { return val == other.val; }
bool operator!=(const mod_int &other) const { return val != other.val; }
mod_int inv() const { return mod_inv(val); }
mod_int pow(long long p) const {
assert(p >= 0);
mod_int a = *this, result = 1;
while (p > 0) {
if (p & 1)
result *= a;
a *= a;
p >>= 1;
}
return result;
}
friend ostream &operator<<(ostream &stream, const mod_int &m) {
return stream << m.val;
}
};
vector<mod_int> inv, factorial, inv_factorial;
void prepare_factorials(int maximum) {
inv.assign(maximum + 1, 1);
// Make sure MOD is prime, which is necessary for the inverse algorithm below.
for (int p = 2; p * p <= MOD; p++)
assert(MOD % p != 0);
for (int i = 2; i <= maximum; i++)
inv[i] = inv[MOD % i] * (MOD - MOD / i);
factorial.resize(maximum + 1);
inv_factorial.resize(maximum + 1);
factorial[0] = inv_factorial[0] = 1;
for (int i = 1; i <= maximum; i++) {
factorial[i] = i * factorial[i - 1];
inv_factorial[i] = inv[i] * inv_factorial[i - 1];
}
}
mod_int choose(long long n, long long r) {
if (r < 0 || r > n)
return 0;
return factorial[n] * inv_factorial[r] * inv_factorial[n - r];
}
mod_int inv_choose(long long n, long long r) {
assert(0 <= r && r <= n);
return inv_factorial[n] * factorial[r] * factorial[n - r];
}
mod_int permute(long long n, long long k) {
if (k < 0 || k > n)
return 0;
return factorial[n] * inv_factorial[n - k];
}
mod_int inv_permute(long long n, long long k) {
assert(0 <= k && k <= n);
return inv_factorial[n] * factorial[n - k];
}
char s[MAXN];
void solve() {
int k;
read(k);
read(s);
int n = strlen(s);
int m = n + k;
prepare_factorials(m);
mod_int res = 0;
for (int i = n; i <= m; ++i) {
res +=
choose(i - 1, n - 1) * mod_int(25).pow(i - n) * mod_int(26).pow(m - i);
}
writeln(int(res));
}
int main() {
int T = 1;
// read(T);
for (int test = 1; test <= T; ++test) {
// write("Case #", test, ": ");
solve();
}
return 0;
} | replace | 279 | 280 | 279 | 280 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
/* start */
const int mod = 1e9 + 7; // CHANGE THIS
const int N = 1e6 + 9; // CHANGE THIS
int fat[N], inv[N];
int fastexp(int b, int e) {
if (e == 0)
return 1;
int ans = fastexp(b, e / 2);
ans = (ans * ans) % mod;
if (e % 2 == 1)
ans = (ans * b) % mod;
return ans;
}
void init() {
fat[0] = fat[1] = 1;
inv[0] = inv[1] = 1;
for (int i = 2; i < N; i++) {
fat[i] = (i * fat[i - 1]) % mod;
inv[i] = fastexp(fat[i], mod - 2);
}
}
int comb(int a, int b) { return fat[a] * inv[b] % mod * inv[a - b] % mod; }
signed main() {
IOS;
init();
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (int i = 0; i <= k; i++) {
ans = (ans + fastexp(25, i) * fastexp(26, k - i) % mod *
comb(i + n - 1, n - 1) % mod) %
mod;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define IOS \
ios_base::sync_with_stdio(0); \
cin.tie(0)
/* start */
const int mod = 1e9 + 7;
const int N = 2e6 + 9;
int fat[N], inv[N];
int fastexp(int b, int e) {
if (e == 0)
return 1;
int ans = fastexp(b, e / 2);
ans = (ans * ans) % mod;
if (e % 2 == 1)
ans = (ans * b) % mod;
return ans;
}
void init() {
fat[0] = fat[1] = 1;
inv[0] = inv[1] = 1;
for (int i = 2; i < N; i++) {
fat[i] = (i * fat[i - 1]) % mod;
inv[i] = fastexp(fat[i], mod - 2);
}
}
int comb(int a, int b) { return fat[a] * inv[b] % mod * inv[a - b] % mod; }
signed main() {
IOS;
init();
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (int i = 0; i <= k; i++) {
ans = (ans + fastexp(25, i) * fastexp(26, k - i) % mod *
comb(i + n - 1, n - 1) % mod) %
mod;
}
cout << ans << "\n";
} | replace | 8 | 10 | 8 | 10 | 0 | |
p02633 | C++ | Runtime Error | #include <cmath>
#include <iostream>
using namespace std;
/*
void calculate(float X) {
float deg = X;
float T = 3.14159265/180;
int t = 0;
float x = 0, y = 0;
float e = 0.001;
while (true) {
t++;
x -= sin(deg*T);
y -= cos(deg*T);
deg += X;
//cout << X << endl;
//cout << x << " " << y << endl;
if (-1*e <= x && x <= e && -1*e <= y && y <= e) {
break;
}
}
cout << t << endl;
}
*/
int main() {
int ans[179] = {
360, 180, 120, 90, 72, 60, 360, 45, 40, 36, 360, 30, 360, 180, 24,
45, 360, 20, 360, 18, 120, 180, 360, 15, 72, 180, 40, 90, 360, 12,
360, 45, 120, 180, 72, 10, 360, 180, 120, 9, 360, 60, 360, 90, 8,
180, 360, 15, 360, 36, 120, 90, 360, 20, 72, 45, 120, 180, 360, 6,
360, 180, 40, 45, 72, 60, 360, 90, 120, 36, 360, 5, 360, 180, 24,
90, 360, 60, 360, 9, 40, 180, 360, 30, 72, 180, 120, 45, 360, 4,
360, 90, 120, 180, 72, 15, 360, 180, 40, 18, 360, 60, 360, 45, 24,
180, 360, 10, 360, 36, 120, 45, 360, 60, 72, 90, 40, 180, 360, 3,
360, 180, 120, 90, 72, 20, 360, 45, 120, 36, 360, 30, 360, 180, 8,
45, 360, 60, 360, 18, 120, 180, 360, 5, 72, 180, 120, 90, 360, 12,
360, 45, 40, 180, 72, 30, 360, 180, 120, 9, 360, 20, 360, 90, 24,
180, 360, 15, 360, 36, 40, 90, 360, 60, 72, 45, 120, 180, 360,
};
int X;
cin >> X;
return ans[X - 1];
}
| #include <cmath>
#include <iostream>
using namespace std;
/*
void calculate(float X) {
float deg = X;
float T = 3.14159265/180;
int t = 0;
float x = 0, y = 0;
float e = 0.001;
while (true) {
t++;
x -= sin(deg*T);
y -= cos(deg*T);
deg += X;
//cout << X << endl;
//cout << x << " " << y << endl;
if (-1*e <= x && x <= e && -1*e <= y && y <= e) {
break;
}
}
cout << t << endl;
}
*/
int main() {
int ans[179] = {
360, 180, 120, 90, 72, 60, 360, 45, 40, 36, 360, 30, 360, 180, 24,
45, 360, 20, 360, 18, 120, 180, 360, 15, 72, 180, 40, 90, 360, 12,
360, 45, 120, 180, 72, 10, 360, 180, 120, 9, 360, 60, 360, 90, 8,
180, 360, 15, 360, 36, 120, 90, 360, 20, 72, 45, 120, 180, 360, 6,
360, 180, 40, 45, 72, 60, 360, 90, 120, 36, 360, 5, 360, 180, 24,
90, 360, 60, 360, 9, 40, 180, 360, 30, 72, 180, 120, 45, 360, 4,
360, 90, 120, 180, 72, 15, 360, 180, 40, 18, 360, 60, 360, 45, 24,
180, 360, 10, 360, 36, 120, 45, 360, 60, 72, 90, 40, 180, 360, 3,
360, 180, 120, 90, 72, 20, 360, 45, 120, 36, 360, 30, 360, 180, 8,
45, 360, 60, 360, 18, 120, 180, 360, 5, 72, 180, 120, 90, 360, 12,
360, 45, 40, 180, 72, 30, 360, 180, 120, 9, 360, 20, 360, 90, 24,
180, 360, 15, 360, 36, 40, 90, 360, 60, 72, 45, 120, 180, 360,
};
int X;
cin >> X;
cout << ans[X - 1] << endl;
}
| replace | 43 | 44 | 43 | 44 | 4 | |
p02633 | C++ | Time Limit Exceeded | #include <iostream>
using namespace std;
int main() {
int n;
int sum = 0;
int cnt = 0;
while (sum == 0 || sum % 360 != 0) {
sum += n;
cnt++;
}
cout << cnt << endl;
return 0;
}
| #include <iostream>
using namespace std;
int main() {
int n;
cin >> n;
int sum = 0;
int cnt = 0;
while (sum == 0 || sum % 360 != 0) {
sum += n;
cnt++;
}
cout << cnt << endl;
return 0;
}
| insert | 5 | 5 | 5 | 6 | TLE | |
p02633 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define debug(a) cout << #a ": " << a << endl
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
int main(void) {
IOS;
int x;
cin >> x;
if (360 % x == 0)
cout << 360 / x << endl;
else
while (1)
;
return 0;
}
| #include <bits/stdc++.h>
#define debug(a) cout << #a ": " << a << endl
#define IOS ios::sync_with_stdio(false), cin.tie(0)
using namespace std;
typedef long long ll;
int main(void) {
IOS;
int x;
cin >> x;
int y = 360;
int g = __gcd(x, y);
x /= g, y /= g;
cout << y << endl;
return 0;
}
| replace | 10 | 15 | 10 | 14 | TLE | |
p02633 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define puts(i) cout << i << endl
#define pi 3.14159265358979323846264338
#define pb push_back
#define mp make_pair
#define inf 10000
using ll = long long;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
ll divisor = 1000000007;
int main() {
int x;
cin >> x;
int i = 1;
while (true) {
if ((i * x) % 360 == 0) {
puts(i);
return 0;
}
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define puts(i) cout << i << endl
#define pi 3.14159265358979323846264338
#define pb push_back
#define mp make_pair
#define inf 10000
using ll = long long;
using P = pair<int, int>;
using Pll = pair<ll, ll>;
ll divisor = 1000000007;
int main() {
int x;
cin >> x;
int i = 1;
while (true) {
if ((i * x) % 360 == 0) {
puts(i);
return 0;
}
i++;
}
}
| insert | 23 | 23 | 23 | 24 | TLE | |
p02633 | C++ | Time Limit Exceeded | /*
Name:
Author: xiaruize
Date:
*/
#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define MOD 1000000007
#define ALL(a) (a).begin(), (a).end()
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define ll long long
#define form(i, j, n) for (int i = int(j); i <= int(n); i++)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define pis pair<int, string>
#define sec second
#define sz(a) int((a).size())
inline int read() {
char ch = getchar();
int x = 0, f = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = x * 10 + (ch ^ 48), ch = getchar();
return x * f;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
int x;
cin >> x;
int i = 1;
while (1) {
if (i * 360 % x == 0) {
cout << i * 360 / x << endl;
return 0;
}
}
return 0;
}
| /*
Name:
Author: xiaruize
Date:
*/
#pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
#define ull unsigned long long
#define MOD 1000000007
#define ALL(a) (a).begin(), (a).end()
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define ll long long
#define form(i, j, n) for (int i = int(j); i <= int(n); i++)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define pis pair<int, string>
#define sec second
#define sz(a) int((a).size())
inline int read() {
char ch = getchar();
int x = 0, f = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
x = x * 10 + (ch ^ 48), ch = getchar();
return x * f;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
int x;
cin >> x;
cout << 360 / __gcd(360, x) << endl;
return 0;
}
| replace | 42 | 49 | 42 | 43 | TLE | |
p02633 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main() {
int X, A;
int counter = 1;
cin >> X;
int K = 360 / X;
if (360 % X == 0)
cout << K << endl;
else {
while (true) {
counter++;
if ((counter * 360) % X == 0) {
cout << counter * K << endl;
}
}
}
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int X, A;
int counter = 1;
cin >> X;
int K = 360 / X;
if (360 % X == 0)
cout << K << endl;
else {
while (true) {
counter++;
if ((counter * 360) % X == 0) {
cout << (counter * 360) / X << endl;
break;
}
}
}
}
| replace | 13 | 14 | 13 | 15 | TLE | |
p02633 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
int y = 360;
while (true) {
if (y % x == 0) {
cout << y / x << endl;
return 0;
}
y += 360;
}
} | #include <bits/stdc++.h>
using namespace std;
int main() {
int x;
cin >> x;
int y = 360;
while (true) {
if (y % x == 0) {
cout << y / x << endl;
return 0;
}
y += 360;
}
}
| insert | 5 | 5 | 5 | 6 | 0 | |
p02633 | C++ | Runtime Error | #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int X;
int K;
cin >> X;
cout << 360 / K << endl;
}
| #include <iostream>
using namespace std;
int main(void) {
// Your code here!
int X;
int K;
cin >> X;
// Xto360nosaishoukoubasisu
int ans;
for (int i = 1; i <= 180; i++) {
ans = i * 360;
if (ans % X == 0) {
break;
}
}
cout << ans / X << endl;
}
| replace | 7 | 8 | 7 | 16 | 0 | |
p02633 | C++ | Runtime Error | #include <bits/stdc++.h>
int main() {
int x;
scanf("%d", &x);
for (int i = 1; i <= 10000000; ++i)
if (x * i % 360 == 0)
return printf("%d\n", i);
return 0;
} | #include <bits/stdc++.h>
int main() {
int x;
scanf("%d", &x);
for (int i = 1; i <= 10000000; ++i)
if (x * i % 360 == 0)
return printf("%d\n", i), 0;
return 0;
} | replace | 7 | 8 | 7 | 8 | 2 | |
p02633 | C++ | Runtime Error | #pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
#include <unordered_map>
#define M 1000000007
#define T 998244353
#define pi 3.14159265
#define N 100003
#define inf 1000000002
#define ll long long
#define fo(i, a, b) for (i = a; i <= b; i++)
#define ro(i, b, a) for (i = b; i >= a; i--)
#define foe(it, x) for (auto it = x.begin(); it != x.end(); it++)
#define ff first
#define ss second
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define fil(x, y) memset(x, y, sizeof(x))
#define deb(x) cout << #x << " " << x << "\n"
using namespace std;
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int lcm(int a, int b) { return (a * b) / gcd(a, b); }
void solve() {
int x;
cin >> x;
cout << lcm(360, x) / x << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
int _t;
cin >> _t;
while (_t--)
solve();
return 0;
}
| #pragma GCC diagnostic push
#pragma GCC diagnostic ignored "-Wunused-variable"
#include <bits/stdc++.h>
#include <unordered_map>
#define M 1000000007
#define T 998244353
#define pi 3.14159265
#define N 100003
#define inf 1000000002
#define ll long long
#define fo(i, a, b) for (i = a; i <= b; i++)
#define ro(i, b, a) for (i = b; i >= a; i--)
#define foe(it, x) for (auto it = x.begin(); it != x.end(); it++)
#define ff first
#define ss second
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define fil(x, y) memset(x, y, sizeof(x))
#define deb(x) cout << #x << " " << x << "\n"
using namespace std;
int gcd(int a, int b) {
if (a == 0)
return b;
return gcd(b % a, a);
}
int lcm(int a, int b) { return (a * b) / gcd(a, b); }
void solve() {
int x;
cin >> x;
cout << lcm(360, x) / x << "\n";
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
// int _t;cin >> _t; while(_t--)
solve();
return 0;
}
| replace | 43 | 47 | 43 | 45 | 0 | |
p02633 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
using namespace std;
int main(void) {
int x;
cin >> x;
int y = 1;
while (true) {
if (360 * y % x == 0) {
cout << 360 * y / x << endl;
return 0;
}
}
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define rep1(i, n) for (int i = 1; i <= (int)n; i++)
#define sp(n) cout << fixed << setprecision(n)
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
using namespace std;
int main(void) {
int x;
cin >> x;
int y = 1;
while (true) {
if (360 * y % x == 0) {
cout << 360 * y / x << endl;
return 0;
}
y++;
}
} | insert | 29 | 29 | 29 | 30 | TLE | |
p02633 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
vector<pair<int64_t, int64_t>> pppp(int64_t x) {
vector<pair<int64_t, int64_t>> p;
for (int64_t i = 2; i * i <= x; i++) {
int cnt = 0;
if (x % i == 0) {
while (x % i == 0) {
cnt++;
x /= i;
}
p.push_back(make_pair(i, cnt));
}
}
if (x != 1) {
p.push_back(make_pair(x, 1));
}
return p;
}
int main() {
int X;
cout << 360 / X << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#include <iomanip>
#include <math.h>
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const int INF = 1001001001;
vector<pair<int64_t, int64_t>> pppp(int64_t x) {
vector<pair<int64_t, int64_t>> p;
for (int64_t i = 2; i * i <= x; i++) {
int cnt = 0;
if (x % i == 0) {
while (x % i == 0) {
cnt++;
x /= i;
}
p.push_back(make_pair(i, cnt));
}
}
if (x != 1) {
p.push_back(make_pair(x, 1));
}
return p;
}
int main() {
int X;
cin >> X;
cout << X * 360 / __gcd(X, 360) / X << endl;
return 0;
} | replace | 39 | 40 | 39 | 41 | 0 | |
p02633 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 7;
const int inf = INT_MAX;
const ll inff = 1e18;
const ll mod = 1e9 + 7;
#define pii pair<int, int>
#define mkp make_pair
#define F first
#define S second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
// #define int ll
#ifdef HNO2
#define IOS
#else
#define endl '\n'
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0);
#endif // HNO2
int32_t main() {
IOS int x;
cin >> x;
multiset<int> s;
int now = 0;
for (int i = 1;; i++) {
int tmp = (now >= 180 ? now - 180 : now + 180);
if (s.find(tmp) != s.end())
s.erase(s.find(tmp));
else
s.insert(now);
if (sz(s) == 0) {
cout << i << endl;
return 0;
}
now = (now + x) % 360;
}
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1e6 + 7;
const int inf = INT_MAX;
const ll inff = 1e18;
const ll mod = 1e9 + 7;
#define pii pair<int, int>
#define mkp make_pair
#define F first
#define S second
#define pb push_back
#define sz(v) ((int)(v).size())
#define all(v) (v).begin(), (v).end()
// #define int ll
#ifdef HNO2
#define IOS
#else
#define endl '\n'
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0);
#endif // HNO2
int32_t main() {
IOS int x;
cin >> x;
cout << 360 / __gcd(x, 360) << endl;
}
| replace | 29 | 43 | 29 | 30 | TLE | |
p02633 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
typedef long long ll;
#define forn(i, start, end) for (ll i = start; i < ll(end); i++)
#define input(arr, n) forn(i, 0, n) cin >> arr[i];
#define MOD 1000000007
#define vll vector<ll>
#define vpll vector<pair<ll, ll>>
#define vvll vector<vector<ll>>
#define mll map<ll, ll>
#define mcl map<char, ll>
#define sc set<char>
#define sll set<ll>
#define ssll stack<ll>
#define CHK(param) cout << #param << " is : " << param << "\n";
#define pb push_back
#define ppb pop_back
#define mk make_pair
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define LAUV \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define TC \
ll TTTT; \
cin >> TTTT; \
while (TTTT--)
using namespace std;
int32_t main() {
LAUV;
// TC
{
ll x;
cin >> x;
ll k = 1;
while (k * x != 360) {
k++;
}
cout << k << '\n';
}
return 0;
} | #include <bits/stdc++.h>
typedef long long ll;
#define forn(i, start, end) for (ll i = start; i < ll(end); i++)
#define input(arr, n) forn(i, 0, n) cin >> arr[i];
#define MOD 1000000007
#define vll vector<ll>
#define vpll vector<pair<ll, ll>>
#define vvll vector<vector<ll>>
#define mll map<ll, ll>
#define mcl map<char, ll>
#define sc set<char>
#define sll set<ll>
#define ssll stack<ll>
#define CHK(param) cout << #param << " is : " << param << "\n";
#define pb push_back
#define ppb pop_back
#define mk make_pair
#define f first
#define s second
#define all(x) (x).begin(), (x).end()
#define LAUV \
ios_base::sync_with_stdio(false); \
cin.tie(NULL);
#define TC \
ll TTTT; \
cin >> TTTT; \
while (TTTT--)
using namespace std;
int32_t main() {
LAUV;
// TC
{
ll x;
cin >> x;
ll k = 1;
while ((k * x) % 360 != 0) {
k++;
}
cout << k << '\n';
}
return 0;
} | replace | 36 | 37 | 36 | 37 | TLE | |
p02633 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int X, K = 2;
static const double pi = 3.141592653589793;
cin >> X;
float x = 0.0, y = 1.0, theta;
while (true) {
theta = float(X * (K - 1) * pi) / 180.0;
x += sin(theta);
y += cos(theta);
if (x < 0.0001 && x > -0.0001 && y < 0.0001 && y > -0.0001) {
break;
}
K++;
}
cout << K;
} | #include <bits/stdc++.h>
using namespace std;
int main(void) {
int X, K = 2;
static const double pi = 3.141592653589793;
cin >> X;
float x = 0.0, y = 1.0, theta;
while (true) {
theta = float(X * (K - 1) * pi) / 180.0;
x += sin(theta);
y += cos(theta);
if (x < 0.001 && x > -0.001 && y < 0.001 && y > -0.001) {
break;
}
K++;
}
cout << K;
} | replace | 13 | 14 | 13 | 14 | TLE | |
p02634 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define INF (1e9)
ll MOD = 998244353;
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
vvi DP(C + 1, vi(D + 1));
DP[A][B] = 1;
for (int i = A + 1; i <= C; i++) {
DP[i][B] = (DP[i - 1][B] * B) % MOD;
}
for (int j = B + 1; j <= D; j++) {
DP[A][j] = (DP[A][j - 1] * A) % MOD;
}
for (int i = A + 1; i <= C; i++) {
for (int j = B + 1; j <= D; j++) {
DP[i][j] = DP[i - 1][j] * j + DP[i][j - 1] * i -
DP[i - 1][j - 1] * (i - 1) * (j - 1);
while (DP[i][j] < 0)
DP[i][j] += MOD;
DP[i][j] %= MOD;
}
}
ll ans = DP[C][D];
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vi;
typedef vector<vi> vvi;
#define INF (1e9)
ll MOD = 998244353;
int main() {
ll A, B, C, D;
cin >> A >> B >> C >> D;
vvi DP(C + 1, vi(D + 1));
DP[A][B] = 1;
for (int i = A + 1; i <= C; i++) {
DP[i][B] = (DP[i - 1][B] * B) % MOD;
}
for (int j = B + 1; j <= D; j++) {
DP[A][j] = (DP[A][j - 1] * A) % MOD;
}
for (int i = A + 1; i <= C; i++) {
for (int j = B + 1; j <= D; j++) {
DP[i][j] = DP[i - 1][j] * j + DP[i][j - 1] * i +
(MOD - DP[i - 1][j - 1]) * (i - 1) * (j - 1);
DP[i][j] %= MOD;
}
}
ll ans = DP[C][D];
cout << ans << endl;
}
| replace | 24 | 28 | 24 | 26 | TLE | |
p02634 | C++ | Runtime Error | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int A, B, C, D;
cin >> A >> B >> C >> D;
const int MAX = 3001;
const int64_t MOD = 998244353;
vector<vector<int64_t>> DP(MAX, vector<int64_t>(MAX, 0));
DP[A][B] = 1;
for (int h = A; h <= C; ++h) {
for (int w = B; w <= D; ++w) {
DP[h + 1][w] = (DP[h + 1][w] + (DP[h][w] * w) % MOD) % MOD;
DP[h][w + 1] = (DP[h][w + 1] + (DP[h][w] * h) % MOD) % MOD;
int64_t sub = (DP[h][w] * h * w) % MOD;
DP[h + 1][w + 1] = ((DP[h + 1][w + 1] - sub) + MOD) % MOD;
}
}
cout << DP[C][D] << endl;
return 0;
} | #include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
int main(void) {
ios::sync_with_stdio(false);
int A, B, C, D;
cin >> A >> B >> C >> D;
const int MAX = 3002;
const int64_t MOD = 998244353;
vector<vector<int64_t>> DP(MAX, vector<int64_t>(MAX, 0));
DP[A][B] = 1;
for (int h = A; h <= C; ++h) {
for (int w = B; w <= D; ++w) {
DP[h + 1][w] = (DP[h + 1][w] + (DP[h][w] * w) % MOD) % MOD;
DP[h][w + 1] = (DP[h][w + 1] + (DP[h][w] * h) % MOD) % MOD;
int64_t sub = (DP[h][w] * h * w) % MOD;
DP[h + 1][w + 1] = ((DP[h + 1][w + 1] - sub) + MOD) % MOD;
}
}
cout << DP[C][D] << endl;
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02634 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 998244353;
int read() {
int x = 0, f = 1;
char ch = ' ';
while (!isdigit(ch)) {
ch = getchar();
if (ch == '-')
f = -1;
}
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return x * f;
}
ll f[2005][2005];
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
f[a][b] = 1;
for (int i = a; i <= c; i++) {
for (int j = b; j <= d; j++) {
if (i > a)
f[i][j] += f[i - 1][j] * j;
if (j > b)
f[i][j] += f[i][j - 1] * i;
if (i > a && j > b)
f[i][j] -= (ll)(i - 1) * (j - 1) * f[i - 1][j - 1];
f[i][j] %= mod;
}
}
cout << (f[c][d] % mod + mod) % mod;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 998244353;
int read() {
int x = 0, f = 1;
char ch = ' ';
while (!isdigit(ch)) {
ch = getchar();
if (ch == '-')
f = -1;
}
while (isdigit(ch))
x = (x << 3) + (x << 1) + (ch ^ 48), ch = getchar();
return x * f;
}
ll f[3005][3005];
int main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
f[a][b] = 1;
for (int i = a; i <= c; i++) {
for (int j = b; j <= d; j++) {
if (i > a)
f[i][j] += f[i - 1][j] * j;
if (j > b)
f[i][j] += f[i][j - 1] * i;
if (i > a && j > b)
f[i][j] -= (ll)(i - 1) * (j - 1) * f[i - 1][j - 1];
f[i][j] %= mod;
}
}
cout << (f[c][d] % mod + mod) % mod;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p02634 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mii map<int, int>
#define mll map<ll, ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vd vector<double>
#define vll vector<ll>
#define fi first
#define se second
#define si set<int>
#define sll set<ll>
#define spii set<pii>
#define vs vector<string>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<long long, long long>>
#define vvi vector<vector<int>>
#define vvpii vector<vector<pii>>
#define mp make_pair
#define vvll vector<vll>
#define vsi vector<si>
#define forn(i, n) for (int i = 0; i < (n); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MANX MAXN
const ll INFLL = 1e18;
const int MAXN = 1e3 + 10;
const ll INF = 1e9;
const ll mod1 = 998244353;
const ll mod2 = 2e9 + 11;
ll dp[MAXN][MAXN];
bool was[MAXN][MAXN];
ll mult(ll a, ll b) { return (a * b) % mod1; }
ll add(ll a, ll b) {
a += b;
if (a >= mod1)
return a - mod1;
return a;
}
ll sub(ll a, ll b) {
a -= b;
if (a < 0)
return a + mod1;
return a;
}
ll a, b, c, d;
ll solve(ll n, ll m) {
if (n < a || m < b) {
was[n][m] = 1;
return dp[n][m] = 0;
}
if (n == a && m == b) {
was[n][m] = 1;
return dp[n][m] = 1;
}
if (was[n][m])
return dp[n][m];
was[n][m] = 1;
if (n == a || b == m) {
if (n == a)
return dp[n][m] = mult(solve(n, m - 1), n);
else
return dp[n][m] = mult(solve(n - 1, m), m);
}
ll z = solve(n - 1, m - 1);
ll x = solve(n - 1, m);
ll y = solve(n, m - 1);
ll sum = add(mult(x, m), mult(y, n));
// cout<<n<<" "<<m<<" "<<x<<" "<<y<<" "<<z<<'\n';
return dp[n][m] = sub(sum, mult(z, mult(n - 1, m - 1)));
}
set<vector<string>> dd[10][10];
bool wass[10][10];
void solvee(int n, int m) {
if (n < a || m < b)
return;
if (n == a && m == b)
return;
if (wass[n][m])
return;
wass[n][m] = 1;
if (n > a) {
solvee(n - 1, m);
for (auto to : dd[n - 1][m]) {
string s;
for (int i = 0; i < m; i++)
s += 'W';
for (int i = 0; i < m; i++) {
s[i] = 'B';
to.pb(s);
dd[n][m].insert(to);
to.pop_back();
s[i] = 'W';
}
}
}
if (m > b) {
solvee(n, m - 1);
for (auto to : dd[n][m - 1]) {
for (int i = 0; i < n; i++)
to[i].pb('W');
for (int i = 0; i < n; i++) {
to[i][m - 1] = 'B';
dd[n][m].insert(to);
to[i][m - 1] = 'W';
}
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("a.in", "r", stdin);
#endif
cin >> a >> b >> c >> d;
cout << solve(c, d) << '\n';
// vector <string> aa;
// string s;
// for (int i=0;i<b;i++)
// s+='W';
// for (int i=0;i<a;i++)
// aa.pb(s);
// dd[a][b].insert(aa);
// for (int i=a;i<=c;i++)
// {
// for (int j=b;j<=d;j++)
// {
// solvee(i,j);
// int x=dd[i][j].size();
// int y=dd[i-1][j].size();
// int z=dd[i][j-1].size();
// int who=dd[i-1][j-1].size();
// if (who!=0) {
// if (((y * j + z * i - x))%who!=0)
// cout<<"bread\n";
// cout << (y * j + z * i - x)/who << " " << i << " " << j<<"
// "<<solve(i,j)<<" "<<x<< '\n';
// }
// }
// }
// for (auto to:dd[c][d])
// {
// cout<<"New:\n";
// for (auto too:to)
// cout<<too<<'\n';
// cout<<'\n';
// }
// n=1 ?
// recursion - matrix exponential
// linear algebra - just a joke
// check ios_base, MAXN, mod1 before submit
// if debug more than 15 minutes - write stress
// compression
} | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb push_back
#define mii map<int, int>
#define mll map<ll, ll>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vd vector<double>
#define vll vector<ll>
#define fi first
#define se second
#define si set<int>
#define sll set<ll>
#define spii set<pii>
#define vs vector<string>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<long long, long long>>
#define vvi vector<vector<int>>
#define vvpii vector<vector<pii>>
#define mp make_pair
#define vvll vector<vll>
#define vsi vector<si>
#define forn(i, n) for (int i = 0; i < (n); i++)
#define rep(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define MANX MAXN
const ll INFLL = 1e18;
const int MAXN = 3e3 + 10;
const ll INF = 1e9;
const ll mod1 = 998244353;
const ll mod2 = 2e9 + 11;
ll dp[MAXN][MAXN];
bool was[MAXN][MAXN];
ll mult(ll a, ll b) { return (a * b) % mod1; }
ll add(ll a, ll b) {
a += b;
if (a >= mod1)
return a - mod1;
return a;
}
ll sub(ll a, ll b) {
a -= b;
if (a < 0)
return a + mod1;
return a;
}
ll a, b, c, d;
ll solve(ll n, ll m) {
if (n < a || m < b) {
was[n][m] = 1;
return dp[n][m] = 0;
}
if (n == a && m == b) {
was[n][m] = 1;
return dp[n][m] = 1;
}
if (was[n][m])
return dp[n][m];
was[n][m] = 1;
if (n == a || b == m) {
if (n == a)
return dp[n][m] = mult(solve(n, m - 1), n);
else
return dp[n][m] = mult(solve(n - 1, m), m);
}
ll z = solve(n - 1, m - 1);
ll x = solve(n - 1, m);
ll y = solve(n, m - 1);
ll sum = add(mult(x, m), mult(y, n));
// cout<<n<<" "<<m<<" "<<x<<" "<<y<<" "<<z<<'\n';
return dp[n][m] = sub(sum, mult(z, mult(n - 1, m - 1)));
}
set<vector<string>> dd[10][10];
bool wass[10][10];
void solvee(int n, int m) {
if (n < a || m < b)
return;
if (n == a && m == b)
return;
if (wass[n][m])
return;
wass[n][m] = 1;
if (n > a) {
solvee(n - 1, m);
for (auto to : dd[n - 1][m]) {
string s;
for (int i = 0; i < m; i++)
s += 'W';
for (int i = 0; i < m; i++) {
s[i] = 'B';
to.pb(s);
dd[n][m].insert(to);
to.pop_back();
s[i] = 'W';
}
}
}
if (m > b) {
solvee(n, m - 1);
for (auto to : dd[n][m - 1]) {
for (int i = 0; i < n; i++)
to[i].pb('W');
for (int i = 0; i < n; i++) {
to[i][m - 1] = 'B';
dd[n][m].insert(to);
to[i][m - 1] = 'W';
}
}
}
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
#ifdef LOCAL
freopen("a.in", "r", stdin);
#endif
cin >> a >> b >> c >> d;
cout << solve(c, d) << '\n';
// vector <string> aa;
// string s;
// for (int i=0;i<b;i++)
// s+='W';
// for (int i=0;i<a;i++)
// aa.pb(s);
// dd[a][b].insert(aa);
// for (int i=a;i<=c;i++)
// {
// for (int j=b;j<=d;j++)
// {
// solvee(i,j);
// int x=dd[i][j].size();
// int y=dd[i-1][j].size();
// int z=dd[i][j-1].size();
// int who=dd[i-1][j-1].size();
// if (who!=0) {
// if (((y * j + z * i - x))%who!=0)
// cout<<"bread\n";
// cout << (y * j + z * i - x)/who << " " << i << " " << j<<"
// "<<solve(i,j)<<" "<<x<< '\n';
// }
// }
// }
// for (auto to:dd[c][d])
// {
// cout<<"New:\n";
// for (auto too:to)
// cout<<too<<'\n';
// cout<<'\n';
// }
// n=1 ?
// recursion - matrix exponential
// linear algebra - just a joke
// check ios_base, MAXN, mod1 before submit
// if debug more than 15 minutes - write stress
// compression
} | replace | 33 | 34 | 33 | 34 | 0 | |
p02634 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#define EACH(value, var) for (auto value : var)
#define SORT(var) sort(var.begin(), var.end())
#define REVERSE(var) reverse(var.begin(), var.end())
#define RSORT(var) \
SORT(var); \
REVERSE(var)
#define OPTIMIZE_STDIO \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.precision(10); \
cout << fixed
#define endl '\n'
const int INF = 1e9;
const int MOD = 998244353;
const ll LINF = 1e18;
struct mint {
ll x;
mint() : x(0) {}
mint(ll x) : x((x % MOD + MOD) % MOD) {}
mint &operator+=(const mint &r) {
if ((x += r.x) >= MOD) {
x -= MOD;
}
return *this;
}
mint &operator-=(const mint &r) {
if ((x -= r.x) < 0) {
x += MOD;
}
return *this;
}
mint &operator*=(const mint &r) {
if ((x *= r.x) > MOD) {
x %= MOD;
}
return *this;
}
mint &operator++() {
if ((++x) >= MOD) {
x -= MOD;
}
return *this;
}
mint operator++(int) {
mint ret = x;
if ((++x) >= MOD) {
x -= MOD;
}
return ret;
}
mint &operator--() {
if ((--x) < 0) {
x += MOD;
}
return *this;
}
mint operator--(int) {
mint ret = x;
if ((--x) < 0) {
x += MOD;
}
return ret;
}
mint operator+(const mint &r) {
mint ret;
return ret = x + r.x;
}
mint operator-(const mint &r) {
mint ret;
return ret = x - r.x;
}
mint operator*(const mint &r) {
mint ret;
return ret = x * r.x;
}
mint operator-() { return mint() - *this; }
mint pow(ll t) {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
bool operator<(const mint &a) { return x < a.x; }
bool operator>(const mint &a) { return x > a.x; }
bool operator<=(const mint &a) { return x <= a.x; }
bool operator>=(const mint &a) { return x >= a.x; }
bool operator==(const mint &a) { return x == a.x; }
bool operator!=(const mint &a) { return x != a.x; }
};
ostream &operator<<(ostream &os, const mint &r) {
os << r.x;
return os;
}
ostream &operator>>(ostream &os, const mint &r) {
os >> r.x;
return os;
}
mint dp[3001][3001];
void solve(istream &cin, ostream &cout) {
ll a, b, c, d;
cin >> a >> b >> c >> d;
dp[a][b] = 1;
FOR(i, a, c + 1) {
FOR(j, b, d + 1) {
if (i > a)
dp[i][j] += dp[i - 1][j] * j;
if (j > b)
dp[i][j] += dp[i][j - 1] * i;
if (i > a && j > b)
dp[i][j] -= dp[i - 1][j - 1] * (i - 1) * (j - 1);
}
}
cout << dp[c][d] << endl;
}
#ifndef TEST
int main() {
OPTIMIZE_STDIO;
solve(cin, cout);
return 0;
}
#endif
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(var, begin, end) for (int var = (begin); var <= (end); var++)
#define RFOR(var, begin, end) for (int var = (begin); var >= (end); var--)
#define REP(var, length) FOR(var, 0, length - 1)
#define RREP(var, length) RFOR(var, length - 1, 0)
#define EACH(value, var) for (auto value : var)
#define SORT(var) sort(var.begin(), var.end())
#define REVERSE(var) reverse(var.begin(), var.end())
#define RSORT(var) \
SORT(var); \
REVERSE(var)
#define OPTIMIZE_STDIO \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.precision(10); \
cout << fixed
#define endl '\n'
const int INF = 1e9;
const int MOD = 998244353;
const ll LINF = 1e18;
struct mint {
ll x;
mint() : x(0) {}
mint(ll x) : x((x % MOD + MOD) % MOD) {}
mint &operator+=(const mint &r) {
if ((x += r.x) >= MOD) {
x -= MOD;
}
return *this;
}
mint &operator-=(const mint &r) {
if ((x -= r.x) < 0) {
x += MOD;
}
return *this;
}
mint &operator*=(const mint &r) {
if ((x *= r.x) > MOD) {
x %= MOD;
}
return *this;
}
mint &operator++() {
if ((++x) >= MOD) {
x -= MOD;
}
return *this;
}
mint operator++(int) {
mint ret = x;
if ((++x) >= MOD) {
x -= MOD;
}
return ret;
}
mint &operator--() {
if ((--x) < 0) {
x += MOD;
}
return *this;
}
mint operator--(int) {
mint ret = x;
if ((--x) < 0) {
x += MOD;
}
return ret;
}
mint operator+(const mint &r) {
mint ret;
return ret = x + r.x;
}
mint operator-(const mint &r) {
mint ret;
return ret = x - r.x;
}
mint operator*(const mint &r) {
mint ret;
return ret = x * r.x;
}
mint operator-() { return mint() - *this; }
mint pow(ll t) {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
bool operator<(const mint &a) { return x < a.x; }
bool operator>(const mint &a) { return x > a.x; }
bool operator<=(const mint &a) { return x <= a.x; }
bool operator>=(const mint &a) { return x >= a.x; }
bool operator==(const mint &a) { return x == a.x; }
bool operator!=(const mint &a) { return x != a.x; }
};
ostream &operator<<(ostream &os, const mint &r) {
os << r.x;
return os;
}
ostream &operator>>(ostream &os, const mint &r) {
os >> r.x;
return os;
}
mint dp[3002][3002];
void solve(istream &cin, ostream &cout) {
ll a, b, c, d;
cin >> a >> b >> c >> d;
dp[a][b] = 1;
FOR(i, a, c + 1) {
FOR(j, b, d + 1) {
if (i > a)
dp[i][j] += dp[i - 1][j] * j;
if (j > b)
dp[i][j] += dp[i][j - 1] * i;
if (i > a && j > b)
dp[i][j] -= dp[i - 1][j - 1] * (i - 1) * (j - 1);
}
}
cout << dp[c][d] << endl;
}
#ifndef TEST
int main() {
OPTIMIZE_STDIO;
solve(cin, cout);
return 0;
}
#endif
| replace | 110 | 111 | 110 | 111 | 0 | |
p02634 | C++ | Time Limit Exceeded | #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;
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define print(a) \
for (auto x : a) \
cout << x << " "; \
cout << endl
#define print1(a) \
for (auto x : a) \
cout << x.F << " " << x.S << endl
#define print2(a, x, y) \
for (int i = x; i < y; i++) \
cout << a[i] << " "; \
cout << endl
#define mk(x, y) make_pair(x, y)
typedef long long int ll;
const ll N = 1e6 + 5;
const ll mod = 998244353;
ll n, ans[N], dp[3005][3005], a, b, c, d;
ll pow_mod_m(ll a, ll n) {
if (!n)
return 1;
ll pt = pow_mod_m(a, n / 2);
pt *= pt, pt %= mod;
if (n & 1)
pt *= a, pt %= mod;
return pt;
}
int main() {
IOS;
int ts = 1;
/// cin >> ts;
while (ts--) {
cin >> a >> b >> c >> d;
dp[a][b] = 1;
rep(i, a, c + 1) {
rep(j, b, d + 1) {
dp[i][j] += (j)*dp[i - 1][j];
dp[i][j] += (i)*dp[i][j - 1];
dp[i][j] -= (i - 1) * (j - 1) * dp[i - 1][j - 1];
while (dp[i][j] < 0)
dp[i][j] += mod;
dp[i][j] %= mod;
}
/// cout << endl;
}
cout << dp[c][d] % mod << endl;
}
}
| #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;
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define IOS \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define endl "\n"
#define pb push_back
#define F first
#define S second
#define print(a) \
for (auto x : a) \
cout << x << " "; \
cout << endl
#define print1(a) \
for (auto x : a) \
cout << x.F << " " << x.S << endl
#define print2(a, x, y) \
for (int i = x; i < y; i++) \
cout << a[i] << " "; \
cout << endl
#define mk(x, y) make_pair(x, y)
typedef long long int ll;
const ll N = 1e6 + 5;
const ll mod = 998244353;
ll n, ans[N], dp[3005][3005], a, b, c, d;
ll pow_mod_m(ll a, ll n) {
if (!n)
return 1;
ll pt = pow_mod_m(a, n / 2);
pt *= pt, pt %= mod;
if (n & 1)
pt *= a, pt %= mod;
return pt;
}
int main() {
IOS;
int ts = 1;
/// cin >> ts;
while (ts--) {
cin >> a >> b >> c >> d;
dp[a][b] = 1;
rep(i, a, c + 1) {
rep(j, b, d + 1) {
dp[i][j] += (j)*dp[i - 1][j];
dp[i][j] += (i)*dp[i][j - 1];
dp[i][j] -= (i - 1) * (j - 1) * dp[i - 1][j - 1];
if (dp[i][j] < 0) {
dp[i][j] = (mod - llabs(dp[i][j]) % mod);
}
dp[i][j] %= mod;
}
/// cout << endl;
}
cout << dp[c][d] % mod << endl;
}
}
| replace | 52 | 54 | 52 | 55 | TLE | |
p02634 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int, int, int> tpl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define EXIST(m, v) (m).find((v)) != (m).end()
#define LB(a, x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a, x) upper_bound((a).begin(), (a).end(), x) - (a).begin()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define RREP(i, n) RFOR(i, n, 0)
#define en "\n"
constexpr double EPS = 1e-9;
constexpr double PI = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL << 60;
constexpr long long MOD = 998244353;
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
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;
}
void Main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
ll dp[C + 1][D + 1];
REP(i, C + 1) REP(j, D + 1) dp[i][j] = 0;
dp[A][B] = 1;
REP(i, C + 1) REP(j, D + 1) {
if (i)
(dp[i][j] += dp[i - 1][j] * j) %= MOD;
if (j)
(dp[i][j] += dp[i][j - 1] * i) %= MOD;
if (i && j) {
dp[i][j] -= dp[i - 1][j - 1] * (i - 1) * (j - 1);
while (dp[i][j] < 0)
dp[i][j] += MOD;
}
}
cout << dp[C][D] << en;
return;
}
int main(void) {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(15);
int t = 1; // cin>>t;
REP(_, t) Main();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef vector<string> VS;
typedef pair<int, int> P;
typedef tuple<int, int, int> tpl;
#define ALL(a) (a).begin(), (a).end()
#define SORT(c) sort((c).begin(), (c).end())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define EXIST(m, v) (m).find((v)) != (m).end()
#define LB(a, x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a, x) upper_bound((a).begin(), (a).end(), x) - (a).begin()
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RFOR(i, a, b) for (int i = (a)-1; i >= (b); --i)
#define RREP(i, n) RFOR(i, n, 0)
#define en "\n"
constexpr double EPS = 1e-9;
constexpr double PI = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL << 60;
constexpr long long MOD = 998244353;
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
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;
}
void Main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
ll dp[C + 1][D + 1];
REP(i, C + 1) REP(j, D + 1) dp[i][j] = 0;
dp[A][B] = 1;
REP(i, C + 1) REP(j, D + 1) {
if (i)
(dp[i][j] += dp[i - 1][j] * j) %= MOD;
if (j)
(dp[i][j] += dp[i][j - 1] * i) %= MOD;
if (i && j) {
dp[i][j] -= (dp[i - 1][j - 1] * (i - 1) * (j - 1)) % MOD;
if (dp[i][j] < 0)
dp[i][j] += MOD;
}
}
cout << dp[C][D] << en;
return;
}
int main(void) {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
cout << fixed << setprecision(15);
int t = 1; // cin>>t;
REP(_, t) Main();
return 0;
} | replace | 77 | 79 | 77 | 79 | TLE | |
p02634 | C++ | Runtime Error | #include "bits/stdc++.h"
#include <random>
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (lint i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (lint i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
const lint MOD = 998244353, INF = 1e16;
template <std::int_fast64_t Modulus> class modint {
using u64 = std::int_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
typedef modint<MOD> ModInt;
ModInt mod_pow(ModInt x, ModInt n) {
ModInt ret = 1;
while (n.a > 0) {
if (n.a & 1)
(ret *= x);
(x *= x);
n.a >>= 1;
}
return ret;
}
lint A, B, C, D;
ModInt dp[3001][3001];
int main() {
cin >> A >> B >> C >> D;
dp[A][B] = 1;
FOR(i, A, C + 1) {
FOR(j, B, D + 1) {
dp[i + 1][j] += dp[i][j] * j;
if (dp[i][j + 1].a != 0)
dp[i][j + 1] += dp[i][j] * i - dp[i - 1][j] * j * (i - 1);
else
dp[i][j + 1] += dp[i][j] * i;
}
}
cout << dp[C][D].a << endl;
}
| #include "bits/stdc++.h"
#include <random>
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (lint i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (lint i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
const lint MOD = 998244353, INF = 1e16;
template <std::int_fast64_t Modulus> class modint {
using u64 = std::int_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
typedef modint<MOD> ModInt;
ModInt mod_pow(ModInt x, ModInt n) {
ModInt ret = 1;
while (n.a > 0) {
if (n.a & 1)
(ret *= x);
(x *= x);
n.a >>= 1;
}
return ret;
}
lint A, B, C, D;
ModInt dp[3003][3003];
int main() {
cin >> A >> B >> C >> D;
dp[A][B] = 1;
FOR(i, A, C + 1) {
FOR(j, B, D + 1) {
dp[i + 1][j] += dp[i][j] * j;
if (dp[i][j + 1].a != 0)
dp[i][j + 1] += dp[i][j] * i - dp[i - 1][j] * j * (i - 1);
else
dp[i][j + 1] += dp[i][j] * i;
}
}
cout << dp[C][D].a << endl;
}
| replace | 103 | 104 | 103 | 104 | 0 | |
p02634 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (lint i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (lint i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
const lint MOD = 998244353, INF = 1e18;
template <std::int_fast64_t Modulus> class modint {
using u64 = std::int_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
typedef modint<MOD> ModInt;
lint A, B, C, D;
ModInt dp[3001][3001];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> A >> B >> C >> D;
REP(i, 3001) {
REP(j, 3001) { dp[i][j] = 0; }
}
dp[A][B] = 1;
FOR(i, A, C + 1) {
FOR(j, B, D + 1) {
dp[i + 1][j] += dp[i][j] * j;
dp[i][j + 1] += dp[i][j] * i - dp[i - 1][j] * (i - 1) * (j);
}
}
cout << dp[C][D].a << endl;
}
| #include "bits/stdc++.h"
using namespace std;
typedef long long int lint;
typedef pair<lint, lint> plint;
typedef pair<double long, double long> pld;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) \
for (lint i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (lint i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
const lint MOD = 998244353, INF = 1e18;
template <std::int_fast64_t Modulus> class modint {
using u64 = std::int_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
typedef modint<MOD> ModInt;
lint A, B, C, D;
ModInt dp[3002][3002];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cin >> A >> B >> C >> D;
REP(i, 3001) {
REP(j, 3001) { dp[i][j] = 0; }
}
dp[A][B] = 1;
FOR(i, A, C + 1) {
FOR(j, B, D + 1) {
dp[i + 1][j] += dp[i][j] * j;
dp[i][j + 1] += dp[i][j] * i - dp[i - 1][j] * (i - 1) * (j);
}
}
cout << dp[C][D].a << endl;
}
| replace | 91 | 92 | 91 | 92 | 0 | |
p02634 | Python | Time Limit Exceeded | import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
def main():
A, B, C, D = [int(x) for x in input().split()]
MOD = 998244353
dp = [[0] * (D - B + 1) for j in range(C - A + 1)]
for j in range(C - A + 1):
if j == 0:
dp[j][0] = 1
else:
dp[j][0] = B**j % MOD
for i in range(1, D - B + 1):
if j == 0:
dp[j][i] = dp[j][i - 1] * (A + j) % MOD
else:
dp[j][i] = (
dp[j][i - 1] * (A + j)
+ (B + i) * dp[j - 1][i]
- dp[j - 1][i - 1] * ((A + j - 1) * (B + i - 1))
) % MOD
print(dp[-1][-1] % MOD)
if __name__ == "__main__":
main()
| import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
def main():
A, B, C, D = [int(x) for x in input().split()]
MOD = 998244353
dp = [[0] * (D - B + 1) for j in range(C - A + 1)]
for j in range(C - A + 1):
if j == 0:
dp[j][0] = 1
else:
dp[j][0] = pow(B, j, MOD)
for i in range(1, D - B + 1):
if j == 0:
dp[j][i] = dp[j][i - 1] * (A + j) % MOD
else:
dp[j][i] = (
dp[j][i - 1] * (A + j)
+ (B + i) * dp[j - 1][i]
- dp[j - 1][i - 1] * ((A + j - 1) * (B + i - 1))
) % MOD
print(dp[-1][-1] % MOD)
if __name__ == "__main__":
main()
| replace | 18 | 19 | 18 | 19 | TLE | |
p02634 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 998244353;
int dp[4000][4000];
int f(int a, int b) {
if (~dp[a][b])
return dp[a][b];
return dp[a][b] = (f(a - 1, b) * b % MOD + f(a, b - 1) * a % MOD + MOD -
f(a - 1, b - 1) * (a - 1) % MOD * (b - 1) % MOD) %
MOD;
}
signed main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
memset(dp, -1, sizeof(dp));
for (int i = 0; i <= 4000; i++)
for (int j = 0; j <= 4000; j++)
if (i < a || j < b)
dp[i][j] = 0;
dp[a][b] = 1;
// for(int i=0;i<10;i++)for(int j=0;j<10;j++)cout<<i<<" "<<j<<"
// "<<f(i,j)<<endl;
cout << f(c, d) << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MOD = 998244353;
int dp[4001][4001];
int f(int a, int b) {
if (~dp[a][b])
return dp[a][b];
return dp[a][b] = (f(a - 1, b) * b % MOD + f(a, b - 1) * a % MOD + MOD -
f(a - 1, b - 1) * (a - 1) % MOD * (b - 1) % MOD) %
MOD;
}
signed main() {
int a, b, c, d;
cin >> a >> b >> c >> d;
memset(dp, -1, sizeof(dp));
for (int i = 0; i <= 4000; i++)
for (int j = 0; j <= 4000; j++)
if (i < a || j < b)
dp[i][j] = 0;
dp[a][b] = 1;
// for(int i=0;i<10;i++)for(int j=0;j<10;j++)cout<<i<<" "<<j<<"
// "<<f(i,j)<<endl;
cout << f(c, d) << endl;
}
| replace | 5 | 6 | 5 | 6 | -11 | |
p02634 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
constexpr int MOD = 998244353;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long double PI = acos(-1.0);
// cout << fixed << setprecision(14);
int dp[3010][3010];
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int A, B, C, D;
cin >> A >> B >> C >> D;
dp[A][B] = 1;
for (int i = A; i <= C; i++) {
for (int j = B; j <= D; j++) {
if (i == A && j == B)
continue;
if (i == A) {
dp[i][j] += dp[i][j - 1] * A;
} else if (j == B) {
dp[i][j] += dp[i - 1][j] * B;
} else {
dp[i][j] += dp[i][j - 1] * i + dp[i - 1][j] * j -
dp[i - 1][j - 1] * (i - 1) * (j - 1);
}
while (dp[i][j] <= 0)
dp[i][j] += MOD;
dp[i][j] %= MOD;
}
}
cout << dp[C][D] << endl;
} | #include <bits/stdc++.h>
#define int long long
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
constexpr int MOD = 998244353;
constexpr int INF = numeric_limits<int>::max() / 2;
typedef pair<int, int> P;
using Graph = vector<vector<int>>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long double PI = acos(-1.0);
// cout << fixed << setprecision(14);
int dp[3010][3010];
signed main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int A, B, C, D;
cin >> A >> B >> C >> D;
dp[A][B] = 1;
for (int i = A; i <= C; i++) {
for (int j = B; j <= D; j++) {
if (i == A && j == B)
continue;
if (i == A) {
dp[i][j] += dp[i][j - 1] * A;
} else if (j == B) {
dp[i][j] += dp[i - 1][j] * B;
} else {
dp[i][j] += dp[i][j - 1] * i + dp[i - 1][j] * j -
dp[i - 1][j - 1] * (i - 1) * (j - 1);
}
dp[i][j] += MOD * MOD;
dp[i][j] %= MOD;
}
}
cout << dp[C][D] << endl;
} | replace | 46 | 48 | 46 | 47 | TLE | |
p02634 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
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;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
template <::std::uint_fast64_t mod> class ModInt {
private:
using value_type = ::std::uint_fast64_t;
value_type n;
public:
ModInt() : n(0) {}
ModInt(value_type n_) : n(n_ % mod) {}
ModInt(const ModInt &m) : n(m.n) {}
template <typename T> explicit operator T() const {
return static_cast<T>(n);
}
value_type get() const { return n; }
friend ::std::ostream &operator<<(::std::ostream &os, const ModInt<mod> &a) {
return os << a.n;
}
friend ::std::istream &operator>>(::std::istream &is, ModInt<mod> &a) {
value_type x;
is >> x;
a = ModInt<mod>(x);
return is;
}
bool operator==(const ModInt &m) const { return n == m.n; }
bool operator!=(const ModInt &m) const { return n != m.n; }
ModInt &operator*=(const ModInt &m) {
n = n * m.n % mod;
return *this;
}
ModInt pow(value_type b) const {
ModInt ans = 1, m = ModInt(*this);
while (b) {
if (b & 1)
ans *= m;
m *= m;
b >>= 1;
}
return ans;
}
ModInt inv() const { return (*this).pow(mod - 2); }
ModInt &operator+=(const ModInt &m) {
n += m.n;
n = (n < mod ? n : n - mod);
return *this;
}
ModInt &operator-=(const ModInt &m) {
n += mod - m.n;
n = (n < mod ? n : n - mod);
return *this;
}
ModInt &operator/=(const ModInt &m) {
*this *= m.inv();
return *this;
}
ModInt operator+(const ModInt &m) const { return ModInt(*this) += m; }
ModInt operator-(const ModInt &m) const { return ModInt(*this) -= m; }
ModInt operator*(const ModInt &m) const { return ModInt(*this) *= m; }
ModInt operator/(const ModInt &m) const { return ModInt(*this) /= m; }
ModInt &operator++() {
n += 1;
return *this;
}
ModInt &operator--() {
n -= 1;
return *this;
}
ModInt operator++(int) {
ModInt old(n);
n += 1;
return old;
}
ModInt operator--(int) {
ModInt old(n);
n -= 1;
return old;
}
ModInt operator-() const { return ModInt(mod - n); }
};
template <::std::size_t size, ::std::uint_fast64_t mod = 1000000007>
class Factorial {
private:
using value_type = ModInt<mod>;
::std::vector<value_type> fact, inv;
public:
Factorial() : fact(size + 1, 1), inv(size + 1, 1) {
for (::std::size_t i = 1; i <= size; ++i) {
fact[i] = fact[i - 1] * value_type(i);
inv[i] = fact[i].inv();
}
}
value_type comb(::std::int64_t a, ::std::int64_t b) {
assert(a >= b);
assert(b >= 0);
return fact[a] * inv[b] * inv[a - b];
}
value_type &operator[](::std::size_t k) { return fact[k]; }
};
constexpr int64 mod = 998244353;
using Mint = ModInt<mod>;
Factorial<11234, mod> f;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int64 A, B, C, D;
cin >> A >> B >> C >> D;
auto dp = make_v<Mint>(C + 1, D + 1, 3, 3);
dp[A][B][0][0] = 1;
FOR(i, A, C + 1) {
FOR(j, B, D + 1) {
REP(r, 3) {
REP(c, 3) {
if (r == 1 && c == 1) {
dp[i][j][r][c] /= 2;
}
if (i + 1 <= C) {
if (c == 0) {
dp[i + 1][j][1][0] += dp[i][j][r][c] * j;
} else {
dp[i + 1][j][1][c] += dp[i][j][r][c] * (j - 1);
dp[i + 1][j][1][min(c + 1, (int64)2)] += dp[i][j][r][c];
}
}
if (j + 1 <= D) {
if (r == 0) {
dp[i][j + 1][0][1] += dp[i][j][r][c] * i;
} else {
dp[i][j + 1][r][1] += dp[i][j][r][c] * (i - 1);
dp[i][j + 1][min(r + 1, (int64)2)][1] += dp[i][j][r][c];
}
}
}
}
}
}
Mint res = 0;
REP(r, 3) {
REP(c, 3) { res += dp[C][D][r][c]; }
}
cout << res << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for (int64 i = 0; i < (n); i++)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define all(x) x.begin(), x.end()
#define fs first
#define sc second
using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;
const double eps = 1e-10;
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;
}
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value != 0>::type fill_v(U &u, const V... v) {
u = U(v...);
}
template <typename T, typename U, typename... V>
typename enable_if<is_same<T, U>::value == 0>::type fill_v(U &u, const V... v) {
for (auto &e : u)
fill_v<T>(e, v...);
}
template <::std::uint_fast64_t mod> class ModInt {
private:
using value_type = ::std::uint_fast64_t;
value_type n;
public:
ModInt() : n(0) {}
ModInt(value_type n_) : n(n_ % mod) {}
ModInt(const ModInt &m) : n(m.n) {}
template <typename T> explicit operator T() const {
return static_cast<T>(n);
}
value_type get() const { return n; }
friend ::std::ostream &operator<<(::std::ostream &os, const ModInt<mod> &a) {
return os << a.n;
}
friend ::std::istream &operator>>(::std::istream &is, ModInt<mod> &a) {
value_type x;
is >> x;
a = ModInt<mod>(x);
return is;
}
bool operator==(const ModInt &m) const { return n == m.n; }
bool operator!=(const ModInt &m) const { return n != m.n; }
ModInt &operator*=(const ModInt &m) {
n = n * m.n % mod;
return *this;
}
ModInt pow(value_type b) const {
ModInt ans = 1, m = ModInt(*this);
while (b) {
if (b & 1)
ans *= m;
m *= m;
b >>= 1;
}
return ans;
}
ModInt inv() const { return (*this).pow(mod - 2); }
ModInt &operator+=(const ModInt &m) {
n += m.n;
n = (n < mod ? n : n - mod);
return *this;
}
ModInt &operator-=(const ModInt &m) {
n += mod - m.n;
n = (n < mod ? n : n - mod);
return *this;
}
ModInt &operator/=(const ModInt &m) {
*this *= m.inv();
return *this;
}
ModInt operator+(const ModInt &m) const { return ModInt(*this) += m; }
ModInt operator-(const ModInt &m) const { return ModInt(*this) -= m; }
ModInt operator*(const ModInt &m) const { return ModInt(*this) *= m; }
ModInt operator/(const ModInt &m) const { return ModInt(*this) /= m; }
ModInt &operator++() {
n += 1;
return *this;
}
ModInt &operator--() {
n -= 1;
return *this;
}
ModInt operator++(int) {
ModInt old(n);
n += 1;
return old;
}
ModInt operator--(int) {
ModInt old(n);
n -= 1;
return old;
}
ModInt operator-() const { return ModInt(mod - n); }
};
template <::std::size_t size, ::std::uint_fast64_t mod = 1000000007>
class Factorial {
private:
using value_type = ModInt<mod>;
::std::vector<value_type> fact, inv;
public:
Factorial() : fact(size + 1, 1), inv(size + 1, 1) {
for (::std::size_t i = 1; i <= size; ++i) {
fact[i] = fact[i - 1] * value_type(i);
inv[i] = fact[i].inv();
}
}
value_type comb(::std::int64_t a, ::std::int64_t b) {
assert(a >= b);
assert(b >= 0);
return fact[a] * inv[b] * inv[a - b];
}
value_type &operator[](::std::size_t k) { return fact[k]; }
};
constexpr int64 mod = 998244353;
using Mint = ModInt<mod>;
Factorial<11234, mod> f;
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
int64 A, B, C, D;
cin >> A >> B >> C >> D;
using node = array<array<Mint, 3>, 3>;
auto dp = make_v<node>(C + 1, D + 1);
dp[A][B][0][0] = 1;
FOR(i, A, C + 1) {
FOR(j, B, D + 1) {
REP(r, 3) {
REP(c, 3) {
if (r == 1 && c == 1) {
dp[i][j][r][c] /= 2;
}
if (i + 1 <= C) {
if (c == 0) {
dp[i + 1][j][1][0] += dp[i][j][r][c] * j;
} else {
dp[i + 1][j][1][c] += dp[i][j][r][c] * (j - 1);
dp[i + 1][j][1][min(c + 1, (int64)2)] += dp[i][j][r][c];
}
}
if (j + 1 <= D) {
if (r == 0) {
dp[i][j + 1][0][1] += dp[i][j][r][c] * i;
} else {
dp[i][j + 1][r][1] += dp[i][j][r][c] * (i - 1);
dp[i][j + 1][min(r + 1, (int64)2)][1] += dp[i][j][r][c];
}
}
}
}
}
}
Mint res = 0;
REP(r, 3) {
REP(c, 3) { res += dp[C][D][r][c]; }
}
cout << res << endl;
}
| replace | 163 | 164 | 163 | 165 | TLE | |
p02634 | C++ | Runtime Error |
// #pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <vector>
#ifdef _MSC_VER
#include <intrin.h>
#define popcnt __popcnt64
// # define __builtin_popcount __popcnt
#else
#define popcnt __builtin_popcountll
#endif
// #include "boost/variant.hpp"
using namespace std;
typedef long long ll;
constexpr ll MOD = 998244353; // 1000000007LL;
constexpr ll INF = 1LL << 60;
#define rep(i, N, M) for (ll i = N, i##_len = (M); i < i##_len; ++i)
#define rep_skip(i, N, M, ...) \
for (ll i = N, i##_len = (M); i < i##_len; i += (skip))
#define rrep(i, N, M) for (ll i = (M)-1, i##_len = (N - 1); i > i##_len; --i)
#define repbit(bit, N, DIG) rep(bit, (N), (1LL << (DIG)))
#define pb push_back
#define fir first
#define sec second
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define perm(c) \
sort(all(c)); \
for (bool c##perm = 1; c##perm; \
c##perm = next_permutation( \
all(c))) // perm(c){write(c)} writes all permutation of c
constexpr ll dceil(ll x, ll y) {
if (y < 0) {
x *= -1;
y *= -1;
};
return x > 0 ? (x + y - 1) / y : x / y;
} // ceil for x/y
constexpr ll dfloor(ll x, ll y) {
if (y < 0) {
x *= -1;
y *= -1;
};
return x > 0 ? x / y : -dceil((-x), y);
} // floor for x/y
typedef pair<double, double> pd;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<pll> vpll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;
template <typename T>
using pq_greater = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using vpt = vector<complex<T>>;
template <int n> struct tll_impl {
using type = decltype(tuple_cat(tuple<ll>(),
declval<typename tll_impl<n - 1>::type>()));
};
template <> struct tll_impl<1> {
using type = tuple<ll>;
};
template <int n> using tll = typename tll_impl<n>::type;
template <class T> constexpr ll SZ(T &v) { return static_cast<ll>(v.size()); };
template <int n, typename T> struct vec_t_impl {
using type = vector<typename vec_t_impl<n - 1, T>::type>;
};
template <typename T> struct vec_t_impl<1, T> {
using type = vector<T>;
};
template <int n, typename T> using vec_t = typename vec_t_impl<n, T>::type;
// check
static_assert(is_same<vec_t<3, ll>, vector<vector<vector<ll>>>>::value, "");
// decompose vector into basetype and dimension.
template <typename T> struct vec_dec {
static constexpr int dim = 0;
using type = T;
};
template <typename T> struct vec_dec<vector<T>> {
static constexpr int dim = vec_dec<T>::dim + 1;
using type = typename vec_dec<T>::type;
};
static_assert(is_same<typename vec_dec<vec_t<3, ll>>::type, ll>::value, "");
static_assert(vec_dec<vec_t<3, ll>>::dim == 3, "");
template <typename T = ll> vector<T> makev(size_t a) { return vector<T>(a); }
template <typename T = ll, typename... Ts> auto makev(size_t a, Ts... ts) {
return vector<decltype(makev<T>(ts...))>(a, makev<T>(ts...));
} // ex: auto dp = makev<ll>(4,5) => vector<vector<ll>> dp(4,vector<ll>(5));
template <typename T>
struct is_vector : std::false_type {}; // check if T is vector
template <typename T> struct is_vector<vector<T>> : std::true_type {};
static_assert(is_vector<vector<ll>>::value == true &&
is_vector<ll>::value == false,
"");
// check if T is vector
template <typename T> struct is_pair : std::false_type {};
template <typename T, typename S>
struct is_pair<pair<T, S>> : std::true_type {};
static_assert(is_pair<pll>::value == true && is_pair<ll>::value == false, "");
template <typename T, typename V,
typename enable_if<!is_vector<T>::value, nullptr_t>::type = nullptr>
void fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void fill_v(T &t, const V &v) {
for (auto &&x : t)
fill_v(x, v);
} // ex: fill_v(dp, INF);
namespace std {
template <class T> bool operator<(const complex<T> &a, const complex<T> &b) {
return a.real() == b.real() ? a.imag() < b.imag() : a.real() < b.real();
}
}; // namespace std
template <typename T, typename S>
istream &operator>>(istream &istr, pair<T, S> &x) {
return istr >> x.first >> x.second;
}
template <typename T> istream &operator>>(istream &istr, vector<T> &x) {
rep(i, 0, x.size()) istr >> x[i];
return istr;
}
template <typename T> istream &operator>>(istream &istr, complex<T> &x) {
T r, i;
istr >> r >> i;
x.real(r);
x.imag(i);
return istr;
}
template <typename T, typename Delim_t = string,
typename enable_if<!is_vector<T>::value, nullptr_t>::type = nullptr>
void write(T &x, Delim_t delim = " ") {
cout << x << delim;
}
template <typename T, typename Delim_t = string,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void write(T &x, Delim_t delim = " ") {
rep(i, 0, x.size()) write(x[i], (i == (x.size() - 1) ? "" : delim));
cout << '\n';
}
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
vll seq(ll i, ll j) {
vll res(j - i);
rep(k, i, j) res[k] = i + k;
return res;
}
constexpr ll POW_0(ll x, ll y) {
if (y == 0)
return 1;
if (y == 1)
return x;
if (y == 2)
return x * x;
if (y % 2 == 0)
return POW_0(POW_0(x, y / 2), 2LL);
return ((POW_0(POW_0(x, y / 2), 2LL)) * (x));
}
constexpr ll POW(ll x, ll y, ll mod = 0) {
if (mod == 0)
return POW_0(x, y);
if (y == 0)
return 1;
if (y == 1)
return x % mod;
if (y == 2)
return x * x % mod;
if (y % 2 == 0)
return POW(POW(x, y / 2, mod), 2LL, mod) % mod;
return ((POW(POW(x, y / 2, mod), 2LL, mod)) * (x % mod)) % mod;
}
template <typename Inputs, typename Functor,
typename T = typename Inputs::value_type>
void sort_by(Inputs &inputs, Functor f) {
std::sort(std::begin(inputs), std::end(inputs),
[&f](const T &lhs, const T &rhs) { return f(lhs) < f(rhs); });
}
template <int pos, typename Inputs, typename T = typename Inputs::value_type>
void sort_by(Inputs &inputs) {
std::sort(
std::begin(inputs), std::end(inputs),
[](const T &lhs, const T &rhs) { return get<pos>(lhs) < get<pos>(rhs); });
}
template <typename Inputs, typename Functor,
typename T = typename Inputs::value_type>
void stable_sort_by(Inputs &inputs, Functor f) {
std::stable_sort(
std::begin(inputs), std::end(inputs),
[&f](const T &lhs, const T &rhs) { return f(lhs) < f(rhs); });
}
template <typename Inputs> void sort_uniq(Inputs &inputs) {
sort(all(inputs));
inputs.erase(unique(all(inputs)), inputs.end());
}
vector<string> split(const string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
if (s.size() > 0 && s.front() == delim) {
elems.push_back("");
}
while (getline(ss, item, delim)) {
if (!item.empty()) {
elems.push_back(item);
}
}
if (s.size() > 0 && s.back() == delim) {
elems.push_back("");
}
return elems;
}
template <class T> map<T, ll> inv_map(vector<T> &x) {
map<T, ll> res;
rep(i, 0, x.size()) { res[x[i]] = i; }
return res;
}
template <class K, class V> map<V, K> inv_map(map<K, V> &m) {
map<V, K> res;
for (const auto &x : m) {
res[x.second] = x.first;
}
return res;
}
template <class T, class val_t = typename T::value_type,
enable_if_t<!is_same<T, set<val_t>>::value> * = nullptr>
constexpr bool exist(const T &container, val_t val) {
return find(all(container), val) != container.end();
}
template <class T, class val_t = typename T::value_type,
enable_if_t<is_same<T, set<val_t>>::value> * = nullptr>
constexpr bool exist(const T &container, val_t val) {
return container.find(val) != container.end();
}
// inner prod: |a||b|cos(theta)
template <class T> T dot(complex<T> a, complex<T> b) {
return a.real() * b.real() + a.imag() * b.imag();
}
// outer prod |a||b|sin(theta)
template <class T> T cross(complex<T> a, complex<T> b) {
return a.real() * b.imag() - a.imag() * b.real();
}
ll div_ferm(ll val, ll b, ll mod) { return (val * POW(b, mod - 2, mod)) % mod; }
// === Modint ===
// static uint_fast64_t runtime_modulus = MOD;
template <ll modulus = MOD> class modint {
public:
ll val;
constexpr modint() : val(0) {}
constexpr modint(ll x) : val((x %= mod()) < 0 ? x + mod() : x) {}
constexpr modint(ll x, ll modulus_) {
set_modulo(modulus_);
val = (x %= mod()) < 0 ? x + mod() : x;
}
template <class Ret = ll &>
static auto modulo() -> std::enable_if_t<(modulus <= 0), Ret> {
static ll runtime_modulus = numeric_limits<ll>::max();
return runtime_modulus; // singleton technique
}
template <class Ret = const ll>
static auto mod() -> std::enable_if_t<(modulus <= 0), Ret> {
return modulo();
}
template <class Ret = const ll>
static constexpr auto mod() -> std::enable_if_t<(modulus > 0), Ret> {
return modulus;
}
template <ll modulus_ = modulus,
enable_if_t<(modulus_ <= 0), nullptr_t> = nullptr>
static void set_modulo(ll mod) {
modulo() = mod;
}
void reset_modulo(ll modulus_) {
modulo() = modulus_;
val %= mod();
}
constexpr modint inv() { return pow(mod() - 2); }
constexpr ll value() const noexcept { return val; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
modint &operator+=(const modint rhs) noexcept {
val += rhs.val;
if (val >= mod()) {
val -= mod();
}
return *this;
}
modint &operator-=(const modint rhs) noexcept {
if (val < rhs.val) {
val += mod();
}
val -= rhs.val;
return *this;
}
modint &operator*=(const modint rhs) noexcept {
val = val * rhs.val % mod();
return *this;
}
modint &operator/=(modint rhs) noexcept {
ll exp = mod() - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
modint &operator++() noexcept { return *this += modint(1); }
modint operator++(int) noexcept {
modint t = *this;
*this += modint(1);
return t;
}
modint &operator--() noexcept { return *this -= modint(1); }
modint operator--(int) noexcept {
modint t = *this;
*this -= modint(1);
return t;
}
constexpr modint operator-() { return val ? mod() - val : val; }
constexpr bool operator==(const modint rhs) const noexcept {
return val == rhs.value();
}
constexpr bool operator!=(const modint rhs) const noexcept {
return val != rhs.value();
}
constexpr bool operator<(const modint rhs) const noexcept {
return val < rhs.value();
}
static constexpr modint zero() { return modint(0); }
static constexpr modint unit() { return modint(1); }
modint pow(long long k) const {
modint v = *this;
modint res(1), tmp(v);
while (k) {
if (k & 1)
res *= tmp;
tmp *= tmp;
k >>= 1;
}
return res;
}
ll log(modint b) {
modint val = *this;
const ll sq = 40000;
map<modint, ll> dp;
// dp.reserve(sq);
modint res(1);
for (ll r = 0; r < sq; r++) {
if (!dp.count(res))
dp[res] = r;
res *= val;
}
modint p = val.inv().pow(sq);
res = b;
for (ll q = 0; q <= mod() / sq + 1; q++) {
if (dp.count(res)) {
ll idx = q * sq + dp[res];
if (idx > 0)
return idx;
}
res *= p;
}
return INF;
}
friend ostream &operator<<(ostream &o, const modint<modulus> &t) {
o << t.value();
return o;
}
friend istream &operator>>(istream &in, modint<modulus> &t) {
ll x;
in >> x;
t = modint<modulus>(x);
return in;
}
friend modint<modulus> POW(modint<modulus> x, ll n) {
return modint<modulus>(POW(x.value(), n, mod()));
}
};
// user defined literal
modint<MOD> operator"" _mod(unsigned long long x) { return modint<MOD>(x); }
template <class T = modint<>> class Combination {
// this calculates combination (nCk).
// Constructor runs in O(MAX).
// get(n,k) returns nCk in O(1).
ll N_MAX;
vector<T> fac, finv;
public:
Combination(ll N_MAX = 210000) : N_MAX(N_MAX), fac(N_MAX), finv(N_MAX) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
pre_process(2, N_MAX);
}
T operator()(ll n, ll k) {
// choose k from n
if (N_MAX < n)
pre_process(N_MAX, n);
if (0 <= n && n < k)
return 0;
if (k == 0)
return 1;
if (n < 0)
return operator()(-n + k - 1, k) * (k % 2 ? -1 : 0);
return fac[n] * (finv[k] * finv[n - k]);
}
T H(ll n, ll k) {
// 1) 区間[0, k) を（空を許して）n個に分割する場合の数
// 2) n個の中からk個を重複を許して選ぶ
return operator()(n + k - 1, k);
}
T P(ll n, ll k) { // n (n-1) ... (n-k+1)
if (N_MAX < n)
pre_process(N_MAX, n);
return (n < k || n < 0) ? T(0) : fac[n] * finv[n - k];
}
T Fac(ll n) { return P(n, n); }
T FacInv(ll n) {
if (N_MAX < n)
pre_process(N_MAX, n);
return n < 0 ? T(0) : finv[n];
}
private:
void pre_process(ll m, ll n) {
if (N_MAX < n) {
fac.resize(n);
finv.resize(n);
}
rep(i, m, n) {
fac[i] = fac[i - 1] * i;
finv[i] = finv[i - 1] / i;
}
}
};
ll choose(int n, int r) { // O(r) for small n
ll acc = 1;
rep(i, 0, r) acc = acc * (n - i) / (i + 1);
return acc;
}
ll gcd(ll val, ll b) {
if (val < 0)
val *= -1;
if (b < 0)
b *= -1;
if (val == 0)
return b;
if (b == 0)
return val;
if (val % b == 0)
return b;
else
return gcd(b, val % b);
}
vll divisor(ll n) {
// returns common divisors in O(sqrt(min(n,m)))
vll res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
res.push_back(n / i);
}
if (i * i == n)
res.push_back(i);
}
sort(res.begin(), res.end());
return res;
}
vll divisor(ll n, ll m) {
// returns common divisors in O(sqrt(min(n,m)))
if (n > m)
swap(n, m);
vll res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (m % i == 0)
res.push_back(i);
if (m % (n / i) == 0)
res.push_back(n / i);
}
if (i * i == n && m % i == 0)
res.push_back(i);
}
sort(res.begin(), res.end());
return res;
}
vpll prime_factorize(ll n) {
// returns prime factorization of n in O(sprt(n))
vector<pll> res;
for (ll p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
ll num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back({p, num});
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
ll eulers_phi(ll n) {
// returns the number of coprime integers in O(sqrt(n) + n^(1.4/log log n)) [
// the number of prime divisors <= O(log(n^(1.4/log log n) ) ]
ll res = 0;
auto primes = prime_factorize(n);
ll psize = primes.size();
rep(bit, 1, 1LL << psize) {
ll bitsize = popcnt(bit);
ll arg = (bitsize % 2 ? 1 : -1);
ll base = 1;
rep(i, 0, primes.size()) {
ll p = primes[i].first;
if (bit & (1LL << i))
base *= p;
}
res += arg * (n / base);
}
return n - res;
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
ll h, w, H, W;
cin >> h >> w >> H >> W;
using mod = modint<>;
vector<vector<mod>> dp(H, vector<mod>(W));
dp[h - 1][w - 1] = 1;
dp[h][w - 1] = w;
dp[h - 1][w] = h;
rep(i, h, H) { dp[i][w - 1] = dp[i - 1][w - 1] * w; }
rep(i, w, W) { dp[h - 1][i] = dp[h - 1][i - 1] * h; }
rep(i, h, H) rep(j, w, W) {
// dp[i][j] += dp[i - 1][j - 1] * (i) * (j);
dp[i][j] += dp[i - 1][j] * j;
dp[i][j] += dp[i][j - 1] * i;
dp[i][j] -= dp[i - 1][j - 1] * (i) * (j);
dp[i][j] += dp[i][j - 1] + dp[i - 1][j];
}
cout << dp[H - 1][W - 1] << endl;
return 0;
}
|
// #pragma GCC optimize ("-O3")
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <type_traits>
#include <typeinfo>
#include <unordered_map>
#include <vector>
#ifdef _MSC_VER
#include <intrin.h>
#define popcnt __popcnt64
// # define __builtin_popcount __popcnt
#else
#define popcnt __builtin_popcountll
#endif
// #include "boost/variant.hpp"
using namespace std;
typedef long long ll;
constexpr ll MOD = 998244353; // 1000000007LL;
constexpr ll INF = 1LL << 60;
#define rep(i, N, M) for (ll i = N, i##_len = (M); i < i##_len; ++i)
#define rep_skip(i, N, M, ...) \
for (ll i = N, i##_len = (M); i < i##_len; i += (skip))
#define rrep(i, N, M) for (ll i = (M)-1, i##_len = (N - 1); i > i##_len; --i)
#define repbit(bit, N, DIG) rep(bit, (N), (1LL << (DIG)))
#define pb push_back
#define fir first
#define sec second
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define perm(c) \
sort(all(c)); \
for (bool c##perm = 1; c##perm; \
c##perm = next_permutation( \
all(c))) // perm(c){write(c)} writes all permutation of c
constexpr ll dceil(ll x, ll y) {
if (y < 0) {
x *= -1;
y *= -1;
};
return x > 0 ? (x + y - 1) / y : x / y;
} // ceil for x/y
constexpr ll dfloor(ll x, ll y) {
if (y < 0) {
x *= -1;
y *= -1;
};
return x > 0 ? x / y : -dceil((-x), y);
} // floor for x/y
typedef pair<double, double> pd;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<pll> vpll;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;
template <typename T>
using pq_greater = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using vpt = vector<complex<T>>;
template <int n> struct tll_impl {
using type = decltype(tuple_cat(tuple<ll>(),
declval<typename tll_impl<n - 1>::type>()));
};
template <> struct tll_impl<1> {
using type = tuple<ll>;
};
template <int n> using tll = typename tll_impl<n>::type;
template <class T> constexpr ll SZ(T &v) { return static_cast<ll>(v.size()); };
template <int n, typename T> struct vec_t_impl {
using type = vector<typename vec_t_impl<n - 1, T>::type>;
};
template <typename T> struct vec_t_impl<1, T> {
using type = vector<T>;
};
template <int n, typename T> using vec_t = typename vec_t_impl<n, T>::type;
// check
static_assert(is_same<vec_t<3, ll>, vector<vector<vector<ll>>>>::value, "");
// decompose vector into basetype and dimension.
template <typename T> struct vec_dec {
static constexpr int dim = 0;
using type = T;
};
template <typename T> struct vec_dec<vector<T>> {
static constexpr int dim = vec_dec<T>::dim + 1;
using type = typename vec_dec<T>::type;
};
static_assert(is_same<typename vec_dec<vec_t<3, ll>>::type, ll>::value, "");
static_assert(vec_dec<vec_t<3, ll>>::dim == 3, "");
template <typename T = ll> vector<T> makev(size_t a) { return vector<T>(a); }
template <typename T = ll, typename... Ts> auto makev(size_t a, Ts... ts) {
return vector<decltype(makev<T>(ts...))>(a, makev<T>(ts...));
} // ex: auto dp = makev<ll>(4,5) => vector<vector<ll>> dp(4,vector<ll>(5));
template <typename T>
struct is_vector : std::false_type {}; // check if T is vector
template <typename T> struct is_vector<vector<T>> : std::true_type {};
static_assert(is_vector<vector<ll>>::value == true &&
is_vector<ll>::value == false,
"");
// check if T is vector
template <typename T> struct is_pair : std::false_type {};
template <typename T, typename S>
struct is_pair<pair<T, S>> : std::true_type {};
static_assert(is_pair<pll>::value == true && is_pair<ll>::value == false, "");
template <typename T, typename V,
typename enable_if<!is_vector<T>::value, nullptr_t>::type = nullptr>
void fill_v(T &t, const V &v) {
t = v;
}
template <typename T, typename V,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void fill_v(T &t, const V &v) {
for (auto &&x : t)
fill_v(x, v);
} // ex: fill_v(dp, INF);
namespace std {
template <class T> bool operator<(const complex<T> &a, const complex<T> &b) {
return a.real() == b.real() ? a.imag() < b.imag() : a.real() < b.real();
}
}; // namespace std
template <typename T, typename S>
istream &operator>>(istream &istr, pair<T, S> &x) {
return istr >> x.first >> x.second;
}
template <typename T> istream &operator>>(istream &istr, vector<T> &x) {
rep(i, 0, x.size()) istr >> x[i];
return istr;
}
template <typename T> istream &operator>>(istream &istr, complex<T> &x) {
T r, i;
istr >> r >> i;
x.real(r);
x.imag(i);
return istr;
}
template <typename T, typename Delim_t = string,
typename enable_if<!is_vector<T>::value, nullptr_t>::type = nullptr>
void write(T &x, Delim_t delim = " ") {
cout << x << delim;
}
template <typename T, typename Delim_t = string,
typename enable_if<is_vector<T>::value, nullptr_t>::type = nullptr>
void write(T &x, Delim_t delim = " ") {
rep(i, 0, x.size()) write(x[i], (i == (x.size() - 1) ? "" : delim));
cout << '\n';
}
template <typename T> void chmin(T &a, T b) {
if (a > b)
a = b;
}
template <typename T> void chmax(T &a, T b) {
if (a < b)
a = b;
}
vll seq(ll i, ll j) {
vll res(j - i);
rep(k, i, j) res[k] = i + k;
return res;
}
constexpr ll POW_0(ll x, ll y) {
if (y == 0)
return 1;
if (y == 1)
return x;
if (y == 2)
return x * x;
if (y % 2 == 0)
return POW_0(POW_0(x, y / 2), 2LL);
return ((POW_0(POW_0(x, y / 2), 2LL)) * (x));
}
constexpr ll POW(ll x, ll y, ll mod = 0) {
if (mod == 0)
return POW_0(x, y);
if (y == 0)
return 1;
if (y == 1)
return x % mod;
if (y == 2)
return x * x % mod;
if (y % 2 == 0)
return POW(POW(x, y / 2, mod), 2LL, mod) % mod;
return ((POW(POW(x, y / 2, mod), 2LL, mod)) * (x % mod)) % mod;
}
template <typename Inputs, typename Functor,
typename T = typename Inputs::value_type>
void sort_by(Inputs &inputs, Functor f) {
std::sort(std::begin(inputs), std::end(inputs),
[&f](const T &lhs, const T &rhs) { return f(lhs) < f(rhs); });
}
template <int pos, typename Inputs, typename T = typename Inputs::value_type>
void sort_by(Inputs &inputs) {
std::sort(
std::begin(inputs), std::end(inputs),
[](const T &lhs, const T &rhs) { return get<pos>(lhs) < get<pos>(rhs); });
}
template <typename Inputs, typename Functor,
typename T = typename Inputs::value_type>
void stable_sort_by(Inputs &inputs, Functor f) {
std::stable_sort(
std::begin(inputs), std::end(inputs),
[&f](const T &lhs, const T &rhs) { return f(lhs) < f(rhs); });
}
template <typename Inputs> void sort_uniq(Inputs &inputs) {
sort(all(inputs));
inputs.erase(unique(all(inputs)), inputs.end());
}
vector<string> split(const string &s, char delim) {
vector<string> elems;
stringstream ss(s);
string item;
if (s.size() > 0 && s.front() == delim) {
elems.push_back("");
}
while (getline(ss, item, delim)) {
if (!item.empty()) {
elems.push_back(item);
}
}
if (s.size() > 0 && s.back() == delim) {
elems.push_back("");
}
return elems;
}
template <class T> map<T, ll> inv_map(vector<T> &x) {
map<T, ll> res;
rep(i, 0, x.size()) { res[x[i]] = i; }
return res;
}
template <class K, class V> map<V, K> inv_map(map<K, V> &m) {
map<V, K> res;
for (const auto &x : m) {
res[x.second] = x.first;
}
return res;
}
template <class T, class val_t = typename T::value_type,
enable_if_t<!is_same<T, set<val_t>>::value> * = nullptr>
constexpr bool exist(const T &container, val_t val) {
return find(all(container), val) != container.end();
}
template <class T, class val_t = typename T::value_type,
enable_if_t<is_same<T, set<val_t>>::value> * = nullptr>
constexpr bool exist(const T &container, val_t val) {
return container.find(val) != container.end();
}
// inner prod: |a||b|cos(theta)
template <class T> T dot(complex<T> a, complex<T> b) {
return a.real() * b.real() + a.imag() * b.imag();
}
// outer prod |a||b|sin(theta)
template <class T> T cross(complex<T> a, complex<T> b) {
return a.real() * b.imag() - a.imag() * b.real();
}
ll div_ferm(ll val, ll b, ll mod) { return (val * POW(b, mod - 2, mod)) % mod; }
// === Modint ===
// static uint_fast64_t runtime_modulus = MOD;
template <ll modulus = MOD> class modint {
public:
ll val;
constexpr modint() : val(0) {}
constexpr modint(ll x) : val((x %= mod()) < 0 ? x + mod() : x) {}
constexpr modint(ll x, ll modulus_) {
set_modulo(modulus_);
val = (x %= mod()) < 0 ? x + mod() : x;
}
template <class Ret = ll &>
static auto modulo() -> std::enable_if_t<(modulus <= 0), Ret> {
static ll runtime_modulus = numeric_limits<ll>::max();
return runtime_modulus; // singleton technique
}
template <class Ret = const ll>
static auto mod() -> std::enable_if_t<(modulus <= 0), Ret> {
return modulo();
}
template <class Ret = const ll>
static constexpr auto mod() -> std::enable_if_t<(modulus > 0), Ret> {
return modulus;
}
template <ll modulus_ = modulus,
enable_if_t<(modulus_ <= 0), nullptr_t> = nullptr>
static void set_modulo(ll mod) {
modulo() = mod;
}
void reset_modulo(ll modulus_) {
modulo() = modulus_;
val %= mod();
}
constexpr modint inv() { return pow(mod() - 2); }
constexpr ll value() const noexcept { return val; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
modint &operator+=(const modint rhs) noexcept {
val += rhs.val;
if (val >= mod()) {
val -= mod();
}
return *this;
}
modint &operator-=(const modint rhs) noexcept {
if (val < rhs.val) {
val += mod();
}
val -= rhs.val;
return *this;
}
modint &operator*=(const modint rhs) noexcept {
val = val * rhs.val % mod();
return *this;
}
modint &operator/=(modint rhs) noexcept {
ll exp = mod() - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
modint &operator++() noexcept { return *this += modint(1); }
modint operator++(int) noexcept {
modint t = *this;
*this += modint(1);
return t;
}
modint &operator--() noexcept { return *this -= modint(1); }
modint operator--(int) noexcept {
modint t = *this;
*this -= modint(1);
return t;
}
constexpr modint operator-() { return val ? mod() - val : val; }
constexpr bool operator==(const modint rhs) const noexcept {
return val == rhs.value();
}
constexpr bool operator!=(const modint rhs) const noexcept {
return val != rhs.value();
}
constexpr bool operator<(const modint rhs) const noexcept {
return val < rhs.value();
}
static constexpr modint zero() { return modint(0); }
static constexpr modint unit() { return modint(1); }
modint pow(long long k) const {
modint v = *this;
modint res(1), tmp(v);
while (k) {
if (k & 1)
res *= tmp;
tmp *= tmp;
k >>= 1;
}
return res;
}
ll log(modint b) {
modint val = *this;
const ll sq = 40000;
map<modint, ll> dp;
// dp.reserve(sq);
modint res(1);
for (ll r = 0; r < sq; r++) {
if (!dp.count(res))
dp[res] = r;
res *= val;
}
modint p = val.inv().pow(sq);
res = b;
for (ll q = 0; q <= mod() / sq + 1; q++) {
if (dp.count(res)) {
ll idx = q * sq + dp[res];
if (idx > 0)
return idx;
}
res *= p;
}
return INF;
}
friend ostream &operator<<(ostream &o, const modint<modulus> &t) {
o << t.value();
return o;
}
friend istream &operator>>(istream &in, modint<modulus> &t) {
ll x;
in >> x;
t = modint<modulus>(x);
return in;
}
friend modint<modulus> POW(modint<modulus> x, ll n) {
return modint<modulus>(POW(x.value(), n, mod()));
}
};
// user defined literal
modint<MOD> operator"" _mod(unsigned long long x) { return modint<MOD>(x); }
template <class T = modint<>> class Combination {
// this calculates combination (nCk).
// Constructor runs in O(MAX).
// get(n,k) returns nCk in O(1).
ll N_MAX;
vector<T> fac, finv;
public:
Combination(ll N_MAX = 210000) : N_MAX(N_MAX), fac(N_MAX), finv(N_MAX) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
pre_process(2, N_MAX);
}
T operator()(ll n, ll k) {
// choose k from n
if (N_MAX < n)
pre_process(N_MAX, n);
if (0 <= n && n < k)
return 0;
if (k == 0)
return 1;
if (n < 0)
return operator()(-n + k - 1, k) * (k % 2 ? -1 : 0);
return fac[n] * (finv[k] * finv[n - k]);
}
T H(ll n, ll k) {
// 1) 区間[0, k) を（空を許して）n個に分割する場合の数
// 2) n個の中からk個を重複を許して選ぶ
return operator()(n + k - 1, k);
}
T P(ll n, ll k) { // n (n-1) ... (n-k+1)
if (N_MAX < n)
pre_process(N_MAX, n);
return (n < k || n < 0) ? T(0) : fac[n] * finv[n - k];
}
T Fac(ll n) { return P(n, n); }
T FacInv(ll n) {
if (N_MAX < n)
pre_process(N_MAX, n);
return n < 0 ? T(0) : finv[n];
}
private:
void pre_process(ll m, ll n) {
if (N_MAX < n) {
fac.resize(n);
finv.resize(n);
}
rep(i, m, n) {
fac[i] = fac[i - 1] * i;
finv[i] = finv[i - 1] / i;
}
}
};
ll choose(int n, int r) { // O(r) for small n
ll acc = 1;
rep(i, 0, r) acc = acc * (n - i) / (i + 1);
return acc;
}
ll gcd(ll val, ll b) {
if (val < 0)
val *= -1;
if (b < 0)
b *= -1;
if (val == 0)
return b;
if (b == 0)
return val;
if (val % b == 0)
return b;
else
return gcd(b, val % b);
}
vll divisor(ll n) {
// returns common divisors in O(sqrt(min(n,m)))
vll res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
res.push_back(n / i);
}
if (i * i == n)
res.push_back(i);
}
sort(res.begin(), res.end());
return res;
}
vll divisor(ll n, ll m) {
// returns common divisors in O(sqrt(min(n,m)))
if (n > m)
swap(n, m);
vll res;
for (ll i = 1; i * i <= n; i++) {
if (n % i == 0) {
if (m % i == 0)
res.push_back(i);
if (m % (n / i) == 0)
res.push_back(n / i);
}
if (i * i == n && m % i == 0)
res.push_back(i);
}
sort(res.begin(), res.end());
return res;
}
vpll prime_factorize(ll n) {
// returns prime factorization of n in O(sprt(n))
vector<pll> res;
for (ll p = 2; p * p <= n; ++p) {
if (n % p != 0)
continue;
ll num = 0;
while (n % p == 0) {
++num;
n /= p;
}
res.push_back({p, num});
}
if (n != 1)
res.push_back(make_pair(n, 1));
return res;
}
ll eulers_phi(ll n) {
// returns the number of coprime integers in O(sqrt(n) + n^(1.4/log log n)) [
// the number of prime divisors <= O(log(n^(1.4/log log n) ) ]
ll res = 0;
auto primes = prime_factorize(n);
ll psize = primes.size();
rep(bit, 1, 1LL << psize) {
ll bitsize = popcnt(bit);
ll arg = (bitsize % 2 ? 1 : -1);
ll base = 1;
rep(i, 0, primes.size()) {
ll p = primes[i].first;
if (bit & (1LL << i))
base *= p;
}
res += arg * (n / base);
}
return n - res;
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(12);
ll h, w, H, W;
cin >> h >> w >> H >> W;
using mod = modint<>;
vector<vector<mod>> dp(H + 1, vector<mod>(W + 1));
dp[h - 1][w - 1] = 1;
dp[h][w - 1] = w;
dp[h - 1][w] = h;
rep(i, h, H) { dp[i][w - 1] = dp[i - 1][w - 1] * w; }
rep(i, w, W) { dp[h - 1][i] = dp[h - 1][i - 1] * h; }
rep(i, h, H) rep(j, w, W) {
// dp[i][j] += dp[i - 1][j - 1] * (i) * (j);
dp[i][j] += dp[i - 1][j] * j;
dp[i][j] += dp[i][j - 1] * i;
dp[i][j] -= dp[i - 1][j - 1] * (i) * (j);
dp[i][j] += dp[i][j - 1] + dp[i - 1][j];
}
cout << dp[H - 1][W - 1] << endl;
return 0;
}
| replace | 619 | 620 | 619 | 620 | 0 | |
p02634 | C++ | Runtime Error | // #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("Ofast")
// #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T>
// using ordered_set = tree <T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>; #define sfind(i) (*find_by_order(i))
// #define ord(i) order_of_key(i)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
using cd = complex<double>;
const double pi = acos(-1);
#define mod 998244353
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repc(i, a, b, c) \
for (ll i = a; (c > 0 ? i < b : i > b) and c != 0; i += c)
#define vi vector<int>
#define vl vector<ll>
#define _max(vec) (*max_element(all(vec)))
#define _min(vec) (*min_element(all(vec)))
#define fi first
#define si second
#define pb push_back
#define all(name) name.begin(), name.end()
#define ral(name) name.rbegin(), name.rend()
#define fact(n) rep(i, 1, n + 1) ft.pb((ft[i - 1] * i) % mod)
#define mod_in(a) power(a, mod - 2)
#define ncr(n, r) \
(n >= r ? ((ft[n] * mod_in((ft[r] * ft[(n) - (r)]) % mod)) % mod) : 0LL)
#define deb(x) cerr << "[" << #x << " " << x << "]" << endl;
#define endl '\n' //....????
#define int ll
vector<ll> ft(1, 1LL);
/*======================================================================*/
int dp[3001][3001];
void solve() {
int a, b, c, d;
cin >> a >> b >> c >> d;
dp[a][b] = 1;
rep(i, a, c + 1) {
rep(j, b, d + 1) {
dp[i][j] -= (dp[i - 1][j - 1] * (i - 1) * (j - 1)) % mod;
if (dp[i][j] < 0)
dp[i][j] += mod;
dp[i + 1][j] += (dp[i][j] * j) % mod;
if (dp[i + 1][j] >= mod)
dp[i + 1][j] -= mod;
dp[i][j + 1] += (dp[i][j] * i) % mod;
if (dp[i][j + 1] >= mod)
dp[i][j + 1] -= mod;
}
}
cout << dp[c][d];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
} | // #pragma GCC target("avx,avx2,fma")
// #pragma GCC optimization ("Ofast")
// #pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T>
// using ordered_set = tree <T, null_type, less<T>, rb_tree_tag,
// tree_order_statistics_node_update>; #define sfind(i) (*find_by_order(i))
// #define ord(i) order_of_key(i)
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pii> vii;
typedef vector<pll> vll;
using cd = complex<double>;
const double pi = acos(-1);
#define mod 998244353
#define rep(i, a, b) for (ll i = a; i < b; i++)
#define repc(i, a, b, c) \
for (ll i = a; (c > 0 ? i < b : i > b) and c != 0; i += c)
#define vi vector<int>
#define vl vector<ll>
#define _max(vec) (*max_element(all(vec)))
#define _min(vec) (*min_element(all(vec)))
#define fi first
#define si second
#define pb push_back
#define all(name) name.begin(), name.end()
#define ral(name) name.rbegin(), name.rend()
#define fact(n) rep(i, 1, n + 1) ft.pb((ft[i - 1] * i) % mod)
#define mod_in(a) power(a, mod - 2)
#define ncr(n, r) \
(n >= r ? ((ft[n] * mod_in((ft[r] * ft[(n) - (r)]) % mod)) % mod) : 0LL)
#define deb(x) cerr << "[" << #x << " " << x << "]" << endl;
#define endl '\n' //....????
#define int ll
vector<ll> ft(1, 1LL);
/*======================================================================*/
int dp[3005][3005];
void solve() {
int a, b, c, d;
cin >> a >> b >> c >> d;
dp[a][b] = 1;
rep(i, a, c + 1) {
rep(j, b, d + 1) {
dp[i][j] -= (dp[i - 1][j - 1] * (i - 1) * (j - 1)) % mod;
if (dp[i][j] < 0)
dp[i][j] += mod;
dp[i + 1][j] += (dp[i][j] * j) % mod;
if (dp[i + 1][j] >= mod)
dp[i + 1][j] -= mod;
dp[i][j + 1] += (dp[i][j] * i) % mod;
if (dp[i][j + 1] >= mod)
dp[i][j + 1] -= mod;
}
}
cout << dp[c][d];
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
} | replace | 44 | 45 | 44 | 45 | 0 | |
p02634 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long ll;
const ll mod = 998244353;
const int N = 1e3 + 5;
using namespace std;
int dp[N][N][2];
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
if (C > A)
dp[C][D][0] = 1;
if (D > B)
dp[C][D][1] = 1;
ll ans = 0;
for (int i = C; i >= A; i--)
for (int j = D; j >= B; j--) {
dp[i][j - 1][0] = (dp[i][j - 1][0] + (ll)dp[i][j][1] * i) % mod;
dp[i][j - 1][1] = (dp[i][j - 1][1] + (ll)dp[i][j][1] * i) % mod;
dp[i - 1][j][0] = (dp[i - 1][j][0] + (ll)dp[i][j][0] * j) % mod;
dp[i - 1][j][1] = (dp[i - 1][j][1] + (ll)dp[i][j][0]) % mod;
if (i == A && j - 1 == B)
ans = (ans + (ll)dp[i][j][1] * i) % mod;
if (i - 1 == A && j == B)
ans = (ans + (ll)dp[i][j][0] * j) % mod;
}
if (A == C && B == D)
ans = 1;
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
typedef long long ll;
const ll mod = 998244353;
const int N = 3e3 + 5;
using namespace std;
int dp[N][N][2];
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
if (C > A)
dp[C][D][0] = 1;
if (D > B)
dp[C][D][1] = 1;
ll ans = 0;
for (int i = C; i >= A; i--)
for (int j = D; j >= B; j--) {
dp[i][j - 1][0] = (dp[i][j - 1][0] + (ll)dp[i][j][1] * i) % mod;
dp[i][j - 1][1] = (dp[i][j - 1][1] + (ll)dp[i][j][1] * i) % mod;
dp[i - 1][j][0] = (dp[i - 1][j][0] + (ll)dp[i][j][0] * j) % mod;
dp[i - 1][j][1] = (dp[i - 1][j][1] + (ll)dp[i][j][0]) % mod;
if (i == A && j - 1 == B)
ans = (ans + (ll)dp[i][j][1] * i) % mod;
if (i - 1 == A && j == B)
ans = (ans + (ll)dp[i][j][0] * j) % mod;
}
if (A == C && B == D)
ans = 1;
cout << ans << endl;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.