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 | /*input
37564
whydidyoudesertme
*/
// Nihesh Anderson - knandy
#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;
typedef long long ll;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set; // find_by_order, order_of_key
ll MOD = 1000000007;
#define endl '\n'
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
ll INF = 2000000000000000001;
long double EPS = 1e-9;
ll power(ll a, ll n, ll md) {
if (n == 0) {
return 1;
} else {
ll res = power(a, n / 2, md);
res = (res * res) % md;
if (n % 2 != 0) {
res = (res * a) % md;
}
return res;
}
}
random_device rndm;
mt19937 grndm(rndm());
void mix(ll *a, ll *b) { shuffle(a, b, grndm); }
const ll MX = 1000006;
ll fact[MX], ifact[MX], pow25[MX], pow26[MX];
ll choose(ll n, ll k) { return fact[n] * ifact[k] % MOD * ifact[n - k] % MOD; }
int main() {
fast_cin();
// freopen("input.in","r",stdin);
// freopen("output.out","w",stdout);
fact[0] = 1;
for (ll i = 1; i < MX; i++) {
fact[i] = (i * fact[i - 1]) % MOD;
}
for (ll i = 0; i < MX; i++) {
ifact[i] = power(fact[i], MOD - 2, MOD);
}
pow25[0] = pow26[0] = 1;
for (ll i = 1; i < MX; i++) {
pow25[i] = (25 * pow25[i - 1]) % MOD;
pow26[i] = (26 * pow26[i - 1]) % MOD;
}
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll ans = 0;
for (ll i = n - 1; i <= n + k - 1; i++) {
ans = (ans + choose(i, n - 1) * pow26[n + k - 1 - i] % MOD *
pow25[i - n + 1] % MOD) %
MOD;
}
cout << ans << endl;
return 0;
} | /*input
37564
whydidyoudesertme
*/
// Nihesh Anderson - knandy
#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;
typedef long long ll;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set; // find_by_order, order_of_key
ll MOD = 1000000007;
#define endl '\n'
#define fast_cin() \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define pb push_back
ll INF = 2000000000000000001;
long double EPS = 1e-9;
ll power(ll a, ll n, ll md) {
if (n == 0) {
return 1;
} else {
ll res = power(a, n / 2, md);
res = (res * res) % md;
if (n % 2 != 0) {
res = (res * a) % md;
}
return res;
}
}
random_device rndm;
mt19937 grndm(rndm());
void mix(ll *a, ll *b) { shuffle(a, b, grndm); }
const ll MX = 2000006;
ll fact[MX], ifact[MX], pow25[MX], pow26[MX];
ll choose(ll n, ll k) { return fact[n] * ifact[k] % MOD * ifact[n - k] % MOD; }
int main() {
fast_cin();
// freopen("input.in","r",stdin);
// freopen("output.out","w",stdout);
fact[0] = 1;
for (ll i = 1; i < MX; i++) {
fact[i] = (i * fact[i - 1]) % MOD;
}
for (ll i = 0; i < MX; i++) {
ifact[i] = power(fact[i], MOD - 2, MOD);
}
pow25[0] = pow26[0] = 1;
for (ll i = 1; i < MX; i++) {
pow25[i] = (25 * pow25[i - 1]) % MOD;
pow26[i] = (26 * pow26[i - 1]) % MOD;
}
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll ans = 0;
for (ll i = n - 1; i <= n + k - 1; i++) {
ans = (ans + choose(i, n - 1) * pow26[n + k - 1 - i] % MOD *
pow25[i - n + 1] % MOD) %
MOD;
}
cout << ans << endl;
return 0;
} | replace | 45 | 46 | 45 | 46 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h> // clang-format off
using Int = long long;
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false), std::cout << std::fixed << std::setprecision(13); } } setup_io;
#ifndef dump
#define dump(...)
#endif // clang-format on
/**
* author: knshnb
* created: Sun Jun 21 21:22:27 JST 2020
**/
template <class T> T pow(T x, long long n, const T UNION = 1) {
T ret = UNION;
while (n) {
if (n & 1)
ret *= x;
x *= x;
n >>= 1;
}
return ret;
}
/// @docs src/Math/ModInt.md
template <int Mod> struct ModInt {
int x;
static int runtime_mod;
static std::unordered_map<int, int> to_inv;
// テンプレート引数が負のときは実行時ModInt
static int mod() { return Mod < 0 ? runtime_mod : Mod; }
static void set_runtime_mod(int mod) {
static_assert(Mod < 0,
"template parameter Mod must be negative for runtime ModInt");
runtime_mod = mod;
to_inv.clear();
}
ModInt() : x(0) {}
ModInt(long long x_) {
if ((x = x_ % mod() + mod()) >= mod())
x -= mod();
}
ModInt &operator+=(ModInt rhs) {
if ((x += rhs.x) >= mod())
x -= mod();
return *this;
}
ModInt &operator*=(ModInt rhs) {
x = (unsigned long long)x * rhs.x % mod();
return *this;
}
ModInt &operator-=(ModInt rhs) {
if ((x -= rhs.x) < 0)
x += mod();
return *this;
}
ModInt &operator/=(ModInt rhs) {
x = (unsigned long long)x * rhs.inv().x % mod();
return *this;
}
ModInt operator-() const { return -x < 0 ? mod() - x : -x; }
ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; }
ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; }
ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; }
ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; }
bool operator==(ModInt rhs) const { return x == rhs.x; }
bool operator!=(ModInt rhs) const { return x != rhs.x; }
ModInt inv() const {
return to_inv.count(this->x) ? to_inv[this->x]
: (to_inv[this->x] = pow(*this, mod() - 2).x);
}
friend std::ostream &operator<<(std::ostream &s, ModInt<Mod> a) {
s << a.x;
return s;
}
friend std::istream &operator>>(std::istream &s, ModInt<Mod> &a) {
long long tmp;
s >> tmp;
a = ModInt<Mod>(tmp);
return s;
}
friend std::string to_string(ModInt<Mod> a) { return std::to_string(a.x); }
};
template <int Mod> std::unordered_map<int, int> ModInt<Mod>::to_inv;
template <int Mod> int ModInt<Mod>::runtime_mod;
#ifndef CALL_FROM_TEST
using mint = ModInt<1000000007>;
#endif
template <class T> struct Combination {
std::vector<T> fact, fact_inv;
Combination(int n = 1000003) : fact(n + 1, 1), fact_inv(n + 1) {
for (int i = 0; i < n; i++)
fact[i + 1] = fact[i] * (i + 1);
fact_inv[n] = (T)1 / fact[n];
for (int i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1);
// for (int i = 0; i < n + 1; i++) assert(fact[i] * fact_inv[i] == 1);
}
T operator()(int n, int r) { return fact[n] * fact_inv[r] * fact_inv[n - r]; }
};
signed main() {
Combination<mint> comb;
Int K;
std::string s;
std::cin >> K >> s;
Int n = s.size();
mint ans = 0;
REP(i, n, n + K + 1) { ans += comb(n + K, i) * pow(mint(25), n + K - i); }
std::cout << ans << std::endl;
}
| #include <bits/stdc++.h> // clang-format off
using Int = long long;
#define REP_(i, a_, b_, a, b, ...) for (Int i = (a), lim##i = (b); i < lim##i; i++)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
struct SetupIO { SetupIO() { std::cin.tie(nullptr), std::ios::sync_with_stdio(false), std::cout << std::fixed << std::setprecision(13); } } setup_io;
#ifndef dump
#define dump(...)
#endif // clang-format on
/**
* author: knshnb
* created: Sun Jun 21 21:22:27 JST 2020
**/
template <class T> T pow(T x, long long n, const T UNION = 1) {
T ret = UNION;
while (n) {
if (n & 1)
ret *= x;
x *= x;
n >>= 1;
}
return ret;
}
/// @docs src/Math/ModInt.md
template <int Mod> struct ModInt {
int x;
static int runtime_mod;
static std::unordered_map<int, int> to_inv;
// テンプレート引数が負のときは実行時ModInt
static int mod() { return Mod < 0 ? runtime_mod : Mod; }
static void set_runtime_mod(int mod) {
static_assert(Mod < 0,
"template parameter Mod must be negative for runtime ModInt");
runtime_mod = mod;
to_inv.clear();
}
ModInt() : x(0) {}
ModInt(long long x_) {
if ((x = x_ % mod() + mod()) >= mod())
x -= mod();
}
ModInt &operator+=(ModInt rhs) {
if ((x += rhs.x) >= mod())
x -= mod();
return *this;
}
ModInt &operator*=(ModInt rhs) {
x = (unsigned long long)x * rhs.x % mod();
return *this;
}
ModInt &operator-=(ModInt rhs) {
if ((x -= rhs.x) < 0)
x += mod();
return *this;
}
ModInt &operator/=(ModInt rhs) {
x = (unsigned long long)x * rhs.inv().x % mod();
return *this;
}
ModInt operator-() const { return -x < 0 ? mod() - x : -x; }
ModInt operator+(ModInt rhs) const { return ModInt(*this) += rhs; }
ModInt operator*(ModInt rhs) const { return ModInt(*this) *= rhs; }
ModInt operator-(ModInt rhs) const { return ModInt(*this) -= rhs; }
ModInt operator/(ModInt rhs) const { return ModInt(*this) /= rhs; }
bool operator==(ModInt rhs) const { return x == rhs.x; }
bool operator!=(ModInt rhs) const { return x != rhs.x; }
ModInt inv() const {
return to_inv.count(this->x) ? to_inv[this->x]
: (to_inv[this->x] = pow(*this, mod() - 2).x);
}
friend std::ostream &operator<<(std::ostream &s, ModInt<Mod> a) {
s << a.x;
return s;
}
friend std::istream &operator>>(std::istream &s, ModInt<Mod> &a) {
long long tmp;
s >> tmp;
a = ModInt<Mod>(tmp);
return s;
}
friend std::string to_string(ModInt<Mod> a) { return std::to_string(a.x); }
};
template <int Mod> std::unordered_map<int, int> ModInt<Mod>::to_inv;
template <int Mod> int ModInt<Mod>::runtime_mod;
#ifndef CALL_FROM_TEST
using mint = ModInt<1000000007>;
#endif
template <class T> struct Combination {
std::vector<T> fact, fact_inv;
Combination(int n = 2000003) : fact(n + 1, 1), fact_inv(n + 1) {
for (int i = 0; i < n; i++)
fact[i + 1] = fact[i] * (i + 1);
fact_inv[n] = (T)1 / fact[n];
for (int i = n - 1; i >= 0; i--)
fact_inv[i] = fact_inv[i + 1] * (i + 1);
// for (int i = 0; i < n + 1; i++) assert(fact[i] * fact_inv[i] == 1);
}
T operator()(int n, int r) { return fact[n] * fact_inv[r] * fact_inv[n - r]; }
};
signed main() {
Combination<mint> comb;
Int K;
std::string s;
std::cin >> K >> s;
Int n = s.size();
mint ans = 0;
REP(i, n, n + K + 1) { ans += comb(n + K, i) * pow(mint(25), n + K - i); }
std::cout << ans << std::endl;
}
| replace | 95 | 96 | 95 | 96 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<ll, ll> P;
const int mod =
1000000007; // 出力は (ans % mod + mod) % mod (負の剰余を正にする)
const int inf = 1e9;
const long long INF = 1LL << 60; // INF = 11
#define N_MAX 201010
ll f[N_MAX], rf[N_MAX];
// f[n] := n!
// rf[n] := (n!)^-1
ll modpow(ll a, ll b) { // aのb乗
ll ans = 1;
while (b > 0) {
if (b & 1)
ans = ans * a % mod;
a = a * a % mod;
b /= 2;
}
return ans;
}
void init() {
f[0] = 1;
for (ll i = 1; i < N_MAX; i++) {
f[i] = (i * f[i - 1]) % mod;
}
for (ll i = 0; i < N_MAX; i++) {
rf[i] = modpow(f[i], mod - 2);
}
}
ll com(ll n, ll k) {
// init();
ll a = f[n];
ll b = rf[k];
ll c = rf[n - k];
ll bc = (b * c) % mod;
return ((a * bc) % mod);
}
int main() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
init();
ll ans = 0;
for (ll i = 0; i <= k; i++) {
ans += com((n - 1 + k - i), (n - 1)) * modpow(25, k - i) % mod *
modpow(26, i) % mod;
ans %= mod;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
typedef long long ll;
typedef pair<ll, ll> P;
const int mod =
1000000007; // 出力は (ans % mod + mod) % mod (負の剰余を正にする)
const int inf = 1e9;
const long long INF = 1LL << 60; // INF = 11
#define N_MAX 2010100
ll f[N_MAX], rf[N_MAX];
// f[n] := n!
// rf[n] := (n!)^-1
ll modpow(ll a, ll b) { // aのb乗
ll ans = 1;
while (b > 0) {
if (b & 1)
ans = ans * a % mod;
a = a * a % mod;
b /= 2;
}
return ans;
}
void init() {
f[0] = 1;
for (ll i = 1; i < N_MAX; i++) {
f[i] = (i * f[i - 1]) % mod;
}
for (ll i = 0; i < N_MAX; i++) {
rf[i] = modpow(f[i], mod - 2);
}
}
ll com(ll n, ll k) {
// init();
ll a = f[n];
ll b = rf[k];
ll c = rf[n - k];
ll bc = (b * c) % mod;
return ((a * bc) % mod);
}
int main() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
init();
ll ans = 0;
for (ll i = 0; i <= k; i++) {
ans += com((n - 1 + k - i), (n - 1)) * modpow(25, k - i) % mod *
modpow(26, i) % mod;
ans %= mod;
}
cout << ans << endl;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
const int N = 1000001;
int n, k, fact[N], inv[N], mod = 1e9 + 7;
string s;
int powlog(int a, int b) {
if (b == 0)
return 1;
int ret = powlog(a, b / 2);
if (b % 2)
return 1LL * ret * ret % mod * a % mod;
return 1LL * ret * ret % mod;
}
int C(int n, int r) {
if (r > n)
return 0;
return 1LL * fact[n] * inv[n - r] % mod * inv[r] % mod;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = 1LL * i * fact[i - 1] % mod;
}
inv[N - 1] = powlog(fact[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--) {
inv[i] = 1LL * (i + 1) * inv[i + 1] % mod;
}
cin >> k >> s;
n = s.size();
int ans = 0;
for (int i = 0; i <= k; i++) {
ans = (ans + 1LL * powlog(25, k - i) * powlog(26, i) % mod *
C(n - 1 + k - i, n - 1)) %
mod;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define finish(x) return cout << x << endl, 0
#define ll long long
const int N = 2000001;
int n, k, fact[N], inv[N], mod = 1e9 + 7;
string s;
int powlog(int a, int b) {
if (b == 0)
return 1;
int ret = powlog(a, b / 2);
if (b % 2)
return 1LL * ret * ret % mod * a % mod;
return 1LL * ret * ret % mod;
}
int C(int n, int r) {
if (r > n)
return 0;
return 1LL * fact[n] * inv[n - r] % mod * inv[r] % mod;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = 1LL * i * fact[i - 1] % mod;
}
inv[N - 1] = powlog(fact[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--) {
inv[i] = 1LL * (i + 1) * inv[i + 1] % mod;
}
cin >> k >> s;
n = s.size();
int ans = 0;
for (int i = 0; i <= k; i++) {
ans = (ans + 1LL * powlog(25, k - i) * powlog(26, i) % mod *
C(n - 1 + k - i, n - 1)) %
mod;
}
cout << ans << endl;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02632 | C++ | Runtime Error | // #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#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;
#define rep(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
// typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
typedef vector<vector<int>> mat;
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 (b < a) {
a = b;
return true;
}
return false;
}
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int MAX = 1000010;
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 modpow(int x, int n, const int mo) {
int res = 1;
while (n > 0) {
if (n & 1)
(res *= x) %= mo;
(x *= x) %= mo;
n >>= 1;
}
return res;
}
int inverse(int x, const int mo) { return modpow(x, mo - 2, mo); }
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
COMinit();
int K;
cin >> K;
string S;
cin >> S;
int ans = 0;
rep(i, 0, K + 1) {
int l = modpow(25LL, i, MOD);
int r = modpow(26LL, K - i, MOD);
int con = COM(SZ(S) + i - 1, i);
l *= r;
l %= MOD;
l *= con;
l %= MOD;
ans += l;
ans %= MOD;
}
cout << ans << endl;
return 0;
} | // #include "bits/stdc++.h"
#define _USE_MATH_DEFINES
#include <algorithm>
#include <bitset>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#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;
#define rep(i, a, b) for (int i = (a), i##_len = (b); i < i##_len; i++)
#define rrep(i, a, b) for (int i = (b)-1; i >= (a); i--)
#define all(c) begin(c), end(c)
#define int ll
#define SZ(x) ((int)(x).size())
#define pb push_back
#define mp make_pair
// typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, int> pli;
typedef pair<double, double> pdd;
typedef vector<vector<int>> mat;
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 (b < a) {
a = b;
return true;
}
return false;
}
const int INF =
sizeof(int) == sizeof(long long) ? 0x3f3f3f3f3f3f3f3fLL : 0x3f3f3f3f;
const int MOD = (int)1e9 + 7;
const double EPS = 1e-9;
const int MAX = 2000010;
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 modpow(int x, int n, const int mo) {
int res = 1;
while (n > 0) {
if (n & 1)
(res *= x) %= mo;
(x *= x) %= mo;
n >>= 1;
}
return res;
}
int inverse(int x, const int mo) { return modpow(x, mo - 2, mo); }
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
COMinit();
int K;
cin >> K;
string S;
cin >> S;
int ans = 0;
rep(i, 0, K + 1) {
int l = modpow(25LL, i, MOD);
int r = modpow(26LL, K - i, MOD);
int con = COM(SZ(S) + i - 1, i);
l *= r;
l %= MOD;
l *= con;
l %= MOD;
ans += l;
ans %= MOD;
}
cout << ans << endl;
return 0;
} | replace | 67 | 68 | 67 | 68 | 0 | |
p02632 | C++ | Runtime Error | // 四則演算 #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")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template <class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define eFOR(i, a, n) for (int i = (a); i <= (n); ++i)
#define rFOR(i, a, n) for (int i = (n)-1; i >= (a); --i)
#define erFOR(i, a, n) for (int i = (n); i >= (a); --i)
#define each(i, a) for (auto &i : a)
#define SORT(a) sort(a.begin(), a.end())
#define rSORT(a) sort(a.rbegin(), a.rend())
#define fSORT(a, f) sort(a.begin(), a.end(), f)
#define all(a) a.begin(), a.end()
#define out(y, x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define tp(a, i) get<i>(a)
#define line cout << "-----------------------------\n"
#define ENDL(i, n) ((i) == (n)-1 ? "\n" : " ")
#define stop system("pause")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
template <class T> inline istream &operator>>(istream &is, vector<T> &v) {
for (auto &a : v)
is >> a;
return is;
}
template <class T> inline istream &operator>>(istream &is, deque<T> &v) {
for (auto &a : v)
is >> a;
return is;
}
template <class T, class U>
inline istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T> inline vector<T> vec(size_t a) { return vector<T>(a); }
template <class T> inline vector<T> defvec(T def, size_t a) {
return vector<T>(a, def);
}
template <class T, class... Ts> inline auto vec(size_t a, Ts... ts) {
return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...));
}
template <class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) {
return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...));
}
template <class T> inline void print(const T &a) { cout << a << "\n"; }
template <class T, class... Ts> inline void print(const T &a, const Ts &...ts) {
cout << a << " ";
print(ts...);
}
template <class T> inline void print(const vector<T> &v) {
for (int i = 0; i < v.size(); ++i)
cout << v[i] << (i == v.size() - 1 ? "\n" : " ");
}
template <class T> inline void print(const vector<vector<T>> &v) {
for (auto &a : v)
print(a);
}
inline string reversed(const string &s) {
string t = s;
reverse(all(t));
return t;
}
template <int modulo> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long y)
: x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= modulo)
x -= modulo;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += modulo - p.x) >= modulo)
x -= modulo;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % modulo);
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 = modulo, 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 pow(int e) {
long long a = 1, p = x;
while (e > 0) {
if (e % 2 == 0) {
p = (p * p) % modulo;
e /= 2;
} else {
a = (a * p) % modulo;
e--;
}
}
return ModInt(a);
}
friend ostream &operator<<(ostream &os, const ModInt<modulo> &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt<modulo> &a) {
long long x;
is >> x;
a = ModInt<modulo>(x);
return (is);
}
};
using modint = ModInt<mod>;
const int MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
bool Pre = true;
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, MAX) {
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 (Pre) {
cominit();
Pre = false;
}
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
init();
int k;
cin >> k;
string s;
cin >> s;
int n = s.length();
modint ans = 0;
FOR(i, n - 1, n + k) {
ans += modint(com(i, n - 1)) * modint(25).pow(i - n + 1) *
modint(26).pow(n + k - i - 1);
}
print(ans);
return 0;
} | // 四則演算 #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")
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template <class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define eFOR(i, a, n) for (int i = (a); i <= (n); ++i)
#define rFOR(i, a, n) for (int i = (n)-1; i >= (a); --i)
#define erFOR(i, a, n) for (int i = (n); i >= (a); --i)
#define each(i, a) for (auto &i : a)
#define SORT(a) sort(a.begin(), a.end())
#define rSORT(a) sort(a.rbegin(), a.rend())
#define fSORT(a, f) sort(a.begin(), a.end(), f)
#define all(a) a.begin(), a.end()
#define out(y, x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define tp(a, i) get<i>(a)
#define line cout << "-----------------------------\n"
#define ENDL(i, n) ((i) == (n)-1 ? "\n" : " ")
#define stop system("pause")
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10;
constexpr ld pi = 3.1415926535897932;
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
template <class T> inline istream &operator>>(istream &is, vector<T> &v) {
for (auto &a : v)
is >> a;
return is;
}
template <class T> inline istream &operator>>(istream &is, deque<T> &v) {
for (auto &a : v)
is >> a;
return is;
}
template <class T, class U>
inline istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T> inline vector<T> vec(size_t a) { return vector<T>(a); }
template <class T> inline vector<T> defvec(T def, size_t a) {
return vector<T>(a, def);
}
template <class T, class... Ts> inline auto vec(size_t a, Ts... ts) {
return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...));
}
template <class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) {
return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...));
}
template <class T> inline void print(const T &a) { cout << a << "\n"; }
template <class T, class... Ts> inline void print(const T &a, const Ts &...ts) {
cout << a << " ";
print(ts...);
}
template <class T> inline void print(const vector<T> &v) {
for (int i = 0; i < v.size(); ++i)
cout << v[i] << (i == v.size() - 1 ? "\n" : " ");
}
template <class T> inline void print(const vector<vector<T>> &v) {
for (auto &a : v)
print(a);
}
inline string reversed(const string &s) {
string t = s;
reverse(all(t));
return t;
}
template <int modulo> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(long long y)
: x(y >= 0 ? y % modulo : (modulo - (-y) % modulo) % modulo) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= modulo)
x -= modulo;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += modulo - p.x) >= modulo)
x -= modulo;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % modulo);
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 = modulo, 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 pow(int e) {
long long a = 1, p = x;
while (e > 0) {
if (e % 2 == 0) {
p = (p * p) % modulo;
e /= 2;
} else {
a = (a * p) % modulo;
e--;
}
}
return ModInt(a);
}
friend ostream &operator<<(ostream &os, const ModInt<modulo> &p) {
return os << p.x;
}
friend istream &operator>>(istream &is, ModInt<modulo> &a) {
long long x;
is >> x;
a = ModInt<modulo>(x);
return (is);
}
};
using modint = ModInt<mod>;
const int MAX = 2000001;
ll fac[MAX], finv[MAX], inv[MAX];
bool Pre = true;
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, MAX) {
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 (Pre) {
cominit();
Pre = false;
}
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
init();
int k;
cin >> k;
string s;
cin >> s;
int n = s.length();
modint ans = 0;
FOR(i, n - 1, n + k) {
ans += modint(com(i, n - 1)) * modint(25).pow(i - n + 1) *
modint(26).pow(n + k - i - 1);
}
print(ans);
return 0;
} | replace | 170 | 171 | 170 | 171 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
ll fac[N], inv[N];
char s[N];
int k;
ll qp(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void init() {
fac[0] = fac[1] = 1;
for (int i = 2; i < N; i++)
fac[i] = fac[i - 1] * i % mod;
inv[N - 1] = qp(fac[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--)
inv[i] = inv[i + 1] * (i + 1) % mod;
}
ll C(ll a, ll b) {
if (b > a)
return 0ll;
return fac[a] * inv[b] % mod * inv[a - b] % mod;
}
ll add(ll a, ll b) { return (a + b) % mod; }
int main() {
init();
scanf("%d", &k);
scanf("%s", s);
ll res = 0;
int len = strlen(s);
for (int i = len; i <= k + len;
i++) // 枚举前i个字符为S的所在地，即第i个位置是字符s[len-1]的所在地
res = add(res, C(i - 1, len - 1) * qp(25ll, i - len) % mod *
qp(26ll, k + len - i) % mod);
printf("%lld\n", res);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e6 + 10;
const int mod = 1e9 + 7;
ll fac[N], inv[N];
char s[N];
int k;
ll qp(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void init() {
fac[0] = fac[1] = 1;
for (int i = 2; i < N; i++)
fac[i] = fac[i - 1] * i % mod;
inv[N - 1] = qp(fac[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--)
inv[i] = inv[i + 1] * (i + 1) % mod;
}
ll C(ll a, ll b) {
if (b > a)
return 0ll;
return fac[a] * inv[b] % mod * inv[a - b] % mod;
}
ll add(ll a, ll b) { return (a + b) % mod; }
int main() {
init();
scanf("%d", &k);
scanf("%s", s);
ll res = 0;
int len = strlen(s);
for (int i = len; i <= k + len;
i++) // 枚举前i个字符为S的所在地，即第i个位置是字符s[len-1]的所在地
res = add(res, C(i - 1, len - 1) * qp(25ll, i - len) % mod *
qp(26ll, k + len - i) % mod);
printf("%lld\n", res);
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
ll mod_pow(ll a, ll n) {
a %= MOD;
ll ret = 1;
while (n > 0) {
if (n & 1LL)
ret = (ret * a) % MOD;
a = (a * a) % MOD;
n = n >> 1;
}
return ret;
}
// テーブルを作る前処理
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 >> s;
ll n = s.size();
ll sum = n + k;
ll ans = 0;
rep(b, 0, k + 1) {
ll f = sum - b;
ll tmp = (COM(f - 1, n - 1) * mod_pow(25, k - b)) % MOD;
tmp = (tmp * mod_pow(26, b)) % MOD;
ans = (ans + tmp) % MOD;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
const int MAX = 2000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
ll mod_pow(ll a, ll n) {
a %= MOD;
ll ret = 1;
while (n > 0) {
if (n & 1LL)
ret = (ret * a) % MOD;
a = (a * a) % MOD;
n = n >> 1;
}
return ret;
}
// テーブルを作る前処理
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 >> s;
ll n = s.size();
ll sum = n + k;
ll ans = 0;
rep(b, 0, k + 1) {
ll f = sum - b;
ll tmp = (COM(f - 1, n - 1) * mod_pow(25, k - b)) % MOD;
tmp = (tmp * mod_pow(26, b)) % MOD;
ans = (ans + tmp) % MOD;
}
cout << ans << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02632 | C++ | Runtime Error | /*================================================================
*
* 创 建 者： badcw
* 创建日期： 2020/6/21 20:51
*
================================================================*/
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 1e6 + 50;
const int mod = 1e9 + 7;
ll qp(ll a, ll n, ll mod = ::mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll jie[maxn] = {1};
char s[maxn];
ll inv(ll x) { return qp(x, mod - 2); }
ll C(int x, int y) {
if (x < y)
return 0;
if (x == 0)
return 0;
return jie[x] * inv(jie[y]) % mod * inv(jie[x - y]) % mod;
}
int main(int argc, char *argv[]) {
int k;
cin >> k >> s;
int len = strlen(s);
k += len;
for (int i = 1; i <= k; ++i)
jie[i] = jie[i - 1] * i % mod;
ll res = qp(26, k);
ll TC = 0;
ll TQ = qp(25, k);
ll tt = inv(25);
for (int i = 0; i < len; ++i) {
if (i == 0) {
TC = 1;
} else
TC = TC * (k - i + 1) % mod * inv(i) % mod;
res -= TC * TQ;
res %= mod;
TQ = TQ * tt % mod;
// res -= C(k, i) * qp(25, k - i) % mod;
// res %= mod;
}
if (res < 0)
res += mod;
cout << res << endl;
// printf("%lld\n", res);
return 0;
} | /*================================================================
*
* 创 建 者： badcw
* 创建日期： 2020/6/21 20:51
*
================================================================*/
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn = 2e6 + 50;
const int mod = 1e9 + 7;
ll qp(ll a, ll n, ll mod = ::mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll jie[maxn] = {1};
char s[maxn];
ll inv(ll x) { return qp(x, mod - 2); }
ll C(int x, int y) {
if (x < y)
return 0;
if (x == 0)
return 0;
return jie[x] * inv(jie[y]) % mod * inv(jie[x - y]) % mod;
}
int main(int argc, char *argv[]) {
int k;
cin >> k >> s;
int len = strlen(s);
k += len;
for (int i = 1; i <= k; ++i)
jie[i] = jie[i - 1] * i % mod;
ll res = qp(26, k);
ll TC = 0;
ll TQ = qp(25, k);
ll tt = inv(25);
for (int i = 0; i < len; ++i) {
if (i == 0) {
TC = 1;
} else
TC = TC * (k - i + 1) % mod * inv(i) % mod;
res -= TC * TQ;
res %= mod;
TQ = TQ * tt % mod;
// res -= C(k, i) * qp(25, k - i) % mod;
// res %= mod;
}
if (res < 0)
res += mod;
cout << res << endl;
// printf("%lld\n", res);
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
//.define
// #define FILE_IN_OUT
#define RET(_x) return cout << (_x) << '\n', 0;
#define all(_obj) (_obj).begin(), (_obj).end()
#define loop(_n) for (int i = 0; i < (_n); ++i)
#define CeilDiv(_dividend, _divider) \
(((_dividend)-1LL + (_divider)) / (_divider))
#define sz(_obj) static_cast<int>((_obj).size())
#ifdef SHJ_LOCAL
#define debug(_x) std::cerr << (#_x) << " = " << (_x) << '\n' << std::flush;
#else
#define debug(_x) \
{}
#endif
#define endl "\n"
template <typename Tp>
inline void outarr(Tp _begin, Tp _end, const char *_delim = " ") {
for (Tp current = _begin; current != _end; ++current) {
std::cout << *current << _delim;
}
std::cout << '\n';
}
//.constant
using ll = long long;
using pii = std::pair<int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr int MOD = static_cast<const int>(1e9 + 7);
//.data
constexpr int MAXN = 1000005;
int fact[MAXN];
int ifact[MAXN];
int Add(int x, int y) {
x += y;
return x < MOD ? x : x - MOD;
}
int Sub(int x, int y) {
x -= y;
return x >= 0 ? x : x + MOD;
}
int Mul(int x, int y) { return int(1LL * x * y % MOD); }
int FastPow(int x, int p) {
int res = 1;
while (p > 0) {
if (p & 1) {
res = Mul(res, x);
}
p >>= 1;
x = Mul(x, x);
}
return res;
}
int Inv(int x) { return FastPow(x, MOD - 2); }
int C(int k, int n) { return Mul(fact[n], Mul(ifact[k], ifact[n - k])); }
//.code
int main() {
#ifdef FILE_IN_OUT
std::ifstream cin("input.txt", std::ios::in);
std::ofstream cout("output.txt", std::ios::out);
#else
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
#endif
fact[0] = fact[1] = 1;
for (int i = 2; i < MAXN; ++i) {
fact[i] = Mul(i, fact[i - 1]);
}
ifact[MAXN - 1] = Inv(fact[MAXN - 1]);
for (int i = MAXN - 2; i >= 0; --i) {
ifact[i] = Mul(ifact[i + 1], i + 1);
}
int k;
string s;
cin >> k >> s;
int n = k + sz(s);
int ans = 0;
for (int i = sz(s); i <= n; ++i) {
ans = Add(ans, Mul(Mul(C(sz(s) - 1, i - 1), FastPow(25, i - sz(s))),
FastPow(26, n - i)));
}
cout << ans << endl;
#ifdef FILE_IN_OUT
cin.close();
cout.close();
#endif
return 0;
} | #include <bits/stdc++.h>
using namespace std;
//.define
// #define FILE_IN_OUT
#define RET(_x) return cout << (_x) << '\n', 0;
#define all(_obj) (_obj).begin(), (_obj).end()
#define loop(_n) for (int i = 0; i < (_n); ++i)
#define CeilDiv(_dividend, _divider) \
(((_dividend)-1LL + (_divider)) / (_divider))
#define sz(_obj) static_cast<int>((_obj).size())
#ifdef SHJ_LOCAL
#define debug(_x) std::cerr << (#_x) << " = " << (_x) << '\n' << std::flush;
#else
#define debug(_x) \
{}
#endif
#define endl "\n"
template <typename Tp>
inline void outarr(Tp _begin, Tp _end, const char *_delim = " ") {
for (Tp current = _begin; current != _end; ++current) {
std::cout << *current << _delim;
}
std::cout << '\n';
}
//.constant
using ll = long long;
using pii = std::pair<int, int>;
constexpr int INF = 0x3f3f3f3f;
constexpr int MOD = static_cast<const int>(1e9 + 7);
//.data
constexpr int MAXN = 2000005;
int fact[MAXN];
int ifact[MAXN];
int Add(int x, int y) {
x += y;
return x < MOD ? x : x - MOD;
}
int Sub(int x, int y) {
x -= y;
return x >= 0 ? x : x + MOD;
}
int Mul(int x, int y) { return int(1LL * x * y % MOD); }
int FastPow(int x, int p) {
int res = 1;
while (p > 0) {
if (p & 1) {
res = Mul(res, x);
}
p >>= 1;
x = Mul(x, x);
}
return res;
}
int Inv(int x) { return FastPow(x, MOD - 2); }
int C(int k, int n) { return Mul(fact[n], Mul(ifact[k], ifact[n - k])); }
//.code
int main() {
#ifdef FILE_IN_OUT
std::ifstream cin("input.txt", std::ios::in);
std::ofstream cout("output.txt", std::ios::out);
#else
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
#endif
fact[0] = fact[1] = 1;
for (int i = 2; i < MAXN; ++i) {
fact[i] = Mul(i, fact[i - 1]);
}
ifact[MAXN - 1] = Inv(fact[MAXN - 1]);
for (int i = MAXN - 2; i >= 0; --i) {
ifact[i] = Mul(ifact[i + 1], i + 1);
}
int k;
string s;
cin >> k >> s;
int n = k + sz(s);
int ans = 0;
for (int i = sz(s); i <= n; ++i) {
ans = Add(ans, Mul(Mul(C(sz(s) - 1, i - 1), FastPow(25, i - sz(s))),
FastPow(26, n - i)));
}
cout << ans << endl;
#ifdef FILE_IN_OUT
cin.close();
cout.close();
#endif
return 0;
} | replace | 33 | 34 | 33 | 34 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1000000010
#define EPS 1e-9
#define F first
#define S second
#define debug(x) cout << x << endl;
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define lp(i, n) repi(i, 0, n)
#define repn(i, n) for (int i = n; i >= 0; i--)
#define int long long
#define endl "\n"
typedef pair<int, int> PII;
typedef pair<int, string> PIS;
typedef pair<string, int> PSI;
const int MAX = 500000;
int fac[MAX], finv[MAX], inv[MAX];
void t() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
repi(i, 2, MAX) {
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 calc(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 modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int k;
string s;
cin >> k >> s;
int num = s.size();
int ans = 0;
int now = 1;
rep(i, k) {
now *= 25;
now %= MOD;
}
t();
rep(i, k + 1) {
if (i != 0) {
now = now * modinv(25, MOD) % MOD;
now *= 26;
now %= MOD;
}
// cout<<now<<" "<<ans<<endl;
int kosuu = num - 1 + (k - i);
int pl = now * calc(kosuu, k - i) % MOD;
ans += pl;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF 1000000010
#define EPS 1e-9
#define F first
#define S second
#define debug(x) cout << x << endl;
#define repi(i, x, n) for (int i = x; i < n; i++)
#define rep(i, n) repi(i, 0, n)
#define lp(i, n) repi(i, 0, n)
#define repn(i, n) for (int i = n; i >= 0; i--)
#define int long long
#define endl "\n"
typedef pair<int, int> PII;
typedef pair<int, string> PIS;
typedef pair<string, int> PSI;
const int MAX = 5000000;
int fac[MAX], finv[MAX], inv[MAX];
void t() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
repi(i, 2, MAX) {
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 calc(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 modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int k;
string s;
cin >> k >> s;
int num = s.size();
int ans = 0;
int now = 1;
rep(i, k) {
now *= 25;
now %= MOD;
}
t();
rep(i, k + 1) {
if (i != 0) {
now = now * modinv(25, MOD) % MOD;
now *= 26;
now %= MOD;
}
// cout<<now<<" "<<ans<<endl;
int kosuu = num - 1 + (k - i);
int pl = now * calc(kosuu, k - i) % MOD;
ans += pl;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p02632 | C++ | Runtime Error | #include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const ll MOD = 1e9 + 7;
const int M = 1e6 + 5;
ll fac[M], ifac[M];
ll inv(ll x) {
ll ans = 1;
ll p = MOD - 2;
while (p > 0) {
if (p & 1)
ans = (ans * x) % MOD;
p >>= 1;
x = (x * x) % MOD;
}
return ans;
}
ll ifa(int i) {
if (!ifac[i])
ifac[i] = inv(fac[i]);
return ifac[i];
}
ll C(int n, int k) { return (((fac[n] * ifa(k)) % MOD) * ifa(n - k)) % MOD; }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
fac[0] = 1;
for (int i = 1; i < M; ++i)
fac[i] = (fac[i - 1] * i) % MOD;
int K;
cin >> K;
string S;
cin >> S;
int n = S.size();
ll ans = 0;
ll p25 = 1, p26 = 1, i26 = inv(26);
for (int k = 0; k < K; ++k)
p26 = (p26 * 26) % MOD;
for (int k = 0; k <= K; ++k) {
ll a = (p25 * C(k + n - 1, n - 1)) % MOD;
a = (a * p26) % MOD;
ans = (ans + a) % MOD;
p25 = (p25 * 25) % MOD;
p26 = (p26 * i26) % MOD;
}
cout << ans << "\n";
return 0;
} | #include <iostream>
#include <map>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const ll MOD = 1e9 + 7;
const int M = 2e6 + 5;
ll fac[M], ifac[M];
ll inv(ll x) {
ll ans = 1;
ll p = MOD - 2;
while (p > 0) {
if (p & 1)
ans = (ans * x) % MOD;
p >>= 1;
x = (x * x) % MOD;
}
return ans;
}
ll ifa(int i) {
if (!ifac[i])
ifac[i] = inv(fac[i]);
return ifac[i];
}
ll C(int n, int k) { return (((fac[n] * ifa(k)) % MOD) * ifa(n - k)) % MOD; }
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
fac[0] = 1;
for (int i = 1; i < M; ++i)
fac[i] = (fac[i - 1] * i) % MOD;
int K;
cin >> K;
string S;
cin >> S;
int n = S.size();
ll ans = 0;
ll p25 = 1, p26 = 1, i26 = inv(26);
for (int k = 0; k < K; ++k)
p26 = (p26 * 26) % MOD;
for (int k = 0; k <= K; ++k) {
ll a = (p25 * C(k + n - 1, n - 1)) % MOD;
a = (a * p26) % MOD;
ans = (ans + a) % MOD;
p25 = (p25 * 25) % MOD;
p26 = (p26 * i26) % MOD;
}
cout << ans << "\n";
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02632 | C++ | Runtime Error | // Optimise
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "/home/shahraaz/bin/debug.h"
#else
#define db(...)
#endif
using ll = long long;
#define f first
#define s second
#define pb push_back
#define all(v) v.begin(), v.end()
const int NAX = 2e5 + 5, MOD = 1000000007;
const int _n = 2e5 + 10;
vector<int> Fact(_n), Inv(_n);
const int kmod = 1000000007;
int mul(int a, int b, int mod = kmod) { return (long long)a * b % mod; }
int add(int a, int b, int mod = kmod) {
a += b;
if (a >= mod)
a -= mod;
return a;
}
int sub(int a, int b, int mod = kmod) {
a -= b;
if (a < 0)
a += mod;
return a;
}
int power(int base, int index, int mod = kmod) {
if (index == 0)
return 1;
int temp = power(base, index / 2, mod);
temp = mul(temp, temp, mod);
if (index & 1)
temp = mul(temp, base, mod);
return temp;
}
int mod_inv(int x, int mod = kmod) { return power(x, kmod - 2); }
void pre() {
Fact[0] = 1;
for (int i = 1; i < _n; ++i)
Fact[i] = mul(Fact[i - 1], i);
Inv[_n - 1] = mod_inv(Fact[_n - 1]);
for (int i = _n - 2; i >= 0; --i)
Inv[i] = mul(Inv[i + 1], (1 + i));
}
int ncr(int n, int r) {
if (n < 0 || r < 0 || n - r < 0)
return 0;
return mul(Fact[n], mul(Inv[r], Inv[n - r]));
}
class Solution {
private:
public:
Solution() {}
~Solution() {}
void solveCase() {
int k;
cin >> k;
pre();
int res = 0;
string s;
cin >> s;
int n = s.length();
for (int len = n; len <= n + k; len++)
res = add(res, mul(ncr(len - 1, n - 1),
mul(power(26, n + k - len), power(25, len - n))));
cout << res << '\n';
}
};
int32_t main() {
#ifndef LOCAL
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif
int t = 1;
// cin >> t;
Solution mySolver;
for (int i = 1; i <= t; ++i) {
mySolver.solveCase();
#ifdef LOCAL
cerr << "Case #" << i << ": Time "
<< chrono::duration<double>(chrono::steady_clock::now() - TimeStart)
.count()
<< " s.\n";
TimeStart = chrono::steady_clock::now();
#endif
}
return 0;
}
| // Optimise
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "/home/shahraaz/bin/debug.h"
#else
#define db(...)
#endif
using ll = long long;
#define f first
#define s second
#define pb push_back
#define all(v) v.begin(), v.end()
const int NAX = 2e5 + 5, MOD = 1000000007;
const int _n = 2e6 + 10;
vector<int> Fact(_n), Inv(_n);
const int kmod = 1000000007;
int mul(int a, int b, int mod = kmod) { return (long long)a * b % mod; }
int add(int a, int b, int mod = kmod) {
a += b;
if (a >= mod)
a -= mod;
return a;
}
int sub(int a, int b, int mod = kmod) {
a -= b;
if (a < 0)
a += mod;
return a;
}
int power(int base, int index, int mod = kmod) {
if (index == 0)
return 1;
int temp = power(base, index / 2, mod);
temp = mul(temp, temp, mod);
if (index & 1)
temp = mul(temp, base, mod);
return temp;
}
int mod_inv(int x, int mod = kmod) { return power(x, kmod - 2); }
void pre() {
Fact[0] = 1;
for (int i = 1; i < _n; ++i)
Fact[i] = mul(Fact[i - 1], i);
Inv[_n - 1] = mod_inv(Fact[_n - 1]);
for (int i = _n - 2; i >= 0; --i)
Inv[i] = mul(Inv[i + 1], (1 + i));
}
int ncr(int n, int r) {
if (n < 0 || r < 0 || n - r < 0)
return 0;
return mul(Fact[n], mul(Inv[r], Inv[n - r]));
}
class Solution {
private:
public:
Solution() {}
~Solution() {}
void solveCase() {
int k;
cin >> k;
pre();
int res = 0;
string s;
cin >> s;
int n = s.length();
for (int len = n; len <= n + k; len++)
res = add(res, mul(ncr(len - 1, n - 1),
mul(power(26, n + k - len), power(25, len - n))));
cout << res << '\n';
}
};
int32_t main() {
#ifndef LOCAL
ios_base::sync_with_stdio(0);
cin.tie(0);
#endif
int t = 1;
// cin >> t;
Solution mySolver;
for (int i = 1; i <= t; ++i) {
mySolver.solveCase();
#ifdef LOCAL
cerr << "Case #" << i << ": Time "
<< chrono::duration<double>(chrono::steady_clock::now() - TimeStart)
.count()
<< " s.\n";
TimeStart = chrono::steady_clock::now();
#endif
}
return 0;
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1e9 + 7;
const ll MX = 1e6 + 6;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll extend_gcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1, y = 0;
return a;
} else {
ll r = extend_gcd(b, a % b, y, x);
y -= x * (a / b);
return r;
}
}
ll inv(ll a, ll mod) {
ll x, y;
extend_gcd(a, mod, x, y);
x = (x % mod + mod) % mod;
return x;
}
ll K, NS, N;
string S;
ll fs[MX], ifs[MX];
ll mpow(ll a, ll n) {
if (n == 0)
return 1;
ll r = mpow(a, n / 2);
r *= r;
r %= MOD;
if (n % 2 == 1)
r *= a;
return r % MOD;
}
ll Cnm(ll n, ll m) {
return (((((fs[n] * ifs[m]) % MOD + MOD) % MOD) * ifs[n - m]) % MOD + MOD) %
MOD;
}
void init() {
for (ll a = 0; a < MX; a++) {
if (a == 0)
fs[a] = 1;
else
fs[a] = (fs[a - 1] * a) % MOD;
ifs[a] = (inv(fs[a], MOD) % MOD + MOD) % MOD;
}
}
int main() {
init();
cin >> K >> S;
NS = S.size();
N = NS + K;
ll res = 0;
for (ll j = 0; j <= K; j++) {
res += (Cnm(N, j + NS) * mpow(25, N - NS - j)) % MOD;
res %= MOD;
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const ll MOD = 1e9 + 7;
const ll MX = 2e6 + 6;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll extend_gcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1, y = 0;
return a;
} else {
ll r = extend_gcd(b, a % b, y, x);
y -= x * (a / b);
return r;
}
}
ll inv(ll a, ll mod) {
ll x, y;
extend_gcd(a, mod, x, y);
x = (x % mod + mod) % mod;
return x;
}
ll K, NS, N;
string S;
ll fs[MX], ifs[MX];
ll mpow(ll a, ll n) {
if (n == 0)
return 1;
ll r = mpow(a, n / 2);
r *= r;
r %= MOD;
if (n % 2 == 1)
r *= a;
return r % MOD;
}
ll Cnm(ll n, ll m) {
return (((((fs[n] * ifs[m]) % MOD + MOD) % MOD) * ifs[n - m]) % MOD + MOD) %
MOD;
}
void init() {
for (ll a = 0; a < MX; a++) {
if (a == 0)
fs[a] = 1;
else
fs[a] = (fs[a - 1] * a) % MOD;
ifs[a] = (inv(fs[a], MOD) % MOD + MOD) % MOD;
}
}
int main() {
init();
cin >> K >> S;
NS = S.size();
N = NS + K;
ll res = 0;
for (ll j = 0; j <= K; j++) {
res += (Cnm(N, j + NS) * mpow(25, N - NS - j)) % MOD;
res %= MOD;
}
cout << res << endl;
return 0;
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
const int INT_INF = 1 << 30;
const double PI = acos(-1.0);
#define MOD 1000000007LL
#define endl "\n"
ll modbeki(ll x, ll n) {
ll res = 1LL;
while (n > 0) {
if (n & 1) {
res *= x % MOD;
res %= MOD;
}
x = x * x % MOD;
n >>= 1;
}
return res % MOD;
}
struct COM {
ll modpow(ll x, ll nn) {
ll res = 1;
while (nn > 0) {
if (nn & 1)
res = res * x % MOD;
x = x * x % MOD;
nn >>= 1;
}
return res;
}
vll fact, ifact;
COM(ll n) : fact(n + 1), ifact(n + 1) {
assert(n < MOD);
fact[0] = 1LL;
for (ll i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i % MOD;
ifact[n] = modpow(fact[n], MOD - 2);
for (ll i = n; i >= 1; i--)
ifact[i - 1] = ifact[i] * i % MOD;
}
ll operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] % MOD * ifact[n - k] % MOD;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
srand((unsigned)time(NULL));
COM c(1000010);
ll K;
cin >> K;
string S;
cin >> S;
ll N = S.size();
ll ans = 0LL;
for (int i = N; i <= N + K; i++) {
ans += c(i - 1, N - 1) * modbeki(25, i - N) % MOD * modbeki(26, N + K - i) %
MOD;
ans %= MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ALL(a) (a).begin(), (a).end()
#define sz(x) int(x.size())
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<long long, long long> Pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<long long> vll;
typedef vector<vector<long long>> vvll;
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const long long INF = 1LL << 60;
const int INT_INF = 1 << 30;
const double PI = acos(-1.0);
#define MOD 1000000007LL
#define endl "\n"
ll modbeki(ll x, ll n) {
ll res = 1LL;
while (n > 0) {
if (n & 1) {
res *= x % MOD;
res %= MOD;
}
x = x * x % MOD;
n >>= 1;
}
return res % MOD;
}
struct COM {
ll modpow(ll x, ll nn) {
ll res = 1;
while (nn > 0) {
if (nn & 1)
res = res * x % MOD;
x = x * x % MOD;
nn >>= 1;
}
return res;
}
vll fact, ifact;
COM(ll n) : fact(n + 1), ifact(n + 1) {
assert(n < MOD);
fact[0] = 1LL;
for (ll i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i % MOD;
ifact[n] = modpow(fact[n], MOD - 2);
for (ll i = n; i >= 1; i--)
ifact[i - 1] = ifact[i] * i % MOD;
}
ll operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] % MOD * ifact[n - k] % MOD;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
srand((unsigned)time(NULL));
COM c(2000010);
ll K;
cin >> K;
string S;
cin >> S;
ll N = S.size();
ll ans = 0LL;
for (int i = N; i <= N + K; i++) {
ans += c(i - 1, N - 1) * modbeki(25, i - N) % MOD * modbeki(26, N + K - i) %
MOD;
ans %= MOD;
}
cout << ans << endl;
} | replace | 76 | 77 | 76 | 77 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
const int MAX = 1000001;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
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;
}
int K;
string s;
int main() {
COMinit();
cin >> K >> s;
int S = static_cast<int>(s.size());
int res = 0;
for (int i = 0; i <= K; i++) {
int tmp = (modpow(25, K - i, MOD) * modpow(26, i, MOD)) % MOD;
tmp = (tmp * COM(S + K - i - 1, S - 1)) % MOD;
res = (res + tmp) % MOD;
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <queue>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
const int MAX = 3000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
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;
}
int K;
string s;
int main() {
COMinit();
cin >> K >> s;
int S = static_cast<int>(s.size());
int res = 0;
for (int i = 0; i <= K; i++) {
int tmp = (modpow(25, K - i, MOD) * modpow(26, i, MOD)) % MOD;
tmp = (tmp * COM(S + K - i - 1, S - 1)) % MOD;
res = (res + tmp) % MOD;
}
cout << res << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02632 | C++ | Runtime Error | /**
* author: boutarou
* created: 21.06.2020 21:30:14
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define fcout cout << fixed << setprecision(15)
using lint = long long;
using P = pair<int, int>;
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;
}
const double PI = 3.1415926535897932;
const lint MOD = 1e9 + 7;
long long mod_pow(long long n, long long p, long long m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
long long t = mod_pow(n, p / 2, m);
return (t * t) % m;
}
return n * mod_pow(n, p - 1, m) % m;
}
long long modinv(long long a, long long mod) {
return mod_pow(a, mod - 2, mod);
}
const int MAX = 1000005;
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;
}
lint k;
lint n;
string s;
lint ans;
lint rest;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> k >> s;
n = k + s.size();
ans = mod_pow(26, n, MOD);
COMinit();
rep(i, s.size()) {
rest += mod_pow(25, n - i, MOD) * COM(n, i) % MOD;
rest %= MOD;
}
lint out = ans - rest;
out %= MOD;
if (out < 0)
out += MOD;
cout << out << endl;
return 0;
} | /**
* author: boutarou
* created: 21.06.2020 21:30:14
**/
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < int(n); i++)
#define fcout cout << fixed << setprecision(15)
using lint = long long;
using P = pair<int, int>;
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;
}
const double PI = 3.1415926535897932;
const lint MOD = 1e9 + 7;
long long mod_pow(long long n, long long p, long long m) {
if (p == 0)
return 1;
if (p % 2 == 0) {
long long t = mod_pow(n, p / 2, m);
return (t * t) % m;
}
return n * mod_pow(n, p - 1, m) % m;
}
long long modinv(long long a, long long mod) {
return mod_pow(a, mod - 2, mod);
}
const lint MAX = 2000005;
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;
}
lint k;
lint n;
string s;
lint ans;
lint rest;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> k >> s;
n = k + s.size();
ans = mod_pow(26, n, MOD);
COMinit();
rep(i, s.size()) {
rest += mod_pow(25, n - i, MOD) * COM(n, i) % MOD;
rest %= MOD;
}
lint out = ans - rest;
out %= MOD;
if (out < 0)
out += MOD;
cout << out << endl;
return 0;
} | replace | 43 | 44 | 43 | 44 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using Int = long long;
const Int MOD = 1000000007;
const Int MAX = 1000100;
Int fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
Int COM(int n, int k) {
if (n < k || n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
Int POW(Int n, Int m) {
if (m == 0)
return 1;
if (m % 2 == 0)
return POW(n * n % MOD, m / 2);
return n * POW(n, m - 1) % MOD;
}
int main() {
COMinit();
int K;
cin >> K;
string S;
cin >> S;
int N = S.size();
vector<Int> A(K + 1), B(K + 1);
for (int i = 0; i <= K; i++) {
A[i] = COM(N - 1 + i, i) * POW(25, i) % MOD;
}
for (int i = 0; i <= K; i++) {
B[i] = A[i] + (i > 0 ? B[i - 1] * 26 : 0);
B[i] %= MOD;
}
cout << B[K] << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using Int = long long;
const Int MOD = 1000000007;
const Int MAX = 2000100;
Int fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = finv[0] = finv[1] = inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
Int COM(int n, int k) {
if (n < k || n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
Int POW(Int n, Int m) {
if (m == 0)
return 1;
if (m % 2 == 0)
return POW(n * n % MOD, m / 2);
return n * POW(n, m - 1) % MOD;
}
int main() {
COMinit();
int K;
cin >> K;
string S;
cin >> S;
int N = S.size();
vector<Int> A(K + 1), B(K + 1);
for (int i = 0; i <= K; i++) {
A[i] = COM(N - 1 + i, i) * POW(25, i) % MOD;
}
for (int i = 0; i <= K; i++) {
B[i] = A[i] + (i > 0 ? B[i - 1] * 26 : 0);
B[i] %= MOD;
}
cout << B[K] << endl;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// a^n mod を計算する
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;
}
const int MAX = 1000001;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
long long ans = 0;
int K;
// int MOD = 1000000007;
string S;
cin >> K >> S;
int l = S.size();
COMinit();
for (int i = 0; i <= K; i++) {
ans = (ans + ((COM(i + l - 1, i) * modpow(25, i, MOD)) % MOD) *
modpow(26, K - i, MOD)) %
MOD;
// cout << ans << endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
// a^n mod を計算する
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;
}
const int MAX = 2000001;
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() {
long long ans = 0;
int K;
// int MOD = 1000000007;
string S;
cin >> K >> S;
int l = S.size();
COMinit();
for (int i = 0; i <= K; i++) {
ans = (ans + ((COM(i + l - 1, i) * modpow(25, i, MOD)) % MOD) *
modpow(26, K - i, MOD)) %
MOD;
// cout << ans << endl;
}
cout << ans << endl;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int, int>, int>;
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
// 最小公倍数
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
const int MAX = 1000010;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// コンビネーションを計算する関数
ll modpow(ll a, ll n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
cout << fixed << setprecision(15);
ll K;
string S;
cin >> K;
cin >> S;
ll N = S.length();
// 前処理
COMinit();
ll ans = 0;
for (ll i = 0; i <= K; i++) {
ans +=
(((modpow(26, K - i) * modpow(25, i)) % MOD) * COM(N - 1 + i, i)) % MOD;
ans = ans % MOD;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
// 型定義
typedef long long ll;
typedef pair<ll, ll> P;
// forループ
#define REP(i, n) for (ll i = 0; i < (ll)(n); ++i)
// 定数宣言
const int INF = 1e9;
const int MOD = 1e9 + 7;
const ll LINF = 1e18;
// グラフ表現
using Graph = vector<vector<int>>;
// グラフの辺表現
using Edge = map<pair<int, int>, int>;
// n次元配列の初期化。第２引数の型のサイズごとに初期化していく。
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
// 最大公約数
ll gcd(ll a, ll b) {
if (a % b == 0)
return (b);
else
return (gcd(b, a % b));
}
// 最小公倍数
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
const int MAX = 10000000;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// コンビネーションを計算する関数
ll modpow(ll a, ll n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
cout << fixed << setprecision(15);
ll K;
string S;
cin >> K;
cin >> S;
ll N = S.length();
// 前処理
COMinit();
ll ans = 0;
for (ll i = 0; i <= K; i++) {
ans +=
(((modpow(26, K - i) * modpow(25, i)) % MOD) * COM(N - 1 + i, i)) % MOD;
ans = ans % MOD;
}
cout << ans << endl;
return 0;
} | replace | 38 | 39 | 38 | 39 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
#define ll long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define mod (ll)(1e9 + 7)
#define inf (ll)(3e18 + 7)
#define pi (double)acos(-1.0)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
const int MAX = 1100000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll modpow(ll a, ll n, ll modo) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % modo;
a = a * a % modo;
n >>= 1;
}
return res;
}
int main() {
ll k, ans = 0;
string s;
cin >> k >> s;
COMinit();
rep(i, k + 1) {
ans += ((COM(s.size() + k - i - 1, s.size() - 1) * modpow(25, k - i, mod) %
mod) *
modpow(26, i, mod)) %
mod;
ans %= mod;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
#define ll long long
#define double long double
#define rep(i, n) for (int i = 0; i < (n); i++)
#define REP(i, n) for (int i = 1; i <= (n); i++)
#define mod (ll)(1e9 + 7)
#define inf (ll)(3e18 + 7)
#define pi (double)acos(-1.0)
#define P pair<int, int>
#define PiP pair<int, pair<int, int>>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
const int MAX = 5000000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll modpow(ll a, ll n, ll modo) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % modo;
a = a * a % modo;
n >>= 1;
}
return res;
}
int main() {
ll k, ans = 0;
string s;
cin >> k >> s;
COMinit();
rep(i, k + 1) {
ans += ((COM(s.size() + k - i - 1, s.size() - 1) * modpow(25, k - i, mod) %
mod) *
modpow(26, i, mod)) %
mod;
ans %= mod;
}
cout << ans << endl;
} | replace | 30 | 31 | 30 | 31 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define PP pair<P, P>
using namespace std;
// const int mod = 998244353;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
// 出力は.xで！！！！
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
int main() {
int k;
string s;
cin >> k >> s;
int sl = s.length();
combination c(1000010);
mint ans = 0;
mint fund = 1;
rep(i, k) { fund *= 26; }
mint fund2 = 1;
rep(i, k + 1) {
mint tmp = 0;
tmp += fund2 * c(sl + i - 1, i);
tmp *= fund;
fund /= 26;
fund2 *= 25;
ans += tmp;
}
cout << ans.x << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define PI 3.14159265359
#define INF 1000100100
#define MOD 1000000007
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define PP pair<P, P>
using namespace std;
// const int mod = 998244353;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
// 出力は.xで！！！！
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
int main() {
int k;
string s;
cin >> k >> s;
int sl = s.length();
combination c(2000010);
mint ans = 0;
mint fund = 1;
rep(i, k) { fund *= 26; }
mint fund2 = 1;
rep(i, k + 1) {
mint tmp = 0;
tmp += fund2 * c(sl + i - 1, i);
tmp *= fund;
fund /= 26;
fund2 *= 25;
ans += tmp;
}
cout << ans.x << endl;
return 0;
}
| replace | 86 | 87 | 86 | 87 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 10;
const int mod = 1e9 + 7;
int n, m;
int fac[maxn], ifac[maxn];
char s[maxn];
int mul(int x, int y) { return 1ll * x * y % mod; }
int fpw(int x, int y) {
int r = 1;
for (int i = y; i; i >>= 1, x = mul(x, x))
if (i & 1)
r = mul(r, x);
return r;
}
int inv(int x) { return fpw(x, mod - 2); }
int mul(int x, int y, int z) { return mul(x, mul(y, z)); }
int C(int n, int m) { return mul(fac[n], ifac[m], ifac[n - m]); }
int read() {
int x;
scanf("%d", &x);
return x;
}
int main() {
#ifdef LOCAL
freopen("1.in", "r", stdin);
#endif
n = read();
scanf("%s", s);
m = strlen(s);
fac[0] = ifac[0] = 1;
for (int i = 1; i <= n + m; ++i)
fac[i] = mul(fac[i - 1], i), ifac[i] = mul(ifac[i - 1], inv(i));
// new length = m + n
int ans = 0;
for (int i = 0; i <= n; ++i) {
ans += mul(mul(C(m + i - 1, i), fpw(25, i)), fpw(26, n - i));
ans %= mod;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 10;
const int mod = 1e9 + 7;
int n, m;
int fac[maxn], ifac[maxn];
char s[maxn];
int mul(int x, int y) { return 1ll * x * y % mod; }
int fpw(int x, int y) {
int r = 1;
for (int i = y; i; i >>= 1, x = mul(x, x))
if (i & 1)
r = mul(r, x);
return r;
}
int inv(int x) { return fpw(x, mod - 2); }
int mul(int x, int y, int z) { return mul(x, mul(y, z)); }
int C(int n, int m) { return mul(fac[n], ifac[m], ifac[n - m]); }
int read() {
int x;
scanf("%d", &x);
return x;
}
int main() {
#ifdef LOCAL
freopen("1.in", "r", stdin);
#endif
n = read();
scanf("%s", s);
m = strlen(s);
fac[0] = ifac[0] = 1;
for (int i = 1; i <= n + m; ++i)
fac[i] = mul(fac[i - 1], i), ifac[i] = mul(ifac[i - 1], inv(i));
// new length = m + n
int ans = 0;
for (int i = 0; i <= n; ++i) {
ans += mul(mul(C(m + i - 1, i), fpw(25, i)), fpw(26, n - i));
ans %= mod;
}
cout << ans << endl;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
class mint {
public:
long long x;
constexpr mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}
constexpr mint operator-() const { return mint(-x); }
constexpr mint &operator+=(const mint &rhs) {
if ((x += rhs.x) >= MOD)
x -= MOD;
return *this;
}
constexpr mint &operator-=(const mint &rhs) {
if ((x += MOD - rhs.x) >= MOD)
x -= MOD;
return *this;
}
constexpr mint &operator*=(const mint &rhs) {
(x *= rhs.x) %= MOD;
return *this;
}
constexpr mint operator+(const mint &rhs) const {
mint res(*this);
return res += rhs;
}
constexpr mint operator-(const mint &rhs) const {
mint res(*this);
return res -= rhs;
}
constexpr mint operator*(const mint &rhs) const {
mint res(*this);
return res *= rhs;
}
[[nodiscard]] constexpr mint pow(long long t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
[[nodiscard]] constexpr mint inv() const { return pow(MOD - 2); }
mint &operator/=(mint rhs) { return *this *= rhs.inv(); }
mint operator/(const mint rhs) const { return mint(*this) /= rhs; }
constexpr bool operator==(const mint &rhs) const noexcept {
return this->x == rhs.x;
}
constexpr bool operator!=(const mint &rhs) const noexcept {
return this->x != rhs.x;
}
bool operator<(const mint &rhs) const noexcept { return this->x < rhs.x; }
bool operator>(const mint &rhs) const noexcept { return this->x > rhs.x; }
bool operator<=(const mint &rhs) const noexcept { return this->x <= rhs.x; }
bool operator>=(const mint &rhs) const noexcept { return this->x >= rhs.x; }
friend istream &operator>>(istream &is, mint &a) {
long long t;
is >> t;
a = mint(t);
return is;
}
friend ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
};
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
bool initialized = false;
/**
* @fn
* This function must be called at first.
*/
void combination_init() {
initialized = true;
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;
}
}
/**
* @fn
* Calculates the combination ( nCK % p: N choose K mod p).
*
* @brief constraint: 1 ≤ k ≤ n ≤ 10^7
* @return nCK % MOD
*/
long long combination(int n, int k) {
assert(initialized);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/**
* @fn
* Calculates the factorial of the number.
*
* @return N! % MOD
*/
long long factorial(int n) {
assert(initialized);
if (n < 0)
return 0;
return fac[n] % MOD;
}
/**
* @fn
* Calculates the combination ( nCK % p: N choose K mod p).
*
* @brief constraint: 1 ≤ k ≤ 10^7 and 1 ≤ n ≤ 10^9
* @return nCK % MOD
*/
long long combination2(int n, int k) {
assert(initialized);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
ll res = 1;
k = min(k, n - k);
for (long long x = 1; x <= k; x++) {
res *= (n - x + 1);
res %= MOD;
res *= inv[x];
res %= MOD;
}
return res;
}
void solve() {
ll K;
string S;
cin >> K >> S;
mint ans = 0;
combination_init();
ll N = S.size() + K;
rep(i, K + 1) {
ans += mint(26).pow(i) * mint(25).pow(K - i) *
combination(N - i - 1, S.size() - 1);
}
cout << ans << '\n';
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
class mint {
public:
long long x;
constexpr mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}
constexpr mint operator-() const { return mint(-x); }
constexpr mint &operator+=(const mint &rhs) {
if ((x += rhs.x) >= MOD)
x -= MOD;
return *this;
}
constexpr mint &operator-=(const mint &rhs) {
if ((x += MOD - rhs.x) >= MOD)
x -= MOD;
return *this;
}
constexpr mint &operator*=(const mint &rhs) {
(x *= rhs.x) %= MOD;
return *this;
}
constexpr mint operator+(const mint &rhs) const {
mint res(*this);
return res += rhs;
}
constexpr mint operator-(const mint &rhs) const {
mint res(*this);
return res -= rhs;
}
constexpr mint operator*(const mint &rhs) const {
mint res(*this);
return res *= rhs;
}
[[nodiscard]] constexpr mint pow(long long t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
[[nodiscard]] constexpr mint inv() const { return pow(MOD - 2); }
mint &operator/=(mint rhs) { return *this *= rhs.inv(); }
mint operator/(const mint rhs) const { return mint(*this) /= rhs; }
constexpr bool operator==(const mint &rhs) const noexcept {
return this->x == rhs.x;
}
constexpr bool operator!=(const mint &rhs) const noexcept {
return this->x != rhs.x;
}
bool operator<(const mint &rhs) const noexcept { return this->x < rhs.x; }
bool operator>(const mint &rhs) const noexcept { return this->x > rhs.x; }
bool operator<=(const mint &rhs) const noexcept { return this->x <= rhs.x; }
bool operator>=(const mint &rhs) const noexcept { return this->x >= rhs.x; }
friend istream &operator>>(istream &is, mint &a) {
long long t;
is >> t;
a = mint(t);
return is;
}
friend ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
};
const int MAX = 5100000;
long long fac[MAX], finv[MAX], inv[MAX];
bool initialized = false;
/**
* @fn
* This function must be called at first.
*/
void combination_init() {
initialized = true;
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;
}
}
/**
* @fn
* Calculates the combination ( nCK % p: N choose K mod p).
*
* @brief constraint: 1 ≤ k ≤ n ≤ 10^7
* @return nCK % MOD
*/
long long combination(int n, int k) {
assert(initialized);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/**
* @fn
* Calculates the factorial of the number.
*
* @return N! % MOD
*/
long long factorial(int n) {
assert(initialized);
if (n < 0)
return 0;
return fac[n] % MOD;
}
/**
* @fn
* Calculates the combination ( nCK % p: N choose K mod p).
*
* @brief constraint: 1 ≤ k ≤ 10^7 and 1 ≤ n ≤ 10^9
* @return nCK % MOD
*/
long long combination2(int n, int k) {
assert(initialized);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
ll res = 1;
k = min(k, n - k);
for (long long x = 1; x <= k; x++) {
res *= (n - x + 1);
res %= MOD;
res *= inv[x];
res %= MOD;
}
return res;
}
void solve() {
ll K;
string S;
cin >> K >> S;
mint ans = 0;
combination_init();
ll N = S.size() + K;
rep(i, K + 1) {
ans += mint(26).pow(i) * mint(25).pow(K - i) *
combination(N - i - 1, S.size() - 1);
}
cout << ans << '\n';
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| replace | 108 | 109 | 108 | 109 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) \
{ \
REP(WW, n) cerr << v[WW] << ' '; \
cerr << endl; \
}
#define SHOW2d(v, WW, HH) \
{ \
REP(W_, WW) { \
REP(H_, HH) cerr << v[W_][H_] << ' '; \
cerr << endl; \
} \
}
#define ALL(v) v.begin(), v.end()
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, ll> P;
// a^b % MOD
long long mod_pow(ll a, ll b) {
long long ret = 1;
long long c = a;
for (int i = 0; i <= 60; i++) {
if (b & (1LL << i))
ret = (ret * c) % MOD;
c = (c * c) % MOD;
}
return ret;
}
// ａをbで割る
long long mod_div(long long a, long long b) {
long long tmp = MOD - 2, c = b, ret = 1;
while (tmp > 0) {
if (tmp & 1) {
ret *= c;
ret %= MOD;
}
c *= c;
c %= MOD;
tmp >>= 1;
}
return a * ret % MOD;
}
#define MAX_K 1111111
vector<long long> fact(MAX_K);
long long combination(long long n, long long r) {
if (n < r || n < 0 || r < 0)
return 0;
if (fact[0] != 1) {
fact[0] = 1;
for (long long i = 1; i < MAX_K; i++)
fact[i] = (fact[i - 1] * i) % MOD;
}
long long ret = fact[n];
long long tmp = (fact[r] * fact[n - r]) % MOD;
return mod_div(ret, tmp);
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
string str;
cin >> str;
ll m = str.size();
ll ans = 0;
for (ll i = m; i <= n + m; i++) {
ll seica = combination(i - 1, m - 1);
seica = seica * mod_pow(25, i - m) % MOD;
seica = seica * mod_pow(26, n + m - i) % MOD;
ans = (ans + seica) % MOD;
// cout << "seica: " << seica << endl;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
using namespace std;
#define REP(i, n) for (ll(i) = (0); (i) < (n); ++i)
#define REV(i, n) for (ll(i) = (n)-1; (i) >= 0; --i)
#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define SHOW1d(v, n) \
{ \
REP(WW, n) cerr << v[WW] << ' '; \
cerr << endl; \
}
#define SHOW2d(v, WW, HH) \
{ \
REP(W_, WW) { \
REP(H_, HH) cerr << v[W_][H_] << ' '; \
cerr << endl; \
} \
}
#define ALL(v) v.begin(), v.end()
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
#define MOD 1000000007
typedef long long ll;
typedef pair<ll, ll> P;
// a^b % MOD
long long mod_pow(ll a, ll b) {
long long ret = 1;
long long c = a;
for (int i = 0; i <= 60; i++) {
if (b & (1LL << i))
ret = (ret * c) % MOD;
c = (c * c) % MOD;
}
return ret;
}
// ａをbで割る
long long mod_div(long long a, long long b) {
long long tmp = MOD - 2, c = b, ret = 1;
while (tmp > 0) {
if (tmp & 1) {
ret *= c;
ret %= MOD;
}
c *= c;
c %= MOD;
tmp >>= 1;
}
return a * ret % MOD;
}
#define MAX_K 2222222
vector<long long> fact(MAX_K);
long long combination(long long n, long long r) {
if (n < r || n < 0 || r < 0)
return 0;
if (fact[0] != 1) {
fact[0] = 1;
for (long long i = 1; i < MAX_K; i++)
fact[i] = (fact[i - 1] * i) % MOD;
}
long long ret = fact[n];
long long tmp = (fact[r] * fact[n - r]) % MOD;
return mod_div(ret, tmp);
}
int main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
string str;
cin >> str;
ll m = str.size();
ll ans = 0;
for (ll i = m; i <= n + m; i++) {
ll seica = combination(i - 1, m - 1);
seica = seica * mod_pow(25, i - m) % MOD;
seica = seica * mod_pow(26, n + m - i) % MOD;
ans = (ans + seica) % MOD;
// cout << "seica: " << seica << endl;
}
cout << ans << endl;
return 0;
}
| replace | 70 | 71 | 70 | 71 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
class mint {
public:
long long x;
constexpr mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}
constexpr mint operator-() const { return mint(-x); }
constexpr mint &operator+=(const mint &rhs) {
if ((x += rhs.x) >= MOD)
x -= MOD;
return *this;
}
constexpr mint &operator-=(const mint &rhs) {
if ((x += MOD - rhs.x) >= MOD)
x -= MOD;
return *this;
}
constexpr mint &operator*=(const mint &rhs) {
(x *= rhs.x) %= MOD;
return *this;
}
constexpr mint operator+(const mint &rhs) const {
mint res(*this);
return res += rhs;
}
constexpr mint operator-(const mint &rhs) const {
mint res(*this);
return res -= rhs;
}
constexpr mint operator*(const mint &rhs) const {
mint res(*this);
return res *= rhs;
}
[[nodiscard]] constexpr mint pow(long long t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
[[nodiscard]] constexpr mint inv() const { return pow(MOD - 2); }
mint &operator/=(mint rhs) { return *this *= rhs.inv(); }
mint operator/(const mint rhs) const { return mint(*this) /= rhs; }
constexpr bool operator==(const mint &rhs) const noexcept {
return this->x == rhs.x;
}
constexpr bool operator!=(const mint &rhs) const noexcept {
return this->x != rhs.x;
}
bool operator<(const mint &rhs) const noexcept { return this->x < rhs.x; }
bool operator>(const mint &rhs) const noexcept { return this->x > rhs.x; }
bool operator<=(const mint &rhs) const noexcept { return this->x <= rhs.x; }
bool operator>=(const mint &rhs) const noexcept { return this->x >= rhs.x; }
friend istream &operator>>(istream &is, mint &a) {
long long t;
is >> t;
a = mint(t);
return is;
}
friend ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
};
const int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
bool initialized = false;
/**
* @fn
* This function must be called at first.
*/
void combination_init() {
initialized = true;
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;
}
}
/**
* @fn
* Calculates the combination ( nCK % p: N choose K mod p).
*
* @brief constraint: 1 ≤ k ≤ n ≤ 10^7
* @return nCK % MOD
*/
long long combination(int n, int k) {
assert(initialized);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/**
* @fn
* Calculates the factorial of the number.
*
* @return N! % MOD
*/
long long factorial(int n) {
assert(initialized);
if (n < 0)
return 0;
return fac[n] % MOD;
}
/**
* @fn
* Calculates the combination ( nCK % p: N choose K mod p).
*
* @brief constraint: 1 ≤ k ≤ 10^7 and 1 ≤ n ≤ 10^9
* @return nCK % MOD
*/
long long combination2(int n, int k) {
assert(initialized);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
ll res = 1;
k = min(k, n - k);
for (long long x = 1; x <= k; x++) {
res *= (n - x + 1);
res %= MOD;
res *= inv[x];
res %= MOD;
}
return res;
}
void solve() {
ll K;
string S;
combination_init();
cin >> K >> S;
mint ans = 0;
ll N = S.size();
rep(i, K + 1) {
ans += mint(25).pow(K - i) * combination(N + K - i - 1, N - 1) *
mint(26).pow(i);
}
cout << ans << '\n';
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define rep2(i, m, n) for (ll i = m; i < (ll)(n); i++)
#define rrep(i, n, m) for (ll i = n; i >= (ll)(m); i--)
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
const int ddx[8] = {0, 1, 1, 1, 0, -1, -1, -1};
const int ddy[8] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll MOD = 1000000007;
const ll INF = 1000000000000000000L;
#ifdef __DEBUG
/**
* For DEBUG
* https://github.com/ta7uw/cpp-pyprint
*/
#include "cpp-pyprint/pyprint.h"
#endif
class mint {
public:
long long x;
constexpr mint(long long x = 0) : x((x % MOD + MOD) % MOD) {}
constexpr mint operator-() const { return mint(-x); }
constexpr mint &operator+=(const mint &rhs) {
if ((x += rhs.x) >= MOD)
x -= MOD;
return *this;
}
constexpr mint &operator-=(const mint &rhs) {
if ((x += MOD - rhs.x) >= MOD)
x -= MOD;
return *this;
}
constexpr mint &operator*=(const mint &rhs) {
(x *= rhs.x) %= MOD;
return *this;
}
constexpr mint operator+(const mint &rhs) const {
mint res(*this);
return res += rhs;
}
constexpr mint operator-(const mint &rhs) const {
mint res(*this);
return res -= rhs;
}
constexpr mint operator*(const mint &rhs) const {
mint res(*this);
return res *= rhs;
}
[[nodiscard]] constexpr mint pow(long long t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
[[nodiscard]] constexpr mint inv() const { return pow(MOD - 2); }
mint &operator/=(mint rhs) { return *this *= rhs.inv(); }
mint operator/(const mint rhs) const { return mint(*this) /= rhs; }
constexpr bool operator==(const mint &rhs) const noexcept {
return this->x == rhs.x;
}
constexpr bool operator!=(const mint &rhs) const noexcept {
return this->x != rhs.x;
}
bool operator<(const mint &rhs) const noexcept { return this->x < rhs.x; }
bool operator>(const mint &rhs) const noexcept { return this->x > rhs.x; }
bool operator<=(const mint &rhs) const noexcept { return this->x <= rhs.x; }
bool operator>=(const mint &rhs) const noexcept { return this->x >= rhs.x; }
friend istream &operator>>(istream &is, mint &a) {
long long t;
is >> t;
a = mint(t);
return is;
}
friend ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
};
const int MAX = 2000000;
long long fac[MAX], finv[MAX], inv[MAX];
bool initialized = false;
/**
* @fn
* This function must be called at first.
*/
void combination_init() {
initialized = true;
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;
}
}
/**
* @fn
* Calculates the combination ( nCK % p: N choose K mod p).
*
* @brief constraint: 1 ≤ k ≤ n ≤ 10^7
* @return nCK % MOD
*/
long long combination(int n, int k) {
assert(initialized);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/**
* @fn
* Calculates the factorial of the number.
*
* @return N! % MOD
*/
long long factorial(int n) {
assert(initialized);
if (n < 0)
return 0;
return fac[n] % MOD;
}
/**
* @fn
* Calculates the combination ( nCK % p: N choose K mod p).
*
* @brief constraint: 1 ≤ k ≤ 10^7 and 1 ≤ n ≤ 10^9
* @return nCK % MOD
*/
long long combination2(int n, int k) {
assert(initialized);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
ll res = 1;
k = min(k, n - k);
for (long long x = 1; x <= k; x++) {
res *= (n - x + 1);
res %= MOD;
res *= inv[x];
res %= MOD;
}
return res;
}
void solve() {
ll K;
string S;
combination_init();
cin >> K >> S;
mint ans = 0;
ll N = S.size();
rep(i, K + 1) {
ans += mint(25).pow(K - i) * combination(N + K - i - 1, N - 1) *
mint(26).pow(i);
}
cout << ans << '\n';
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
solve();
return 0;
}
| replace | 108 | 109 | 108 | 109 | 0 | |
p02632 | C++ | Runtime Error | // #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
#define endl '\n'
#define ld long double
#define all(a) a.begin(), a.end()
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define sz(v) (int)v.size()
#define UB upper_bound
#define LB lower_bound
#define BP(x) __builtin_popcountll(x)
#define OST \
tree<pii, null_type, less<pii>, rb_tree_tag, \
tree_order_statistics_node_update>
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getRand(int l, int r) {
uniform_int_distribution<int> uid(l, r);
return uid(rng);
}
const int INF = 1e18 + 0;
const int mod = 1e9 + 7;
const int mex = 1e6 + 0;
int fact[mex + 5], inv[mex + 5];
int toPower(int a, int p) {
int res = 1;
while (p) {
if (p & 1)
res = ll(res) * a % mod;
p >>= 1;
a = ll(a) * a % mod;
}
return res;
}
int Inv(int x) { return toPower(x, mod - 2); }
int add(int a, int b) {
a %= mod;
b %= mod;
return ((a + b) % mod);
}
int sub(int a, int b) {
a %= mod;
b %= mod;
return ((a - b + mod) % mod);
}
int mul(int a, int b) {
a %= mod;
b %= mod;
return ((a * b) % mod);
}
void initialize() {
inv[0] = Inv(fact[0]);
fact[0] = inv[0] = 1;
for (int i = 1; i <= mex; i++) {
fact[i] = (ll(i) * fact[i - 1]) % mod;
inv[i] = Inv(fact[i]);
}
}
int C(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return ll(fact[n]) * inv[k] % mod * inv[n - k] % mod;
}
void solve() {
int n, k;
cin >> k;
int ans = 0;
string s;
cin >> s;
n = k + sz(s);
int t = sz(s);
for (int i = t; i <= n; i++) {
int cur = toPower(26, n - i);
cur = mul(cur, toPower(25, i - t));
cur = mul(cur, C(i - 1, t - 1));
ans = add(ans, cur);
}
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
initialize();
int t = 1; // cin >> t;
for (int i = 1; i <= t; i++) {
solve();
}
}
| // #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
typedef long long int ll;
#define endl '\n'
#define ld long double
#define all(a) a.begin(), a.end()
#define int long long
#define pb push_back
#define pii pair<int, int>
#define ff first
#define ss second
#define sz(v) (int)v.size()
#define UB upper_bound
#define LB lower_bound
#define BP(x) __builtin_popcountll(x)
#define OST \
tree<pii, null_type, less<pii>, rb_tree_tag, \
tree_order_statistics_node_update>
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int getRand(int l, int r) {
uniform_int_distribution<int> uid(l, r);
return uid(rng);
}
const int INF = 1e18 + 0;
const int mod = 1e9 + 7;
const int mex = 2e6 + 0;
int fact[mex + 5], inv[mex + 5];
int toPower(int a, int p) {
int res = 1;
while (p) {
if (p & 1)
res = ll(res) * a % mod;
p >>= 1;
a = ll(a) * a % mod;
}
return res;
}
int Inv(int x) { return toPower(x, mod - 2); }
int add(int a, int b) {
a %= mod;
b %= mod;
return ((a + b) % mod);
}
int sub(int a, int b) {
a %= mod;
b %= mod;
return ((a - b + mod) % mod);
}
int mul(int a, int b) {
a %= mod;
b %= mod;
return ((a * b) % mod);
}
void initialize() {
inv[0] = Inv(fact[0]);
fact[0] = inv[0] = 1;
for (int i = 1; i <= mex; i++) {
fact[i] = (ll(i) * fact[i - 1]) % mod;
inv[i] = Inv(fact[i]);
}
}
int C(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return ll(fact[n]) * inv[k] % mod * inv[n - k] % mod;
}
void solve() {
int n, k;
cin >> k;
int ans = 0;
string s;
cin >> s;
n = k + sz(s);
int t = sz(s);
for (int i = t; i <= n; i++) {
int cur = toPower(26, n - i);
cur = mul(cur, toPower(25, i - t));
cur = mul(cur, C(i - 1, t - 1));
ans = add(ans, cur);
}
cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
initialize();
int t = 1; // cin >> t;
for (int i = 1; i <= t; i++) {
solve();
}
}
| replace | 34 | 35 | 34 | 35 | 0 | |
p02632 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const int mx = 1e6 + 9;
inline void normal(ll &a) {
if (a >= MOD)
a %= MOD;
(a < 0) && (a += MOD);
}
inline ll modMul(ll a, ll b) {
normal(a), normal(b);
return (a * b) % MOD;
}
inline ll modAdd(ll a, ll b) {
normal(a), normal(b);
return (a + b) % MOD;
}
inline ll modSub(ll a, ll b) {
normal(a), normal(b);
a -= b;
normal(a);
return a;
}
inline ll modPow(ll b, ll p) {
ll r = 1;
while (p) {
if (p & 1)
r = modMul(r, b);
b = modMul(b, b);
p >>= 1;
}
return r;
} // if MOD is prime, modPow(b, p % (MOD-1))
inline ll modInverse(ll a) { return modPow(a, MOD - 2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
ll f[mx];
ll nCr(ll n, ll r) { return modDiv(f[n], modMul(f[r], f[n - r])); }
int main() {
f[0] = 1;
for (int i = 1; i < mx; i++)
f[i] = modMul(i, f[i - 1]);
int k;
string s;
cin >> k >> s;
int sz = s.size();
int n = k + sz;
int z = 26;
ll ans = 0;
for (int m = 0; m < sz; m++) {
ll temp = nCr(n, m);
temp = modMul(temp, modPow(z - 1, n - m));
ans = modAdd(ans, temp);
}
ans = modSub(modPow(z, n), ans);
cout << ans << endl;
} | #include "bits/stdc++.h"
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
const int mx = 3e6 + 9;
inline void normal(ll &a) {
if (a >= MOD)
a %= MOD;
(a < 0) && (a += MOD);
}
inline ll modMul(ll a, ll b) {
normal(a), normal(b);
return (a * b) % MOD;
}
inline ll modAdd(ll a, ll b) {
normal(a), normal(b);
return (a + b) % MOD;
}
inline ll modSub(ll a, ll b) {
normal(a), normal(b);
a -= b;
normal(a);
return a;
}
inline ll modPow(ll b, ll p) {
ll r = 1;
while (p) {
if (p & 1)
r = modMul(r, b);
b = modMul(b, b);
p >>= 1;
}
return r;
} // if MOD is prime, modPow(b, p % (MOD-1))
inline ll modInverse(ll a) { return modPow(a, MOD - 2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
ll f[mx];
ll nCr(ll n, ll r) { return modDiv(f[n], modMul(f[r], f[n - r])); }
int main() {
f[0] = 1;
for (int i = 1; i < mx; i++)
f[i] = modMul(i, f[i - 1]);
int k;
string s;
cin >> k >> s;
int sz = s.size();
int n = k + sz;
int z = 26;
ll ans = 0;
for (int m = 0; m < sz; m++) {
ll temp = nCr(n, m);
temp = modMul(temp, modPow(z - 1, n - m));
ans = modAdd(ans, temp);
}
ans = modSub(modPow(z, n), ans);
cout << ans << endl;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 61)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
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;
}
int k;
string s;
i64 mod_pow(i64 x, i64 y, i64 mod) {
i64 res = 1;
while (y > 0) {
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
const int MAX = 1010101, MOD = INF;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
inv[0] = 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 C(i64 n, i64 k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
/*i64 res = 1;
for(int i = 1; i <= k; i++){
res *= n-i+1;
res %= MOD;
res *= inv[i];
res %= MOD;
}
return res;
*/
}
void solve() {
cin >> k >> s;
int n = s.size();
COMinit();
// 文字列sを部分列に含む k+|s|文字の文字列の数は?
i64 ans = 0;
for (int i = n; i <= n + k; i++) {
ans += mod_pow(26, n + k - i, INF) * mod_pow(25, i - n, INF) % INF *
C(i - 1, n - 1) % INF;
ans %= INF;
}
cout << ans << endl;
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define INF 1000000007
#define LINF (1LL << 61)
#define PI 3.14159265358979
typedef long long i64;
typedef pair<i64, i64> P;
inline i64 mod(i64 a, i64 m) { return (a % m + m) % m; }
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;
}
int k;
string s;
i64 mod_pow(i64 x, i64 y, i64 mod) {
i64 res = 1;
while (y > 0) {
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
const int MAX = 2010101, MOD = INF;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
inv[0] = 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 C(i64 n, i64 k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
/*i64 res = 1;
for(int i = 1; i <= k; i++){
res *= n-i+1;
res %= MOD;
res *= inv[i];
res %= MOD;
}
return res;
*/
}
void solve() {
cin >> k >> s;
int n = s.size();
COMinit();
// 文字列sを部分列に含む k+|s|文字の文字列の数は?
i64 ans = 0;
for (int i = n; i <= n + k; i++) {
ans += mod_pow(26, n + k - i, INF) * mod_pow(25, i - n, INF) % INF *
C(i - 1, n - 1) % INF;
ans %= INF;
}
cout << ans << endl;
}
int main() {
std::cin.tie(0);
std::ios::sync_with_stdio(false);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
return 0;
} | replace | 40 | 41 | 40 | 41 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define foi(i, k, n) for (int i = (int)k; i < (int)n; ++i)
using namespace std;
constexpr int MOD = 7 + 1e9;
constexpr int MAXN = 5 + 1e6;
int add(int a, int b) {
int ans = a + b;
if (ans >= MOD)
ans -= MOD;
return ans;
}
int mul(int a, int b) { return (int)((1LL * a * b) % MOD); }
int fpow(int b, int e) {
int ans = 1;
for (; e; e >>= 1) {
if (e & 1)
ans = mul(ans, b);
b = mul(b, b);
}
return ans;
}
int f[MAXN];
int choose(int n, int k) {
assert(k <= n);
return mul(f[n], fpow(mul(f[k], f[n - k]), MOD - 2));
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
f[0] = 1;
for (int i = 1; i < MAXN; ++i) {
f[i] = mul(f[i - 1], i);
}
int n, k, ans = 0;
cin >> k;
string s;
cin >> s;
n = s.size() + k;
k = s.size();
for (int j = 0; j <= n - k; ++j) {
ans = add(ans, mul(choose(n, j + k), fpow(25, n - k - j)));
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define foi(i, k, n) for (int i = (int)k; i < (int)n; ++i)
using namespace std;
constexpr int MOD = 7 + 1e9;
constexpr int MAXN = 5 + 3e6;
int add(int a, int b) {
int ans = a + b;
if (ans >= MOD)
ans -= MOD;
return ans;
}
int mul(int a, int b) { return (int)((1LL * a * b) % MOD); }
int fpow(int b, int e) {
int ans = 1;
for (; e; e >>= 1) {
if (e & 1)
ans = mul(ans, b);
b = mul(b, b);
}
return ans;
}
int f[MAXN];
int choose(int n, int k) {
assert(k <= n);
return mul(f[n], fpow(mul(f[k], f[n - k]), MOD - 2));
}
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
f[0] = 1;
for (int i = 1; i < MAXN; ++i) {
f[i] = mul(f[i - 1], i);
}
int n, k, ans = 0;
cin >> k;
string s;
cin >> s;
n = s.size() + k;
k = s.size();
for (int j = 0; j <= n - k; ++j) {
ans = add(ans, mul(choose(n, j + k), fpow(25, n - k - j)));
}
cout << ans << '\n';
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll N = 1e6 + 30, Mod = 1e9 + 7;
const ll SQ = 330;
ll F[N], I[N];
ll mul(ll a, ll b) { return (a * b) % Mod; }
ll sum(ll a, ll b) { return (a + b + Mod) % Mod; }
ll Pow(ll a, ll b) {
ll res = 1;
for (; b; b >>= 1, a = mul(a, a))
if (b & 1)
res = mul(res, a);
return res;
}
ll C(ll r, ll n) {
if (r < 0 || r > n)
return 0;
return mul(F[n], mul(I[r], I[n - r]));
}
ll inv(ll x) { return Pow(x, Mod - 2); }
int main() {
ios::sync_with_stdio(0), cin.tie(0);
F[0] = 1;
for (int i = 1; i < N; i++)
F[i] = mul(i, F[i - 1]);
I[N - 1] = Pow(F[N - 1], Mod - 2);
for (int i = N - 2; ~i; i--)
I[i] = mul(i + 1, I[i + 1]);
ll ans = 0;
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
for (int i = 0; i <= k; i++) {
ll res = 0;
res = C(n - 1, k + n - i - 1);
res = mul(res, Pow(25, k - i));
res = mul(res, Pow(26, i));
ans = sum(ans, res);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(), x.end()
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
const ll N = 2e6 + 30, Mod = 1e9 + 7;
const ll SQ = 330;
ll F[N], I[N];
ll mul(ll a, ll b) { return (a * b) % Mod; }
ll sum(ll a, ll b) { return (a + b + Mod) % Mod; }
ll Pow(ll a, ll b) {
ll res = 1;
for (; b; b >>= 1, a = mul(a, a))
if (b & 1)
res = mul(res, a);
return res;
}
ll C(ll r, ll n) {
if (r < 0 || r > n)
return 0;
return mul(F[n], mul(I[r], I[n - r]));
}
ll inv(ll x) { return Pow(x, Mod - 2); }
int main() {
ios::sync_with_stdio(0), cin.tie(0);
F[0] = 1;
for (int i = 1; i < N; i++)
F[i] = mul(i, F[i - 1]);
I[N - 1] = Pow(F[N - 1], Mod - 2);
for (int i = N - 2; ~i; i--)
I[i] = mul(i + 1, I[i + 1]);
ll ans = 0;
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
for (int i = 0; i <= k; i++) {
ll res = 0;
res = C(n - 1, k + n - i - 1);
res = mul(res, Pow(25, k - i));
res = mul(res, Pow(26, i));
ans = sum(ans, res);
}
cout << ans << endl;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // dequef
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define rep(i, n) for (int i = 0; i < n; i++)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define all(a) (a).begin(), (a).end()
#define mod 1000000007
using ll = long long;
using namespace std;
ll modPow(ll a, ll n, ll p) { // 繰り返し二乗法 a**n % p
if (!n)
return 1;
if (n == 1)
return a % p;
if (n & 1)
return (a * modPow(a, n - 1, p)) % p;
ll t = modPow(a, n / 2, p);
return (t * t) % p;
}
ll choose(ll n, ll k, vector<ll> &fact, vector<ll> &inv) {
return fact[n] * (inv[k] * inv[n - k] % mod) % mod;
}
int main() {
const int len = 100000;
vector<ll> fact(len), inv(len);
fact[0] = fact[1] = 1;
for (int i = 2; i < len; i++)
fact[i] = fact[i - 1] * i % mod;
inv[len - 1] = modPow(fact[len - 1], mod - 2, mod);
for (int i = len - 2; i >= 0; i--)
inv[i] = inv[i + 1] * (i + 1) % mod;
int k;
string s;
cin >> k >> s;
int n = s.size();
ll ans = 0;
rep(x, k + 1) {
ll num = choose(k + n - x - 1, n - 1, fact, inv);
(num *= modPow(26, x, mod)) %= mod;
(num *= modPow(25, k - x, mod)) % mod;
(ans += num) %= mod;
}
cout << ans << endl;
} | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath> //sqrt pow
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // dequef
#include <iostream> // cout, endl, cin
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define rep(i, n) for (int i = 0; i < n; i++)
#define vi vector<int>
#define vvi vector<vi>
#define pii pair<int, int>
#define all(a) (a).begin(), (a).end()
#define mod 1000000007
using ll = long long;
using namespace std;
ll modPow(ll a, ll n, ll p) { // 繰り返し二乗法 a**n % p
if (!n)
return 1;
if (n == 1)
return a % p;
if (n & 1)
return (a * modPow(a, n - 1, p)) % p;
ll t = modPow(a, n / 2, p);
return (t * t) % p;
}
ll choose(ll n, ll k, vector<ll> &fact, vector<ll> &inv) {
return fact[n] * (inv[k] * inv[n - k] % mod) % mod;
}
int main() {
const int len = 2000002;
vector<ll> fact(len), inv(len);
fact[0] = fact[1] = 1;
for (int i = 2; i < len; i++)
fact[i] = fact[i - 1] * i % mod;
inv[len - 1] = modPow(fact[len - 1], mod - 2, mod);
for (int i = len - 2; i >= 0; i--)
inv[i] = inv[i + 1] * (i + 1) % mod;
int k;
string s;
cin >> k >> s;
int n = s.size();
ll ans = 0;
rep(x, k + 1) {
ll num = choose(k + n - x - 1, n - 1, fact, inv);
(num *= modPow(26, x, mod)) %= mod;
(num *= modPow(25, k - x, mod)) % mod;
(ans += num) %= mod;
}
cout << ans << endl;
} | replace | 41 | 42 | 41 | 42 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i, m, n) for (ll i = (m); i <= (n); i++)
#define zep(i, m, n) for (ll i = (m); i < (n); i++)
#define rrep(i, m, n) for (ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x, m, n) \
for (int i = (m); i <= n; i++) { \
cout << (x[i]) << " "; \
} \
cout << endl;
const long long MAX = 1e6 + 100;
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 powmod(long long a, long long x) {
if (x == 0)
return 1;
long long r = powmod(a, x / 2);
return (x % 2) ? (r * r % MOD) * a % MOD : r * r % MOD;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
COMinit();
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll ans = 0;
rep(i, 0, k) {
ans += COM(n - 1 + k - i, k - i) * powmod(25, k - i) % MOD * powmod(26, i) %
MOD;
ans %= MOD;
}
print(ans)
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define rep(i, m, n) for (ll i = (m); i <= (n); i++)
#define zep(i, m, n) for (ll i = (m); i < (n); i++)
#define rrep(i, m, n) for (ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x, m, n) \
for (int i = (m); i <= n; i++) { \
cout << (x[i]) << " "; \
} \
cout << endl;
const long long MAX = 2e6 + 100;
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 powmod(long long a, long long x) {
if (x == 0)
return 1;
long long r = powmod(a, x / 2);
return (x % 2) ? (r * r % MOD) * a % MOD : r * r % MOD;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
COMinit();
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll ans = 0;
rep(i, 0, k) {
ans += COM(n - 1 + k - i, k - i) * powmod(25, k - i) % MOD * powmod(26, i) %
MOD;
ans %= MOD;
}
print(ans)
return 0;
} | replace | 16 | 17 | 16 | 17 | 0 | |
p02632 | C++ | Runtime Error | #include <fstream>
#include <iostream>
// BE CAREFUL WITH HASH TABLE & UNORDERED MAP
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, b) FOR(i, 0, b)
#define RFO(i, a, b) for (int i = (b - 1); i >= (a); i--)
#define RF0(i, b) RFO(i, 0, b)
#define lli long long int
#define pii pair<int, int>
#define add(a, b) ((int)(((lli)(a) + (b)) % MOD))
#define mul(a, b) ((int)(((lli)(a) * (b)) % MOD))
#define PB emplace_back
// ifstream cin ("cinput.in");
// ofstream cout ("coutput.out");
int K;
string S;
int fact[2000000];
int modexp(int a, int e) {
int ans = 1;
int cur = a;
while (e) {
if (e & 1) {
ans = mul(ans, cur);
e--;
}
e /= 2;
cur = mul(cur, cur);
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> K >> S;
fact[0] = 1;
FOR(i, 1, K + S.size() + 1) fact[i] = mul(fact[i - 1], i);
int ans = 0;
FOR(av, S.size(), K + S.size() + 1) {
int nck =
mul(fact[av - 1],
modexp(mul(fact[S.size() - 1], fact[av - S.size()]), MOD - 2));
int p1 = modexp(25, av - S.size());
int p2 = modexp(26, K + S.size() - av);
ans = add(ans, mul(mul(p1, p2), nck));
}
cout << ans << '\n';
} | #include <fstream>
#include <iostream>
// BE CAREFUL WITH HASH TABLE & UNORDERED MAP
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
using namespace std;
#define MOD 1000000007
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define F0R(i, b) FOR(i, 0, b)
#define RFO(i, a, b) for (int i = (b - 1); i >= (a); i--)
#define RF0(i, b) RFO(i, 0, b)
#define lli long long int
#define pii pair<int, int>
#define add(a, b) ((int)(((lli)(a) + (b)) % MOD))
#define mul(a, b) ((int)(((lli)(a) * (b)) % MOD))
#define PB emplace_back
// ifstream cin ("cinput.in");
// ofstream cout ("coutput.out");
int K;
string S;
int fact[2000001];
int modexp(int a, int e) {
int ans = 1;
int cur = a;
while (e) {
if (e & 1) {
ans = mul(ans, cur);
e--;
}
e /= 2;
cur = mul(cur, cur);
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> K >> S;
fact[0] = 1;
FOR(i, 1, K + S.size() + 1) fact[i] = mul(fact[i - 1], i);
int ans = 0;
FOR(av, S.size(), K + S.size() + 1) {
int nck =
mul(fact[av - 1],
modexp(mul(fact[S.size() - 1], fact[av - S.size()]), MOD - 2));
int p1 = modexp(25, av - S.size());
int p2 = modexp(26, K + S.size() - av);
ans = add(ans, mul(mul(p1, p2), nck));
}
cout << ans << '\n';
} | replace | 24 | 25 | 24 | 25 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
// const int INF = 2e9;
// const ll INF = 9e18;
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; }
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(1000100);
mint perm(int n, int k) {
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int K;
cin >> K;
string S;
cin >> S;
int n = S.size();
mint ans = 0;
for (int i = 0; i <= K; i++) {
mint now = mint(26).pow(K - i);
now *= mint(25).pow(i);
now *= comb(i + n - 1, n - 1);
ans += now;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
// #define int long long
typedef long long ll;
// const int INF = 2e9;
// const ll INF = 9e18;
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; }
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(2000100);
mint perm(int n, int k) {
mint res = comb(n, k);
res *= comb.fact[k];
return res;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int K;
cin >> K;
string S;
cin >> S;
int n = S.size();
mint ans = 0;
for (int i = 0; i <= K; i++) {
mint now = mint(26).pow(K - i);
now *= mint(25).pow(i);
now *= comb(i + n - 1, n - 1);
ans += now;
}
cout << ans << "\n";
} | replace | 64 | 65 | 64 | 65 | 0 | |
p02632 | C++ | Runtime Error | /*#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
*/
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define rep4(i, s, n) for (ll i = (s); i < (ll)(n + 1); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define repr3(i, n) for (ll i = (n); i > 0; i--)
#define repr4(i, s, n) for (ll i = (n); i >= (s); i--)
#define stlen(s) ll s.size() - 1
#define all(v) v.begin(), v.end()
#define cout(n) cout << std::fixed << std::setprecision(n)
using Graph = vector<vector<int>>;
using Graphw = vector<vector<pair<ll, ll>>>;
#define INF1 INT_MAX;
#define INF2 LLONG_MAX;
#define PI 3.14159265358979323846;
#define MOD 1000000007;
/*
namespace mp = boost::multiprecision;
// 任意長整数型
using Bint = mp::cpp_int;
// 仮数部長が32の浮動小数点数型
using Real32 = mp::number<mp::cpp_dec_float<32>>;
// 仮数部長が1024の浮動小数点数型
using Real1024 = mp::number<mp::cpp_dec_float<1024>>;
// 有理数型
using Rat = boost::rational<Bint>;
*/
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; }
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);
int main() {
int K, n;
string S;
cin >> K >> S;
n = S.size();
mint ans = 0;
rep(i, K + 1) {
ans += comb(n + i - 1, n - 1) * mint(25).pow(i) * mint(26).pow(K - i);
}
cout << ans << endl;
return 0;
} | /*#include <boost/multiprecision/cpp_dec_float.hpp>
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/rational.hpp>
*/
#include <bits/stdc++.h>
using namespace std;
#define _GLIBCXX_DEBUG
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
using ll = long long;
using ld = long double;
#define rep2(i, s, n) for (ll i = (s); i < (ll)(n); i++)
#define rep3(i, n) for (ll i = 1; i < (ll)(n + 1); i++)
#define rep4(i, s, n) for (ll i = (s); i < (ll)(n + 1); i++)
#define repr(i, n) for (ll i = (n - 1); i >= 0; i--)
#define repr3(i, n) for (ll i = (n); i > 0; i--)
#define repr4(i, s, n) for (ll i = (n); i >= (s); i--)
#define stlen(s) ll s.size() - 1
#define all(v) v.begin(), v.end()
#define cout(n) cout << std::fixed << std::setprecision(n)
using Graph = vector<vector<int>>;
using Graphw = vector<vector<pair<ll, ll>>>;
#define INF1 INT_MAX;
#define INF2 LLONG_MAX;
#define PI 3.14159265358979323846;
#define MOD 1000000007;
/*
namespace mp = boost::multiprecision;
// 任意長整数型
using Bint = mp::cpp_int;
// 仮数部長が32の浮動小数点数型
using Real32 = mp::number<mp::cpp_dec_float<32>>;
// 仮数部長が1024の浮動小数点数型
using Real1024 = mp::number<mp::cpp_dec_float<1024>>;
// 有理数型
using Rat = boost::rational<Bint>;
*/
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; }
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);
int main() {
int K, n;
string S;
cin >> K >> S;
n = S.size();
mint ans = 0;
rep(i, K + 1) {
ans += comb(n + i - 1, n - 1) * mint(25).pow(i) * mint(26).pow(K - i);
}
cout << ans << endl;
return 0;
} | replace | 94 | 95 | 94 | 95 | 0 | |
p02632 | C++ | Runtime Error | const int LG = 21;
const int N = 1e6 + 88;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
#define forn(i, n) for (int(i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) \
sort(all(x)); \
(x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
string Yes[2] = {"No", "Yes"};
string YES[2] = {"NO", "YES"};
ll inq(ll x, ll y) {
if (!y)
re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2)
re l *l % MOD *x % MOD;
re l *l % MOD;
}
ll rev(ll x) { return inq(x, MOD - 2); }
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics() {
__precomputed_combinatorics = 1;
__fact.resize(N);
__ufact.resize(N);
__rev.resize(N);
__rev[1] = 1;
for (int i = 2; i < N; i++)
__rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < N; i++)
__fact[i] = __fact[i - 1] * i % MOD,
__ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x) {
if (!__precomputed_combinatorics)
__precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k) {
if (k < 0 || k > n)
return 0;
if (!__precomputed_combinatorics)
__precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
int Root(int x, vector<int> &root) {
if (x == root[x])
return x;
return root[x] = Root(root[x], root);
}
void Merge(int v, int u, vector<int> &root, vector<int> &sz) {
v = Root(v, root), u = Root(u, root);
if (v == u)
return;
if (sz[v] < sz[u]) {
sz[u] += sz[v];
root[v] = u;
} else {
sz[v] += sz[u];
root[u] = v;
}
}
int ok(int x, int n) { return 0 <= x && x < n; }
void bfs(int v, vi &dist, vector<vi> &graph) {
fill(all(dist), -1);
dist[v] = 0;
vi q = {v};
for (int i = 0; i < q.size(); i++) {
for (auto u : graph[q[i]]) {
if (dist[u] == -1) {
dist[u] = dist[q[i]] + 1;
q.push_back(u);
}
}
}
}
vector<int> z_func(string &s) {
vector<int> z(s.size());
z[0] = s.size();
int L = 0, R = 0;
for (int i = 1; i < s.size(); i++) {
z[i] = max(0, min(z[i - L], R - i));
while (i + z[i] < s.size() && s[i + z[i]] == s[z[i]])
z[i]++;
if (i + z[i] > R) {
R = i + z[i];
L = i;
}
}
return z;
}
vector<int> p_func(string &s) {
vector<int> p(s.size());
for (int i = 1; i < s.size(); i++) {
int j = p[i - 1];
while (j > 0 && s[i] != s[j])
j = p[j - 1];
if (s[i] == s[j])
j++;
p[i] = j;
}
return p;
}
vector<int> d1_func(string &s) {
vector<int> d1(s.size());
int L = 0, R = -1;
for (int i = 0; i < s.size(); i++) {
int k = 0;
if (i <= R)
k = min(R - i + 1, d1[R - i + L]);
while (i + k < s.size() && i - k >= 0 && s[i - k] == s[i + k])
k++;
d1[i] = k--;
if (i + k > R) {
L = i - k;
R = i + k;
}
}
return d1;
}
vector<int> d2_func(string &s) {
vector<int> d2(s.size());
int L = 0, R = -1;
for (int i = 1; i < s.size(); i++) {
int k = 0;
if (i <= R)
k = min(R - i + 1, d2[R - i + L + 1]);
while (i + k < s.size() && i - k - 1 >= 0 && s[i - k - 1] == s[i + k])
k++;
d2[i] = k--;
if (i + k > R) {
L = i - k - 1;
R = i + k;
}
}
return d2;
}
ll log10(ll x) {
if (x < 10)
re 1;
re 1 + log10(x / 10);
}
ll ds(ll x) {
if (x < 10)
return x;
re x % 10 + ds(x / 10);
}
double sqr(double x) { return x * x; }
bool in(int bit, int mask) { return (mask & (1 << bit)) > 0; }
void Del(vector<int> &v, int pos) {
swap(v[pos], v[v.size() - 1]);
v.pop_back();
}
long long g(vector<long long> &p, int pos) {
if (ok(pos, p.size()))
return p[pos];
if (pos < 0 || p.size() == 0)
return 0;
return p.back();
}
int g(vector<int> &p, int pos) {
if (ok(pos, p.size()))
return p[pos];
if (pos < 0 || p.size() == 0)
return 0;
return p.back();
}
signed main() {
srand(time(NULL));
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> k;
string s;
cin >> s;
n = s.size();
ll ans = 0;
for (int c = n; c <= n + k; c++)
ans += inq(25, n + k - c) * cnk(n + k, c) % MOD;
cout << ans % MOD;
}
/* Note:
Check constants at the beginning of the code.
N is set to 4e5 but be careful in problems with large constant factor.
Setting N in every problem is more effective.
Check corner cases.
N = 1
No def int long long for now.
Add something here.
*/
| const int LG = 21;
const int N = 2e6 + 88;
const long long MOD = 1e9 + 7;
const long long INF = 1e9;
const long long INFLL = 1e18;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
#define forn(i, n) for (int(i) = 0; (i) != (n); (i)++)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define popcount(x) __builtin_popcount(x)
#define popcountll(x) __builtin_popcountll(x)
#define fi first
#define se second
#define re return
#define pb push_back
#define uniq(x) \
sort(all(x)); \
(x).resize(unique(all(x)) - (x).begin())
#ifdef LOCAL
#define dbg(x) cerr << __LINE__ << " " << #x << " " << x << endl
#define ln cerr << __LINE__ << endl
#else
#define dbg(x) void(0)
#define ln void(0)
#endif // LOCAL
int cx[4] = {-1, 0, 1, 0};
int cy[4] = {0, -1, 0, 1};
string Yes[2] = {"No", "Yes"};
string YES[2] = {"NO", "YES"};
ll inq(ll x, ll y) {
if (!y)
re 1 % MOD;
ll l = inq(x, y / 2);
if (y % 2)
re l *l % MOD *x % MOD;
re l *l % MOD;
}
ll rev(ll x) { return inq(x, MOD - 2); }
bool __precomputed_combinatorics = 0;
vector<ll> __fact, __ufact, __rev;
void __precompute_combinatorics() {
__precomputed_combinatorics = 1;
__fact.resize(N);
__ufact.resize(N);
__rev.resize(N);
__rev[1] = 1;
for (int i = 2; i < N; i++)
__rev[i] = MOD - __rev[MOD % i] * (MOD / i) % MOD;
__fact[0] = 1, __ufact[0] = 1;
for (int i = 1; i < N; i++)
__fact[i] = __fact[i - 1] * i % MOD,
__ufact[i] = __ufact[i - 1] * __rev[i] % MOD;
}
ll fact(int x) {
if (!__precomputed_combinatorics)
__precompute_combinatorics();
return __fact[x];
}
ll cnk(int n, int k) {
if (k < 0 || k > n)
return 0;
if (!__precomputed_combinatorics)
__precompute_combinatorics();
return __fact[n] * __ufact[n - k] % MOD * __ufact[k] % MOD;
}
int Root(int x, vector<int> &root) {
if (x == root[x])
return x;
return root[x] = Root(root[x], root);
}
void Merge(int v, int u, vector<int> &root, vector<int> &sz) {
v = Root(v, root), u = Root(u, root);
if (v == u)
return;
if (sz[v] < sz[u]) {
sz[u] += sz[v];
root[v] = u;
} else {
sz[v] += sz[u];
root[u] = v;
}
}
int ok(int x, int n) { return 0 <= x && x < n; }
void bfs(int v, vi &dist, vector<vi> &graph) {
fill(all(dist), -1);
dist[v] = 0;
vi q = {v};
for (int i = 0; i < q.size(); i++) {
for (auto u : graph[q[i]]) {
if (dist[u] == -1) {
dist[u] = dist[q[i]] + 1;
q.push_back(u);
}
}
}
}
vector<int> z_func(string &s) {
vector<int> z(s.size());
z[0] = s.size();
int L = 0, R = 0;
for (int i = 1; i < s.size(); i++) {
z[i] = max(0, min(z[i - L], R - i));
while (i + z[i] < s.size() && s[i + z[i]] == s[z[i]])
z[i]++;
if (i + z[i] > R) {
R = i + z[i];
L = i;
}
}
return z;
}
vector<int> p_func(string &s) {
vector<int> p(s.size());
for (int i = 1; i < s.size(); i++) {
int j = p[i - 1];
while (j > 0 && s[i] != s[j])
j = p[j - 1];
if (s[i] == s[j])
j++;
p[i] = j;
}
return p;
}
vector<int> d1_func(string &s) {
vector<int> d1(s.size());
int L = 0, R = -1;
for (int i = 0; i < s.size(); i++) {
int k = 0;
if (i <= R)
k = min(R - i + 1, d1[R - i + L]);
while (i + k < s.size() && i - k >= 0 && s[i - k] == s[i + k])
k++;
d1[i] = k--;
if (i + k > R) {
L = i - k;
R = i + k;
}
}
return d1;
}
vector<int> d2_func(string &s) {
vector<int> d2(s.size());
int L = 0, R = -1;
for (int i = 1; i < s.size(); i++) {
int k = 0;
if (i <= R)
k = min(R - i + 1, d2[R - i + L + 1]);
while (i + k < s.size() && i - k - 1 >= 0 && s[i - k - 1] == s[i + k])
k++;
d2[i] = k--;
if (i + k > R) {
L = i - k - 1;
R = i + k;
}
}
return d2;
}
ll log10(ll x) {
if (x < 10)
re 1;
re 1 + log10(x / 10);
}
ll ds(ll x) {
if (x < 10)
return x;
re x % 10 + ds(x / 10);
}
double sqr(double x) { return x * x; }
bool in(int bit, int mask) { return (mask & (1 << bit)) > 0; }
void Del(vector<int> &v, int pos) {
swap(v[pos], v[v.size() - 1]);
v.pop_back();
}
long long g(vector<long long> &p, int pos) {
if (ok(pos, p.size()))
return p[pos];
if (pos < 0 || p.size() == 0)
return 0;
return p.back();
}
int g(vector<int> &p, int pos) {
if (ok(pos, p.size()))
return p[pos];
if (pos < 0 || p.size() == 0)
return 0;
return p.back();
}
signed main() {
srand(time(NULL));
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
ll n, k;
cin >> k;
string s;
cin >> s;
n = s.size();
ll ans = 0;
for (int c = n; c <= n + k; c++)
ans += inq(25, n + k - c) * cnk(n + k, c) % MOD;
cout << ans % MOD;
}
/* Note:
Check constants at the beginning of the code.
N is set to 4e5 but be careful in problems with large constant factor.
Setting N in every problem is more effective.
Check corner cases.
N = 1
No def int long long for now.
Add something here.
*/
| replace | 1 | 2 | 1 | 2 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int MAX = 200100;
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(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;
}
int main() {
long k;
cin >> k;
string s;
cin >> s;
long n = s.size();
COMinit();
long ans = 0;
rep2(i, n, k + n + 1) {
ans = (ans + modpow(25, i - n, MOD) * modpow(26, k + n - i, MOD) % MOD *
COM(i - 1, n - 1)) %
MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
using namespace std;
const int MAX = 2000100;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
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;
}
int main() {
long k;
cin >> k;
string s;
cin >> s;
long n = s.size();
COMinit();
long ans = 0;
rep2(i, n, k + n + 1) {
ans = (ans + modpow(25, i - n, MOD) * modpow(26, k + n - i, MOD) % MOD *
COM(i - 1, n - 1)) %
MOD;
}
cout << ans << endl;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// template {{{
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r)-1; i >= (int)(l); (i) -= 1)
#define whole(f, x, ...) \
([&](decltype((x)) container) { \
return (f)(begin(container), end(container), ##__VA_ARGS__); \
})(x)
#define rwhole(f, x, ...) \
([&](decltype((x)) container) { \
return (f)(rbegin(container), rend(container), ##__VA_ARGS__); \
})(x)
#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
// constexpr i32 mod = 998244353;
constexpr i32 mod = 1e9 + 7;
constexpr i32 inf = 1001001001;
constexpr i64 infll = 1001001001001001001ll;
constexpr int dx[] = {0, -1, 1, 0, -1, 1, -1, 1};
constexpr int dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};
struct IoSetup {
IoSetup(int x = 15) {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(x);
cerr << fixed << setprecision(x);
}
} iosetup;
template <typename T = i64> T input() {
T x;
cin >> x;
return x;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); }
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> vector<T> make_vector(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_vector(size_t a, Ts... ts) {
return vector<decltype(make_vector(ts...))>(a, make_vector(ts...));
}
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);
}
// }}}
// mod_int {{{
template <int mod> class mod_int {
using i32 = int_fast32_t;
using i64 = int_fast64_t;
i32 num_;
public:
mod_int() : num_(0) {}
mod_int(i64 num_) : num_(num_ >= 0 ? num_ % mod : (mod + num_ % mod) % mod) {}
inline i32 num() const { return num_; }
operator i64() { return num_; }
inline mod_int inverse() const {
i32 a = num_, b = mod, u = 1, v = 0, t;
while (b) {
t = a / b;
std::swap(a -= t * b, b);
std::swap(u -= t * v, v);
}
return mod_int(u);
}
mod_int operator~() const { return inverse(); }
mod_int operator+() const { return *this; }
mod_int operator-() const { return mod_int(-num_); }
mod_int &operator+=(const mod_int &rhs) {
if ((num_ += rhs.num_) >= mod)
num_ -= mod;
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((num_ -= rhs.num_) < 0)
num_ += mod;
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
num_ = i64(num_) * rhs.num_ % mod;
return *this;
}
mod_int &operator/=(const mod_int &rhs) { return *this *= rhs.inverse(); }
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 num_ == rhs.num_; }
bool operator!=(const mod_int &rhs) const { return num_ != rhs.num_; }
friend std::ostream &operator<<(std::ostream &os, const mod_int &rhs) {
return os << rhs.num_;
}
friend std::istream &operator>>(std::istream &is, mod_int &rhs) {
i64 num;
is >> num;
rhs = mod_int<mod>(num);
return is;
}
friend mod_int pow(mod_int lhs, i64 rhs) {
mod_int res(1);
for (; rhs; rhs >>= 1) {
if (rhs & 1)
res *= lhs;
lhs *= lhs;
}
return res;
}
};
// }}}
using modint = mod_int<mod>;
// mod combination {{{
template <typename T> class mod_combinatorics {
std::size_t size_;
std::vector<T> fact_, finv_, invs_;
public:
mod_combinatorics(std::size_t size)
: size_(size + 1), fact_(size_), finv_(size_), invs_(size_) {
fact_[0] = 1;
for (int i = 1; i < size_; ++i)
fact_[i] = fact_[i - 1] * T(i);
finv_.back() = fact_.back().inverse();
for (int i = int_fast32_t(size_) - 2; i >= 0; --i)
finv_[i] = finv_[i + 1] * T(i + 1);
for (int i = 0; i < size; ++i)
invs_[i] = finv_[i] * fact_[i - 1];
}
inline void boundary_check(int n) const {
if (size_ < n) {
std::cerr << "boudary error" << std::endl;
}
}
// k!
T fact(int k) const {
boundary_check(k);
return fact_[k];
}
// P(n, k)
T permutation(int n, int k) const {
boundary_check(n);
if (k < 0 || n < k)
return T(0);
return fact_[n] * finv_[n - k];
}
// C(n, k)
T combination(int n, int k) const {
boundary_check(n);
if (k < 0 || n < k)
return T(0);
return fact_[n] * finv_[k] * finv_[n - k];
}
// H(n, k)
T multichoose(int n, int k) const {
boundary_check(n + k - 1);
if (n < 0 || k < 0)
return T(0);
return fact_[n + k - 1] * finv_[k] * finv_[n - 1];
}
};
// }}}
void solver() {
int k = input();
string s;
cin >> s;
vector<int> cnt(26);
for (auto c : s)
cnt[c - 'a']++;
mod_combinatorics<modint> mc(300000);
modint ans = 0;
range(i, s.size(), s.size() + k + 1) {
ans += mc.combination(i - 1, s.size() - 1) * pow(modint(25), i - s.size()) *
pow(modint(26), s.size() + k - i);
}
cout << ans << endl;
}
signed main(int argc, char *argv[]) { solver(); }
| #include <bits/stdc++.h>
using namespace std;
// template {{{
#define range(i, l, r) for (int i = (int)(l); i < (int)(r); (i) += 1)
#define rrange(i, l, r) for (int i = (int)(r)-1; i >= (int)(l); (i) -= 1)
#define whole(f, x, ...) \
([&](decltype((x)) container) { \
return (f)(begin(container), end(container), ##__VA_ARGS__); \
})(x)
#define rwhole(f, x, ...) \
([&](decltype((x)) container) { \
return (f)(rbegin(container), rend(container), ##__VA_ARGS__); \
})(x)
#define debug(x) cerr << "(" << __LINE__ << ")" << #x << ": " << (x) << endl
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
// constexpr i32 mod = 998244353;
constexpr i32 mod = 1e9 + 7;
constexpr i32 inf = 1001001001;
constexpr i64 infll = 1001001001001001001ll;
constexpr int dx[] = {0, -1, 1, 0, -1, 1, -1, 1};
constexpr int dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};
struct IoSetup {
IoSetup(int x = 15) {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(x);
cerr << fixed << setprecision(x);
}
} iosetup;
template <typename T = i64> T input() {
T x;
cin >> x;
return x;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
range(i, 0, v.size()) { os << v[i] << (i + 1 != v.size() ? " " : ""); }
return os;
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (T &in : v)
is >> in;
return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
os << "(" << p.first << ", " << p.second << ")";
return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return is;
}
template <typename T> vector<T> make_vector(size_t a, T b) {
return vector<T>(a, b);
}
template <typename... Ts> auto make_vector(size_t a, Ts... ts) {
return vector<decltype(make_vector(ts...))>(a, make_vector(ts...));
}
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);
}
// }}}
// mod_int {{{
template <int mod> class mod_int {
using i32 = int_fast32_t;
using i64 = int_fast64_t;
i32 num_;
public:
mod_int() : num_(0) {}
mod_int(i64 num_) : num_(num_ >= 0 ? num_ % mod : (mod + num_ % mod) % mod) {}
inline i32 num() const { return num_; }
operator i64() { return num_; }
inline mod_int inverse() const {
i32 a = num_, b = mod, u = 1, v = 0, t;
while (b) {
t = a / b;
std::swap(a -= t * b, b);
std::swap(u -= t * v, v);
}
return mod_int(u);
}
mod_int operator~() const { return inverse(); }
mod_int operator+() const { return *this; }
mod_int operator-() const { return mod_int(-num_); }
mod_int &operator+=(const mod_int &rhs) {
if ((num_ += rhs.num_) >= mod)
num_ -= mod;
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((num_ -= rhs.num_) < 0)
num_ += mod;
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
num_ = i64(num_) * rhs.num_ % mod;
return *this;
}
mod_int &operator/=(const mod_int &rhs) { return *this *= rhs.inverse(); }
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 num_ == rhs.num_; }
bool operator!=(const mod_int &rhs) const { return num_ != rhs.num_; }
friend std::ostream &operator<<(std::ostream &os, const mod_int &rhs) {
return os << rhs.num_;
}
friend std::istream &operator>>(std::istream &is, mod_int &rhs) {
i64 num;
is >> num;
rhs = mod_int<mod>(num);
return is;
}
friend mod_int pow(mod_int lhs, i64 rhs) {
mod_int res(1);
for (; rhs; rhs >>= 1) {
if (rhs & 1)
res *= lhs;
lhs *= lhs;
}
return res;
}
};
// }}}
using modint = mod_int<mod>;
// mod combination {{{
template <typename T> class mod_combinatorics {
std::size_t size_;
std::vector<T> fact_, finv_, invs_;
public:
mod_combinatorics(std::size_t size)
: size_(size + 1), fact_(size_), finv_(size_), invs_(size_) {
fact_[0] = 1;
for (int i = 1; i < size_; ++i)
fact_[i] = fact_[i - 1] * T(i);
finv_.back() = fact_.back().inverse();
for (int i = int_fast32_t(size_) - 2; i >= 0; --i)
finv_[i] = finv_[i + 1] * T(i + 1);
for (int i = 0; i < size; ++i)
invs_[i] = finv_[i] * fact_[i - 1];
}
inline void boundary_check(int n) const {
if (size_ < n) {
std::cerr << "boudary error" << std::endl;
}
}
// k!
T fact(int k) const {
boundary_check(k);
return fact_[k];
}
// P(n, k)
T permutation(int n, int k) const {
boundary_check(n);
if (k < 0 || n < k)
return T(0);
return fact_[n] * finv_[n - k];
}
// C(n, k)
T combination(int n, int k) const {
boundary_check(n);
if (k < 0 || n < k)
return T(0);
return fact_[n] * finv_[k] * finv_[n - k];
}
// H(n, k)
T multichoose(int n, int k) const {
boundary_check(n + k - 1);
if (n < 0 || k < 0)
return T(0);
return fact_[n + k - 1] * finv_[k] * finv_[n - 1];
}
};
// }}}
void solver() {
int k = input();
string s;
cin >> s;
mod_combinatorics<modint> mc(3000000);
modint ans = 0;
range(i, s.size(), s.size() + k + 1) {
ans += mc.combination(i - 1, s.size() - 1) * pow(modint(25), i - s.size()) *
pow(modint(26), s.size() + k - i);
}
cout << ans << endl;
}
signed main(int argc, char *argv[]) { solver(); }
| replace | 222 | 227 | 222 | 223 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6 + 10, mod = 1e9 + 7;
typedef long long ll;
ll fact[maxn], inv[maxn];
ll exp(ll a, ll b) {
ll res = 1LL;
for (; b; b >>= 1, a = (a * a) % mod)
if (b & 1)
res = (res * a) % mod;
return res;
}
void precalc() {
fact[0] = 1LL;
for (int i = 1; i < maxn; i++)
fact[i] = (fact[i - 1] * i) % mod;
inv[maxn - 1] = exp(fact[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; i--)
inv[i] = (inv[i + 1] * (i + 1)) % mod;
}
ll ncr(ll n, ll r) {
if (n < r)
return 0LL;
return ((fact[n] * inv[n - r]) % mod * inv[r]) % mod;
}
int main() {
precalc();
ll k;
cin >> k;
string s;
cin >> s;
ll n = (int)s.size();
ll l = n + k;
ll ans = 0LL;
for (ll i = n; i <= l; i++)
ans = (ans + ((ncr(i - 1, n - 1) * exp(25, i - n)) % mod * exp(26, l - i)) %
mod) %
mod;
cout << ans << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
const int maxn = 2e6 + 10, mod = 1e9 + 7;
typedef long long ll;
ll fact[maxn], inv[maxn];
ll exp(ll a, ll b) {
ll res = 1LL;
for (; b; b >>= 1, a = (a * a) % mod)
if (b & 1)
res = (res * a) % mod;
return res;
}
void precalc() {
fact[0] = 1LL;
for (int i = 1; i < maxn; i++)
fact[i] = (fact[i - 1] * i) % mod;
inv[maxn - 1] = exp(fact[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; i--)
inv[i] = (inv[i + 1] * (i + 1)) % mod;
}
ll ncr(ll n, ll r) {
if (n < r)
return 0LL;
return ((fact[n] * inv[n - r]) % mod * inv[r]) % mod;
}
int main() {
precalc();
ll k;
cin >> k;
string s;
cin >> s;
ll n = (int)s.size();
ll l = n + k;
ll ans = 0LL;
for (ll i = n; i <= l; i++)
ans = (ans + ((ncr(i - 1, n - 1) * exp(25, i - n)) % mod * exp(26, l - i)) %
mod) %
mod;
cout << ans << "\n";
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
using ll = long long;
const int MAX = 1010000;
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;
}
// a^n mod を計算する
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;
}
void solve(long long K, std::string S) {
ll ans = 0;
COMinit();
for (int i = 0; i <= K; i++) {
ans += (COM(K - i + (int)S.size() - 1, (int)S.size() - 1) *
modpow(26, i, MOD)) %
MOD * modpow(25, K - i, MOD);
ans %= MOD;
}
cout << ans << endl;
}
int main() {
long long K;
scanf("%lld", &K);
std::string S;
std::cin >> S;
solve(K, S);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
using ll = long long;
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;
}
}
// 二項係数計算
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;
}
// a^n mod を計算する
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;
}
void solve(long long K, std::string S) {
ll ans = 0;
COMinit();
for (int i = 0; i <= K; i++) {
ans += (COM(K - i + (int)S.size() - 1, (int)S.size() - 1) *
modpow(26, i, MOD)) %
MOD * modpow(25, K - i, MOD);
ans %= MOD;
}
cout << ans << endl;
}
int main() {
long long K;
scanf("%lld", &K);
std::string S;
std::cin >> S;
solve(K, S);
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02632 | C++ | Runtime Error | // I SELL YOU...!
#include <algorithm>
#include <chrono>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using TP = tuple<ll, ll, ll>;
void init_io() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
}
#define MAX 1100000
#define MOD 1000000007
ll fac[MAX], finv[MAX], inv[MAX];
ll pv0[MAX], pv1[MAX];
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
pv0[0] = 1;
pv0[1] = 25;
pv1[0] = 1;
pv1[1] = 26;
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;
pv0[i] = (pv0[i - 1] * 25) % MOD;
pv1[i] = (pv1[i - 1] * 26) % MOD;
}
}
signed main() {
COMinit();
init_io();
ll k, n, all = 0, c = 1, ans = 0;
string s;
cin >> k >> s;
n = s.size();
all = n + k;
for (ll i = all; i >= n; i--) {
ll tmp = (pv0[i - n] * pv1[all - i]) % MOD;
tmp *= COM(i - 1, n - 1);
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << endl;
}
| // I SELL YOU...!
#include <algorithm>
#include <chrono>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <vector>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using TP = tuple<ll, ll, ll>;
void init_io() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(18);
}
#define MAX 3100000
#define MOD 1000000007
ll fac[MAX], finv[MAX], inv[MAX];
ll pv0[MAX], pv1[MAX];
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
pv0[0] = 1;
pv0[1] = 25;
pv1[0] = 1;
pv1[1] = 26;
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;
pv0[i] = (pv0[i - 1] * 25) % MOD;
pv1[i] = (pv1[i - 1] * 26) % MOD;
}
}
signed main() {
COMinit();
init_io();
ll k, n, all = 0, c = 1, ans = 0;
string s;
cin >> k >> s;
n = s.size();
all = n + k;
for (ll i = all; i >= n; i--) {
ll tmp = (pv0[i - n] * pv1[all - i]) % MOD;
tmp *= COM(i - 1, n - 1);
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << endl;
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define uu first
#define vv second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define INF 1e9
#define fastRead \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
const int MAX = 1e6 + 6;
const ll MOD = 1e9 + 7;
ll fact[MAX], invFact[MAX];
ll bigMod(ll a, ll b) {
if (b == 0)
return 1LL;
ll ret = bigMod(a, b / 2);
ret = (ret * ret) % MOD;
if (b & 1)
ret = (ret * a) % MOD;
return ret;
}
ll invMod(ll x) { return bigMod(x, MOD - 2); }
void pre() {
fact[0] = 1;
for (int i = 1; i < MAX; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
}
invFact[MAX - 1] = invMod(fact[MAX - 1]);
for (int i = MAX - 2; i >= 0; i--) {
invFact[i] = (invFact[i + 1] * (i + 1)) % MOD;
}
// for(int i =0 ; i < 5; i++ ) cout<<invFact[i]<<" ";
}
ll ncr(ll n, ll r) {
ll lob = fact[n];
ll hor = (invFact[r] * invFact[n - r]) % MOD;
return (lob * hor) % MOD;
}
int main() {
fastRead;
pre();
int k;
string s;
cin >> k >> s;
int n = s.size();
int tot = n + k;
ll ans = bigMod(26, tot);
for (int i = 0; i < n; i++) {
ll tmp = (ncr(tot, i) * bigMod(25, tot - i)) % MOD;
ans = (ans - tmp) % MOD;
ans = (ans + MOD) % MOD;
}
cout << ans << '\n';
return 0;
} | #include <bits/stdc++.h>
#define ll long long int
#define uu first
#define vv second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define INF 1e9
#define fastRead \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
const int MAX = 2e6 + 6;
const ll MOD = 1e9 + 7;
ll fact[MAX], invFact[MAX];
ll bigMod(ll a, ll b) {
if (b == 0)
return 1LL;
ll ret = bigMod(a, b / 2);
ret = (ret * ret) % MOD;
if (b & 1)
ret = (ret * a) % MOD;
return ret;
}
ll invMod(ll x) { return bigMod(x, MOD - 2); }
void pre() {
fact[0] = 1;
for (int i = 1; i < MAX; i++) {
fact[i] = (fact[i - 1] * i) % MOD;
}
invFact[MAX - 1] = invMod(fact[MAX - 1]);
for (int i = MAX - 2; i >= 0; i--) {
invFact[i] = (invFact[i + 1] * (i + 1)) % MOD;
}
// for(int i =0 ; i < 5; i++ ) cout<<invFact[i]<<" ";
}
ll ncr(ll n, ll r) {
ll lob = fact[n];
ll hor = (invFact[r] * invFact[n - r]) % MOD;
return (lob * hor) % MOD;
}
int main() {
fastRead;
pre();
int k;
string s;
cin >> k >> s;
int n = s.size();
int tot = n + k;
ll ans = bigMod(26, tot);
for (int i = 0; i < n; i++) {
ll tmp = (ncr(tot, i) * bigMod(25, tot - i)) % MOD;
ans = (ans - tmp) % MOD;
ans = (ans + MOD) % MOD;
}
cout << ans << '\n';
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02632 | 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 = 1e9 + 7;
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;
}
struct PCMod {
vector<ll> fact, inv, finv;
PCMod(int n) : fact(n + 1), inv(n + 1), finv(n + 1) {
fact[0] = 1;
fact[1] = 1;
inv[0] = 1;
inv[1] = 1;
finv[0] = 1;
finv[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 C(int m, int n) {
if (m < n)
return 0;
return fact[m] * (finv[n] * finv[m - n] % MOD) % MOD;
}
mint operator()(int m, int n) {
// return P(m, n);
return C(m, n);
}
} C(200005);
void solve(istream &cin, ostream &cout) {
ll k;
string s;
cin >> k >> s;
ll n = s.size();
mint ans = 0;
FOR(i, 0, k) {
mint add = C(n + i - 1, n - 1);
add *= mint(25).pow(i);
add *= mint(26).pow(k - i);
ans += add;
}
cout << ans << 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 = 1e9 + 7;
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;
}
struct PCMod {
vector<ll> fact, inv, finv;
PCMod(int n) : fact(n + 1), inv(n + 1), finv(n + 1) {
fact[0] = 1;
fact[1] = 1;
inv[0] = 1;
inv[1] = 1;
finv[0] = 1;
finv[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 C(int m, int n) {
if (m < n)
return 0;
return fact[m] * (finv[n] * finv[m - n] % MOD) % MOD;
}
mint operator()(int m, int n) { return C(m, n); }
} C(2000005);
void solve(istream &cin, ostream &cout) {
ll k;
string s;
cin >> k >> s;
ll n = s.size();
mint ans = 0;
FOR(i, 0, k) {
mint add = C(n + i - 1, n - 1);
add *= mint(25).pow(i);
add *= mint(26).pow(k - i);
ans += add;
}
cout << ans << endl;
}
#ifndef TEST
int main() {
OPTIMIZE_STDIO;
solve(cin, cout);
return 0;
}
#endif
| replace | 133 | 138 | 133 | 135 | 0 | |
p02632 | C++ | Runtime Error | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
using base = complex<double>;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair<long, long>
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define ff first
#define ss second
#define pb push_back
#define db pop_back
#define mp make_pair
#define mt make_tuple
#define g(a, b) get<a>(b)
#define INF (ll)1e18 + 100
#define vl vector<ll>
#define vi vector<int>
#define vll vector<pair<ll, ll>>
#define vii vector<pair<int, int>>
#define all(v) v.begin(), v.end()
#define bset(a, p) ((a) | (1ll << (p)))
#define bchk(a, p) ((a) & (1ll << (p)))
#define bxor(a, p) ((a) ^ (1ll << (p)));
#define brem(a, p) (bchk(a, p) ? (bxor(a, p)) : (a))
#define INT_SIZE 32
/*SOME BITMASK KNOWLEDGE
1)x & (x - 1):sets the last one bit of x to zero
power of two exactly when x & (x − 1) = 0.
2)x & -x:sets all the one bits to zero, except last one bit
3)x | (x - 1):inverts all the bits after the last one bit*/
#define endl "\n"
#define p0(a) cout << a << " "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c << endl
#define p4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl
#define o_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define o_setll \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
// member functions :
// 1. order_of_key(k) : number of elements strictly lesser than k
// 2. find_by_order(k) : k-th element in the set
ll powM(ll x, ll y, ll m) {
ll ans = 1, r = 1;
x %= m;
while (r > 0 && r <= y) {
if (r & y) {
ans *= x;
ans %= m;
}
r <<= 1;
x *= x;
x %= m;
}
return ans;
}
ll modI(ll a, ll m) {
ll m0 = m, y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m;
a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
ll logint(ll x, ll y) {
ll ans = 0;
ll a = 1;
for (ll i = 0; i <= x; i++) {
if (x < a) {
return ans;
}
ans++;
a *= y;
}
return -1;
}
ll extended(ll a, ll b, ll &x, ll &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
ll x1, y1;
ll d = extended(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return d;
}
const int N = 1e6 + 5;
ll fact[N];
ll inv(ll i) {
if (i < 0) {
return 1;
} else {
return modI(fact[i], M);
}
}
void solve() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
fact[0] = 1;
REP(i, 1, N) {
fact[i] = fact[i - 1] * i;
fact[i] %= M;
// inv[i] = modI(fact[i], M);
}
// ll dp[n + 1];
// REP(i, 0, n + 1) {
// dp[i] = 0;
// }
// dp[0] = 1;
// REP(i, 0, n + k) {
// dp[n] *= 26;
// dp[n] %= M;
// for (ll j = n - 1; j >= 0; j--) {
// dp[j] *= 25;
// dp[j] %= M;
// if (j > 0) {
// dp[j] += dp[j - 1];
// dp[j] %= M;
// }
// }
// }
// cout << dp[n] % M;
ll ans = 0;
REP(i, 0, k + 1) {
// ans += ((powM(26, k - i, M) * powM(25, i, M)) % M * (fact[n + i - 1] *
// (((inv(i - 1) * inv(n)) % M) % M)) % M;
ll temp = (powM(26, k - i, M) * powM(25, i, M)) % M;
temp *= fact[n + i - 1];
temp %= M;
temp *= inv(n - 1) % M;
temp %= M;
temp *= inv(i) % M;
temp %= M;
ans += temp;
ans %= M;
}
cout << ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("input.txt", "w", stdout);
ll ntc;
// cin >> ntc;
ntc = 1;
REP(tc, 1, ntc + 1) {
// cout << "Case #" << tc << ": ";
solve();
}
} | #pragma GCC optimize("O3")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
using base = complex<double>;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define M 1000000007
#define M2 998244353
#define ll long long
#define pll pair<long, long>
#define REP(i, a, b) for (ll i = a; i < b; i++)
#define REPI(i, a, b) for (ll i = b - 1; i >= a; i--)
#define ff first
#define ss second
#define pb push_back
#define db pop_back
#define mp make_pair
#define mt make_tuple
#define g(a, b) get<a>(b)
#define INF (ll)1e18 + 100
#define vl vector<ll>
#define vi vector<int>
#define vll vector<pair<ll, ll>>
#define vii vector<pair<int, int>>
#define all(v) v.begin(), v.end()
#define bset(a, p) ((a) | (1ll << (p)))
#define bchk(a, p) ((a) & (1ll << (p)))
#define bxor(a, p) ((a) ^ (1ll << (p)));
#define brem(a, p) (bchk(a, p) ? (bxor(a, p)) : (a))
#define INT_SIZE 32
/*SOME BITMASK KNOWLEDGE
1)x & (x - 1):sets the last one bit of x to zero
power of two exactly when x & (x − 1) = 0.
2)x & -x:sets all the one bits to zero, except last one bit
3)x | (x - 1):inverts all the bits after the last one bit*/
#define endl "\n"
#define p0(a) cout << a << " "
#define p1(a) cout << a << endl
#define p2(a, b) cout << a << " " << b << endl
#define p3(a, b, c) cout << a << " " << b << " " << c << endl
#define p4(a, b, c, d) cout << a << " " << b << " " << c << " " << d << endl
#define o_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
#define o_setll \
tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update>
// member functions :
// 1. order_of_key(k) : number of elements strictly lesser than k
// 2. find_by_order(k) : k-th element in the set
ll powM(ll x, ll y, ll m) {
ll ans = 1, r = 1;
x %= m;
while (r > 0 && r <= y) {
if (r & y) {
ans *= x;
ans %= m;
}
r <<= 1;
x *= x;
x %= m;
}
return ans;
}
ll modI(ll a, ll m) {
ll m0 = m, y = 0, x = 1;
if (m == 1)
return 0;
while (a > 1) {
ll q = a / m;
ll t = m;
m = a % m;
a = t;
t = y;
y = x - q * y;
x = t;
}
if (x < 0)
x += m0;
return x;
}
ll logint(ll x, ll y) {
ll ans = 0;
ll a = 1;
for (ll i = 0; i <= x; i++) {
if (x < a) {
return ans;
}
ans++;
a *= y;
}
return -1;
}
ll extended(ll a, ll b, ll &x, ll &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
ll x1, y1;
ll d = extended(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return d;
}
const int N = 2e6 + 5;
ll fact[N];
ll inv(ll i) {
if (i < 0) {
return 1;
} else {
return modI(fact[i], M);
}
}
void solve() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
fact[0] = 1;
REP(i, 1, N) {
fact[i] = fact[i - 1] * i;
fact[i] %= M;
// inv[i] = modI(fact[i], M);
}
// ll dp[n + 1];
// REP(i, 0, n + 1) {
// dp[i] = 0;
// }
// dp[0] = 1;
// REP(i, 0, n + k) {
// dp[n] *= 26;
// dp[n] %= M;
// for (ll j = n - 1; j >= 0; j--) {
// dp[j] *= 25;
// dp[j] %= M;
// if (j > 0) {
// dp[j] += dp[j - 1];
// dp[j] %= M;
// }
// }
// }
// cout << dp[n] % M;
ll ans = 0;
REP(i, 0, k + 1) {
// ans += ((powM(26, k - i, M) * powM(25, i, M)) % M * (fact[n + i - 1] *
// (((inv(i - 1) * inv(n)) % M) % M)) % M;
ll temp = (powM(26, k - i, M) * powM(25, i, M)) % M;
temp *= fact[n + i - 1];
temp %= M;
temp *= inv(n - 1) % M;
temp %= M;
temp *= inv(i) % M;
temp %= M;
ans += temp;
ans %= M;
}
cout << ans;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// freopen("input.txt", "r", stdin);
// freopen("input.txt", "w", stdout);
ll ntc;
// cin >> ntc;
ntc = 1;
REP(tc, 1, ntc + 1) {
// cout << "Case #" << tc << ": ";
solve();
}
} | replace | 108 | 109 | 108 | 109 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int mod = 1e9 + 7;
int k;
string s;
const int N = 1e6 + 1;
ll fac[N];
ll inv[N];
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % mod;
}
a = a * a % mod;
b >>= 1;
}
return res;
}
void init() {
fac[0] = 1;
for (int i = 1; i < N; ++i) {
fac[i] = fac[i - 1] * i % mod;
}
inv[N - 1] = power(fac[N - 1], mod - 2);
for (int i = N - 2; i >= 0; --i) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(ll a, ll b) { return fac[a] * inv[b] % mod * inv[a - b] % mod; }
int main() {
init();
cin >> k >> s;
int n = s.length();
ll res = 0;
ll sum = k + n;
for (int i = 0; i <= k; ++i) {
res = (res + power(26, i) * C(sum - 1 - i, n - 1) % mod * power(25, k - i) %
mod) %
mod;
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> ii;
struct fastio {
fastio() {
ios::sync_with_stdio(false);
cout << setprecision(10) << fixed;
cin.tie(0);
}
};
fastio _fast_io;
const int mod = 1e9 + 7;
int k;
string s;
const int N = 1e6 * 2 + 10;
ll fac[N];
ll inv[N];
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % mod;
}
a = a * a % mod;
b >>= 1;
}
return res;
}
void init() {
fac[0] = 1;
for (int i = 1; i < N; ++i) {
fac[i] = fac[i - 1] * i % mod;
}
inv[N - 1] = power(fac[N - 1], mod - 2);
for (int i = N - 2; i >= 0; --i) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(ll a, ll b) { return fac[a] * inv[b] % mod * inv[a - b] % mod; }
int main() {
init();
cin >> k >> s;
int n = s.length();
ll res = 0;
ll sum = k + n;
for (int i = 0; i <= k; ++i) {
res = (res + power(26, i) * C(sum - 1 - i, n - 1) % mod * power(25, k - i) %
mod) %
mod;
}
cout << res << endl;
return 0;
}
| replace | 19 | 20 | 19 | 20 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MSET(x, y) memset(x, y, sizeof(x))
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 3000005
#define ll long long
#define ld long double
#define INF 1e18
#define endl "\n"
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
ll MOD = 1000000007;
string yes = "YES\n";
string no = "NO\n";
#define PI 3.1415926535
ll k;
string s;
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
ll fac[M], invfac[M];
ll pre() {
fac[0] = 1;
for (ll i = 1; i < M; i++)
fac[i] = (fac[i - 1] * i) % MOD;
invfac[M - 1] = power(fac[M - 1], MOD - 2, MOD);
for (ll i = M - 2; i >= 0; i--) {
invfac[i] = (invfac[i + 1] * (i + 1)) % MOD;
}
}
ll ncr(ll n, ll r, ll p) {
if (r < 0 or r > n)
return 0;
return ((((fac[n] * invfac[r]) % p) * invfac[n - r]) % p);
}
int32_t main() {
fastio;
cin >> k;
cin >> s;
ll n = s.size();
pre();
ll ans = 0;
for (ll i = 0; i <= k; i++) {
ans += ((((ncr(n + k - i - 1, n - 1, MOD) * power(25, k - i, MOD)) % MOD) *
power(26, i, MOD) % MOD) %
MOD);
ans %= MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define MSET(x, y) memset(x, y, sizeof(x))
#define F first
#define S second
#define MP make_pair
#define PB push_back
#define SZ size()
#define M 3000005
#define ll long long
#define ld long double
#define INF 1e18
#define endl "\n"
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
using namespace std;
ll MOD = 1000000007;
string yes = "YES\n";
string no = "NO\n";
#define PI 3.1415926535
ll k;
string s;
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
ll fac[M], invfac[M];
void pre() {
fac[0] = 1;
for (ll i = 1; i < M; i++)
fac[i] = (fac[i - 1] * i) % MOD;
invfac[M - 1] = power(fac[M - 1], MOD - 2, MOD);
for (ll i = M - 2; i >= 0; i--) {
invfac[i] = (invfac[i + 1] * (i + 1)) % MOD;
}
}
ll ncr(ll n, ll r, ll p) {
if (r < 0 or r > n)
return 0;
return ((((fac[n] * invfac[r]) % p) * invfac[n - r]) % p);
}
int32_t main() {
fastio;
cin >> k;
cin >> s;
ll n = s.size();
pre();
ll ans = 0;
for (ll i = 0; i <= k; i++) {
ans += ((((ncr(n + k - i - 1, n - 1, MOD) * power(25, k - i, MOD)) % MOD) *
power(26, i, MOD) % MOD) %
MOD);
ans %= MOD;
}
cout << ans << endl;
} | replace | 38 | 39 | 38 | 39 | 0 | |
p02632 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int MOD = 1000000007;
const int BUF = 1000005;
int factorial[BUF];
int add(int a, int b) { return (1LL * a + b) % MOD; }
int mul(int a, int b) { return 1LL * a * b % MOD; }
int modpow(int p, int n) {
if (n == 0)
return 1;
int t = modpow(p, n / 2);
return n & 1 ? mul(t, mul(t, p)) : mul(t, t);
}
int inv(int v) { return modpow(v, MOD - 2); }
int nCk(int n, int k) {
return mul(factorial[n], mul(inv(factorial[k]), inv(factorial[n - k])));
}
int nHk(int n, int k) { return nCk(n + k - 1, k); }
int K;
int sLeng;
void read() {
string dummy;
cin >> K >> dummy;
sLeng = dummy.size();
}
void work() {
int ans = 0;
for (int i = 0; i <= K; ++i) {
ans = add(ans, mul(nHk(sLeng, i), mul(modpow(25, i), modpow(26, K - i))));
}
cout << ans << endl;
}
int main() {
factorial[0] = 1;
for (int i = 1; i < BUF; ++i) {
factorial[i] = mul(i, factorial[i - 1]);
}
read();
work();
return 0;
}
| #include <iostream>
using namespace std;
const int MOD = 1000000007;
const int BUF = 2000005;
int factorial[BUF];
int add(int a, int b) { return (1LL * a + b) % MOD; }
int mul(int a, int b) { return 1LL * a * b % MOD; }
int modpow(int p, int n) {
if (n == 0)
return 1;
int t = modpow(p, n / 2);
return n & 1 ? mul(t, mul(t, p)) : mul(t, t);
}
int inv(int v) { return modpow(v, MOD - 2); }
int nCk(int n, int k) {
return mul(factorial[n], mul(inv(factorial[k]), inv(factorial[n - k])));
}
int nHk(int n, int k) { return nCk(n + k - 1, k); }
int K;
int sLeng;
void read() {
string dummy;
cin >> K >> dummy;
sLeng = dummy.size();
}
void work() {
int ans = 0;
for (int i = 0; i <= K; ++i) {
ans = add(ans, mul(nHk(sLeng, i), mul(modpow(25, i), modpow(26, K - i))));
}
cout << ans << endl;
}
int main() {
factorial[0] = 1;
for (int i = 1; i < BUF; ++i) {
factorial[i] = mul(i, factorial[i - 1]);
}
read();
work();
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int const nax = 1e3 + 10;
const int mod = 1000000007; //
void plusle(int &a, int b) {
if ((a += b) >= mod)
a -= mod;
}
void minun(int &a, int b) {
if ((a -= b) < 0)
a += mod;
}
int add(int a, int b) { return ((a += b) >= mod) ? a - mod : a; }
int sub(int a, int b) { return ((a -= b) < 0) ? a + mod : a; }
int mul(int a, int b) { return 1LL * a * b % mod; }
int power(int a, int b) {
int res = 1;
for (; b > 0; b >>= 1, a = mul(a, a))
if (b & 1)
res = mul(res, a);
return res;
}
const int Mx = 2e6 + 10;
int fac[Mx], invf[Mx];
void prefact() {
fac[0] = 1;
for (int i = 1; i < Mx; i++) {
fac[i] = mul(fac[i - 1], i);
}
invf[Mx - 1] = power(fac[Mx - 1], mod - 2);
for (int i = Mx - 2; i >= 0; i--) {
invf[i] = mul(invf[i + 1], i + 1);
}
}
int ncr(int N, int R) {
if (R > N)
return 0;
if (R == 0 || R == N)
return 1;
return mul(fac[N], mul(invf[N - R], invf[R]));
}
int k;
char s[nax];
int main() {
prefact();
scanf("%d", &k);
scanf("%s", s + 1);
int n = strlen(s + 1);
int ans = 0;
for (int i = 0; i <= k; ++i) {
plusle(ans, mul(ncr(n + k, i), power(25, i)));
}
printf("%d\n", ans);
}
| #include <bits/stdc++.h>
using namespace std;
int const nax = 2e6 + 10;
const int mod = 1000000007; //
void plusle(int &a, int b) {
if ((a += b) >= mod)
a -= mod;
}
void minun(int &a, int b) {
if ((a -= b) < 0)
a += mod;
}
int add(int a, int b) { return ((a += b) >= mod) ? a - mod : a; }
int sub(int a, int b) { return ((a -= b) < 0) ? a + mod : a; }
int mul(int a, int b) { return 1LL * a * b % mod; }
int power(int a, int b) {
int res = 1;
for (; b > 0; b >>= 1, a = mul(a, a))
if (b & 1)
res = mul(res, a);
return res;
}
const int Mx = 2e6 + 10;
int fac[Mx], invf[Mx];
void prefact() {
fac[0] = 1;
for (int i = 1; i < Mx; i++) {
fac[i] = mul(fac[i - 1], i);
}
invf[Mx - 1] = power(fac[Mx - 1], mod - 2);
for (int i = Mx - 2; i >= 0; i--) {
invf[i] = mul(invf[i + 1], i + 1);
}
}
int ncr(int N, int R) {
if (R > N)
return 0;
if (R == 0 || R == N)
return 1;
return mul(fac[N], mul(invf[N - R], invf[R]));
}
int k;
char s[nax];
int main() {
prefact();
scanf("%d", &k);
scanf("%s", s + 1);
int n = strlen(s + 1);
int ans = 0;
for (int i = 0; i <= k; ++i) {
plusle(ans, mul(ncr(n + k, i), power(25, i)));
}
printf("%d\n", ans);
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int N = 1e6 + 10;
const int mod = 1e9 + 7;
ll fac[N], inv[N];
ll binpow(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void init() {
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = fac[i - 1] * i % mod;
inv[N - 1] = binpow(fac[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--)
inv[i] = inv[i + 1] * (i + 1) % mod;
}
ll C(ll n, ll m) { return fac[n] * inv[m] % mod * inv[n - m] % mod; }
int main() {
init();
int k;
string s;
cin >> k >> s;
int n = k + s.size();
ll ans = 0;
for (int i = s.size(); i <= n; i++)
ans += C(n, i) * binpow(25, n - i) % mod, ans %= mod;
cout << ans << "\n";
} | #include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int N = 2e6 + 10;
const int mod = 1e9 + 7;
ll fac[N], inv[N];
ll binpow(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res;
}
void init() {
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = fac[i - 1] * i % mod;
inv[N - 1] = binpow(fac[N - 1], mod - 2);
for (int i = N - 2; i >= 0; i--)
inv[i] = inv[i + 1] * (i + 1) % mod;
}
ll C(ll n, ll m) { return fac[n] * inv[m] % mod * inv[n - m] % mod; }
int main() {
init();
int k;
string s;
cin >> k >> s;
int n = k + s.size();
ll ans = 0;
for (int i = s.size(); i <= n; i++)
ans += C(n, i) * binpow(25, n - i) % mod, ans %= mod;
cout << ans << "\n";
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int MAX = 510000;
vector<long> fact(MAX), finv(MAX), inve(MAX);
void init() {
fact.at(0) = fact.at(1) = 1;
finv.at(0) = finv.at(1) = 1;
inve.at(1) = 1;
for (int i = 2; i < MAX; i++) {
fact.at(i) = fact.at(i - 1) * i % MOD;
inve.at(i) = MOD - inve.at(MOD % i) * (MOD / i) % MOD;
finv.at(i) = finv.at(i - 1) * inve.at(i) % MOD;
}
}
long com(long n, long r) {
if (n < r || n < 0 || r < 0)
return 0;
return fact.at(n) * (finv.at(r) * finv.at(n - r) % MOD) % MOD;
}
long mpow(long a, long b) {
long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int main() {
init();
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
string S;
cin >> N >> S;
int M = S.size();
N += M;
long ans = 0;
for (int i = M; i <= N; i++) {
long tmp = com(i - 1, M - 1);
(tmp *= mpow(25, i - M)) %= MOD;
(tmp *= mpow(26, N - i)) %= MOD;
(ans += tmp) %= MOD;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int MAX = 3000000;
vector<long> fact(MAX), finv(MAX), inve(MAX);
void init() {
fact.at(0) = fact.at(1) = 1;
finv.at(0) = finv.at(1) = 1;
inve.at(1) = 1;
for (int i = 2; i < MAX; i++) {
fact.at(i) = fact.at(i - 1) * i % MOD;
inve.at(i) = MOD - inve.at(MOD % i) * (MOD / i) % MOD;
finv.at(i) = finv.at(i - 1) * inve.at(i) % MOD;
}
}
long com(long n, long r) {
if (n < r || n < 0 || r < 0)
return 0;
return fact.at(n) * (finv.at(r) * finv.at(n - r) % MOD) % MOD;
}
long mpow(long a, long b) {
long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int main() {
init();
cin.tie(nullptr);
ios::sync_with_stdio(false);
int N;
string S;
cin >> N >> S;
int M = S.size();
N += M;
long ans = 0;
for (int i = M; i <= N; i++) {
long tmp = com(i - 1, M - 1);
(tmp *= mpow(25, i - M)) %= MOD;
(tmp *= mpow(26, N - i)) %= MOD;
(ans += tmp) %= MOD;
}
cout << ans << "\n";
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02632 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define F first
#define S second
#define def(x) cerr << #x << " is " << x << endl;
#define mod 1000000007
#define pb push_back
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define all(a) a.begin(), a.end()
const int NUM = 2e5 + 5;
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
ll const N = 2e6;
ll dp[N], f[N], inv[N]; // f = factorial, inv[i] = 1/f[i]
ll len, n, ans = 0;
ll bp(ll x, ll n, ll MOD) {
if (n == 0)
return 1;
ll ans = bp(x, n / 2, MOD) % MOD;
ans = (ans * ans) % MOD;
if (n % 2 == 0)
return ans;
else
return (ans * x) % MOD;
}
ll calc(ll n, ll r) { return (f[n] * inv[n - r] % mod) * inv[r] % mod; }
int main() {
ios int num_tests = 1;
// cin>>num_tests;
while (num_tests-- > 0) {
string s;
cin >> len >> s;
n = s.size();
len += n;
// ans = summation of (C(len,i)*pow(25,len-i))
// previous one got TLE
// So we have to precompute
f[0] = inv[0] = 1;
FOR(i, 1, len + 1) {
f[i] = f[i - 1] * i % mod;
inv[i] = bp(f[i], mod - 2, mod);
}
dp[len] = 1;
for (ll i = len - 1; i >= 1; i--) {
dp[i] = calc(len, i) * bp(25, len - i, mod) % mod;
dp[i] += mod;
dp[i] %= mod;
}
FOR(i, n, len + 1) { ans = (ans + dp[i]) % mod; }
cout << ans;
}
} |
#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define endl "\n"
#define F first
#define S second
#define def(x) cerr << #x << " is " << x << endl;
#define mod 1000000007
#define pb push_back
#define FOR(i, a, n) for (ll i = a; i < n; i++)
#define ios \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define all(a) a.begin(), a.end()
const int NUM = 2e5 + 5;
#define error(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
err(_it, args); \
}
void err(istream_iterator<string> it) {}
template <typename T, typename... Args>
void err(istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << endl;
err(++it, args...);
}
ll const N = 2e6;
ll dp[N], f[N], inv[N]; // f = factorial, inv[i] = 1/f[i]
ll len, n, ans = 0;
ll bp(ll x, ll y, ll MOD) {
ll ans = 1;
while (y) {
if (y & 1)
ans = ans * x % MOD;
x = x * x % MOD, y >>= 1;
}
return ans;
}
ll calc(ll n, ll r) { return (f[n] * inv[n - r] % mod) * inv[r] % mod; }
int main() {
ios int num_tests = 1;
// cin>>num_tests;
while (num_tests-- > 0) {
string s;
cin >> len >> s;
n = s.size();
len += n;
// ans = summation of (C(len,i)*pow(25,len-i))
// previous one got TLE
// So we have to precompute
f[0] = inv[0] = 1;
FOR(i, 1, len + 1) {
f[i] = f[i - 1] * i % mod;
inv[i] = bp(f[i], mod - 2, mod);
}
dp[len] = 1;
for (ll i = len - 1; i >= 1; i--) {
dp[i] = calc(len, i) * bp(25, len - i, mod) % mod;
dp[i] += mod;
dp[i] %= mod;
}
FOR(i, n, len + 1) { ans = (ans + dp[i]) % mod; }
cout << ans;
}
} | replace | 35 | 44 | 35 | 43 | TLE | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 1
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #VariableName
#define LOG(x) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << endl;
#define LOG2(x, y) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl;
#define LOG3(x, y, z) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \
<< TO_STRING(z) << "=" << z << endl;
#define LOG4(w, x, y, z) \
if (DEBUG) \
cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
<< TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z \
<< endl;
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 long long MOD = 1000000007;
// 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;
}
};
// a^n mod を計算する
lli modpow(lli a, lli n, lli mod) {
lli res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^-1
lli modinv(lli a, lli mod) {
lli b = mod, u = 1, v = 0;
while (b) {
lli t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
// const int MOD = 1000000007;
using mint = Fp<MOD>;
const lli MAX = 1000100;
lli fac[MAX], finv[MAX], inv[MAX];
/*use method: COMinit(),COM(x,y)*/
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (lli 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(lli n, lli k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void func(long long K, std::string S) {
mint ans = 0;
REP(i, 0, K + 1) {
mint now = COM(i + S.size() - 1, S.size() - 1);
now *= modpow(26, K - i, MOD);
now *= modpow(25, i, MOD);
ans += now;
}
cout << ans << endl;
}
int main() {
// cout << fixed << setprecision(5);
COMinit();
long long K;
scanf("%lld", &K);
std::string S;
std::cin >> S;
func(K, S);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define REP(i, s, n) for (int i = s; i < n; i++)
#define NUM 2520
#define INF (1LL << 50)
#define DEBUG 1
#define mp(a, b) make_pair(a, b)
#define SORT(V) sort(V.begin(), V.end())
#define PI (3.141592653589794)
#define TO_STRING(VariableName) #VariableName
#define LOG(x) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << endl;
#define LOG2(x, y) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << endl;
#define LOG3(x, y, z) \
if (DEBUG) \
cout << TO_STRING(x) << "=" << x << " " << TO_STRING(y) << "=" << y << " " \
<< TO_STRING(z) << "=" << z << endl;
#define LOG4(w, x, y, z) \
if (DEBUG) \
cout << TO_STRING(w) << "=" << w << " " << TO_STRING(x) << "=" << x << " " \
<< TO_STRING(y) << "=" << y << " " << TO_STRING(z) << "=" << z \
<< endl;
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 long long MOD = 1000000007;
// 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;
}
};
// a^n mod を計算する
lli modpow(lli a, lli n, lli mod) {
lli res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^-1
lli modinv(lli a, lli mod) {
lli b = mod, u = 1, v = 0;
while (b) {
lli t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
// const int MOD = 1000000007;
using mint = Fp<MOD>;
const lli MAX = 2000100;
lli fac[MAX], finv[MAX], inv[MAX];
/*use method: COMinit(),COM(x,y)*/
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (lli 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(lli n, lli k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void func(long long K, std::string S) {
mint ans = 0;
REP(i, 0, K + 1) {
mint now = COM(i + S.size() - 1, S.size() - 1);
now *= modpow(26, K - i, MOD);
now *= modpow(25, i, MOD);
ans += now;
}
cout << ans << endl;
}
int main() {
// cout << fixed << setprecision(5);
COMinit();
long long K;
scanf("%lld", &K);
std::string S;
std::cin >> S;
func(K, S);
return 0;
}
| replace | 139 | 140 | 139 | 140 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pcc pair<char, char>
#define vi vector<int>
#define vl vector<ll>
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define pd(x) printf("%d", x)
#define plld(x) printf("%lld", x)
#define pds(x) printf("%d ", x)
#define pllds(x) printf("%lld ", x)
#define pdn(x) printf("%d\n", x)
#define plldn(x) printf("%lld\n", x)
#define INF 2e9
#define INFLL 4e18
using namespace std;
ll powmod(ll base, ll exponent, ll mod) { // with mod < 1e9
ll ans = 1;
while (exponent) {
if (exponent & 1)
ans = (ans * base) % mod;
base = (base * base) % mod;
exponent /= 2;
}
return ans;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
const int upperlimit = 1e6 + 100;
const int mod = 1e9 + 7;
ll fact[upperlimit];
ll invfact[upperlimit];
ll ncr(int n, int r) {
ll ans = fact[n];
ans *= invfact[r];
ans %= mod;
ans *= invfact[n - r];
ans %= mod;
return ans;
}
int main() {
// freopen(".in","r",stdin);freopen(".out","w",stdout);
fact[0] = 1;
invfact[0] = 1;
for (int i = 1; i < upperlimit; i++) {
fact[i] = fact[i - 1];
fact[i] *= i;
fact[i] %= mod;
invfact[i] = powmod(fact[i], mod - 2, mod);
}
int n;
string s;
cin >> n >> s;
int k = s.size();
ll ans = 0;
for (int i = k; i <= n + k; i++) {
ll calc = ncr(i - 1, k - 1);
calc *= powmod(25, i - k, mod);
calc %= mod;
calc *= powmod(26, n + k - i, mod);
calc %= mod;
ans += calc;
ans %= mod;
}
plld(ans);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pcc pair<char, char>
#define vi vector<int>
#define vl vector<ll>
#define sd(x) scanf("%d", &x)
#define slld(x) scanf("%lld", &x)
#define pd(x) printf("%d", x)
#define plld(x) printf("%lld", x)
#define pds(x) printf("%d ", x)
#define pllds(x) printf("%lld ", x)
#define pdn(x) printf("%d\n", x)
#define plldn(x) printf("%lld\n", x)
#define INF 2e9
#define INFLL 4e18
using namespace std;
ll powmod(ll base, ll exponent, ll mod) { // with mod < 1e9
ll ans = 1;
while (exponent) {
if (exponent & 1)
ans = (ans * base) % mod;
base = (base * base) % mod;
exponent /= 2;
}
return ans;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
else
return gcd(b, a % b);
}
const int upperlimit = 2e6 + 100;
const int mod = 1e9 + 7;
ll fact[upperlimit];
ll invfact[upperlimit];
ll ncr(int n, int r) {
ll ans = fact[n];
ans *= invfact[r];
ans %= mod;
ans *= invfact[n - r];
ans %= mod;
return ans;
}
int main() {
// freopen(".in","r",stdin);freopen(".out","w",stdout);
fact[0] = 1;
invfact[0] = 1;
for (int i = 1; i < upperlimit; i++) {
fact[i] = fact[i - 1];
fact[i] *= i;
fact[i] %= mod;
invfact[i] = powmod(fact[i], mod - 2, mod);
}
int n;
string s;
cin >> n >> s;
int k = s.size();
ll ans = 0;
for (int i = k; i <= n + k; i++) {
ll calc = ncr(i - 1, k - 1);
calc *= powmod(25, i - k, mod);
calc %= mod;
calc *= powmod(26, n + k - i, mod);
calc %= mod;
ans += calc;
ans %= mod;
}
plld(ans);
return 0;
} | replace | 38 | 39 | 38 | 39 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
static const long long mod = 1000000007;
struct mint {
long long x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
(x += a.x) %= mod;
return *this;
}
mint &operator-=(const mint a) {
(x += mod - a.x) %= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint ret(*this);
return ret += a;
}
mint operator-(const mint a) const {
mint ret(*this);
return ret -= a;
}
mint operator*(const mint a) const {
mint ret(*this);
return ret *= a;
}
mint pow(ll t) const {
if (t == 0)
return mint(1);
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint ret(*this);
return ret /= a;
}
};
ostream &operator<<(ostream &os, const mint &x) {
os << x.x;
return os;
}
class modutils {
vector<mint> fact, invfact;
public:
modutils(int n = 1000005) : fact(n + 1), invfact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i;
invfact[n] = fact[n].inv();
for (int i = n; i >= 1; i--)
invfact[i - 1] = invfact[i] * i;
}
mint pow(mint x, ll n) { return x.pow(n); }
mint comb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[k] * invfact[n - k];
}
mint perm(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[n - k];
}
mint fac(ll n) { return fact[n]; }
};
modutils mutil;
int main() {
ll K;
string S;
cin >> K;
cin >> S;
ll N = S.size();
mint ret(0);
for (ll x = 0; x <= K; x++) {
mint tmp(1);
tmp *= mutil.comb(N - 1 + K - x, K - x);
tmp *= mutil.pow(25, K - x);
tmp *= mutil.pow(26, x);
ret += tmp;
}
cout << ret << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define REP(i, a, n) for (int i = (a); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define FOR(it, c) \
for (__typeof((c).begin()) it = (c).begin(); it != (c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;
static const long long mod = 1000000007;
struct mint {
long long x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
(x += a.x) %= mod;
return *this;
}
mint &operator-=(const mint a) {
(x += mod - a.x) %= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint ret(*this);
return ret += a;
}
mint operator-(const mint a) const {
mint ret(*this);
return ret -= a;
}
mint operator*(const mint a) const {
mint ret(*this);
return ret *= a;
}
mint pow(ll t) const {
if (t == 0)
return mint(1);
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint ret(*this);
return ret /= a;
}
};
ostream &operator<<(ostream &os, const mint &x) {
os << x.x;
return os;
}
class modutils {
vector<mint> fact, invfact;
public:
modutils(int n = 2000005) : fact(n + 1), invfact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i;
invfact[n] = fact[n].inv();
for (int i = n; i >= 1; i--)
invfact[i - 1] = invfact[i] * i;
}
mint pow(mint x, ll n) { return x.pow(n); }
mint comb(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[k] * invfact[n - k];
}
mint perm(ll n, ll k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact[n] * invfact[n - k];
}
mint fac(ll n) { return fact[n]; }
};
modutils mutil;
int main() {
ll K;
string S;
cin >> K;
cin >> S;
ll N = S.size();
mint ret(0);
for (ll x = 0; x <= K; x++) {
mint tmp(1);
tmp *= mutil.comb(N - 1 + K - x, K - x);
tmp *= mutil.pow(25, K - x);
tmp *= mutil.pow(26, x);
ret += tmp;
}
cout << ret << endl;
return 0;
}
| replace | 64 | 65 | 64 | 65 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define mp make_pair
#define v vector
#define inp_push(no, v) \
ll no; \
cin >> no; \
v.push_back(no);
#define pb push_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define UN(v) \
sort((v).begin(), (v).end()), v.erase(unique(v.begin(), v.end()), v.end())
#define N 1000006
#define mod 1000000007
#define INF INT64_MAX
//////////////////////////IMPORTANT
///FUNCTIONS/////////////////////////////////////////////
/* Guidlines berfore submitting solution
1. Check N value before submitting
2. Check all constant kind of values you are using. Might give WA. Think
3. Check mod value
*/
v<ll> fact(N);
v<ll> prime_check(1e7 + 2);
v<ll> primes;
long long powmod(long long x, long long y, long long m) {
long long res = 1LL;
while (y) {
if (y & 1)
res = (res * x) % m;
x = (x * x) % m;
y /= 2;
}
return res;
}
void init_fact() {
fact[0] = 1;
for (ll i = 1; i < N; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
}
ll C(ll n, ll r) {
if (n < r)
return 0;
ll temp = fact[n] * powmod(fact[r], mod - 2, mod) % mod;
temp *= powmod(fact[n - r], mod - 2, mod);
temp %= mod;
return temp;
}
void Sieve() {
for (ll i = 2; i <= 1e7 + 1; i++) {
if (prime_check[i])
continue;
primes.pb(i);
for (ll j = 2 * i; j <= 1e7 + 1; j += i)
prime_check[j] = i;
}
}
ll phi(ll n) {
ll i, res = n;
for (i = 2; i * i <= n; i++)
if (n % i == 0) {
while (n % i == 0)
n /= i;
res -= res / i;
}
if (n > 1)
res -= res / n;
return res;
}
/////////////////////////////////////START CODE
///HERE/////////////////////////////////////////////
ll k, n;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
init_fact();
// Sieve();
cin >> k >> s;
n = s.size();
ll ans = 0;
for (ll i = 0; i <= k; i++) {
ll temp = (C(n + k - i - 1, n - 1) *
((powmod(26, i, mod) * powmod(25, k - i, mod)) % mod));
// cout << C(n + k - i - 1, n - 1) << " " << n + k - i - 1 << " " << n - 1;
ans = (ans + temp) % mod;
}
cout << ans << "\n";
} | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define mp make_pair
#define v vector
#define inp_push(no, v) \
ll no; \
cin >> no; \
v.push_back(no);
#define pb push_back
#define fi first
#define se second
#define ALL(v) v.begin(), v.end()
#define UN(v) \
sort((v).begin(), (v).end()), v.erase(unique(v.begin(), v.end()), v.end())
#define N 2000006
#define mod 1000000007
#define INF INT64_MAX
//////////////////////////IMPORTANT
///FUNCTIONS/////////////////////////////////////////////
/* Guidlines berfore submitting solution
1. Check N value before submitting
2. Check all constant kind of values you are using. Might give WA. Think
3. Check mod value
*/
v<ll> fact(N);
v<ll> prime_check(1e7 + 2);
v<ll> primes;
long long powmod(long long x, long long y, long long m) {
long long res = 1LL;
while (y) {
if (y & 1)
res = (res * x) % m;
x = (x * x) % m;
y /= 2;
}
return res;
}
void init_fact() {
fact[0] = 1;
for (ll i = 1; i < N; i++) {
fact[i] = (fact[i - 1] * i) % mod;
}
}
ll C(ll n, ll r) {
if (n < r)
return 0;
ll temp = fact[n] * powmod(fact[r], mod - 2, mod) % mod;
temp *= powmod(fact[n - r], mod - 2, mod);
temp %= mod;
return temp;
}
void Sieve() {
for (ll i = 2; i <= 1e7 + 1; i++) {
if (prime_check[i])
continue;
primes.pb(i);
for (ll j = 2 * i; j <= 1e7 + 1; j += i)
prime_check[j] = i;
}
}
ll phi(ll n) {
ll i, res = n;
for (i = 2; i * i <= n; i++)
if (n % i == 0) {
while (n % i == 0)
n /= i;
res -= res / i;
}
if (n > 1)
res -= res / n;
return res;
}
/////////////////////////////////////START CODE
///HERE/////////////////////////////////////////////
ll k, n;
string s;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
init_fact();
// Sieve();
cin >> k >> s;
n = s.size();
ll ans = 0;
for (ll i = 0; i <= k; i++) {
ll temp = (C(n + k - i - 1, n - 1) *
((powmod(26, i, mod) * powmod(25, k - i, mod)) % mod));
// cout << C(n + k - i - 1, n - 1) << " " << n + k - i - 1 << " " << n - 1;
ans = (ans + temp) % mod;
}
cout << ans << "\n";
} | replace | 17 | 18 | 17 | 18 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define SZ(x) (int)x.size()
#define ll long long
#define pb push_back
#define pq priority_queue
#define pii pair<int, int>
#define mod 1000000007
#define inf 0x3f3f3f3f
#define debug(x) cerr << #x << "=" << x << '\n'
#define rep(i, a, b) for (int i = a; i < (b); i++)
const int maxn = 1e6 + 10;
int n, m;
ll fac[maxn];
ll p0w(ll base, int p) {
ll res = 1;
while (p) {
if (p % 2 == 1)
res *= base, res %= mod;
base = base * base % mod;
p >>= 1;
}
return res;
}
ll C(int x, int y) {
return fac[x] * p0w(fac[x - y], mod - 2) % mod * p0w(fac[y], mod - 2) % mod;
}
int main() {
std::ios::sync_with_stdio(false);
fac[0] = 1;
rep(i, 1, maxn) fac[i] = fac[i - 1] * (ll)i % mod;
cin >> n;
string s;
cin >> s;
n += SZ(s);
int m = SZ(s);
ll ans = 0;
for (int i = m; i <= n; i++) {
ans += C(i - 1, m - 1) * p0w(25, i - m) % mod * p0w(26, n - i) % mod;
ans %= mod;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define SZ(x) (int)x.size()
#define ll long long
#define pb push_back
#define pq priority_queue
#define pii pair<int, int>
#define mod 1000000007
#define inf 0x3f3f3f3f
#define debug(x) cerr << #x << "=" << x << '\n'
#define rep(i, a, b) for (int i = a; i < (b); i++)
const int maxn = 3e6 + 10;
int n, m;
ll fac[maxn];
ll p0w(ll base, int p) {
ll res = 1;
while (p) {
if (p % 2 == 1)
res *= base, res %= mod;
base = base * base % mod;
p >>= 1;
}
return res;
}
ll C(int x, int y) {
return fac[x] * p0w(fac[x - y], mod - 2) % mod * p0w(fac[y], mod - 2) % mod;
}
int main() {
std::ios::sync_with_stdio(false);
fac[0] = 1;
rep(i, 1, maxn) fac[i] = fac[i - 1] * (ll)i % mod;
cin >> n;
string s;
cin >> s;
n += SZ(s);
int m = SZ(s);
ll ans = 0;
for (int i = m; i <= n; i++) {
ans += C(i - 1, m - 1) * p0w(25, i - m) % mod * p0w(26, n - i) % mod;
ans %= mod;
}
cout << ans;
return 0;
}
| replace | 15 | 16 | 15 | 16 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<char>>;
using vbo = vector<bool>;
using vvbo = vector<vector<bool>>;
using vpii = vector<pair<int, int>>;
using pqsin = priority_queue<int, vector<int>, greater<int>>;
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define decp(n) cout << fixed << setprecision((int)n)
const ll inf = 1e9 + 7;
const ll INF = 1e18;
const int MAX = 1000010;
vll fac(MAX);
vll finv(MAX);
vll inv(MAX);
void combinit(ll m) {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
finv[1] = 1;
inv[1] = 1;
rep2(i, 2, MAX) {
fac[i] = fac[i - 1] * i % m;
inv[i] = m - inv[m % i] * (m / i) % m;
finv[i] = finv[i - 1] * inv[i] % m;
}
}
ll combi(ll n, ll k, ll m = inf) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % m) % m;
}
int main() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll ans = (ll)0, tmp = (ll)1;
vll tf(k + 1);
tf[0] = (ll)1;
rep(i, k) {
tf[i + 1] = tf[i] * (ll)25;
tf[i + 1] %= inf;
}
combinit(inf);
for (ll i = (ll)0; i <= k; i++) {
ans +=
(combi(n + k - i - (ll)1, n - (ll)1) * ((tf[k - i] * tmp) % inf)) % inf;
ans %= inf;
tmp *= (ll)26;
tmp %= inf;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vin = vector<int>;
using vll = vector<long long>;
using vvin = vector<vector<int>>;
using vvll = vector<vector<long long>>;
using vstr = vector<string>;
using vvstr = vector<vector<string>>;
using vch = vector<char>;
using vvch = vector<vector<char>>;
using vbo = vector<bool>;
using vvbo = vector<vector<bool>>;
using vpii = vector<pair<int, int>>;
using pqsin = priority_queue<int, vector<int>, greater<int>>;
#define mp make_pair
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define decp(n) cout << fixed << setprecision((int)n)
const ll inf = 1e9 + 7;
const ll INF = 1e18;
const int MAX = 2000010;
vll fac(MAX);
vll finv(MAX);
vll inv(MAX);
void combinit(ll m) {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
finv[1] = 1;
inv[1] = 1;
rep2(i, 2, MAX) {
fac[i] = fac[i - 1] * i % m;
inv[i] = m - inv[m % i] * (m / i) % m;
finv[i] = finv[i - 1] * inv[i] % m;
}
}
ll combi(ll n, ll k, ll m = inf) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % m) % m;
}
int main() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll ans = (ll)0, tmp = (ll)1;
vll tf(k + 1);
tf[0] = (ll)1;
rep(i, k) {
tf[i + 1] = tf[i] * (ll)25;
tf[i + 1] %= inf;
}
combinit(inf);
for (ll i = (ll)0; i <= k; i++) {
ans +=
(combi(n + k - i - (ll)1, n - (ll)1) * ((tf[k - i] * tmp) % inf)) % inf;
ans %= inf;
tmp *= (ll)26;
tmp %= inf;
}
cout << ans << endl;
} | replace | 23 | 24 | 23 | 24 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1000000 + 5, yzh = 1e9 + 7;
int k, n, fac[N], ifac[N];
char ch[N];
int quick_pow(int a, int b) {
int ans = 1;
while (b) {
if (b & 1)
ans = 1ll * a * ans % yzh;
b >>= 1, a = 1ll * a * a % yzh;
}
return ans;
}
int C(int n, int m) { return 1ll * fac[n] * ifac[m] % yzh * ifac[n - m] % yzh; }
int main() {
scanf("%d%s", &k, ch + 1);
n = strlen(ch + 1);
ifac[0] = ifac[1] = fac[0] = 1;
for (int i = 2; i <= n + k; i++)
ifac[i] = -1ll * yzh / i * ifac[yzh % i] % yzh;
for (int i = 1; i <= n + k; i++) {
fac[i] = 1ll * fac[i - 1] * i % yzh;
ifac[i] = 1ll * ifac[i] * ifac[i - 1] % yzh;
}
int ans = 0;
for (int i = 0; i <= k; i++)
(ans += 1ll * quick_pow(25, k - i) * quick_pow(26, i) % yzh *
C(n + k - i - 1, n - 1) % yzh) %= yzh;
printf("%d\n", (ans + yzh) % yzh);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int N = 2000000 + 5, yzh = 1e9 + 7;
int k, n, fac[N], ifac[N];
char ch[N];
int quick_pow(int a, int b) {
int ans = 1;
while (b) {
if (b & 1)
ans = 1ll * a * ans % yzh;
b >>= 1, a = 1ll * a * a % yzh;
}
return ans;
}
int C(int n, int m) { return 1ll * fac[n] * ifac[m] % yzh * ifac[n - m] % yzh; }
int main() {
scanf("%d%s", &k, ch + 1);
n = strlen(ch + 1);
ifac[0] = ifac[1] = fac[0] = 1;
for (int i = 2; i <= n + k; i++)
ifac[i] = -1ll * yzh / i * ifac[yzh % i] % yzh;
for (int i = 1; i <= n + k; i++) {
fac[i] = 1ll * fac[i - 1] * i % yzh;
ifac[i] = 1ll * ifac[i] * ifac[i - 1] % yzh;
}
int ans = 0;
for (int i = 0; i <= k; i++)
(ans += 1ll * quick_pow(25, k - i) * quick_pow(26, i) % yzh *
C(n + k - i - 1, n - 1) % yzh) %= yzh;
printf("%d\n", (ans + yzh) % yzh);
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int dx[] = {0, 1, -1, 0, 1, -1, 1, -1}; // i<4:4way i<8:8way
int dy[] = {1, 0, 0, -1, 1, -1, -1, 1};
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
COMinit();
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
// n + k の長さの文字列について
// n 回元の文字列の要素を含めばいい
ll ans = 0;
for (int i = 0; i <= k; i++) {
// iはsの末尾以外に挿入する数
ll t = 1;
t *= modpow(25, i);
t %= mod;
t *= modpow(26, k - i);
t %= mod;
t *= COM(n - 1 + i, i);
t %= mod;
ans += t % mod;
ans %= mod;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
int dx[] = {0, 1, -1, 0, 1, -1, 1, -1}; // i<4:4way i<8:8way
int dy[] = {1, 0, 0, -1, 1, -1, -1, 1};
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
const int MAX = 5100000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
COMinit();
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
// n + k の長さの文字列について
// n 回元の文字列の要素を含めばいい
ll ans = 0;
for (int i = 0; i <= k; i++) {
// iはsの末尾以外に挿入する数
ll t = 1;
t *= modpow(25, i);
t %= mod;
t *= modpow(26, k - i);
t %= mod;
t *= COM(n - 1 + i, i);
t %= mod;
ans += t % mod;
ans %= mod;
}
cout << ans << endl;
} | replace | 27 | 28 | 27 | 28 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
#define MAX 1000001
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(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod = MOD) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll ans = 0;
COMinit();
for (int i = 0; i <= k; i++) {
ans +=
(COM(k + n - i - 1, n - 1) * modpow(25, k - i) % MOD) * modpow(26, i);
ans %= MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
#define MAX 2000001
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(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll mod = MOD) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
int main() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll ans = 0;
COMinit();
for (int i = 0; i <= k; i++) {
ans +=
(COM(k + n - i - 1, n - 1) * modpow(25, k - i) % MOD) * modpow(26, i);
ans %= MOD;
}
cout << ans << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
using namespace std;
using ll = int_fast64_t;
using pr = pair<ll, ll>;
using vll = vector<ll>;
using vpr = vector<pr>;
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
struct mint {
ll divisor = 1000000007;
ll val;
constexpr mint(ll v = 0) noexcept : val(v % divisor) {
if (val < 0)
val += divisor;
}
constexpr mint operator+(const mint &rhs) const noexcept {
return mint(*this) += rhs;
}
constexpr mint operator-(const mint &rhs) const noexcept {
return mint(*this) -= rhs;
}
constexpr mint operator*(const mint &rhs) const noexcept {
return mint(*this) *= rhs;
}
constexpr mint operator/(const mint &rhs) const noexcept {
return mint(*this) /= rhs;
}
constexpr mint operator~() const noexcept {
ll a = this->val, b = divisor, u = 1, v = 0;
while (b > 0) {
ll t = a / b;
a -= t * b;
u -= t * v;
ll c = a;
a = b;
b = c;
ll w = u;
u = v;
v = w;
}
if (u < 0)
u += divisor;
u %= divisor;
return u;
}
constexpr mint &operator+=(const mint &rhs) noexcept {
val += rhs.val;
if (val >= divisor)
val -= divisor;
return *this;
}
constexpr mint &operator-=(const mint &rhs) noexcept {
if (val < rhs.val)
val += divisor;
val -= rhs.val;
return *this;
}
constexpr mint &operator*=(const mint &rhs) noexcept {
val = val * rhs.val % divisor;
return *this;
}
constexpr mint &operator/=(const mint &rhs) noexcept {
val = val * (~(mint(rhs))).val % divisor;
return *this;
}
friend mint modpow(mint a, ll n) noexcept {
auto res = mint(1);
while (n > 0) {
if (n & 1)
res *= a;
a *= a;
n >>= 1;
}
return res;
}
friend std::ostream &operator<<(std::ostream &os, const mint &a) noexcept {
return os << a.val;
}
};
namespace combinatorics {
const int limit = 1000010;
const int mod = 1000000007;
bool initialized = false;
long long fac_table[limit], inv_table[limit], finv_table[limit];
void initialize() {
fac_table[0] = fac_table[1] = 1;
inv_table[1] = 1;
finv_table[0] = finv_table[1] = 1;
for (int i = 2; i < limit; i++) {
fac_table[i] = fac_table[i - 1] * i % mod;
inv_table[i] = mod - inv_table[mod % i] * (mod / i) % mod;
finv_table[i] = finv_table[i - 1] * inv_table[i] % mod;
}
initialized = true;
}
long long com(int n, int k) {
if (!initialized)
initialize();
if (n < k || n < 0 || k < 0)
return 0;
else
return fac_table[n] * (finv_table[k] * finv_table[n - k] % mod) % mod;
}
} // namespace combinatorics
using combinatorics::com;
void answer() {
int k;
string s;
cin >> k >> s;
int sz = s.size();
mint ans = 0;
REPC(i, sz, sz + k) {
mint cur = 1;
int lk = i - sz, rk = k - lk;
cur *= com(i - 1, sz - 1);
cur *= modpow(mint(25), lk);
cur *= modpow(mint(26), rk);
ans += cur;
}
cout << ans << "\n";
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
answer();
return 0;
} | #include <bits/stdc++.h>
#ifdef LOCAL
#include "lib/debug.hpp"
#else
#define debug(...) 1
#endif
#define ALL(a) (a).begin(), (a).end()
#define rep(i, n) REP(i, 0, (n))
#define repc(i, n) REPC(i, 0, (n))
#define REP(i, n, m) for (int i = (int)(n); i < (int)(m); i++)
#define REPC(i, n, m) for (int i = (int)(n); i <= (int)(m); i++)
#define REPCM(i, n, m) for (int i = (int)(n); i >= (int)(m); i--)
using namespace std;
using ll = int_fast64_t;
using pr = pair<ll, ll>;
using vll = vector<ll>;
using vpr = vector<pr>;
template <class T> inline bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
} else
return false;
}
template <class T> inline bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
} else
return false;
}
struct mint {
ll divisor = 1000000007;
ll val;
constexpr mint(ll v = 0) noexcept : val(v % divisor) {
if (val < 0)
val += divisor;
}
constexpr mint operator+(const mint &rhs) const noexcept {
return mint(*this) += rhs;
}
constexpr mint operator-(const mint &rhs) const noexcept {
return mint(*this) -= rhs;
}
constexpr mint operator*(const mint &rhs) const noexcept {
return mint(*this) *= rhs;
}
constexpr mint operator/(const mint &rhs) const noexcept {
return mint(*this) /= rhs;
}
constexpr mint operator~() const noexcept {
ll a = this->val, b = divisor, u = 1, v = 0;
while (b > 0) {
ll t = a / b;
a -= t * b;
u -= t * v;
ll c = a;
a = b;
b = c;
ll w = u;
u = v;
v = w;
}
if (u < 0)
u += divisor;
u %= divisor;
return u;
}
constexpr mint &operator+=(const mint &rhs) noexcept {
val += rhs.val;
if (val >= divisor)
val -= divisor;
return *this;
}
constexpr mint &operator-=(const mint &rhs) noexcept {
if (val < rhs.val)
val += divisor;
val -= rhs.val;
return *this;
}
constexpr mint &operator*=(const mint &rhs) noexcept {
val = val * rhs.val % divisor;
return *this;
}
constexpr mint &operator/=(const mint &rhs) noexcept {
val = val * (~(mint(rhs))).val % divisor;
return *this;
}
friend mint modpow(mint a, ll n) noexcept {
auto res = mint(1);
while (n > 0) {
if (n & 1)
res *= a;
a *= a;
n >>= 1;
}
return res;
}
friend std::ostream &operator<<(std::ostream &os, const mint &a) noexcept {
return os << a.val;
}
};
namespace combinatorics {
const int limit = 2000020;
const int mod = 1000000007;
bool initialized = false;
long long fac_table[limit], inv_table[limit], finv_table[limit];
void initialize() {
fac_table[0] = fac_table[1] = 1;
inv_table[1] = 1;
finv_table[0] = finv_table[1] = 1;
for (int i = 2; i < limit; i++) {
fac_table[i] = fac_table[i - 1] * i % mod;
inv_table[i] = mod - inv_table[mod % i] * (mod / i) % mod;
finv_table[i] = finv_table[i - 1] * inv_table[i] % mod;
}
initialized = true;
}
long long com(int n, int k) {
if (!initialized)
initialize();
if (n < k || n < 0 || k < 0)
return 0;
else
return fac_table[n] * (finv_table[k] * finv_table[n - k] % mod) % mod;
}
} // namespace combinatorics
using combinatorics::com;
void answer() {
int k;
string s;
cin >> k >> s;
int sz = s.size();
mint ans = 0;
REPC(i, sz, sz + k) {
mint cur = 1;
int lk = i - sz, rk = k - lk;
cur *= com(i - 1, sz - 1);
cur *= modpow(mint(25), lk);
cur *= modpow(mint(26), rk);
ans += cur;
}
cout << ans << "\n";
}
int main() {
std::ios::sync_with_stdio(false);
std::cin.tie(0);
answer();
return 0;
} | replace | 103 | 104 | 103 | 104 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long mpow(long long a, int n) {
if (n == 0)
return 1;
if (n == 1)
return a;
if (n % 2)
return (a * (mpow(a, n - 1) % mod)) % mod;
else {
long long tmp = mpow(a, n / 2) % mod;
return tmp * tmp % mod;
}
}
const int MAX = 1000001;
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 nCk(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
int k;
string s;
cin >> k >> s;
COMinit();
long long ans = 0;
for (int i = 0; i <= k; i++) {
ans = (ans + mpow(26, i) * mpow(25, k - i) % mod *
(nCk(s.size() + k - 1 - i, s.size() - 1)) % mod) %
mod;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
long long mpow(long long a, int n) {
if (n == 0)
return 1;
if (n == 1)
return a;
if (n % 2)
return (a * (mpow(a, n - 1) % mod)) % mod;
else {
long long tmp = mpow(a, n / 2) % mod;
return tmp * tmp % mod;
}
}
const int MAX = 2000006;
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 nCk(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
int k;
string s;
cin >> k >> s;
COMinit();
long long ans = 0;
for (int i = 0; i <= k; i++) {
ans = (ans + mpow(26, i) * mpow(25, k - i) % mod *
(nCk(s.size() + k - 1 - i, s.size() - 1)) % mod) %
mod;
}
cout << ans << endl;
return 0;
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
struct mint {
int64_t x;
mint(int64_t 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(int64_t n) const {
if (n == 0)
return 1;
mint t = pow(n >> 1);
t *= t;
if (n & 1)
t *= *this;
return t;
}
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; }
vector<mint> fac;
vector<mint> fac_inv;
vector<mint> inv;
void init_comb(int mx) {
fac = vector<mint>(mx + 1), fac_inv = vector<mint>(mx + 1),
inv = vector<mint>(mx + 1);
fac.at(0) = fac.at(1) = 1;
fac_inv.at(0) = fac_inv.at(1) = 1;
inv.at(1) = 1;
for (int i = 2; i <= mx; i++) {
fac.at(i) = fac.at(i - 1) * i;
inv.at(i) = -inv.at(MOD % i) * (MOD / i);
fac_inv.at(i) = fac_inv.at(i - 1) * inv.at(i);
}
}
mint comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac.at(n) * fac_inv.at(k) * fac_inv.at(n - k);
}
void solve(int K, string S) {
init_comb((int)1e6 + 1);
int len = K + S.size();
mint res = 0;
for (int r = 0; r <= K; r++) {
res +=
comb(len - r - 1, S.size() - 1) * mint(25).pow(K - r) * mint(26).pow(r);
}
cout << res << endl;
}
int main() {
int K;
cin >> K;
string S;
cin >> S;
solve(K, S);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
struct mint {
int64_t x;
mint(int64_t 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(int64_t n) const {
if (n == 0)
return 1;
mint t = pow(n >> 1);
t *= t;
if (n & 1)
t *= *this;
return t;
}
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; }
vector<mint> fac;
vector<mint> fac_inv;
vector<mint> inv;
void init_comb(int mx) {
fac = vector<mint>(mx + 1), fac_inv = vector<mint>(mx + 1),
inv = vector<mint>(mx + 1);
fac.at(0) = fac.at(1) = 1;
fac_inv.at(0) = fac_inv.at(1) = 1;
inv.at(1) = 1;
for (int i = 2; i <= mx; i++) {
fac.at(i) = fac.at(i - 1) * i;
inv.at(i) = -inv.at(MOD % i) * (MOD / i);
fac_inv.at(i) = fac_inv.at(i - 1) * inv.at(i);
}
}
mint comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac.at(n) * fac_inv.at(k) * fac_inv.at(n - k);
}
void solve(int K, string S) {
init_comb((int)1e6 * 2 + 1);
int len = K + S.size();
mint res = 0;
for (int r = 0; r <= K; r++) {
res +=
comb(len - r - 1, S.size() - 1) * mint(25).pow(K - r) * mint(26).pow(r);
}
cout << res << endl;
}
int main() {
int K;
cin >> K;
string S;
cin >> S;
solve(K, S);
return 0;
}
| replace | 66 | 67 | 66 | 67 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define Sz(a) ((int)(a).size())
const int maxn = 1000009;
const int MOD = 1e9 + 7;
int64_t fac[maxn], invfac[maxn];
int64_t pw(int64_t a, int64_t b) {
int64_t c = 1;
while (b) {
if (b & 1ll)
c = c * a % MOD;
b >>= 1;
a = a * a % MOD;
}
return c;
}
int64_t C(int a, int b) {
return fac[a] * invfac[b] % MOD * invfac[a - b] % MOD;
}
int main() {
#ifdef LOCAL
freopen("a.in", "r", stdin);
#endif
ios_base::sync_with_stdio(false), cout.tie(0), cin.tie(0);
fac[0] = 1;
for (int i = 1; i < maxn; ++i)
fac[i] = fac[i - 1] * i % MOD;
invfac[maxn - 1] = pw(fac[maxn - 1], MOD - 2);
for (int i = maxn - 2; i >= 0; --i)
invfac[i] = invfac[i + 1] * (i + 1) % MOD;
int K, n;
string s;
cin >> K >> s;
n = Sz(s);
int64_t ans = 1, deg = 1;
for (int i = 0; i < K; ++i) {
deg = deg * 25 % MOD;
ans = (ans * 26 + C(n + i, n - 1) * deg) % MOD;
}
cout << ans << "\n";
return 0;
}
// 2020.06.23 19:49:09
| #include <bits/stdc++.h>
using namespace std;
#define Sz(a) ((int)(a).size())
const int maxn = 2000009;
const int MOD = 1e9 + 7;
int64_t fac[maxn], invfac[maxn];
int64_t pw(int64_t a, int64_t b) {
int64_t c = 1;
while (b) {
if (b & 1ll)
c = c * a % MOD;
b >>= 1;
a = a * a % MOD;
}
return c;
}
int64_t C(int a, int b) {
return fac[a] * invfac[b] % MOD * invfac[a - b] % MOD;
}
int main() {
#ifdef LOCAL
freopen("a.in", "r", stdin);
#endif
ios_base::sync_with_stdio(false), cout.tie(0), cin.tie(0);
fac[0] = 1;
for (int i = 1; i < maxn; ++i)
fac[i] = fac[i - 1] * i % MOD;
invfac[maxn - 1] = pw(fac[maxn - 1], MOD - 2);
for (int i = maxn - 2; i >= 0; --i)
invfac[i] = invfac[i + 1] * (i + 1) % MOD;
int K, n;
string s;
cin >> K >> s;
n = Sz(s);
int64_t ans = 1, deg = 1;
for (int i = 0; i < K; ++i) {
deg = deg * 25 % MOD;
ans = (ans * 26 + C(n + i, n - 1) * deg) % MOD;
}
cout << ans << "\n";
return 0;
}
// 2020.06.23 19:49:09
| replace | 3 | 4 | 3 | 4 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll K;
cin >> K;
string S;
cin >> S;
ll N = S.size();
COMinit();
vector<ll> p25(K + 1), p26(K + 1);
p25[0] = 1;
p26[0] = 1;
REP(i, K) {
p25[i + 1] = (p25[i] * 25) % MOD;
p26[i + 1] = (p26[i] * 26) % MOD;
}
ll ans = 0;
REP(i, K + 1) {
ll t;
t = (p25[K - i] * p26[i]) % MOD;
t = (t * (COM(K - i + N - 1, N - 1))) % MOD;
ans = (ans + t) % MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPV(iter, v) \
for (auto(iter) = (v).begin(); (iter) != (v).end(); ++(iter))
#define ALL(v) (v).begin(), (v).end()
#define MOD 1000000007
using namespace std;
typedef long long ll;
const ll MAX = 2000001;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll K;
cin >> K;
string S;
cin >> S;
ll N = S.size();
COMinit();
vector<ll> p25(K + 1), p26(K + 1);
p25[0] = 1;
p26[0] = 1;
REP(i, K) {
p25[i + 1] = (p25[i] * 25) % MOD;
p26[i + 1] = (p26[i] * 26) % MOD;
}
ll ans = 0;
REP(i, K + 1) {
ll t;
t = (p25[K - i] * p26[i]) % MOD;
t = (t * (COM(K - i + N - 1, N - 1))) % MOD;
ans = (ans + t) % MOD;
}
cout << ans << endl;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
template <int64_t MOD> struct Mint {
int64_t v;
Mint() { v = 0; }
Mint(int64_t x) {
v = x % MOD;
if (v < 0)
v += MOD;
}
Mint operator-() { return Mint{-v}; };
Mint operator+(Mint x) { return Mint(v + x.v); };
Mint operator-(Mint x) { return Mint(v - x.v); };
Mint operator*(Mint x) { return Mint(v * x.v); };
Mint operator/(Mint x) { return Mint(v * pow(x.v, MOD - 2).v); };
Mint &operator+=(Mint x) { return *this = (*this + x); };
Mint &operator-=(Mint x) { return *this = (*this - x); };
Mint &operator*=(Mint x) { return *this = (*this * x); };
Mint &operator/=(Mint x) { return *this = (*this / x); };
static Mint pow(Mint base, int64_t exp) {
if (exp == 0)
return Mint(1);
return pow(base * base, exp / 2) * (exp & 1 ? base : Mint(1));
}
friend ostream &operator<<(ostream &os, Mint x) { return os << x.v; }
};
using mint = Mint<1000000007>;
template <class T> struct Counting {
Counting(int64_t n) {
_fact.assign(n + 1, 1);
for (int64_t i = 1; i <= n; i++)
_fact[i] = T(i) * _fact[i - 1];
}
T fact(int64_t n) {
assert(0 <= n && n < (int)_fact.size());
return _fact[n];
}
T perm(int64_t n, int64_t k) {
if (n < k)
return 0;
return fact(n) / fact(n - k);
}
T comb(int64_t n, int64_t k) {
if (n < k)
return 0;
return fact(n) / (fact(k) * fact(n - k));
}
private:
vector<T> _fact;
};
int main() {
Counting<mint> cnt(1123456);
lint K;
cin >> K;
string S;
cin >> S;
lint N = S.size();
mint sum = 0;
for (lint i = N; i <= N + K; i++) {
sum += cnt.comb(i - 1, N - 1) * mint::pow(25, i - N) *
mint::pow(26, N + K - i);
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
template <int64_t MOD> struct Mint {
int64_t v;
Mint() { v = 0; }
Mint(int64_t x) {
v = x % MOD;
if (v < 0)
v += MOD;
}
Mint operator-() { return Mint{-v}; };
Mint operator+(Mint x) { return Mint(v + x.v); };
Mint operator-(Mint x) { return Mint(v - x.v); };
Mint operator*(Mint x) { return Mint(v * x.v); };
Mint operator/(Mint x) { return Mint(v * pow(x.v, MOD - 2).v); };
Mint &operator+=(Mint x) { return *this = (*this + x); };
Mint &operator-=(Mint x) { return *this = (*this - x); };
Mint &operator*=(Mint x) { return *this = (*this * x); };
Mint &operator/=(Mint x) { return *this = (*this / x); };
static Mint pow(Mint base, int64_t exp) {
if (exp == 0)
return Mint(1);
return pow(base * base, exp / 2) * (exp & 1 ? base : Mint(1));
}
friend ostream &operator<<(ostream &os, Mint x) { return os << x.v; }
};
using mint = Mint<1000000007>;
template <class T> struct Counting {
Counting(int64_t n) {
_fact.assign(n + 1, 1);
for (int64_t i = 1; i <= n; i++)
_fact[i] = T(i) * _fact[i - 1];
}
T fact(int64_t n) {
assert(0 <= n && n < (int)_fact.size());
return _fact[n];
}
T perm(int64_t n, int64_t k) {
if (n < k)
return 0;
return fact(n) / fact(n - k);
}
T comb(int64_t n, int64_t k) {
if (n < k)
return 0;
return fact(n) / (fact(k) * fact(n - k));
}
private:
vector<T> _fact;
};
int main() {
Counting<mint> cnt(2123456);
lint K;
cin >> K;
string S;
cin >> S;
lint N = S.size();
mint sum = 0;
for (lint i = N; i <= N + K; i++) {
sum += cnt.comb(i - 1, N - 1) * mint::pow(25, i - N) *
mint::pow(26, N + K - i);
}
cout << sum << endl;
} | replace | 63 | 64 | 63 | 64 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 1e6 + 100;
int qpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b /= 2;
}
return res;
}
int inv(int x) { return qpow(x, MOD - 2); }
int fact[MAXN];
int comb(int n, int k) {
return fact[n] * inv(fact[n - k] * fact[k] % MOD) % MOD;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
for (int i = 1; i < MAXN; i++)
fact[i] = fact[i - 1] * i % MOD;
int K;
string S;
cin >> K >> S;
int N = S.size();
int tot = qpow(26, K + N);
for (int i = 0; i < N; i++) {
tot = (tot + MOD - comb(N + K, i) * qpow(25, N + K - i) % MOD) % MOD;
}
cout << tot << '\n';
return 0;
} | #include <bits/stdc++.h>
#define int long long
using namespace std;
const int MOD = 1e9 + 7;
const int MAXN = 2e6 + 100;
int qpow(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b /= 2;
}
return res;
}
int inv(int x) { return qpow(x, MOD - 2); }
int fact[MAXN];
int comb(int n, int k) {
return fact[n] * inv(fact[n - k] * fact[k] % MOD) % MOD;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
fact[0] = 1;
for (int i = 1; i < MAXN; i++)
fact[i] = fact[i - 1] * i % MOD;
int K;
string S;
cin >> K >> S;
int N = S.size();
int tot = qpow(26, K + N);
for (int i = 0; i < N; i++) {
tot = (tot + MOD - comb(N + K, i) * qpow(25, N + K - i) % MOD) % MOD;
}
cout << tot << '\n';
return 0;
} | replace | 8 | 9 | 8 | 9 | 0 | |
p02632 | 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 o_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;
#define mod 1000000007
#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
vl ft(1, 1LL);
/*======================================================================*/
ll power(ll x, ll y) {
ll res = 1;
x %= mod;
while (y > 0) {
if (y & 1)
res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res % mod;
}
void solve() {
fact(1000005);
int k;
string s;
cin >> k >> s;
int ans = 0, n = s.size();
rep(i, 0, k + 1) {
ans += (ncr(n + k, i + n) * power(25, k - i)) % mod;
if (ans >= mod)
ans -= mod;
}
cout << ans;
}
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 o_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;
#define mod 1000000007
#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
vl ft(1, 1LL);
/*======================================================================*/
ll power(ll x, ll y) {
ll res = 1;
x %= mod;
while (y > 0) {
if (y & 1)
res = (res * x) % mod;
y = y >> 1;
x = (x * x) % mod;
}
return res % mod;
}
void solve() {
fact(2000005);
int k;
string s;
cin >> k >> s;
int ans = 0, n = s.size();
rep(i, 0, k + 1) {
ans += (ncr(n + k, i + n) * power(25, k - i)) % mod;
if (ans >= mod)
ans -= mod;
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
solve();
}
} | replace | 53 | 54 | 53 | 54 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
const int MAX = 1100000;
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;
}
lint log_mul(lint base, lint bit) {
lint res = 0;
while (bit) {
if (bit & 1)
res = (res + base) % MOD;
base = (base + base) % MOD;
bit >>= 1;
}
return res;
}
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
lint k;
cin >> k;
string s;
cin >> s;
int n = s.size();
COMinit();
lint res = 0;
for (int x = 0; x <= k; x++) {
lint t;
t = COM(n - 1 + k - x, k - x);
t *= modpow(25, k - x);
t %= MOD;
t *= modpow(26, x);
t %= MOD;
res += t;
res %= MOD;
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long;
using P = pair<int, int>;
using vec = vector<int>;
using mat = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
constexpr int MOD = 1000000007;
const int INF = 1 << 30;
const int MAX = 2100000;
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;
}
lint log_mul(lint base, lint bit) {
lint res = 0;
while (bit) {
if (bit & 1)
res = (res + base) % MOD;
base = (base + base) % MOD;
bit >>= 1;
}
return res;
}
long long modpow(long long a, long long n) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
lint k;
cin >> k;
string s;
cin >> s;
int n = s.size();
COMinit();
lint res = 0;
for (int x = 0; x <= k; x++) {
lint t;
t = COM(n - 1 + k - x, k - x);
t *= modpow(25, k - x);
t %= MOD;
t *= modpow(26, x);
t %= MOD;
res += t;
res %= MOD;
}
cout << res << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | 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)
/*
We want to count the number of strings T of length |S|+K such that the given
string S is a subsequence of T. Let's fix T and try to build an algorithm to
check if S is a subsequence. Our algorithm if successful will return
a1,a2,...,a|S| such that Si=Tai. Let's build a in a way such that ai is minimum
possible for all i. Note that for each i<|S|, characters Tai+1,...,Tai+1−1 can't
be equal to Tai+1 (otherwise we can minimize ai+1), so for those characters we
have limited choices (only 25). Characters after a|S| can be anything (26
choices).
So, let's loop over how many characters will be after a|S|; let that number be
x. We have 26x choices for that suffix. For each of the other K−x characters, we
only have 25 choices, so we have 25K−x choices for them in total. Still, we have
to decide how to distribute these K−x characters. We have |S| slots for them (
before the first character of S, between the first and the second character,
...). Using stars and bars, we can distribute them in (|S|−1−k−x|S|−1) ways. So,
we will loop over x and add to the answer 25K−x∗26x∗(|S|−1−k−x|S|−1).
*/
/* ID: vqt
LANG: C++14
PROB: namenum
*/
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
// for PDBS use only:
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T> using o_set = tree<T, null_type, greater<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
// #define ordered_set tree<pair<ll,ll>, null_type,less<pair<ll,ll>>,
// rb_tree_tag,tree_order_statistics_node_update>
// defines
#define int long long
// #define double long double
#define vec vector
#define vi vector<int>
#define vvi vector<vector<int>>
#define ii pair<int, int>
#define F first
#define S second
#define MP make_pair
#define vii vector<ii>
#define PQ priority_queue
#define minPQ priority_queue<int, vt<int>, greater<int>>
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define ER equal_range
#define ALL(x) begin(x), end(x)
#define SZ(x) ((int)(x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define UNI(c) c.resize(distance(c.begin(), unique(c.begin(), c.end())));
#define SORT_UNI(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define POS(c, x) (lower_bound(c.begin(), c.end(), (x)) - c.begin())
#define max(a, b) ((a) < (b) ? b : a)
#define min(a, b) ((a) < (b) ? a : b)
#define setmin(a, b) a = min(a, b)
#define setmax(a, b) a = max(a, b)
#define MINMAX(x) minmax_element(begin(x), end(x))
// permanent constants
const long long INF64 = 1e18;
const int INF32 = 1e9;
const double EPS = static_cast<double>(1e-10);
const double PI = 2.0 * acos(0.0); // acos(-1.0L);
const int MOD = (int)1e9 + 7; // 998244353
ll powMod(ll a, ll b) {
ll res = 1;
a %= MOD;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
}
return res;
}
ll invMod(ll a) {
ll b = MOD, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return (MOD + u) % MOD;
}
const int day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
// random
mt19937 rnd(
239); //(chrono::high_resolution_clock::now().time_since_epoch().count());
// Tricks:
// Sort w Lambda Function: sort(begin(v), end(v), [] (int a, int b) { return a
// > b; }); Sort vector cua bo ba so: struct MyStr {int a, b, c;};
// vector<MyStr> v; ...fill v... sort(all(v), [](MyStr &A, MyStr &B) { return
// tie(A.a, A.b, A.c) < tie(B.a, B.b, B.c); });
#define odd(x) ((x)&1)
#define even(x) !((x)&1)
// vec - vector, p(x) - predicate so that p(x) = true for all elements of some
// prefix of vector vec and false on all others. To find the first place where
// p(x) doesn't hold one can simply use:
#define FIRST_FAIL(vec, p) partition_point(ALL(vec), p) - vec.begin()
// partition_point(begin, end, p) returns the first ITERATOR it that p(*it) =
// false
#define isIn(vec, key) binary_search(ALL(vec), key)
#define toBool(num) !!(num)
#define bin(N, num) cerr << bitset<N>(num) << "\n"
// vector a: tinh XOR sum tu l den r:
#define XORsum(a, l, r) \
accumulate(a.begin() + l - 1, a.begin() + r, 0, \
[](int x, int y) { return x ^ y; })
// BASIC STRING: just like vector but allows to use a few string member
// functions/operators: operator+ and operator+=.:
/* int n; basic_string<int> a;
cin >> n; FOR(i, 0, n) { int x; cin >> x; a += x; }
a += a; a = a.substr(n/2, n);
cout << (a + a).find({1, 2, 1}) << '\n';
*/
// count(a.begin(), a.end(), val) - count how many val in an array a
vector<int> prefixSum(vector<int> &a) {
vi b;
std::partial_sum(a.begin(), a.end(), b.begin());
return b;
}
int mostSignDigit(int n) {
double k = log10(n);
return (int)pow(10, k - floor(k));
}
int numOfDigits(int n) { return (int)floor(log10(n)) + 1; }
bool isPowerOfTwo(int x) {
return x && (!(x & (x - 1)));
} // first x is for the case x=0
bool allPositive(vector<int> &a) {
return all_of(begin(a), end(a), [](int x) { return x > 0; });
} // are all of the elements positive?
// CHECK there is all numbers in array is positive: bool ok=true; for(auto z: a)
// ok &= (z>0);
bool anyPositive(vector<int> &a) {
return any_of(begin(a), end(a), [](int x) { return x > 0; });
} // is there at least one positive element?
bool nonePositive(vector<int> &a) {
return none_of(begin(a), end(a), [](int x) { return x > 0; });
} // are none of the elements positive?
void FILEIO() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
// void FILEIO() { freopen("berries.in", "r", stdin); freopen("berries.out",
// "w", stdout); } // USACO
/****************** DEBUG *******************/
// Universal DEBUG: https://codeforces.com/blog/entry/68809
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
// void __print(long long x) {cerr << x;}
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "T" : "F"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
// #define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
//********************** Codes go here *********************/
//************ MODULAR ARITHMETIC LIB ***************************/
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept
: val(v % MOD) { // dinh nghia Fp(v) = (v % MOD)
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; } // get MOD
constexpr Fp operator-() const noexcept {
return val ? MOD - val : 0;
} // phep toan "-"
constexpr Fp operator+(const Fp &r) const noexcept {
return Fp(*this) += r;
} // phep toan "+="
constexpr Fp operator-(const Fp &r) const noexcept {
return Fp(*this) -= r;
} // phep toan "-="
constexpr Fp operator*(const Fp &r) const noexcept {
return Fp(*this) *= r;
} // phep toan "*="
constexpr Fp operator/(const Fp &r) const noexcept {
return Fp(*this) /= r;
} // phep toan "/="
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 { // dinh nghia phep chia, dung thuat toan inverse
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
template <class T> struct BiCoef { // tinh C(k, n)
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(); // thuong trong code se co global const nay
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i; // i!
inv_[i] = -inv_[MOD % i] * (MOD / i); // inverse cua so i
finv_[i] = finv_[i - 1] * inv_[i]; // factorial inverse
}
}
constexpr T C(int k, int n) const noexcept { // tinh C(k, n)
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
// const int MOD = 1000000007;
using mint = Fp<MOD>; // mint = modular int
BiCoef<mint> bc; // tao class de tinh C(k, n)
void preCalc() {
bc.init(1000050);
} // precompute tat ca C(k,n) voi n = 500050, k = 1, n
void solve() {
int k;
string s;
cin >> k >> s;
int n = s.length();
preCalc();
mint sum = 0;
FORE(x, 0, k) {
mint a = powMod(26, x) * powMod(25, k - x) % MOD;
sum += a * bc.C(k - x, k - x + n - 1);
;
}
cout << sum << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie();
// FILEIO();
// auto beginProgram = chrono::steady_clock::now();
// preCalc(); // any 1-time precalculation need to do before many test cases?
// int t; cin >> t; FORE(i, 1, t)
{
// cout << "Case #" << i << ": "; // Google CodeJam style
solve();
}
// auto endProgram = chrono::steady_clock::now();
// cerr << chrono::duration_cast<chrono::milliseconds>(endProgram -
// beginProgram).count() << " ms" << endl;
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)
/*
We want to count the number of strings T of length |S|+K such that the given
string S is a subsequence of T. Let's fix T and try to build an algorithm to
check if S is a subsequence. Our algorithm if successful will return
a1,a2,...,a|S| such that Si=Tai. Let's build a in a way such that ai is minimum
possible for all i. Note that for each i<|S|, characters Tai+1,...,Tai+1−1 can't
be equal to Tai+1 (otherwise we can minimize ai+1), so for those characters we
have limited choices (only 25). Characters after a|S| can be anything (26
choices).
So, let's loop over how many characters will be after a|S|; let that number be
x. We have 26x choices for that suffix. For each of the other K−x characters, we
only have 25 choices, so we have 25K−x choices for them in total. Still, we have
to decide how to distribute these K−x characters. We have |S| slots for them (
before the first character of S, between the first and the second character,
...). Using stars and bars, we can distribute them in (|S|−1−k−x|S|−1) ways. So,
we will loop over x and add to the answer 25K−x∗26x∗(|S|−1−k−x|S|−1).
*/
/* ID: vqt
LANG: C++14
PROB: namenum
*/
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <unistd.h>
using namespace std;
// for PDBS use only:
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
// template <typename T> using o_set = tree<T, null_type, greater<T>,
// rb_tree_tag, tree_order_statistics_node_update>;
typedef long long ll;
// #define ordered_set tree<pair<ll,ll>, null_type,less<pair<ll,ll>>,
// rb_tree_tag,tree_order_statistics_node_update>
// defines
#define int long long
// #define double long double
#define vec vector
#define vi vector<int>
#define vvi vector<vector<int>>
#define ii pair<int, int>
#define F first
#define S second
#define MP make_pair
#define vii vector<ii>
#define PQ priority_queue
#define minPQ priority_queue<int, vt<int>, greater<int>>
#define PB push_back
#define LB lower_bound
#define UB upper_bound
#define ER equal_range
#define ALL(x) begin(x), end(x)
#define SZ(x) ((int)(x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define FORE(i, a, b) for (int i = (a); i <= (b); i++)
#define FORD(i, a, b) for (int i = (a); i >= (b); i--)
#define UNI(c) c.resize(distance(c.begin(), unique(c.begin(), c.end())));
#define SORT_UNI(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define POS(c, x) (lower_bound(c.begin(), c.end(), (x)) - c.begin())
#define max(a, b) ((a) < (b) ? b : a)
#define min(a, b) ((a) < (b) ? a : b)
#define setmin(a, b) a = min(a, b)
#define setmax(a, b) a = max(a, b)
#define MINMAX(x) minmax_element(begin(x), end(x))
// permanent constants
const long long INF64 = 1e18;
const int INF32 = 1e9;
const double EPS = static_cast<double>(1e-10);
const double PI = 2.0 * acos(0.0); // acos(-1.0L);
const int MOD = (int)1e9 + 7; // 998244353
ll powMod(ll a, ll b) {
ll res = 1;
a %= MOD;
assert(b >= 0);
for (; b; b >>= 1) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
}
return res;
}
ll invMod(ll a) {
ll b = MOD, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
return (MOD + u) % MOD;
}
const int day[12] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
// random
mt19937 rnd(
239); //(chrono::high_resolution_clock::now().time_since_epoch().count());
// Tricks:
// Sort w Lambda Function: sort(begin(v), end(v), [] (int a, int b) { return a
// > b; }); Sort vector cua bo ba so: struct MyStr {int a, b, c;};
// vector<MyStr> v; ...fill v... sort(all(v), [](MyStr &A, MyStr &B) { return
// tie(A.a, A.b, A.c) < tie(B.a, B.b, B.c); });
#define odd(x) ((x)&1)
#define even(x) !((x)&1)
// vec - vector, p(x) - predicate so that p(x) = true for all elements of some
// prefix of vector vec and false on all others. To find the first place where
// p(x) doesn't hold one can simply use:
#define FIRST_FAIL(vec, p) partition_point(ALL(vec), p) - vec.begin()
// partition_point(begin, end, p) returns the first ITERATOR it that p(*it) =
// false
#define isIn(vec, key) binary_search(ALL(vec), key)
#define toBool(num) !!(num)
#define bin(N, num) cerr << bitset<N>(num) << "\n"
// vector a: tinh XOR sum tu l den r:
#define XORsum(a, l, r) \
accumulate(a.begin() + l - 1, a.begin() + r, 0, \
[](int x, int y) { return x ^ y; })
// BASIC STRING: just like vector but allows to use a few string member
// functions/operators: operator+ and operator+=.:
/* int n; basic_string<int> a;
cin >> n; FOR(i, 0, n) { int x; cin >> x; a += x; }
a += a; a = a.substr(n/2, n);
cout << (a + a).find({1, 2, 1}) << '\n';
*/
// count(a.begin(), a.end(), val) - count how many val in an array a
vector<int> prefixSum(vector<int> &a) {
vi b;
std::partial_sum(a.begin(), a.end(), b.begin());
return b;
}
int mostSignDigit(int n) {
double k = log10(n);
return (int)pow(10, k - floor(k));
}
int numOfDigits(int n) { return (int)floor(log10(n)) + 1; }
bool isPowerOfTwo(int x) {
return x && (!(x & (x - 1)));
} // first x is for the case x=0
bool allPositive(vector<int> &a) {
return all_of(begin(a), end(a), [](int x) { return x > 0; });
} // are all of the elements positive?
// CHECK there is all numbers in array is positive: bool ok=true; for(auto z: a)
// ok &= (z>0);
bool anyPositive(vector<int> &a) {
return any_of(begin(a), end(a), [](int x) { return x > 0; });
} // is there at least one positive element?
bool nonePositive(vector<int> &a) {
return none_of(begin(a), end(a), [](int x) { return x > 0; });
} // are none of the elements positive?
void FILEIO() {
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
}
// void FILEIO() { freopen("berries.in", "r", stdin); freopen("berries.out",
// "w", stdout); } // USACO
/****************** DEBUG *******************/
// Universal DEBUG: https://codeforces.com/blog/entry/68809
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
// void __print(long long x) {cerr << x;}
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "T" : "F"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
// #define ONLINE_JUDGE
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
//********************** Codes go here *********************/
//************ MODULAR ARITHMETIC LIB ***************************/
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept
: val(v % MOD) { // dinh nghia Fp(v) = (v % MOD)
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; } // get MOD
constexpr Fp operator-() const noexcept {
return val ? MOD - val : 0;
} // phep toan "-"
constexpr Fp operator+(const Fp &r) const noexcept {
return Fp(*this) += r;
} // phep toan "+="
constexpr Fp operator-(const Fp &r) const noexcept {
return Fp(*this) -= r;
} // phep toan "-="
constexpr Fp operator*(const Fp &r) const noexcept {
return Fp(*this) *= r;
} // phep toan "*="
constexpr Fp operator/(const Fp &r) const noexcept {
return Fp(*this) /= r;
} // phep toan "/="
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 { // dinh nghia phep chia, dung thuat toan inverse
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
template <class T> struct BiCoef { // tinh C(k, n)
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(); // thuong trong code se co global const nay
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i; // i!
inv_[i] = -inv_[MOD % i] * (MOD / i); // inverse cua so i
finv_[i] = finv_[i - 1] * inv_[i]; // factorial inverse
}
}
constexpr T C(int k, int n) const noexcept { // tinh C(k, n)
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
// const int MOD = 1000000007;
using mint = Fp<MOD>; // mint = modular int
BiCoef<mint> bc; // tao class de tinh C(k, n)
void preCalc() {
bc.init(2000050);
} // precompute tat ca C(k,n) voi n = 500050, k = 1, n
void solve() {
int k;
string s;
cin >> k >> s;
int n = s.length();
preCalc();
mint sum = 0;
FORE(x, 0, k) {
mint a = powMod(26, x) * powMod(25, k - x) % MOD;
sum += a * bc.C(k - x, k - x + n - 1);
;
}
cout << sum << endl;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie();
// FILEIO();
// auto beginProgram = chrono::steady_clock::now();
// preCalc(); // any 1-time precalculation need to do before many test cases?
// int t; cin >> t; FORE(i, 1, t)
{
// cout << "Case #" << i << ": "; // Google CodeJam style
solve();
}
// auto endProgram = chrono::steady_clock::now();
// cerr << chrono::duration_cast<chrono::milliseconds>(endProgram -
// beginProgram).count() << " ms" << endl;
return 0;
} | replace | 343 | 344 | 343 | 344 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
#define fast ios_base::sync_with_stdio(false)
#define mxn (ll)(1e5 + 5)
#define mod (ll)(1e9 + 7)
#define mod1 (ll)(998244353)
#define ll long long int
#define ld long double
#define vi vector<ll>
#define vvi vector<vi>
#define pi pair<ll, ll>
#define vvpi vector<vector<pi>>
#define vpi vector<pi>
#define vppi vector<pair<ll, pi>>
#define vs vector<string>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define fs first
#define se second
#define crz(v, n) v.clear(), v.resize(n + 1, 0)
#define print(v) \
for (ll it = 0; it < v.size(); it++) \
cout << v[it] << " "; \
cout << endl
#define printp(v) \
for (ll it = 0; it < v.size(); it++) \
cout << v[it].first << " " << v[it].second << endl
using namespace std;
vi fact(mxn, 1);
ll powe(ll x, ll y) {
ll s = 1;
while (y) {
if (y % 2)
s = (s * x) % mod;
y /= 2;
x = (x * x) % mod;
}
return s;
}
ll ncr(ll n, ll r) {
ll den = (powe(fact[r], mod - 2) * powe(fact[n - r], mod - 2)) % mod;
return (fact[n] * den) % mod;
}
int main() {
fast;
int k;
string s;
cin >> k >> s;
int n = s.size() + k, i;
for (i = 1; i <= n; i++)
fact[i] = (fact[i - 1] * i) % mod;
ll c = powe(26, n);
for (i = 0; i < (int)s.size(); i++) {
ll x = (powe(25, n - i) * ncr(n, i)) % mod;
c = (c - x + mod) % mod;
}
cout << c << endl;
}
| #include <algorithm>
#include <assert.h>
#include <cmath>
#include <cstdio>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <vector>
#define fast ios_base::sync_with_stdio(false)
#define mxn (ll)(2e6 + 5)
#define mod (ll)(1e9 + 7)
#define mod1 (ll)(998244353)
#define ll long long int
#define ld long double
#define vi vector<ll>
#define vvi vector<vi>
#define pi pair<ll, ll>
#define vvpi vector<vector<pi>>
#define vpi vector<pi>
#define vppi vector<pair<ll, pi>>
#define vs vector<string>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define pb push_back
#define eb emplace_back
#define mkp make_pair
#define fs first
#define se second
#define crz(v, n) v.clear(), v.resize(n + 1, 0)
#define print(v) \
for (ll it = 0; it < v.size(); it++) \
cout << v[it] << " "; \
cout << endl
#define printp(v) \
for (ll it = 0; it < v.size(); it++) \
cout << v[it].first << " " << v[it].second << endl
using namespace std;
vi fact(mxn, 1);
ll powe(ll x, ll y) {
ll s = 1;
while (y) {
if (y % 2)
s = (s * x) % mod;
y /= 2;
x = (x * x) % mod;
}
return s;
}
ll ncr(ll n, ll r) {
ll den = (powe(fact[r], mod - 2) * powe(fact[n - r], mod - 2)) % mod;
return (fact[n] * den) % mod;
}
int main() {
fast;
int k;
string s;
cin >> k >> s;
int n = s.size() + k, i;
for (i = 1; i <= n; i++)
fact[i] = (fact[i - 1] * i) % mod;
ll c = powe(26, n);
for (i = 0; i < (int)s.size(); i++) {
ll x = (powe(25, n - i) * ncr(n, i)) % mod;
c = (c - x + mod) % mod;
}
cout << c << endl;
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 2e5 + 555;
const int MOD = 1e9 + 7;
ll xpow(ll a, ll b) {
ll ret = 1;
a %= MOD;
assert(b >= 0);
while (b) {
if (b & 1)
ret = ret * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return ret;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.precision(10);
cout << fixed;
static ll inv[maxn + 555], invp[maxn + 555], p[maxn + 555];
inv[1] = 1;
for (int i = 2; i <= maxn; i++)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
p[0] = 1;
for (int i = 1; i <= maxn; i++)
p[i] = p[i - 1] * i % MOD;
invp[0] = 1;
for (int i = 1; i <= maxn; i++)
invp[i] = invp[i - 1] * inv[i] % MOD;
auto C = [&](int a, int b) -> ll {
if (a < b)
return 0;
else
return p[a] * invp[b] % MOD * invp[a - b] % MOD;
};
int n;
string s;
cin >> n >> s;
ll ans = 0;
int tot = n + (int)s.size();
for (int i = (int)s.size(); i <= tot; i++) {
// 枚举放i个a，剩下地方放b..z
(ans += C(tot, i) * xpow(25, tot - i)) %= MOD;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int maxn = 2e6 + 555;
const int MOD = 1e9 + 7;
ll xpow(ll a, ll b) {
ll ret = 1;
a %= MOD;
assert(b >= 0);
while (b) {
if (b & 1)
ret = ret * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return ret;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cout.precision(10);
cout << fixed;
static ll inv[maxn + 555], invp[maxn + 555], p[maxn + 555];
inv[1] = 1;
for (int i = 2; i <= maxn; i++)
inv[i] = inv[MOD % i] * (MOD - MOD / i) % MOD;
p[0] = 1;
for (int i = 1; i <= maxn; i++)
p[i] = p[i - 1] * i % MOD;
invp[0] = 1;
for (int i = 1; i <= maxn; i++)
invp[i] = invp[i - 1] * inv[i] % MOD;
auto C = [&](int a, int b) -> ll {
if (a < b)
return 0;
else
return p[a] * invp[b] % MOD * invp[a - b] % MOD;
};
int n;
string s;
cin >> n >> s;
ll ans = 0;
int tot = n + (int)s.size();
for (int i = (int)s.size(); i <= tot; i++) {
// 枚举放i个a，剩下地方放b..z
(ans += C(tot, i) * xpow(25, tot - i)) %= MOD;
}
cout << ans << endl;
return 0;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define int long long
#define INF 1e18
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;
}
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, vector<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
template <class T> ostream &operator<<(ostream &s, set<T> P) {
EACH(it, P) { s << "<" << *it << "> "; }
return s << endl;
}
template <class T1, class T2> ostream &operator<<(ostream &s, map<T1, T2> P) {
EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; }
return s << endl;
}
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << "\n";
}
typedef long long ll;
const int MAX = 1000010;
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;
}
ll add(ll x, ll y) {
x += y;
if (x >= MOD)
return x - MOD;
return x;
}
ll sub(ll x, ll y) {
x -= y;
if (x < 0)
return x + MOD;
return x;
}
ll mult(ll x, ll y) { return (x * y) % MOD; }
ll bin_pow(ll x, ll p) {
if (p == 0)
return 1;
if (p & 1)
return mult(x, bin_pow(x, p - 1));
return bin_pow(mult(x, x), p / 2);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int k;
cin >> k;
string s;
cin >> s;
int N = (int)s.size() + k;
int n = (int)s.size();
COMinit();
int ans = 0;
for (int i = n; i <= N; i++) {
int x = bin_pow(25, i - n);
int y = bin_pow(26, N - i);
int z = COM(i - 1, n - 1);
// cerr<<i-n<<" "<<N-i<<" "<<z<<" "<<ans<<endl;
ans += mult(z, mult(x, y));
ans %= MOD;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, s) for (int i = 0; i < s; ++i)
#define ALL(v) (v).begin(), (v).end()
#define COUT(x) cout << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl
#define EACH(i, s) \
for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define DEBUG
#define int long long
#define INF 1e18
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;
}
template <class T1, class T2> ostream &operator<<(ostream &s, pair<T1, T2> P) {
return s << '<' << P.first << ", " << P.second << '>';
}
template <class T> ostream &operator<<(ostream &s, vector<T> P) {
for (int i = 0; i < P.size(); ++i) {
if (i > 0) {
s << " ";
}
s << P[i];
}
return s;
}
template <class T> ostream &operator<<(ostream &s, vector<vector<T>> P) {
for (int i = 0; i < P.size(); ++i) {
s << endl << P[i];
}
return s << endl;
}
template <class T> ostream &operator<<(ostream &s, set<T> P) {
EACH(it, P) { s << "<" << *it << "> "; }
return s << endl;
}
template <class T1, class T2> ostream &operator<<(ostream &s, map<T1, T2> P) {
EACH(it, P) { s << "<" << it->first << "->" << it->second << "> "; }
return s << endl;
}
template <class T> void show(vector<T> v) {
for (int i = 0; i < v.size(); i++) {
cerr << v[i] << " ";
}
cerr << "\n";
}
typedef long long ll;
const int MAX = 2000010;
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;
}
ll add(ll x, ll y) {
x += y;
if (x >= MOD)
return x - MOD;
return x;
}
ll sub(ll x, ll y) {
x -= y;
if (x < 0)
return x + MOD;
return x;
}
ll mult(ll x, ll y) { return (x * y) % MOD; }
ll bin_pow(ll x, ll p) {
if (p == 0)
return 1;
if (p & 1)
return mult(x, bin_pow(x, p - 1));
return bin_pow(mult(x, x), p / 2);
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
int k;
cin >> k;
string s;
cin >> s;
int N = (int)s.size() + k;
int n = (int)s.size();
COMinit();
int ans = 0;
for (int i = n; i <= N; i++) {
int x = bin_pow(25, i - n);
int y = bin_pow(26, N - i);
int z = COM(i - 1, n - 1);
// cerr<<i-n<<" "<<N-i<<" "<<z<<" "<<ans<<endl;
ans += mult(z, mult(x, y));
ans %= MOD;
}
cout << ans << endl;
return 0;
} | replace | 59 | 60 | 59 | 60 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rgi register int
#define ll long long
class fastin {
private:
int _ch, _f;
public:
inline fastin &operator>>(char &c) {
c = getchar();
return *this;
}
template <typename _Tp> inline fastin &operator>>(_Tp &_x) {
_x = 0;
while (!isdigit(_ch))
_f |= (_ch == 45), _ch = getchar();
while (isdigit(_ch))
_x = (_x << 1) + (_x << 3) + (_ch ^ 48), _ch = getchar();
_f && (_x = -_x, _f = 0);
return *this;
}
fastin() { _ch = _f = 0; }
} fin;
class fastout {
#define endl '\n'
private:
int _num[32], _head;
public:
inline fastout &operator<<(char c) {
putchar(c);
return *this;
}
template <typename _Tp> inline fastout &operator<<(_Tp _x) {
_Tp _k;
if (_x == 0) {
putchar('0');
return *this;
}
if (_x < 0)
putchar('-'), _x = -_x;
while (_x > 0)
_k = _x / 10, ++_head, _num[_head] = (_x - (_k << 1) - (_k << 3)) ^ 48,
_x = _k;
while (_head > 0)
putchar(_num[_head]), --_head;
return *this;
}
fastout() { _head = 0; }
} fout;
// ----------------------------
// #define int ll
// using namespace std;
const int maxn = 1000004;
const int mod = 1000000007, inf = 1000000007;
std::string s;
inline ll powmod(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
(res *= a) %= mod;
(a *= a) %= mod, b >>= 1;
}
return res;
}
ll fact[maxn], invfact[maxn];
inline void init() {
fact[0] = invfact[0] = 1;
for (rgi i = 1; i < maxn; ++i)
fact[i] = fact[i - 1] * i % mod, invfact[i] = powmod(fact[i], mod - 2);
}
inline ll C(ll n, ll m) {
return fact[n] * invfact[m] % mod * invfact[n - m] % mod;
}
signed main() {
int n;
fin >> n;
std::cin >> s;
init();
int len = s.length() - 1;
ll ans = 0;
for (rgi i = 0; i <= n; ++i)
(ans += powmod(26, i) * powmod(25, n - i) % mod * C(n - i + len, len)) %=
mod;
fout << ans;
return 0;
}
// ----------------------------
// by imzzy
| #include <bits/stdc++.h>
#define rgi register int
#define ll long long
class fastin {
private:
int _ch, _f;
public:
inline fastin &operator>>(char &c) {
c = getchar();
return *this;
}
template <typename _Tp> inline fastin &operator>>(_Tp &_x) {
_x = 0;
while (!isdigit(_ch))
_f |= (_ch == 45), _ch = getchar();
while (isdigit(_ch))
_x = (_x << 1) + (_x << 3) + (_ch ^ 48), _ch = getchar();
_f && (_x = -_x, _f = 0);
return *this;
}
fastin() { _ch = _f = 0; }
} fin;
class fastout {
#define endl '\n'
private:
int _num[32], _head;
public:
inline fastout &operator<<(char c) {
putchar(c);
return *this;
}
template <typename _Tp> inline fastout &operator<<(_Tp _x) {
_Tp _k;
if (_x == 0) {
putchar('0');
return *this;
}
if (_x < 0)
putchar('-'), _x = -_x;
while (_x > 0)
_k = _x / 10, ++_head, _num[_head] = (_x - (_k << 1) - (_k << 3)) ^ 48,
_x = _k;
while (_head > 0)
putchar(_num[_head]), --_head;
return *this;
}
fastout() { _head = 0; }
} fout;
// ----------------------------
// #define int ll
// using namespace std;
const int maxn = 2000004;
const int mod = 1000000007, inf = 1000000007;
std::string s;
inline ll powmod(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
(res *= a) %= mod;
(a *= a) %= mod, b >>= 1;
}
return res;
}
ll fact[maxn], invfact[maxn];
inline void init() {
fact[0] = invfact[0] = 1;
for (rgi i = 1; i < maxn; ++i)
fact[i] = fact[i - 1] * i % mod, invfact[i] = powmod(fact[i], mod - 2);
}
inline ll C(ll n, ll m) {
return fact[n] * invfact[m] % mod * invfact[n - m] % mod;
}
signed main() {
int n;
fin >> n;
std::cin >> s;
init();
int len = s.length() - 1;
ll ans = 0;
for (rgi i = 0; i <= n; ++i)
(ans += powmod(26, i) * powmod(25, n - i) % mod * C(n - i + len, len)) %=
mod;
fout << ans;
return 0;
}
// ----------------------------
// by imzzy
| replace | 53 | 54 | 53 | 54 | 0 | |
p02632 | C++ | Time Limit Exceeded | const int isDebugMode = 1;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge {
long long to, cost;
};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
const long long dy[] = {-1, 0, 0, 1};
const long long dx[] = {0, -1, 1, 0};
string abc = "abcdefghijklmnopqrstuvwxyz";
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eachdo(v, e) for (const auto &e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e) \
(long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e) \
(long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
void pt() {
cout << endl;
return;
}
template <class Head> void pt(Head &&head) {
cout << head;
pt();
return;
}
template <class Head, class... Tail> void pt(Head &&head, Tail &&...tail) {
cout << head << " ";
pt(forward<Tail>(tail)...);
}
void dpt() {
if (!isDebugMode)
return;
cout << endl;
return;
}
template <class Head> void dpt(Head &&head) {
if (!isDebugMode)
return;
cout << head;
pt();
return;
}
template <class Head, class... Tail> void dpt(Head &&head, Tail &&...tail) {
if (!isDebugMode)
return;
cout << head << " ";
pt(forward<Tail>(tail)...);
}
template <class T> void debug(T v) {
if (!isDebugMode)
return;
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
template <class T> void debug2(T v) {
if (!isDebugMode)
return;
rep(i, v.size()) {
rep(j, v[i].size()) cout << v[i][j] << " ";
cout << endl;
}
}
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;
}
template <class T1, class T2> long long gcd(T1 a, T2 b) {
return a % b ? gcd(b, a % b) : b;
}
template <class T1, class T2> void reduce(T1 &a, T2 &b) {
ll g = gcd(a, b);
a /= g;
b /= g;
return;
}
bool valid(long long H, long long W, long long h, long long w) {
return 0 <= h && h < H && 0 <= w && w < W;
}
struct mint {
long long x;
mint(long long 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(long long 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 {
mint res(*this);
return res /= a;
}
};
class combination {
public:
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;
if (COMBMAX < n) {
mint ret = 1;
for (long long i = 1; i <= k; i++) {
ret *= (n - i + 1);
ret /= i;
}
return ret;
}
return fact[n] * ifact[k] * ifact[n - k];
}
mint multi(long long n, long long sum, long long l, long long r) {
long long m = r - l + 1;
long long t = sum - n * (l - 1);
mint ans = 0;
for (long long k = 0; k <= (t - n) / m; k++) {
long long sign = k % 2 == 0 ? 1 : -1;
mint temp = this->operator()(n, k);
temp *= this->operator()(n + (t - n - m * k - 1), t - n - m * k);
temp *= sign;
ans += temp;
}
return ans;
}
} com(COMBMAX);
int main() {
ll K;
cin >> K;
string s;
cin >> s;
ll N = s.size();
mint ans = 0;
rep(i, K + 1) {
mint t = 0;
t += mpow(26, i);
t *= mpow(25, K - i);
t *= com.multi(N, K - i, 0, INF);
ans += t;
}
pt(ans.x);
return 0;
} | const int isDebugMode = 1;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge {
long long to, cost;
};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 3000000;
const long long MOD = 1000000007;
const long long dy[] = {-1, 0, 0, 1};
const long long dx[] = {0, -1, 1, 0};
string abc = "abcdefghijklmnopqrstuvwxyz";
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eachdo(v, e) for (const auto &e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e) \
(long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e) \
(long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
void pt() {
cout << endl;
return;
}
template <class Head> void pt(Head &&head) {
cout << head;
pt();
return;
}
template <class Head, class... Tail> void pt(Head &&head, Tail &&...tail) {
cout << head << " ";
pt(forward<Tail>(tail)...);
}
void dpt() {
if (!isDebugMode)
return;
cout << endl;
return;
}
template <class Head> void dpt(Head &&head) {
if (!isDebugMode)
return;
cout << head;
pt();
return;
}
template <class Head, class... Tail> void dpt(Head &&head, Tail &&...tail) {
if (!isDebugMode)
return;
cout << head << " ";
pt(forward<Tail>(tail)...);
}
template <class T> void debug(T v) {
if (!isDebugMode)
return;
rep(i, v.size()) cout << v[i] << " ";
cout << endl;
}
template <class T> void debug2(T v) {
if (!isDebugMode)
return;
rep(i, v.size()) {
rep(j, v[i].size()) cout << v[i][j] << " ";
cout << endl;
}
}
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;
}
template <class T1, class T2> long long gcd(T1 a, T2 b) {
return a % b ? gcd(b, a % b) : b;
}
template <class T1, class T2> void reduce(T1 &a, T2 &b) {
ll g = gcd(a, b);
a /= g;
b /= g;
return;
}
bool valid(long long H, long long W, long long h, long long w) {
return 0 <= h && h < H && 0 <= w && w < W;
}
struct mint {
long long x;
mint(long long 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(long long 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 {
mint res(*this);
return res /= a;
}
};
class combination {
public:
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;
if (COMBMAX < n) {
mint ret = 1;
for (long long i = 1; i <= k; i++) {
ret *= (n - i + 1);
ret /= i;
}
return ret;
}
return fact[n] * ifact[k] * ifact[n - k];
}
mint multi(long long n, long long sum, long long l, long long r) {
long long m = r - l + 1;
long long t = sum - n * (l - 1);
mint ans = 0;
for (long long k = 0; k <= (t - n) / m; k++) {
long long sign = k % 2 == 0 ? 1 : -1;
mint temp = this->operator()(n, k);
temp *= this->operator()(n + (t - n - m * k - 1), t - n - m * k);
temp *= sign;
ans += temp;
}
return ans;
}
} com(COMBMAX);
int main() {
ll K;
cin >> K;
string s;
cin >> s;
ll N = s.size();
mint ans = 0;
rep(i, K + 1) {
mint t = 0;
t += mpow(26, i);
t *= mpow(25, K - i);
t *= com.multi(N, K - i, 0, INF);
ans += t;
}
pt(ans.x);
return 0;
} | replace | 10 | 11 | 10 | 11 | TLE | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 1000005;
const ll MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long pow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int main() {
int k;
string s;
cin >> k >> s;
int n = s.size();
ll ans = 0;
COMinit();
rep(i, k + 1) {
ll tmp = pow(25ll, (ll)i) * COM(i + n - 1, n - 1) % MOD;
tmp *= pow(26ll, (ll)(k - i));
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int MAX = 2000005;
const ll MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long pow(long long a, long long b) {
long long res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
int main() {
int k;
string s;
cin >> k >> s;
int n = s.size();
ll ans = 0;
COMinit();
rep(i, k + 1) {
ll tmp = pow(25ll, (ll)i) * COM(i + n - 1, n - 1) % MOD;
tmp *= pow(26ll, (ll)(k - i));
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long int
#define ld long double
#define endl "\n"
#define rep(i, a, b) for (int i = a; i < b; i++)
#define reprev(i, a, b) for (int i = b - 1; i >= a; i--)
#define all(c) c.begin(), c.end()
#define sz(c) (int)c.size()
#define ff first
#define ss second
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define vin(a, n) \
vi a(n); \
rep(i, 0, n) cin >> a[i];
#define vout(a) \
rep(i, 0, sz(a)) cout << a[i] << " "; \
cout << endl;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define mod2 998244353
#define inf LLONG_MAX
#define pi 3.1415926535897932384626
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
int power(int x, unsigned int y, int p) {
int res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
if (x == 0)
return 0; // In case x is divisible by p;
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
int modInverse(int n, int p) { return power(n, p - 2, p); }
const int N = 1000000;
int fac[N + 1];
void precomp(int p) {
fac[0] = 1;
for (int i = 1; i <= N; i++)
fac[i] = fac[i - 1] * i % p;
}
// Returns nCr % p using Fermat's little
// theorem.
int nCrModPFermat(int n, int r, int p) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
signed main() {
IOS precomp(mod);
int k;
cin >> k;
string s;
cin >> s;
int n = s.length();
int final_ans = 0;
rep(i, n, n + k + 1) {
int ans = 1;
int x1 = nCrModPFermat(i - 1, n - 1, mod);
ans *= x1;
ans %= mod;
ans *= power(25, i - n, mod);
ans %= mod;
ans *= power(26, n + k - i, mod);
ans %= mod;
final_ans += ans;
final_ans %= mod;
}
cout << final_ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define int long long int
#define ld long double
#define endl "\n"
#define rep(i, a, b) for (int i = a; i < b; i++)
#define reprev(i, a, b) for (int i = b - 1; i >= a; i--)
#define all(c) c.begin(), c.end()
#define sz(c) (int)c.size()
#define ff first
#define ss second
#define pii pair<int, int>
#define vi vector<int>
#define vii vector<pii>
#define vin(a, n) \
vi a(n); \
rep(i, 0, n) cin >> a[i];
#define vout(a) \
rep(i, 0, sz(a)) cout << a[i] << " "; \
cout << endl;
#define pb push_back
#define mp make_pair
#define mod 1000000007
#define mod2 998244353
#define inf LLONG_MAX
#define pi 3.1415926535897932384626
#define tr(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
int power(int x, unsigned int y, int p) {
int res = 1; // Initialize result
x = x % p; // Update x if it is more than or
// equal to p
if (x == 0)
return 0; // In case x is divisible by p;
while (y > 0) {
// If y is odd, multiply x with result
if (y & 1)
res = (res * x) % p;
// y must be even now
y = y >> 1; // y = y/2
x = (x * x) % p;
}
return res;
}
int modInverse(int n, int p) { return power(n, p - 2, p); }
const int N = 2000000;
int fac[N + 1];
void precomp(int p) {
fac[0] = 1;
for (int i = 1; i <= N; i++)
fac[i] = fac[i - 1] * i % p;
}
// Returns nCr % p using Fermat's little
// theorem.
int nCrModPFermat(int n, int r, int p) {
// Base case
if (r == 0)
return 1;
// Fill factorial array so that we
// can find all factorial of r, n
// and n-r
return (fac[n] * modInverse(fac[r], p) % p * modInverse(fac[n - r], p) % p) %
p;
}
signed main() {
IOS precomp(mod);
int k;
cin >> k;
string s;
cin >> s;
int n = s.length();
int final_ans = 0;
rep(i, n, n + k + 1) {
int ans = 1;
int x1 = nCrModPFermat(i - 1, n - 1, mod);
ans *= x1;
ans %= mod;
ans *= power(25, i - n, mod);
ans %= mod;
ans *= power(26, n + k - i, mod);
ans %= mod;
final_ans += ans;
final_ans %= mod;
}
cout << final_ans;
return 0;
} | replace | 55 | 56 | 55 | 56 | 0 | |
p02632 | C++ | Time Limit Exceeded | #pragma GCC optimize("O2")
#pragma GCC target("avx2")
// #include<bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int mod = 1e9 + 7;
const int IMAX = 2000010;
constexpr ll modpow(ll A, ll B) {
ll kotae = 1;
while (B > 0) {
if (B & 1)
kotae = kotae * A % mod;
A = A * A % mod;
B >>= 1;
}
return kotae;
}
class unko {
public:
int inv[IMAX + 1];
unko() : inv() {
inv[0] = 1;
inv[1] = 1;
rep1(i, IMAX - 1) inv[i + 1] = ll(inv[i]) * i % mod;
ll tmp = modpow(ll(inv[IMAX]) * IMAX % mod, mod - 2);
for (int i = IMAX; i > 0; i--) {
inv[i] = inv[i] * tmp % mod;
tmp = tmp * i % mod;
}
}
} f;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int K;
cin >> K;
string S;
cin >> S;
int M = S.size();
const ll are = 423076927;
ll tmp = modpow(26, K);
ll kotae = 0;
rep(i, K + 1) {
ce(f.inv[i]);
tmp = tmp * f.inv[i] % mod;
kotae += tmp;
tmp = tmp * (M + i) % mod;
tmp = tmp * are % mod;
}
co(kotae % mod);
Would you please return 0;
} | #pragma GCC optimize("O2")
#pragma GCC target("avx2")
// #include<bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define rep1(i, n) for (int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please
const int mod = 1e9 + 7;
const int IMAX = 2000010;
constexpr ll modpow(ll A, ll B) {
ll kotae = 1;
while (B > 0) {
if (B & 1)
kotae = kotae * A % mod;
A = A * A % mod;
B >>= 1;
}
return kotae;
}
class unko {
public:
int inv[IMAX + 1];
unko() : inv() {
inv[0] = 1;
inv[1] = 1;
rep1(i, IMAX - 1) inv[i + 1] = ll(inv[i]) * i % mod;
ll tmp = modpow(ll(inv[IMAX]) * IMAX % mod, mod - 2);
for (int i = IMAX; i > 0; i--) {
inv[i] = inv[i] * tmp % mod;
tmp = tmp * i % mod;
}
}
} f;
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int K;
cin >> K;
string S;
cin >> S;
int M = S.size();
const ll are = 423076927;
ll tmp = modpow(26, K);
ll kotae = 0;
rep(i, K + 1) {
tmp = tmp * f.inv[i] % mod;
kotae += tmp;
tmp = tmp * (M + i) % mod;
tmp = tmp * are % mod;
}
co(kotae % mod);
Would you please return 0;
} | delete | 63 | 64 | 63 | 63 | TLE | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h> // ver2.7.1
#define int long long
#define endl "\n" // fflush(stdout);
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define VVi vector<Vi>
#define VVVi vector<VVi>
#define Vm vector<mint>
#define Vs vector<string>
#define Vd vector<double>
#define Vc vector<char>
#define Pii pair<int, int>
#define Pdd pair<double, double>
#define VPii vector<Pii>
#define Tiii tuple<int, int, int>
#define VTiii vector<Tiii>
#define PQi priority_queue<int>
#define PQir priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define itos to_string
#define stoi stoll
#define FI first
#define SE second
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define cyes cout << "yes" << endl
#define cno cout << "no" << endl
#define sortr(v) sort(v, greater<>())
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repeq(i, a, b) for (int i = a; i <= b; i++)
#define repreq(i, a, b) for (int i = a; i >= b; i--)
#define dem(a, b) ((a + b - 1) / (b))
#define INF 3000000000000000000 // 3.0*10^18
#define MAX LLONG_MAX
#define PI acos(-1.0L)
// int MOD = 998244353; // case
const int MOD = 1000000007; // 10^9 + 7
const double EPS = 1e-10;
using namespace std;
struct mint {
int x;
mint(int 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(int 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; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
/* debug */
template <typename T> // vector
ostream &operator<<(ostream &os, const vector<T> &V) {
int N = V.size();
if (N == 0) {
os << '.';
return os;
}
rep(i, 0, N - 1) { os << V[i] << ' '; }
os << V[N - 1];
return os;
}
template <typename T> // vector vector
ostream &operator<<(ostream &os, const vector<vector<T>> &V) {
int N = V.size();
rep(i, 0, N - 1) cout << V[i] << endl;
cout << V[N - 1];
return os;
}
template <typename T, typename S> // pair
ostream &operator<<(ostream &os, pair<T, S> const &P) {
os << P.FI << ' ' << P.SE;
return os;
}
template <typename T> // set
ostream &operator<<(ostream &os, set<T> &S) {
auto it = S.begin();
while (it != S.end()) {
os << *it;
if (next(it, 1) != S.end())
os << ' ';
it++;
};
return os;
}
template <typename T> // deque
ostream &operator<<(ostream &os, deque<T> &q) {
for (auto it = q.begin(); it < q.end(); it++) {
os << *it;
if (it + 1 != q.end())
os << " ";
}
return os;
}
/* useful */
template <typename T> void Vin(vector<T> &v) {
int n = v.size();
rep(i, 0, n) cin >> v[i];
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int mypow(int x, int n, int m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return mypow(x * x % m, n / 2, m);
else
return x * mypow(x, n - 1, m) % m;
}
int scomb(int n, int r) {
if (r < 0 || r > n)
return 0;
if ((n - r) < r)
r = n - r; // nCr
int a = 1;
for (int i = n; i > n - r; --i) {
a = a * i;
}
for (int i = 1; i < r + 1; ++i) {
a = a / i;
}
return a;
}
Vi vis(Vi &v) {
Vi S(v.size() + 1);
rep(i, 1, S.size()) S[i] += v[i - 1] + S[i - 1];
return S;
}
int digitsum(int n) {
int ret = 0;
while (n > 0) {
ret += n % 10;
n /= 10;
}
return ret;
}
int digit(int k, int i) {
string s = itos(k);
return s[s.size() - i] - '0';
} // i桁目の数字
template <typename T> void press(T &v) {
v.erase(unique(ALL(v)), v.end());
} // 圧縮
Vi zip(Vi b) {
int Z = b.size(); // 座標圧縮
Pii p[Z + 10];
int a = b.size();
Vi l(a);
for (int i = 0; i < a; i++)
p[i] = mp(b[i], i);
sort(p, p + a);
int w = 0;
for (int i = 0; i < a; i++) {
if (i && p[i].first != p[i - 1].first)
w++;
l[p[i].second] = w;
}
return l;
}
Vi nibe2V() {
Vi a(63);
int q = 1;
rep(i, 0, 63) {
a[i] = q;
q *= 2;
}
return a;
}
Vi nibe = nibe2V(); // 2^n
int modiv(int a, int b) {
return a * mypow(b, MOD - 2, MOD) % MOD;
} // a÷b(%MOD)
int SMALLER(Vi &a, int x) {
return lower_bound(a.begin(), a.end(), x) - a.begin();
}
int orSMALLER(Vi &a, int x) {
return upper_bound(a.begin(), a.end(), x) - a.begin();
}
int BIGGER(Vi &a, int x) { return a.size() - orSMALLER(a, x); }
int orBIGGER(Vi &a, int x) { return a.size() - SMALLER(a, x); }
int COUNT(Vi &a, int x) {
return upper_bound(ALL(a), x) - lower_bound(ALL(a), x);
}
int maxind(Vi &a) { return max_element(ALL(a)) - a.begin(); }
int minind(Vi &a) { return min_element(ALL(a)) - a.begin(); }
Vi stpowV() {
Vi a(300005);
a[0] = 1;
repeq(i, 1, 300004) a[i] = a[i - 1] * i % MOD;
return a;
}
// Vi stpow = stpowV(); // 階乗配列(%MOD)
/****************************** START ******************************/
const int MAX_N = 200005;
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(MAX_N);
signed main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(12);
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
mint ans = 0;
repeq(i, 0, k) {
mint tmp = mypow(26, i, MOD);
tmp *= mypow(25, k - i, MOD);
tmp *= comb(n + k - i - 1, n - 1);
ans += tmp;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h> // ver2.7.1
#define int long long
#define endl "\n" // fflush(stdout);
#define ALL(v) (v).begin(), (v).end()
#define Vi vector<int>
#define VVi vector<Vi>
#define VVVi vector<VVi>
#define Vm vector<mint>
#define Vs vector<string>
#define Vd vector<double>
#define Vc vector<char>
#define Pii pair<int, int>
#define Pdd pair<double, double>
#define VPii vector<Pii>
#define Tiii tuple<int, int, int>
#define VTiii vector<Tiii>
#define PQi priority_queue<int>
#define PQir priority_queue<int, vector<int>, greater<int>>
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define itos to_string
#define stoi stoll
#define FI first
#define SE second
#define cYES cout << "YES" << endl
#define cNO cout << "NO" << endl
#define cYes cout << "Yes" << endl
#define cNo cout << "No" << endl
#define cyes cout << "yes" << endl
#define cno cout << "no" << endl
#define sortr(v) sort(v, greater<>())
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repeq(i, a, b) for (int i = a; i <= b; i++)
#define repreq(i, a, b) for (int i = a; i >= b; i--)
#define dem(a, b) ((a + b - 1) / (b))
#define INF 3000000000000000000 // 3.0*10^18
#define MAX LLONG_MAX
#define PI acos(-1.0L)
// int MOD = 998244353; // case
const int MOD = 1000000007; // 10^9 + 7
const double EPS = 1e-10;
using namespace std;
struct mint {
int x;
mint(int 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(int 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; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
/* debug */
template <typename T> // vector
ostream &operator<<(ostream &os, const vector<T> &V) {
int N = V.size();
if (N == 0) {
os << '.';
return os;
}
rep(i, 0, N - 1) { os << V[i] << ' '; }
os << V[N - 1];
return os;
}
template <typename T> // vector vector
ostream &operator<<(ostream &os, const vector<vector<T>> &V) {
int N = V.size();
rep(i, 0, N - 1) cout << V[i] << endl;
cout << V[N - 1];
return os;
}
template <typename T, typename S> // pair
ostream &operator<<(ostream &os, pair<T, S> const &P) {
os << P.FI << ' ' << P.SE;
return os;
}
template <typename T> // set
ostream &operator<<(ostream &os, set<T> &S) {
auto it = S.begin();
while (it != S.end()) {
os << *it;
if (next(it, 1) != S.end())
os << ' ';
it++;
};
return os;
}
template <typename T> // deque
ostream &operator<<(ostream &os, deque<T> &q) {
for (auto it = q.begin(); it < q.end(); it++) {
os << *it;
if (it + 1 != q.end())
os << " ";
}
return os;
}
/* useful */
template <typename T> void Vin(vector<T> &v) {
int n = v.size();
rep(i, 0, n) cin >> v[i];
}
int gcd(int a, int b) { return b ? gcd(b, a % b) : a; }
int lcm(int a, int b) { return a / gcd(a, b) * b; }
int mypow(int x, int n, int m) {
if (n == 0)
return 1;
if (n % 2 == 0)
return mypow(x * x % m, n / 2, m);
else
return x * mypow(x, n - 1, m) % m;
}
int scomb(int n, int r) {
if (r < 0 || r > n)
return 0;
if ((n - r) < r)
r = n - r; // nCr
int a = 1;
for (int i = n; i > n - r; --i) {
a = a * i;
}
for (int i = 1; i < r + 1; ++i) {
a = a / i;
}
return a;
}
Vi vis(Vi &v) {
Vi S(v.size() + 1);
rep(i, 1, S.size()) S[i] += v[i - 1] + S[i - 1];
return S;
}
int digitsum(int n) {
int ret = 0;
while (n > 0) {
ret += n % 10;
n /= 10;
}
return ret;
}
int digit(int k, int i) {
string s = itos(k);
return s[s.size() - i] - '0';
} // i桁目の数字
template <typename T> void press(T &v) {
v.erase(unique(ALL(v)), v.end());
} // 圧縮
Vi zip(Vi b) {
int Z = b.size(); // 座標圧縮
Pii p[Z + 10];
int a = b.size();
Vi l(a);
for (int i = 0; i < a; i++)
p[i] = mp(b[i], i);
sort(p, p + a);
int w = 0;
for (int i = 0; i < a; i++) {
if (i && p[i].first != p[i - 1].first)
w++;
l[p[i].second] = w;
}
return l;
}
Vi nibe2V() {
Vi a(63);
int q = 1;
rep(i, 0, 63) {
a[i] = q;
q *= 2;
}
return a;
}
Vi nibe = nibe2V(); // 2^n
int modiv(int a, int b) {
return a * mypow(b, MOD - 2, MOD) % MOD;
} // a÷b(%MOD)
int SMALLER(Vi &a, int x) {
return lower_bound(a.begin(), a.end(), x) - a.begin();
}
int orSMALLER(Vi &a, int x) {
return upper_bound(a.begin(), a.end(), x) - a.begin();
}
int BIGGER(Vi &a, int x) { return a.size() - orSMALLER(a, x); }
int orBIGGER(Vi &a, int x) { return a.size() - SMALLER(a, x); }
int COUNT(Vi &a, int x) {
return upper_bound(ALL(a), x) - lower_bound(ALL(a), x);
}
int maxind(Vi &a) { return max_element(ALL(a)) - a.begin(); }
int minind(Vi &a) { return min_element(ALL(a)) - a.begin(); }
Vi stpowV() {
Vi a(300005);
a[0] = 1;
repeq(i, 1, 300004) a[i] = a[i - 1] * i % MOD;
return a;
}
// Vi stpow = stpowV(); // 階乗配列(%MOD)
/****************************** START ******************************/
const int MAX_N = 2000005;
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(MAX_N);
signed main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(12);
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
mint ans = 0;
repeq(i, 0, k) {
mint tmp = mypow(26, i, MOD);
tmp *= mypow(25, k - i, MOD);
tmp *= comb(n + k - i - 1, n - 1);
ans += tmp;
}
cout << ans << endl;
return 0;
} | replace | 228 | 229 | 228 | 229 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
using ll = long long;
const ll MOD = 1000000007;
const ll MAX = 1100000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
repl(i, 2, MAX) {
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 or k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % 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() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
COMinit();
int k;
string s;
cin >> k >> s;
int n = s.size();
ll ans = 0;
rep(i, k + 1) {
ll p = COM(n + k - i - 1, n - 1) * modpow(25, k - i) % MOD * modpow(26, i) %
MOD;
ans = (ans + p) % MOD;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define rep(i, n) repl(i, 0, n)
using ll = long long;
const ll MOD = 1000000007;
const ll MAX = 2100000;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
repl(i, 2, MAX) {
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 or k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % 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() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(false);
COMinit();
int k;
string s;
cin >> k >> s;
int n = s.size();
ll ans = 0;
rep(i, k + 1) {
ll p = COM(n + k - i - 1, n - 1) * modpow(25, k - i) % MOD * modpow(26, i) %
MOD;
ans = (ans + p) % MOD;
}
cout << ans << endl;
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define N 1000001 // size of array
const ll MOD = 1e9 + 7;
ll fac[N], inv[N], finv[N];
void com_init() {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < N; 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 combination(int a, int b) {
if (a < b)
return 0;
if (a < 0 || b < 0)
return 0;
return fac[a] * (finv[b] * finv[a - b] % MOD) % MOD;
}
int main() {
int K;
string S;
cin >> K >> S;
int n = S.size();
ll p = 1, ans = 0;
com_init();
for (int i = 0; i < K; i++) {
p *= 25;
p %= MOD;
}
for (int i = 0; i <= K; i++) {
ans += combination(n + K - i - 1, n - 1) * p % MOD;
ans %= MOD;
p *= 26;
p %= MOD;
p *= inv[25];
p %= MOD;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define N 2000000 // size of array
const ll MOD = 1e9 + 7;
ll fac[N], inv[N], finv[N];
void com_init() {
fac[0] = 1;
fac[1] = 1;
finv[0] = 1;
finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < N; 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 combination(int a, int b) {
if (a < b)
return 0;
if (a < 0 || b < 0)
return 0;
return fac[a] * (finv[b] * finv[a - b] % MOD) % MOD;
}
int main() {
int K;
string S;
cin >> K >> S;
int n = S.size();
ll p = 1, ans = 0;
com_init();
for (int i = 0; i < K; i++) {
p *= 25;
p %= MOD;
}
for (int i = 0; i <= K; i++) {
ans += combination(n + K - i - 1, n - 1) * p % MOD;
ans %= MOD;
p *= 26;
p %= MOD;
p *= inv[25];
p %= MOD;
}
cout << ans << endl;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02632 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using P = pair<int, int>;
/*** MOD CALCULATION ***/
const int MOD = 1e9 + 7;
const int MAX = 510000;
ll addM(ll a, ll b) { return (a + b) % MOD; }
ll mulM(ll a, ll b) {
ll temp = ((a % MOD) * (b % MOD)) % MOD;
return temp;
}
ll powM(ll a, ll b) {
if (b == 0)
return 1;
else if (b == 1)
return a % MOD;
else if (b % 2 == 0)
return mulM(powM(a, b / 2), powM(a, b / 2));
else
return mulM(a, mulM(powM(a, (b - 1) / 2), powM(a, (b - 1) / 2)));
}
// b^{-1} = b^{p-2} (mod p)
// a/b = a*b^{p-2} (mod p)
ll divM(ll a, ll b) { return mulM(a, powM(b, MOD - 2)); }
// n!, (n!)^{-1} のテーブル作成
ll fac[MAX], finv[MAX], inv[MAX];
void COMBinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
rep3(i, 2, MAX - 1) {
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 COMB(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/*** MOD CALCULATION ここまで ***/
void Main() {
const int A = 26;
int k;
string s;
cin >> k >> s;
int n = s.size();
COMBinit();
ll tot = 0;
rep3(last, n, n + k) {
ll temp = COMB(last - 1, n - 1);
temp = mulM(temp, powM(A - 1, last - n));
temp = mulM(temp, powM(A, n + k - last));
tot = addM(tot, temp);
}
cout << tot << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using P = pair<int, int>;
/*** MOD CALCULATION ***/
const int MOD = 1e9 + 7;
const int MAX = 2'000'005;
ll addM(ll a, ll b) { return (a + b) % MOD; }
ll mulM(ll a, ll b) {
ll temp = ((a % MOD) * (b % MOD)) % MOD;
return temp;
}
ll powM(ll a, ll b) {
if (b == 0)
return 1;
else if (b == 1)
return a % MOD;
else if (b % 2 == 0)
return mulM(powM(a, b / 2), powM(a, b / 2));
else
return mulM(a, mulM(powM(a, (b - 1) / 2), powM(a, (b - 1) / 2)));
}
// b^{-1} = b^{p-2} (mod p)
// a/b = a*b^{p-2} (mod p)
ll divM(ll a, ll b) { return mulM(a, powM(b, MOD - 2)); }
// n!, (n!)^{-1} のテーブル作成
ll fac[MAX], finv[MAX], inv[MAX];
void COMBinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
rep3(i, 2, MAX - 1) {
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 COMB(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/*** MOD CALCULATION ここまで ***/
void Main() {
const int A = 26;
int k;
string s;
cin >> k >> s;
int n = s.size();
COMBinit();
ll tot = 0;
rep3(last, n, n + k) {
ll temp = COMB(last - 1, n - 1);
temp = mulM(temp, powM(A - 1, last - n));
temp = mulM(temp, powM(A, n + k - last));
tot = addM(tot, temp);
}
cout << tot << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p02632 | C++ | Runtime Error | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) \
for (auto &x : v) \
cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)
#define int ll
using namespace std;
#ifdef __LOCAL
#define dbg(x) cerr << #x << " : " << x << '\n'
const int maxn = 20;
#else
#define dbg(x)
const int maxn = 1e6 + 20;
#endif
// tg: @galebickosikasa
const ll inf = (ll)2e9;
const ld pi = asin(1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
ll mult(ll a, ll b) { return a * b % mod; }
ll add(ll a, ll b) {
int c = a + b;
if (c >= mod)
c -= mod;
return c;
}
ll powmod(ll a, ll n) {
if (n == 0)
return 1;
if (n % 2)
return mult(a, powmod(a, n - 1));
ll b = powmod(a, n / 2);
return mult(b, b);
}
ll inv(int a) { return powmod(a, mod - 2); }
int f[maxn], rev[maxn];
int C(int n, int k) { return mult(f[n], mult(rev[k], rev[n - k])); }
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
f[0] = rev[0] = 1;
fl(i, 1, maxn) {
f[i] = mult(f[i - 1], i);
rev[i] = inv(f[i]);
}
int k;
string s;
cin >> k >> s;
int n = sz(s);
int ans = 0;
fl(i, n, k + n + 1) {
ans = add(ans, mult(C(k + n, i), powmod(25, k + n - i)));
// dbg (C (k + n, i));
// dbg (powmod (25, k + n - i));
// dbg (ans);
}
cout << ans << '\n';
} | #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,sse4.1,sse4.2,popcnt,abm,mmx,avx")
// #pragma comment(linker, "/stack:200000000"]
#include <algorithm>
#include <bitset>
#include <chrono>
#include <cmath>
#include <deque>
#include <fstream>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define fi first
#define se second
#define pb push_back
#define ll long long
#define ld long double
#define hm unordered_map
#define pii pair<int, int>
#define sz(a) (int)a.size()
#define all(a) a.begin(), a.end()
#define cinv(v) \
for (auto &x : v) \
cin >> x
#define fr(i, n) for (int i = 0; i < n; ++i)
#define fl(i, l, n) for (int i = l; i < n; ++i)
#define int ll
using namespace std;
#ifdef __LOCAL
#define dbg(x) cerr << #x << " : " << x << '\n'
const int maxn = 20;
#else
#define dbg(x)
const int maxn = 2e6 + 20;
#endif
// tg: @galebickosikasa
const ll inf = (ll)2e9;
const ld pi = asin(1) * 2;
const ld eps = 1e-8;
const ll mod = (ll)1e9 + 7;
const ll ns = 97;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
ll mult(ll a, ll b) { return a * b % mod; }
ll add(ll a, ll b) {
int c = a + b;
if (c >= mod)
c -= mod;
return c;
}
ll powmod(ll a, ll n) {
if (n == 0)
return 1;
if (n % 2)
return mult(a, powmod(a, n - 1));
ll b = powmod(a, n / 2);
return mult(b, b);
}
ll inv(int a) { return powmod(a, mod - 2); }
int f[maxn], rev[maxn];
int C(int n, int k) { return mult(f[n], mult(rev[k], rev[n - k])); }
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
f[0] = rev[0] = 1;
fl(i, 1, maxn) {
f[i] = mult(f[i - 1], i);
rev[i] = inv(f[i]);
}
int k;
string s;
cin >> k >> s;
int n = sz(s);
int ans = 0;
fl(i, n, k + n + 1) {
ans = add(ans, mult(C(k + n, i), powmod(25, k + n - i)));
// dbg (C (k + n, i));
// dbg (powmod (25, k + n - i));
// dbg (ans);
}
cout << ans << '\n';
} | replace | 45 | 46 | 45 | 46 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
void fst() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
}
int nxt() {
int x;
cin >> x;
return x;
}
int nex_l() {
long long x;
cin >> x;
return x;
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vb> vvb;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define binary(n) cout << bitset<31>(n) << "\n";
#define FOR(i, n) for (int i = 0; i < n; i++)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define input_arr(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define print_arr(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " ";
#define deb(n) cerr << #n << "=" << n << "\n";
const int MS = 1e6 + 5, mod = 1e9 + 7;
ll fact[MS];
void cal_fact() {
fact[0] = 1;
for (int i = 1; i < MS; i++) {
fact[i] = i * fact[i - 1];
fact[i] %= mod;
}
}
ll binpow(ll val, ll deg, ll mod) {
if (!deg)
return 1 % mod;
if (deg & 1)
return binpow(val, deg - 1, mod) * val % mod;
ll res = binpow(val, deg >> 1, mod);
return (res * res) % mod;
}
ll cal_c(ll n, ll i) {
ll res = fact[n];
ll div = fact[n - i] * fact[i];
div %= mod;
// using fermat little theorum
div = binpow(div, mod - 2, mod);
return (res * div) % mod;
}
int main() {
cal_fact();
ll n, k;
cin >> k;
string s;
cin >> s;
n = s.size();
ll ans = 0;
for (int i = n; i <= n + k; i++) {
ans += cal_c(n + k, i) * binpow(25, n + k - i, mod);
ans %= mod;
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
void fst() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
#endif
}
int nxt() {
int x;
cin >> x;
return x;
}
int nex_l() {
long long x;
cin >> x;
return x;
}
typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vi> vvi;
typedef vector<vb> vvb;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef vector<pair<int, int>> vpii;
#define fr first
#define sc second
#define mp make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define binary(n) cout << bitset<31>(n) << "\n";
#define FOR(i, n) for (int i = 0; i < n; i++)
#define rep(i, a, b) for (int i = a; i < b; i++)
#define input_arr(a, n) \
for (int i = 0; i < n; i++) \
cin >> a[i];
#define print_arr(a, n) \
for (int i = 0; i < n; i++) \
cout << a[i] << " ";
#define deb(n) cerr << #n << "=" << n << "\n";
const int MS = 2e6 + 5, mod = 1e9 + 7;
ll fact[MS];
void cal_fact() {
fact[0] = 1;
for (int i = 1; i < MS; i++) {
fact[i] = i * fact[i - 1];
fact[i] %= mod;
}
}
ll binpow(ll val, ll deg, ll mod) {
if (!deg)
return 1 % mod;
if (deg & 1)
return binpow(val, deg - 1, mod) * val % mod;
ll res = binpow(val, deg >> 1, mod);
return (res * res) % mod;
}
ll cal_c(ll n, ll i) {
ll res = fact[n];
ll div = fact[n - i] * fact[i];
div %= mod;
// using fermat little theorum
div = binpow(div, mod - 2, mod);
return (res * div) % mod;
}
int main() {
cal_fact();
ll n, k;
cin >> k;
string s;
cin >> s;
n = s.size();
ll ans = 0;
for (int i = n; i <= n + k; i++) {
ans += cal_c(n + k, i) * binpow(25, n + k - i, mod);
ans %= mod;
}
cout << ans << "\n";
}
| replace | 47 | 48 | 47 | 48 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
const int64_t MOD = 1000000007;
int64_t ff[1000006];
int64_t fact(int n) {
if (n == 0)
return 1;
if (n == 1)
return 1;
if (ff[n] != 0)
return ff[n];
ff[n] = (fact(n - 1) * n) % MOD;
return ff[n] % MOD;
}
int64_t pm(int64_t a, int64_t b) {
if (b == 0)
return 1;
if (b == 1)
return a % MOD;
int64_t v = pm(a, b / 2) % MOD;
v = v * v % MOD;
if (b % 2) {
return v * a % MOD;
}
return v;
}
int main() {
int64_t ans = 0;
int N;
int K;
std::cin >> K;
std::string s;
std::cin >> s;
N = s.size();
int64_t st = N + K;
for (; st >= N; --st) {
int64_t v = pm(26, N + K - st) * pm(25, st - N) % MOD;
v = v * fact(st - 1) % MOD;
v = v * pm(fact(st - N), MOD - 2) % MOD;
v = v * pm(fact(N - 1), MOD - 2) % MOD;
ans += v;
ans = ans % MOD;
}
printf("%lld\n", ans % MOD);
}
| #include <bits/stdc++.h>
const int64_t MOD = 1000000007;
int64_t ff[2000006];
int64_t fact(int n) {
if (n == 0)
return 1;
if (n == 1)
return 1;
if (ff[n] != 0)
return ff[n];
ff[n] = (fact(n - 1) * n) % MOD;
return ff[n] % MOD;
}
int64_t pm(int64_t a, int64_t b) {
if (b == 0)
return 1;
if (b == 1)
return a % MOD;
int64_t v = pm(a, b / 2) % MOD;
v = v * v % MOD;
if (b % 2) {
return v * a % MOD;
}
return v;
}
int main() {
int64_t ans = 0;
int N;
int K;
std::cin >> K;
std::string s;
std::cin >> s;
N = s.size();
int64_t st = N + K;
for (; st >= N; --st) {
int64_t v = pm(26, N + K - st) * pm(25, st - N) % MOD;
v = v * fact(st - 1) % MOD;
v = v * pm(fact(st - N), MOD - 2) % MOD;
v = v * pm(fact(N - 1), MOD - 2) % MOD;
ans += v;
ans = ans % MOD;
}
printf("%lld\n", ans % MOD);
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 1e6 + 10;
int fact[N], infact[N];
int qmi(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = (ll)res * a % mod;
a = (ll)a * a % mod;
b >>= 1;
}
return res;
}
void init() {
fact[0] = 1, infact[0] = 1;
for (int i = 1; i < N; ++i) {
fact[i] = (ll)fact[i - 1] * i % mod;
infact[i] = (ll)infact[i - 1] * qmi(i, mod - 2) % mod;
}
}
ll C(int a, int b) {
return (ll)fact[a] * infact[b] % mod * (ll)infact[a - b] % mod;
}
int main() {
int k;
string s;
cin >> k >> s;
int len = s.length();
int n = k + len;
init(); // 预处理阶乘
ll ans = 0;
for (int i = len; i <= n; i++) {
ll t =
C(i - 1, len - 1) * qmi(25, i - len) % mod * (ll)qmi(26, n - i) % mod;
ans = (ans % mod + t % mod) % mod;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;
const int mod = 1e9 + 7;
const int N = 2e6 + 10;
int fact[N], infact[N];
int qmi(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = (ll)res * a % mod;
a = (ll)a * a % mod;
b >>= 1;
}
return res;
}
void init() {
fact[0] = 1, infact[0] = 1;
for (int i = 1; i < N; ++i) {
fact[i] = (ll)fact[i - 1] * i % mod;
infact[i] = (ll)infact[i - 1] * qmi(i, mod - 2) % mod;
}
}
ll C(int a, int b) {
return (ll)fact[a] * infact[b] % mod * (ll)infact[a - b] % mod;
}
int main() {
int k;
string s;
cin >> k >> s;
int len = s.length();
int n = k + len;
init(); // 预处理阶乘
ll ans = 0;
for (int i = len; i <= n; i++) {
ll t =
C(i - 1, len - 1) * qmi(25, i - len) % mod * (ll)qmi(26, n - i) % mod;
ans = (ans % mod + t % mod) % mod;
}
cout << ans << endl;
return 0;
}
| replace | 7 | 8 | 7 | 8 | 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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
vector<int> fact;
vector<int> ifact;
vector<int> inv;
vector<int> pow2;
const int MOD = (1e9 + 7);
int add(int a, int b) {
a += b;
while (a >= MOD)
a -= MOD;
return a;
}
void radd(int &a, int b) { a = add(a, b); }
int mult(int a, int b) { return (a * 1LL * b) % MOD; }
void rmult(int &a, int b) { a = mult(a, b); }
int modpow(int a, int b) {
int r = 1;
while (b) {
if (b & 1)
r = mult(r, a);
a = mult(a, a);
b >>= 1;
}
return r;
}
int choose(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
if (a == b)
return 1;
return mult(fact[a], mult(ifact[b], ifact[a - b]));
}
int inverse(int a) { return modpow(a, MOD - 2); }
void init(int _n) {
fact.clear();
ifact.clear();
inv.clear();
pow2.clear();
fact.resize(_n + 1);
ifact.resize(_n + 1);
inv.resize(_n + 1);
pow2.resize(_n + 1);
pow2[0] = 1;
ifact[0] = 1;
fact[0] = 1;
for (int i = 1; i <= _n; i++) {
pow2[i] = add(pow2[i - 1], pow2[i - 1]);
fact[i] = mult(fact[i - 1], i);
// ifact[i]=mult(ifact[i-1],inv[i]);
}
ifact[_n] = inverse(fact[_n]);
for (int i = _n - 1; i >= 1; i--) {
ifact[i] = mult(ifact[i + 1], i + 1);
}
for (int i = 1; i <= _n; i++) {
inv[i] = mult(fact[i - 1], ifact[i]);
}
}
int pw[1111111];
int pw3[1111111];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
init(1222222);
int k;
cin >> k;
string s;
cin >> s;
int n = s.length();
pw[0] = 1;
pw3[0] = 1;
for (int i = 1; i <= 1001111; i++)
pw[i] = mult(pw[i - 1], 25);
int ans = 0;
for (int i = 1; i <= 1001111; i++)
pw3[i] = mult(pw3[i - 1], 26);
for (int i = 0; i <= k; i++) {
radd(ans, mult(pw3[i], mult(pw[k - i], choose(k - i + n - 1, n - 1))));
}
// int ans = mult(pw,choose(k+n,n));
cout << ans << '\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 fi first
#define se second
#define mp make_pair
#define pb push_back
#define fbo find_by_order
#define ook order_of_key
typedef long long ll;
typedef pair<ll, ll> ii;
typedef vector<int> vi;
typedef long double ld;
typedef tree<ll, null_type, less<ll>, rb_tree_tag,
tree_order_statistics_node_update>
pbds;
vector<int> fact;
vector<int> ifact;
vector<int> inv;
vector<int> pow2;
const int MOD = (1e9 + 7);
int add(int a, int b) {
a += b;
while (a >= MOD)
a -= MOD;
return a;
}
void radd(int &a, int b) { a = add(a, b); }
int mult(int a, int b) { return (a * 1LL * b) % MOD; }
void rmult(int &a, int b) { a = mult(a, b); }
int modpow(int a, int b) {
int r = 1;
while (b) {
if (b & 1)
r = mult(r, a);
a = mult(a, a);
b >>= 1;
}
return r;
}
int choose(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
if (a == b)
return 1;
return mult(fact[a], mult(ifact[b], ifact[a - b]));
}
int inverse(int a) { return modpow(a, MOD - 2); }
void init(int _n) {
fact.clear();
ifact.clear();
inv.clear();
pow2.clear();
fact.resize(_n + 1);
ifact.resize(_n + 1);
inv.resize(_n + 1);
pow2.resize(_n + 1);
pow2[0] = 1;
ifact[0] = 1;
fact[0] = 1;
for (int i = 1; i <= _n; i++) {
pow2[i] = add(pow2[i - 1], pow2[i - 1]);
fact[i] = mult(fact[i - 1], i);
// ifact[i]=mult(ifact[i-1],inv[i]);
}
ifact[_n] = inverse(fact[_n]);
for (int i = _n - 1; i >= 1; i--) {
ifact[i] = mult(ifact[i + 1], i + 1);
}
for (int i = 1; i <= _n; i++) {
inv[i] = mult(fact[i - 1], ifact[i]);
}
}
int pw[1111111];
int pw3[1111111];
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
init(2222222);
int k;
cin >> k;
string s;
cin >> s;
int n = s.length();
pw[0] = 1;
pw3[0] = 1;
for (int i = 1; i <= 1001111; i++)
pw[i] = mult(pw[i - 1], 25);
int ans = 0;
for (int i = 1; i <= 1001111; i++)
pw3[i] = mult(pw3[i - 1], 26);
for (int i = 0; i <= k; i++) {
radd(ans, mult(pw3[i], mult(pw[k - i], choose(k - i + n - 1, n - 1))));
}
// int ans = mult(pw,choose(k+n,n));
cout << ans << '\n';
}
| replace | 87 | 88 | 87 | 88 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define debug(x) cout << #x << " = " << x << endl
#define fori(i, ini, lim) for (int i = int(ini); i < int(lim); i++)
#define ford(i, ini, lim) for (int i = int(ini); i >= int(lim); i--)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
const int MAX = 1e6 + 6;
const int MOD = 1e9 + 7;
int fat[MAX];
inline int add(int a, int b) {
a += b;
if (a >= MOD)
a -= MOD;
return a;
}
inline int sub(int a, int b) {
a -= b;
if (0 > a)
a += MOD;
return a;
}
inline int mult(int a, int b) { return (1LL * a * b) % MOD; }
int f_exp(int x, int e) {
if (e <= 0)
return 1;
if (e & 1)
return mult(x, f_exp(x, e - 1));
return f_exp(mult(x, x), e / 2);
}
inline int inv(int x) { return f_exp(x, MOD - 2); }
inline int comb(int n, int k) {
if (k > n)
return 0;
return mult(fat[n], mult(inv(fat[n - k]), inv(fat[k])));
}
void preprocess() {
fat[0] = 1;
fori(i, 1, MAX) { fat[i] = mult(fat[i - 1], i); }
}
void solve() {
preprocess();
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
int t = n + k;
int ans = 0;
fori(i, n, t + 1) {
int b = i - 1;
int c = comb(b, n - 1);
int f = t - i;
int p = mult(f_exp(26, f), f_exp(25, t - f - n));
ans = add(ans, mult(c, p));
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <bitset>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <time.h>
#include <utility>
#include <vector>
#define debug(x) cout << #x << " = " << x << endl
#define fori(i, ini, lim) for (int i = int(ini); i < int(lim); i++)
#define ford(i, ini, lim) for (int i = int(ini); i >= int(lim); i--)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> ii;
const int MAX = 3e6 + 6;
const int MOD = 1e9 + 7;
int fat[MAX];
inline int add(int a, int b) {
a += b;
if (a >= MOD)
a -= MOD;
return a;
}
inline int sub(int a, int b) {
a -= b;
if (0 > a)
a += MOD;
return a;
}
inline int mult(int a, int b) { return (1LL * a * b) % MOD; }
int f_exp(int x, int e) {
if (e <= 0)
return 1;
if (e & 1)
return mult(x, f_exp(x, e - 1));
return f_exp(mult(x, x), e / 2);
}
inline int inv(int x) { return f_exp(x, MOD - 2); }
inline int comb(int n, int k) {
if (k > n)
return 0;
return mult(fat[n], mult(inv(fat[n - k]), inv(fat[k])));
}
void preprocess() {
fat[0] = 1;
fori(i, 1, MAX) { fat[i] = mult(fat[i - 1], i); }
}
void solve() {
preprocess();
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
int t = n + k;
int ans = 0;
fori(i, n, t + 1) {
int b = i - 1;
int c = comb(b, n - 1);
int f = t - i;
int p = mult(f_exp(26, f), f_exp(25, t - f - n));
ans = add(ans, mult(c, p));
}
cout << ans << endl;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
return 0;
}
| replace | 35 | 36 | 35 | 36 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> P;
typedef vector<P> vp;
typedef vector<string> vs;
typedef vector<bool> vb;
const ll mod = 1e9 + 7;
const ll inf = 1e16;
#define rep(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m - 1; i >= n; i--)
#define fi first
#define se second
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define eb(x) emplace_back(x)
#define all(x) x.begin(), x.end()
#define gll greater<ll>()
const ll nmax = 1000000;
ll fac[nmax], finv[nmax], inv[nmax];
void comint() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll 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(ll n, ll k) {
if (n < k || n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
void solve() {
ll k;
string s;
cin >> k >> s;
ll n = s.size();
comint();
ll ans = 0;
repr(i, n + k, n - 1) {
ll r = n + k - 1 - i;
ll tot = mod_pow(26, r) * mod_pow(25, k - r);
tot %= mod;
tot *= com(n + k - r - 1, n - 1);
tot %= mod;
ans += tot;
ans %= mod;
}
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
solve();
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> P;
typedef vector<P> vp;
typedef vector<string> vs;
typedef vector<bool> vb;
const ll mod = 1e9 + 7;
const ll inf = 1e16;
#define rep(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m - 1; i >= n; i--)
#define fi first
#define se second
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
#define eb(x) emplace_back(x)
#define all(x) x.begin(), x.end()
#define gll greater<ll>()
const ll nmax = 2000005;
ll fac[nmax], finv[nmax], inv[nmax];
void comint() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll 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(ll n, ll k) {
if (n < k || n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll mod_pow(ll x, ll n) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
void solve() {
ll k;
string s;
cin >> k >> s;
ll n = s.size();
comint();
ll ans = 0;
repr(i, n + k, n - 1) {
ll r = n + k - 1 - i;
ll tot = mod_pow(26, r) * mod_pow(25, k - r);
tot %= mod;
tot *= com(n + k - r - 1, n - 1);
tot %= mod;
ans += tot;
ans %= mod;
}
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
solve();
} | replace | 25 | 26 | 25 | 26 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1e6 + 5;
const ll mod = 1e9 + 7;
int k, n;
string s;
ll f[N], inv[N];
ll pw(ll x, ll i) {
ll b = 1;
for (; i; i >>= 1, x = x * x % mod)
if (i & 1)
b = b * x % mod;
return b;
}
ll ckn(int n, int k) { return f[n] * inv[k] % mod * inv[n - k] % mod; }
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> k >> s;
n = s.size();
s = ' ' + s;
ll ans = 0;
f[0] = 1;
for (int i = 1; i <= n + k; ++i)
f[i] = f[i - 1] * i % mod;
inv[n + k] = pw(f[n + k], mod - 2);
for (int i = n + k; i >= 1; --i)
inv[i - 1] = inv[i] * i % mod;
for (int i = 0; i <= k; ++i) {
ll tmp = pw(25, k - i) * pw(26, i) % mod * ckn(k - i + n - 1, n - 1) % mod;
ans = (ans + tmp) % mod;
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e6 + 5;
const ll mod = 1e9 + 7;
int k, n;
string s;
ll f[N], inv[N];
ll pw(ll x, ll i) {
ll b = 1;
for (; i; i >>= 1, x = x * x % mod)
if (i & 1)
b = b * x % mod;
return b;
}
ll ckn(int n, int k) { return f[n] * inv[k] % mod * inv[n - k] % mod; }
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> k >> s;
n = s.size();
s = ' ' + s;
ll ans = 0;
f[0] = 1;
for (int i = 1; i <= n + k; ++i)
f[i] = f[i - 1] * i % mod;
inv[n + k] = pw(f[n + k], mod - 2);
for (int i = n + k; i >= 1; --i)
inv[i - 1] = inv[i] * i % mod;
for (int i = 0; i <= k; ++i) {
ll tmp = pw(25, k - i) * pw(26, i) % mod * ckn(k - i + n - 1, n - 1) % mod;
ans = (ans + tmp) % mod;
}
cout << ans << '\n';
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02632 | C++ | Runtime Error | //
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
typedef pair<int, pint> ppint;
typedef pair<ll, pll> ppll;
typedef vector<int> vint;
typedef vector<ll> vll;
const double pi = M_PI;
const int INF10 = 1000000001;
const ll INF15 = 1e15 + 1;
const long long INF18 = 1e18 + 1;
const int mod = 1000000007;
// const int mod = 998244353;
const double EPS = 0.00001;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (ll)(n); i++)
#define rep2(i, start, end) for (int i = (ll)start; i <= (ll)end; i++)
#define vrep(i, n) for (int i = (ll)n - 1; i >= 0; i--)
#define vrep1(i, n) for (int i = (ll)n; i > 0; i--)
#define all(n) n.begin(), n.end()
#define pb push_back
#define debug(x) cerr << #x << ": " << x << '\n'
struct edge {
edge(int i, long c = 1) {
to = i;
cost = c;
}
int to;
long cost;
};
typedef vector<edge> vedge;
// bを何回足せばaを超えるか(O(a/b))
// a+b-1/bとすればよし
// 2進数表示したときの最高桁(O(log n))
int bi_max(long n) {
int m = 0;
for (m; (1 << m) <= n; m++)
;
m = m - 1;
return m;
}
// bi_eに二進数表示したやつを代入(O(log^2 n))
// bitset<N>
// a(n)でnの二進数表示が得られて、a[i]=0or1でi番目のfragが立ってるかわかる x^n
// mod m (nが負の時は０)(O(log n))
long myPow(long x, long n, long m = mod) {
if (n < 0)
return 0;
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
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; }
bool operator!=(const int a) { return this->x != a; }
bool operator==(const int a) { return this->x == 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];
}
};
template <class T> bool maxin(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool minin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class M, class N> constexpr common_type_t<M, N> gcd(M a, N b) {
a = abs(a);
b = abs(b);
if (a < b)
return gcd(b, a);
M r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
template <class M, class N> constexpr common_type_t<M, N> lcm(M a, N b) {
return a * b / gcd(a, b);
}
const int N_MAX = 100005;
int k;
string s;
void Main() {
int x = 0, y = INF10, z = 1;
// 入力
cin >> k;
cin >> s;
// 処理
int n = s.size();
mint ans;
combination c(2 * N_MAX);
rep2(i, n - 1, n + k - 1) {
ans += mint(25).pow(i + 1 - n) * mint(26).pow(n + k - i - 1) * c(i, n - 1);
}
// 出力
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
cout << fixed << setprecision(12);
Main();
} | //
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pint;
typedef pair<ll, ll> pll;
typedef pair<int, pint> ppint;
typedef pair<ll, pll> ppll;
typedef vector<int> vint;
typedef vector<ll> vll;
const double pi = M_PI;
const int INF10 = 1000000001;
const ll INF15 = 1e15 + 1;
const long long INF18 = 1e18 + 1;
const int mod = 1000000007;
// const int mod = 998244353;
const double EPS = 0.00001;
#define rep(i, n) for (int i = 0; i < (ll)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (ll)(n); i++)
#define rep2(i, start, end) for (int i = (ll)start; i <= (ll)end; i++)
#define vrep(i, n) for (int i = (ll)n - 1; i >= 0; i--)
#define vrep1(i, n) for (int i = (ll)n; i > 0; i--)
#define all(n) n.begin(), n.end()
#define pb push_back
#define debug(x) cerr << #x << ": " << x << '\n'
struct edge {
edge(int i, long c = 1) {
to = i;
cost = c;
}
int to;
long cost;
};
typedef vector<edge> vedge;
// bを何回足せばaを超えるか(O(a/b))
// a+b-1/bとすればよし
// 2進数表示したときの最高桁(O(log n))
int bi_max(long n) {
int m = 0;
for (m; (1 << m) <= n; m++)
;
m = m - 1;
return m;
}
// bi_eに二進数表示したやつを代入(O(log^2 n))
// bitset<N>
// a(n)でnの二進数表示が得られて、a[i]=0or1でi番目のfragが立ってるかわかる x^n
// mod m (nが負の時は０)(O(log n))
long myPow(long x, long n, long m = mod) {
if (n < 0)
return 0;
if (n == 0)
return 1;
if (n % 2 == 0)
return myPow(x * x % m, n / 2, m);
else
return x * myPow(x, n - 1, m) % m;
}
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
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; }
bool operator!=(const int a) { return this->x != a; }
bool operator==(const int a) { return this->x == 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];
}
};
template <class T> bool maxin(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool minin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class M, class N> constexpr common_type_t<M, N> gcd(M a, N b) {
a = abs(a);
b = abs(b);
if (a < b)
return gcd(b, a);
M r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
template <class M, class N> constexpr common_type_t<M, N> lcm(M a, N b) {
return a * b / gcd(a, b);
}
const int N_MAX = 1000005;
int k;
string s;
void Main() {
int x = 0, y = INF10, z = 1;
// 入力
cin >> k;
cin >> s;
// 処理
int n = s.size();
mint ans;
combination c(2 * N_MAX);
rep2(i, n - 1, n + k - 1) {
ans += mint(25).pow(i + 1 - n) * mint(26).pow(n + k - i - 1) * c(i, n - 1);
}
// 出力
cout << ans << endl;
}
int main() {
cin.tie(nullptr);
cout << fixed << setprecision(12);
Main();
} | replace | 158 | 159 | 158 | 159 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ggr \
getchar(); \
getchar(); \
return 0;
#define prique priority_queue
constexpr auto mod = 1000000007;
#define inf 1e15
#define key 1e9
using namespace std;
typedef pair<int, int> P;
template <class T> inline void chmax(T &a, T b) { a = std::max(a, b); }
template <class T> inline void chmin(T &a, T b) { a = std::min(a, b); }
// combination(Nが小さい時はこれを使う
const int MAX = 330000;
int fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long COMB(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
bool prime(int n) {
int cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0)
cnt++;
}
if (cnt != 1)
return false;
else
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
// 繰り返し二乗法（Nが大きい時の場合のcombination)
int mod_pow(int x, int y, int m) {
int res = 1;
while (y) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= (i % mod);
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
// UnionFind
class UnionFind {
protected:
int *par, *rank, *size;
public:
UnionFind(unsigned int size) {
par = new int[size];
rank = new int[size];
this->size = new int[size];
rep(i, size) {
par[i] = i;
rank[i] = 0;
this->size[i] = 1;
}
}
int find(int n) {
if (par[n] == n)
return n;
return par[n] = find(par[n]);
}
void unite(int n, int m) {
n = find(n);
m = find(m);
if (n == m)
return;
if (rank[n] < rank[m]) {
par[n] = m;
size[m] += size[n];
} else {
par[m] = n;
size[n] += size[m];
if (rank[n] == rank[m])
rank[n]++;
}
}
bool same(int n, int m) { return find(n) == find(m); }
int getsize(int n) { return size[find(n)]; }
};
int dight(int n) {
int ans = 1;
while (n >= 10) {
n /= 10;
ans++;
}
return ans;
}
int dight_sum(int n) {
int sum = 0;
rep(i, 20) sum += (n % (int)pow(10, i + 1)) / (pow(10, i));
return sum;
}
int dight_min(int n) {
int ans = 9;
while (n >= 10) {
ans = min(ans, n % 10);
n /= 10;
}
ans = min(ans, n);
return ans;
}
int dight_max(int n) {
int ans = 0;
while (n >= 10) {
ans = max(ans, n % 10);
n /= 10;
}
ans = max(ans, n);
return ans;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
string myxor(int a, int b) {
string s;
int ppp = a, qqq = b;
while (ppp != 0 || qqq != 0) {
int nn = ppp % 2;
int mm = qqq % 2;
if (nn == mm)
s += '0';
else
s += '1';
ppp /= 2;
qqq /= 2;
}
return s;
}
int k;
string s;
signed main() {
COMinit();
cin >> k >> s;
int n = s.size();
int ans = 0;
rep(i, k + 1) {
ans += ((mod_pow(26, i, mod) * COMB(n + k - i - 1, n - 1)) % mod *
mod_pow(25, k - i, mod)) %
mod;
ans %= mod;
}
cout << ans << endl;
ggr
}
| #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <time.h>
#include <vector>
#define int long long
#define double long double
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i <= n; i++)
#define ggr \
getchar(); \
getchar(); \
return 0;
#define prique priority_queue
constexpr auto mod = 1000000007;
#define inf 1e15
#define key 1e9
using namespace std;
typedef pair<int, int> P;
template <class T> inline void chmax(T &a, T b) { a = std::max(a, b); }
template <class T> inline void chmin(T &a, T b) { a = std::min(a, b); }
// combination(Nが小さい時はこれを使う
const int MAX = 2330000;
int fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long COMB(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
bool prime(int n) {
int cnt = 0;
for (int i = 1; i <= sqrt(n); i++) {
if (n % i == 0)
cnt++;
}
if (cnt != 1)
return false;
else
return n != 1;
}
int gcd(int x, int y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int lcm(int x, int y) { return x / gcd(x, y) * y; }
// 繰り返し二乗法（Nが大きい時の場合のcombination)
int mod_pow(int x, int y, int m) {
int res = 1;
while (y) {
if (y & 1) {
res = res * x % m;
}
x = x * x % m;
y >>= 1;
}
return res;
}
int kai(int x, int y) {
int res = 1;
for (int i = x - y + 1; i <= x; i++) {
res *= (i % mod);
res %= mod;
}
return res;
}
int comb(int x, int y) {
if (y > x)
return 0;
return kai(x, y) * mod_pow(kai(y, y), mod - 2, mod) % mod;
}
// UnionFind
class UnionFind {
protected:
int *par, *rank, *size;
public:
UnionFind(unsigned int size) {
par = new int[size];
rank = new int[size];
this->size = new int[size];
rep(i, size) {
par[i] = i;
rank[i] = 0;
this->size[i] = 1;
}
}
int find(int n) {
if (par[n] == n)
return n;
return par[n] = find(par[n]);
}
void unite(int n, int m) {
n = find(n);
m = find(m);
if (n == m)
return;
if (rank[n] < rank[m]) {
par[n] = m;
size[m] += size[n];
} else {
par[m] = n;
size[n] += size[m];
if (rank[n] == rank[m])
rank[n]++;
}
}
bool same(int n, int m) { return find(n) == find(m); }
int getsize(int n) { return size[find(n)]; }
};
int dight(int n) {
int ans = 1;
while (n >= 10) {
n /= 10;
ans++;
}
return ans;
}
int dight_sum(int n) {
int sum = 0;
rep(i, 20) sum += (n % (int)pow(10, i + 1)) / (pow(10, i));
return sum;
}
int dight_min(int n) {
int ans = 9;
while (n >= 10) {
ans = min(ans, n % 10);
n /= 10;
}
ans = min(ans, n);
return ans;
}
int dight_max(int n) {
int ans = 0;
while (n >= 10) {
ans = max(ans, n % 10);
n /= 10;
}
ans = max(ans, n);
return ans;
}
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
string myxor(int a, int b) {
string s;
int ppp = a, qqq = b;
while (ppp != 0 || qqq != 0) {
int nn = ppp % 2;
int mm = qqq % 2;
if (nn == mm)
s += '0';
else
s += '1';
ppp /= 2;
qqq /= 2;
}
return s;
}
int k;
string s;
signed main() {
COMinit();
cin >> k >> s;
int n = s.size();
int ans = 0;
rep(i, k + 1) {
ans += ((mod_pow(26, i, mod) * COMB(n + k - i - 1, n - 1)) % mod *
mod_pow(25, k - i, mod)) %
mod;
ans %= mod;
}
cout << ans << endl;
ggr
}
| replace | 27 | 28 | 27 | 28 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define fir first
#define sec second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<P, int> Q;
const int inf1 = 1e9 + 9;
const ll inf2 = 8e18 + 9;
const ll mol = 1e9 + 7;
const int maxn = 1e6 + 9;
const ll maxx = 1e5 + 9;
int n, len;
string s;
ll fac[maxn] = {1};
inline ll qpow(ll x, ll t) {
ll res = 1;
while (t) {
if (t & 1)
res = (res * x) % mol;
t >>= 1;
x = (x * x) % mol;
}
return res;
}
void init() {
cin >> n >> s;
len = s.size();
for (int i = 1; i < maxn; i++)
fac[i] = fac[i - 1] * i % mol;
}
inline ll inv(ll t) { return qpow(t, mol - 2); }
inline ll c(ll n, ll r) {
if (!n || !r)
return 1;
return fac[n] * inv(fac[r]) % mol * inv(fac[n - r]) % mol;
}
int main() {
init();
ll ans = 0;
for (int i = len; i <= len + n; i++) {
ll tmp = c(i - 1, len - 1);
tmp = (tmp * qpow(25, i - len)) % mol;
tmp = (tmp * qpow(26, len + n - i)) % mol;
ans = (ans + tmp) % mol;
}
cout << ans << endl;
}
| #include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#define fir first
#define sec second
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<P, int> Q;
const int inf1 = 1e9 + 9;
const ll inf2 = 8e18 + 9;
const ll mol = 1e9 + 7;
const int maxn = 2e6 + 9;
const ll maxx = 1e5 + 9;
int n, len;
string s;
ll fac[maxn] = {1};
inline ll qpow(ll x, ll t) {
ll res = 1;
while (t) {
if (t & 1)
res = (res * x) % mol;
t >>= 1;
x = (x * x) % mol;
}
return res;
}
void init() {
cin >> n >> s;
len = s.size();
for (int i = 1; i < maxn; i++)
fac[i] = fac[i - 1] * i % mol;
}
inline ll inv(ll t) { return qpow(t, mol - 2); }
inline ll c(ll n, ll r) {
if (!n || !r)
return 1;
return fac[n] * inv(fac[r]) % mol * inv(fac[n - r]) % mol;
}
int main() {
init();
ll ans = 0;
for (int i = len; i <= len + n; i++) {
ll tmp = c(i - 1, len - 1);
tmp = (tmp * qpow(25, i - len)) % mol;
tmp = (tmp * qpow(26, len + n - i)) % mol;
ans = (ans + tmp) % mol;
}
cout << ans << endl;
}
| replace | 26 | 27 | 26 | 27 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
ll n, m, ans = 0, fac[1000010];
string s;
ll mpow(ll a, ll n) {
int ret = 1;
for (ll i = n; i; i >>= 1, a = a * a % M)
if (i & 1)
ret = ret * a % M;
return ret;
}
int main() {
cin >> n >> s;
m = s.size();
fac[0] = 1;
for (int i = 1; i < m + n; i++)
fac[i] = (fac[i - 1] * i) % M;
for (int i = 0; i <= n; i++) {
ll c =
(fac[m + n - i - 1] * mpow((fac[m - 1] * fac[n - i]) % M, M - 2)) % M;
ans = (ans + (mpow(26, i) * c) % M * mpow(25, n - i)) % M;
}
cout << ans;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll M = 1e9 + 7;
ll n, m, ans = 0, fac[2000010];
string s;
ll mpow(ll a, ll n) {
int ret = 1;
for (ll i = n; i; i >>= 1, a = a * a % M)
if (i & 1)
ret = ret * a % M;
return ret;
}
int main() {
cin >> n >> s;
m = s.size();
fac[0] = 1;
for (int i = 1; i < m + n; i++)
fac[i] = (fac[i - 1] * i) % M;
for (int i = 0; i <= n; i++) {
ll c =
(fac[m + n - i - 1] * mpow((fac[m - 1] * fac[n - i]) % M, M - 2)) % M;
ans = (ans + (mpow(26, i) * c) % M * mpow(25, n - i)) % M;
}
cout << ans;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02632 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll N, K;
ll m;
string S;
ll d;
ll M = 1000000007;
vector<ll> fac(5000001); // n!(mod M)
vector<ll> ifac(5000001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) { // aCbをmod計算
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
int main() {
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 5000000; i++) {
fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
ifac[i + 1] =
ifac[i] * mpow(i + 1, M - 2) % M; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
cin >> K >> S;
N = S.size();
for (ll i = 0; i <= K; i++) {
d = comb(i + N - 1, N - 1);
d = (d * mpow(25, i)) % M;
d = (d * mpow(26, (K - i))) % M;
m = (m + d) % M;
}
cout << m << endl;
}
| #include <algorithm>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll N, K;
ll m;
string S;
ll d;
ll M = 1000000007;
vector<ll> fac(5000001); // n!(mod M)
vector<ll> ifac(5000001); // k!^{M-2} (mod M)
// a,bの範囲的にこれだけ配列を用意していけば十分
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) { // aCbをmod計算
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % M;
return tmp * fac[a] % M;
}
int main() {
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < 2000000; i++) {
fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
ifac[i + 1] =
ifac[i] * mpow(i + 1, M - 2) % M; // k!^{M-2} (mod M) ←累乗にmpowを採用
}
cin >> K >> S;
N = S.size();
for (ll i = 0; i <= K; i++) {
d = comb(i + N - 1, N - 1);
d = (d * mpow(25, i)) % M;
d = (d * mpow(26, (K - i))) % M;
m = (m + d) % M;
}
cout << m << endl;
}
| replace | 47 | 48 | 47 | 48 | TLE | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long int lli;
const lli M = 1e9 + 7, N = 1e6 + 5;
lli fact[N];
lli binpow(lli a, lli b) {
if (b == 0)
return 1;
lli res = binpow(a, b / 2);
res = (res * res) % M;
if (b % 2)
return (res * a) % M;
return res;
}
lli inv(lli a) { return binpow(a, M - 2); }
lli add(lli a, lli b) {
lli res = a + b;
if (res >= M)
return res - M;
return res;
}
lli mul(lli a, lli b) {
lli res = a * b;
if (res >= M)
return res % M;
return res;
}
lli sub(lli a, lli b) { return (a % M - b % M + M) % M; }
void pre() {
fact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = mul(fact[i - 1], i);
}
lli ncr(lli n, lli r) { return mul(fact[n], inv(mul(fact[n - r], fact[r]))); }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
pre();
lli k;
string s;
cin >> k >> s;
lli i, n = s.length(), ans = binpow(26, n + k);
for (i = 0; i < n; i++)
ans = sub(ans, mul(ncr(n + k, i), binpow(25, n + k - i)));
cout << ans;
return 0;
} | #include <bits/stdc++.h>
#define endl "\n"
using namespace std;
typedef long long int lli;
const lli M = 1e9 + 7, N = 2e6 + 5;
lli fact[N];
lli binpow(lli a, lli b) {
if (b == 0)
return 1;
lli res = binpow(a, b / 2);
res = (res * res) % M;
if (b % 2)
return (res * a) % M;
return res;
}
lli inv(lli a) { return binpow(a, M - 2); }
lli add(lli a, lli b) {
lli res = a + b;
if (res >= M)
return res - M;
return res;
}
lli mul(lli a, lli b) {
lli res = a * b;
if (res >= M)
return res % M;
return res;
}
lli sub(lli a, lli b) { return (a % M - b % M + M) % M; }
void pre() {
fact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = mul(fact[i - 1], i);
}
lli ncr(lli n, lli r) { return mul(fact[n], inv(mul(fact[n - r], fact[r]))); }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
pre();
lli k;
string s;
cin >> k >> s;
lli i, n = s.length(), ans = binpow(26, n + k);
for (i = 0; i < n; i++)
ans = sub(ans, mul(ncr(n + k, i), binpow(25, n + k - i)));
cout << ans;
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02632 | C++ | Runtime Error |
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T> void print(T x) { cout << x << endl; }
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll 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 {
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;
}
};
ostream &operator<<(ostream &os, const mint a) {
os << a.x;
return os;
}
////////////////////////////////
const int NMAX = int(1e6);
ll fact[NMAX + 1], finv[NMAX + 1], inv[NMAX + 1];
void comb_init(int N) {
// init
REP(i, 2) {
fact[i] = 1;
finv[i] = 1;
inv[i] = 1;
}
FOR(i, 2, N + 1) {
fact[i] = fact[i - 1] * i % MOD;
inv[i] = MOD - MOD / i * inv[MOD % i] % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
mint comb(int n, int k) {
if (n < k || n < 0 || k < 0)
return 0;
return mint(fact[n]) * finv[k] * finv[n - k];
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int K;
cin >> K;
string S;
cin >> S;
comb_init(K + S.size() + 10);
mint ans = 0;
REP(k, K + 1) {
mint c = comb(S.size() + k - 1, k);
ans += c * mint(25).pow(k) * mint(26).pow(K - k);
}
print(ans);
}
|
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <prettyprint.hpp>
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]: ", d_err(__VA_ARGS__);
#else
#define debug(...) 83;
#endif
void d_err() { cerr << endl; }
template <typename H, typename... T> void d_err(H h, T... t) {
cerr << h << " ";
d_err(t...);
}
template <typename T> void print(T x) { cout << x << endl; }
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define REP(i, n) FOR(i, 0, n)
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define bcnt __builtin_popcountll
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll, ll> Pll;
typedef pair<int, int> Pin;
ll INF = 1e16;
int inf = 1e9;
ll 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 {
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;
}
};
ostream &operator<<(ostream &os, const mint a) {
os << a.x;
return os;
}
////////////////////////////////
const int NMAX = int(1e7);
ll fact[NMAX + 1], finv[NMAX + 1], inv[NMAX + 1];
void comb_init(int N) {
// init
REP(i, 2) {
fact[i] = 1;
finv[i] = 1;
inv[i] = 1;
}
FOR(i, 2, N + 1) {
fact[i] = fact[i - 1] * i % MOD;
inv[i] = MOD - MOD / i * inv[MOD % i] % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
mint comb(int n, int k) {
if (n < k || n < 0 || k < 0)
return 0;
return mint(fact[n]) * finv[k] * finv[n - k];
}
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(20);
int K;
cin >> K;
string S;
cin >> S;
comb_init(K + S.size() + 10);
mint ans = 0;
REP(k, K + 1) {
mint c = comb(S.size() + k - 1, k);
ans += c * mint(25).pow(k) * mint(26).pow(K - k);
}
print(ans);
}
| replace | 99 | 100 | 99 | 100 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define all(v) v.begin(), v.end()
#define P pair<int, int>
#define len(s) (int)s.size()
#define pb push_back
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
constexpr int mod = 1e9 + 7;
constexpr int inf = 3e18;
int K;
string S;
int mod_pow(int x, int y, int m = mod) {
int res = 1;
while (y > 0) {
if (y & 1)
(res *= x) %= m;
(x *= x) %= m;
y >>= 1;
}
return res;
}
vector<int> perm, inv;
void init_perm() {
int x = 1e6 + 1;
perm.resize(x);
inv.resize(x);
perm[0] = 1;
REP(i, x + 1) perm[i] = perm[i - 1] * i % mod;
inv[x] = mod_pow(perm[x], mod - 2);
for (int i = x - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
int nCk(int x, int y) {
if (x < y)
return 0;
return perm[x] * inv[x - y] % mod * inv[y] % mod;
}
signed main() {
init_perm();
cin >> K >> S;
int N = K + len(S), M = len(S);
int ans = 0;
for (int i = M; i <= N; i++) {
int p = nCk(N, i);
int q = mod_pow(25, N - i);
ans += p * q % mod;
ans %= mod;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < n; i++)
#define REP(i, n) for (int i = 1; i < n; i++)
#define rev(i, n) for (int i = n - 1; i >= 0; i--)
#define all(v) v.begin(), v.end()
#define P pair<int, int>
#define len(s) (int)s.size()
#define pb push_back
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
constexpr int mod = 1e9 + 7;
constexpr int inf = 3e18;
int K;
string S;
int mod_pow(int x, int y, int m = mod) {
int res = 1;
while (y > 0) {
if (y & 1)
(res *= x) %= m;
(x *= x) %= m;
y >>= 1;
}
return res;
}
vector<int> perm, inv;
void init_perm() {
int x = 2e6 + 1;
perm.resize(x);
inv.resize(x);
perm[0] = 1;
REP(i, x + 1) perm[i] = perm[i - 1] * i % mod;
inv[x] = mod_pow(perm[x], mod - 2);
for (int i = x - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
int nCk(int x, int y) {
if (x < y)
return 0;
return perm[x] * inv[x - y] % mod * inv[y] % mod;
}
signed main() {
init_perm();
cin >> K >> S;
int N = K + len(S), M = len(S);
int ans = 0;
for (int i = M; i <= N; i++) {
int p = nCk(N, i);
int q = mod_pow(25, N - i);
ans += p * q % mod;
ans %= mod;
}
cout << ans << endl;
}
| replace | 42 | 43 | 42 | 43 | 0 | |
p02632 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MP make_pair
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define PLI pair<ll, int>
#define PIL pair<int, ll>
#define STR string
#define Fst first
#define Snd second
#define SHN 1e9
#define LSHN 1e18
using namespace std;
ll n, m;
char str[1000010];
ll md = 1e9 + 7;
ll inv[2000010];
ll ksm[2000010];
ll ksmi(ll x, ll y) {
ksm[0] = x;
for (int i = 1; i <= 60; i++)
ksm[i] = (ksm[i - 1] * ksm[i - 1]) % md;
ll res = 1;
for (int i = 0; i <= 60; i++)
if (y & (1ll << i))
res = (res * ksm[i]) % md;
return res;
}
int main() {
scanf("%lld%s", &n, &str);
string s = str;
m = s.size(), n += m;
for (int i = 1; i <= n; i++)
inv[i] = ksmi(i, md - 2);
vector<ll> com;
ll t = 1;
for (ll i = m - 1; i < n; i++) {
// cout <<t<<" ##\n";
if (!(m - 1))
com.push_back(1);
else {
com.push_back(t);
t = (t * inv[i - (m - 1) + 1]) % md;
t = (t * (i + 1)) % md;
}
}
// for (int i=0;i<com.size();i++) cout <<com[i]<<" ";
// cout <<"\n";
t = 1;
for (int i = 0; i < com.size(); i++)
com[i] = (com[i] * t) % md, t = (t * 25) % md;
ll res = 0;
for (int i = 0; i < com.size(); i++)
res = (((res * 26) % md) + com[i]) % md;
printf("%lld", res);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define MP make_pair
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define PLI pair<ll, int>
#define PIL pair<int, ll>
#define STR string
#define Fst first
#define Snd second
#define SHN 1e9
#define LSHN 1e18
using namespace std;
ll n, m;
char str[1000010];
ll md = 1e9 + 7;
ll inv[2000010];
ll ksm[2000010];
ll ksmi(ll x, ll y) {
ksm[0] = x;
for (int i = 1; i <= 60; i++)
ksm[i] = (ksm[i - 1] * ksm[i - 1]) % md;
ll res = 1;
for (int i = 0; i <= 60; i++)
if (y & (1ll << i))
res = (res * ksm[i]) % md;
return res;
}
int main() {
scanf("%lld%s", &n, &str);
string s = str;
m = s.size(), n += m;
for (int i = 1; i < n - (m - 1) + 1; i++)
inv[i] = ksmi(i, md - 2);
vector<ll> com;
ll t = 1;
for (ll i = m - 1; i < n; i++) {
// cout <<t<<" ##\n";
if (!(m - 1))
com.push_back(1);
else {
com.push_back(t);
t = (t * inv[i - (m - 1) + 1]) % md;
t = (t * (i + 1)) % md;
}
}
// for (int i=0;i<com.size();i++) cout <<com[i]<<" ";
// cout <<"\n";
t = 1;
for (int i = 0; i < com.size(); i++)
com[i] = (com[i] * t) % md, t = (t * 25) % md;
ll res = 0;
for (int i = 0; i < com.size(); i++)
res = (((res * 26) % md) + com[i]) % md;
printf("%lld", res);
return 0;
} | replace | 33 | 34 | 33 | 34 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.