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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02631 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#define int long long
#define rr register
#define inf 1e9
#define MAXN 1010
using namespace std;
inline int read() {
int s = 0, f = 0;
char ch = getchar();
while (!isdigit(ch))
f |= ch == '-', ch = getchar();
while (isdigit(ch))
s = s * 10 + (ch ^ 48), ch = getchar();
return f ? -s : s;
}
void print(int x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
print(x / 10);
putchar(x % 10 + 48);
}
int n, ans;
int a[MAXN];
signed main() {
n = read();
for (int i = 1; i <= n; i++)
a[i] = read(), ans ^= a[i];
for (int i = 1; i <= n; i++)
cout << (ans ^ a[i]) << " ";
puts("");
} | #include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#define int long long
#define rr register
#define inf 1e9
#define MAXN 200010
using namespace std;
inline int read() {
int s = 0, f = 0;
char ch = getchar();
while (!isdigit(ch))
f |= ch == '-', ch = getchar();
while (isdigit(ch))
s = s * 10 + (ch ^ 48), ch = getchar();
return f ? -s : s;
}
void print(int x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
print(x / 10);
putchar(x % 10 + 48);
}
int n, ans;
int a[MAXN];
signed main() {
n = read();
for (int i = 1; i <= n; i++)
a[i] = read(), ans ^= a[i];
for (int i = 1; i <= n; i++)
cout << (ans ^ a[i]) << " ";
puts("");
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02631 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define vll vector<ll>
#define print(x) \
for (auto it = x.begin(); it != x.end(); it++) \
cout << *it << ' '; \
cout << '\n';
#define debug(a, b, c) cout << a << " " << b << " " << c << endl;
#define in(x, n) \
for (int e = 0; e < n; e++) { \
int y; \
cin >> y; \
x.pb(y); \
}
#define inl(x, n) \
for (int e = 0; e < n; e++) { \
ll y; \
cin >> y; \
x.pb(y); \
}
#define lower(sl) transform(sl.begin(), sl.end(), sl.begin(), ::tolower);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vll a;
inl(a, n);
vll res;
int i = 1;
while (res.size() != n) {
int k = 0;
int c = 0;
while (k < n - 1) {
int pos = (i + k) % n;
c = c ^ a[pos];
k++;
}
i += 1;
res.pb(c);
}
print(res);
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define all(x) x.begin(), x.end()
#define vi vector<int>
#define vll vector<ll>
#define print(x) \
for (auto it = x.begin(); it != x.end(); it++) \
cout << *it << ' '; \
cout << '\n';
#define debug(a, b, c) cout << a << " " << b << " " << c << endl;
#define in(x, n) \
for (int e = 0; e < n; e++) { \
int y; \
cin >> y; \
x.pb(y); \
}
#define inl(x, n) \
for (int e = 0; e < n; e++) { \
ll y; \
cin >> y; \
x.pb(y); \
}
#define lower(sl) transform(sl.begin(), sl.end(), sl.begin(), ::tolower);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n;
cin >> n;
vll a;
inl(a, n);
vll res;
int x = 0;
for (int i = 0; i < n; i++) {
x ^= a[i];
}
int s = 0;
for (int i = 0; i < n; i++) {
s = x ^ a[i];
res.pb(s);
}
print(res);
}
| replace | 34 | 45 | 34 | 43 | TLE | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int mas[100000], input[100000];
int main() {
int n, p, in, pans = 0;
cin >> n >> p;
input[0] = p;
mas[0] = 0;
for (int i = 1; i < n; i++) {
cin >> input[i];
in = input[i];
int k = pans ^ in ^ p;
mas[i] = k;
pans = k;
p = in;
}
int test = 0;
for (int i = 1; i < n; i++) {
test ^= mas[i];
}
pans = test ^ input[0];
p = input[0];
cout << pans << " ";
for (int i = 1; i < n; i++) {
in = input[i];
int k = pans ^ in ^ p;
cout << k << " ";
pans = k;
p = in;
}
}
| #include <bits/stdc++.h>
using namespace std;
int mas[200005], input[200005];
int main() {
int n, p, in, pans = 0;
cin >> n >> p;
input[0] = p;
mas[0] = 0;
for (int i = 1; i < n; i++) {
cin >> input[i];
in = input[i];
int k = pans ^ in ^ p;
mas[i] = k;
pans = k;
p = in;
}
int test = 0;
for (int i = 1; i < n; i++) {
test ^= mas[i];
}
pans = test ^ input[0];
p = input[0];
cout << pans << " ";
for (int i = 1; i < n; i++) {
in = input[i];
int k = pans ^ in ^ p;
cout << k << " ";
pans = k;
p = in;
}
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02631 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define DEBUG(x) cout << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cout << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cout << " " << v[i]; \
cout << endl
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout << setprecision(15) << fixed << p << endl;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
typedef long long ll;
typedef unsigned long long ull;
const ull INF = 1e18;
using namespace std;
int main() {
int n;
cin >> n;
int lst[n];
rep(i, 0, n) { cin >> lst[i]; }
rep(i, 0, n) {
int tmp = 0;
rep(j, 0, n) {
if (i == j)
continue;
tmp ^= lst[j];
}
cout << tmp << endl;
}
return 0;
}
| #include "bits/stdc++.h"
#define DEBUG(x) cout << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cout << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cout << " " << v[i]; \
cout << endl
#define vi vector<int>
#define vl vector<ll>
#define vvi vector<vector<int>>
#define vvl vector<vector<ll>>
#define vs vector<string>
#define pii pair<int, int>
#define pis pair<int, string>
#define psi pair<string, int>
#define pll pair<ll, ll>
#define rep(i, begin, end) \
for (__typeof(end) i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define MOD 1000000007
#define mod 1000000009
#define pi 3.14159265358979323846
#define Sp(p) cout << setprecision(15) << fixed << p << endl;
int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
int dx2[8] = {1, 1, 0, -1, -1, -1, 0, 1}, dy2[8] = {0, 1, 1, 1, 0, -1, -1, -1};
typedef long long ll;
typedef unsigned long long ull;
const ull INF = 1e18;
using namespace std;
int main() {
int n;
cin >> n;
int lst[n];
rep(i, 0, n) { cin >> lst[i]; }
int tmp = 0;
rep(i, 1, n) { tmp ^= lst[i]; }
cout << tmp << endl;
lst[0] ^= tmp;
rep(i, 1, n) {
lst[i] ^= lst[0];
cout << lst[i] << endl;
}
return 0;
}
| replace | 35 | 43 | 35 | 42 | TLE | |
p02631 | C++ | Runtime Error | // BISMILLAHIR RAHMANIR RAHIM
#include <bits/stdc++.h>
#define mem(a, b) (memset(a, b, sizeof(a)))
#define pb push_back
#define mk make_pair
#define ff first
#define ss second
#define PI acos(-1)
#define INF 2147483647
#define MOD 1000000007
#define MAX 100005
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<int, ii> pii;
typedef vector<ii> vii;
typedef priority_queue<int, vector<int>, greater<int>> PQ;
int Set(int mask, int pos) { return mask = mask | (1 << pos); }
bool check(int mask, int pos) { return (bool)(mask & (1 << pos)); }
int arr[MAX], cnt[32];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> ans(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
for (int j = 0; j < 31; j++) {
if (check(arr[i], j))
cnt[j]++;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < 31; j++) {
if (check(arr[i], j))
cnt[j]--;
}
int res = 0;
for (int j = 0; j < 31; j++) {
if (cnt[j] & 1) {
res += (1 << j);
}
}
ans[i] = res;
for (int j = 0; j < 31; j++) {
if (check(arr[i], j))
cnt[j]--;
}
}
for (int i = 0; i < n - 1; i++)
cout << ans[i] << " ";
cout << ans[n - 1] << endl;
return 0;
}
| // BISMILLAHIR RAHMANIR RAHIM
#include <bits/stdc++.h>
#define mem(a, b) (memset(a, b, sizeof(a)))
#define pb push_back
#define mk make_pair
#define ff first
#define ss second
#define PI acos(-1)
#define INF 2147483647
#define MOD 1000000007
#define MAX 200005
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef pair<int, ii> pii;
typedef vector<ii> vii;
typedef priority_queue<int, vector<int>, greater<int>> PQ;
int Set(int mask, int pos) { return mask = mask | (1 << pos); }
bool check(int mask, int pos) { return (bool)(mask & (1 << pos)); }
int arr[MAX], cnt[32];
int main() {
ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
int n;
cin >> n;
vector<int> ans(n);
for (int i = 0; i < n; i++) {
cin >> arr[i];
for (int j = 0; j < 31; j++) {
if (check(arr[i], j))
cnt[j]++;
}
}
for (int i = 0; i < n; i++) {
for (int j = 0; j < 31; j++) {
if (check(arr[i], j))
cnt[j]--;
}
int res = 0;
for (int j = 0; j < 31; j++) {
if (cnt[j] & 1) {
res += (1 << j);
}
}
ans[i] = res;
for (int j = 0; j < 31; j++) {
if (check(arr[i], j))
cnt[j]--;
}
}
for (int i = 0; i < n - 1; i++)
cout << ans[i] << " ";
cout << ans[n - 1] << endl;
return 0;
}
| replace | 10 | 11 | 10 | 11 | 0 | |
p02631 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
#define ll long long
map<int, int> mo;
const int maxn = 1e5 + 5;
int a[maxn], b[maxn];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int xsum = a[0];
for (int i = 1; i < n; i++) {
xsum ^= a[i];
}
for (int i = 0; i < n; i++) {
cout << (a[i] ^ xsum) << " ";
}
} | #include <algorithm>
#include <iostream>
#include <map>
using namespace std;
#define ll long long
map<int, int> mo;
const int maxn = 2e5 + 5;
int a[maxn], b[maxn];
int main() {
int n;
cin >> n;
for (int i = 0; i < n; i++)
cin >> a[i];
int xsum = a[0];
for (int i = 1; i < n; i++) {
xsum ^= a[i];
}
for (int i = 0; i < n; i++) {
cout << (a[i] ^ xsum) << " ";
}
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define INF 0x3f3f3f3f
typedef vector<int> VI;
typedef long long ll;
typedef pair<int, int> PII;
typedef double db;
const ll mod = 1000000007;
const double PI = acos(-1.0);
const double epsilon = PI / 180.0; // 角度转弧度
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 gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const int N = 1e5 + 10;
int a[N];
int main() {
int n;
cin >> n;
int sum = 0;
rep(i, 1, n + 1) scanf("%d", &a[i]), sum ^= a[i];
rep(i, 1, n + 1) cout << (sum ^ a[i]) << " ";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, a, n) for (int i = a; i < n; i++)
#define per(i, a, n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
#define INF 0x3f3f3f3f
typedef vector<int> VI;
typedef long long ll;
typedef pair<int, int> PII;
typedef double db;
const ll mod = 1000000007;
const double PI = acos(-1.0);
const double epsilon = PI / 180.0; // 角度转弧度
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 gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
const int N = 2e5 + 10;
int a[N];
int main() {
int n;
cin >> n;
int sum = 0;
rep(i, 1, n + 1) scanf("%d", &a[i]), sum ^= a[i];
rep(i, 1, n + 1) cout << (sum ^ a[i]) << " ";
return 0;
} | replace | 30 | 31 | 30 | 31 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x) {
x = 0;
T f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -1;
for (; isdigit(c); c = getchar())
x = (x << 1) + (x << 3) + (c ^ 48);
x *= f;
}
template <typename T> inline void w(T x) {
if (x > 9)
w(x / 10);
putchar(x % 10 + 48);
}
template <typename T> inline void write(T x, char c) {
if (x < 0) {
putchar('-');
x = -x;
}
w(x);
putchar(c);
}
int a[100005];
int main() {
int n;
int s = 0;
read(n);
for (int i = 1; i <= n; i++) {
read(a[i]);
s ^= a[i];
}
for (int i = 1; i < n; i++) {
write(s ^ a[i], ' ');
}
write(s ^ a[n], '\n');
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <typename T> inline void read(T &x) {
x = 0;
T f = 1;
char c = getchar();
for (; !isdigit(c); c = getchar())
if (c == '-')
f = -1;
for (; isdigit(c); c = getchar())
x = (x << 1) + (x << 3) + (c ^ 48);
x *= f;
}
template <typename T> inline void w(T x) {
if (x > 9)
w(x / 10);
putchar(x % 10 + 48);
}
template <typename T> inline void write(T x, char c) {
if (x < 0) {
putchar('-');
x = -x;
}
w(x);
putchar(c);
}
int a[200005];
int main() {
int n;
int s = 0;
read(n);
for (int i = 1; i <= n; i++) {
read(a[i]);
s ^= a[i];
}
for (int i = 1; i < n; i++) {
write(s ^ a[i], ' ');
}
write(s ^ a[n], '\n');
return 0;
}
| replace | 26 | 27 | 26 | 27 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p;
vector<ll> v;
ll arr[100001] = {0};
int main() {
ll n, k, a, b, c, ans = 0;
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
ans ^= arr[i];
}
// cout<<arr[1]<<endl;
for (ll i = 0; i < n; i++) {
b = ans ^ arr[i];
cout << b << " ";
}
cout << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> p;
vector<ll> v;
ll arr[200001];
int main() {
ll n, k, a, b, c, ans = 0;
cin >> n;
for (ll i = 0; i < n; i++) {
cin >> arr[i];
ans ^= arr[i];
}
// cout<<arr[1]<<endl;
for (ll i = 0; i < n; i++) {
b = ans ^ arr[i];
cout << b << " ";
}
cout << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02631 | C++ | Time Limit Exceeded | /* https://codeforces.com/contest/1360/problem/H */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vs = vector<string>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vpi = vector<pair<int, int>>;
using vpl = vector<pair<ll, ll>>;
using ld = double;
#define f first
#define s second
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define ins insert
const int MAX = 1e5;
int main() {
int N;
cin >> N;
vl a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vl ans(N);
for (int i = 0; i < N; ++i) {
ll temp = 0;
for (int j = 0; j < N; ++j) {
if (i == j)
continue;
temp ^= a[j];
}
ans[i] = temp;
}
for (auto const &x : ans) {
cout << x << " ";
}
cout << endl;
return 0;
}
| /* https://codeforces.com/contest/1360/problem/H */
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vs = vector<string>;
using vi = vector<int>;
using vl = vector<ll>;
using vb = vector<bool>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using vpi = vector<pair<int, int>>;
using vpl = vector<pair<ll, ll>>;
using ld = double;
#define f first
#define s second
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n)-1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define ins insert
const int MAX = 1e5;
int main() {
int N;
cin >> N;
vl a(N);
for (int i = 0; i < N; ++i) {
cin >> a[i];
}
vl ans(N);
for (int i = 0; i < N; ++i) {
ll temp = 0;
for (int j = 0; j < N; ++j) {
if (i == j)
continue;
temp ^= a[j];
}
ans[i] = temp;
break;
}
for (int i = 1; i < N; ++i) {
ans[i] = ans[0] ^ a[i] ^ a[0];
}
for (auto const &x : ans) {
cout << x << " ";
}
cout << endl;
return 0;
}
| insert | 48 | 48 | 48 | 53 | TLE | |
p02631 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> x(20, 0);
ll maxNum = 0;
rep(i, n) {
cin >> a[i];
ll now = a[i];
ll s = 0;
while (now) {
if (now & 1) {
x[s]++;
x[s] %= 2;
}
now >>= 1;
s++;
maxNum = max(maxNum, s);
}
}
rep(i, n) {
ll ans = 0;
rep(s, maxNum) {
if (((x[s] + (a[i] & 1)) % 2 == 1))
ans += (1LL << s);
a[i] >>= 1;
}
if (i == n - 1)
cout << ans << endl;
else
cout << ans << ' ';
}
return 0;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <vector>
using ll = long long;
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
int main() {
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> x(60, 0);
ll maxNum = 0;
rep(i, n) {
cin >> a[i];
ll now = a[i];
ll s = 0;
while (now) {
if (now & 1) {
x[s]++;
x[s] %= 2;
}
now >>= 1;
s++;
maxNum = max(maxNum, s);
}
}
rep(i, n) {
ll ans = 0;
rep(s, maxNum) {
if (((x[s] + (a[i] & 1)) % 2 == 1))
ans += (1LL << s);
a[i] >>= 1;
}
if (i == n - 1)
cout << ans << endl;
else
cout << ans << ' ';
}
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MEM 100006
#define sanic ios_base::sync_with_stdio(0)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const ll MOD = 1e9 + 7;
ll n, m, sum;
ll c[MEM];
string s;
int main() {
sanic;
cin.tie(0);
cin >> n;
ll sxm = 0;
for (int i = 0; i < n; i++) {
cin >> c[i];
sxm ^= c[i];
}
for (int i = 0; i < n; i++)
cout << (sxm ^ c[i]) << ' ';
}
| #include <bits/stdc++.h>
#define MEM 200006
#define sanic ios_base::sync_with_stdio(0)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pii;
const ll MOD = 1e9 + 7;
ll n, m, sum;
ll c[MEM];
string s;
int main() {
sanic;
cin.tie(0);
cin >> n;
ll sxm = 0;
for (int i = 0; i < n; i++) {
cin >> c[i];
sxm ^= c[i];
}
for (int i = 0; i < n; i++)
cout << (sxm ^ c[i]) << ' ';
}
| replace | 1 | 2 | 1 | 2 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define LL long long
#define ULL unsigned long long
const LL INF = 1LL << 59;
const double PI = 2.0 * acos(0.0);
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
//// Including Policy Based DS
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
//
/////cout<<*X.find_by_order(1)<<endl;
/////cout<<X.order_of_key(-5)<<endl;
//
// typedef tree<
// int,
// null_type,
// less< int >,
// rb_tree_tag,
// tree_order_statistics_node_update>
// ordered_set;
#define READ freopen("in.txt", "r", stdin)
#define WRITE freopen("out.txt", "w", stdout)
#define BOOST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define sf scanf
#define pf printf
#define F first
#define S second
#define pb push_back
#define NL pf("\n")
#define ALL(v) v.begin(), v.end()
#define si(x) sf("%d", &x);
#define sii(x, y) sf("%d%d", &x, &y);
#define siii(x, y, z) sf("%d%d%d", &x, &y, &z);
#define sl(x) sf("%lld", &x);
#define sll(x, y) sf("%lld%lld", &x, &y);
#define slll(x, y, z) sf("%lld%lld%lld", &x, &y, &z);
#define sqr(x) ((x) * (x))
#define mem(x, y) memset(x, y, sizeof x)
#define ch printf("Came Here!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n")
#define deb(x) cerr << #x << " === " << x << "\n"
#define SV(v) sort(v.begin(), v.end())
#define SVR(v, cmp) sort(v.begin(), v.end(), cmp)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define cnd tree[idx]
#define lc tree[idx * 2]
#define rc tree[idx * 2 + 1]
#define lnd (2 * idx), (b), ((b + e) / 2)
#define rnd ((2 * idx) + 1), (((b + e) / 2) + 1), (e)
// graph direction array [4]
int X[4] = {0, 0, -1, 1};
int Y[4] = {1, -1, 0, 0};
// graph direction array [8]
// int X[8]={0,0,1,-1,-1,1,1,-1};
// int Y[8]={1,-1,0,0,-1,-1,1,1};
// Bishop direction array [8]
// int X[8]={0,0,1,-1,-1,1,1,-1};
// int Y[8]={1,-1,0,0,-1,-1,1,1};
// Knight Direction Array
// int KX[8] = {1,1,2,2,-1,-1,-2,-2};
// int KY[8] = {2,-2,1,-1,2,-2,1,-1};
// Bit Operations
#define popcountL __builtin_popcountll
#define popcount __builtin_popcount
inline bool checkBit(int N, int pos) {
return (bool)(N & (1 << pos));
} // check bit
inline int setBit(int N, int pos) { return N = N | (1 << pos); } // set bit
inline int unsetBit(int N, int pos) {
return N = (N & (~(1 << pos)));
} // unset bit
inline int toggleBit(int N, int pos) {
return N = (N ^ (1 << pos));
} // toggle bit
inline LL modMul(LL a, LL b, LL mod) {
LL ans = 0;
a = a % mod;
while (b > 0) {
if (b % 2)
ans = (ans % mod + a % mod) % mod;
a = (a % mod * 2 % mod) % mod;
b /= 2;
}
return ans % mod;
}
inline LL powerMod(LL a, LL b, LL mod) {
if (b == 0)
return 1LL % mod;
LL x = powerMod(a, b / 2, mod);
x = (x % mod * x % mod) % mod;
if (b % 2 == 1)
x = (x % mod * a % mod) % mod;
return x % mod;
}
inline LL lcm(LL a, LL b) {
LL g = __gcd(a, b);
return ((a / g) * b);
}
//-------------------------------------------------------------------------------
//-------------------------------------------------------------------------------
const int mx = 1e5 + 5;
LL arr[mx];
int main() {
// BOOST;
#ifdef MujahidPC
double start = clock();
// READ;
// WRITE;
#endif
int t, n, m, k;
LL x = 0;
cin >> n;
FOR(i, n) cin >> arr[i], x ^= arr[i];
FOR(i, n) { cout << (x ^ (arr[i])) << " "; }
cout << endl;
#ifdef MujahidPC
double tim = (clock() - start) / CLOCKS_PER_SEC;
cerr << "Running Time : " << tim << " \n";
#endif
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define endl "\n"
#define LL long long
#define ULL unsigned long long
const LL INF = 1LL << 59;
const double PI = 2.0 * acos(0.0);
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef vector<pii> vii;
typedef vector<pll> vll;
//// Including Policy Based DS
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;
//
/////cout<<*X.find_by_order(1)<<endl;
/////cout<<X.order_of_key(-5)<<endl;
//
// typedef tree<
// int,
// null_type,
// less< int >,
// rb_tree_tag,
// tree_order_statistics_node_update>
// ordered_set;
#define READ freopen("in.txt", "r", stdin)
#define WRITE freopen("out.txt", "w", stdout)
#define BOOST \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define sf scanf
#define pf printf
#define F first
#define S second
#define pb push_back
#define NL pf("\n")
#define ALL(v) v.begin(), v.end()
#define si(x) sf("%d", &x);
#define sii(x, y) sf("%d%d", &x, &y);
#define siii(x, y, z) sf("%d%d%d", &x, &y, &z);
#define sl(x) sf("%lld", &x);
#define sll(x, y) sf("%lld%lld", &x, &y);
#define slll(x, y, z) sf("%lld%lld%lld", &x, &y, &z);
#define sqr(x) ((x) * (x))
#define mem(x, y) memset(x, y, sizeof x)
#define ch printf("Came Here!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!\n")
#define deb(x) cerr << #x << " === " << x << "\n"
#define SV(v) sort(v.begin(), v.end())
#define SVR(v, cmp) sort(v.begin(), v.end(), cmp)
#define FOR(i, n) for (int i = 0; i < n; i++)
#define cnd tree[idx]
#define lc tree[idx * 2]
#define rc tree[idx * 2 + 1]
#define lnd (2 * idx), (b), ((b + e) / 2)
#define rnd ((2 * idx) + 1), (((b + e) / 2) + 1), (e)
// graph direction array [4]
int X[4] = {0, 0, -1, 1};
int Y[4] = {1, -1, 0, 0};
// graph direction array [8]
// int X[8]={0,0,1,-1,-1,1,1,-1};
// int Y[8]={1,-1,0,0,-1,-1,1,1};
// Bishop direction array [8]
// int X[8]={0,0,1,-1,-1,1,1,-1};
// int Y[8]={1,-1,0,0,-1,-1,1,1};
// Knight Direction Array
// int KX[8] = {1,1,2,2,-1,-1,-2,-2};
// int KY[8] = {2,-2,1,-1,2,-2,1,-1};
// Bit Operations
#define popcountL __builtin_popcountll
#define popcount __builtin_popcount
inline bool checkBit(int N, int pos) {
return (bool)(N & (1 << pos));
} // check bit
inline int setBit(int N, int pos) { return N = N | (1 << pos); } // set bit
inline int unsetBit(int N, int pos) {
return N = (N & (~(1 << pos)));
} // unset bit
inline int toggleBit(int N, int pos) {
return N = (N ^ (1 << pos));
} // toggle bit
inline LL modMul(LL a, LL b, LL mod) {
LL ans = 0;
a = a % mod;
while (b > 0) {
if (b % 2)
ans = (ans % mod + a % mod) % mod;
a = (a % mod * 2 % mod) % mod;
b /= 2;
}
return ans % mod;
}
inline LL powerMod(LL a, LL b, LL mod) {
if (b == 0)
return 1LL % mod;
LL x = powerMod(a, b / 2, mod);
x = (x % mod * x % mod) % mod;
if (b % 2 == 1)
x = (x % mod * a % mod) % mod;
return x % mod;
}
inline LL lcm(LL a, LL b) {
LL g = __gcd(a, b);
return ((a / g) * b);
}
//-------------------------------------------------------------------------------
//-------------------------------------------------------------------------------
const int mx = 2e5 + 5;
LL arr[mx];
int main() {
// BOOST;
#ifdef MujahidPC
double start = clock();
// READ;
// WRITE;
#endif
int t, n, m, k;
LL x = 0;
cin >> n;
FOR(i, n) cin >> arr[i], x ^= arr[i];
FOR(i, n) { cout << (x ^ (arr[i])) << " "; }
cout << endl;
#ifdef MujahidPC
double tim = (clock() - start) / CLOCKS_PER_SEC;
cerr << "Running Time : " << tim << " \n";
#endif
return 0;
}
| replace | 118 | 119 | 118 | 119 | 0 | |
p02631 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ar[100000];
cin >> n;
long x = 0;
for (int i = 0; i < n; i++) {
cin >> ar[i];
x ^= ar[i];
}
for (int i = 0; i < n; i++) {
ar[i] ^= x;
}
for (int i = 0; i < n; i++)
cout << ar[i] << " ";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
int main() {
int n, ar[200000];
cin >> n;
long x = 0;
for (int i = 0; i < n; i++) {
cin >> ar[i];
x ^= ar[i];
}
for (int i = 0; i < n; i++) {
ar[i] ^= x;
}
for (int i = 0; i < n; i++)
cout << ar[i] << " ";
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define FIND(v, x) (binary_search(ALL(v), (x)))
#define SORT(v) sort(ALL(v))
#define RSORT(v) \
sort(ALL(v)); \
reverse(ALL(v))
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define pb push_back
#define fi first
#define se second
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
cout << a << " ";
pr(b, c, d);
}
template <class T> void pr_vec(vector<T> &v, char ep = ' ') {
int n = v.size();
REP(ni, n) {
cout << v[ni];
if (ni != n - 1)
cout << ep;
}
cout << endl;
};
template <class T> inline bool chmin(T &a, T b) {
return a > b ? a = b, true : false;
}
template <class T> inline bool chmax(T &a, T b) {
return a < b ? a = b, true : false;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <uint32_t mod> struct ModInt {
uint32_t a;
ModInt &s(uint32_t vv) {
a = vv < mod ? vv : vv - mod;
return *this;
}
ModInt(int64_t x = 0) { s(x % mod + mod); }
ModInt &operator+=(const ModInt &x) { return s(a + x.a); }
ModInt &operator-=(const ModInt &x) { return s(a + mod - x.a); }
ModInt &operator*=(const ModInt &x) {
a = uint64_t(a) * x.a % mod;
return *this;
}
ModInt &operator/=(const ModInt &x) {
*this *= x.inv();
return *this;
}
ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }
bool operator==(const ModInt &x) const { return a == x.a; }
bool operator!=(const ModInt &x) const { return a != x.a; }
bool operator<(const ModInt &x) const { return a < x.a; }
ModInt operator-() const { return ModInt() - *this; }
ModInt pow(int64_t n) const {
ModInt res(1), x(*this);
while (n) {
if (n & 1)
res *= x;
x *= x;
n >>= 1;
}
return res;
}
ModInt inv() const { return pow(mod - 2); }
};
template <uint32_t mod> istream &operator>>(istream &in, ModInt<mod> &a) {
return (in >> a.a);
}
template <uint32_t mod>
ostream &operator<<(ostream &out, const ModInt<mod> &a) {
return (out << a.a);
}
using mint = ModInt<MOD>;
vector<mint> inv, fact, invfact;
void mod_build(int n = 200005) {
fact.assign(n + 1, mint(1));
inv.assign(n + 1, mint(1));
invfact.assign(n + 1, mint(1));
REP(i, n) {
fact[i + 1] = fact[i] * mint(i + 1);
if (i > 0)
inv[i + 1] = mint() - inv[MOD % (i + 1)] * mint(MOD / (i + 1));
invfact[i + 1] = invfact[i] * inv[i + 1];
}
}
mint perm(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return fact[n] * invfact[n - k];
}
mint comb(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return (fact[n] * invfact[n - k]) * invfact[k];
}
// O(n)が間に合わなさそうなnに対応したcomb
// フェルマーの小定理と逆元を用いて計算
mint comb2(ll n, int k) {
mint X(n), Y(1);
REP(i, k - 1) {
X *= n - i - 1;
Y *= i + 2;
}
return X * Y.pow(MOD - 2);
}
int main(void) {
int K;
cin >> K;
string S;
cin >> S;
int n = S.size();
mod_build();
mint ans = 0;
Rep(i, 0, K + 1) {
ans += comb(n + K - i - 1, n - 1) * mint(26).pow(i) * mint(25).pow(K - i);
}
pr(ans);
} | #include <bits/stdc++.h>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9 + 7))
#define REP(i, n) for (int i = 0; i < int(n); ++i)
#define Rep(i, sta, n) for (int i = sta; i < n; i++)
#define RREP(i, n) for (int i = int(n) - 1; i >= 0; --i)
#define ALL(v) v.begin(), v.end()
#define FIND(v, x) (binary_search(ALL(v), (x)))
#define SORT(v) sort(ALL(v))
#define RSORT(v) \
sort(ALL(v)); \
reverse(ALL(v))
#define DEBUG(x) cerr << #x << ": " << x << endl;
#define DEBUG_VEC(v) \
cerr << #v << ":"; \
for (int i = 0; i < v.size(); i++) \
cerr << " " << v[i]; \
cerr << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define pb push_back
#define fi first
#define se second
using namespace std;
template <class A> void pr(A a) { cout << (a) << endl; }
template <class A, class B> void pr(A a, B b) {
cout << a << " ";
pr(b);
}
template <class A, class B, class C> void pr(A a, B b, C c) {
cout << a << " ";
pr(b, c);
}
template <class A, class B, class C, class D> void pr(A a, B b, C c, D d) {
cout << a << " ";
pr(b, c, d);
}
template <class T> void pr_vec(vector<T> &v, char ep = ' ') {
int n = v.size();
REP(ni, n) {
cout << v[ni];
if (ni != n - 1)
cout << ep;
}
cout << endl;
};
template <class T> inline bool chmin(T &a, T b) {
return a > b ? a = b, true : false;
}
template <class T> inline bool chmax(T &a, T b) {
return a < b ? a = b, true : false;
}
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
template <uint32_t mod> struct ModInt {
uint32_t a;
ModInt &s(uint32_t vv) {
a = vv < mod ? vv : vv - mod;
return *this;
}
ModInt(int64_t x = 0) { s(x % mod + mod); }
ModInt &operator+=(const ModInt &x) { return s(a + x.a); }
ModInt &operator-=(const ModInt &x) { return s(a + mod - x.a); }
ModInt &operator*=(const ModInt &x) {
a = uint64_t(a) * x.a % mod;
return *this;
}
ModInt &operator/=(const ModInt &x) {
*this *= x.inv();
return *this;
}
ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }
bool operator==(const ModInt &x) const { return a == x.a; }
bool operator!=(const ModInt &x) const { return a != x.a; }
bool operator<(const ModInt &x) const { return a < x.a; }
ModInt operator-() const { return ModInt() - *this; }
ModInt pow(int64_t n) const {
ModInt res(1), x(*this);
while (n) {
if (n & 1)
res *= x;
x *= x;
n >>= 1;
}
return res;
}
ModInt inv() const { return pow(mod - 2); }
};
template <uint32_t mod> istream &operator>>(istream &in, ModInt<mod> &a) {
return (in >> a.a);
}
template <uint32_t mod>
ostream &operator<<(ostream &out, const ModInt<mod> &a) {
return (out << a.a);
}
using mint = ModInt<MOD>;
vector<mint> inv, fact, invfact;
void mod_build(int n = 2000010) {
fact.assign(n + 1, mint(1));
inv.assign(n + 1, mint(1));
invfact.assign(n + 1, mint(1));
REP(i, n) {
fact[i + 1] = fact[i] * mint(i + 1);
if (i > 0)
inv[i + 1] = mint() - inv[MOD % (i + 1)] * mint(MOD / (i + 1));
invfact[i + 1] = invfact[i] * inv[i + 1];
}
}
mint perm(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return fact[n] * invfact[n - k];
}
mint comb(int n, int k) {
if (n < 0 || k < 0 || k > n)
return 0;
return (fact[n] * invfact[n - k]) * invfact[k];
}
// O(n)が間に合わなさそうなnに対応したcomb
// フェルマーの小定理と逆元を用いて計算
mint comb2(ll n, int k) {
mint X(n), Y(1);
REP(i, k - 1) {
X *= n - i - 1;
Y *= i + 2;
}
return X * Y.pow(MOD - 2);
}
int main(void) {
int K;
cin >> K;
string S;
cin >> S;
int n = S.size();
mod_build();
mint ans = 0;
Rep(i, 0, K + 1) {
ans += comb(n + K - i - 1, n - 1) * mint(26).pow(i) * mint(25).pow(K - i);
}
pr(ans);
} | replace | 113 | 114 | 113 | 114 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
#define pb push_back
#define pf push_front
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (long long)(x).size()
#define sqr(x) (x) * (x)
#define sof sizeof
#define resz resize
#define ins insert
#define lowerB lower_bound
#define upperB upper_bound
#define mkp make_pair
#define mkt make_tuple
#define act(a, v) (get<(long long)a>(v))
#define mod 1000000007
#define mod1 998244353
#define N 800003 // N idhar hai
#define inf 1e18
#define minf -1e18
#define min3(a, b, c) min(a, min(b, c));
#define max3(a, b, c) max(a, max(b, c));
#define Foreach(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rof(i, a, b) for (int(i) = (a); (i) >= (b); --(i))
#define rep(i, c) for (auto &(i) : (c))
#define sumall(v) accumulate(all(v), (ll)0)
#define suma accumulate
#define FastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define PRECISION(n) \
std::cout.unsetf(std::ios::floatfield); \
std::cout.precision((ll)n)
#define getmx(v) max_element(all(v))
#define getmn(v) min_element(all(v))
#define wr1(v) cout << v << endl
#define wr2(a, b) cout << a << " " << b << endl
#define wr3(a, b, c) cout << a << " " << b << " " << c << endl
#define FileIO \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout)
#define call(dr) \
dr.pb(mkp(1, 0)); \
dr.pb(mkp(-1, 0)); \
dr.pb(mkp(0, 1)); \
dr.pb(mkp(0, -1))
#define fill(dp, a, b) \
for (int i = 0; i < a; i++) \
for (int j = 0; j < b; j++) \
dp[i][j] = -1;
#define PI M_PI
#define fi first
#define se second
#define here cout << "RSSB" << endl
#define showzero cout << std::showpoint
#define bitcount(x) __builtin_popcountll(x)
#define ls(i) (1ll << (i))
#define rs(i) ((i) >> 1)
#define br "\n"
#define sp " "
using namespace __gnu_pbds; // required
using namespace std;
typedef double db;
typedef long long ll;
typedef vector<int> vi;
// typedef vector<l>vl ;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vstr;
typedef vector<bool> vbool;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void READ(vll &v, ll n) {
ll a;
for (ll i = 0; i < n; i = i + 1) {
cin >> a;
v.pb(a);
}
}
void PRINT(vll &v, ll a = 0) {
for (ll i = a; i < v.size(); i = i + 1) { /*v[i] = max((ll)0,v[i]);*/
cout << v[i] << " ";
}
cout << "\n";
}
double logy(ll n, ll b) {
if (b == 0) {
return (-1);
}
if (n == 1) {
return (0);
}
return ((db)log10(n) / log10(b));
}
long long power(long long k, long long n, long long m = mod) {
long long res = 1;
while (n) {
if (n % 2 != 0) {
res = (res * k) % m;
}
k = (k * k) % m;
n = n / 2;
}
return (res);
}
double power(double k, long long n) {
double res = 1;
while (n) {
if (n % 2 != 0) {
res = (res * k);
}
k = (k * k);
n = n / 2;
}
return (res);
}
ll sign(ll i) {
if (i == 0) {
return (0);
}
if (i > 0) {
return (1);
}
return (-1);
}
double distance(pll a, pll b) {
return ((db)(sqrt(sqr(a.fi - b.fi) + sqr(a.se - b.se))));
}
double distance(pair<ll, pll> a, pair<ll, pll> b) {
return ((db)(sqrt(sqr(a.fi - b.fi) + sqr(a.se.fi - b.se.fi) +
sqr(a.se.se - b.se.se))));
}
ll lis(vll v) {
ll d = sz(v);
vll dis(d + 1, inf);
for (ll i = 0; i < d; i++) {
*lowerB(all(dis), v[i]) = v[i];
}
for (ll i = 0; i < d + 1; i++) {
if (dis[i] == inf) {
return (i);
}
}
return (1);
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
#define lcm(a, b) ((a / gcd(a, b)) * b)
const ll dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const ll dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
vpll dr;
ll n, m, k, h, a1, a2, t;
db prob;
string str;
bool ok = true;
int main() {
FastIO;
PRECISION(10);
ll a, b, c, d, i, j, x, y, z; //,x1,y1,z1,e,f;
ll p, q, r, u, w;
char ch, chr;
string str1, str2, str3, str4;
// ll a1=0,a2=0,b1=0,b2=0,c1=0 ;
// cin>>str>>str1;
// Listen to Zero(Imagine Dragons!!)
// Stay Motivated!!
// Never use i for two or more nested loops!!
// Range Query + Constructive + DSU + Graph Theory + Math + Number Theory +
// DP + Bitmasks + Data Structures + Strings + Geometry + Brute Force + Greedy
// + Implementation Binary and Ternary Search In a comparator function
// comp(pll a , pll b) if comp returns true then a comes before b otherwise b
// comes berfore a Fuck Excuses!!Focus on how to get better call(dr); 18
cin >> k >> str;
n = sz(str);
vll fact(N, 1);
for (i = 2; i < N; i++) {
fact[i] = (fact[i - 1] % mod * i % mod) % mod;
}
x = 0;
z = fact[n + k];
for (i = n; i <= n + k; i++) {
// i characters necessary for initial string
y = (fact[i] % mod * fact[n + k - i] % mod) % mod;
y = power(y, mod - 2, mod) % mod;
y = (z % mod * y % mod) % mod;
p = power(25, n + k - i, mod);
x = (x % mod + (y % mod * p % mod) % mod) % mod;
}
cout << x;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> //required
#include <ext/pb_ds/tree_policy.hpp> //required
#define pb push_back
#define pf push_front
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (long long)(x).size()
#define sqr(x) (x) * (x)
#define sof sizeof
#define resz resize
#define ins insert
#define lowerB lower_bound
#define upperB upper_bound
#define mkp make_pair
#define mkt make_tuple
#define act(a, v) (get<(long long)a>(v))
#define mod 1000000007
#define mod1 998244353
#define N 2000003 // N idhar hai
#define inf 1e18
#define minf -1e18
#define min3(a, b, c) min(a, min(b, c));
#define max3(a, b, c) max(a, max(b, c));
#define Foreach(i, c) \
for (__typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define For(i, a, b) for (int(i) = (a); (i) < (b); ++(i))
#define rof(i, a, b) for (int(i) = (a); (i) >= (b); --(i))
#define rep(i, c) for (auto &(i) : (c))
#define sumall(v) accumulate(all(v), (ll)0)
#define suma accumulate
#define FastIO \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL)
#define PRECISION(n) \
std::cout.unsetf(std::ios::floatfield); \
std::cout.precision((ll)n)
#define getmx(v) max_element(all(v))
#define getmn(v) min_element(all(v))
#define wr1(v) cout << v << endl
#define wr2(a, b) cout << a << " " << b << endl
#define wr3(a, b, c) cout << a << " " << b << " " << c << endl
#define FileIO \
freopen("input.txt", "r", stdin); \
freopen("output.txt", "w", stdout)
#define call(dr) \
dr.pb(mkp(1, 0)); \
dr.pb(mkp(-1, 0)); \
dr.pb(mkp(0, 1)); \
dr.pb(mkp(0, -1))
#define fill(dp, a, b) \
for (int i = 0; i < a; i++) \
for (int j = 0; j < b; j++) \
dp[i][j] = -1;
#define PI M_PI
#define fi first
#define se second
#define here cout << "RSSB" << endl
#define showzero cout << std::showpoint
#define bitcount(x) __builtin_popcountll(x)
#define ls(i) (1ll << (i))
#define rs(i) ((i) >> 1)
#define br "\n"
#define sp " "
using namespace __gnu_pbds; // required
using namespace std;
typedef double db;
typedef long long ll;
typedef vector<int> vi;
// typedef vector<l>vl ;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vstr;
typedef vector<bool> vbool;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
void READ(vll &v, ll n) {
ll a;
for (ll i = 0; i < n; i = i + 1) {
cin >> a;
v.pb(a);
}
}
void PRINT(vll &v, ll a = 0) {
for (ll i = a; i < v.size(); i = i + 1) { /*v[i] = max((ll)0,v[i]);*/
cout << v[i] << " ";
}
cout << "\n";
}
double logy(ll n, ll b) {
if (b == 0) {
return (-1);
}
if (n == 1) {
return (0);
}
return ((db)log10(n) / log10(b));
}
long long power(long long k, long long n, long long m = mod) {
long long res = 1;
while (n) {
if (n % 2 != 0) {
res = (res * k) % m;
}
k = (k * k) % m;
n = n / 2;
}
return (res);
}
double power(double k, long long n) {
double res = 1;
while (n) {
if (n % 2 != 0) {
res = (res * k);
}
k = (k * k);
n = n / 2;
}
return (res);
}
ll sign(ll i) {
if (i == 0) {
return (0);
}
if (i > 0) {
return (1);
}
return (-1);
}
double distance(pll a, pll b) {
return ((db)(sqrt(sqr(a.fi - b.fi) + sqr(a.se - b.se))));
}
double distance(pair<ll, pll> a, pair<ll, pll> b) {
return ((db)(sqrt(sqr(a.fi - b.fi) + sqr(a.se.fi - b.se.fi) +
sqr(a.se.se - b.se.se))));
}
ll lis(vll v) {
ll d = sz(v);
vll dis(d + 1, inf);
for (ll i = 0; i < d; i++) {
*lowerB(all(dis), v[i]) = v[i];
}
for (ll i = 0; i < d + 1; i++) {
if (dis[i] == inf) {
return (i);
}
}
return (1);
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
#define lcm(a, b) ((a / gcd(a, b)) * b)
const ll dx[8] = {-1, -1, -1, 0, 1, 1, 1, 0};
const ll dy[8] = {-1, 0, 1, 1, 1, 0, -1, -1};
vpll dr;
ll n, m, k, h, a1, a2, t;
db prob;
string str;
bool ok = true;
int main() {
FastIO;
PRECISION(10);
ll a, b, c, d, i, j, x, y, z; //,x1,y1,z1,e,f;
ll p, q, r, u, w;
char ch, chr;
string str1, str2, str3, str4;
// ll a1=0,a2=0,b1=0,b2=0,c1=0 ;
// cin>>str>>str1;
// Listen to Zero(Imagine Dragons!!)
// Stay Motivated!!
// Never use i for two or more nested loops!!
// Range Query + Constructive + DSU + Graph Theory + Math + Number Theory +
// DP + Bitmasks + Data Structures + Strings + Geometry + Brute Force + Greedy
// + Implementation Binary and Ternary Search In a comparator function
// comp(pll a , pll b) if comp returns true then a comes before b otherwise b
// comes berfore a Fuck Excuses!!Focus on how to get better call(dr); 18
cin >> k >> str;
n = sz(str);
vll fact(N, 1);
for (i = 2; i < N; i++) {
fact[i] = (fact[i - 1] % mod * i % mod) % mod;
}
x = 0;
z = fact[n + k];
for (i = n; i <= n + k; i++) {
// i characters necessary for initial string
y = (fact[i] % mod * fact[n + k - i] % mod) % mod;
y = power(y, mod - 2, mod) % mod;
y = (z % mod * y % mod) % mod;
p = power(25, n + k - i, mod);
x = (x % mod + (y % mod * p % mod) % mod) % mod;
}
cout << x;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int64_t MAX = 1e+6 + 10;
const int64_t MOD = 1000000007;
int64_t fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int64_t 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;
}
}
// 二項係数計算
int64_t COM(int64_t n, int64_t 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() {
int64_t K;
string S;
cin >> K;
cin >> S;
int64_t N = S.size();
// 前処理
COMinit();
vector<int64_t> POW26(K + 10), POW25(K + 10);
POW26[0] = 1;
POW25[0] = 1;
for (int64_t i = 1; i < K + 10; ++i) {
POW25[i] = POW25[i - 1] * 25 % MOD;
POW26[i] = POW26[i - 1] * 26 % MOD;
}
int64_t sum = 0;
for (int64_t k = 0; k <= K; ++k) {
sum = (sum +
(COM(N + K - k - 1, N - 1) * POW26[k]) % MOD * POW25[K - k] % MOD) %
MOD;
}
if (sum < 0)
sum += MOD;
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
const int64_t MAX = 2e+6 + 10;
const int64_t MOD = 1000000007;
int64_t fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int64_t 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;
}
}
// 二項係数計算
int64_t COM(int64_t n, int64_t 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() {
int64_t K;
string S;
cin >> K;
cin >> S;
int64_t N = S.size();
// 前処理
COMinit();
vector<int64_t> POW26(K + 10), POW25(K + 10);
POW26[0] = 1;
POW25[0] = 1;
for (int64_t i = 1; i < K + 10; ++i) {
POW25[i] = POW25[i - 1] * 25 % MOD;
POW26[i] = POW26[i - 1] * 26 % MOD;
}
int64_t sum = 0;
for (int64_t k = 0; k <= K; ++k) {
sum = (sum +
(COM(N + K - k - 1, N - 1) * POW26[k]) % MOD * POW25[K - k] % MOD) %
MOD;
}
if (sum < 0)
sum += MOD;
cout << sum << endl;
return 0;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define SZ(a) (int)((a).size())
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> Pii;
typedef pair<ll, int> Pli;
typedef unsigned long long ull;
const double eps = 1e-8;
const ll infll = 0x7fffffffffffffff;
const int mod = (int)(1e9) + 7;
const int inf = 0x7fffffff;
const int maxn = (int)(2e5) + 7;
const int maxm = 300;
char s[maxn];
ll n, k, a[maxn], b[maxn];
ll C(ll n, ll m) {
if (m > n)
return 0;
return a[n] * b[m] % mod * b[n - m] % mod;
}
ll power(ll a, ll b) {
ll ans = 1;
for (; b; a = a * a % mod, b >>= 1)
if (b & 1)
ans = ans * a % mod;
return ans;
}
int main() {
// freopen("in.in", "r", stdin);
scanf("%lld%s", &k, s + 1);
n = strlen(s + 1);
a[0] = a[1] = b[0] = b[1] = 1;
for (ll i = 2; i <= n + k; i++) {
b[i] = (mod - mod / i) * b[mod % i] % mod;
}
for (ll i = 2; i <= n + k; i++) {
a[i] = a[i - 1] * i % mod;
b[i] = b[i - 1] * b[i] % mod;
}
ll res = 0;
for (ll i = 0; i <= k;
i++) { // 先选出i个字符放在最左边, 和原串第一个字符在一起
res = (res + C(n + k - i - 1, k - i) * power(26, i) % mod *
power(25, k - i) % mod) %
mod;
}
printf("%lld", res);
return 0;
}
// f o
// 26 * 26 * 1 * 25 * 25 * 1 * 25 * 25
// [a, z] [a, f)∪(f, z) [a, o)∪(o, z]
// |<----------- n + k ------------->|
| #include <bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define fir first
#define sec second
#define SZ(a) (int)((a).size())
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int, int> Pii;
typedef pair<ll, int> Pli;
typedef unsigned long long ull;
const double eps = 1e-8;
const ll infll = 0x7fffffffffffffff;
const int mod = (int)(1e9) + 7;
const int inf = 0x7fffffff;
const int maxn = (int)(2e6) + 7;
const int maxm = 300;
char s[maxn];
ll n, k, a[maxn], b[maxn];
ll C(ll n, ll m) {
if (m > n)
return 0;
return a[n] * b[m] % mod * b[n - m] % mod;
}
ll power(ll a, ll b) {
ll ans = 1;
for (; b; a = a * a % mod, b >>= 1)
if (b & 1)
ans = ans * a % mod;
return ans;
}
int main() {
// freopen("in.in", "r", stdin);
scanf("%lld%s", &k, s + 1);
n = strlen(s + 1);
a[0] = a[1] = b[0] = b[1] = 1;
for (ll i = 2; i <= n + k; i++) {
b[i] = (mod - mod / i) * b[mod % i] % mod;
}
for (ll i = 2; i <= n + k; i++) {
a[i] = a[i - 1] * i % mod;
b[i] = b[i - 1] * b[i] % mod;
}
ll res = 0;
for (ll i = 0; i <= k;
i++) { // 先选出i个字符放在最左边, 和原串第一个字符在一起
res = (res + C(n + k - i - 1, k - i) * power(26, i) % mod *
power(25, k - i) % mod) %
mod;
}
printf("%lld", res);
return 0;
}
// f o
// 26 * 26 * 1 * 25 * 25 * 1 * 25 * 25
// [a, z] [a, f)∪(f, z) [a, o)∪(o, z]
// |<----------- n + k ------------->|
| replace | 16 | 17 | 16 | 17 | 0 | |
p02632 | C++ | Runtime Error | /* Simplicity and Goodness */
#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 tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
void my_dbg() { cout << endl; }
template <typename Arg, typename... Args> void my_dbg(Arg A, Args... B) {
cout << ' ' << A;
my_dbg(B...);
}
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld", &n)
#define pri(n) printf("%d ", (int)(n))
#define prin(n) printf("%d\n", (int)(n))
#define lpri(n) printf("%lld ", n)
#define lprin(n) printf("%lld\n", n)
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
const int inf = INT_MAX;
const int ninf = INT_MIN;
const int mod = 1e9 + 7;
const int N = 1e6 + 2;
int fac[N], inv[N];
int mi(int x, int n) {
int res = 1;
while (n) {
if (n & 1)
res = (1LL * res * x) % mod;
x = (1LL * x * x) % mod;
n >>= 1;
}
return res;
}
void fact() {
fac[0] = 1;
rep(i, 1, N) { fac[i] = (1LL * fac[i - 1] * i) % mod; }
inv[N - 1] = mi(fac[N - 1], mod - 2);
for (int i = N - 1; i > 0; i--) {
inv[i - 1] = (1LL * inv[i] * i) % mod;
}
}
int nCr(int n, int k) {
if (k > n)
return 0;
int ans = (1LL * fac[n] * inv[k]) % mod;
ans = (1LL * ans * inv[n - k]) % mod;
return ans;
}
void solve() {
fact();
int k;
string s;
cin >> k >> s;
int m = (int)s.size();
int ans = 0;
for (int x = 0; x <= k; x++) {
// 26^x * (k-x+m-1)Cm-1 * 25^(k-x)
int here = mi(26, x);
here = (1LL * here * nCr(k - x + m - 1, m - 1)) % mod;
here = (1LL * here * mi(25, k - x)) % mod;
ans = (1LL * ans + here) % mod;
}
prin(ans);
}
int main() {
int t = 1;
// scn(t);
while (t--) {
solve();
}
return 0;
} | /* Simplicity and Goodness */
#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 tree<int, null_type, less<int>, rb_tree_tag,
// tree_order_statistics_node_update> indexed_set;
void my_dbg() { cout << endl; }
template <typename Arg, typename... Args> void my_dbg(Arg A, Args... B) {
cout << ' ' << A;
my_dbg(B...);
}
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", my_dbg(__VA_ARGS__)
#define scn(n) scanf("%d", &n)
#define lscn(n) scanf("%lld", &n)
#define pri(n) printf("%d ", (int)(n))
#define prin(n) printf("%d\n", (int)(n))
#define lpri(n) printf("%lld ", n)
#define lprin(n) printf("%lld\n", n)
#define rep(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define pb push_back
#define mp make_pair
#define F first
#define S second
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
const int inf = INT_MAX;
const int ninf = INT_MIN;
const int mod = 1e9 + 7;
const int N = 2e6 + 2;
int fac[N], inv[N];
int mi(int x, int n) {
int res = 1;
while (n) {
if (n & 1)
res = (1LL * res * x) % mod;
x = (1LL * x * x) % mod;
n >>= 1;
}
return res;
}
void fact() {
fac[0] = 1;
rep(i, 1, N) { fac[i] = (1LL * fac[i - 1] * i) % mod; }
inv[N - 1] = mi(fac[N - 1], mod - 2);
for (int i = N - 1; i > 0; i--) {
inv[i - 1] = (1LL * inv[i] * i) % mod;
}
}
int nCr(int n, int k) {
if (k > n)
return 0;
int ans = (1LL * fac[n] * inv[k]) % mod;
ans = (1LL * ans * inv[n - k]) % mod;
return ans;
}
void solve() {
fact();
int k;
string s;
cin >> k >> s;
int m = (int)s.size();
int ans = 0;
for (int x = 0; x <= k; x++) {
// 26^x * (k-x+m-1)Cm-1 * 25^(k-x)
int here = mi(26, x);
here = (1LL * here * nCr(k - x + m - 1, m - 1)) % mod;
here = (1LL * here * mi(25, k - x)) % mod;
ans = (1LL * ans + here) % mod;
}
prin(ans);
}
int main() {
int t = 1;
// scn(t);
while (t--) {
solve();
}
return 0;
} | replace | 37 | 38 | 37 | 38 | 0 | |
p02632 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// DAME:
ll power(ll x, ll n, ll M) {
ll res = 1;
if (n > 0) {
res = power(x, n / 2, M);
if (n % 2 == 0)
res = (res * res) % M;
else
res = (((res * res) % M) * x) % M;
}
return res;
}
const ll MAX = 40000000;
ll fac[MAX], finv[MAX], inv[MAX];
void cominit() {
fac[0] = fac[1] = 1LL;
finv[0] = finv[1] = 1LL;
inv[1] = 1LL;
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 0LL;
if (n < 0 or k < 0)
return 0LL;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cominit();
ll k;
string s;
cin >> k;
cin >> s;
ll n = s.size();
ll ans = 0;
for (ll i = n; i <= n + k; i++) {
ll aa = power(26LL, n + k - i, mod) * power(25LL, i - n, mod) % mod;
aa = aa * com(i - 1, n - 1) % mod;
ans = (ans + aa) % mod;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
const int inf = 1 << 21;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
// DAME:
ll power(ll x, ll n, ll M) {
ll res = 1;
if (n > 0) {
res = power(x, n / 2, M);
if (n % 2 == 0)
res = (res * res) % M;
else
res = (((res * res) % M) * x) % M;
}
return res;
}
const ll MAX = 4000000;
ll fac[MAX], finv[MAX], inv[MAX];
void cominit() {
fac[0] = fac[1] = 1LL;
finv[0] = finv[1] = 1LL;
inv[1] = 1LL;
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 0LL;
if (n < 0 or k < 0)
return 0LL;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cominit();
ll k;
string s;
cin >> k;
cin >> s;
ll n = s.size();
ll ans = 0;
for (ll i = n; i <= n + k; i++) {
ll aa = power(26LL, n + k - i, mod) * power(25LL, i - n, mod) % mod;
aa = aa * com(i - 1, n - 1) % mod;
ans = (ans + aa) % mod;
}
cout << ans << endl;
return 0;
} | replace | 26 | 27 | 26 | 27 | TLE | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n - 1); i >= 0; --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 200005;
const int INF = 1001001001;
const int MOD = 1000000007;
struct mint {
long long x;
mint(long long x = 0) : x(x % MOD + (0 <= x ? 0 : 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 -= a.x) < 0)
x += MOD;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint &a) const { return mint(x) += a; }
mint operator-(const mint &a) const { return mint(x) -= a; }
mint operator*(const mint &a) const { return mint(x) *= a; }
// for prime mod
mint inv() const {
long long a = x, 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);
}
return mint(u);
}
mint &operator/=(const mint &a) { return *this *= a.inv(); }
mint operator/(const mint &a) const { return mint(x) /= 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<long long> fac, finv, inv;
Combination(int n = 1001001) : fac(n + 1), finv(n + 1), inv(n + 1) {
fac[0] = fac[1] = 1;
finv[0] = 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;
}
}
long long operator()(int n, int k) const {
if (n < k || n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
};
long long mod_pow(long long x, long long n, int M = 1000000007) {
long long ret = 1;
while (n) {
if (n & 1)
(ret *= x) %= M;
(x *= x) %= M;
n >>= 1;
}
return ret;
}
int main() {
int K;
string S;
cin >> K >> S;
int N = S.size();
mint ans = 0;
Combination c;
for (int i = N; i <= K + N; ++i) {
int left = i - N;
int n = left + 1, r = N - 1;
mint tmp = (mint)mod_pow(25, left) * c(n + r - 1, r);
int right = K + N - i;
ans += tmp * mod_pow(26, right);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repr(i, n) for (int i = (n - 1); i >= 0; --i)
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef long long ll;
typedef pair<int, int> P;
const int MAX = 200005;
const int INF = 1001001001;
const int MOD = 1000000007;
struct mint {
long long x;
mint(long long x = 0) : x(x % MOD + (0 <= x ? 0 : 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 -= a.x) < 0)
x += MOD;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint &a) const { return mint(x) += a; }
mint operator-(const mint &a) const { return mint(x) -= a; }
mint operator*(const mint &a) const { return mint(x) *= a; }
// for prime mod
mint inv() const {
long long a = x, 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);
}
return mint(u);
}
mint &operator/=(const mint &a) { return *this *= a.inv(); }
mint operator/(const mint &a) const { return mint(x) /= 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<long long> fac, finv, inv;
Combination(int n = 1001001) : fac(n + 1), finv(n + 1), inv(n + 1) {
fac[0] = fac[1] = 1;
finv[0] = 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;
}
}
long long operator()(int n, int k) const {
if (n < k || n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
};
long long mod_pow(long long x, long long n, int M = 1000000007) {
long long ret = 1;
while (n) {
if (n & 1)
(ret *= x) %= M;
(x *= x) %= M;
n >>= 1;
}
return ret;
}
int main() {
int K;
string S;
cin >> K >> S;
int N = S.size();
mint ans = 0;
Combination c(2001001);
for (int i = N; i <= K + N; ++i) {
int left = i - N;
int n = left + 1, r = N - 1;
mint tmp = (mint)mod_pow(25, left) * c(n + r - 1, r);
int right = K + N - i;
ans += tmp * mod_pow(26, right);
}
cout << ans << endl;
} | replace | 106 | 107 | 106 | 107 | 0 | |
p02632 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long fac[2000005], inv[2000005];
long long modpow(long long x, long long e) {
if (x == 1 || e == 0)
return 1;
long long c = modpow(x, e / 2);
long long c1 = (c * c) % MOD;
if (e % 2 == 0)
return c1;
else
return (c1 * x) % MOD;
}
long long C(long long n, long long k) {
if (k > n || k < 0)
return 0;
return ((fac[n] * inv[k]) % MOD * inv[n - k]) % MOD;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
fac[0] = inv[0] = 1;
for (int i = 1; i < 2000005; i++) {
fac[i] = (fac[i - 1] * i) % MOD;
inv[i] = (inv[i - 1] * modpow(i, MOD - 2)) % MOD;
}
int k, n;
string s;
cin >> k >> s;
n = s.size();
long long ans = 0;
for (int i = n; i <= n + k; i++) {
long long add = (C(i - 1, n - 1) * modpow(25, i - n)) % MOD;
add = (add * modpow(26, n + k - i)) % MOD;
ans = (add + ans) % MOD;
}
cout << ans;
} | #include <bits/stdc++.h>
using namespace std;
long long MOD = 1e9 + 7;
long long fac[2000005], inv[2000005];
long long modpow(long long x, long long e) {
if (x == 1 || e == 0)
return 1;
long long c = modpow(x, e / 2);
long long c1 = (c * c) % MOD;
if (e % 2 == 0)
return c1;
else
return (c1 * x) % MOD;
}
long long C(long long n, long long k) {
if (k > n || k < 0)
return 0;
return ((fac[n] * inv[k]) % MOD * inv[n - k]) % MOD;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
fac[0] = inv[0] = 1;
for (int i = 1; i < 2000005; i++) {
fac[i] = (fac[i - 1] * i) % MOD;
if (i < 1000005)
inv[i] = (inv[i - 1] * modpow(i, MOD - 2)) % MOD;
}
int k, n;
string s;
cin >> k >> s;
n = s.size();
long long ans = 0;
for (int i = n; i <= n + k; i++) {
long long add = (C(i - 1, n - 1) * modpow(25, i - n)) % MOD;
add = (add * modpow(26, n + k - i)) % MOD;
ans = (add + ans) % MOD;
}
cout << ans;
} | replace | 26 | 27 | 26 | 28 | TLE | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
constexpr char ln = '\n';
const int mx = 200010;
const ll mod = 1e9 + 7;
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;
}
};
vector<ll> inv, fact, invfact;
void mod_build(int n) {
fact.resize(n + 1);
inv.resize(n + 1);
invfact.resize(n + 1);
fact[0] = inv[0] = invfact[0] = 1;
inv[1] = 1;
rep(i, n) {
fact[i + 1] = fact[i] * (i + 1) % mod;
if (i > 0)
inv[i + 1] = mod - inv[mod % (i + 1)] * (mod / (i + 1)) % mod;
invfact[i + 1] = invfact[i] * inv[i + 1] % mod;
}
}
ll perm(int n, int k) {
if (n < 0 || k < 0 || k > n) {
return 0;
} else {
return fact[n] * invfact[n - k] % mod;
}
}
ll comb(int n, int k) {
if (n < 0 || k < 0 || k > n) {
return 0;
} else {
return (fact[n] * invfact[n - k] % mod) * invfact[k] % mod;
}
}
ll modpow(ll x, ll n) {
x %= mod;
ll res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a) { return modpow(a, mod - 2); }
int main() {
mod_build(mx);
int k;
string s;
cin >> k >> s;
int n = s.size();
mint ans = 0;
REP(i, n, k + n + 1) {
mint tmp = comb(i - 1, n - 1);
tmp *= modpow(25, i - n);
tmp *= modpow(26, k + n - i);
ans += tmp;
}
cout << ans.x << ln;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
constexpr char ln = '\n';
const int mx = 2000010;
const ll mod = 1e9 + 7;
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;
}
};
vector<ll> inv, fact, invfact;
void mod_build(int n) {
fact.resize(n + 1);
inv.resize(n + 1);
invfact.resize(n + 1);
fact[0] = inv[0] = invfact[0] = 1;
inv[1] = 1;
rep(i, n) {
fact[i + 1] = fact[i] * (i + 1) % mod;
if (i > 0)
inv[i + 1] = mod - inv[mod % (i + 1)] * (mod / (i + 1)) % mod;
invfact[i + 1] = invfact[i] * inv[i + 1] % mod;
}
}
ll perm(int n, int k) {
if (n < 0 || k < 0 || k > n) {
return 0;
} else {
return fact[n] * invfact[n - k] % mod;
}
}
ll comb(int n, int k) {
if (n < 0 || k < 0 || k > n) {
return 0;
} else {
return (fact[n] * invfact[n - k] % mod) * invfact[k] % mod;
}
}
ll modpow(ll x, ll n) {
x %= mod;
ll res = 1;
while (n > 0) {
if (n & 1) {
res = res * x % mod;
}
x = x * x % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a) { return modpow(a, mod - 2); }
int main() {
mod_build(mx);
int k;
string s;
cin >> k >> s;
int n = s.size();
mint ans = 0;
REP(i, n, k + n + 1) {
mint tmp = comb(i - 1, n - 1);
tmp *= modpow(25, i - n);
tmp *= modpow(26, k + n - i);
ans += tmp;
}
cout << ans.x << ln;
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pll = pair<ll, ll>;
#define all(v) v.begin(), v.end()
const ll INF = 1e18;
const ll mod = 1e9 + 7;
const double pie = acos(-1);
vll dx4 = {-1, 0, 1, 0};
vll dy4 = {0, -1, 0, 1};
vll dx8 = {-1, 0, 1, 1, 1, 0, -1, -1};
vll dy8 = {-1, -1, -1, 0, 1, 1, 1, 0};
void fix_cout() { cout << fixed << setprecision(20); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
void chmax(ll &a, ll b) {
if (a < b)
a = b;
}
void chmin(ll &a, ll b) {
if (a > b)
a = b;
}
vll fac(2, 1), inv(2, 1), finv(2, 1);
void nCr_set(int n) {
for (int i = 2; i <= n; i++) {
fac.push_back(fac.at(i - 1) * i % mod);
inv.push_back(mod - inv.at(mod % i) * (mod / i) % mod);
finv.push_back(finv.at(i - 1) * inv.at(i) % mod);
}
}
ll nCr(ll n, ll r) {
if (n < 0 || r < 0 || n < r)
return 0;
if (n == r || r == 0)
return 1;
return fac.at(n) * finv.at(n - r) % mod * finv.at(r) % mod;
}
ll nHr(ll n, ll r) { return nCr(n + r - 1, n - 1); }
ll modpow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % mod;
b >>= 1;
a = a * a % mod;
}
return res;
}
int main() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll ans = 0;
nCr_set(3 * 1e5);
for (int i = 0; i <= k; i++) {
ans += nCr(n + k - i - 1, n - 1) * modpow(25, k - i) % mod * modpow(26, i) %
mod;
ans %= mod;
}
cout << ans << endl;
}
| #include <algorithm>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
using ld = long double;
using vll = vector<ll>;
using vvll = vector<vll>;
using vc = vector<char>;
using vvc = vector<vc>;
using vb = vector<bool>;
using vvb = vector<vb>;
using pll = pair<ll, ll>;
#define all(v) v.begin(), v.end()
const ll INF = 1e18;
const ll mod = 1e9 + 7;
const double pie = acos(-1);
vll dx4 = {-1, 0, 1, 0};
vll dy4 = {0, -1, 0, 1};
vll dx8 = {-1, 0, 1, 1, 1, 0, -1, -1};
vll dy8 = {-1, -1, -1, 0, 1, 1, 1, 0};
void fix_cout() { cout << fixed << setprecision(20); }
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
void chmax(ll &a, ll b) {
if (a < b)
a = b;
}
void chmin(ll &a, ll b) {
if (a > b)
a = b;
}
vll fac(2, 1), inv(2, 1), finv(2, 1);
void nCr_set(int n) {
for (int i = 2; i <= n; i++) {
fac.push_back(fac.at(i - 1) * i % mod);
inv.push_back(mod - inv.at(mod % i) * (mod / i) % mod);
finv.push_back(finv.at(i - 1) * inv.at(i) % mod);
}
}
ll nCr(ll n, ll r) {
if (n < 0 || r < 0 || n < r)
return 0;
if (n == r || r == 0)
return 1;
return fac.at(n) * finv.at(n - r) % mod * finv.at(r) % mod;
}
ll nHr(ll n, ll r) { return nCr(n + r - 1, n - 1); }
ll modpow(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % mod;
b >>= 1;
a = a * a % mod;
}
return res;
}
int main() {
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll ans = 0;
nCr_set(3 * 1e6);
for (int i = 0; i <= k; i++) {
ans += nCr(n + k - i - 1, n - 1) * modpow(25, k - i) % mod * modpow(26, i) %
mod;
ans %= mod;
}
cout << ans << endl;
}
| replace | 86 | 87 | 86 | 87 | 0 | |
p02632 | C++ | Runtime Error | typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
const int MAX = 1000010;
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;
}
template <typename T> T mod_pow(T x, T n, const T &p) {
T ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= p;
(x *= x) %= p;
n >>= 1;
}
return ret;
}
int main() {
COMinit();
ll k;
std::cin >> k;
string s;
std::cin >> s;
ll n = s.size();
ll ans = 0;
for (int i = 0; i <= k; i++) {
ans += COM(n + i - 1, n - 1) * mod_pow((ll)26, (ll)k - i, MOD) % MOD *
mod_pow((ll)25, (ll)i, MOD) % MOD;
ans %= MOD;
}
std::cout << ans << std::endl;
}
| typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
const int MAX = 2000010;
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;
}
template <typename T> T mod_pow(T x, T n, const T &p) {
T ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= p;
(x *= x) %= p;
n >>= 1;
}
return ret;
}
int main() {
COMinit();
ll k;
std::cin >> k;
string s;
std::cin >> s;
ll n = s.size();
ll ans = 0;
for (int i = 0; i <= k; i++) {
ans += COM(n + i - 1, n - 1) * mod_pow((ll)26, (ll)k - i, MOD) % MOD *
mod_pow((ll)25, (ll)i, MOD) % MOD;
ans %= MOD;
}
std::cout << ans << std::endl;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define dub long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ROF(i, a, b) for (int i = (a); i > (b); --i)
#define CASET \
int _T; \
cin >> _T; \
FOR(caset, 1, _T + 1)
#define pii pair<int, int>
#define t3i tuple<int, int, int>
#define mii map<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vs vector<string>
#define vvi vector<vi>
#define vvb vector<vb>
#define vpii vector<pii>
#define vt3i vector<t3i>
#define vvpii vector<vpii>
#define sq(x) (x) * (x)
#define inv(x) powa(x, MOD - 2)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SIZE(x) (signed)(x).size()
#define SUM(x) accumulate(ALL(x), 0LL)
long long INF = 1LL << 60;
long long MOD = 1e9 + 7;
namespace output {
void pr(short x) { cout << x; }
void pr(signed x) { cout << x; }
void pr(long x) { cout << x; }
void pr(long long x) { cout << x; }
void pr(unsigned short x) { cout << x; }
void pr(unsigned x) { cout << x; }
void pr(unsigned long x) { cout << x; }
void pr(unsigned long long x) { cout << x; }
void pr(float x) { cout << x; }
void pr(double x) { cout << x; }
void pr(long double x) { cout << x; }
void pr(char x) { cout << x; }
void pr(const char *x) { cout << x; }
void pr(const string &x) { cout << x; }
void pr(bool x) { cout << x; }
template <size_t sz> void pr(const bitset<sz> &x) { cout << x; }
template <class T> void pr(const complex<T> &x) { cout << x; }
template <class T1, class T2> void pr(const pair<T1, T2> &x);
template <class T1, class T2, class T3> void pr(const tuple<T1, T2, T3> &x);
template <class T> void pr(const T &x);
template <class T, class... Ts> void pr(const T &t, const Ts &...ts) {
pr(t);
pr(ts...);
}
template <class T1, class T2> void pr(const pair<T1, T2> &x) {
pr("(", x.first, ", ", x.second, ")");
}
template <class T1, class T2, class T3> void pr(const tuple<T1, T2, T3> &x) {
pr("(", get<0>(x), ", ", get<1>(x), ", ", get<2>(x), ")");
}
template <class T> void pr(const T &x) {
pr("["); // const iterator needed for vector<bool>
bool fst = 1;
for (const auto &a : x)
pr(!fst ? ", " : "", a), fst = 0;
pr("]");
}
void print() { pr("\n"); } // print w/ spaces
template <class T, class... Ts> void print(const T &t, const Ts &...ts) {
pr(t);
if (sizeof...(ts))
pr(" ");
print(ts...);
}
} // namespace output
using namespace output;
template <typename T = int> vector<T> create(size_t n) { return vector<T>(n); }
template <typename T, typename... Args> auto create(size_t n, Args... args) {
return vector<decltype(create<T>(args...))>(n, create<T>(args...));
}
template <class T1, class T2>
istream &operator>>(istream &is, pair<T1, T2> &x) {
is >> x.first >> x.second;
return is;
}
template <class T1, class T2, class T3>
istream &operator>>(istream &is, tuple<T1, T2, T3> &x) {
is >> get<0>(x) >> get<1>(x) >> get<2>(x);
return is;
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
int powa(int base, int exp) {
int res = 1;
while (exp) {
if (exp & 1)
res = res * base % MOD;
base = base * base % MOD;
exp >>= 1;
}
return res;
}
bool mini(int &a, int b) { return b < a ? a = b, 1 : 0; }
bool maxi(int &a, int b) { return b > a ? a = b, 1 : 0; }
signed main() {
ios::sync_with_stdio(0), cin.tie(0);
int k;
cin >> k;
string s;
cin >> s;
int n = SIZE(s);
const int BIG = 2e5 + 5;
vi fact(BIG);
fact[0] = 1;
FOR(i, 1, BIG) fact[i] = i * fact[i - 1] % MOD;
vi invfact(BIG);
invfact.back() = inv(fact.back());
ROF(i, BIG - 2, -1) invfact[i] = (i + 1) * invfact[i + 1] % MOD;
auto nCr = [&](int n, int r) {
if (r < 0 || r > n)
return 0LL;
return fact[n] * invfact[r] % MOD * invfact[n - r] % MOD;
};
int res = 0;
FOR(h, n, n + k + 1) {
int cur =
nCr(h - 1, n - 1) * powa(25, h - n) % MOD * powa(26, n + k - h) % MOD;
res = (res + cur) % MOD;
}
print(res);
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define dub long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ROF(i, a, b) for (int i = (a); i > (b); --i)
#define CASET \
int _T; \
cin >> _T; \
FOR(caset, 1, _T + 1)
#define pii pair<int, int>
#define t3i tuple<int, int, int>
#define mii map<int, int>
#define vi vector<int>
#define vb vector<bool>
#define vs vector<string>
#define vvi vector<vi>
#define vvb vector<vb>
#define vpii vector<pii>
#define vt3i vector<t3i>
#define vvpii vector<vpii>
#define sq(x) (x) * (x)
#define inv(x) powa(x, MOD - 2)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SIZE(x) (signed)(x).size()
#define SUM(x) accumulate(ALL(x), 0LL)
long long INF = 1LL << 60;
long long MOD = 1e9 + 7;
namespace output {
void pr(short x) { cout << x; }
void pr(signed x) { cout << x; }
void pr(long x) { cout << x; }
void pr(long long x) { cout << x; }
void pr(unsigned short x) { cout << x; }
void pr(unsigned x) { cout << x; }
void pr(unsigned long x) { cout << x; }
void pr(unsigned long long x) { cout << x; }
void pr(float x) { cout << x; }
void pr(double x) { cout << x; }
void pr(long double x) { cout << x; }
void pr(char x) { cout << x; }
void pr(const char *x) { cout << x; }
void pr(const string &x) { cout << x; }
void pr(bool x) { cout << x; }
template <size_t sz> void pr(const bitset<sz> &x) { cout << x; }
template <class T> void pr(const complex<T> &x) { cout << x; }
template <class T1, class T2> void pr(const pair<T1, T2> &x);
template <class T1, class T2, class T3> void pr(const tuple<T1, T2, T3> &x);
template <class T> void pr(const T &x);
template <class T, class... Ts> void pr(const T &t, const Ts &...ts) {
pr(t);
pr(ts...);
}
template <class T1, class T2> void pr(const pair<T1, T2> &x) {
pr("(", x.first, ", ", x.second, ")");
}
template <class T1, class T2, class T3> void pr(const tuple<T1, T2, T3> &x) {
pr("(", get<0>(x), ", ", get<1>(x), ", ", get<2>(x), ")");
}
template <class T> void pr(const T &x) {
pr("["); // const iterator needed for vector<bool>
bool fst = 1;
for (const auto &a : x)
pr(!fst ? ", " : "", a), fst = 0;
pr("]");
}
void print() { pr("\n"); } // print w/ spaces
template <class T, class... Ts> void print(const T &t, const Ts &...ts) {
pr(t);
if (sizeof...(ts))
pr(" ");
print(ts...);
}
} // namespace output
using namespace output;
template <typename T = int> vector<T> create(size_t n) { return vector<T>(n); }
template <typename T, typename... Args> auto create(size_t n, Args... args) {
return vector<decltype(create<T>(args...))>(n, create<T>(args...));
}
template <class T1, class T2>
istream &operator>>(istream &is, pair<T1, T2> &x) {
is >> x.first >> x.second;
return is;
}
template <class T1, class T2, class T3>
istream &operator>>(istream &is, tuple<T1, T2, T3> &x) {
is >> get<0>(x) >> get<1>(x) >> get<2>(x);
return is;
}
template <class T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
int powa(int base, int exp) {
int res = 1;
while (exp) {
if (exp & 1)
res = res * base % MOD;
base = base * base % MOD;
exp >>= 1;
}
return res;
}
bool mini(int &a, int b) { return b < a ? a = b, 1 : 0; }
bool maxi(int &a, int b) { return b > a ? a = b, 1 : 0; }
signed main() {
ios::sync_with_stdio(0), cin.tie(0);
int k;
cin >> k;
string s;
cin >> s;
int n = SIZE(s);
const int BIG = 2e6 + 5;
vi fact(BIG);
fact[0] = 1;
FOR(i, 1, BIG) fact[i] = i * fact[i - 1] % MOD;
vi invfact(BIG);
invfact.back() = inv(fact.back());
ROF(i, BIG - 2, -1) invfact[i] = (i + 1) * invfact[i + 1] % MOD;
auto nCr = [&](int n, int r) {
if (r < 0 || r > n)
return 0LL;
return fact[n] * invfact[r] % MOD * invfact[n - r] % MOD;
};
int res = 0;
FOR(h, n, n + k + 1) {
int cur =
nCr(h - 1, n - 1) * powa(25, h - n) % MOD * powa(26, n + k - h) % MOD;
res = (res + cur) % MOD;
}
print(res);
} | replace | 125 | 126 | 125 | 126 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const long long MOD = 1000000007;
const int MAX = int(1e6) + 5;
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;
}
template <typename T> T mod_pow(T x, T n, const T &p) {
T ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= p;
(x *= x) %= p;
n >>= 1;
}
return ret;
}
void solve(long long K, std::string S) {
ll N = S.size();
ll ans = mod_pow(26ll, K + N, MOD);
COMinit();
for (ll i = 0; i < N; i++) {
ll minus = COM(K + N, i) * mod_pow(25ll, K + N - i, MOD);
minus %= MOD;
ans = ans + MOD - minus;
ans %= MOD;
}
cout << ans << endl;
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips:
// You use the default template now. You can remove this line by using your
// custom template)
int main() {
long long K;
scanf("%lld", &K);
std::string S;
std::cin >> S;
solve(K, S);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
const long long MOD = 1000000007;
const int MAX = int(1e6) * 2 + 5;
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;
}
template <typename T> T mod_pow(T x, T n, const T &p) {
T ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= p;
(x *= x) %= p;
n >>= 1;
}
return ret;
}
void solve(long long K, std::string S) {
ll N = S.size();
ll ans = mod_pow(26ll, K + N, MOD);
COMinit();
for (ll i = 0; i < N; i++) {
ll minus = COM(K + N, i) * mod_pow(25ll, K + N - i, MOD);
minus %= MOD;
ans = ans + MOD - minus;
ans %= MOD;
}
cout << ans << endl;
}
// Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips:
// You use the default template now. You can remove this line by using your
// custom template)
int main() {
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 | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
#define MAX_N 200005
ll inv[MAX_N], fac[MAX_N], finv[MAX_N];
void make() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX_N; i++) {
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fac[i] = fac[i - 1] * (ll)i % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll perm(ll n, ll r) {
if (n < 0)
return 0;
else if (n < r)
return 0;
else
return (fac[n] * finv[n - r]) % mod;
}
ll comb(ll n, ll r) {
ll ans = 1;
ans = perm(n, r); // n * (n-1) * ... * (n-r+1)
ans = (ans * finv[r]) % mod; // フェルマーの小定理
return ans;
}
ll modpow(ll a, ll N) {
ll ans = 1;
ll tmp = a;
while (N > 0) {
if (N % 2 == 1)
(ans *= tmp) %= mod;
(tmp *= tmp) %= mod;
N /= 2;
}
return ans;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll K;
string S;
cin >> K >> S;
ll N = S.size();
make();
ll ans = 0;
rep(i, K + 1) {
ll k = K - i;
(ans +=
comb(k + N - 1, N - 1) * modpow(25, k) % mod * modpow(26, i) % mod) %= mod;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define RREP(i, m, n) for (int i = (int)(m); i >= (int)(n); i--)
#define rrep(i, n) RREP(i, n - 1, 0)
#define all(v) v.begin(), v.end()
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
#define MAX_N 2000005
ll inv[MAX_N], fac[MAX_N], finv[MAX_N];
void make() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX_N; i++) {
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
fac[i] = fac[i - 1] * (ll)i % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll perm(ll n, ll r) {
if (n < 0)
return 0;
else if (n < r)
return 0;
else
return (fac[n] * finv[n - r]) % mod;
}
ll comb(ll n, ll r) {
ll ans = 1;
ans = perm(n, r); // n * (n-1) * ... * (n-r+1)
ans = (ans * finv[r]) % mod; // フェルマーの小定理
return ans;
}
ll modpow(ll a, ll N) {
ll ans = 1;
ll tmp = a;
while (N > 0) {
if (N % 2 == 1)
(ans *= tmp) %= mod;
(tmp *= tmp) %= mod;
N /= 2;
}
return ans;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll K;
string S;
cin >> K >> S;
ll N = S.size();
make();
ll ans = 0;
rep(i, K + 1) {
ll k = K - i;
(ans +=
comb(k + N - 1, N - 1) * modpow(25, k) % mod * modpow(26, i) % mod) %= mod;
}
cout << ans << endl;
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define rep(i, n) FOR(i, 0, n)
#define all(v) begin(v), end(v)
#ifdef ONLINE_JUDGE
#define debug(x)
#define debug2(x, y)
#define debug3(x, y, z)
#define assert(e) \
if (!(e)) { \
stod(""); \
}
#else
#define debug(x) std::cerr << #x << ": " << x << "\n"
#define debug2(x, y) \
std::cerr << #x << ": " << x << ", " << #y << ": " << y << "\n"
#define debug3(x, y, z) \
std::cerr << #x << ": " << x << ", " << #y << ": " << y << ", " << #z \
<< ": " << z << "\n"
#endif
using ll = long long;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
template <typename T> using vvec = std::vector<std::vector<T>>;
template <typename T> auto make_v(size_t sz) { return std::vector<T>(sz); }
template <typename T, typename... Ts> auto make_v(size_t sz, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(sz, make_v<T>(ts...));
}
template <typename T> void fill_v(T &var, const T &x) { var = x; }
template <typename V, typename T> void fill_v(V &v, const T &x) {
for (auto &&w : v) {
fill_v(w, x);
}
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::vector<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s,
const std::vector<std::vector<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<std::deque<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::set<T> &v) {
s << "\n";
for (auto &&elm : v) {
s << elm << "\t";
}
s << "\n";
return s;
}
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(ll &a) { scanf("%lld", &a); }
inline void scan(char &a) { scanf(" %c", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
template <typename T> inline void scan(std::vector<T> &v) {
for (auto &&sv : v) {
scan(sv);
}
}
template <typename First, typename... Args>
inline void scan(First &f, Args &...args) {
scan(f);
scan(args...);
}
inline void scan(std::string &s) {
char BUF[3000000];
scanf(" %s", BUF);
s = std::string(BUF);
}
inline void print(int a) { printf("%d\n", a); }
inline void print(ll a) { printf("%lld\n", a); }
inline void print(double a) { printf("%.12f\n", a); }
inline void print(std::string s) { std::cout << s << "\n"; }
using namespace std;
/*
k = 1, s = "aa"
aaa ... aaz 26
aba ... aza 25
baa ... zaa 25
-> 76
k = 1, s = "ab"
aba ... abz 26
aab, acb ... azb 25
bab ... zab
-> 76
*/
ll mod = 1000000007;
ll po(ll k, ll x) {
if (x == 0) {
return 1;
}
if (x == 1) {
return k % mod;
}
ll y = po(k, x / 2);
y = y * y % mod;
if (x % 2 == 1) {
y = y * k % mod;
}
return y;
}
ll combination(ll n, ll k, const vll &frac, const vll &frev) {
k = min(k, n - k);
if (k == 0) {
return 1;
}
ll ret = frac.at(n);
ll denomi = frev.at(k) * frev.at(n - k) % mod;
ret = ret * denomi % mod;
return ret;
}
ll mod_mult(vll &a) {
ll ret = 1;
for (ll x : a) {
ret = ret * x % mod;
}
return ret;
}
ll calc(ll k, string &s) {
ll m = s.length();
ll n = k + m;
ll ans = 0;
vll po25(n + 1), po26(n + 1), frac(n + 1);
po25.at(0) = 1;
po26.at(0) = 1;
frac.at(0) = 1;
rep(i, n) {
po25.at(i + 1) = po25.at(i) * 25 % mod;
po26.at(i + 1) = po26.at(i) * 26 % mod;
frac.at(i + 1) = frac.at(i) * (i + 1) % mod;
}
int fsize = max(n - m + 2, m - 1);
vll frev(fsize);
frev.at(0) = 1;
rep(i, fsize - 1) { frev.at(i + 1) = po(frac.at(i + 1), mod - 2); }
FOR(i, m - 1, n) {
vll a = {combination(i, m - 1, frac, frev), po25.at(i - (m - 1)),
po26.at(n - 1 - i)};
ans = (ans + mod_mult(a)) % mod;
}
return ans;
}
void solve() {
ll k;
scan(k);
string s;
scan(s);
ll ans = calc(k, s);
print(ans);
}
int main() {
solve();
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#define FOR(i, k, n) for (int(i) = (k); (i) < (n); ++(i))
#define rep(i, n) FOR(i, 0, n)
#define all(v) begin(v), end(v)
#ifdef ONLINE_JUDGE
#define debug(x)
#define debug2(x, y)
#define debug3(x, y, z)
#define assert(e) \
if (!(e)) { \
stod(""); \
}
#else
#define debug(x) std::cerr << #x << ": " << x << "\n"
#define debug2(x, y) \
std::cerr << #x << ": " << x << ", " << #y << ": " << y << "\n"
#define debug3(x, y, z) \
std::cerr << #x << ": " << x << ", " << #y << ": " << y << ", " << #z \
<< ": " << z << "\n"
#endif
using ll = long long;
using vi = std::vector<int>;
using vvi = std::vector<vi>;
using vll = std::vector<ll>;
using vvll = std::vector<vll>;
template <typename T> using vvec = std::vector<std::vector<T>>;
template <typename T> auto make_v(size_t sz) { return std::vector<T>(sz); }
template <typename T, typename... Ts> auto make_v(size_t sz, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(sz, make_v<T>(ts...));
}
template <typename T> void fill_v(T &var, const T &x) { var = x; }
template <typename V, typename T> void fill_v(V &v, const T &x) {
for (auto &&w : v) {
fill_v(w, x);
}
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::vector<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s,
const std::vector<std::vector<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<T> &v) {
int sz = v.size();
s << "\n";
rep(i, sz) {
s << v[i];
if (i < sz - 1) {
s << "\t";
}
}
s << "\n";
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::deque<std::deque<T>> &v) {
for (auto &&w : v) {
s << w;
}
return s;
}
template <typename T>
std::ostream &operator<<(std::ostream &s, const std::set<T> &v) {
s << "\n";
for (auto &&elm : v) {
s << elm << "\t";
}
s << "\n";
return s;
}
inline void scan(int &a) { scanf("%d", &a); }
inline void scan(ll &a) { scanf("%lld", &a); }
inline void scan(char &a) { scanf(" %c", &a); }
inline void scan(double &a) { scanf("%lf", &a); }
template <typename T> inline void scan(std::vector<T> &v) {
for (auto &&sv : v) {
scan(sv);
}
}
template <typename First, typename... Args>
inline void scan(First &f, Args &...args) {
scan(f);
scan(args...);
}
inline void scan(std::string &s) {
char BUF[3000000];
scanf(" %s", BUF);
s = std::string(BUF);
}
inline void print(int a) { printf("%d\n", a); }
inline void print(ll a) { printf("%lld\n", a); }
inline void print(double a) { printf("%.12f\n", a); }
inline void print(std::string s) { std::cout << s << "\n"; }
using namespace std;
/*
k = 1, s = "aa"
aaa ... aaz 26
aba ... aza 25
baa ... zaa 25
-> 76
k = 1, s = "ab"
aba ... abz 26
aab, acb ... azb 25
bab ... zab
-> 76
*/
ll mod = 1000000007;
ll po(ll k, ll x) {
if (x == 0) {
return 1;
}
if (x == 1) {
return k % mod;
}
ll y = po(k, x / 2);
y = y * y % mod;
if (x % 2 == 1) {
y = y * k % mod;
}
return y;
}
ll combination(ll n, ll k, const vll &frac, const vll &frev) {
k = min(k, n - k);
if (k == 0) {
return 1;
}
ll ret = frac.at(n);
ll denomi = frev.at(k) * frev.at(n - k) % mod;
ret = ret * denomi % mod;
return ret;
}
ll mod_mult(vll &a) {
ll ret = 1;
for (ll x : a) {
ret = ret * x % mod;
}
return ret;
}
ll calc(ll k, string &s) {
ll m = s.length();
ll n = k + m;
ll ans = 0;
vll po25(n + 1), po26(n + 1), frac(n + 1);
po25.at(0) = 1;
po26.at(0) = 1;
frac.at(0) = 1;
rep(i, n) {
po25.at(i + 1) = po25.at(i) * 25 % mod;
po26.at(i + 1) = po26.at(i) * 26 % mod;
frac.at(i + 1) = frac.at(i) * (i + 1) % mod;
}
vll frev(n + 1);
frev.at(n) = po(frac.at(n), mod - 2);
for (int i = n - 1; i >= 0; --i) {
frev.at(i) = frev.at(i + 1) * (i + 1) % mod;
}
FOR(i, m - 1, n) {
vll a = {combination(i, m - 1, frac, frev), po25.at(i - (m - 1)),
po26.at(n - 1 - i)};
ans = (ans + mod_mult(a)) % mod;
}
return ans;
}
void solve() {
ll k;
scan(k);
string s;
scan(s);
ll ans = calc(k, s);
print(ans);
}
int main() {
solve();
return 0;
}
| replace | 200 | 204 | 200 | 205 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
const int 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 (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll x, ll n) {
ll res = 1;
ll mul = x;
while (n) {
if (n % 2)
res = res * mul % MOD;
mul = mul * mul % MOD;
n /= 2;
}
return res;
}
ll modinv(ll x, ll n) { return modpow(x, n - 2); }
int main() {
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
ll ans = 0;
COMinit();
for (int i = 0; i <= k; i++) {
ll tmp = modpow(25, k - i);
tmp %= MOD;
tmp *= modpow(26, i);
tmp %= MOD;
tmp *= COM(n + k - i - 1, n - 1);
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++)
#define rrep(i, n) for (int i = n - 1; i >= 0; i--)
using namespace std;
#define INF ((1 << 30) - 1)
#define LINF (1LL << 60)
#define EPS (1e-10)
typedef long long ll;
typedef pair<ll, ll> P;
const int MOD = 1000000007;
const int MOD2 = 998244353;
const int MAX = 2000000;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll x, ll n) {
ll res = 1;
ll mul = x;
while (n) {
if (n % 2)
res = res * mul % MOD;
mul = mul * mul % MOD;
n /= 2;
}
return res;
}
ll modinv(ll x, ll n) { return modpow(x, n - 2); }
int main() {
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
ll ans = 0;
COMinit();
for (int i = 0; i <= k; i++) {
ll tmp = modpow(25, k - i);
tmp %= MOD;
tmp *= modpow(26, i);
tmp %= MOD;
tmp *= COM(n + k - i - 1, n - 1);
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 5;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
const double PI = acos(-1.0);
void header() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
ll fac[maxn], inv[maxn];
ll qpow(ll a, ll b, ll mod = MOD) {
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 < maxn; i++)
fac[i] = fac[i - 1] * i % MOD;
inv[maxn - 1] = qpow(fac[maxn - 1], MOD - 2);
for (int i = maxn - 2; i >= 0; i--)
inv[i] = inv[i + 1] * (i + 1) % MOD;
}
ll C(int n, int m) { return fac[n] * inv[m] % MOD * inv[n - m] % MOD; }
void solve() {
int k;
string s;
cin >> k >> s;
init();
ll res = 0;
int n = s.size();
for (int i = 0; i <= k; i++) {
int last = k - i;
res += qpow(26, i) * qpow(25, last) % MOD * C(last + n - 1, n - 1) % MOD;
res %= MOD;
}
cout << res << endl;
}
int main() {
header();
solve();
return 0;
}
| #include <bits/stdc++.h>
#define endl '\n'
#define fi first
#define se second
#define pb push_back
#define debug(x) cout << "[debug] " << #x << ": " << x << endl
using namespace std;
typedef long long ll;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
const int MOD = 1e9 + 7;
const int maxn = 2e6 + 5;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const double eps = 1e-8;
const double PI = acos(-1.0);
void header() {
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
}
ll fac[maxn], inv[maxn];
ll qpow(ll a, ll b, ll mod = MOD) {
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 < maxn; i++)
fac[i] = fac[i - 1] * i % MOD;
inv[maxn - 1] = qpow(fac[maxn - 1], MOD - 2);
for (int i = maxn - 2; i >= 0; i--)
inv[i] = inv[i + 1] * (i + 1) % MOD;
}
ll C(int n, int m) { return fac[n] * inv[m] % MOD * inv[n - m] % MOD; }
void solve() {
int k;
string s;
cin >> k >> s;
init();
ll res = 0;
int n = s.size();
for (int i = 0; i <= k; i++) {
int last = k - i;
res += qpow(26, i) * qpow(25, last) % MOD * C(last + n - 1, n - 1) % MOD;
res %= MOD;
}
cout << res << endl;
}
int main() {
header();
solve();
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) { cout << (expr ? "Yes" : "No") << "\n"; }
constexpr int MAX = 200001;
lint fact[MAX], finv[MAX], inv[MAX];
void cominit() {
fact[0] = fact[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, MAX) {
fact[i] = fact[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
lint power(lint x, lint n, lint mod) {
lint ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return ret;
}
lint ncr(lint n, lint r, lint mod) {
if (n < 0 || r < 0 || n - r < 0)
return 0;
return fact[n] * finv[r] % mod * finv[n - r] % mod;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
lint K;
cin >> K;
string S;
cin >> S;
cominit();
lint ans = 0;
REP(i, K + 1) {
ans = (ans + ncr(S.size() + i - 1, S.size() - 1, MOD) *
power(26, K - i, MOD) % MOD * power(25, i, MOD) % MOD) %
MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using P = pair<lint, lint>;
#define FOR(i, begin, end) \
for (int i = (begin), i##_end_ = (end); i < i##_end_; i++)
#define IFOR(i, begin, end) \
for (int i = (end)-1, i##_begin_ = (begin); i >= i##_begin_; i--)
#define REP(i, n) FOR(i, 0, n)
#define IREP(i, n) IFOR(i, 0, n)
#define ALL(a) (a).begin(), (a).end()
constexpr int MOD = 1000000007;
constexpr int INF = 2147483647;
void yes(bool expr) { cout << (expr ? "Yes" : "No") << "\n"; }
constexpr int MAX = 2000001;
lint fact[MAX], finv[MAX], inv[MAX];
void cominit() {
fact[0] = fact[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, MAX) {
fact[i] = fact[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
lint power(lint x, lint n, lint mod) {
lint ret = 1;
while (n > 0) {
if (n & 1)
(ret *= x) %= mod;
(x *= x) %= mod;
n >>= 1;
}
return ret;
}
lint ncr(lint n, lint r, lint mod) {
if (n < 0 || r < 0 || n - r < 0)
return 0;
return fact[n] * finv[r] % mod * finv[n - r] % mod;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
lint K;
cin >> K;
string S;
cin >> S;
cominit();
lint ans = 0;
REP(i, K + 1) {
ans = (ans + ncr(S.size() + i - 1, S.size() - 1, MOD) *
power(26, K - i, MOD) % MOD * power(25, i, MOD) % MOD) %
MOD;
}
cout << ans << endl;
} | replace | 14 | 15 | 14 | 15 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define eb emplace_back
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
const int N = 1000007, inf = 0x3f3f3f3f;
const int M = 1e9 + 7;
ll fat[N];
ll fast_pow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans = a * ans % M;
b >>= 1;
a = a * a % M;
}
return ans;
}
ll nchoosek(ll n, ll k) {
ll den = fat[n - k] * fat[k] % M;
return fat[n] * fast_pow(den, M - 2) % M;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
fat[0] = 1;
for (int i = 1; i < N; ++i)
fat[i] = fat[i - 1] * i % M;
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
ll sum = 0;
for (int x = 0; x <= k; ++x) {
sum += (fast_pow(25, k - x) * fast_pow(26, x) % M) *
nchoosek(n + k - x - 1, n - 1) % M;
if (sum >= M)
sum -= M;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define eb emplace_back
using namespace std;
typedef pair<int, int> ii;
typedef long long ll;
const int N = 2000007, inf = 0x3f3f3f3f;
const int M = 1e9 + 7;
ll fat[N];
ll fast_pow(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans = a * ans % M;
b >>= 1;
a = a * a % M;
}
return ans;
}
ll nchoosek(ll n, ll k) {
ll den = fat[n - k] * fat[k] % M;
return fat[n] * fast_pow(den, M - 2) % M;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
fat[0] = 1;
for (int i = 1; i < N; ++i)
fat[i] = fat[i - 1] * i % M;
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
ll sum = 0;
for (int x = 0; x <= k; ++x) {
sum += (fast_pow(25, k - x) * fast_pow(26, x) % M) *
nchoosek(n + k - x - 1, n - 1) % M;
if (sum >= M)
sum -= M;
}
cout << sum << endl;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 510000;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll powmod(ll a, ll p) {
ll res = 1;
while (p > 0) {
if (p & 1) {
res *= a;
res %= MOD;
}
a *= a;
a %= MOD;
p >>= 1;
}
return res;
}
int main() {
COMinit();
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size() + k;
ll ans = 0;
for (ll i = s.size(); i <= n; i++) {
ans += powmod(25, i - (int)s.size()) * powmod(26, n - i) % MOD *
COM(i - 1, (ll)s.size() - 1) % MOD;
}
ans %= MOD;
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAX = 2000000;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll powmod(ll a, ll p) {
ll res = 1;
while (p > 0) {
if (p & 1) {
res *= a;
res %= MOD;
}
a *= a;
a %= MOD;
p >>= 1;
}
return res;
}
int main() {
COMinit();
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size() + k;
ll ans = 0;
for (ll i = s.size(); i <= n; i++) {
ans += powmod(25, i - (int)s.size()) * powmod(26, n - i) % MOD *
COM(i - 1, (ll)s.size() - 1) % MOD;
}
ans %= MOD;
cout << ans << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e15;
using Graph = vector<vector<int>>;
// AのN乗(mod M)を高速に計算する(O(logN))
// Aの逆元を取る場合、modpow(A, MOD-2, 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 = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
signed main() {
COMinit();
int K;
cin >> K;
string S;
cin >> S;
int N = (int)S.size();
int ans = 0;
for (int i = 0; i <= K; i++) {
int now = 1;
now = modpow(25, i, MOD);
now %= MOD;
now *= COM(i + N - 1, N - 1);
now %= MOD;
now *= modpow(26, K - i, MOD);
now %= MOD;
ans += now;
ans %= MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define int long long
#define double long double
using namespace std;
const int MOD = 1000000007;
const int INF = 1e15;
using Graph = vector<vector<int>>;
// AのN乗(mod M)を高速に計算する(O(logN))
// Aの逆元を取る場合、modpow(A, MOD-2, 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 = 5100000;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
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;
}
signed main() {
COMinit();
int K;
cin >> K;
string S;
cin >> S;
int N = (int)S.size();
int ans = 0;
for (int i = 0; i <= K; i++) {
int now = 1;
now = modpow(25, i, MOD);
now %= MOD;
now *= COM(i + N - 1, N - 1);
now %= MOD;
now *= modpow(26, K - i, MOD);
now %= MOD;
ans += now;
ans %= MOD;
}
cout << ans << endl;
}
| replace | 21 | 22 | 21 | 22 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define SZ(x) ((int)x.size())
#define fi first
#define se second
const int INF = 1e15;
const int MOD = 1e9 + 7;
using namespace std;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using pi = pair<int, int>;
using vi = vc<int>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int MX = 1777777 + 5;
int fac[MX + 5], inv[MX + 5];
int power(int x, int y, int p) {
int res = 1;
x = x % p;
while (y) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
void init() {
int n = MX + 4;
fac[0] = 1;
for (int i = 0; i < n; ++i)
fac[i + 1] = fac[i] * (i + 1) % MOD;
inv[n] = power(fac[n], MOD - 2, MOD);
for (int i = n - 1; i >= 0; --i)
inv[i] = inv[i + 1] * (i + 1) % MOD;
}
int comb(int n, int r) { return (fac[n] * inv[r]) % MOD * inv[n - r] % MOD; }
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
init();
int K;
cin >> K;
string S;
cin >> S;
int T = K + SZ(S);
int ans = 0;
rng(i, SZ(S), K + SZ(S) + 1) {
ans += (comb(T, i) * power(25, T - i, MOD)) % MOD;
ans %= MOD;
}
cout << ans << endl;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using ll = long long;
#define int ll
#define rng(i, a, b) for (int i = int(a); i < int(b); i++)
#define rep(i, b) rng(i, 0, b)
#define gnr(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define per(i, b) gnr(i, 0, b)
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define SZ(x) ((int)x.size())
#define fi first
#define se second
const int INF = 1e15;
const int MOD = 1e9 + 7;
using namespace std;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using pi = pair<int, int>;
using vi = vc<int>;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int MX = 2000100 + 5;
int fac[MX + 5], inv[MX + 5];
int power(int x, int y, int p) {
int res = 1;
x = x % p;
while (y) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
void init() {
int n = MX + 4;
fac[0] = 1;
for (int i = 0; i < n; ++i)
fac[i + 1] = fac[i] * (i + 1) % MOD;
inv[n] = power(fac[n], MOD - 2, MOD);
for (int i = n - 1; i >= 0; --i)
inv[i] = inv[i + 1] * (i + 1) % MOD;
}
int comb(int n, int r) { return (fac[n] * inv[r]) % MOD * inv[n - r] % MOD; }
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
init();
int K;
cin >> K;
string S;
cin >> S;
int T = K + SZ(S);
int ans = 0;
rng(i, SZ(S), K + SZ(S) + 1) {
ans += (comb(T, i) * power(25, T - i, MOD)) % MOD;
ans %= MOD;
}
cout << ans << endl;
}
| replace | 53 | 54 | 53 | 54 | 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 __gnu_pbds;
using namespace std;
#define int long long int
// #define ll int128_t
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define endl '\n'
#define all(x) x.begin(), x.end()
#define smax(a, b) a = max(a, b)
// #if !defined(ONLINE_JUDGE)
// #include "debugging.h"
// #endif
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k) returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
// erase,insert same as normal set
int const mod = 1e9 + 7;
// int const mod = 998244353;
int power(int a, int b, int m) {
int res = 1;
while (b) {
if (b & 1) {
res = (res * a) % m;
res %= m;
}
a = (a * a) % m;
a %= m;
b = b / 2;
}
return res;
}
int inverse(int x, int m) { return power(x, m - 2, m); }
int const N = 1e6 + 55;
int const inf = 1e18;
ld pi = 3.14159265359;
int fact[N];
int ifact[N];
void precompute_factorials() {
fact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = i * fact[i - 1];
fact[i] %= mod;
}
ifact[N - 1] = inverse(fact[N - 1], mod);
for (int i = N - 2; i >= 0; i--) {
ifact[i] = (i + 1) * ifact[i + 1];
ifact[i] %= mod;
}
}
int ncr(int n, int r) {
if (n < r || r < 0)
return 0;
if (n == r)
return 1;
int res = fact[n];
res *= ifact[r];
res %= mod;
res *= ifact[n - r];
res %= mod;
return res;
}
void solve() {
int i, j, l;
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (i = n; i <= n + k; i++) {
int rem = n + k - i;
int tmp = power(26LL, rem, mod);
tmp = tmp * power(25LL, i - n, mod);
tmp %= mod;
tmp = tmp * ncr(i - 1, n - 1);
tmp %= mod;
ans += tmp;
ans %= mod;
}
cout << ans << endl;
}
int32_t main() {
IOS;
int t;
t = 1;
precompute_factorials();
// precompute();
// cin>>t;
for (int tt = 1; tt <= t; tt++) {
// cout << "Case #"<<tt<<": ";
solve();
}
return 0;
}
/*
*/ | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long int
// #define ll int128_t
#define ld long double
#define ff first
#define ss second
#define mp make_pair
#define IOS \
std::ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
#define pb push_back
#define eb emplace_back
#define pii pair<int, int>
#define endl '\n'
#define all(x) x.begin(), x.end()
#define smax(a, b) a = max(a, b)
// #if !defined(ONLINE_JUDGE)
// #include "debugging.h"
// #endif
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k) returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;
// erase,insert same as normal set
int const mod = 1e9 + 7;
// int const mod = 998244353;
int power(int a, int b, int m) {
int res = 1;
while (b) {
if (b & 1) {
res = (res * a) % m;
res %= m;
}
a = (a * a) % m;
a %= m;
b = b / 2;
}
return res;
}
int inverse(int x, int m) { return power(x, m - 2, m); }
int const N = 2e6 + 55;
int const inf = 1e18;
ld pi = 3.14159265359;
int fact[N];
int ifact[N];
void precompute_factorials() {
fact[0] = 1;
for (int i = 1; i < N; i++) {
fact[i] = i * fact[i - 1];
fact[i] %= mod;
}
ifact[N - 1] = inverse(fact[N - 1], mod);
for (int i = N - 2; i >= 0; i--) {
ifact[i] = (i + 1) * ifact[i + 1];
ifact[i] %= mod;
}
}
int ncr(int n, int r) {
if (n < r || r < 0)
return 0;
if (n == r)
return 1;
int res = fact[n];
res *= ifact[r];
res %= mod;
res *= ifact[n - r];
res %= mod;
return res;
}
void solve() {
int i, j, l;
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
int ans = 0;
for (i = n; i <= n + k; i++) {
int rem = n + k - i;
int tmp = power(26LL, rem, mod);
tmp = tmp * power(25LL, i - n, mod);
tmp %= mod;
tmp = tmp * ncr(i - 1, n - 1);
tmp %= mod;
ans += tmp;
ans %= mod;
}
cout << ans << endl;
}
int32_t main() {
IOS;
int t;
t = 1;
precompute_factorials();
// precompute();
// cin>>t;
for (int tt = 1; tt <= t; tt++) {
// cout << "Case #"<<tt<<": ";
solve();
}
return 0;
}
/*
*/ | replace | 49 | 50 | 49 | 50 | 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 rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
const Int MOD = 1000000007;
const Int MAX = 1000010;
Int fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
Int COM(Int n, Int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
Int modpow(Int a, Int n) {
Int res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
COMinit(); // これをやっておくこと
Int K;
cin >> K;
string S;
cin >> S;
Int N = S.size();
Int sum = 0;
for (Int i = N; i <= N + K; i++) {
sum = (sum + (((COM(i - 1, N - 1) * modpow(25, i - N)) % MOD) *
modpow(26, N + K - i)) %
MOD) %
MOD;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
typedef int64_t Int;
const Int MOD = 1000000007;
const Int MAX = 2000010;
Int fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
Int COM(Int n, Int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
Int modpow(Int a, Int n) {
Int res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
COMinit(); // これをやっておくこと
Int K;
cin >> K;
string S;
cin >> S;
Int N = S.size();
Int sum = 0;
for (Int i = N; i <= N + K; i++) {
sum = (sum + (((COM(i - 1, N - 1) * modpow(25, i - N)) % MOD) *
modpow(26, N + K - i)) %
MOD) %
MOD;
}
cout << sum << endl;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02632 | Python | Runtime Error | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
S = readline().strip()
COM_MAX = 10**6
fac, finv, inv = [0] * (COM_MAX + 1), [0] * (COM_MAX + 1), [0] * (COM_MAX + 1)
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, COM_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
def mod_com(n, r):
if n < r:
return 0
if n < 0 or r < 0:
return 0
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD
M = len(S)
L = K + M
ans = 0
p = pow(25, K + 1, MOD)
for i in range(M - 1, -1, -1):
ans += mod_com(L, i) * p
p = p * 25 % MOD
ans = (pow(26, L, MOD) - ans) % MOD
print(ans)
return
if __name__ == "__main__":
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10**9)
INF = 1 << 60
MOD = 1000000007
def main():
K = int(readline())
S = readline().strip()
COM_MAX = 2 * 10**6
fac, finv, inv = [0] * (COM_MAX + 1), [0] * (COM_MAX + 1), [0] * (COM_MAX + 1)
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, COM_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
def mod_com(n, r):
if n < r:
return 0
if n < 0 or r < 0:
return 0
return fac[n] * (finv[r] * finv[n - r] % MOD) % MOD
M = len(S)
L = K + M
ans = 0
p = pow(25, K + 1, MOD)
for i in range(M - 1, -1, -1):
ans += mod_com(L, i) * p
p = p * 25 % MOD
ans = (pow(26, L, MOD) - ans) % MOD
print(ans)
return
if __name__ == "__main__":
main()
| replace | 14 | 15 | 14 | 15 | 1 | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02632/Python/s867257816.py", line 49, in <module>
main()
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02632/Python/s867257816.py", line 25, in main
finv[i] = finv[i - 1] * inv[i] % MOD
MemoryError
|
p02632 | Python | Runtime Error | import sys
K = int(sys.stdin.readline())
S = sys.stdin.readline().rstrip("\n")
# ## COMBINATION (MOD) ###
N_MAX = 10**6 # 問題サイズに合わせて変えておく
MOD = 10**9 + 7
inv = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N_MAX + 1):
inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
# K 文字追加
ans = 0
ln = len(S)
p1 = 1
p2 = 1
s2 = pow(26, K, MOD)
for i in range(1, K + 2):
ans += (p1 * p2 * s2) % MOD
ans %= MOD
# print(p1, p2, s2)
# pre
p1 = (p1 * (ln + i - 1) * inv[i]) % MOD
p2 = (p2 * 25) % MOD
# suf
s2 = (s2 * inv[26]) % MOD
print(ans)
| import sys
K = int(sys.stdin.readline())
S = sys.stdin.readline().rstrip("\n")
# ## COMBINATION (MOD) ###
N_MAX = 10**6 # 問題サイズに合わせて変えておく
MOD = 10**9 + 7
inv = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N_MAX + 2):
inv.append((-inv[MOD % i] * (MOD // i)) % MOD)
# K 文字追加
ans = 0
ln = len(S)
p1 = 1
p2 = 1
s2 = pow(26, K, MOD)
for i in range(1, K + 2):
ans += (p1 * p2 * s2) % MOD
ans %= MOD
# print(p1, p2, s2)
# pre
p1 = (p1 * (ln + i - 1) * inv[i]) % MOD
p2 = (p2 * 25) % MOD
# suf
s2 = (s2 * inv[26]) % MOD
print(ans)
| replace | 11 | 12 | 11 | 12 | 0 | |
p02632 | Python | Runtime Error | MOD = 10**9 + 7
K = int(input())
S = input()
N = len(S)
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9 + 7):
self.mod = mod
self.modinv = self.make_modinv_list(n_max)
self.fac, self.facinv = self.make_factorial_list(n_max)
def __call__(self, n, r):
if n < r or n < 0 or r < 0:
return 0
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n - r] % self.mod
def make_factorial_list(self, n):
# 階乗のリストと階乗のmod逆元のリストを返す O(n)
# self.make_modinv_list()が先に実行されている必要がある
fac = [1]
facinv = [1]
for i in range(1, n + 1):
fac.append(fac[i - 1] * i % self.mod)
facinv.append(facinv[i - 1] * self.modinv[i] % self.mod)
return fac, facinv
def make_modinv_list(self, n):
# 0からnまでのmod逆元のリストを返す O(n)
modinv = [0] * (n + 1)
modinv[1] = 1
for i in range(2, n + 1):
modinv[i] = self.mod - self.mod // i * modinv[self.mod % i] % self.mod
return modinv
comb = Combination(1000000)
ans = 0
for i in range(K + 1):
temp = comb(N + K - i - 1, N - 1)
temp %= MOD
temp *= pow(26, i, MOD)
temp %= MOD
temp *= pow(25, K - i, MOD)
temp %= MOD
ans += temp
ans %= MOD
print(ans)
| MOD = 10**9 + 7
K = int(input())
S = input()
N = len(S)
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9 + 7):
self.mod = mod
self.modinv = self.make_modinv_list(n_max)
self.fac, self.facinv = self.make_factorial_list(n_max)
def __call__(self, n, r):
if n < r or n < 0 or r < 0:
return 0
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n - r] % self.mod
def make_factorial_list(self, n):
# 階乗のリストと階乗のmod逆元のリストを返す O(n)
# self.make_modinv_list()が先に実行されている必要がある
fac = [1]
facinv = [1]
for i in range(1, n + 1):
fac.append(fac[i - 1] * i % self.mod)
facinv.append(facinv[i - 1] * self.modinv[i] % self.mod)
return fac, facinv
def make_modinv_list(self, n):
# 0からnまでのmod逆元のリストを返す O(n)
modinv = [0] * (n + 1)
modinv[1] = 1
for i in range(2, n + 1):
modinv[i] = self.mod - self.mod // i * modinv[self.mod % i] % self.mod
return modinv
comb = Combination(2100000)
ans = 0
for i in range(K + 1):
temp = comb(N + K - i - 1, N - 1)
temp %= MOD
temp *= pow(26, i, MOD)
temp %= MOD
temp *= pow(25, K - i, MOD)
temp %= MOD
ans += temp
ans %= MOD
print(ans)
| replace | 44 | 45 | 44 | 45 | 1 | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02632/Python/s364186313.py", line 46, in <module>
comb = Combination(1000000)
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02632/Python/s364186313.py", line 19, in __init__
self.fac, self.facinv = self.make_factorial_list(n_max)
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02632/Python/s364186313.py", line 33, in make_factorial_list
facinv.append(facinv[i - 1] * self.modinv[i] % self.mod)
MemoryError
|
p02632 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
// #include<bits/stdc++.h>
#define int long long
#define for0(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i <= (n); i++)
#define mp make_pair
#define all(x) x.begin(), x.end()
#define puts(x) cout << x << "\n"
#define endwith return
constexpr int mod = 1000000007;
using namespace std;
int input() {
int t;
cin >> t;
return t;
}
int n, a25[234567], ans, c[234567];
string s;
//(a^p)%mod
int f1(int a, int p) {
if (p == 1)
return a;
if (p % 2)
return f1(a, p - 1) * a % mod;
else
return f1(a * a % mod, p / 2) % mod;
}
// pでわる→ *= f1(p, mod - 2);
signed main() {
a25[0] = 1;
c[0] = 1;
cin >> n >> s;
for1(i, n + s.size()) {
a25[i] = a25[i - 1] * 25 % mod;
c[i] = c[i - 1] * (n + s.size() - i + 1) % mod;
c[i] = c[i] * f1(i, mod - 2) % mod;
}
ans = 1;
for0(v, n + s.size()) ans = ans * 26 % mod;
for0(i, s.size()) {
int k = c[i] * a25[n + s.size() - i] % mod;
ans -= k;
if (ans < 0)
ans += mod;
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <queue>
#include <set>
#include <string>
#include <vector>
// #include<bits/stdc++.h>
#define int long long
#define for0(i, n) for (int i = 0; i < (n); i++)
#define for1(i, n) for (int i = 1; i <= (n); i++)
#define mp make_pair
#define all(x) x.begin(), x.end()
#define puts(x) cout << x << "\n"
#define endwith return
constexpr int mod = 1000000007;
using namespace std;
int input() {
int t;
cin >> t;
return t;
}
int n, a25[2345678], ans, c[2345678];
string s;
//(a^p)%mod
int f1(int a, int p) {
if (p == 1)
return a;
if (p % 2)
return f1(a, p - 1) * a % mod;
else
return f1(a * a % mod, p / 2) % mod;
}
// pでわる→ *= f1(p, mod - 2);
signed main() {
a25[0] = 1;
c[0] = 1;
cin >> n >> s;
for1(i, n + s.size()) {
a25[i] = a25[i - 1] * 25 % mod;
c[i] = c[i - 1] * (n + s.size() - i + 1) % mod;
c[i] = c[i] * f1(i, mod - 2) % mod;
}
ans = 1;
for0(v, n + s.size()) ans = ans * 26 % mod;
for0(i, s.size()) {
int k = c[i] * a25[n + s.size() - i] % mod;
ans -= k;
if (ans < 0)
ans += mod;
}
cout << ans << endl;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define MOD 1000000007
#define N 200123
#define ll long long
using namespace std;
char cs[N];
int k, n, m;
string s;
ll fat[N], inv_fat[N], p[N], z[N];
ll gcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll x1, y1;
ll g = gcd(b, a % b, x1, y1);
x = y1;
y = x1 - ((a / b) * y1);
return g;
}
ll inv(ll a) {
ll x, y;
gcd(a, MOD, x, y);
return (x + MOD) % MOD;
}
ll C(int a, int b) {
return (((fat[a] * inv_fat[b]) % MOD) * inv_fat[a - b]) % MOD;
}
ll partial, ans;
int main() {
scanf("%d %s", &k, cs);
n = strlen(cs);
fat[0] = inv_fat[0] = p[0] = z[0] = 1;
for (int i = 1; i <= n + k + 5; ++i) {
fat[i] = (fat[i - 1] * i) % MOD;
inv_fat[i] = inv(fat[i]);
p[i] = (p[i - 1] * 25LL) % MOD;
z[i] = (z[i - 1] * 26LL) % MOD;
}
m = n - 1;
for (int i = n; i <= n + k; ++i) {
partial = (C(i - 1, m) * p[i - m - 1]) % MOD;
// printf("%d %d %lld\n",i - 1, m, C(i - 1, m));
ans = (ans + ((partial * z[n + k - i]) % MOD)) % MOD;
// printf("%d %lld\n", n + k - i, z[n + k - i]);
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
#define MOD 1000000007
#define N 2000123
#define ll long long
using namespace std;
char cs[N];
int k, n, m;
string s;
ll fat[N], inv_fat[N], p[N], z[N];
ll gcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll x1, y1;
ll g = gcd(b, a % b, x1, y1);
x = y1;
y = x1 - ((a / b) * y1);
return g;
}
ll inv(ll a) {
ll x, y;
gcd(a, MOD, x, y);
return (x + MOD) % MOD;
}
ll C(int a, int b) {
return (((fat[a] * inv_fat[b]) % MOD) * inv_fat[a - b]) % MOD;
}
ll partial, ans;
int main() {
scanf("%d %s", &k, cs);
n = strlen(cs);
fat[0] = inv_fat[0] = p[0] = z[0] = 1;
for (int i = 1; i <= n + k + 5; ++i) {
fat[i] = (fat[i - 1] * i) % MOD;
inv_fat[i] = inv(fat[i]);
p[i] = (p[i - 1] * 25LL) % MOD;
z[i] = (z[i - 1] * 26LL) % MOD;
}
m = n - 1;
for (int i = n; i <= n + k; ++i) {
partial = (C(i - 1, m) * p[i - m - 1]) % MOD;
// printf("%d %d %lld\n",i - 1, m, C(i - 1, m));
ans = (ans + ((partial * z[n + k - i]) % MOD)) % MOD;
// printf("%d %lld\n", n + k - i, z[n + k - i]);
}
printf("%lld\n", ans);
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02632 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef tuple<ll, ll, ll> tlll;
typedef tuple<int, int, int> tiii;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
const int MAX = 200001; // nCrのnのMAX+1
ll fac[MAX], finv[MAX], inv[MAX];
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll com(int n, int k) { // 1≦k≦n≦10^7
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
// Add cominit(); in main function.
ll rui(ll a, ll n) {
ll ans = 1;
while (n > 0) {
if (n & 1)
ans = ans * a % mod;
a = a * a % mod;
n /= 2;
}
return ans;
}
int main() {
cominit();
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
k = k + n;
ll ans = 0;
for (int i = n; i <= k; i++) {
ans += rui(26, k - i) * com(i - 1, n - 1) % mod * rui(25, i - n) % mod;
ans %= mod;
}
cout << ans << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
template <typename T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(vec) vec.begin(), vec.end()
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef tuple<ll, ll, ll> tlll;
typedef tuple<int, int, int> tiii;
const ll mod = 1e9 + 7;
const int inf = 1 << 30;
const int MAX = 2e6 + 1; // nCrのnのMAX+1
ll fac[MAX], finv[MAX], inv[MAX];
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll com(int n, int k) { // 1≦k≦n≦10^7
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
// Add cominit(); in main function.
ll rui(ll a, ll n) {
ll ans = 1;
while (n > 0) {
if (n & 1)
ans = ans * a % mod;
a = a * a % mod;
n /= 2;
}
return ans;
}
int main() {
cominit();
int k;
cin >> k;
string s;
cin >> s;
int n = s.size();
k = k + n;
ll ans = 0;
for (int i = n; i <= k; i++) {
ans += rui(26, k - i) * com(i - 1, n - 1) % mod * rui(25, i - n) % mod;
ans %= mod;
}
cout << ans << endl;
} | replace | 28 | 29 | 28 | 29 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n)-1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define REPS(c, s) for (char c : s)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REV(c) reverse(ALL(c))
#define sz(v) (int)v.size()
#define endl '\n'
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline void prn(vector<T> &v) {
int n = sz(v);
REP(i, n) cout << v[i] << ' ';
}
template <class T> inline void printv(vector<T> &v) {
int n = sz(v);
REP(i, n) cout << v[i] << (i == n - 1 ? endl : ' ');
}
template <class T> inline void printvv(vector<vector<T>> &v) {
for (auto u : v)
printv(u);
}
template <class T> inline void printlnv(vector<T> &v) {
int n = sz(v);
REP(i, n) cout << v[i] << endl;
}
const int MOD = 1000000007;
const int INF = 1000000001;
const ll LINF = 1000000001000000001LL;
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(numeric_limits<double>::max_digits10);
solve();
return 0;
}
ll pow_mod(ll n, ll p, ll mod) {
if (p == 0) {
return 1;
} else if (p % 2 == 1) {
return pow_mod(n, p - 1, mod) * n % mod;
} else {
ll s = pow_mod(n, p / 2, mod);
return s * s % mod;
}
}
class Combination {
vector<ll> factorial;
vector<ll> fact_inverse;
vector<ll> inverse;
int mod;
void init(int size) {
factorial[0] = 1;
factorial[1] = 1;
fact_inverse[0] = 1;
fact_inverse[1] = 1;
inverse[1] = 1;
for (int i = 2; i < size; i++) {
factorial[i] = factorial[i - 1] * i % mod;
inverse[i] = mod - inverse[mod % i] * (mod / i) % mod;
fact_inverse[i] = fact_inverse[i - 1] * inverse[i] % mod;
}
}
public:
Combination(int size, int m) {
factorial = vector<ll>(size);
fact_inverse = vector<ll>(size);
inverse = vector<ll>(size);
mod = m;
init(size);
}
ll calc(int n, int k) {
if (n < k) {
return 0;
}
if (n < 0 || k < 0) {
return 0;
}
return factorial[n] * (fact_inverse[k] * fact_inverse[n - k] % mod) % mod;
}
// i.e. nHk
ll with_repetition(int n, int k) { return calc(n + k - 1, k); }
};
void solve() {
ll k;
string s;
cin >> k >> s;
ll n = sz(s);
Combination cmb(200200, MOD);
ll ans = 0;
REP(i, k + 1) {
ll t = pow_mod(25, i, MOD);
t *= cmb.calc(i + n - 1, n - 1);
t %= MOD;
t *= pow_mod(26, k - i, MOD);
t %= MOD;
ans += t;
ans %= MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vvvi = vector<vector<vector<int>>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vvvl = vector<vector<vector<ll>>>;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define FORR(i, m, n) for (int i = (m); i >= (n); i--)
#define REP(i, n) FOR(i, 0, (n))
#define REPR(i, n) FORR(i, (n)-1, 0)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define REPS(c, s) for (char c : s)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define REV(c) reverse(ALL(c))
#define sz(v) (int)v.size()
#define endl '\n'
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline void prn(vector<T> &v) {
int n = sz(v);
REP(i, n) cout << v[i] << ' ';
}
template <class T> inline void printv(vector<T> &v) {
int n = sz(v);
REP(i, n) cout << v[i] << (i == n - 1 ? endl : ' ');
}
template <class T> inline void printvv(vector<vector<T>> &v) {
for (auto u : v)
printv(u);
}
template <class T> inline void printlnv(vector<T> &v) {
int n = sz(v);
REP(i, n) cout << v[i] << endl;
}
const int MOD = 1000000007;
const int INF = 1000000001;
const ll LINF = 1000000001000000001LL;
void solve();
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(numeric_limits<double>::max_digits10);
solve();
return 0;
}
ll pow_mod(ll n, ll p, ll mod) {
if (p == 0) {
return 1;
} else if (p % 2 == 1) {
return pow_mod(n, p - 1, mod) * n % mod;
} else {
ll s = pow_mod(n, p / 2, mod);
return s * s % mod;
}
}
class Combination {
vector<ll> factorial;
vector<ll> fact_inverse;
vector<ll> inverse;
int mod;
void init(int size) {
factorial[0] = 1;
factorial[1] = 1;
fact_inverse[0] = 1;
fact_inverse[1] = 1;
inverse[1] = 1;
for (int i = 2; i < size; i++) {
factorial[i] = factorial[i - 1] * i % mod;
inverse[i] = mod - inverse[mod % i] * (mod / i) % mod;
fact_inverse[i] = fact_inverse[i - 1] * inverse[i] % mod;
}
}
public:
Combination(int size, int m) {
factorial = vector<ll>(size);
fact_inverse = vector<ll>(size);
inverse = vector<ll>(size);
mod = m;
init(size);
}
ll calc(int n, int k) {
if (n < k) {
return 0;
}
if (n < 0 || k < 0) {
return 0;
}
return factorial[n] * (fact_inverse[k] * fact_inverse[n - k] % mod) % mod;
}
// i.e. nHk
ll with_repetition(int n, int k) { return calc(n + k - 1, k); }
};
void solve() {
ll k;
string s;
cin >> k >> s;
ll n = sz(s);
Combination cmb(2002002, MOD);
ll ans = 0;
REP(i, k + 1) {
ll t = pow_mod(25, i, MOD);
t *= cmb.calc(i + n - 1, n - 1);
t %= MOD;
t *= pow_mod(26, k - i, MOD);
t %= MOD;
ans += t;
ans %= MOD;
}
cout << ans << endl;
}
| replace | 125 | 126 | 125 | 126 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() \
std::ios::sync_with_stdio(false); \
std::cin.tie(0); \
std::cout << fixed << setprecision(15);
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using namespace std;
// BinomialCoefficient; 二項係数
// ：BiCoef<mint> bc(xxxx)で初期化、bc.com(n, k)でnCkを計算
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= 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 istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
const int MOD = MODV;
using mint = Fp<MOD>;
int main() {
Init();
ll k;
string s;
cin >> k >> s;
BiCoef<mint> bc(1000001);
// 文字列sの長さをnとすると、n+1箇所に文字を挿入可能である。
// 重複の発生を考慮すると、n箇所には25種類、残り1箇所には26種類の文字が使える。
// n箇所を埋める文字列長の合計をiとすると、残り1箇所を埋める文字列長はk-iとなる。
// iを0～kまで動かして、総和を取ることで解を求める。
mint ans = 0;
for (ll i = 0; i <= k; i++)
ans += modpow((mint)25, i) * bc.com(i + s.size() - 1, s.size() - 1) *
modpow((mint)26, k - i);
cout << ans << endl;
} | #include <bits/stdc++.h>
#define ll long long
#define MODV 1000000007
#define INFLL LLONG_MAX // 9223372036854775807
#define EPS 1e-9
#define rep(i, n) for (ll i = 0, i##_len = (ll)(n); i < i##_len; i++)
#define repf(i, n) for (ll i = 1, i##_len = (ll)(n + 1); i < i##_len; i++)
#define all(v) v.begin(), v.end()
#define endl "\n"
#define vi vector<ll>
#define vvi vector<vector<ll>>
#define Yes() cout << "Yes" << endl
#define YES() cout << "YES" << endl
#define No() cout << "No" << endl
#define NO() cout << "NO" << endl
#define Init() \
std::ios::sync_with_stdio(false); \
std::cin.tie(0); \
std::cout << fixed << setprecision(15);
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
using namespace std;
// BinomialCoefficient; 二項係数
// ：BiCoef<mint> bc(xxxx)で初期化、bc.com(n, k)でnCkを計算
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= 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 istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
const int MOD = MODV;
using mint = Fp<MOD>;
int main() {
Init();
ll k;
string s;
cin >> k >> s;
BiCoef<mint> bc(2000001);
// 文字列sの長さをnとすると、n+1箇所に文字を挿入可能である。
// 重複の発生を考慮すると、n箇所には25種類、残り1箇所には26種類の文字が使える。
// n箇所を埋める文字列長の合計をiとすると、残り1箇所を埋める文字列長はk-iとなる。
// iを0～kまで動かして、総和を取ることで解を求める。
mint ans = 0;
for (ll i = 0; i <= k; i++)
ans += modpow((mint)25, i) * bc.com(i + s.size() - 1, s.size() - 1) *
modpow((mint)26, k - i);
cout << ans << endl;
} | replace | 146 | 147 | 146 | 147 | 0 | |
p02632 | C++ | Runtime Error | #include <cstdio>
#include <cstring>
using namespace std;
const int md = 1000000007;
const int N = 1000000;
int fact[N + 1], factinv[N + 1];
inline int add(int a, int b) {
a += b;
if (a >= md)
a -= md;
return a;
}
inline int mul(int a, int b) { return (int)((long long)a * b % md); }
inline int po(int a, int b) {
int r = 1;
while (b) {
if (b & 1)
r = mul(r, a);
a = mul(a, a);
b >>= 1;
}
return r;
}
inline int inv(int a) { return po(a, md - 2); }
inline int di(int a, int b) { return mul(a, inv(b)); }
void init() {
fact[0] = factinv[0] = 1;
for (int i = 1; i <= N; ++i) {
fact[i] = mul(fact[i - 1], i);
factinv[i] = inv(fact[i]);
}
}
inline int Cnk(int a, int b) {
return mul(fact[a], mul(factinv[b], factinv[a - b]));
}
char s[N + 1];
int main() {
init();
int n;
scanf("%d%s", &n, s);
int k = strlen(s);
int ans = 0;
for (int i = k; i <= n + k; ++i)
ans =
add(ans, mul(po(26, n + k - i), mul(Cnk(i - 1, k - 1), po(25, i - k))));
printf("%d\n", ans);
return 0;
}
| #include <cstdio>
#include <cstring>
using namespace std;
const int md = 1000000007;
const int N = 2000000;
int fact[N + 1], factinv[N + 1];
inline int add(int a, int b) {
a += b;
if (a >= md)
a -= md;
return a;
}
inline int mul(int a, int b) { return (int)((long long)a * b % md); }
inline int po(int a, int b) {
int r = 1;
while (b) {
if (b & 1)
r = mul(r, a);
a = mul(a, a);
b >>= 1;
}
return r;
}
inline int inv(int a) { return po(a, md - 2); }
inline int di(int a, int b) { return mul(a, inv(b)); }
void init() {
fact[0] = factinv[0] = 1;
for (int i = 1; i <= N; ++i) {
fact[i] = mul(fact[i - 1], i);
factinv[i] = inv(fact[i]);
}
}
inline int Cnk(int a, int b) {
return mul(fact[a], mul(factinv[b], factinv[a - b]));
}
char s[N + 1];
int main() {
init();
int n;
scanf("%d%s", &n, s);
int k = strlen(s);
int ans = 0;
for (int i = k; i <= n + k; ++i)
ans =
add(ans, mul(po(26, n + k - i), mul(Cnk(i - 1, k - 1), po(25, i - k))));
printf("%d\n", ans);
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int MAX_N = 1e6 + 10;
int K;
string S;
ll fact[MAX_N];
ll invf[MAX_N];
ll powmod(ll x, int y) {
ll res = 1;
while (y) {
if (y & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
y >>= 1;
}
return res;
}
ll nCk(int n, int k) {
if (k < 0 || k > n)
return 0;
return (((fact[n] * invf[n - k]) % MOD) * invf[k]) % MOD;
}
void solve() {
fact[0] = 1;
for (int i = 1; i < MAX_N; ++i)
fact[i] = 1LL * i * fact[i - 1] % MOD;
invf[MAX_N - 1] = powmod(fact[MAX_N - 1], MOD - 2);
for (int i = MAX_N - 2; i >= 0; --i)
invf[i] = 1LL * invf[i + 1] * (i + 1) % MOD;
ll res = 0;
const int n = S.length();
for (int len = 0; len < n; ++len) {
(res += 1LL * nCk(n + K, len) * powmod(25, n + K - len) % MOD) %= MOD;
}
ll ans = (powmod(26, n + K) - res + MOD) % MOD;
cout << ans;
}
int main() {
cin >> K >> S;
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1e9 + 7;
const int MAX_N = 2e6 + 10;
int K;
string S;
ll fact[MAX_N];
ll invf[MAX_N];
ll powmod(ll x, int y) {
ll res = 1;
while (y) {
if (y & 1)
(res *= x) %= MOD;
(x *= x) %= MOD;
y >>= 1;
}
return res;
}
ll nCk(int n, int k) {
if (k < 0 || k > n)
return 0;
return (((fact[n] * invf[n - k]) % MOD) * invf[k]) % MOD;
}
void solve() {
fact[0] = 1;
for (int i = 1; i < MAX_N; ++i)
fact[i] = 1LL * i * fact[i - 1] % MOD;
invf[MAX_N - 1] = powmod(fact[MAX_N - 1], MOD - 2);
for (int i = MAX_N - 2; i >= 0; --i)
invf[i] = 1LL * invf[i + 1] * (i + 1) % MOD;
ll res = 0;
const int n = S.length();
for (int len = 0; len < n; ++len) {
(res += 1LL * nCk(n + K, len) * powmod(25, n + K - len) % MOD) %= MOD;
}
ll ans = (powmod(26, n + K) - res + MOD) % MOD;
cout << ans;
}
int main() {
cin >> K >> S;
solve();
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<bool>> vvb;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void debugF(ostream &os) { os << endl; }
template <typename Head, typename... Tail>
void debugF(ostream &os, Head H, Tail... T) {
os << " " << H;
debugF(os, T...);
}
#define debug(...) \
cout << "[" << #__VA_ARGS__ << "]:", debugF(cout, __VA_ARGS__)
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); os << (i > 0 ? " " : "") << v[i++])
;
return os;
}
ll mod = 1e9 + 7;
vi fat, fatI;
int maxn = 1e6 + 42;
ll expMod(ll a, ll b, ll mod) {
ll ans = 1;
while (b) {
if (b & 1)
ans = (ans * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return ans;
}
void init() {
fat.resize(maxn + 1);
fatI.resize(maxn + 1);
fat[0] = fatI[0] = 1;
for (int i = 1; i <= maxn; i++) {
fat[i] = (fat[i - 1] * ll(i)) % mod;
fatI[i] = expMod(fat[i], mod - 2, mod);
}
}
int C(int n, int k) {
ll tmp = (fat[n] * ll(fatI[k])) % mod;
tmp *= fatI[n - k];
tmp %= mod;
return tmp;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
init();
int n, k, i;
cin >> k;
string s;
cin >> s;
n = s.size();
ll ans = 0;
int p25 = expMod(25, k, mod);
ll p25I = expMod(25, mod - 2, mod);
int p26 = 1;
for (i = 0; i <= k; i++) {
ll tmp = C(n + k - i - 1, n - 1);
tmp *= p25;
tmp %= mod;
tmp *= p26;
tmp %= mod;
ans += tmp;
ans %= mod;
p26 = (p26 * ll(26)) % mod;
p25 = (p25 * p25I) % mod;
}
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(), (x).end()
typedef vector<bool> vb;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vector<bool>> vvb;
typedef vector<vector<int>> vvi;
typedef vector<vector<ll>> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
void debugF(ostream &os) { os << endl; }
template <typename Head, typename... Tail>
void debugF(ostream &os, Head H, Tail... T) {
os << " " << H;
debugF(os, T...);
}
#define debug(...) \
cout << "[" << #__VA_ARGS__ << "]:", debugF(cout, __VA_ARGS__)
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &x : v)
is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (int i = 0; i < v.size(); os << (i > 0 ? " " : "") << v[i++])
;
return os;
}
ll mod = 1e9 + 7;
vi fat, fatI;
int maxn = 2e6 + 42;
ll expMod(ll a, ll b, ll mod) {
ll ans = 1;
while (b) {
if (b & 1)
ans = (ans * a) % mod;
a = (a * a) % mod;
b >>= 1;
}
return ans;
}
void init() {
fat.resize(maxn + 1);
fatI.resize(maxn + 1);
fat[0] = fatI[0] = 1;
for (int i = 1; i <= maxn; i++) {
fat[i] = (fat[i - 1] * ll(i)) % mod;
fatI[i] = expMod(fat[i], mod - 2, mod);
}
}
int C(int n, int k) {
ll tmp = (fat[n] * ll(fatI[k])) % mod;
tmp *= fatI[n - k];
tmp %= mod;
return tmp;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
init();
int n, k, i;
cin >> k;
string s;
cin >> s;
n = s.size();
ll ans = 0;
int p25 = expMod(25, k, mod);
ll p25I = expMod(25, mod - 2, mod);
int p26 = 1;
for (i = 0; i <= k; i++) {
ll tmp = C(n + k - i - 1, n - 1);
tmp *= p25;
tmp %= mod;
tmp *= p26;
tmp %= mod;
ans += tmp;
ans %= mod;
p26 = (p26 * ll(26)) % mod;
p25 = (p25 * p25I) % mod;
}
cout << ans << "\n";
return 0;
} | replace | 34 | 35 | 34 | 35 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
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;
}
// #define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k;
string s;
cin >> k >> s;
COMinit();
ll ts[k + 1];
ll tf[k + 1];
ts[0] = 1;
tf[0] = 1;
for (int i = 0; i < k; i++) {
ts[i + 1] = (ts[i] * 26) % MOD;
tf[i + 1] = (tf[i] * 25) % MOD;
}
ll ans = 0;
int n = s.size() + k;
for (int i = 0; i <= k; i++) {
ll add = ((ts[i] * tf[k - i]) % MOD) * COM(n - i - 1, n - k - 1);
ans += (add % MOD);
}
cout << ans % MOD << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
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;
}
// #define int long long
// signed main(){
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int k;
string s;
cin >> k >> s;
COMinit();
ll ts[k + 1];
ll tf[k + 1];
ts[0] = 1;
tf[0] = 1;
for (int i = 0; i < k; i++) {
ts[i + 1] = (ts[i] * 26) % MOD;
tf[i + 1] = (tf[i] * 25) % MOD;
}
ll ans = 0;
int n = s.size() + k;
for (int i = 0; i <= k; i++) {
ll add = ((ts[i] * tf[k - i]) % MOD) * COM(n - i - 1, n - k - 1);
ans += (add % MOD);
}
cout << ans % MOD << "\n";
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) { return fabs(a - b) < DBL_EPSILON; }
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
// ofstream outfile("log.txt");
// outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0')
// << rank << endl;
// std::cout << std::bitset<8>(9);
// const ll mod = 1e10;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQ_ASK;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
friend std::istream &operator>>(std::istream &in, mint &o) {
ll a;
in >> a;
o = a;
return in;
}
friend std::ostream &operator<<(std::ostream &out, const mint &o) {
out << o.x;
return out;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} combination(1000000);
int main() {
int k;
string s;
cin >> k >> s;
int n = s.size();
mint ans = 0;
rep(i, k + 1) {
ans += combination(k - i + n - 1, n - 1) * mint(25).pow(k - i) *
mint(26).pow(i);
}
cout << ans << endl;
} | #include <bits/stdc++.h>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
using namespace std;
const double PI = 3.14159265358979323846;
typedef long long ll;
const double EPS = 1e-9;
#define rep(i, n) for (int i = 0; i < (n); ++i)
// #define rep(i, n) for (ll i = 0; i < (n); ++i)
typedef pair<ll, ll> P;
const ll INF = 10e17;
#define cmin(x, y) x = min(x, y)
#define cmax(x, y) x = max(x, y)
#define ret() return 0;
double equal(double a, double b) { return fabs(a - b) < DBL_EPSILON; }
std::istream &operator>>(std::istream &in, set<int> &o) {
int a;
in >> a;
o.insert(a);
return in;
}
std::istream &operator>>(std::istream &in, queue<int> &o) {
ll a;
in >> a;
o.push(a);
return in;
}
bool contain(set<int> &s, int a) { return s.find(a) != s.end(); }
// ofstream outfile("log.txt");
// outfile << setw(6) << setfill('0') << prefecture << setw(6) << setfill('0')
// << rank << endl;
// std::cout << std::bitset<8>(9);
// const ll mod = 1e10;
typedef priority_queue<ll, vector<ll>, greater<ll>> PQ_ASK;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
friend std::istream &operator>>(std::istream &in, mint &o) {
ll a;
in >> a;
o = a;
return in;
}
friend std::ostream &operator<<(std::ostream &out, const mint &o) {
out << o.x;
return out;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} combination(10000000);
int main() {
int k;
string s;
cin >> k >> s;
int n = s.size();
mint ans = 0;
rep(i, k + 1) {
ans += combination(k - i + n - 1, n - 1) * mint(25).pow(k - i) *
mint(26).pow(i);
}
cout << ans << endl;
} | replace | 132 | 133 | 132 | 133 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout << ans << endl
#define COYE cout << "YES" << endl
#define COYe cout << "Yes" << endl
#define COye cout << "yes" << endl
#define CONO cout << "NO" << endl
#define CONo cout << "No" << endl
#define COno cout << "no" << endl
#define FORE(i, a) for (auto &i : a)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR(i, 1, n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort((V).begin(), (V).end())
#define REVERSE(V) reverse((V).begin(), (V).end())
#define EACH(V, i) \
for (typeof((V).begin()) i = (V).begin(); i != (V).end(); ++i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define INF ((1LL << 62) - (1LL << 31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Edge = pair<int, int>;
using Graph = vector<vector<int>>;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
////////// 二項係数(N<=10^7) //////////
ll fac[MAX], finv[MAX], inv[MAX];
// fac[i] i!
// finv[i] i!の逆元
// inv[i] iの逆元
// テーブルを作る前処理
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;
}
//////////////////////////////////////////////////
////////// 繰り返し二乗法 //////////
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
//////////////////////////////////////////////////
int main() {
COMinit();
ll K, ans = 0LL;
string S;
cin >> K >> S;
ll P[1000010], Q[1000010];
P[0] = 1;
Q[0] = 1;
RREP(i, S.size() + K) {
P[i] = P[i - 1] * 25 % MOD;
Q[i] = Q[i - 1] * 26 % MOD;
}
REP(i, S.size()) {
ans += COM(S.size() + K, i) * P[S.size() + K - i];
ans %= MOD;
}
ans = Q[S.size() + K] - ans;
ans %= MOD;
if (ans < 0)
ans += MOD;
co(ans);
return 0;
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <time.h>
#include <tuple>
#include <utility>
#include <vector>
#define ll long long
#define itn int
#define endl '\n'
#define co(ans) cout << ans << endl
#define COYE cout << "YES" << endl
#define COYe cout << "Yes" << endl
#define COye cout << "yes" << endl
#define CONO cout << "NO" << endl
#define CONo cout << "No" << endl
#define COno cout << "no" << endl
#define FORE(i, a) for (auto &i : a)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) FFOR(i, 1, n)
#define PB push_back
#define MP make_pair
#define ALL(V) (V).begin(), (V).end()
#define SORT(V) sort((V).begin(), (V).end())
#define REVERSE(V) reverse((V).begin(), (V).end())
#define EACH(V, i) \
for (typeof((V).begin()) i = (V).begin(); i != (V).end(); ++i)
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define INF ((1LL << 62) - (1LL << 31))
#define EPS 1e-10
#define PI 3.141592653589793238
#define MOD 1000000007
#define MAX 5100000
using namespace std;
using Edge = pair<int, int>;
using Graph = vector<vector<int>>;
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
////////// 二項係数(N<=10^7) //////////
ll fac[MAX], finv[MAX], inv[MAX];
// fac[i] i!
// finv[i] i!の逆元
// inv[i] iの逆元
// テーブルを作る前処理
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;
}
//////////////////////////////////////////////////
////////// 繰り返し二乗法 //////////
ll power(ll a, ll b) {
ll res = 1;
while (b > 0) {
if (b & 1)
res = res * a % MOD;
a = a * a % MOD;
b >>= 1;
}
return res;
}
//////////////////////////////////////////////////
int main() {
COMinit();
ll K, ans = 0LL;
string S;
cin >> K >> S;
ll P[2000010], Q[2000010];
P[0] = 1;
Q[0] = 1;
RREP(i, S.size() + K) {
P[i] = P[i - 1] * 25 % MOD;
Q[i] = Q[i - 1] * 26 % MOD;
}
REP(i, S.size()) {
ans += COM(S.size() + K, i) * P[S.size() + K - i];
ans %= MOD;
}
ans = Q[S.size() + K] - ans;
ans %= MOD;
if (ans < 0)
ans += MOD;
co(ans);
return 0;
} | replace | 141 | 142 | 141 | 142 | -11 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <map>
#include <set>
#include <utility>
#include <vector>
using namespace std;
using P = pair<int, int>;
using ll = long long;
constexpr int MOD = 1000000007;
constexpr int MAX = 510000;
long long fac[MAX], finv[MAX], inv[MAX];
bool COMinited = false;
long long COM(int n, int k) {
if (COMinited == false) {
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;
}
COMinited = true;
}
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 = MOD) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int main() {
int k;
cin >> k;
string s;
cin >> s;
int t = s.size();
int ret = 0;
for (int i = t; i <= k + t; i++) {
ret += modpow(25, k + t - i) * COM(k + t, i) % MOD;
ret %= MOD;
}
cout << ret << endl;
} | #include <algorithm>
#include <cmath>
#include <iostream>
#include <limits.h>
#include <map>
#include <set>
#include <utility>
#include <vector>
using namespace std;
using P = pair<int, int>;
using ll = long long;
constexpr int MOD = 1000000007;
constexpr int MAX = 2000100;
long long fac[MAX], finv[MAX], inv[MAX];
bool COMinited = false;
long long COM(int n, int k) {
if (COMinited == false) {
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;
}
COMinited = true;
}
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 = MOD) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int main() {
int k;
cin >> k;
string s;
cin >> s;
int t = s.size();
int ret = 0;
for (int i = t; i <= k + t; i++) {
ret += modpow(25, k + t - i) * COM(k + t, i) % MOD;
ret %= MOD;
}
cout << ret << endl;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
ll pd[1000010];
ll rd[1000010];
ll Ep(int x, int y) {
if (y == 0)
return 1;
if (y == 1)
return x;
ll r = Ep(x, y / 2);
if (y % 2 == 1)
return r * r % MOD * x % MOD;
else
return r * r % MOD;
}
ll Ftl(ll x) {
if (x == 1 || x == 0)
return 1;
if (pd[x] != 0)
return pd[x];
return pd[x] = Ftl(x - 1) * x % MOD;
}
ll rFtl(ll x) {
if (x == 1 || x == 0)
return 1;
if (rd[x] != 0)
return rd[x];
return rd[x] = rFtl(x - 1) * Ep(x, MOD - 2) % MOD;
}
ll comb(ll m, ll n) {
if (m < n)
return 0;
return Ftl(m) * rFtl(n) % MOD * rFtl(m - n) % MOD;
}
int main() {
int k;
string s;
cin >> k >> s;
int k2 = s.size();
ll ans = 0;
for (int i = 0; i <= k; ++i) {
ans += Ep(26, k - i) * Ep(25, i) % MOD * comb(k2 + i - 1, i) % MOD;
ans %= MOD;
// cout << ans << endl;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MOD = 1000000007;
ll pd[2000010];
ll rd[2000010];
ll Ep(int x, int y) {
if (y == 0)
return 1;
if (y == 1)
return x;
ll r = Ep(x, y / 2);
if (y % 2 == 1)
return r * r % MOD * x % MOD;
else
return r * r % MOD;
}
ll Ftl(ll x) {
if (x == 1 || x == 0)
return 1;
if (pd[x] != 0)
return pd[x];
return pd[x] = Ftl(x - 1) * x % MOD;
}
ll rFtl(ll x) {
if (x == 1 || x == 0)
return 1;
if (rd[x] != 0)
return rd[x];
return rd[x] = rFtl(x - 1) * Ep(x, MOD - 2) % MOD;
}
ll comb(ll m, ll n) {
if (m < n)
return 0;
return Ftl(m) * rFtl(n) % MOD * rFtl(m - n) % MOD;
}
int main() {
int k;
string s;
cin >> k >> s;
int k2 = s.size();
ll ans = 0;
for (int i = 0; i <= k; ++i) {
ans += Ep(26, k - i) * Ep(25, i) % MOD * comb(k2 + i - 1, i) % MOD;
ans %= MOD;
// cout << ans << endl;
}
cout << ans << endl;
} | replace | 5 | 7 | 5 | 7 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define N 1000010
#define Mod 1000000007
char s[N];
int fac[N], inv[N];
inline void init(int n) {
fac[0] = fac[1] = inv[0] = inv[1] = 1;
for (int i = 1; i <= n; i++)
fac[i] = 1LL * fac[i - 1] * i % Mod;
for (int i = 2; i <= n; i++)
inv[i] = 1LL * (Mod - Mod / i) * inv[Mod % i] % Mod;
for (int i = 2; i <= n; i++)
inv[i] = 1LL * inv[i - 1] * inv[i] % Mod;
}
inline int Pow(int a, int b, int p = Mod) {
int res = 1;
for (; b; b >>= 1, a = 1LL * a * a % p)
if (b & 1)
res = 1LL * res * a % p;
return res;
}
inline int C(int n, int m) {
return 1LL * fac[n] * inv[m] % Mod * inv[n - m] % Mod;
}
inline int read() {
int x = 0;
char ch = getchar();
while (!isdigit(ch))
ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return x;
}
int main() {
int n = read();
scanf("%s", s);
int m = strlen(s), ans = 0;
n += m;
init(n);
for (int i = m; i <= n; i++)
(ans += 1LL * Pow(25, i - m) * Pow(26, n - i) % Mod * C(i - 1, m - 1) %
Mod) %= Mod;
return printf("%d\n", ans), 0;
} | #include <bits/stdc++.h>
using namespace std;
#define N 2000010
#define Mod 1000000007
char s[N];
int fac[N], inv[N];
inline void init(int n) {
fac[0] = fac[1] = inv[0] = inv[1] = 1;
for (int i = 1; i <= n; i++)
fac[i] = 1LL * fac[i - 1] * i % Mod;
for (int i = 2; i <= n; i++)
inv[i] = 1LL * (Mod - Mod / i) * inv[Mod % i] % Mod;
for (int i = 2; i <= n; i++)
inv[i] = 1LL * inv[i - 1] * inv[i] % Mod;
}
inline int Pow(int a, int b, int p = Mod) {
int res = 1;
for (; b; b >>= 1, a = 1LL * a * a % p)
if (b & 1)
res = 1LL * res * a % p;
return res;
}
inline int C(int n, int m) {
return 1LL * fac[n] * inv[m] % Mod * inv[n - m] % Mod;
}
inline int read() {
int x = 0;
char ch = getchar();
while (!isdigit(ch))
ch = getchar();
while (isdigit(ch))
x = x * 10 + ch - '0', ch = getchar();
return x;
}
int main() {
int n = read();
scanf("%s", s);
int m = strlen(s), ans = 0;
n += m;
init(n);
for (int i = m; i <= n; i++)
(ans += 1LL * Pow(25, i - m) * Pow(26, n - i) % Mod * C(i - 1, m - 1) %
Mod) %= Mod;
return printf("%d\n", ans), 0;
} | replace | 2 | 3 | 2 | 3 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { \
cout << x << ' '; \
} \
cout << endl;
#define INF 1000000000
#define mod 1000000007
using ll = long long;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
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 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 or k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll fact_mod(ll n) {
ll ret = 1;
for (ll i = 2; i <= n; i++)
ret = ret * (i % mod) % mod;
return ret;
}
ll pow_mod(ll x, ll n) {
if (n == 0)
return 1;
ll ret = pow_mod((x * x) % mod, n / 2);
if (n & 1)
ret = (ret * x) % mod;
return ret;
}
// O(r)
ll combination_mod(ll n, ll r) {
if (r > n - r)
r = n - r;
if (r == 0)
return 1;
ll a = 1;
for (ll i = 0; i < r; i++)
a = a * ((n - i) % mod) % mod;
ll b = pow_mod(fact_mod(r), mod - 2);
return (a % mod) * (b % mod) % mod;
}
ll inv_mod(ll n) { return pow_mod(n, mod - 2); }
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
COMinit();
int k;
cin >> k;
string s;
cin >> s;
int n = (int)s.size();
ll ans = 0;
rep(i, k + 1) {
ll rem = k - i;
ll res = pow_mod(26, i) * COM(n - 2 + rem + 1, rem) % mod *
pow_mod(25, rem) % mod;
ans += res;
ans %= mod;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(), x.end()
#define rep(i, n) for (int i = 0; i < (n); i++)
#define debug(v) \
cout << #v << ":"; \
for (auto x : v) { \
cout << x << ' '; \
} \
cout << endl;
#define INF 1000000000
#define mod 1000000007
using ll = long long;
const ll LINF = 1001002003004005006ll;
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
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 MAX = 4010000;
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 or k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll fact_mod(ll n) {
ll ret = 1;
for (ll i = 2; i <= n; i++)
ret = ret * (i % mod) % mod;
return ret;
}
ll pow_mod(ll x, ll n) {
if (n == 0)
return 1;
ll ret = pow_mod((x * x) % mod, n / 2);
if (n & 1)
ret = (ret * x) % mod;
return ret;
}
// O(r)
ll combination_mod(ll n, ll r) {
if (r > n - r)
r = n - r;
if (r == 0)
return 1;
ll a = 1;
for (ll i = 0; i < r; i++)
a = a * ((n - i) % mod) % mod;
ll b = pow_mod(fact_mod(r), mod - 2);
return (a % mod) * (b % mod) % mod;
}
ll inv_mod(ll n) { return pow_mod(n, mod - 2); }
signed main() {
cin.tie(0);
ios::sync_with_stdio(0);
COMinit();
int k;
cin >> k;
string s;
cin >> s;
int n = (int)s.size();
ll ans = 0;
rep(i, k + 1) {
ll rem = k - i;
ll res = pow_mod(26, i) * COM(n - 2 + rem + 1, rem) % mod *
pow_mod(25, rem) % mod;
ans += res;
ans %= mod;
}
cout << ans << endl;
return 0;
}
| replace | 32 | 33 | 32 | 33 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;
typedef unsigned long long ull;
#define faster \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define debug(x) cout << #x << " = " << (x) << endl
#define nl "\n"
#define sp " "
const int MOD = 1e9 + 7, SZ = 1e6 + 5;
int fact[SZ], N;
string s;
ll powmodk(ll a, ll k, ll m) {
if (k == 0)
return 1;
ll r = powmodk(a, k / 2, m);
r = (r * r) % m;
if (k % 2)
r = (r * a) % m;
return r;
}
inline ll fix(ll x) { return (x % MOD + MOD) % MOD; }
inline ll modinverse(ll a) { return powmodk(fix(a), MOD - 2, MOD); }
ll nck(int n, int k) {
ll num = fact[n];
ll den = modinverse(1LL * fact[n - k] * fact[k]);
return fix(num * den);
}
int main() {
faster fact[0] = 1;
for (int i = 1; i < SZ; i++) {
fact[i] = fix(1LL * i * fact[i - 1]);
}
cin >> N >> s;
N += int(s.length());
ll ans = powmodk(26, N, MOD);
for (int i = 0; i < int(s.size()); i++) {
ll pow = powmodk(25, N - i, MOD);
ans -= fix(nck(N, i) * pow);
}
cout << fix(ans) << nl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef long long ll;
typedef unsigned long long ull;
#define faster \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr); \
cout.tie(nullptr);
#define debug(x) cout << #x << " = " << (x) << endl
#define nl "\n"
#define sp " "
const int MOD = 1e9 + 7, SZ = 3e6 + 5;
int fact[SZ], N;
string s;
ll powmodk(ll a, ll k, ll m) {
if (k == 0)
return 1;
ll r = powmodk(a, k / 2, m);
r = (r * r) % m;
if (k % 2)
r = (r * a) % m;
return r;
}
inline ll fix(ll x) { return (x % MOD + MOD) % MOD; }
inline ll modinverse(ll a) { return powmodk(fix(a), MOD - 2, MOD); }
ll nck(int n, int k) {
ll num = fact[n];
ll den = modinverse(1LL * fact[n - k] * fact[k]);
return fix(num * den);
}
int main() {
faster fact[0] = 1;
for (int i = 1; i < SZ; i++) {
fact[i] = fix(1LL * i * fact[i - 1]);
}
cin >> N >> s;
N += int(s.length());
ll ans = powmodk(26, N, MOD);
for (int i = 0; i < int(s.size()); i++) {
ll pow = powmodk(25, N - i, MOD);
ans -= fix(nck(N, i) * pow);
}
cout << fix(ans) << nl;
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02632 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = 1e18;
ll factmod(ll a, ll b, ll m) {
if (a < b)
return 0;
ll s = 1;
while (a >= b) {
s = s * a % m;
a -= 1;
}
return s;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll combmod(ll a, ll b, ll m) {
if (b == 0)
return 1;
ll c = factmod(a, a - b + 1, m);
ll d = modinv(factmod(b, 1, m), m);
ll e = (c * d) % m;
return e;
}
ll powmod(ll a, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0) {
ll r = powmod(a, n / 2, m);
return r * r % m;
}
return a * powmod(a, n - 1, m) % m;
}
int main() {
ll k;
string s;
cin >> k >> s;
ll n = s.size();
ll t = 0;
for (int i = 0; i <= k; i++) {
ll a = 1;
a *= combmod(n + k - i - 1, n - 1, mod);
a %= mod;
a *= powmod(25, k - i, mod);
a %= mod;
a *= powmod(26, i, mod);
a %= mod;
t += a;
t %= mod;
}
cout << t << endl;
} | #include <bits/stdc++.h>
#define ll long long int
using namespace std;
const ll mod = 1000000007;
const ll inf = 1e18;
ll factmod(ll a, ll b, ll m) {
if (a < b)
return 0;
ll s = 1;
while (a >= b) {
s = s * a % m;
a -= 1;
}
return s;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll combmod(ll a, ll b, ll m) {
if (b == 0)
return 1;
ll c = factmod(a, a - b + 1, m);
ll d = modinv(factmod(b, 1, m), m);
ll e = (c * d) % m;
return e;
}
ll powmod(ll a, ll n, ll m) {
if (n == 0)
return 1;
if (n % 2 == 0) {
ll r = powmod(a, n / 2, m);
return r * r % m;
}
return a * powmod(a, n - 1, m) % m;
}
int main() {
ll k;
string s;
cin >> k >> s;
ll n = s.size();
ll t = 0;
ll c, d, e;
ll a = 1;
c = combmod(n + k - 1, n - 1, mod);
d = powmod(25, k, mod);
e = powmod(26, 0, mod);
a *= c;
a %= mod;
a *= d;
a %= mod;
a *= e;
a %= mod;
t += a;
t %= mod;
for (int i = 1; i <= k; i++) {
a = 1;
c = (((c * modinv(n + k - i, mod)) % mod) * (k - i + 1)) % mod;
a *= c;
d = (d * modinv(25, mod)) % mod;
a = (a * d) % mod;
e = e * 26 % mod;
a = a * e % mod;
t += a;
t %= mod;
}
cout << t << endl;
} | replace | 63 | 71 | 63 | 85 | TLE | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ios std::ios::sync_with_stdio(false)
#define sd(n) scanf("%d", &n)
#define sdd(n, m) scanf("%d%d", &n, &m)
#define sddd(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define pd(n) printf("%d\n", (n))
#define pdd(n, m) printf("%d %d\n", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n, m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld", &n)
#define sldd(n, m) scanf("%lld%lld", &n, &m)
#define slddd(n, m, k) scanf("%lld%lld%lld", &n, &m, &k)
#define sf(n) scanf("%lf", &n)
#define sff(n, m) scanf("%lf%lf", &n, &m)
#define sfff(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, n, a) for (int i = n; i >= a; i--)
#define mm(a, n) memset(a, n, sizeof(a))
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define il inline
#define int long long
#define ll long long
#define ull unsigned long long
#define MOD 1000000007
#define pi 3.14159265358979323
#define debug(x) cout << #x << ": " << x << endl;
#define debug2(x, y) \
cout << #x << ": " << x << " | " << #y << ": " << y << endl;
#define debug3(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define debug4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
using namespace std;
const ll INF(0x3f3f3f3f3f3f3f3fll);
const int inf(0x3f3f3f3f);
template <typename T> void read(T &res) {
bool flag = false;
char ch;
while (!isdigit(ch = getchar()))
(ch == '-') && (flag = true);
for (res = ch - 48; isdigit(ch = getchar());
res = (res << 1) + (res << 3) + ch - 48)
;
flag && (res = -res);
}
template <typename T> void Out(T x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
Out(x / 10);
putchar(x % 10 + '0');
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll pow_mod(ll x, ll n, ll mod) {
ll res = 1;
while (n) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll fact_pow(ll n, ll p) {
ll res = 0;
while (n) {
n /= p;
res += n;
}
return res;
}
ll mult(ll a, ll b, ll p) {
a %= p;
b %= p;
ll r = 0, v = a;
while (b) {
if (b & 1) {
r += v;
if (r > p)
r -= p;
}
v <<= 1;
if (v > p)
v -= p;
b >>= 1;
}
return r;
}
ll quick_pow(ll a, ll b, ll p) {
ll r = 1, v = a % p;
while (b) {
if (b & 1)
r = mult(r, v, p);
v = mult(v, v, p);
b >>= 1;
}
return r;
}
bool CH(ll a, ll n, ll x, ll t) {
ll r = quick_pow(a, x, n);
ll z = r;
for (ll i = 1; i <= t; i++) {
r = mult(r, r, n);
if (r == 1 && z != 1 && z != n - 1)
return true;
z = r;
}
return r != 1;
}
bool Miller_Rabin(ll n) {
if (n < 2)
return false;
if (n == 2)
return true;
if (!(n & 1))
return false;
ll x = n - 1, t = 0;
while (!(x & 1)) {
x >>= 1;
t++;
}
srand(time(NULL));
ll o = 8;
for (ll i = 0; i < o; i++) {
ll a = rand() % (n - 1) + 1;
if (CH(a, n, x, t))
return false;
}
return true;
}
void exgcd(ll a, ll b, ll &x, ll &y) {
if (!b) {
x = 1, y = 0;
return;
}
exgcd(b, a % b, x, y);
ll t = x;
x = y, y = t - (a / b) * y;
}
ll INV(ll a, ll b) {
ll x, y;
return exgcd(a, b, x, y), (x % b + b) % b;
}
ll crt(ll x, ll p, ll mod) { return INV(p / mod, mod) * (p / mod) * x; }
ll FAC(ll x, ll a, ll b) {
if (!x)
return 1;
ll ans = 1;
for (ll i = 1; i <= b; i++)
if (i % a)
ans *= i, ans %= b;
ans = pow_mod(ans, x / b, b);
for (ll i = 1; i <= x % b; i++)
if (i % a)
ans *= i, ans %= b;
return ans * FAC(x / a, a, b) % b;
}
ll C(ll n, ll m, ll a, ll b) {
ll N = FAC(n, a, b), M = FAC(m, a, b), Z = FAC(n - m, a, b), sum = 0, i;
for (i = n; i; i = i / a)
sum += i / a;
for (i = m; i; i = i / a)
sum -= i / a;
for (i = n - m; i; i = i / a)
sum -= i / a;
return N * pow_mod(a, sum, b) % b * INV(M, b) % b * INV(Z, b) % b;
}
ll exlucas(ll n, ll m, ll p) {
ll t = p, ans = 0, i;
for (i = 2; i * i <= p; i++) {
ll k = 1;
while (t % i == 0) {
k *= i, t /= i;
}
ans += crt(C(n, m, i, k), p, k), ans %= p;
}
if (t > 1)
ans += crt(C(n, m, t, t), p, t), ans %= p;
return ans % p;
}
/*
int prime[100000],minprime[100000];
int euler(int n)
{int
c=0,i,j;for(i=2;i<=n;i++){if(!minprime[i])prime[++c]=i,minprime[i]=i;for(j=1;j<=c&&i*prime[j]<=n;j++)
{minprime[i*prime[j]]=prime[j];if(i%prime[j]==0)break;}}return c;}
struct Tree{ll l,r,sum,lazy,maxn,minn;}tree[100000];
il void push_up(ll rt)
{tree[rt].sum=tree[rt<<1].sum+tree[rt<<1|1].sum;
tree[rt].maxn=max(tree[rt<<1].maxn,tree[rt<<1|1].maxn);
tree[rt].minn=min(tree[rt<<1].minn,tree[rt<<1|1].minn);}
il void push_down(ll rt , ll length)
{if(tree[rt].lazy){tree[rt<<1].lazy+=tree[rt].lazy;tree[rt<<1|1].lazy+=tree[rt].lazy;
tree[rt<<1].sum+=(length-(length>>1))*tree[rt].lazy;tree[rt<<1|1].sum+=(length>>1)*tree[rt].lazy;
tree[rt<<1].minn+=tree[rt].lazy;tree[rt<<1|1].minn+=tree[rt].lazy;
tree[rt<<1].maxn+=tree[rt].lazy;tree[rt<<1|1].maxn+=tree[rt].lazy;tree[rt].lazy=0;}}
il void build(ll l , ll r , ll rt , ll *aa)
{tree[rt].lazy=0;tree[rt].l=l;tree[rt].r=r;if(l==r)
{tree[rt].sum=aa[l];tree[rt].minn=tree[rt].sum;tree[rt].maxn=tree[rt].sum;return;}
ll mid=(l+r)>>1;build(l,mid,rt<<1,aa);build(mid+1,r,rt<<1|1,aa);push_up(rt);}
il void update_range(ll L , ll R , ll key , ll rt)
{if(tree[rt].r<L||tree[rt].l>R)return;if(L<=tree[rt].l&&R>=tree[rt].r){tree[rt].sum+=(tree[rt].r-tree[rt].l+1)*key;
tree[rt].minn+=key;tree[rt].maxn+=key;tree[rt].lazy+=key;return;}push_down(rt,tree[rt].r-tree[rt].l+1);
ll mid=(tree[rt].r+tree[rt].l)>>1;if(L<=mid)update_range(L,R,key,rt << 1);
if(R>mid)update_range(L,R,key,rt << 1 | 1);push_up(rt);}
il ll query_range(ll L, ll R, ll rt)
{if(L<=tree[rt].l&&R>=tree[rt].r){return
tree[rt].sum;}push_down(rt,tree[rt].r-tree[rt].l+1); ll
mid=(tree[rt].r+tree[rt].l)>>1;ll ans=0;if(L<=mid)ans+=query_range(L,R,rt << 1);
if(R>mid)ans+=query_range(L,R,rt << 1 | 1);return ans;}
il ll query_min(ll L,ll R,ll rt)
{if(L<=tree[rt].l&&R>=tree[rt].r){return
tree[rt].minn;}push_down(rt,tree[rt].r-tree[rt].l+1); ll
mid=(tree[rt].r+tree[rt].l)>>1;ll
ans=(0x3f3f3f3f3f3f3f3fll);if(L<=mid)ans=min(ans,query_min(L,R,rt << 1));
if(R>mid)ans=min(ans,query_min(L,R,rt << 1 | 1));return ans;}
il ll query_max(ll L, ll R, ll rt)
{if(L<=tree[rt].l&&R>=tree[rt].r){return
tree[rt].maxn;}push_down(rt,tree[rt].r-tree[rt].l+1); ll
mid=(tree[rt].r+tree[rt].l)>>1;ll
ans=-(0x3f3f3f3f3f3f3f3fll);if(L<=mid)ans=max(ans,query_max(L,R,rt << 1));
if(R>mid)ans=max(ans,query_max(L,R,rt << 1 | 1));return ans;}
*/
const int N = 3e5 + 10;
struct Edge {
int nex, to;
} edge[N << 1];
int head[N], tot;
void add_edge(int u, int v) {
edge[++tot].nex = head[u];
edge[tot].to = v;
head[u] = tot;
}
int fac[N], inv[N];
void init() {
fac[0] = 1;
rep(i, 1, N - 10) fac[i] = fac[i - 1] * i % MOD;
inv[N - 10] = pow_mod(fac[N - 10], MOD - 2, MOD);
per(i, N - 11, 0) inv[i] = inv[i + 1] * (i + 1) % MOD;
}
int C(int n, int m) { return fac[n] * inv[n - m] % MOD * inv[m] % MOD; }
char s[N];
signed main() {
ios;
init();
int k;
cin >> k >> s + 1;
int n = strlen(s + 1);
int ans = 0;
rep(i, 0, k) {
ans += C(n + i - 1, n - 1) * pow_mod(25, i, MOD) % MOD *
pow_mod(26, k - i, MOD) % MOD;
ans %= MOD;
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
#define ios std::ios::sync_with_stdio(false)
#define sd(n) scanf("%d", &n)
#define sdd(n, m) scanf("%d%d", &n, &m)
#define sddd(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define pd(n) printf("%d\n", (n))
#define pdd(n, m) printf("%d %d\n", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n, m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld", &n)
#define sldd(n, m) scanf("%lld%lld", &n, &m)
#define slddd(n, m, k) scanf("%lld%lld%lld", &n, &m, &k)
#define sf(n) scanf("%lf", &n)
#define sff(n, m) scanf("%lf%lf", &n, &m)
#define sfff(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, n, a) for (int i = n; i >= a; i--)
#define mm(a, n) memset(a, n, sizeof(a))
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define il inline
#define int long long
#define ll long long
#define ull unsigned long long
#define MOD 1000000007
#define pi 3.14159265358979323
#define debug(x) cout << #x << ": " << x << endl;
#define debug2(x, y) \
cout << #x << ": " << x << " | " << #y << ": " << y << endl;
#define debug3(x, y, z) \
cout << #x << ": " << x << " | " << #y << ": " << y << " | " << #z << ": " \
<< z << endl;
#define debug4(a, b, c, d) \
cout << #a << ": " << a << " | " << #b << ": " << b << " | " << #c << ": " \
<< c << " | " << #d << ": " << d << endl;
using namespace std;
const ll INF(0x3f3f3f3f3f3f3f3fll);
const int inf(0x3f3f3f3f);
template <typename T> void read(T &res) {
bool flag = false;
char ch;
while (!isdigit(ch = getchar()))
(ch == '-') && (flag = true);
for (res = ch - 48; isdigit(ch = getchar());
res = (res << 1) + (res << 3) + ch - 48)
;
flag && (res = -res);
}
template <typename T> void Out(T x) {
if (x < 0)
putchar('-'), x = -x;
if (x > 9)
Out(x / 10);
putchar(x % 10 + '0');
}
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
ll pow_mod(ll x, ll n, ll mod) {
ll res = 1;
while (n) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll fact_pow(ll n, ll p) {
ll res = 0;
while (n) {
n /= p;
res += n;
}
return res;
}
ll mult(ll a, ll b, ll p) {
a %= p;
b %= p;
ll r = 0, v = a;
while (b) {
if (b & 1) {
r += v;
if (r > p)
r -= p;
}
v <<= 1;
if (v > p)
v -= p;
b >>= 1;
}
return r;
}
ll quick_pow(ll a, ll b, ll p) {
ll r = 1, v = a % p;
while (b) {
if (b & 1)
r = mult(r, v, p);
v = mult(v, v, p);
b >>= 1;
}
return r;
}
bool CH(ll a, ll n, ll x, ll t) {
ll r = quick_pow(a, x, n);
ll z = r;
for (ll i = 1; i <= t; i++) {
r = mult(r, r, n);
if (r == 1 && z != 1 && z != n - 1)
return true;
z = r;
}
return r != 1;
}
bool Miller_Rabin(ll n) {
if (n < 2)
return false;
if (n == 2)
return true;
if (!(n & 1))
return false;
ll x = n - 1, t = 0;
while (!(x & 1)) {
x >>= 1;
t++;
}
srand(time(NULL));
ll o = 8;
for (ll i = 0; i < o; i++) {
ll a = rand() % (n - 1) + 1;
if (CH(a, n, x, t))
return false;
}
return true;
}
void exgcd(ll a, ll b, ll &x, ll &y) {
if (!b) {
x = 1, y = 0;
return;
}
exgcd(b, a % b, x, y);
ll t = x;
x = y, y = t - (a / b) * y;
}
ll INV(ll a, ll b) {
ll x, y;
return exgcd(a, b, x, y), (x % b + b) % b;
}
ll crt(ll x, ll p, ll mod) { return INV(p / mod, mod) * (p / mod) * x; }
ll FAC(ll x, ll a, ll b) {
if (!x)
return 1;
ll ans = 1;
for (ll i = 1; i <= b; i++)
if (i % a)
ans *= i, ans %= b;
ans = pow_mod(ans, x / b, b);
for (ll i = 1; i <= x % b; i++)
if (i % a)
ans *= i, ans %= b;
return ans * FAC(x / a, a, b) % b;
}
ll C(ll n, ll m, ll a, ll b) {
ll N = FAC(n, a, b), M = FAC(m, a, b), Z = FAC(n - m, a, b), sum = 0, i;
for (i = n; i; i = i / a)
sum += i / a;
for (i = m; i; i = i / a)
sum -= i / a;
for (i = n - m; i; i = i / a)
sum -= i / a;
return N * pow_mod(a, sum, b) % b * INV(M, b) % b * INV(Z, b) % b;
}
ll exlucas(ll n, ll m, ll p) {
ll t = p, ans = 0, i;
for (i = 2; i * i <= p; i++) {
ll k = 1;
while (t % i == 0) {
k *= i, t /= i;
}
ans += crt(C(n, m, i, k), p, k), ans %= p;
}
if (t > 1)
ans += crt(C(n, m, t, t), p, t), ans %= p;
return ans % p;
}
/*
int prime[100000],minprime[100000];
int euler(int n)
{int
c=0,i,j;for(i=2;i<=n;i++){if(!minprime[i])prime[++c]=i,minprime[i]=i;for(j=1;j<=c&&i*prime[j]<=n;j++)
{minprime[i*prime[j]]=prime[j];if(i%prime[j]==0)break;}}return c;}
struct Tree{ll l,r,sum,lazy,maxn,minn;}tree[100000];
il void push_up(ll rt)
{tree[rt].sum=tree[rt<<1].sum+tree[rt<<1|1].sum;
tree[rt].maxn=max(tree[rt<<1].maxn,tree[rt<<1|1].maxn);
tree[rt].minn=min(tree[rt<<1].minn,tree[rt<<1|1].minn);}
il void push_down(ll rt , ll length)
{if(tree[rt].lazy){tree[rt<<1].lazy+=tree[rt].lazy;tree[rt<<1|1].lazy+=tree[rt].lazy;
tree[rt<<1].sum+=(length-(length>>1))*tree[rt].lazy;tree[rt<<1|1].sum+=(length>>1)*tree[rt].lazy;
tree[rt<<1].minn+=tree[rt].lazy;tree[rt<<1|1].minn+=tree[rt].lazy;
tree[rt<<1].maxn+=tree[rt].lazy;tree[rt<<1|1].maxn+=tree[rt].lazy;tree[rt].lazy=0;}}
il void build(ll l , ll r , ll rt , ll *aa)
{tree[rt].lazy=0;tree[rt].l=l;tree[rt].r=r;if(l==r)
{tree[rt].sum=aa[l];tree[rt].minn=tree[rt].sum;tree[rt].maxn=tree[rt].sum;return;}
ll mid=(l+r)>>1;build(l,mid,rt<<1,aa);build(mid+1,r,rt<<1|1,aa);push_up(rt);}
il void update_range(ll L , ll R , ll key , ll rt)
{if(tree[rt].r<L||tree[rt].l>R)return;if(L<=tree[rt].l&&R>=tree[rt].r){tree[rt].sum+=(tree[rt].r-tree[rt].l+1)*key;
tree[rt].minn+=key;tree[rt].maxn+=key;tree[rt].lazy+=key;return;}push_down(rt,tree[rt].r-tree[rt].l+1);
ll mid=(tree[rt].r+tree[rt].l)>>1;if(L<=mid)update_range(L,R,key,rt << 1);
if(R>mid)update_range(L,R,key,rt << 1 | 1);push_up(rt);}
il ll query_range(ll L, ll R, ll rt)
{if(L<=tree[rt].l&&R>=tree[rt].r){return
tree[rt].sum;}push_down(rt,tree[rt].r-tree[rt].l+1); ll
mid=(tree[rt].r+tree[rt].l)>>1;ll ans=0;if(L<=mid)ans+=query_range(L,R,rt << 1);
if(R>mid)ans+=query_range(L,R,rt << 1 | 1);return ans;}
il ll query_min(ll L,ll R,ll rt)
{if(L<=tree[rt].l&&R>=tree[rt].r){return
tree[rt].minn;}push_down(rt,tree[rt].r-tree[rt].l+1); ll
mid=(tree[rt].r+tree[rt].l)>>1;ll
ans=(0x3f3f3f3f3f3f3f3fll);if(L<=mid)ans=min(ans,query_min(L,R,rt << 1));
if(R>mid)ans=min(ans,query_min(L,R,rt << 1 | 1));return ans;}
il ll query_max(ll L, ll R, ll rt)
{if(L<=tree[rt].l&&R>=tree[rt].r){return
tree[rt].maxn;}push_down(rt,tree[rt].r-tree[rt].l+1); ll
mid=(tree[rt].r+tree[rt].l)>>1;ll
ans=-(0x3f3f3f3f3f3f3f3fll);if(L<=mid)ans=max(ans,query_max(L,R,rt << 1));
if(R>mid)ans=max(ans,query_max(L,R,rt << 1 | 1));return ans;}
*/
const int N = 2e6 + 100;
struct Edge {
int nex, to;
} edge[N << 1];
int head[N], tot;
void add_edge(int u, int v) {
edge[++tot].nex = head[u];
edge[tot].to = v;
head[u] = tot;
}
int fac[N], inv[N];
void init() {
fac[0] = 1;
rep(i, 1, N - 10) fac[i] = fac[i - 1] * i % MOD;
inv[N - 10] = pow_mod(fac[N - 10], MOD - 2, MOD);
per(i, N - 11, 0) inv[i] = inv[i + 1] * (i + 1) % MOD;
}
int C(int n, int m) { return fac[n] * inv[n - m] % MOD * inv[m] % MOD; }
char s[N];
signed main() {
ios;
init();
int k;
cin >> k >> s + 1;
int n = strlen(s + 1);
int ans = 0;
rep(i, 0, k) {
ans += C(n + i - 1, n - 1) * pow_mod(25, i, MOD) % MOD *
pow_mod(26, k - i, MOD) % MOD;
ans %= MOD;
}
cout << ans << '\n';
return 0;
}
| replace | 229 | 230 | 229 | 230 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
// #include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
const int MAX = 1000010;
ll fac[MAX], finv[MAX], inv[MAX];
ll cache25[MAX];
ll cache26[MAX];
void init_ncr() {
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 ncr(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 npr(ll val1, ll val2) {
ll c = ncr(val1, val2);
return c * fac[val2] % MOD;
}
ll p25(ll n) { return cache25[n]; }
ll p26(ll n) { return cache26[n]; }
int main() {
init_ncr();
// std::cout << std::fixed << std::setprecision(10);
ll N;
scanf("%lld", &N);
ll c = 1;
for (ll i = 0; i < MAX; i++) {
cache25[i] = c;
c = (c * 25) % MOD;
}
c = 1;
for (ll i = 0; i < MAX; i++) {
cache26[i] = c;
c = (c * 26) % MOD;
}
string str;
cin >> str;
ll len = str.length();
ll ans = 0;
ll total_len = len + N;
// N回操作する
// len:元の文字列の長さ
// total = N + len
for (ll i = 0; i <= N; i++) {
// cout << "i:" << i << endl;
ll rest = N - i;
ll count = ncr(rest + len - 1, len - 1);
// cout << "(count):" << count << endl;
// cout << "rest:" << rest << endl;
count = count * p25(rest);
count %= MOD;
count = count * p26(i);
count %= MOD;
// cout << "count:" << count << endl;
ans += count;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#include <iostream>
// #include <algorithm>
// #include <iomanip>
#define ll long long
#define map unordered_map
#define set unordered_set
#define pll pair<ll, ll>
#define vll vector<ll>
#define mll map<ll, ll>
using namespace std;
const ll MOD = 1000000007LL;
const ll INF = (1LL << 60LL);
const int MAX = 2000010;
ll fac[MAX], finv[MAX], inv[MAX];
ll cache25[MAX];
ll cache26[MAX];
void init_ncr() {
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 ncr(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 npr(ll val1, ll val2) {
ll c = ncr(val1, val2);
return c * fac[val2] % MOD;
}
ll p25(ll n) { return cache25[n]; }
ll p26(ll n) { return cache26[n]; }
int main() {
init_ncr();
// std::cout << std::fixed << std::setprecision(10);
ll N;
scanf("%lld", &N);
ll c = 1;
for (ll i = 0; i < MAX; i++) {
cache25[i] = c;
c = (c * 25) % MOD;
}
c = 1;
for (ll i = 0; i < MAX; i++) {
cache26[i] = c;
c = (c * 26) % MOD;
}
string str;
cin >> str;
ll len = str.length();
ll ans = 0;
ll total_len = len + N;
// N回操作する
// len:元の文字列の長さ
// total = N + len
for (ll i = 0; i <= N; i++) {
// cout << "i:" << i << endl;
ll rest = N - i;
ll count = ncr(rest + len - 1, len - 1);
// cout << "(count):" << count << endl;
// cout << "rest:" << rest << endl;
count = count * p25(rest);
count %= MOD;
count = count * p26(i);
count %= MOD;
// cout << "count:" << count << endl;
ans += count;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| replace | 17 | 18 | 17 | 18 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); i++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// combination
// O(n)
const ll MOD = 1e9 + 7;
const ll max_n = 1010101;
ll fact[max_n];
bool fact_init = false;
ll powmod(ll a, ll b) {
if (b == 0)
return 1;
if (b % 2 == 1)
return a * powmod(a, b - 1) % MOD;
ll d = powmod(a, b / 2) % MOD;
return d * d % MOD;
}
ll comb(ll n, ll k) {
if (!fact_init) {
fact[0] = 1;
fact[1] = 1;
for (ll i = 2; i < max_n; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
}
fact_init = true;
}
ll ret = fact[n];
ret *= powmod(fact[k], MOD - 2);
ret %= MOD;
ret *= powmod(fact[n - k], MOD - 2);
ret %= MOD;
return ret;
// X^(-1) = X^(p-2) (mod p) (Fermat's little theorem)
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll ans = 0;
rep(i, k + 1) {
ll t = comb(n - 1 + k - i, n - 1);
t *= powmod(25, k - i);
t %= MOD;
t *= powmod(26, i);
t %= MOD;
ans += t;
ans %= MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = (0); i < (n); i++)
using namespace std;
typedef long long ll;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
// combination
// O(n)
const ll MOD = 1e9 + 7;
const ll max_n = 2020202;
ll fact[max_n];
bool fact_init = false;
ll powmod(ll a, ll b) {
if (b == 0)
return 1;
if (b % 2 == 1)
return a * powmod(a, b - 1) % MOD;
ll d = powmod(a, b / 2) % MOD;
return d * d % MOD;
}
ll comb(ll n, ll k) {
if (!fact_init) {
fact[0] = 1;
fact[1] = 1;
for (ll i = 2; i < max_n; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
}
fact_init = true;
}
ll ret = fact[n];
ret *= powmod(fact[k], MOD - 2);
ret %= MOD;
ret *= powmod(fact[n - k], MOD - 2);
ret %= MOD;
return ret;
// X^(-1) = X^(p-2) (mod p) (Fermat's little theorem)
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
ll ans = 0;
rep(i, k + 1) {
ll t = comb(n - 1 + k - i, n - 1);
t *= powmod(25, k - i);
t %= MOD;
t *= powmod(26, i);
t %= MOD;
ans += t;
ans %= MOD;
}
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 int MOD = 1e9 + 7;
const int N = 1e6 + 5;
int f[N], inv[N], finv[N];
// inv[]: inverse element
int powMod(int u, int v) {
int res = 1;
while (v) {
if (v & 1)
res = (ll)res * u % MOD;
v >>= 1;
u = (ll)u * u % MOD;
}
return res;
}
void initInv() {
f[0] = 1;
for (int i = 1; i < N; i++) {
f[i] = (ll)f[i - 1] * i % MOD;
}
inv[0] = inv[1] = 1;
for (int i = 2; i < N; i++) {
inv[i] = (ll)(MOD - MOD / i) * inv[MOD % i] % MOD;
}
finv[0] = finv[1] = 1;
for (int i = 2; i < N; i++) {
finv[i] = ((ll)finv[i - 1] * inv[i]) % MOD;
}
}
int C(int x, int y) {
if (y < 0)
return 0;
return ((ll)f[x] * finv[y] % MOD) * finv[x - y] % MOD;
}
int Lucas(int u, int v) {
if (v == 0)
return 1;
return (ll)C(u % MOD, v % MOD) * Lucas(u / MOD, v / MOD) % MOD;
}
int k, n, ans;
string s;
int main() {
ios::sync_with_stdio(false);
initInv();
cin >> k >> s;
n = s.length();
for (int pref = 0; pref <= k; pref++) {
ans = (ans + ((ll)powMod(26ll, pref) * powMod(25ll, k - pref) % MOD *
Lucas(n + k - 1 - pref, n - 1) % MOD)) %
MOD;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD = 1e9 + 7;
const int N = 2e6 + 5;
int f[N], inv[N], finv[N];
// inv[]: inverse element
int powMod(int u, int v) {
int res = 1;
while (v) {
if (v & 1)
res = (ll)res * u % MOD;
v >>= 1;
u = (ll)u * u % MOD;
}
return res;
}
void initInv() {
f[0] = 1;
for (int i = 1; i < N; i++) {
f[i] = (ll)f[i - 1] * i % MOD;
}
inv[0] = inv[1] = 1;
for (int i = 2; i < N; i++) {
inv[i] = (ll)(MOD - MOD / i) * inv[MOD % i] % MOD;
}
finv[0] = finv[1] = 1;
for (int i = 2; i < N; i++) {
finv[i] = ((ll)finv[i - 1] * inv[i]) % MOD;
}
}
int C(int x, int y) {
if (y < 0)
return 0;
return ((ll)f[x] * finv[y] % MOD) * finv[x - y] % MOD;
}
int Lucas(int u, int v) {
if (v == 0)
return 1;
return (ll)C(u % MOD, v % MOD) * Lucas(u / MOD, v / MOD) % MOD;
}
int k, n, ans;
string s;
int main() {
ios::sync_with_stdio(false);
initInv();
cin >> k >> s;
n = s.length();
for (int pref = 0; pref <= k; pref++) {
ans = (ans + ((ll)powMod(26ll, pref) * powMod(25ll, k - pref) % MOD *
Lucas(n + k - 1 - pref, n - 1) % MOD)) %
MOD;
}
cout << ans << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02632 | C++ | Runtime Error | // FIRST THINK, THEN CODE.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 998244353
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define rrep(i, a, b) for (ll i = a; i > b; --i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int, int>
#define pll pair<long, long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define PI 3.1415926535897932384626433832795
#define fix(f, n) fixed << setprecision(n) << f
#define all(x) x.begin(), x.end()
#define endl "\n"
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll newmod(ll a, ll b) { return ((a % b) + b) % b; }
ll powM(ll a, ll b, ll m) {
a %= m;
ll ans = 1;
while (b) {
if (b & 1)
ans = ans * a % m;
a = a * a % m;
b >>= 1;
}
return ans;
}
ll poww(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans = ans * a;
a = a * a;
b >>= 1;
}
return ans;
}
const ll N = 1e6 + 5;
ll fac[N], inv[N];
ll c(ll a, ll b, ll p) {
if (a < b)
return 0;
return (fac[a] * inv[a - b] % p) * inv[b] % p;
}
int main() {
IOS;
ll k;
cin >> k;
string s;
cin >> s;
ll p = (ll)1e9 + 7;
ll ans = 0;
ll n = s.size();
ll x = 1;
fac[0] = inv[0] = 1;
for (int i = 1; i < N; i++) {
fac[i] = fac[i - 1] * i % p;
inv[i] = powM(fac[i], p - 2, p);
}
// cout<<c(5,2,p)<<endl;
for (ll i = 0; i <= k; i++) {
ll temp = powM(26, k - i, p) * powM(25, i, p) % p;
// cout<<temp<<endl;
temp = temp * c(n + i - 1, i, p);
// cout<<c(n+i-1,i,p)%p;
ans = ans + temp;
ans %= p;
}
cout << ans << endl;
return 0;
} | // FIRST THINK, THEN CODE.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define MOD 998244353
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define rrep(i, a, b) for (ll i = a; i > b; --i)
#define vi vector<int>
#define vl vector<ll>
#define ld long double
#define vvi vector<vector<int>>
#define vvl vector<vector<long long>>
#define pii pair<int, int>
#define pll pair<long, long>
#define vpii vector<pii>
#define vpll vector<pll>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define PI 3.1415926535897932384626433832795
#define fix(f, n) fixed << setprecision(n) << f
#define all(x) x.begin(), x.end()
#define endl "\n"
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(NULL); \
cout.tie(NULL);
ll newmod(ll a, ll b) { return ((a % b) + b) % b; }
ll powM(ll a, ll b, ll m) {
a %= m;
ll ans = 1;
while (b) {
if (b & 1)
ans = ans * a % m;
a = a * a % m;
b >>= 1;
}
return ans;
}
ll poww(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans = ans * a;
a = a * a;
b >>= 1;
}
return ans;
}
const ll N = 2e6 + 5;
ll fac[N], inv[N];
ll c(ll a, ll b, ll p) {
if (a < b)
return 0;
return (fac[a] * inv[a - b] % p) * inv[b] % p;
}
int main() {
IOS;
ll k;
cin >> k;
string s;
cin >> s;
ll p = (ll)1e9 + 7;
ll ans = 0;
ll n = s.size();
ll x = 1;
fac[0] = inv[0] = 1;
for (int i = 1; i < N; i++) {
fac[i] = fac[i - 1] * i % p;
inv[i] = powM(fac[i], p - 2, p);
}
// cout<<c(5,2,p)<<endl;
for (ll i = 0; i <= k; i++) {
ll temp = powM(26, k - i, p) * powM(25, i, p) % p;
// cout<<temp<<endl;
temp = temp * c(n + i - 1, i, p);
// cout<<c(n+i-1,i,p)%p;
ans = ans + temp;
ans %= p;
}
cout << ans << endl;
return 0;
} | replace | 61 | 62 | 61 | 62 | 0 | |
p02632 | C++ | Runtime Error | #pragma optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
// #include<iomanip>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pii;
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fo(i, a, b) for (ll i = a; i <= b; i += 1)
#define rf(i, a, b) for (ll i = a; i >= b; i--)
#define vll vector<ll>
#define sz(a) ll(a.size())
#define all(v) v.begin(), v.end()
#define pb push_back
#define pf push_front
#define MAXN 100010
#define N 100010
#define MOD 1000000007
#define mod 998244353
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define nl '\n'
#define MS(x, y) fill_n(*x, sizeof x / sizeof **x, y);
#define mem(x, y) memset(x, y, sizeof(x));
#define INF 1000000000000000000
#define IO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
template <int D, typename T> struct Vec : public vector<Vec<D - 1, T>> {
static_assert(D >= 1, "Vector dimension must be greater than zero!");
template <typename... Args>
Vec(int n = 0, Args... args)
: vector<Vec<D - 1, T>>(n, Vec<D - 1, T>(args...)) {}
};
template <typename T> struct Vec<1, T> : public vector<T> {
Vec(int n = 0, const T &val = T()) : vector<T>(n, val) {}
};
ll modpower(ll x, ll y, ll p) {
ll res = 1; // Initialize result
x = x % p;
if (y == 0)
return 1;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1; // y = y/2
x = (x * x) % p; // Change x to x^2
}
return res;
}
ll power(ll x, ll y) {
ll res = 1; // Initialize result
x = x;
if (y == 0)
return 1;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x);
y = y >> 1; // y = y/2
x = (x * x); // Change x to x^2
}
return res;
}
// int gcd(int a, int b) { if (a == 0)return b;return gcd(b % a, a);}
ll modinv(ll a, ll p) { return modpower(a, p - 2, p); }
const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1},
dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
long long safe_sqrt(long long n) {
long long res = sqrt((long double)n);
if (res * res == n)
return res;
const long double eps = 1e-8;
if ((long double)(res + 1) * (res + 1) < n + eps)
return res + 1;
if ((long double)res * res + eps > n)
return res - 1;
return res;
}
// (a+b-1)/b for ceil
const int miMOD = 1000000007;
const int MX = 1000001;
struct mi {
ll v;
explicit operator ll() const { return v; }
mi() { v = 0; }
mi(ll _v) {
v = (-miMOD < _v && _v < miMOD) ? _v : _v % miMOD;
if (v < 0)
v += miMOD;
}
friend bool operator==(const mi &a, const mi &b) { return a.v == b.v; }
friend bool operator!=(const mi &a, const mi &b) { return !(a == b); }
friend bool operator<(const mi &a, const mi &b) { return a.v < b.v; }
mi &operator+=(const mi &m) {
if ((v += m.v) >= miMOD)
v -= miMOD;
return *this;
}
mi &operator-=(const mi &m) {
if ((v -= m.v) < 0)
v += miMOD;
return *this;
}
mi &operator*=(const mi &m) {
v = v * m.v % miMOD;
return *this;
}
mi &operator/=(const mi &m) { return (*this) *= inv(m); }
friend mi pow(mi a, ll p) {
mi ans = 1;
assert(p >= 0);
for (; p; p /= 2, a *= a)
if (p & 1)
ans *= a;
return ans;
}
friend mi inv(const mi &a) {
assert(a.v != 0);
return pow(a, miMOD - 2);
}
mi operator-() const { return mi(-v); }
mi &operator++() { return *this += 1; }
mi &operator--() { return *this -= 1; }
mi operator++(int) {
mi temp;
temp.v = v++;
return temp;
}
mi operator--(int) {
mi temp;
temp.v = v--;
return temp;
}
friend mi operator+(mi a, const mi &b) { return a += b; }
friend mi operator-(mi a, const mi &b) { return a -= b; }
friend mi operator*(mi a, const mi &b) { return a *= b; }
friend mi operator/(mi a, const mi &b) { return a /= b; }
friend ostream &operator<<(ostream &os, const mi &m) {
os << m.v;
return os;
}
friend istream &operator>>(istream &is, mi &m) {
ll x;
is >> x;
m.v = x;
return is;
}
};
typedef vector<mi> vmi;
typedef pair<mi, mi> pmi;
typedef vector<pmi> vpmi;
mi facs[MX];
mi facInvs[MX];
mi choose(mi _a, mi _b) {
ll a = (ll)_a, b = (ll)_b;
if (b > a)
return 0;
if (a < 0)
return 0;
if (b < 0)
return 0;
mi cur = facs[a];
cur = cur * facInvs[b];
cur = cur * facInvs[a - b];
return cur;
}
void initFacs() {
facs[0] = 1;
facInvs[0] = 1;
fo(i, 1, MX - 1) {
facs[i] = (facs[i - 1] * i);
facInvs[i] = inv(facs[i]);
}
}
void solve() {
initFacs();
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
mi ans = 0;
fo(x, 0, n + k) {
if (k - x >= ll(0) and n + k - x - ll(1) >= ll(0)) {
ans += mi(modpower(26, x, MOD) * modpower(25, k - x, MOD)) *
choose(n + k - x - 1, n - 1);
}
}
cout << ans << nl;
return;
}
int main() {
IO;
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
// #endif
int T = 1;
// cin >> T;
f(c, 0, T) { solve(); }
return 0;
} // multiset m make_pair make_tuple tuple<int,int,int> continue resize insert
// count size else true isValid second first false erase double priority_queue
// cout<<setprecision(12); push_back pop_back pop_front push_front lower_bound
// upper_bound reverse | #pragma optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
// #include<iomanip>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> pii;
#define f(i, a, b) for (ll i = a; i < b; i++)
#define fo(i, a, b) for (ll i = a; i <= b; i += 1)
#define rf(i, a, b) for (ll i = a; i >= b; i--)
#define vll vector<ll>
#define sz(a) ll(a.size())
#define all(v) v.begin(), v.end()
#define pb push_back
#define pf push_front
#define MAXN 100010
#define N 100010
#define MOD 1000000007
#define mod 998244353
#define deb(x) cout << '>' << #x << ':' << x << endl;
#define nl '\n'
#define MS(x, y) fill_n(*x, sizeof x / sizeof **x, y);
#define mem(x, y) memset(x, y, sizeof(x));
#define INF 1000000000000000000
#define IO \
ios::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
template <int D, typename T> struct Vec : public vector<Vec<D - 1, T>> {
static_assert(D >= 1, "Vector dimension must be greater than zero!");
template <typename... Args>
Vec(int n = 0, Args... args)
: vector<Vec<D - 1, T>>(n, Vec<D - 1, T>(args...)) {}
};
template <typename T> struct Vec<1, T> : public vector<T> {
Vec(int n = 0, const T &val = T()) : vector<T>(n, val) {}
};
ll modpower(ll x, ll y, ll p) {
ll res = 1; // Initialize result
x = x % p;
if (y == 0)
return 1;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1; // y = y/2
x = (x * x) % p; // Change x to x^2
}
return res;
}
ll power(ll x, ll y) {
ll res = 1; // Initialize result
x = x;
if (y == 0)
return 1;
if (x == 0)
return 0;
while (y > 0) {
if (y & 1)
res = (res * x);
y = y >> 1; // y = y/2
x = (x * x); // Change x to x^2
}
return res;
}
// int gcd(int a, int b) { if (a == 0)return b;return gcd(b % a, a);}
ll modinv(ll a, ll p) { return modpower(a, p - 2, p); }
const int dx[8] = {1, 0, -1, 0, 1, 1, -1, -1},
dy[8] = {0, 1, 0, -1, -1, 1, -1, 1};
long long safe_sqrt(long long n) {
long long res = sqrt((long double)n);
if (res * res == n)
return res;
const long double eps = 1e-8;
if ((long double)(res + 1) * (res + 1) < n + eps)
return res + 1;
if ((long double)res * res + eps > n)
return res - 1;
return res;
}
// (a+b-1)/b for ceil
const int miMOD = 1000000007;
const int MX = 2000001;
struct mi {
ll v;
explicit operator ll() const { return v; }
mi() { v = 0; }
mi(ll _v) {
v = (-miMOD < _v && _v < miMOD) ? _v : _v % miMOD;
if (v < 0)
v += miMOD;
}
friend bool operator==(const mi &a, const mi &b) { return a.v == b.v; }
friend bool operator!=(const mi &a, const mi &b) { return !(a == b); }
friend bool operator<(const mi &a, const mi &b) { return a.v < b.v; }
mi &operator+=(const mi &m) {
if ((v += m.v) >= miMOD)
v -= miMOD;
return *this;
}
mi &operator-=(const mi &m) {
if ((v -= m.v) < 0)
v += miMOD;
return *this;
}
mi &operator*=(const mi &m) {
v = v * m.v % miMOD;
return *this;
}
mi &operator/=(const mi &m) { return (*this) *= inv(m); }
friend mi pow(mi a, ll p) {
mi ans = 1;
assert(p >= 0);
for (; p; p /= 2, a *= a)
if (p & 1)
ans *= a;
return ans;
}
friend mi inv(const mi &a) {
assert(a.v != 0);
return pow(a, miMOD - 2);
}
mi operator-() const { return mi(-v); }
mi &operator++() { return *this += 1; }
mi &operator--() { return *this -= 1; }
mi operator++(int) {
mi temp;
temp.v = v++;
return temp;
}
mi operator--(int) {
mi temp;
temp.v = v--;
return temp;
}
friend mi operator+(mi a, const mi &b) { return a += b; }
friend mi operator-(mi a, const mi &b) { return a -= b; }
friend mi operator*(mi a, const mi &b) { return a *= b; }
friend mi operator/(mi a, const mi &b) { return a /= b; }
friend ostream &operator<<(ostream &os, const mi &m) {
os << m.v;
return os;
}
friend istream &operator>>(istream &is, mi &m) {
ll x;
is >> x;
m.v = x;
return is;
}
};
typedef vector<mi> vmi;
typedef pair<mi, mi> pmi;
typedef vector<pmi> vpmi;
mi facs[MX];
mi facInvs[MX];
mi choose(mi _a, mi _b) {
ll a = (ll)_a, b = (ll)_b;
if (b > a)
return 0;
if (a < 0)
return 0;
if (b < 0)
return 0;
mi cur = facs[a];
cur = cur * facInvs[b];
cur = cur * facInvs[a - b];
return cur;
}
void initFacs() {
facs[0] = 1;
facInvs[0] = 1;
fo(i, 1, MX - 1) {
facs[i] = (facs[i - 1] * i);
facInvs[i] = inv(facs[i]);
}
}
void solve() {
initFacs();
ll k;
cin >> k;
string s;
cin >> s;
ll n = s.size();
mi ans = 0;
fo(x, 0, n + k) {
if (k - x >= ll(0) and n + k - x - ll(1) >= ll(0)) {
ans += mi(modpower(26, x, MOD) * modpower(25, k - x, MOD)) *
choose(n + k - x - 1, n - 1);
}
}
cout << ans << nl;
return;
}
int main() {
IO;
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
// #endif
int T = 1;
// cin >> T;
f(c, 0, T) { solve(); }
return 0;
} // multiset m make_pair make_tuple tuple<int,int,int> continue resize insert
// count size else true isValid second first false erase double priority_queue
// cout<<setprecision(12); push_back pop_back pop_front push_front lower_bound
// upper_bound reverse | replace | 92 | 93 | 92 | 93 | 0 | |
p02632 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int sz = 1e6 + 1;
int k;
string s;
ll fact[sz], inv_fact[sz];
ll bpow(ll x, ll p) {
if (p == 0)
return 1;
if (p % 2)
return (x * bpow(x, p - 1)) % mod;
else {
ll b = bpow(x, p / 2);
return (b * b) % mod;
}
}
ll inv(ll x) { return bpow(x, mod - 2); }
void calc_fact() {
fact[0] = 1;
inv_fact[0] = 1;
for (int i = 1; i < sz; i++) {
fact[i] = (fact[i - 1] * i) % mod;
inv_fact[i] = inv(fact[i]);
}
}
ll cnk(ll nn, ll kk) {
return fact[nn] * inv_fact[nn - kk] % mod * inv_fact[kk] % mod;
}
void solve() {
cin >> k >> s;
int n = s.size();
calc_fact();
ll ans = 0;
for (int i = 0; i <= k; i++) {
ans +=
cnk(n + k - i - 1, n - 1) * bpow(25, k - i) % mod * bpow(26, i) % mod;
ans %= mod;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#if defined(_DEBUG)
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int q = 1;
// cin >> q;
for (; q > 0; q--) {
solve();
cout << endl;
}
} | #define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll mod = 1e9 + 7;
const int sz = 2e6 + 1;
int k;
string s;
ll fact[sz], inv_fact[sz];
ll bpow(ll x, ll p) {
if (p == 0)
return 1;
if (p % 2)
return (x * bpow(x, p - 1)) % mod;
else {
ll b = bpow(x, p / 2);
return (b * b) % mod;
}
}
ll inv(ll x) { return bpow(x, mod - 2); }
void calc_fact() {
fact[0] = 1;
inv_fact[0] = 1;
for (int i = 1; i < sz; i++) {
fact[i] = (fact[i - 1] * i) % mod;
inv_fact[i] = inv(fact[i]);
}
}
ll cnk(ll nn, ll kk) {
return fact[nn] * inv_fact[nn - kk] % mod * inv_fact[kk] % mod;
}
void solve() {
cin >> k >> s;
int n = s.size();
calc_fact();
ll ans = 0;
for (int i = 0; i <= k; i++) {
ans +=
cnk(n + k - i - 1, n - 1) * bpow(25, k - i) % mod * bpow(26, i) % mod;
ans %= mod;
}
cout << ans;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#if defined(_DEBUG)
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
int q = 1;
// cin >> q;
for (; q > 0; q--) {
solve();
cout << endl;
}
} | replace | 8 | 9 | 8 | 9 | 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 pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <class A, class B>
ostream &operator<<(ostream &ost, const pair<A, B> &p) {
ost << "{" << p.first << "," << p.second << "}";
return ost;
}
template <class T> ostream &operator<<(ostream &ost, const vector<T> &v) {
ost << "{";
for (int i = 0; i < v.size(); i++) {
if (i)
ost << ",";
ost << v[i];
}
ost << "}";
return ost;
}
inline int topbit(unsigned long long x) {
return x ? 63 - __builtin_clzll(x) : -1;
}
inline int popcount(unsigned long long x) { return __builtin_popcountll(x); }
inline int parity(unsigned long long x) { return __builtin_parity(x); }
template <uint32_t mod> struct ModInt {
uint32_t a;
ModInt &s(uint32_t vv) {
a = vv < mod ? vv : vv - mod;
return *this;
}
ModInt(int64_t x = 0) { s(x % mod + mod); }
ModInt &operator+=(const ModInt &x) { return s(a + x.a); }
ModInt &operator-=(const ModInt &x) { return s(a + mod - x.a); }
ModInt &operator*=(const ModInt &x) {
a = uint64_t(a) * x.a % mod;
return *this;
}
ModInt &operator/=(const ModInt &x) {
*this *= x.inv();
return *this;
}
ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }
bool operator==(const ModInt &x) const { return a == x.a; }
bool operator!=(const ModInt &x) const { return a != x.a; }
bool operator<(const ModInt &x) const { return a < x.a; }
ModInt operator-() const { return ModInt() - *this; }
ModInt pow(int64_t n) const {
ModInt res(1), x(*this);
while (n) {
if (n & 1)
res *= x;
x *= x;
n >>= 1;
}
return res;
}
ModInt inv() const { return pow(mod - 2); }
};
template <uint32_t mod> istream &operator>>(istream &in, ModInt<mod> &a) {
return (in >> a.a);
}
template <uint32_t mod>
ostream &operator<<(ostream &out, const ModInt<mod> &a) {
return (out << a.a);
}
using mint = ModInt<1000000007>;
template <class Mint, int32_t lg> struct ModIntTable {
int N;
vector<Mint> facts, finvs, invs;
ModIntTable() : N(1 << lg), facts(N), finvs(N), invs(N) {
const uint32_t mod = Mint(-1).a + 1;
invs[1] = 1;
for (int i = 2; i < N; i++)
invs[i] = invs[mod % i] * (mod - mod / i);
facts[0] = 1;
finvs[0] = 1;
for (int i = 1; i < N; i++) {
facts[i] = facts[i - 1] * i;
finvs[i] = finvs[i - 1] * invs[i];
}
}
inline Mint fact(int n) const { return facts[n]; }
inline Mint finv(int n) const { return finvs[n]; }
inline Mint inv(int n) const { return invs[n]; }
inline Mint binom(int n, int k) const {
if (n < 0 || k < 0 || k > n)
return 0;
return facts[n] * finvs[k] * finvs[n - k];
}
inline Mint perm(int n, int k) const {
if (n < 0 || k < 0 || k > n)
return 0;
return facts[n] * finvs[n - k];
}
inline Mint catalan(int n) { return facts[2 * n] * finvs[n + 1] * finvs[n]; }
};
ModIntTable<mint, 20> mt;
int K;
string S;
signed main() {
cin >> K >> S;
mint ans = 0;
for (int i = 0; i <= K; i++) {
mint tmp = mint(25).pow(i);
tmp *= mint(26).pow(K - i);
tmp *= mt.binom(i + S.size() - 1, S.size() - 1);
ans += tmp;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(), (v).end()
#define fi first
#define se second
using vint = vector<int>;
using pint = pair<int, int>;
using vpint = vector<pint>;
template <typename A, typename B> inline void chmin(A &a, B b) {
if (a > b)
a = b;
}
template <typename A, typename B> inline void chmax(A &a, B b) {
if (a < b)
a = b;
}
template <class A, class B>
ostream &operator<<(ostream &ost, const pair<A, B> &p) {
ost << "{" << p.first << "," << p.second << "}";
return ost;
}
template <class T> ostream &operator<<(ostream &ost, const vector<T> &v) {
ost << "{";
for (int i = 0; i < v.size(); i++) {
if (i)
ost << ",";
ost << v[i];
}
ost << "}";
return ost;
}
inline int topbit(unsigned long long x) {
return x ? 63 - __builtin_clzll(x) : -1;
}
inline int popcount(unsigned long long x) { return __builtin_popcountll(x); }
inline int parity(unsigned long long x) { return __builtin_parity(x); }
template <uint32_t mod> struct ModInt {
uint32_t a;
ModInt &s(uint32_t vv) {
a = vv < mod ? vv : vv - mod;
return *this;
}
ModInt(int64_t x = 0) { s(x % mod + mod); }
ModInt &operator+=(const ModInt &x) { return s(a + x.a); }
ModInt &operator-=(const ModInt &x) { return s(a + mod - x.a); }
ModInt &operator*=(const ModInt &x) {
a = uint64_t(a) * x.a % mod;
return *this;
}
ModInt &operator/=(const ModInt &x) {
*this *= x.inv();
return *this;
}
ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }
bool operator==(const ModInt &x) const { return a == x.a; }
bool operator!=(const ModInt &x) const { return a != x.a; }
bool operator<(const ModInt &x) const { return a < x.a; }
ModInt operator-() const { return ModInt() - *this; }
ModInt pow(int64_t n) const {
ModInt res(1), x(*this);
while (n) {
if (n & 1)
res *= x;
x *= x;
n >>= 1;
}
return res;
}
ModInt inv() const { return pow(mod - 2); }
};
template <uint32_t mod> istream &operator>>(istream &in, ModInt<mod> &a) {
return (in >> a.a);
}
template <uint32_t mod>
ostream &operator<<(ostream &out, const ModInt<mod> &a) {
return (out << a.a);
}
using mint = ModInt<1000000007>;
template <class Mint, int32_t lg> struct ModIntTable {
int N;
vector<Mint> facts, finvs, invs;
ModIntTable() : N(1 << lg), facts(N), finvs(N), invs(N) {
const uint32_t mod = Mint(-1).a + 1;
invs[1] = 1;
for (int i = 2; i < N; i++)
invs[i] = invs[mod % i] * (mod - mod / i);
facts[0] = 1;
finvs[0] = 1;
for (int i = 1; i < N; i++) {
facts[i] = facts[i - 1] * i;
finvs[i] = finvs[i - 1] * invs[i];
}
}
inline Mint fact(int n) const { return facts[n]; }
inline Mint finv(int n) const { return finvs[n]; }
inline Mint inv(int n) const { return invs[n]; }
inline Mint binom(int n, int k) const {
if (n < 0 || k < 0 || k > n)
return 0;
return facts[n] * finvs[k] * finvs[n - k];
}
inline Mint perm(int n, int k) const {
if (n < 0 || k < 0 || k > n)
return 0;
return facts[n] * finvs[n - k];
}
inline Mint catalan(int n) { return facts[2 * n] * finvs[n + 1] * finvs[n]; }
};
ModIntTable<mint, 22> mt;
int K;
string S;
signed main() {
cin >> K >> S;
mint ans = 0;
for (int i = 0; i <= K; i++) {
mint tmp = mint(25).pow(i);
tmp *= mint(26).pow(K - i);
tmp *= mt.binom(i + S.size() - 1, S.size() - 1);
ans += tmp;
}
cout << ans << endl;
return 0;
} | replace | 132 | 133 | 132 | 133 | 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 < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template <class T> inline void out(T t) { cout << t << "\n"; }
template <class T, class... Ts> inline void out(T t, Ts... ts) {
cout << t << " ";
out(ts...);
}
template <class T> inline bool CHMIN(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool CHMAX(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
constexpr int INF = 1e18;
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
// 二項係数ライブラリ
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
const int MOD = 1000000007;
// const int MOD =
using mint = Fp<MOD>;
BiCoef<mint> bc;
// bc.init(500050);
signed main() {
bc.init(500050);
int K;
string s;
cin >> K >> s;
mint ans = 0;
REP(i, K + 1) {
int num = K - i;
ans += modpow((mint)26, i) * bc.com(num + s.size() - 1, num) *
modpow((mint)25, num);
}
out(ans);
} | #include "bits/stdc++.h"
using namespace std;
#define int long long
#define REP(i, n) for (int i = 0; i < (int)n; ++i)
#define RREP(i, n) for (int i = (int)n - 1; i >= 0; --i)
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define RFOR(i, s, n) for (int i = (int)n - 1; i >= s; --i)
#define ALL(a) a.begin(), a.end()
#define IN(a, x, b) (a <= x && x < b)
template <class T> inline void out(T t) { cout << t << "\n"; }
template <class T, class... Ts> inline void out(T t, Ts... ts) {
cout << t << " ";
out(ts...);
}
template <class T> inline bool CHMIN(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool CHMAX(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
constexpr int INF = 1e18;
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
// 二項係数ライブラリ
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T com(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
const int MOD = 1000000007;
// const int MOD =
using mint = Fp<MOD>;
BiCoef<mint> bc;
// bc.init(500050);
signed main() {
bc.init(2000200);
int K;
string s;
cin >> K >> s;
mint ans = 0;
REP(i, K + 1) {
int num = K - i;
ans += modpow((mint)26, i) * bc.com(num + s.size() - 1, num) *
modpow((mint)25, num);
}
out(ans);
} | replace | 137 | 138 | 137 | 138 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// const ll mod = 998244353;
const ll mod = 1000000007;
const int inf = 1e9;
const ll linf = 1e18;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (ll i = (j); i < (n); ++i)
#define REP_REV(i, n) for (ll i = n - 1; i >= 0; --i)
#define REP_FROM_REV(i, j, n) for (ll i = n - 1; i >= j; --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) ll(x.size())
template <typename T> inline T chmax(T &a, const T b) {
return a = (a < b) ? b : a;
}
template <typename T> inline T chmin(T &a, const T b) {
return a = (a > b) ? b : a;
}
ll power(ll base, ll exponent) {
if (exponent % 2) {
return power(base, exponent - 1) * base % mod;
} else if (exponent) {
ll root_ans = power(base, exponent / 2);
return root_ans * root_ans % mod;
} else {
return 1;
}
}
ll inverse(ll x) { return power(x, mod - 2); }
ll gcd(ll a, ll b) {
if (a < b)
gcd(b, a);
ll r;
while (r = a % b) {
a = b;
b = r;
}
return b;
}
template <typename T> ll sum(T begin, T end) {
return accumulate(begin, end, 0ll);
}
struct combination {
vector<ll> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
using Pair = pair<int, int>;
using LPair = pair<ll, ll>;
template <ll Modulus> struct ModInt {
ll a;
constexpr ModInt(const ll x = 0) noexcept : a((x % mod + mod) % mod) {}
constexpr ll &value() noexcept { return a; }
constexpr const ll &value() const noexcept { return a; }
constexpr ModInt operator+(const ModInt x) const noexcept {
return ModInt(*this) += x;
}
constexpr ModInt operator-(const ModInt x) const noexcept {
return ModInt(*this) -= x;
}
constexpr ModInt operator*(const ModInt x) const noexcept {
return ModInt(*this) *= x;
}
constexpr ModInt operator/(const ModInt x) const noexcept {
return ModInt(*this) /= x;
}
constexpr ModInt &operator+=(const ModInt x) noexcept {
a += x.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr ModInt &operator-=(const ModInt x) noexcept {
if (a < x.a) {
a += Modulus;
}
a -= x.a;
return *this;
}
constexpr ModInt &operator*=(const ModInt x) noexcept {
a = a * x.a % Modulus;
return *this;
}
constexpr ModInt &operator/=(ModInt x) noexcept {
ll exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= x;
}
x *= x;
exp /= 2;
}
return *this;
}
constexpr ModInt operator-() noexcept { return ModInt(-a); }
friend ostream &operator<<(ostream &os, const ModInt &m) {
os << m.a;
return os;
}
};
using mint = ModInt<mod>;
signed main() {
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
combination tree(1e6 + 10);
ll k;
cin >> k;
string s;
cin >> s;
ll n = sz(s);
mint ans = 0;
REP(i, k + 1) {
mint a =
mint(tree.C(n + k - i - 1, n - 1)) * power(25, k - i) * power(26, i);
ans += a;
}
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
// const ll mod = 998244353;
const ll mod = 1000000007;
const int inf = 1e9;
const ll linf = 1e18;
const int dx[] = {1, -1, 0, 0};
const int dy[] = {0, 0, 1, -1};
#define REP(i, n) for (ll i = 0; i < (n); ++i)
#define REP_FROM(i, j, n) for (ll i = (j); i < (n); ++i)
#define REP_REV(i, n) for (ll i = n - 1; i >= 0; --i)
#define REP_FROM_REV(i, j, n) for (ll i = n - 1; i >= j; --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) ll(x.size())
template <typename T> inline T chmax(T &a, const T b) {
return a = (a < b) ? b : a;
}
template <typename T> inline T chmin(T &a, const T b) {
return a = (a > b) ? b : a;
}
ll power(ll base, ll exponent) {
if (exponent % 2) {
return power(base, exponent - 1) * base % mod;
} else if (exponent) {
ll root_ans = power(base, exponent / 2);
return root_ans * root_ans % mod;
} else {
return 1;
}
}
ll inverse(ll x) { return power(x, mod - 2); }
ll gcd(ll a, ll b) {
if (a < b)
gcd(b, a);
ll r;
while (r = a % b) {
a = b;
b = r;
}
return b;
}
template <typename T> ll sum(T begin, T end) {
return accumulate(begin, end, 0ll);
}
struct combination {
vector<ll> fact, inv;
combination(int sz) : fact(sz + 1), inv(sz + 1) {
fact[0] = 1;
for (int i = 1; i <= sz; i++) {
fact[i] = fact[i - 1] * i % mod;
}
inv[sz] = power(fact[sz], mod - 2);
for (int i = sz - 1; i >= 0; i--) {
inv[i] = inv[i + 1] * (i + 1) % mod;
}
}
ll C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return (fact[p] * inv[q] % mod * inv[p - q] % mod);
}
};
using Pair = pair<int, int>;
using LPair = pair<ll, ll>;
template <ll Modulus> struct ModInt {
ll a;
constexpr ModInt(const ll x = 0) noexcept : a((x % mod + mod) % mod) {}
constexpr ll &value() noexcept { return a; }
constexpr const ll &value() const noexcept { return a; }
constexpr ModInt operator+(const ModInt x) const noexcept {
return ModInt(*this) += x;
}
constexpr ModInt operator-(const ModInt x) const noexcept {
return ModInt(*this) -= x;
}
constexpr ModInt operator*(const ModInt x) const noexcept {
return ModInt(*this) *= x;
}
constexpr ModInt operator/(const ModInt x) const noexcept {
return ModInt(*this) /= x;
}
constexpr ModInt &operator+=(const ModInt x) noexcept {
a += x.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr ModInt &operator-=(const ModInt x) noexcept {
if (a < x.a) {
a += Modulus;
}
a -= x.a;
return *this;
}
constexpr ModInt &operator*=(const ModInt x) noexcept {
a = a * x.a % Modulus;
return *this;
}
constexpr ModInt &operator/=(ModInt x) noexcept {
ll exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= x;
}
x *= x;
exp /= 2;
}
return *this;
}
constexpr ModInt operator-() noexcept { return ModInt(-a); }
friend ostream &operator<<(ostream &os, const ModInt &m) {
os << m.a;
return os;
}
};
using mint = ModInt<mod>;
signed main() {
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
combination tree(2e6 + 10);
ll k;
cin >> k;
string s;
cin >> s;
ll n = sz(s);
mint ans = 0;
REP(i, k + 1) {
mint a =
mint(tree.C(n + k - i - 1, n - 1)) * power(25, k - i) * power(26, i);
ans += a;
}
cout << ans << endl;
}
| replace | 162 | 163 | 162 | 163 | 0 | |
p02632 | C++ | Runtime Error | // Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const long long MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T> bool chmin(T &x, T y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T> bool chmax(T &x, T y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <i64 mod = MOD> struct ModInt {
i64 p;
ModInt() : p(0) {}
ModInt(i64 x) { p = x >= 0 ? x % mod : x + (-x + mod - 1) / mod * mod; }
ModInt &operator+=(const ModInt &y) {
p = p + *y - ((p + *y) >= mod ? mod : 0);
return *this;
}
ModInt &operator-=(const ModInt &y) {
p = p - *y + (p - *y < 0 ? mod : 0);
return *this;
}
ModInt &operator*=(const ModInt &y) {
p = (p * *y) % mod;
return *this;
}
ModInt &operator%=(const ModInt &y) {
if (y)
p %= *y;
return *this;
}
ModInt operator+(const ModInt &y) const {
ModInt x = *this;
return x += y;
}
ModInt operator-(const ModInt &y) const {
ModInt x = *this;
return x -= y;
}
ModInt operator*(const ModInt &y) const {
ModInt x = *this;
return x *= y;
}
ModInt operator%(const ModInt &y) const {
ModInt x = *this;
return x %= y;
}
friend ostream &operator<<(ostream &stream, const ModInt<mod> &x) {
stream << *x;
return stream;
}
friend ostream &operator>>(ostream &stream, const ModInt<mod> &x) {
stream >> *x;
return stream;
}
ModInt &operator++() {
p = (p + 1) % mod;
return *this;
}
ModInt &operator--() {
p = (p - 1 + mod) % mod;
return *this;
}
bool operator==(const ModInt &y) const { return p == *y; }
bool operator!=(const ModInt &y) const { return p != *y; }
const i64 &operator*() const { return p; }
i64 &operator*() { return p; }
};
using mint = ModInt<>;
template <typename T> struct Matrix {
int h, w;
vector<T> v;
Matrix() : h(1), w(1), v(1, 1) {}
Matrix(int n) { *this = makeUnit(n); }
Matrix(int h, int w) : h(h), w(w), v(h * w, 0) {}
Matrix(vector<vector<T>> v_) : h(v_.size()), w(v_[0].size()), v(h * w) {
for (int i = 0; i < h; ++i)
for (int j = 0; j < w; ++j)
v[i * w + j] = v_[i][j];
}
static Matrix makeUnit(int n) {
Matrix mat(n, n);
for (int i = 0; i < n; ++i)
mat.at(i, i) = 1;
return mat;
}
T &at(int i, int j) {
assert(0 <= i && i <= h && 0 <= j && j < w);
return v[i * w + j];
};
Matrix pow(i64 x) {
assert(h == w);
auto mat = x & 1 ? *this : makeUnit(h);
auto u = *this;
while (u = u * u, x >>= 1)
if (x & 1)
mat *= u;
return mat;
}
Matrix &operator+=(const Matrix &mat) {
assert(h == mat.h && w == mat.w);
for (int i = 0; i < h * w; ++i)
v[i] += mat.v[i];
return *this;
}
Matrix &operator-=(const Matrix &mat) {
assert(h == mat.h && w == mat.w);
for (int i = 0; i < h * w; ++i)
v[i] -= mat.v[i];
return *this;
}
Matrix &operator%=(const T mod) {
for (int i = 0; i < h * w; ++i)
v[i] %= mod;
return *this;
}
Matrix operator*(const Matrix &mat) {
assert(w == mat.h);
Matrix ret(h, mat.w);
for (int i = 0; i < h; ++i)
for (int k = 0; k < w; ++k)
for (int j = 0; j < mat.w; ++j)
ret.v[i * mat.w + j] += v[i * w + k] * mat.v[k * mat.w + j];
return ret;
}
Matrix operator+(const Matrix &mat) { return Matrix(*this) += mat; }
Matrix operator-(const Matrix &mat) { return Matrix(*this) -= mat; }
Matrix operator%(const T mod) { return Matrix(*this) %= mod; }
Matrix &operator*=(const Matrix &mat) { return *this = *this * mat; }
};
void solve(long long k, std::string s) {
int n = s.size();
vector<int> v(n);
for (int i = 0; i < n; ++i)
v[i] = s[i] - 'a';
auto mpow = [](auto x, i64 y) {
auto z = x;
decltype(x) val = y & 1 ? x : decltype(x)(1);
while (z *= z, y >>= 1)
if (y & 1)
val *= z;
return val;
};
vector<mint> tf(n + k + 10, 1);
for (int i = 0; i < n + k + 9; ++i)
tf[i + 1] = tf[i] * 25;
vector<mint> ts(n + k + 10, 1);
for (int i = 0; i < n + k + 9; ++i)
ts[i + 1] = ts[i] * 26;
auto calc_fact = [mpow] {
constexpr int N = 1e5;
vector<mint> fact(N + 1, 1);
vector<mint> inv(N + 1, 1);
for (int i = 1; i < N; ++i) {
fact[i + 1] = fact[i] * (i + 1);
inv[i + 1] = mpow(fact[i + 1], MOD - 2);
}
return make_pair(fact, inv);
};
vector<mint> fact, inv;
tie(fact, inv) = calc_fact();
auto ncr = [&fact, &inv](int n, int r) {
if (n < 0 || r < 0 || n < r)
return mint(0);
return fact[n] * inv[r] * inv[n - r];
};
// 1文字マッチしてない状態で見る
// i: マッチ文字数 j: s[i]の位置
int i = n - 1;
// int j = n + k;
mint ans = 0;
for (int j = n - 1; j <= n + k - 1; ++j) {
int p1 = j;
int p2 = j - i;
mint val = tf[p2] * ncr(p1, p2);
ans += val * ts[n + k - 1 - j];
}
cout << ans << endl;
}
signed main() {
long long K;
scanf("%lld", &K);
std::string S;
std::cin >> S;
solve(K, S);
return 0;
}
| // Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
const long long MOD = 1e9 + 7;
const i64 INF = i64(1e18) + 7;
template <typename T> bool chmin(T &x, T y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <typename T> bool chmax(T &x, T y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <i64 mod = MOD> struct ModInt {
i64 p;
ModInt() : p(0) {}
ModInt(i64 x) { p = x >= 0 ? x % mod : x + (-x + mod - 1) / mod * mod; }
ModInt &operator+=(const ModInt &y) {
p = p + *y - ((p + *y) >= mod ? mod : 0);
return *this;
}
ModInt &operator-=(const ModInt &y) {
p = p - *y + (p - *y < 0 ? mod : 0);
return *this;
}
ModInt &operator*=(const ModInt &y) {
p = (p * *y) % mod;
return *this;
}
ModInt &operator%=(const ModInt &y) {
if (y)
p %= *y;
return *this;
}
ModInt operator+(const ModInt &y) const {
ModInt x = *this;
return x += y;
}
ModInt operator-(const ModInt &y) const {
ModInt x = *this;
return x -= y;
}
ModInt operator*(const ModInt &y) const {
ModInt x = *this;
return x *= y;
}
ModInt operator%(const ModInt &y) const {
ModInt x = *this;
return x %= y;
}
friend ostream &operator<<(ostream &stream, const ModInt<mod> &x) {
stream << *x;
return stream;
}
friend ostream &operator>>(ostream &stream, const ModInt<mod> &x) {
stream >> *x;
return stream;
}
ModInt &operator++() {
p = (p + 1) % mod;
return *this;
}
ModInt &operator--() {
p = (p - 1 + mod) % mod;
return *this;
}
bool operator==(const ModInt &y) const { return p == *y; }
bool operator!=(const ModInt &y) const { return p != *y; }
const i64 &operator*() const { return p; }
i64 &operator*() { return p; }
};
using mint = ModInt<>;
template <typename T> struct Matrix {
int h, w;
vector<T> v;
Matrix() : h(1), w(1), v(1, 1) {}
Matrix(int n) { *this = makeUnit(n); }
Matrix(int h, int w) : h(h), w(w), v(h * w, 0) {}
Matrix(vector<vector<T>> v_) : h(v_.size()), w(v_[0].size()), v(h * w) {
for (int i = 0; i < h; ++i)
for (int j = 0; j < w; ++j)
v[i * w + j] = v_[i][j];
}
static Matrix makeUnit(int n) {
Matrix mat(n, n);
for (int i = 0; i < n; ++i)
mat.at(i, i) = 1;
return mat;
}
T &at(int i, int j) {
assert(0 <= i && i <= h && 0 <= j && j < w);
return v[i * w + j];
};
Matrix pow(i64 x) {
assert(h == w);
auto mat = x & 1 ? *this : makeUnit(h);
auto u = *this;
while (u = u * u, x >>= 1)
if (x & 1)
mat *= u;
return mat;
}
Matrix &operator+=(const Matrix &mat) {
assert(h == mat.h && w == mat.w);
for (int i = 0; i < h * w; ++i)
v[i] += mat.v[i];
return *this;
}
Matrix &operator-=(const Matrix &mat) {
assert(h == mat.h && w == mat.w);
for (int i = 0; i < h * w; ++i)
v[i] -= mat.v[i];
return *this;
}
Matrix &operator%=(const T mod) {
for (int i = 0; i < h * w; ++i)
v[i] %= mod;
return *this;
}
Matrix operator*(const Matrix &mat) {
assert(w == mat.h);
Matrix ret(h, mat.w);
for (int i = 0; i < h; ++i)
for (int k = 0; k < w; ++k)
for (int j = 0; j < mat.w; ++j)
ret.v[i * mat.w + j] += v[i * w + k] * mat.v[k * mat.w + j];
return ret;
}
Matrix operator+(const Matrix &mat) { return Matrix(*this) += mat; }
Matrix operator-(const Matrix &mat) { return Matrix(*this) -= mat; }
Matrix operator%(const T mod) { return Matrix(*this) %= mod; }
Matrix &operator*=(const Matrix &mat) { return *this = *this * mat; }
};
void solve(long long k, std::string s) {
int n = s.size();
vector<int> v(n);
for (int i = 0; i < n; ++i)
v[i] = s[i] - 'a';
auto mpow = [](auto x, i64 y) {
auto z = x;
decltype(x) val = y & 1 ? x : decltype(x)(1);
while (z *= z, y >>= 1)
if (y & 1)
val *= z;
return val;
};
vector<mint> tf(n + k + 10, 1);
for (int i = 0; i < n + k + 9; ++i)
tf[i + 1] = tf[i] * 25;
vector<mint> ts(n + k + 10, 1);
for (int i = 0; i < n + k + 9; ++i)
ts[i + 1] = ts[i] * 26;
auto calc_fact = [mpow] {
constexpr int N = 3e6;
vector<mint> fact(N + 1, 1);
vector<mint> inv(N + 1, 1);
for (int i = 1; i < N; ++i) {
fact[i + 1] = fact[i] * (i + 1);
inv[i + 1] = mpow(fact[i + 1], MOD - 2);
}
return make_pair(fact, inv);
};
vector<mint> fact, inv;
tie(fact, inv) = calc_fact();
auto ncr = [&fact, &inv](int n, int r) {
if (n < 0 || r < 0 || n < r)
return mint(0);
return fact[n] * inv[r] * inv[n - r];
};
// 1文字マッチしてない状態で見る
// i: マッチ文字数 j: s[i]の位置
int i = n - 1;
// int j = n + k;
mint ans = 0;
for (int j = n - 1; j <= n + k - 1; ++j) {
int p1 = j;
int p2 = j - i;
mint val = tf[p2] * ncr(p1, p2);
ans += val * ts[n + k - 1 - j];
}
cout << ans << endl;
}
signed main() {
long long K;
scanf("%lld", &K);
std::string S;
std::cin >> S;
solve(K, S);
return 0;
}
| replace | 191 | 192 | 191 | 192 | 0 | |
p02632 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef long double ld;
typedef long long ll;
#define sz(x) (int)(x).size()
#define pb push_back
#define mp make_pair
#define f first
#define s second
template <typename T, typename U> bool ckmin(T &a, U b) {
return b < a ? a = b, true : false;
}
template <typename T, typename U> bool ckmax(T &a, U b) {
return b > a ? a = b, true : false;
}
const ll MOD = 1e9 + 7;
ll k, res = 0;
string s;
vector<ll> fac;
ll exp(ll a, ll n) {
if (n == 0)
return 1;
ll tmp = exp(a, n / 2);
tmp *= tmp;
tmp %= MOD;
if (n % 2)
tmp *= a;
tmp %= MOD;
return tmp;
}
ll inv(ll x) { return exp(x, MOD - 2); }
ll cmb(ll c, ll k) {
if (k > c)
return 0;
ll t = inv(fac[c - k]) * inv(fac[k]);
t %= MOD;
t *= fac[c];
t %= MOD;
return t;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> k >> s;
fac.assign(1e6 + 5, 1);
for (int i = 1; i < sz(fac); ++i) {
fac[i] = fac[i - 1] * i;
fac[i] %= MOD;
}
// characters at very end
for (int i = 0; i <= k; ++i) {
ll tmp = exp(26, i);
tmp *= cmb(k - i + sz(s) - 1, sz(s) - 1);
tmp %= MOD;
tmp *= exp(25, k - i);
tmp %= MOD;
res += tmp;
res %= MOD;
}
cout << res;
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef long double ld;
typedef long long ll;
#define sz(x) (int)(x).size()
#define pb push_back
#define mp make_pair
#define f first
#define s second
template <typename T, typename U> bool ckmin(T &a, U b) {
return b < a ? a = b, true : false;
}
template <typename T, typename U> bool ckmax(T &a, U b) {
return b > a ? a = b, true : false;
}
const ll MOD = 1e9 + 7;
ll k, res = 0;
string s;
vector<ll> fac;
ll exp(ll a, ll n) {
if (n == 0)
return 1;
ll tmp = exp(a, n / 2);
tmp *= tmp;
tmp %= MOD;
if (n % 2)
tmp *= a;
tmp %= MOD;
return tmp;
}
ll inv(ll x) { return exp(x, MOD - 2); }
ll cmb(ll c, ll k) {
if (k > c)
return 0;
ll t = inv(fac[c - k]) * inv(fac[k]);
t %= MOD;
t *= fac[c];
t %= MOD;
return t;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> k >> s;
fac.assign(3e6 + 5, 1);
for (int i = 1; i < sz(fac); ++i) {
fac[i] = fac[i - 1] * i;
fac[i] %= MOD;
}
// characters at very end
for (int i = 0; i <= k; ++i) {
ll tmp = exp(26, i);
tmp *= cmb(k - i + sz(s) - 1, sz(s) - 1);
tmp %= MOD;
tmp *= exp(25, k - i);
tmp %= MOD;
res += tmp;
res %= MOD;
}
cout << res;
return 0;
} | replace | 54 | 55 | 54 | 55 | 0 | |
p02632 | C++ | Runtime Error | /*BISMILLAH
THE WHITE WOLF
NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb push_back
#define eb emplace_back
#define mod 1000000007
#define PI 2 * acos(0.0)
const int N = 1000005;
vi fac(N);
void fcalc() {
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = (1LL * fac[i - 1] * i) % mod;
}
ll bigmod(ll x, ll po) {
ll res = 1;
while (po) {
if (po & 1)
res = (res * x) % mod;
x = (x * x) % mod;
po >>= 1;
}
return res;
}
ll bin(int n, int i) {
return (fac[n] * (bigmod(1LL * fac[n - i] * fac[i] % mod, mod - 2) % mod)) %
mod;
// return ((fac[n]*bigmod(fac[i], mod-2)%mod)%mod * bigmod(fac[n-i],
// mod-2)%mod)%mod;
}
int32_t main() {
io;
fcalc();
int n;
string s;
cin >> n >> s;
int m = s.size();
n += m;
ll ans = 1, sub = 0;
vi p(n + 1);
p[0] = 1;
for (int i = 1; i <= n; i++)
p[i] = (p[i - 1] * 25LL) % mod;
for (int i = 1; i <= n; i++)
ans = (ans * 26) % mod;
for (int i = 0; i < m; i++)
sub = (sub + bin(n, i) * p[n - i] % mod) % mod;
cout << (ans - sub + mod) % mod;
return 0;
}
| /*BISMILLAH
THE WHITE WOLF
NO DREAM IS TOO BIG AND NO DREAMER IS TOO SMALL*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<long long> vll;
typedef vector<int> vi;
#define io ios_base::sync_with_stdio(false)
#define pb push_back
#define eb emplace_back
#define mod 1000000007
#define PI 2 * acos(0.0)
const int N = 2000005;
vi fac(N);
void fcalc() {
fac[0] = 1;
for (int i = 1; i < N; i++)
fac[i] = (1LL * fac[i - 1] * i) % mod;
}
ll bigmod(ll x, ll po) {
ll res = 1;
while (po) {
if (po & 1)
res = (res * x) % mod;
x = (x * x) % mod;
po >>= 1;
}
return res;
}
ll bin(int n, int i) {
return (fac[n] * (bigmod(1LL * fac[n - i] * fac[i] % mod, mod - 2) % mod)) %
mod;
// return ((fac[n]*bigmod(fac[i], mod-2)%mod)%mod * bigmod(fac[n-i],
// mod-2)%mod)%mod;
}
int32_t main() {
io;
fcalc();
int n;
string s;
cin >> n >> s;
int m = s.size();
n += m;
ll ans = 1, sub = 0;
vi p(n + 1);
p[0] = 1;
for (int i = 1; i <= n; i++)
p[i] = (p[i - 1] * 25LL) % mod;
for (int i = 1; i <= n; i++)
ans = (ans * 26) % mod;
for (int i = 0; i < m; i++)
sub = (sub + bin(n, i) * p[n - i] % mod) % mod;
cout << (ans - sub + mod) % mod;
return 0;
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("popcnt")
#pragma GCC target("avx2")
*/
#ifdef LOCAL
#define dbg(x) cout << #x << " : " << x << endl;
#else
#define dbg(x)
#endif
#define int long long
#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto &x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
template <typename T1, typename T2> inline void mine(T1 &x, T2 y) {
if (x > y)
x = y;
}
template <typename T1, typename T2> inline void maxe(T1 &x, T2 y) {
if (x < y)
x = y;
}
ostream &operator<<(ostream &a, const vector<int> &b) {
for (auto k : b)
cout << k << ' ';
return a;
}
typedef long long ll;
typedef unsigned long long ull;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;
const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 1000010;
const double EPS = 1e-9;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll powmod(ll a, ll b) {
if (b == 0)
return 1;
ll k = powmod(a, b / 2);
k = k * k % MOD;
if (b & 1)
k = k * a % MOD;
return k;
}
int rev(int x) { return powmod(x, MOD - 2); }
int f[MX];
int f1[MX];
int C(int n, int k) {
if (k < 0 || k > n)
return 0;
return f[n] * f1[k] % MOD * f1[n - k] % MOD;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
f[0] = 1;
fi(1, MX) f[i] = f[i - 1] * i % MOD;
f1[MX - 1] = rev(f[MX - 1]);
fi1(MX - 1, 0) f1[i] = f1[i + 1] * (i + 1) % MOD;
int res = 0;
int n;
cin >> n;
str s;
cin >> s;
int m = siz(s);
fi(m, m + n + 1) {
res += C(i - 1, m - 1) * powmod(25, i - m) % MOD * powmod(26, m + n - i);
res %= MOD;
}
cout << res << '\n';
} | #include <algorithm>
#include <bitset>
#include <cassert>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
/*
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("popcnt")
#pragma GCC target("avx2")
*/
#ifdef LOCAL
#define dbg(x) cout << #x << " : " << x << endl;
#else
#define dbg(x)
#endif
#define int long long
#define pb push_back
#define ppb pop_back()
#define mp make_pair
#define fi(a, b) for (int i = a; i < b; i++)
#define fj(a, b) for (int j = a; j < b; j++)
#define fk(a, b) for (int k = a; k < b; k++)
#define fi1(a, b) for (int i = a - 1; i >= b; i--)
#define fj1(a, b) for (int j = a - 1; j >= b; j--)
#define fk1(a, b) for (int k = a - 1; k >= b; k--)
#define fx(x, a) for (auto &x : a)
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define rep1(i, a, b) for (int i = a - 1; i >= b; --i)
#define siz(x) (int)x.size()
#define lb lower_bound
#define ub upper_bound
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
using namespace std;
template <typename T1, typename T2> inline void mine(T1 &x, T2 y) {
if (x > y)
x = y;
}
template <typename T1, typename T2> inline void maxe(T1 &x, T2 y) {
if (x < y)
x = y;
}
ostream &operator<<(ostream &a, const vector<int> &b) {
for (auto k : b)
cout << k << ' ';
return a;
}
typedef long long ll;
typedef unsigned long long ull;
typedef char ch;
typedef string str;
typedef pair<int, int> pii;
typedef map<int, int> mii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vpii;
typedef vector<vpii> vvpii;
typedef vector<ch> vch;
typedef vector<vch> vvch;
typedef vector<str> vs;
const int MOD = 1000000007;
const int INF = 1000000050;
const long long BIG = (long long)2e18 + 50;
const int MX = 2000010;
const double EPS = 1e-9;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll powmod(ll a, ll b) {
if (b == 0)
return 1;
ll k = powmod(a, b / 2);
k = k * k % MOD;
if (b & 1)
k = k * a % MOD;
return k;
}
int rev(int x) { return powmod(x, MOD - 2); }
int f[MX];
int f1[MX];
int C(int n, int k) {
if (k < 0 || k > n)
return 0;
return f[n] * f1[k] % MOD * f1[n - k] % MOD;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
f[0] = 1;
fi(1, MX) f[i] = f[i - 1] * i % MOD;
f1[MX - 1] = rev(f[MX - 1]);
fi1(MX - 1, 0) f1[i] = f1[i + 1] * (i + 1) % MOD;
int res = 0;
int n;
cin >> n;
str s;
cin >> s;
int m = siz(s);
fi(m, m + n + 1) {
res += C(i - 1, m - 1) * powmod(25, i - m) % MOD * powmod(26, m + n - i);
res %= MOD;
}
cout << res << '\n';
} | replace | 87 | 88 | 87 | 88 | 0 | |
p02632 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//----------------------- Print Function ----------------------//
inline void print() { cout << '\n'; }
template <typename First, typename... Rest>
void print(const First &first, const Rest &...rest) {
cout << first << ' ';
print(rest...);
}
//------------------------- Libraries -------------------------//
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<1000000007>;
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long Perm(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * finv[n - k] % MOD;
}
//--------------------------- Solve ---------------------------//
void solve() {
int K;
string S;
cin >> K >> S;
COMinit();
mint ans = 0;
int len = S.size() + K;
for (int i = S.size(); i <= len; i++) {
ans += (mint)COM(i - 1, S.size() - 1) * modpow((mint)25, i - S.size()) *
modpow((mint)26, len - i);
}
cout << ans << '\n';
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
solve();
return 0;
} | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
//----------------------- Print Function ----------------------//
inline void print() { cout << '\n'; }
template <typename First, typename... Rest>
void print(const First &first, const Rest &...rest) {
cout << first << ' ';
print(rest...);
}
//------------------------- Libraries -------------------------//
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<1000000007>;
const int MAX = 10000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long Perm(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * finv[n - k] % MOD;
}
//--------------------------- Solve ---------------------------//
void solve() {
int K;
string S;
cin >> K >> S;
COMinit();
mint ans = 0;
int len = S.size() + K;
for (int i = S.size(); i <= len; i++) {
ans += (mint)COM(i - 1, S.size() - 1) * modpow((mint)25, i - S.size()) *
modpow((mint)26, len - i);
}
cout << ans << '\n';
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
solve();
return 0;
} | replace | 79 | 80 | 79 | 80 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
#define SZ(x) ((int)(x).size())
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 28;
const ll INF64 = 1ll << 55;
const int mod = 1000000007;
// const int mod = 998244353;
template <class T> inline bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline void line_out(const vector<T> vec) {
int n = SZ(vec);
rep(i, n) {
cout << vec[i];
if (i < n - 1)
cout << " ";
}
cout << endl;
return;
}
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++() {
if ((x += 1) >= mod)
x -= mod;
return *this;
}
mint &operator--() {
if ((x += mod - 1) >= mod)
x -= mod;
return *this;
}
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;
}
};
// h(n, r) = c(n+r-1, r)
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];
}
};
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() {
int k;
string s;
cin >> k >> s;
combination C(2 * k);
auto H = [&](int n, int r) { return C(n + r - 1, r); };
mint ans = 0;
for (int i = 0; i <= k; ++i) {
mint add = H(SZ(s), i);
add *= modpow(25, i);
add *= modpow(26, k - i);
ans += add;
}
cout << ans.x << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
#define rALL(a) (a).rbegin(), (a).rend()
#define SZ(x) ((int)(x).size())
using ll = long long;
using ull = unsigned long long;
using P = pair<int, int>;
using llP = pair<ll, ll>;
using DoP = pair<double, double>;
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1 << 28;
const ll INF64 = 1ll << 55;
const int mod = 1000000007;
// const int mod = 998244353;
template <class T> inline bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline void line_out(const vector<T> vec) {
int n = SZ(vec);
rep(i, n) {
cout << vec[i];
if (i < n - 1)
cout << " ";
}
cout << endl;
return;
}
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++() {
if ((x += 1) >= mod)
x -= mod;
return *this;
}
mint &operator--() {
if ((x += mod - 1) >= mod)
x -= mod;
return *this;
}
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;
}
};
// h(n, r) = c(n+r-1, r)
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];
}
};
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() {
int k;
string s;
cin >> k >> s;
combination C(2000010);
auto H = [&](int n, int r) { return C(n + r - 1, r); };
mint ans = 0;
for (int i = 0; i <= k; ++i) {
mint add = H(SZ(s), i);
add *= modpow(25, i);
add *= modpow(26, k - i);
ans += add;
}
cout << ans.x << endl;
} | replace | 137 | 138 | 137 | 138 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz(v) (ll)(v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a) \
{ cout << a << "\n"; }
#define tell(a, b) \
{ cout << a << " | " << b << "\n"; }
#define telll(a, b, c) \
{ cout << a << " | " << b << " | " << c << "\n"; }
#define teln(v, n) \
{ \
cout << "v- "; \
rep(o, 0, n) cout << v[o] << " "; \
cout << "\n"; \
}
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define M 500010
ll ex(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans = (ans * a) % md;
a = (a * a) % md, b /= 2;
}
return ans;
}
inline ll add(ll a, ll b) { return (a + b) % md; }
inline ll mul(ll a, ll b) { return (a * b) % md; }
ll f[M], iv[M];
ll C(ll n, ll r) { return mul(f[n], mul(iv[r], iv[n - r])); }
void prep_fac() {
f[0] = 1;
rep(i, 1, M) f[i] = mul(i, f[i - 1]);
iv[M - 1] = ex(f[M - 1], md - 2);
for (ll i = M - 2; i >= 0; --i)
iv[i] = mul(i + 1, iv[i + 1]);
}
int main() {
IOS;
prep_fac();
ll k;
cin >> k;
string s;
cin >> s;
ll n;
n = sz(s);
ll ans = 0, x = 1;
ll a[k + 1];
rep(i, 0, k + 1) {
a[i] = mul(C(n + i - 1, i), x);
x = mul(x, 25);
}
x = 1;
for (ll i = k; i >= 0; --i)
a[i] = mul(a[i], x), x = mul(x, 26), ans = add(ans, a[i]);
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define mk make_pair
#define fi first
#define se second
#define vll vector<ll>
#define pii pair<ll, ll>
#define vvll vector<vector<ll>>
#define pb push_back
#define sz(v) (ll)(v).size()
#define inf 1e18
#define md 1000000007
#define all(v) (v).begin(), (v).end()
#define rep(i, a, b) for (ll i = a; i < b; ++i)
#define tel(a) \
{ cout << a << "\n"; }
#define tell(a, b) \
{ cout << a << " | " << b << "\n"; }
#define telll(a, b, c) \
{ cout << a << " | " << b << " | " << c << "\n"; }
#define teln(v, n) \
{ \
cout << "v- "; \
rep(o, 0, n) cout << v[o] << " "; \
cout << "\n"; \
}
#define IOS \
ios_base::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define M 4000010
ll ex(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1)
ans = (ans * a) % md;
a = (a * a) % md, b /= 2;
}
return ans;
}
inline ll add(ll a, ll b) { return (a + b) % md; }
inline ll mul(ll a, ll b) { return (a * b) % md; }
ll f[M], iv[M];
ll C(ll n, ll r) { return mul(f[n], mul(iv[r], iv[n - r])); }
void prep_fac() {
f[0] = 1;
rep(i, 1, M) f[i] = mul(i, f[i - 1]);
iv[M - 1] = ex(f[M - 1], md - 2);
for (ll i = M - 2; i >= 0; --i)
iv[i] = mul(i + 1, iv[i + 1]);
}
int main() {
IOS;
prep_fac();
ll k;
cin >> k;
string s;
cin >> s;
ll n;
n = sz(s);
ll ans = 0, x = 1;
ll a[k + 1];
rep(i, 0, k + 1) {
a[i] = mul(C(n + i - 1, i), x);
x = mul(x, 25);
}
x = 1;
for (ll i = k; i >= 0; --i)
a[i] = mul(a[i], x), x = mul(x, 26), ans = add(ans, a[i]);
cout << ans << "\n";
return 0;
}
| replace | 49 | 50 | 49 | 50 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define pr pair<int, int>
#define mod 1000000007
#define endl "\n"
int power(int a, int b, int m = mod) {
if (b == 0)
return 1;
if (b == 1)
return a;
int res = power(a, b / 2, m);
res = (res * res) % m;
if (b & 1)
res = (res * a) % m;
return res;
}
int modinv(int a, int m = mod) { return power(a, m - 2, m); }
int add(int a, int b, int m = mod) {
int c = (a % m + b % m);
if (c >= m)
c -= m;
return c;
}
int sub(int a, int b, int m = mod) {
int c = (a % m - b % m);
if (c < 0)
c += m;
return c;
}
int mul(int a, int b, int m = mod) { return (a * b) % m; }
// x<<1 => x*2 x>>1 => x/2; cout<<flush;
// cout<<fixed<<setprecision(10)<<ans<<endl;
#define N 1000005
int fact[N], invfact[N];
void fun() {
fact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = mul(fact[i - 1], i);
invfact[N - 1] = modinv(fact[N - 1]);
for (int i = N - 2; i >= 0; i--)
invfact[i] = mul(invfact[i + 1], i + 1);
}
int ncr(int n, int r) {
int ans = fact[n];
ans = mul(ans, invfact[n - r]);
ans = mul(ans, invfact[r]);
return ans;
}
void solve() {
fun();
int k, ans = 0;
string s;
cin >> k >> s;
int n = s.length(), i;
int m = n + k;
for (i = n; i <= m; i++) {
int x = power(26, m - i);
int y = power(25, i - n);
int z = ncr(i - 1, n - 1);
int val = mul(x, mul(y, z));
ans = add(ans, val);
}
cout << ans << endl;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t = 1; // cin>>t;
for (int i = 1; i <= t; i++) {
solve();
}
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define pb push_back
#define pr pair<int, int>
#define mod 1000000007
#define endl "\n"
int power(int a, int b, int m = mod) {
if (b == 0)
return 1;
if (b == 1)
return a;
int res = power(a, b / 2, m);
res = (res * res) % m;
if (b & 1)
res = (res * a) % m;
return res;
}
int modinv(int a, int m = mod) { return power(a, m - 2, m); }
int add(int a, int b, int m = mod) {
int c = (a % m + b % m);
if (c >= m)
c -= m;
return c;
}
int sub(int a, int b, int m = mod) {
int c = (a % m - b % m);
if (c < 0)
c += m;
return c;
}
int mul(int a, int b, int m = mod) { return (a * b) % m; }
// x<<1 => x*2 x>>1 => x/2; cout<<flush;
// cout<<fixed<<setprecision(10)<<ans<<endl;
#define N 2000005
int fact[N], invfact[N];
void fun() {
fact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = mul(fact[i - 1], i);
invfact[N - 1] = modinv(fact[N - 1]);
for (int i = N - 2; i >= 0; i--)
invfact[i] = mul(invfact[i + 1], i + 1);
}
int ncr(int n, int r) {
int ans = fact[n];
ans = mul(ans, invfact[n - r]);
ans = mul(ans, invfact[r]);
return ans;
}
void solve() {
fun();
int k, ans = 0;
string s;
cin >> k >> s;
int n = s.length(), i;
int m = n + k;
for (i = n; i <= m; i++) {
int x = power(26, m - i);
int y = power(25, i - n);
int z = ncr(i - 1, n - 1);
int val = mul(x, mul(y, z));
ans = add(ans, val);
}
cout << ans << endl;
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
int t = 1; // cin>>t;
for (int i = 1; i <= t; i++) {
solve();
}
return 0;
} | replace | 37 | 38 | 37 | 38 | 0 | |
p02632 | C++ | Runtime Error | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
vector<ll> fact(2000000);
void init_fact(int n) {
fact[0] = 1;
for (int i = 1; i < n + 1; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
}
}
ll mod_pow(ll x, ll p) {
ll res = 1;
ll n = x;
while (p > 0) {
if (p & 1 == 1)
res = (res * n) % MOD;
n = (n * n) % MOD;
p = (p >> 1);
}
return res;
}
ll nCr(int n, int r) {
ll res = 1;
res *= fact[n];
res *= mod_pow(fact[r], MOD - 2);
res %= MOD;
res *= mod_pow(fact[n - r], MOD - 2);
res %= MOD;
return res;
}
int main() {
ll K;
cin >> K;
string s;
cin >> s;
ll S = s.size();
init_fact(K + S);
ll ans = 0;
for (int i = 0; i < K + 1; i++) {
ll tmp = nCr(S + K - i - 1, S - 1);
tmp *= mod_pow(25, K - i);
tmp %= MOD;
tmp *= mod_pow(26, i);
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << endl;
} | #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define MOD 1000000007
vector<ll> fact(2000001);
void init_fact(int n) {
fact[0] = 1;
for (int i = 1; i < n + 1; i++) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
}
}
ll mod_pow(ll x, ll p) {
ll res = 1;
ll n = x;
while (p > 0) {
if (p & 1 == 1)
res = (res * n) % MOD;
n = (n * n) % MOD;
p = (p >> 1);
}
return res;
}
ll nCr(int n, int r) {
ll res = 1;
res *= fact[n];
res *= mod_pow(fact[r], MOD - 2);
res %= MOD;
res *= mod_pow(fact[n - r], MOD - 2);
res %= MOD;
return res;
}
int main() {
ll K;
cin >> K;
string s;
cin >> s;
ll S = s.size();
init_fact(K + S);
ll ans = 0;
for (int i = 0; i < K + 1; i++) {
ll tmp = nCr(S + K - i - 1, S - 1);
tmp *= mod_pow(25, K - i);
tmp %= MOD;
tmp *= mod_pow(26, i);
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define sint(a) scanf("%d", &a)
#define sint2(a, b) scanf("%d %d", &a, &b)
#define sll(a) scanf("%lld", &a)
#define sll2(a, b) scanf("%lld %lld", &a, &b)
#define mem(a, i) memset(a, i, sizeof(a))
#define pb push_back
#define ll long long
#define lson node << 1
#define rson (node << 1) + 1
const int maxn = 1e6 + 10;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
ll qpow(ll a, ll n) {
ll b = 1;
while (n) {
if (n & 1)
b = (b * a) % mod;
a = a * a % mod;
n >>= 1;
}
return b;
}
ll ji[maxn];
void init() {
ji[0] = 1;
for (int i = 1; i < maxn; i++)
ji[i] = ji[i - 1] * i % mod;
}
ll c(ll a, ll n) {
return ji[n] * qpow(ji[a], mod - 2) % mod * qpow(ji[n - a], mod - 2) % mod;
}
int main() {
init();
ll n;
string s;
cin >> n >> s;
ll k = s.length();
ll len = k + n;
ll ans = 0;
for (int i = 1; i <= len - k + 1; i++) {
ans = (ans + qpow(26, i - 1) * qpow(25, len - i - k + 1) % mod *
c(k - 1, len - i) % mod) %
mod;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define sint(a) scanf("%d", &a)
#define sint2(a, b) scanf("%d %d", &a, &b)
#define sll(a) scanf("%lld", &a)
#define sll2(a, b) scanf("%lld %lld", &a, &b)
#define mem(a, i) memset(a, i, sizeof(a))
#define pb push_back
#define ll long long
#define lson node << 1
#define rson (node << 1) + 1
const int maxn = 3e6 + 10;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
ll qpow(ll a, ll n) {
ll b = 1;
while (n) {
if (n & 1)
b = (b * a) % mod;
a = a * a % mod;
n >>= 1;
}
return b;
}
ll ji[maxn];
void init() {
ji[0] = 1;
for (int i = 1; i < maxn; i++)
ji[i] = ji[i - 1] * i % mod;
}
ll c(ll a, ll n) {
return ji[n] * qpow(ji[a], mod - 2) % mod * qpow(ji[n - a], mod - 2) % mod;
}
int main() {
init();
ll n;
string s;
cin >> n >> s;
ll k = s.length();
ll len = k + n;
ll ans = 0;
for (int i = 1; i <= len - k + 1; i++) {
ans = (ans + qpow(26, i - 1) * qpow(25, len - i - k + 1) % mod *
c(k - 1, len - i) % mod) %
mod;
}
cout << ans;
return 0;
}
| replace | 13 | 14 | 13 | 14 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
// headers {{{
using namespace std;
// using namespace rel_ops;
const double pi = acos(-1.0);
const double eps = 1e-11;
const int INF = 0x7FFFFFFF;
template <class T> inline bool checkmin(T &a, T b) {
return b < a ? a = b, 1 : 0;
}
template <class T> inline bool checkmax(T &a, T b) {
return b > a ? a = b, 1 : 0;
}
template <class T> inline T sqr(T x) { return x * x; }
template <class T> inline bool bit(T a, int b) { return (a >> b) & 1; }
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(long long n) { return __builtin_popcountll(n); }
typedef long long int64;
typedef unsigned long long uint64;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VII;
#define MP(A, B) make_pair(A, B)
#define PB(X) push_back(X)
#define eb(args...) emplace_back(args)
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ff first
#define ss second
#define sz(g) int(g.size())
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << '{';
string sep;
for (const auto &x : v)
os << sep << x, sep = ", ";
return os << '}';
}
#ifdef LOCAL
#define dout cerr
void out() { dout << endl; }
template <typename A, typename... B> void out(A a, B... b) {
dout << ' ' << a;
out(b...);
}
#define dbg(args...) dout << __LINE__ << ":(" << #args << ") -> ", out(args)
template <class T> void show(T a, int n) {
for (int i = 0; i < n; ++i)
cout << a[i] << ' ';
cout << endl;
}
template <class T> void show(T a, int r, int l) {
for (int i = 0; i < r; ++i)
show(a[i], l);
cout << endl;
}
constexpr bool local = true;
#else
#define dbg(...)
#define dout \
if (true) \
; \
else \
cerr
#define out(...)
#define show(...)
constexpr bool local = false;
#endif
// }}}
template <int m, typename intbase = int> struct ModInt {
intbase r;
ModInt() : r(0) {}
ModInt(int64_t rr) : r(rr) {
if (abs(r) >= m)
r %= m;
if (r < 0)
r += m;
}
ModInt(int rr) : r(rr) {
if (abs(r) >= m)
r %= m;
if (r < 0)
r += m;
}
ModInt inv() const { return this->pow(m - 2); }
template <typename I> ModInt pow(I t) const {
ModInt ret(1), base(*this);
while (t) {
if (t & 1)
ret *= base;
base *= base;
t >>= 1;
}
return ret;
}
ModInt operator*(const ModInt &t) const { return (int64_t(r) * t.r) % m; }
ModInt operator/(const ModInt &t) const { return *this * t.inv(); }
ModInt operator+=(const ModInt &t) {
r += t.r;
if (r >= m)
r -= m;
return *this;
}
ModInt operator-=(const ModInt &t) {
r -= t.r;
if (r < 0)
r += m;
return *this;
}
friend std::ostream &operator<<(std::ostream &os, ModInt x) {
return os << x.r;
}
ModInt operator+(const ModInt &t) const { return ModInt(*this) += t; }
ModInt operator-(const ModInt &t) const { return ModInt(*this) -= t; }
ModInt operator-() const { return ModInt(m - r); }
ModInt operator*=(const ModInt &t) { return *this = *this * t; }
ModInt operator/=(const ModInt &t) { return *this = *this / t; }
bool operator==(const ModInt &t) const { return r == t.r; }
bool operator!=(const ModInt &t) const { return r != t.r; }
operator int64_t() const { return r; }
};
using Int = ModInt<int(1e9 + 7)>;
Int operator""_M(unsigned long long n) { return Int(int64_t(n)); }
template <typename T = Int> struct NChooseR {
vector<T> perm;
NChooseR(int N = 1e5) : perm(N + 1) {
perm[0] = 1;
for (int i = 1; i <= N; i++)
perm[i] = perm[i - 1] * T(i);
}
T operator()(int n, int r) { return perm[n] / perm[r] / perm[n - r]; }
};
NChooseR<> ncr(1e6 + 10);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int K;
while (cin >> K) {
string s;
cin >> s;
int N = K + sz(s);
Int ans = 0;
for (int i = sz(s); i <= N; i++) {
ans +=
ncr(i - 1, sz(s) - 1) * Int(25).pow(i - sz(s)) * Int(26).pow(N - i);
}
cout << ans << endl;
}
return 0;
}
| #include <bits/stdc++.h>
// headers {{{
using namespace std;
// using namespace rel_ops;
const double pi = acos(-1.0);
const double eps = 1e-11;
const int INF = 0x7FFFFFFF;
template <class T> inline bool checkmin(T &a, T b) {
return b < a ? a = b, 1 : 0;
}
template <class T> inline bool checkmax(T &a, T b) {
return b > a ? a = b, 1 : 0;
}
template <class T> inline T sqr(T x) { return x * x; }
template <class T> inline bool bit(T a, int b) { return (a >> b) & 1; }
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(long long n) { return __builtin_popcountll(n); }
typedef long long int64;
typedef unsigned long long uint64;
typedef pair<int, int> PII;
typedef vector<int> VI;
typedef vector<PII> VII;
#define MP(A, B) make_pair(A, B)
#define PB(X) push_back(X)
#define eb(args...) emplace_back(args)
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define ff first
#define ss second
#define sz(g) int(g.size())
template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << '{';
string sep;
for (const auto &x : v)
os << sep << x, sep = ", ";
return os << '}';
}
#ifdef LOCAL
#define dout cerr
void out() { dout << endl; }
template <typename A, typename... B> void out(A a, B... b) {
dout << ' ' << a;
out(b...);
}
#define dbg(args...) dout << __LINE__ << ":(" << #args << ") -> ", out(args)
template <class T> void show(T a, int n) {
for (int i = 0; i < n; ++i)
cout << a[i] << ' ';
cout << endl;
}
template <class T> void show(T a, int r, int l) {
for (int i = 0; i < r; ++i)
show(a[i], l);
cout << endl;
}
constexpr bool local = true;
#else
#define dbg(...)
#define dout \
if (true) \
; \
else \
cerr
#define out(...)
#define show(...)
constexpr bool local = false;
#endif
// }}}
template <int m, typename intbase = int> struct ModInt {
intbase r;
ModInt() : r(0) {}
ModInt(int64_t rr) : r(rr) {
if (abs(r) >= m)
r %= m;
if (r < 0)
r += m;
}
ModInt(int rr) : r(rr) {
if (abs(r) >= m)
r %= m;
if (r < 0)
r += m;
}
ModInt inv() const { return this->pow(m - 2); }
template <typename I> ModInt pow(I t) const {
ModInt ret(1), base(*this);
while (t) {
if (t & 1)
ret *= base;
base *= base;
t >>= 1;
}
return ret;
}
ModInt operator*(const ModInt &t) const { return (int64_t(r) * t.r) % m; }
ModInt operator/(const ModInt &t) const { return *this * t.inv(); }
ModInt operator+=(const ModInt &t) {
r += t.r;
if (r >= m)
r -= m;
return *this;
}
ModInt operator-=(const ModInt &t) {
r -= t.r;
if (r < 0)
r += m;
return *this;
}
friend std::ostream &operator<<(std::ostream &os, ModInt x) {
return os << x.r;
}
ModInt operator+(const ModInt &t) const { return ModInt(*this) += t; }
ModInt operator-(const ModInt &t) const { return ModInt(*this) -= t; }
ModInt operator-() const { return ModInt(m - r); }
ModInt operator*=(const ModInt &t) { return *this = *this * t; }
ModInt operator/=(const ModInt &t) { return *this = *this / t; }
bool operator==(const ModInt &t) const { return r == t.r; }
bool operator!=(const ModInt &t) const { return r != t.r; }
operator int64_t() const { return r; }
};
using Int = ModInt<int(1e9 + 7)>;
Int operator""_M(unsigned long long n) { return Int(int64_t(n)); }
template <typename T = Int> struct NChooseR {
vector<T> perm;
NChooseR(int N = 1e5) : perm(N + 1) {
perm[0] = 1;
for (int i = 1; i <= N; i++)
perm[i] = perm[i - 1] * T(i);
}
T operator()(int n, int r) { return perm[n] / perm[r] / perm[n - r]; }
};
NChooseR<> ncr(2e6 + 10);
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int K;
while (cin >> K) {
string s;
cin >> s;
int N = K + sz(s);
Int ans = 0;
for (int i = sz(s); i <= N; i++) {
ans +=
ncr(i - 1, sz(s) - 1) * Int(25).pow(i - sz(s)) * Int(26).pow(N - i);
}
cout << ans << endl;
}
return 0;
}
| replace | 140 | 141 | 140 | 141 | 0 | |
p02632 | C++ | Runtime Error | #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
out << "{" << p.first << ", " << p.second << "}";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << '{';
for (const T &item : v)
out << item << ", ";
out << "\b\b}";
return out;
}
#endif
#define mod 1000000007 // 1e9+7(prime number)
#define INF 1000000000 // 1e9
#define LLINF 2000000000000000000LL // 2e18
#define SIZE 200010
vector<ll> factmemo, factmemoInv;
ll factmemoMod = -1;
ll factorial(int n, int M) {
if (factmemoMod == M)
return factmemo[n];
if (n <= 1)
return 1;
ll res = 1;
for (int i = 1; i <= n; i++)
res = res * i % M;
return res;
}
ll power(ll k, ll n, int M) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * k % M;
k = k * k % M;
n /= 2;
}
return res;
}
void initFactorial(int n, int M) {
factmemo.assign(n + 1, 0);
factmemoInv.assign(n + 1, 0);
factmemoMod = M;
factmemo[0] = 1;
for (int i = 1; i <= n; i++)
factmemo[i] = factmemo[i - 1] * i % M;
factmemoInv[n] = power(factmemo[n], M - 2, M);
for (int i = n; i > 0; i--)
factmemoInv[i - 1] = factmemoInv[i] * i % M;
}
// nCm nPm nHm (mod M)
/*Combination*/
ll C(int n, int m, int M) {
if (n < m)
return 0;
if (m == 0 || n == m)
return 1;
if (factmemoMod == M)
return factmemo[n] * factmemoInv[m] % M * factmemoInv[n - m] % M;
ll numer = factorial(n, M);
ll denom = factorial(m, M) * factorial(n - m, M) % M;
denom = power((int)denom, M - 2, M);
return numer * denom % M;
}
/*Permutation*/
ll P(int n, int m, int M) {
if (n < m)
return 0;
if (m == 0)
return 1;
if (factmemoMod == M)
return factmemo[n] * factmemoInv[n - m] % M;
ll numer = factorial(n, M);
ll denom = factorial(n - m, M);
denom = power((int)denom, M - 2, M);
return numer * denom % M;
}
/*Combination with Repetitions*/
ll H(int n, int m, int M) {
if (n == 0 && m == 0)
return 1;
return C(n + m - 1, m, M);
}
int main() {
int K;
char S[SIZE];
scanf("%d%s", &K, S);
int N = strlen(S);
initFactorial(K + N, mod);
ll ans = 0;
for (int i = 0; i <= K; i++) {
ll x = power(25, i, mod) * C(i + N - 1, i, mod) % mod *
power(26, K - i, mod) % mod;
ans = (ans + x) % mod;
}
cout << ans << endl;
return 0;
}
| #include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#include <cassert>
#include <functional>
typedef long long ll;
using namespace std;
#ifndef LOCAL
#define debug(x) ;
#else
#define debug(x) cerr << __LINE__ << " : " << #x << " = " << (x) << endl;
template <typename T1, typename T2>
ostream &operator<<(ostream &out, const pair<T1, T2> &p) {
out << "{" << p.first << ", " << p.second << "}";
return out;
}
template <typename T> ostream &operator<<(ostream &out, const vector<T> &v) {
out << '{';
for (const T &item : v)
out << item << ", ";
out << "\b\b}";
return out;
}
#endif
#define mod 1000000007 // 1e9+7(prime number)
#define INF 1000000000 // 1e9
#define LLINF 2000000000000000000LL // 2e18
#define SIZE 1000010
vector<ll> factmemo, factmemoInv;
ll factmemoMod = -1;
ll factorial(int n, int M) {
if (factmemoMod == M)
return factmemo[n];
if (n <= 1)
return 1;
ll res = 1;
for (int i = 1; i <= n; i++)
res = res * i % M;
return res;
}
ll power(ll k, ll n, int M) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * k % M;
k = k * k % M;
n /= 2;
}
return res;
}
void initFactorial(int n, int M) {
factmemo.assign(n + 1, 0);
factmemoInv.assign(n + 1, 0);
factmemoMod = M;
factmemo[0] = 1;
for (int i = 1; i <= n; i++)
factmemo[i] = factmemo[i - 1] * i % M;
factmemoInv[n] = power(factmemo[n], M - 2, M);
for (int i = n; i > 0; i--)
factmemoInv[i - 1] = factmemoInv[i] * i % M;
}
// nCm nPm nHm (mod M)
/*Combination*/
ll C(int n, int m, int M) {
if (n < m)
return 0;
if (m == 0 || n == m)
return 1;
if (factmemoMod == M)
return factmemo[n] * factmemoInv[m] % M * factmemoInv[n - m] % M;
ll numer = factorial(n, M);
ll denom = factorial(m, M) * factorial(n - m, M) % M;
denom = power((int)denom, M - 2, M);
return numer * denom % M;
}
/*Permutation*/
ll P(int n, int m, int M) {
if (n < m)
return 0;
if (m == 0)
return 1;
if (factmemoMod == M)
return factmemo[n] * factmemoInv[n - m] % M;
ll numer = factorial(n, M);
ll denom = factorial(n - m, M);
denom = power((int)denom, M - 2, M);
return numer * denom % M;
}
/*Combination with Repetitions*/
ll H(int n, int m, int M) {
if (n == 0 && m == 0)
return 1;
return C(n + m - 1, m, M);
}
int main() {
int K;
char S[SIZE];
scanf("%d%s", &K, S);
int N = strlen(S);
initFactorial(K + N, mod);
ll ans = 0;
for (int i = 0; i <= K; i++) {
ll x = power(25, i, mod) * C(i + N - 1, i, mod) % mod *
power(26, K - i, mod) % mod;
ans = (ans + x) % mod;
}
cout << ans << endl;
return 0;
}
| replace | 48 | 49 | 48 | 49 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
const int N = 1e6 + 5;
const int M = 1e9 + 7;
int mod(int m) {
m %= M;
return (m + M) % M;
}
int power(int x, int y) {
int res = 1;
x = mod(x);
while (y > 0) {
if (y & 1)
res = mod(res * x);
y = y >> 1;
x = mod(x * x);
}
return mod(res);
}
int f[N], invf[N];
void fact() {
f[0] = f[1] = 1;
for (int i = 2; i < N; i++)
f[i] = mod(f[i - 1] * i);
invf[N - 1] = power(f[N - 1], M - 2);
for (int i = N - 1; i > 0; i--)
invf[i - 1] = mod(invf[i] * i);
}
int nCr(int n, int r) {
if (r > n)
return 0;
int ans = f[n];
ans = mod(ans * invf[n - r]);
ans = mod(ans * invf[r]);
return ans;
}
int nPr(int n, int r) {
if (r > n)
return 0;
int ans = f[n];
ans = mod(ans * invf[n - r]);
return ans;
}
int32_t main() {
fact();
boost;
int k;
cin >> k;
string s;
cin >> s;
int m = s.size();
int n = m + k;
int ans = power(26, n);
for (int i = 0; i < m; i++)
ans = mod(ans - mod(nCr(n, i) * power(25, n - i)));
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define boost \
ios_base::sync_with_stdio(false); \
cin.tie(nullptr)
const int N = 2e6 + 5;
const int M = 1e9 + 7;
int mod(int m) {
m %= M;
return (m + M) % M;
}
int power(int x, int y) {
int res = 1;
x = mod(x);
while (y > 0) {
if (y & 1)
res = mod(res * x);
y = y >> 1;
x = mod(x * x);
}
return mod(res);
}
int f[N], invf[N];
void fact() {
f[0] = f[1] = 1;
for (int i = 2; i < N; i++)
f[i] = mod(f[i - 1] * i);
invf[N - 1] = power(f[N - 1], M - 2);
for (int i = N - 1; i > 0; i--)
invf[i - 1] = mod(invf[i] * i);
}
int nCr(int n, int r) {
if (r > n)
return 0;
int ans = f[n];
ans = mod(ans * invf[n - r]);
ans = mod(ans * invf[r]);
return ans;
}
int nPr(int n, int r) {
if (r > n)
return 0;
int ans = f[n];
ans = mod(ans * invf[n - r]);
return ans;
}
int32_t main() {
fact();
boost;
int k;
cin >> k;
string s;
cin >> s;
int m = s.size();
int n = m + k;
int ans = power(26, n);
for (int i = 0; i < m; i++)
ans = mod(ans - mod(nCr(n, i) * power(25, n - i)));
cout << ans << endl;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> Q;
/**** Const List ****/
const ll INF = 1LL << 60;
const ll mod = 1000000007;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, -1, 0, 1};
const ll NCK_MAX = 510000;
/**** General Functions ****/
ll ketawa(ll n) {
ll a = 0;
while (n != 0) {
a += n % 10;
n /= 10;
}
return a;
}
ll RepeatSquaring(ll N, ll P, ll M) { // pow->double
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RepeatSquaring(N, P / 2, M);
return (t % M) * (t % M) % M;
}
return (N * RepeatSquaring(N, P - 1, M)) % M;
}
ll RS(ll N, ll P) { // modがだるいときにつかう
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RS(N, P / 2);
return t * t;
}
return (N * RS(N, P - 1));
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
bool IsPrime(ll a) { // order root a
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0 && a != i) {
return false;
}
}
return true;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
ll q = a / b, g = extgcd(b, a - q * b, x, y);
ll z = x - q * y;
x = y;
y = z;
return g;
}
ll invmod(ll a, ll m) { // a^-1 mod m
ll x, y;
extgcd(a, m, x, y);
x %= m;
if (x < 0)
x += m;
return x;
}
ll *fac, *finv, *inv;
void nCk_init(ll mod) {
fac = new ll[NCK_MAX];
finv = new ll[NCK_MAX];
inv = new ll[NCK_MAX];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < NCK_MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll nCk(ll n, ll k, ll mod) {
if (fac == NULL)
nCk_init(mod);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll lmin(ll a, ll b) { return a > b ? b : a; };
ll lmax(ll a, ll b) { return a > b ? a : b; };
ll lsum(ll a, ll b) { return a + b; };
/*
void warshall_floyd(int n) {
for (int k = 0; k < n; k++){ // 経由する頂点
for (int i = 0; i < n; i++) { // 始点
for (int j = 0; j < n; j++) { // 終点
//d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
}
*/
// 汎用的な二分探索のテンプレ
/*
int binary_search(int key) {
ll ng = -1; //絶対falseの値、なければ最小値-1
ll ok = (int)a.size(); // 絶対trueの値 なければ最大値+1
// ok と ng のどちらが大きいかわからないことを考慮
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
if (isOK(mid, key)) ok = mid;
else ng = mid;
}
return ok;
}
*/
/**** Zip ****/
template <typename T> class Zip {
vector<T> d;
bool flag;
public:
Zip() { flag = false; }
void add(T x) {
d.push_back(x);
flag = true;
}
ll getNum(T x) { // T need to have operator < !!
if (flag) {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
return lower_bound(d.begin(), d.end(), x) - d.begin();
}
ll size() {
if (flag) {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
return (ll)d.size();
}
};
/**** Union Find ****/
class UnionFind {
vector<ll> par, rank; // par > 0: number, par < 0: -par
public:
void init(ll n) {
par.resize(n, 1);
rank.resize(n, 0);
}
ll getSize(ll x) { return par[find(x)]; }
ll find(ll x) {
if (par[x] > 0)
return x;
return -(par[x] = -find(-par[x]));
}
void merge(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = -y;
} else {
par[x] += par[y];
par[y] = -x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool isSame(ll x, ll y) { return find(x) == find(y); }
};
/**** Segment Tree ****/
class SegmentTree {
public:
vector<pair<double, double>> node; // node[0]は使用しない
ll n; // データの個数(nodeの最下層には何個並んでいるか)
pair<double, double> initial_value; // 初期値
public:
void Init(ll n_, pair<double, double> initial_value_) {
n = 1;
while (n < n_)
n *= 2;
node.resize(2 * n);
for (ll i = 0; i < 2 * n; i++) {
node[i] = initial_value_;
}
initial_value = initial_value_;
}
void Update(ll k, pair<double, double> a) {
// node[k]をaにする
// それに従って先祖も変わっていく
k += n;
node[k] = a;
while (k > 1) {
k = k / 2;
node[k] = pair<double, double>(
node[k * 2].first * node[k * 2 + 1].first,
node[k * 2].second * node[k * 2 + 1].first + node[k * 2 + 1].second);
}
}
/*void Watch(){
for(ll i=0;i<2*n;i++){
cout<<node[i]<<endl;
}
}*/
double Query() { //[a,b)
return node[1].first + node[1].second;
}
};
/**** LIS(Longest Increasing Subsequence) ****/
ll lis(ll *a, ll n, ll *dp) {
// a:数列 n:要素数 dp:dpテーブル 配列
fill(dp, dp + n, INF); // INFを代入
for (ll i = 0; i < n; i++)
*lower_bound(dp, dp + n, a[i]) = a[i];
return (ll)(lower_bound(dp, dp + n, INF) - dp);
}
/**** main function ****/
ll n, m, k, q;
ll mozisu = 0;
ll decoy = 1;
ll zen = 0;
ll hikuyatu;
ll kosu[3000000];
map<ll, ll> mp;
vector<ll> a;
vector<char> ccc;
ll ans = 1;
string s, t;
char c;
int main() {
cin >> k >> s;
nCk_init(mod);
mozisu = k + s.size();
for (ll i = 0; i < k + s.size(); i++) {
ans *= 26;
ans %= mod;
}
// cout<<ans<<endl;
for (ll i = 0; i < s.size(); i++) {
ans -= (nCk(mozisu, i, mod) * RepeatSquaring(25, mozisu - i, mod)) % mod;
while (ans < 0) {
ans += mod;
}
}
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>
using namespace std;
/**** Type Define ****/
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> Q;
/**** Const List ****/
const ll INF = 1LL << 60;
const ll mod = 1000000007;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, -1, 0, 1};
const ll NCK_MAX = 3510000;
/**** General Functions ****/
ll ketawa(ll n) {
ll a = 0;
while (n != 0) {
a += n % 10;
n /= 10;
}
return a;
}
ll RepeatSquaring(ll N, ll P, ll M) { // pow->double
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RepeatSquaring(N, P / 2, M);
return (t % M) * (t % M) % M;
}
return (N * RepeatSquaring(N, P - 1, M)) % M;
}
ll RS(ll N, ll P) { // modがだるいときにつかう
if (P == 0)
return 1;
if (P % 2 == 0) {
ll t = RS(N, P / 2);
return t * t;
}
return (N * RS(N, P - 1));
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
bool IsPrime(ll a) { // order root a
if (a == 1)
return false;
for (int i = 2; i * i <= a; i++) {
if (a % i == 0 && a != i) {
return false;
}
}
return true;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
ll q = a / b, g = extgcd(b, a - q * b, x, y);
ll z = x - q * y;
x = y;
y = z;
return g;
}
ll invmod(ll a, ll m) { // a^-1 mod m
ll x, y;
extgcd(a, m, x, y);
x %= m;
if (x < 0)
x += m;
return x;
}
ll *fac, *finv, *inv;
void nCk_init(ll mod) {
fac = new ll[NCK_MAX];
finv = new ll[NCK_MAX];
inv = new ll[NCK_MAX];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < NCK_MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll nCk(ll n, ll k, ll mod) {
if (fac == NULL)
nCk_init(mod);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll lmin(ll a, ll b) { return a > b ? b : a; };
ll lmax(ll a, ll b) { return a > b ? a : b; };
ll lsum(ll a, ll b) { return a + b; };
/*
void warshall_floyd(int n) {
for (int k = 0; k < n; k++){ // 経由する頂点
for (int i = 0; i < n; i++) { // 始点
for (int j = 0; j < n; j++) { // 終点
//d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
}
}
}
}
*/
// 汎用的な二分探索のテンプレ
/*
int binary_search(int key) {
ll ng = -1; //絶対falseの値、なければ最小値-1
ll ok = (int)a.size(); // 絶対trueの値 なければ最大値+1
// ok と ng のどちらが大きいかわからないことを考慮
while (abs(ok - ng) > 1) {
ll mid = (ok + ng) / 2;
if (isOK(mid, key)) ok = mid;
else ng = mid;
}
return ok;
}
*/
/**** Zip ****/
template <typename T> class Zip {
vector<T> d;
bool flag;
public:
Zip() { flag = false; }
void add(T x) {
d.push_back(x);
flag = true;
}
ll getNum(T x) { // T need to have operator < !!
if (flag) {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
return lower_bound(d.begin(), d.end(), x) - d.begin();
}
ll size() {
if (flag) {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
return (ll)d.size();
}
};
/**** Union Find ****/
class UnionFind {
vector<ll> par, rank; // par > 0: number, par < 0: -par
public:
void init(ll n) {
par.resize(n, 1);
rank.resize(n, 0);
}
ll getSize(ll x) { return par[find(x)]; }
ll find(ll x) {
if (par[x] > 0)
return x;
return -(par[x] = -find(-par[x]));
}
void merge(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = -y;
} else {
par[x] += par[y];
par[y] = -x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool isSame(ll x, ll y) { return find(x) == find(y); }
};
/**** Segment Tree ****/
class SegmentTree {
public:
vector<pair<double, double>> node; // node[0]は使用しない
ll n; // データの個数(nodeの最下層には何個並んでいるか)
pair<double, double> initial_value; // 初期値
public:
void Init(ll n_, pair<double, double> initial_value_) {
n = 1;
while (n < n_)
n *= 2;
node.resize(2 * n);
for (ll i = 0; i < 2 * n; i++) {
node[i] = initial_value_;
}
initial_value = initial_value_;
}
void Update(ll k, pair<double, double> a) {
// node[k]をaにする
// それに従って先祖も変わっていく
k += n;
node[k] = a;
while (k > 1) {
k = k / 2;
node[k] = pair<double, double>(
node[k * 2].first * node[k * 2 + 1].first,
node[k * 2].second * node[k * 2 + 1].first + node[k * 2 + 1].second);
}
}
/*void Watch(){
for(ll i=0;i<2*n;i++){
cout<<node[i]<<endl;
}
}*/
double Query() { //[a,b)
return node[1].first + node[1].second;
}
};
/**** LIS(Longest Increasing Subsequence) ****/
ll lis(ll *a, ll n, ll *dp) {
// a:数列 n:要素数 dp:dpテーブル 配列
fill(dp, dp + n, INF); // INFを代入
for (ll i = 0; i < n; i++)
*lower_bound(dp, dp + n, a[i]) = a[i];
return (ll)(lower_bound(dp, dp + n, INF) - dp);
}
/**** main function ****/
ll n, m, k, q;
ll mozisu = 0;
ll decoy = 1;
ll zen = 0;
ll hikuyatu;
ll kosu[3000000];
map<ll, ll> mp;
vector<ll> a;
vector<char> ccc;
ll ans = 1;
string s, t;
char c;
int main() {
cin >> k >> s;
nCk_init(mod);
mozisu = k + s.size();
for (ll i = 0; i < k + s.size(); i++) {
ans *= 26;
ans %= mod;
}
// cout<<ans<<endl;
for (ll i = 0; i < s.size(); i++) {
ans -= (nCk(mozisu, i, mod) * RepeatSquaring(25, mozisu - i, mod)) % mod;
while (ans < 0) {
ans += mod;
}
}
cout << ans << endl;
}
| replace | 29 | 30 | 29 | 30 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define pb push_back
#define S second
#define F first
#define die() return 0;
#define md 1000000007
#define fmd 998244353
#define M 1000011
#define N 18
ll exp(ll a, ll b) {
if (b < 0)
return 0;
ll r = 1;
while (b) {
if (b & 1)
r = r * a % md, r %= md;
a = a * a % md;
b /= 2;
}
return r;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll F[M], IV[M];
ll chose(ll n, ll k) {
if (k > n)
return 0;
ll r = F[n];
r = r * IV[k];
r %= md;
r = r * IV[n - k] % md;
return r % md;
}
int solve() {
ll n, i, j, k, m, x, y, z;
string s;
cin >> k >> s;
n = s.size();
ll ans = exp(26, k + n);
ans %= md;
ll p = 0;
for (i = 0; i < n; ++i) {
ll left = chose(n + k, i);
left = left * exp(25, k + n - i) % md;
p = p + left % md;
p %= md;
}
ans = (ans - p + md) % md;
cout << ans << "\n";
// trace(f(2,2));
die();
}
void prec() {
F[0] = IV[0] = 1;
for (int i = 1; i < M; ++i) {
F[i] = F[i - 1] * i % md, F[i] %= md;
IV[i] = IV[i - 1] * exp(i, md - 2) % md, IV[i] %= md;
}
}
int main() {
#ifndef ONLINE_JUDGE
double _tBeg = clock();
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
t = 1;
;
prec();
// cin>>t;
while (t--) {
solve();
}
#ifndef ONLINE_JUDGE
double _tEnd = clock();
// printf("\ntotal time %.6f\n",(_tEnd-_tBeg)/CLOCKS_PER_SEC);
#endif
die();
} | #include <bits/stdc++.h>
using namespace std;
#define TRACE
#ifdef TRACE
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char *name, Arg1 &&arg1) {
cerr << name << " : " << arg1 << std::endl;
}
template <typename Arg1, typename... Args>
void __f(const char *names, Arg1 &&arg1, Args &&...args) {
const char *comma = strchr(names + 1, ',');
cerr.write(names, comma - names) << " : " << arg1 << " | ";
__f(comma + 1, args...);
}
#else
#define trace(...)
#endif
#define ll long long
#define ld long double
#define all(v) v.begin(), v.end()
#define pb push_back
#define S second
#define F first
#define die() return 0;
#define md 1000000007
#define fmd 998244353
#define M 2000011
#define N 18
ll exp(ll a, ll b) {
if (b < 0)
return 0;
ll r = 1;
while (b) {
if (b & 1)
r = r * a % md, r %= md;
a = a * a % md;
b /= 2;
}
return r;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll F[M], IV[M];
ll chose(ll n, ll k) {
if (k > n)
return 0;
ll r = F[n];
r = r * IV[k];
r %= md;
r = r * IV[n - k] % md;
return r % md;
}
int solve() {
ll n, i, j, k, m, x, y, z;
string s;
cin >> k >> s;
n = s.size();
ll ans = exp(26, k + n);
ans %= md;
ll p = 0;
for (i = 0; i < n; ++i) {
ll left = chose(n + k, i);
left = left * exp(25, k + n - i) % md;
p = p + left % md;
p %= md;
}
ans = (ans - p + md) % md;
cout << ans << "\n";
// trace(f(2,2));
die();
}
void prec() {
F[0] = IV[0] = 1;
for (int i = 1; i < M; ++i) {
F[i] = F[i - 1] * i % md, F[i] %= md;
IV[i] = IV[i - 1] * exp(i, md - 2) % md, IV[i] %= md;
}
}
int main() {
#ifndef ONLINE_JUDGE
double _tBeg = clock();
#endif
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t;
t = 1;
;
prec();
// cin>>t;
while (t--) {
solve();
}
#ifndef ONLINE_JUDGE
double _tEnd = clock();
// printf("\ntotal time %.6f\n",(_tEnd-_tBeg)/CLOCKS_PER_SEC);
#endif
die();
} | replace | 30 | 31 | 30 | 31 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 510000;
const int MOD = 1000000007;
//
int fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int modpow(int a, int n, int mod) {
int res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
signed main() {
COMinit();
int k;
string s;
cin >> k >> s;
int ans = 0;
for (int i = 0; i <= k; i++) {
ans = (ans + modpow(25, i, MOD) * COM(i + s.size() - 1, s.size() - 1) %
MOD * modpow(26, k - i, MOD) % MOD) %
MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
const int MAX = 2000007;
const int MOD = 1000000007;
//
int fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int modpow(int a, int n, int mod) {
int res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
signed main() {
COMinit();
int k;
string s;
cin >> k >> s;
int ans = 0;
for (int i = 0; i <= k; i++) {
ans = (ans + modpow(25, i, MOD) * COM(i + s.size() - 1, s.size() - 1) %
MOD * modpow(26, k - i, MOD) % MOD) %
MOD;
}
cout << ans << endl;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define pii pair<ll, ll>
#define debug(a) cout << a << '\n'
#define maxn 1000009 /// I wanna be the wind
#define MOD 1000000007
#define F first
#define S second
#define rep(i, a, b) for (ll i = a; i < (b); ++i)
#define per(i, b, a) for (ll i = b - 1; i >= a; i--)
#define trav(a, x) for (auto &a : x)
#define allin(a, x) for (auto a : x)
#define all(x) begin(x), end(x)
#define sz(x) (ll)(x).size()
using namespace std;
const ll INF = 1e14 + 9;
ll mult(ll a, ll b) { return a * b % MOD; }
ll fastpow(ll a, ll b) {
ll calc = 1;
for (; b >= 1LL; b /= 2LL) {
if ((b & 1LL))
calc = mult(calc, a);
a = mult(a, a);
}
return calc;
}
ll soma(ll a, ll b) {
if (a + b > MOD)
return a + b - MOD;
else
return a + b;
}
ll subt(ll a, ll b) {
if (a - b < 0)
return a - b + MOD;
else
return a - b;
}
ll fact[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
fact[0] = 1;
rep(i, 1, maxn) fact[i] = mult(i, fact[i - 1]);
ll k;
string s;
cin >> k >> s;
ll n = sz(s) + k;
ll tir = 0;
rep(i, 0, sz(s)) {
tir = soma(
tir, mult(fastpow(25, n - i),
mult(fact[n], fastpow(mult(fact[i], fact[n - i]), MOD - 2))));
}
cout << subt(fastpow(26, n), tir) << "\n";
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define pii pair<ll, ll>
#define debug(a) cout << a << '\n'
#define maxn 2000009 /// I wanna be the wind
#define MOD 1000000007
#define F first
#define S second
#define rep(i, a, b) for (ll i = a; i < (b); ++i)
#define per(i, b, a) for (ll i = b - 1; i >= a; i--)
#define trav(a, x) for (auto &a : x)
#define allin(a, x) for (auto a : x)
#define all(x) begin(x), end(x)
#define sz(x) (ll)(x).size()
using namespace std;
const ll INF = 1e14 + 9;
ll mult(ll a, ll b) { return a * b % MOD; }
ll fastpow(ll a, ll b) {
ll calc = 1;
for (; b >= 1LL; b /= 2LL) {
if ((b & 1LL))
calc = mult(calc, a);
a = mult(a, a);
}
return calc;
}
ll soma(ll a, ll b) {
if (a + b > MOD)
return a + b - MOD;
else
return a + b;
}
ll subt(ll a, ll b) {
if (a - b < 0)
return a - b + MOD;
else
return a - b;
}
ll fact[maxn];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
fact[0] = 1;
rep(i, 1, maxn) fact[i] = mult(i, fact[i - 1]);
ll k;
string s;
cin >> k >> s;
ll n = sz(s) + k;
ll tir = 0;
rep(i, 0, sz(s)) {
tir = soma(
tir, mult(fastpow(25, n - i),
mult(fact[n], fastpow(mult(fact[i], fact[n - i]), MOD - 2))));
}
cout << subt(fastpow(26, n), tir) << "\n";
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
using ll = long long;
#define int ll
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
template <class T = ll> using V = vector<T>;
template <class T = ll> using VV = V<V<T>>;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define FOR(i, l, r) for (ll i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (ll i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define SORT(name) sort(name.begin(), name.end())
#define RSORT(name) \
SORT(name); \
reverse(all(name));
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\n'; }
inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\n'; }
template <class T> inline void print(T x) { cout << x << '\n'; }
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
const ll LLINF = (1LL << 60);
const int INF = (1LL << 30);
const double DINF = std::numeric_limits<double>::infinity();
#pragma endregion
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
#define DBG(fmt, ...)
#endif
template <typename T> class NumberOfCase {
public:
// 初期化 O(n log m) m は素数
// n : 求めたい組み合わせの最大値
NumberOfCase(ll n) : m_Size(n) {
m_Fact.resize(m_Size + 1);
m_FInv.resize(m_Size + 1);
m_Inv.resize(m_Size + 1);
// 0! ～ m_Size! までの階乗を保管する配列の作成 (mod m_Mod をとってある)
m_Fact[0] = 1;
for (int i = 1; i <= m_Size; ++i) {
m_Fact[i] = m_Fact[i - 1] * i;
}
// m_Size! の逆元 1/m_Size! を二分累乗法で求める
// フェルマーの小定理より a^-1 = a^(p-2) mod p -> (m_Size!)^-1 =
// (m_Size!)^(p-2) mod p
m_FInv[m_Size] = T(1) / m_Fact[m_Size];
// 以下 1 / (N-1)! = N / N! であることを利用
for (int i = m_Size - 1; i >= 0; --i) {
m_FInv[i] = m_FInv[i + 1] * (i + 1);
}
// 逆元の作成（割り算のとき利用）
m_Inv[0] = 1;
for (int i = 1; i <= m_Size; ++i) {
m_Inv[i] = m_FInv[i] * m_Fact[i - 1];
}
}
// 階乗 n! の取得 O(1)
T Factorial(ll n) const { return m_Fact[n]; }
// n! の逆元の取得 O(1)
T FInverse(ll n) const { return m_FInv[n]; }
// 逆元の取得 O(1) or O(log MOD)
T Inverse(ll n) const { return m_Inv[n]; }
// 順列 nPr の取得 O(1)
T Permutation(ll n, ll r) const {
if (r < 0 || n < r) {
return 0;
}
return m_Fact[n] * m_FInv[n - r];
}
// 組み合わせ nCr の取得 O(1)
T Combination(ll n, ll r) const {
if (r < 0 || n < r) {
return 0;
}
return m_Fact[n] * m_FInv[r] * m_FInv[n - r];
}
// 重複組み合わせ nHr の取得 O(1)
T Homogen(ll n, ll r) const {
if (n < 0 || r < 0) {
return 0;
}
return (r == 0) ? 1 : Combination(r + n - 1, r);
}
private:
const ll m_Size; // 導出する範囲 (10^5 くらいまでにして欲しい)
vector<T> m_Fact; // 階乗
vector<T> m_FInv; // 階乗の逆元
vector<T> m_Inv; // 逆元
};
const int MOD = 1000000007;
// 自動で余りを取ってくれる整数型
// 割り算や負の数による初期化も可能
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<MOD>;
const int MAX_N = 1000010;
int K;
string S;
signed main() {
IOS;
NumberOfCase<modint> noc(MAX_N);
cin >> K >> S;
modint ans(0);
REP(i, K + 1) {
modint n(26), m(25);
ans += n.pow(i) * m.pow(K - i) *
noc.Combination(S.length() + K - i - 1, S.length() - 1);
}
print(ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#pragma region Macros
using ll = long long;
#define int ll
using pii = pair<int, int>;
using tiii = tuple<int, int, int>;
template <class T = ll> using V = vector<T>;
template <class T = ll> using VV = V<V<T>>;
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
#define FOR(i, l, r) for (ll i = (l); i < (r); ++i)
#define REP(i, n) FOR(i, 0, n)
#define REPS(i, n) FOR(i, 1, n + 1)
#define RFOR(i, l, r) for (ll i = (l); i >= (r); --i)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RREPS(i, n) RFOR(i, n, 1)
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define SORT(name) sort(name.begin(), name.end())
#define RSORT(name) \
SORT(name); \
reverse(all(name));
#define ZERO(p) memset(p, 0, sizeof(p))
#define MINUS(p) memset(p, -1, sizeof(p))
inline void Yes(bool b = true) { cout << (b ? "Yes" : "No") << '\n'; }
inline void YES(bool b = true) { cout << (b ? "YES" : "NO") << '\n'; }
template <class T> inline void print(T x) { cout << x << '\n'; }
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
const ll LLINF = (1LL << 60);
const int INF = (1LL << 30);
const double DINF = std::numeric_limits<double>::infinity();
#pragma endregion
#if 1
#define DBG(fmt, ...) printf(fmt, ##__VA_ARGS__)
#else
#define DBG(fmt, ...)
#endif
template <typename T> class NumberOfCase {
public:
// 初期化 O(n log m) m は素数
// n : 求めたい組み合わせの最大値
NumberOfCase(ll n) : m_Size(n) {
m_Fact.resize(m_Size + 1);
m_FInv.resize(m_Size + 1);
m_Inv.resize(m_Size + 1);
// 0! ～ m_Size! までの階乗を保管する配列の作成 (mod m_Mod をとってある)
m_Fact[0] = 1;
for (int i = 1; i <= m_Size; ++i) {
m_Fact[i] = m_Fact[i - 1] * i;
}
// m_Size! の逆元 1/m_Size! を二分累乗法で求める
// フェルマーの小定理より a^-1 = a^(p-2) mod p -> (m_Size!)^-1 =
// (m_Size!)^(p-2) mod p
m_FInv[m_Size] = T(1) / m_Fact[m_Size];
// 以下 1 / (N-1)! = N / N! であることを利用
for (int i = m_Size - 1; i >= 0; --i) {
m_FInv[i] = m_FInv[i + 1] * (i + 1);
}
// 逆元の作成（割り算のとき利用）
m_Inv[0] = 1;
for (int i = 1; i <= m_Size; ++i) {
m_Inv[i] = m_FInv[i] * m_Fact[i - 1];
}
}
// 階乗 n! の取得 O(1)
T Factorial(ll n) const { return m_Fact[n]; }
// n! の逆元の取得 O(1)
T FInverse(ll n) const { return m_FInv[n]; }
// 逆元の取得 O(1) or O(log MOD)
T Inverse(ll n) const { return m_Inv[n]; }
// 順列 nPr の取得 O(1)
T Permutation(ll n, ll r) const {
if (r < 0 || n < r) {
return 0;
}
return m_Fact[n] * m_FInv[n - r];
}
// 組み合わせ nCr の取得 O(1)
T Combination(ll n, ll r) const {
if (r < 0 || n < r) {
return 0;
}
return m_Fact[n] * m_FInv[r] * m_FInv[n - r];
}
// 重複組み合わせ nHr の取得 O(1)
T Homogen(ll n, ll r) const {
if (n < 0 || r < 0) {
return 0;
}
return (r == 0) ? 1 : Combination(r + n - 1, r);
}
private:
const ll m_Size; // 導出する範囲 (10^5 くらいまでにして欲しい)
vector<T> m_Fact; // 階乗
vector<T> m_FInv; // 階乗の逆元
vector<T> m_Inv; // 逆元
};
const int MOD = 1000000007;
// 自動で余りを取ってくれる整数型
// 割り算や負の数による初期化も可能
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
using modint = ModInt<MOD>;
const int MAX_N = 2000010;
int K;
string S;
signed main() {
IOS;
NumberOfCase<modint> noc(MAX_N);
cin >> K >> S;
modint ans(0);
REP(i, K + 1) {
modint n(26), m(25);
ans += n.pow(i) * m.pow(K - i) *
noc.Combination(S.length() + K - i - 1, S.length() - 1);
}
print(ans);
return 0;
}
| replace | 179 | 180 | 179 | 180 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for (int(i) = (n); (i) < (m); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define ldou long double
#define fi first
#define se second
#define setpre(x) std::cout << fixed << setprecision(x)
#define ii(x) \
int x; \
cin >> (x)
#define ii2(x, y) \
int x, y; \
cin >> (x) >> (y)
#define ii3(x, y, z) \
int x, y, z; \
cin >> (x) >> (y) >> (z)
#define out(x) cout << (x) << endl
#define outs(x) cout << (x) << " "
#define yn(x) cout << ((x) ? ("Yes") : ("No")) << endl
#define YN(x) cout << ((x) ? ("YES") : ("NO")) << endl
#define bit_c(x) __builtin_popcountll(x)
inline void logger() { std::cout << " [LOGGER] " << endl; }
template <typename A, typename... B> void logger(const A &a, const B &...b) {
cout << a << " , ";
logger(b...);
}
typedef pair<lint, lint> P;
const lint MOD = 1000000007;
const lint MOD9 = 998244353;
const lint INF = MOD * MOD;
const int MAX = 200005;
/* ...o(^-^)o... */
const lint mod = MOD;
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 &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
constexpr mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
constexpr mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
constexpr mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
constexpr mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
constexpr mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
constexpr mint pow(long long x) const {
if (!x)
return 1;
mint a = pow(x >> 1);
a *= a;
if (x & 1)
a *= *this;
return a;
}
constexpr mint inv() const { return pow(mod - 2); }
constexpr mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
constexpr mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend istream &operator>>(istream &is, mint &m) {
long long x;
is >> x;
m = x;
return is;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
mint fac[MAX], facinv[MAX], inv[MAX];
void minit() {
fac[0] = fac[1] = 1;
facinv[0] = facinv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i;
inv[i] = -mint(mod / i) * inv[mod % i];
facinv[i] = facinv[i - 1] * inv[i];
}
}
mint mcomb(lint a, lint b) {
if (a < b)
return 0;
if (a < 0 || b < 0)
return 0;
return fac[a] * facinv[b] * facinv[a - b];
}
mint mperm(lint a, lint b) {
if (a < b)
return 0;
if (a < 0 || b < 0)
return 0;
return fac[a] * facinv[a - b];
}
int main() {
lint k;
cin >> k;
string s;
cin >> s;
lint n = s.size();
minit();
mint res = 0;
rep(l, k + 1) {
res += mint(26).pow(l) * mint(25).pow(k - l) * mcomb(n + k - l - 1, n - 1);
}
out(res);
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define repp(i, n, m) for (int(i) = (n); (i) < (m); (i)++)
#define repn(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define repr(i, n) for (int(i) = (n - 1); (i) >= 0; (i)--)
#define all(x) (x).begin(), (x).end()
#define lint long long
#define ulint unsigned long long
#define ldou long double
#define fi first
#define se second
#define setpre(x) std::cout << fixed << setprecision(x)
#define ii(x) \
int x; \
cin >> (x)
#define ii2(x, y) \
int x, y; \
cin >> (x) >> (y)
#define ii3(x, y, z) \
int x, y, z; \
cin >> (x) >> (y) >> (z)
#define out(x) cout << (x) << endl
#define outs(x) cout << (x) << " "
#define yn(x) cout << ((x) ? ("Yes") : ("No")) << endl
#define YN(x) cout << ((x) ? ("YES") : ("NO")) << endl
#define bit_c(x) __builtin_popcountll(x)
inline void logger() { std::cout << " [LOGGER] " << endl; }
template <typename A, typename... B> void logger(const A &a, const B &...b) {
cout << a << " , ";
logger(b...);
}
typedef pair<lint, lint> P;
const lint MOD = 1000000007;
const lint MOD9 = 998244353;
const lint INF = MOD * MOD;
const int MAX = 2000005;
/* ...o(^-^)o... */
const lint mod = MOD;
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 &a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
constexpr mint &operator-=(const mint &a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
constexpr mint &operator*=(const mint &a) {
(x *= a.x) %= mod;
return *this;
}
constexpr mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
constexpr mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
constexpr mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
constexpr mint pow(long long x) const {
if (!x)
return 1;
mint a = pow(x >> 1);
a *= a;
if (x & 1)
a *= *this;
return a;
}
constexpr mint inv() const { return pow(mod - 2); }
constexpr mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
constexpr mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend istream &operator>>(istream &is, mint &m) {
long long x;
is >> x;
m = x;
return is;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
mint fac[MAX], facinv[MAX], inv[MAX];
void minit() {
fac[0] = fac[1] = 1;
facinv[0] = facinv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i;
inv[i] = -mint(mod / i) * inv[mod % i];
facinv[i] = facinv[i - 1] * inv[i];
}
}
mint mcomb(lint a, lint b) {
if (a < b)
return 0;
if (a < 0 || b < 0)
return 0;
return fac[a] * facinv[b] * facinv[a - b];
}
mint mperm(lint a, lint b) {
if (a < b)
return 0;
if (a < 0 || b < 0)
return 0;
return fac[a] * facinv[a - b];
}
int main() {
lint k;
cin >> k;
string s;
cin >> s;
lint n = s.size();
minit();
mint res = 0;
rep(l, k + 1) {
res += mint(26).pow(l) * mint(25).pow(k - l) * mcomb(n + k - l - 1, n - 1);
}
out(res);
}
| replace | 39 | 40 | 39 | 40 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define _rep(n, a, b) for (int n = (a); n <= (b); ++n)
#define _rev(n, a, b) for (int n = (a); n >= (b); --n)
#define _for(n, a, b) for (int n = (a); n < (b); ++n)
#define _rof(n, a, b) for (int n = (a); n > (b); --n)
#define oo 0x3f3f3f3f3f3f
#define ll long long
#define db double
#define eps 1e-3
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pdd pair<db, db>
#define endl "\n"
const int mod = 1e9 + 7;
const int maxn = 1e6 + 10;
vector<ll> f(maxn), invf(maxn);
ll qpow(ll a, ll b) {
ll ret = 1;
for (; b; a = a * a % mod, b >>= 1) {
if (b & 1) {
ret = ret * a % mod;
}
}
return ret;
}
void prework() {
f[0] = 1;
_rep(i, 1, maxn - 1) { f[i] = f[i - 1] * i % mod; }
invf[maxn - 1] = qpow(f[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; i--) {
invf[i] = invf[i + 1] * (i + 1) % mod;
}
}
ll C(ll n, ll m) {
if (n > m || m < 0)
return 0;
if (n == 0 || m == n)
return 1;
ll res = (f[m] * invf[m - n] % mod * invf[n]) % mod;
return res;
}
signed main() {
int k;
string s;
cin >> k >> s;
prework();
ll len = s.size();
ll res = 0;
_rep(i, 0, k) {
res = (res + qpow(26, i) * qpow(25, k - i) % mod *
C(len - 1, k + len - 1 - i) % mod) %
mod;
}
cout << res << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define _rep(n, a, b) for (int n = (a); n <= (b); ++n)
#define _rev(n, a, b) for (int n = (a); n >= (b); --n)
#define _for(n, a, b) for (int n = (a); n < (b); ++n)
#define _rof(n, a, b) for (int n = (a); n > (b); --n)
#define oo 0x3f3f3f3f3f3f
#define ll long long
#define db double
#define eps 1e-3
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << endl
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
#define pdd pair<db, db>
#define endl "\n"
const int mod = 1e9 + 7;
const int maxn = 2e6 + 10;
vector<ll> f(maxn), invf(maxn);
ll qpow(ll a, ll b) {
ll ret = 1;
for (; b; a = a * a % mod, b >>= 1) {
if (b & 1) {
ret = ret * a % mod;
}
}
return ret;
}
void prework() {
f[0] = 1;
_rep(i, 1, maxn - 1) { f[i] = f[i - 1] * i % mod; }
invf[maxn - 1] = qpow(f[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; i--) {
invf[i] = invf[i + 1] * (i + 1) % mod;
}
}
ll C(ll n, ll m) {
if (n > m || m < 0)
return 0;
if (n == 0 || m == n)
return 1;
ll res = (f[m] * invf[m - n] % mod * invf[n]) % mod;
return res;
}
signed main() {
int k;
string s;
cin >> k >> s;
prework();
ll len = s.size();
ll res = 0;
_rep(i, 0, k) {
res = (res + qpow(26, i) * qpow(25, k - i) % mod *
C(len - 1, k + len - 1 - i) % mod) %
mod;
}
cout << res << endl;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ar array
const ll mod = 1e9 + 7;
ll pwr(ll a, ll b) {
ll ret = 1;
while (b > 0) {
if (b % 2 == 1)
ret = ret * a % mod;
a = a * a % mod;
b /= 2;
}
return ret;
}
const int N = 1e6 + 5;
ll f[N], inv[N];
ll C(int n, int k) {
if (k > n || k < 0)
return 0;
return f[n] * (inv[k] * inv[n - k] % mod) % mod;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int k, n;
string s;
cin >> k >> s;
n = (int)s.size() + k;
f[0] = 1;
inv[0] = 1;
for (int i = 1; i < N; i++) {
f[i] = (ll)f[i - 1] * i % mod;
inv[i] = pwr(f[i], mod - 2);
}
ll ans = 0;
for (int i = 0; i < (int)s.size(); i++) {
ans = (ans + pwr(25, n - i) * C(n, i) % mod) % mod;
}
ans = (pwr(26, n) - ans + mod) % mod;
cout << ans << '\n';
} | #include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ar array
const ll mod = 1e9 + 7;
ll pwr(ll a, ll b) {
ll ret = 1;
while (b > 0) {
if (b % 2 == 1)
ret = ret * a % mod;
a = a * a % mod;
b /= 2;
}
return ret;
}
const int N = 2e6 + 5;
ll f[N], inv[N];
ll C(int n, int k) {
if (k > n || k < 0)
return 0;
return f[n] * (inv[k] * inv[n - k] % mod) % mod;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int k, n;
string s;
cin >> k >> s;
n = (int)s.size() + k;
f[0] = 1;
inv[0] = 1;
for (int i = 1; i < N; i++) {
f[i] = (ll)f[i - 1] * i % mod;
inv[i] = pwr(f[i], mod - 2);
}
ll ans = 0;
for (int i = 0; i < (int)s.size(); i++) {
ans = (ans + pwr(25, n - i) * C(n, i) % mod) % mod;
}
ans = (pwr(26, n) - ans + mod) % mod;
cout << ans << '\n';
} | replace | 21 | 22 | 21 | 22 | 0 | |
p02632 | C++ | Runtime Error | /*بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم*/
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;
// const ll mod = 998244353;
inline void normal(ll &a) {
a %= mod;
(a < 0) && (a += mod);
}
inline ll modMul(ll a, ll b) {
a %= mod, b %= mod;
normal(a), normal(b);
return (a * b) % mod;
}
inline ll modAdd(ll a, ll b) {
a %= mod, b %= mod;
normal(a), normal(b);
return (a + b) % mod;
}
inline ll modSub(ll a, ll b) {
a %= mod, b %= mod;
normal(a), normal(b);
a -= b;
normal(a);
return a;
}
inline ll modPow(ll b, ll p) {
ll r = 1;
while (p) {
if (p & 1)
r = modMul(r, b);
b = modMul(b, b);
p >>= 1;
}
return r;
}
inline ll modInverse(ll a) { return modPow(a, mod - 2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
#define si(x) scanf("%d", &x)
#define sii(x, y) scanf("%d %d", &x, &y)
#define siii(x, y, z) scanf("%d %d %d", &x, &y, &z)
#define sl(x) scanf("%lld", &x)
#define sll(x, y) scanf("%lld %lld", &x, &y)
#define slll(x, y, z) scanf("%lld %lld %lld", &x, &y, &z)
#define ss(ch) scanf("%s", ch)
#define pi(x) printf("%d", x)
#define pii(x, y) printf("%d %d", x, y)
#define piii(x, y, z) printf("%d %d %d", x, y, z)
#define pl(x) printf("%lld", x)
#define pll(x, y) printf("%lld %lld", x, y)
#define plll(x, y, z) printf("%lld %lld %lld", x, y, z)
#define ps(ch) printf("%s", ch)
#define F(i, a, b) for (int i = a; i <= b; i++)
#define R(i, b, a) for (int i = b; i >= a; i--)
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1};
int kx8[] = {1, 1, 2, 2, -1, -1, -2, -2};
int ky8[] = {2, -2, 1, -1, 2, -2, 1, -1};
/* for Random Number generate
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
*/
///**
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "}";
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
#define dbg(args...) \
do { \
cerr << #args << " : "; \
faltu(args); \
} while (0)
clock_t tStart = clock();
#define timeStamp \
dbg("Execution Time: ", (double)(clock() - tStart) / CLOCKS_PER_SEC)
void faltu() { cerr << endl; }
template <typename T> void faltu(T a[], int n) {
for (int i = 0; i < n; ++i)
cerr << a[i] << ' ';
cerr << endl;
}
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
cerr << arg << ' ';
faltu(rest...);
}
// Program showing a policy-based data structure.
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
// GNU link : https://goo.gl/WVDL6g
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// find_by_order(k) – ফাংশনটি kth ordered element এর একটা পয়েন্টার রিটার্ন করে।
// অর্থাৎ তুমি চাইলেই kth ইন্ডেক্সে কি আছে, সেটা জেনে ফেলতে পারছো! order_of_key(x) –
// ফাংশনটি x এলিমেন্টটা কোন পজিশনে আছে সেটা বলে দেয়।
//*//**___________________________________________________**/
const int N = 200006;
ll fact[N], inv[N], P[N];
void calc() {
fact[0] = 1;
inv[0] = modInverse(fact[0]);
for (int i = 1; i < N; i++) {
fact[i] = modMul(fact[i - 1], i);
inv[i] = modInverse(fact[i]);
}
P[0] = 1;
for (int i = 1; i < N; i++) {
P[i] = modMul(P[i - 1], 25);
}
}
ll nCr(int n, int r) {
if (n < r)
return 0;
return modMul(fact[n], modMul(inv[n - r], inv[r]));
}
int main() {
FASTIO
/*
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
//*/
calc();
int k;
string s;
cin >> k >> s;
int M = s.size();
ll n = M + k;
ll ans = modPow(26, n);
for (int i = 0; i < M; i++) {
ll val = modMul(P[n - i], nCr(n, i));
ans = modSub(ans, val);
}
cout << ans << "\n";
return 0;
} | /*بِسْمِ اللَّهِ الرَّحْمَنِ الرَّحِيم*/
// #pragma GCC optimize("O3,unroll-loops")
// #pragma GCC target("avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
#define FASTIO ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
typedef long long ll;
const double PI = acos(-1.0);
const ll mod = 1e9 + 7;
// const ll mod = 998244353;
inline void normal(ll &a) {
a %= mod;
(a < 0) && (a += mod);
}
inline ll modMul(ll a, ll b) {
a %= mod, b %= mod;
normal(a), normal(b);
return (a * b) % mod;
}
inline ll modAdd(ll a, ll b) {
a %= mod, b %= mod;
normal(a), normal(b);
return (a + b) % mod;
}
inline ll modSub(ll a, ll b) {
a %= mod, b %= mod;
normal(a), normal(b);
a -= b;
normal(a);
return a;
}
inline ll modPow(ll b, ll p) {
ll r = 1;
while (p) {
if (p & 1)
r = modMul(r, b);
b = modMul(b, b);
p >>= 1;
}
return r;
}
inline ll modInverse(ll a) { return modPow(a, mod - 2); }
inline ll modDiv(ll a, ll b) { return modMul(a, modInverse(b)); }
#define si(x) scanf("%d", &x)
#define sii(x, y) scanf("%d %d", &x, &y)
#define siii(x, y, z) scanf("%d %d %d", &x, &y, &z)
#define sl(x) scanf("%lld", &x)
#define sll(x, y) scanf("%lld %lld", &x, &y)
#define slll(x, y, z) scanf("%lld %lld %lld", &x, &y, &z)
#define ss(ch) scanf("%s", ch)
#define pi(x) printf("%d", x)
#define pii(x, y) printf("%d %d", x, y)
#define piii(x, y, z) printf("%d %d %d", x, y, z)
#define pl(x) printf("%lld", x)
#define pll(x, y) printf("%lld %lld", x, y)
#define plll(x, y, z) printf("%lld %lld %lld", x, y, z)
#define ps(ch) printf("%s", ch)
#define F(i, a, b) for (int i = a; i <= b; i++)
#define R(i, b, a) for (int i = b; i >= a; i--)
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int dx8[] = {0, 0, 1, 1, 1, -1, -1, -1};
int dy8[] = {1, -1, -1, 0, 1, -1, 0, 1};
int kx8[] = {1, 1, 2, 2, -1, -1, -2, -2};
int ky8[] = {2, -2, 1, -1, 2, -2, 1, -1};
/* for Random Number generate
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
*/
///**
template <typename F, typename S>
ostream &operator<<(ostream &os, const pair<F, S> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "{";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "}";
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << ", ";
os << *it;
}
return os << "]";
}
template <typename F, typename S>
ostream &operator<<(ostream &os, const map<F, S> &v) {
os << "[";
for (auto it = v.begin(); it != v.end(); ++it) {
if (it != v.begin())
os << ", ";
os << it->first << " = " << it->second;
}
return os << "]";
}
#define dbg(args...) \
do { \
cerr << #args << " : "; \
faltu(args); \
} while (0)
clock_t tStart = clock();
#define timeStamp \
dbg("Execution Time: ", (double)(clock() - tStart) / CLOCKS_PER_SEC)
void faltu() { cerr << endl; }
template <typename T> void faltu(T a[], int n) {
for (int i = 0; i < n; ++i)
cerr << a[i] << ' ';
cerr << endl;
}
template <typename T, typename... hello>
void faltu(T arg, const hello &...rest) {
cerr << arg << ' ';
faltu(rest...);
}
// Program showing a policy-based data structure.
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace __gnu_pbds;
// GNU link : https://goo.gl/WVDL6g
typedef tree<int, null_type, less_equal<int>, rb_tree_tag,
tree_order_statistics_node_update>
new_data_set;
// find_by_order(k) – ফাংশনটি kth ordered element এর একটা পয়েন্টার রিটার্ন করে।
// অর্থাৎ তুমি চাইলেই kth ইন্ডেক্সে কি আছে, সেটা জেনে ফেলতে পারছো! order_of_key(x) –
// ফাংশনটি x এলিমেন্টটা কোন পজিশনে আছে সেটা বলে দেয়।
//*//**___________________________________________________**/
const int N = 2000006;
ll fact[N], inv[N], P[N];
void calc() {
fact[0] = 1;
inv[0] = modInverse(fact[0]);
for (int i = 1; i < N; i++) {
fact[i] = modMul(fact[i - 1], i);
inv[i] = modInverse(fact[i]);
}
P[0] = 1;
for (int i = 1; i < N; i++) {
P[i] = modMul(P[i - 1], 25);
}
}
ll nCr(int n, int r) {
if (n < r)
return 0;
return modMul(fact[n], modMul(inv[n - r], inv[r]));
}
int main() {
FASTIO
/*
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
freopen("error.txt", "w", stderr);
#endif
//*/
calc();
int k;
string s;
cin >> k >> s;
int M = s.size();
ll n = M + k;
ll ans = modPow(26, n);
for (int i = 0; i < M; i++) {
ll val = modMul(P[n - i], nCr(n, i));
ans = modSub(ans, val);
}
cout << ans << "\n";
return 0;
} | replace | 140 | 141 | 140 | 141 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) ((int)a.size())
#define mp make_pair
#define fi first
#define se second
const int maxn = 1e6 + 5;
const int maxv = 1e9;
const int mod = 1e9 + 7;
int T, tc;
int n;
int a[maxn];
long long fact[maxn], inv[maxn];
string s;
long long power_mod(long long a, long long b) {
long long res = 1;
while (b) {
if (b % 2)
res = res * a % mod;
a = a * a % mod;
b /= 2ll;
}
return res;
}
long long C(int n, int k) { return fact[n] * inv[k] % mod * inv[n - k] % mod; }
int main() {
// freopen("inp.txt", "r", stdin);
cin >> n;
fact[0] = inv[0] = 1;
for (int i = 1; i < maxn; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = power_mod(fact[i], mod - 2);
}
cin >> s;
long long len = (long long)s.size();
long long ans = 0;
for (int i = 0; i <= n; i++) {
int rem = n - i;
// cout << power_mod(25, rem) << ' ' << C(rem + len - 1, len - 1) << ' '
//<< power_mod(26, i) << endl;
(ans += power_mod(25, rem) * C(rem + len - 1, len - 1) % mod *
power_mod(26, i) % mod) %= mod;
}
cout << ans;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define sz(a) ((int)a.size())
#define mp make_pair
#define fi first
#define se second
const int maxn = 2e6 + 5;
const int maxv = 1e9;
const int mod = 1e9 + 7;
int T, tc;
int n;
int a[maxn];
long long fact[maxn], inv[maxn];
string s;
long long power_mod(long long a, long long b) {
long long res = 1;
while (b) {
if (b % 2)
res = res * a % mod;
a = a * a % mod;
b /= 2ll;
}
return res;
}
long long C(int n, int k) { return fact[n] * inv[k] % mod * inv[n - k] % mod; }
int main() {
// freopen("inp.txt", "r", stdin);
cin >> n;
fact[0] = inv[0] = 1;
for (int i = 1; i < maxn; i++) {
fact[i] = fact[i - 1] * i % mod;
inv[i] = power_mod(fact[i], mod - 2);
}
cin >> s;
long long len = (long long)s.size();
long long ans = 0;
for (int i = 0; i <= n; i++) {
int rem = n - i;
// cout << power_mod(25, rem) << ' ' << C(rem + len - 1, len - 1) << ' '
//<< power_mod(26, i) << endl;
(ans += power_mod(25, rem) * C(rem + len - 1, len - 1) % mod *
power_mod(26, i) % mod) %= mod;
}
cout << ans;
return 0;
} | replace | 10 | 11 | 10 | 11 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
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;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
long long MOD = 1000000007;
// long long MOD = 998244353;
const long long INF = 1LL << 60;
const long double PI = acos(-1.0);
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;
}
bool operator==(const mint a) const { return x == a.x; }
bool operator!=(const mint a) const { return x != a.x; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N / i != i)
res.push_back(N / i);
}
}
sort(res.begin(), res.end());
return res;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
// struct edge { ll to, cost; };
typedef long double ld;
using Graph = vector<vector<int>>;
struct UnionFind {
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
UnionFind() {}
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
void init(ll sz_) {
par.resize(sz_);
siz.resize(sz_, 1);
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(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];
}
};
struct edge {
int to, cost;
};
/*
・MODあってる？？？
*/
mint tmp[1000010];
int cnt[26];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(20);
combination com(1000010);
int k;
string s;
cin >> k >> s;
int n = s.size();
mint ans = 0;
for (int i = n; i <= k + n; i++) {
ans += com(n + k, i) * mint(25).pow(n + k - i);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <limits.h>
#include <list>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
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;
}
using namespace std;
#define int long long
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define P pair<ll, ll>
#define sz(x) (ll) x.size()
#define ALL(x) (x).begin(), (x).end()
#define ALLR(x) (x).rbegin(), (x).rend()
#define VE vector<ll>
#define COUT(x) cout << (x) << endl
#define MA map<ll, ll>
#define SE set<ll>
#define PQ priority_queue<ll>
#define PQR priority_queue<ll, VE, greater<ll>>
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
long long MOD = 1000000007;
// long long MOD = 998244353;
const long long INF = 1LL << 60;
const long double PI = acos(-1.0);
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;
}
bool operator==(const mint a) const { return x == a.x; }
bool operator!=(const mint a) const { return x != a.x; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
template <class t> t gcd(t a, t b) { return b != 0 ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b;
}
bool prime(ll n) {
for (ll i = 2; i <= sqrt(n); i++) {
if (n % i == 0)
return false;
}
return n != 1;
}
map<ll, ll> prime_factor(ll n) {
map<ll, ll> ret;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
vector<pair<char, int>> RunLength(string s) {
if (s.size() == 0)
return {};
vector<pair<char, int>> res(1, pair<char, int>(s[0], 0));
for (char p : s) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
// Digit Count
int GetDigit(int num) { return log10(num) + 1; }
// bit calculation[how many "1"] (= __builtin_popcount())
int bit_count(int n) {
int cnt = 0;
while (n > 0) {
if (n % 2 == 1)
cnt++;
n /= 2;
}
return cnt;
}
vector<long long> enum_divisors(long long N) {
vector<long long> res;
for (long long i = 1; i * i <= N; ++i) {
if (N % i == 0) {
res.push_back(i);
if (N / i != i)
res.push_back(N / i);
}
}
sort(res.begin(), res.end());
return res;
}
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
// struct edge { ll to, cost; };
typedef long double ld;
using Graph = vector<vector<int>>;
struct UnionFind {
vector<ll> par; // 各元の親を表す配列
vector<ll> siz; // 素集合のサイズを表す配列(1 で初期化)
UnionFind() {}
// Constructor
UnionFind(ll sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
void init(ll sz_) {
par.resize(sz_);
siz.resize(sz_, 1);
for (ll i = 0; i < sz_; ++i)
par[i] = i; // 初期では親は自分自身
}
// Member Function
// Find
ll root(ll x) { // 根の検索
while (par[x] != x) {
x = par[x] = par[par[x]]; // x の親の親を x の親とする
}
return x;
}
// Union(Unite, Merge)
bool merge(ll x, ll y) {
x = root(x);
y = root(y);
if (x == y)
return false;
// merge technique（データ構造をマージするテク．小を大にくっつける）
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(ll x, ll y) { // 連結判定
return root(x) == root(y);
}
ll size(ll x) { // 素集合のサイズ
return siz[root(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];
}
};
struct edge {
int to, cost;
};
/*
・MODあってる？？？
*/
mint tmp[1000010];
int cnt[26];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
// cout << fixed << setprecision(20);
combination com(2000010);
int k;
string s;
cin >> k >> s;
int n = s.size();
mint ans = 0;
for (int i = n; i <= k + n; i++) {
ans += com(n + k, i) * mint(25).pow(n + k - i);
}
cout << ans << endl;
return 0;
}
| replace | 321 | 322 | 321 | 322 | 0 | |
p02632 | C++ | Runtime Error | // #pragma GCC optimize("unroll-loops", "omit-frame-pointer", "inline")
// #pragma GCC option("arch=native", "tune=native", "no-zero-upper")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("tree-vectorize","openmp","predictive-commoning")
// #pragma GCC option("D_GLIBCXX_PARALLEL","openmp")
// #pragma GCC optimize("O3")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
// #define int long long
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000 // 2e9
#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define dmp(x) cerr << #x << ": " << x << endl;
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T> vector<T> vect(int len, T elem) {
return vector<T>(len, elem);
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.fi << ',' << p.sec;
return os;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.fi >> p.sec;
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 < vec.size())
os << ' ';
}
return os;
}
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++)
is >> vec[i];
return is;
}
void fastio() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
}
#define endl "\n"
template <int MOD> // if inv is needed, this shold be prime.
struct ModInt {
ll val;
ModInt() : val(0ll) {}
ModInt(const ll &v) : val(((v % MOD) + MOD) % MOD) {}
bool operator==(const ModInt &x) const { return val == x.val; }
bool operator!=(const ModInt &x) const { return !(*this == x); }
bool operator<(const ModInt &x) const { return val < x.val; }
bool operator>(const ModInt &x) const { return val > x.val; }
bool operator>=(const ModInt &x) const { return !(*this < x); }
bool operator<=(const ModInt &x) const { return !(*this > x); }
ModInt operator-() const { return ModInt(MOD - val); }
ModInt inv() const { return this->pow(MOD - 2); }
ModInt &operator+=(const ModInt &x) {
if ((val += x.val) >= MOD)
val -= MOD;
return *this;
}
ModInt &operator-=(const ModInt &x) {
if ((val += MOD - x.val) >= MOD)
val -= MOD;
return *this;
}
ModInt &operator*=(const ModInt &x) {
(val *= x.val) %= MOD;
return *this;
}
ModInt &operator/=(const ModInt &x) { return *this *= x.inv(); };
ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }
friend istream &operator>>(istream &i, ModInt &x) {
ll v;
i >> v;
x = v;
return i;
}
friend ostream &operator<<(ostream &o, const ModInt &x) {
o << x.val;
return o;
}
ModInt pow(ll x) const {
auto res = ModInt(1ll);
auto b = *this;
while (x) {
if (x & 1)
res *= b;
x >>= 1;
b *= b;
}
return res;
}
};
template <int MOD> ModInt<MOD> pow(ModInt<MOD> a, ll x) {
ModInt<MOD> res = ModInt<MOD>(1ll);
while (x) {
if (x & 1)
res *= a;
x >>= 1;
a *= a;
}
return res;
}
constexpr int MOD = 1e9 + 7;
// constexpr int MOD = 998244353;
using mint = ModInt<MOD>;
vector<mint> inv, fac, facinv;
// notice: 0C0 = 1
mint nCr(int n, int r) {
assert(!(n < r));
assert(!(n < 0 || r < 0));
return fac[n] * facinv[r] * facinv[n - r];
}
void init(int SIZE) {
fac.resize(SIZE + 1);
inv.resize(SIZE + 1);
facinv.resize(SIZE + 1);
fac[0] = inv[1] = facinv[0] = mint(1ll);
for (int i = 1; i <= SIZE; i++)
fac[i] = fac[i - 1] * mint(i);
for (int i = 2; i <= SIZE; i++)
inv[i] = mint(0ll) - mint(MOD / i) * inv[MOD % i];
for (int i = 1; i <= SIZE; i++)
facinv[i] = facinv[i - 1] * inv[i];
return;
}
void solve() {
int K;
string s;
cin >> K;
cin >> s;
int N = s.size();
mint ans;
for (int i = N; i <= K + N; i++)
ans += nCr(K + N, i) * mint(25).pow(K + N - i);
cout << ans << endl;
return;
}
signed main() {
fastio();
init(1000100);
solve();
// int t; cin >> t; while(t--)solve();
// int t; cin >> t;
// for(int i=1;i<=t;i++){
// cout << "Case #" << i << ": ";
// solve();
// }
return 0;
}
| // #pragma GCC optimize("unroll-loops", "omit-frame-pointer", "inline")
// #pragma GCC option("arch=native", "tune=native", "no-zero-upper")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("tree-vectorize","openmp","predictive-commoning")
// #pragma GCC option("D_GLIBCXX_PARALLEL","openmp")
// #pragma GCC optimize("O3")
// #pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> P;
typedef vector<int> vi;
typedef vector<ll> vll;
// #define int long long
#define pb push_back
#define mp make_pair
#define eps 1e-9
#define INF 2000000000 // 2e9
#define LLINF 2000000000000000000ll // 2e18 (llmax:9e18)
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define sq(x) ((x) * (x))
#define dmp(x) cerr << #x << ": " << x << endl;
template <class T> void chmin(T &a, const T &b) {
if (a > b)
a = b;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
template <class T> vector<T> vect(int len, T elem) {
return vector<T>(len, elem);
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
os << p.fi << ',' << p.sec;
return os;
}
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.fi >> p.sec;
return is;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
for (int i = 0; i < vec.size(); i++) {
os << vec[i];
if (i + 1 < vec.size())
os << ' ';
}
return os;
}
template <class T> istream &operator>>(istream &is, vector<T> &vec) {
for (int i = 0; i < vec.size(); i++)
is >> vec[i];
return is;
}
void fastio() {
cin.tie(0);
ios::sync_with_stdio(0);
cout << fixed << setprecision(20);
}
#define endl "\n"
template <int MOD> // if inv is needed, this shold be prime.
struct ModInt {
ll val;
ModInt() : val(0ll) {}
ModInt(const ll &v) : val(((v % MOD) + MOD) % MOD) {}
bool operator==(const ModInt &x) const { return val == x.val; }
bool operator!=(const ModInt &x) const { return !(*this == x); }
bool operator<(const ModInt &x) const { return val < x.val; }
bool operator>(const ModInt &x) const { return val > x.val; }
bool operator>=(const ModInt &x) const { return !(*this < x); }
bool operator<=(const ModInt &x) const { return !(*this > x); }
ModInt operator-() const { return ModInt(MOD - val); }
ModInt inv() const { return this->pow(MOD - 2); }
ModInt &operator+=(const ModInt &x) {
if ((val += x.val) >= MOD)
val -= MOD;
return *this;
}
ModInt &operator-=(const ModInt &x) {
if ((val += MOD - x.val) >= MOD)
val -= MOD;
return *this;
}
ModInt &operator*=(const ModInt &x) {
(val *= x.val) %= MOD;
return *this;
}
ModInt &operator/=(const ModInt &x) { return *this *= x.inv(); };
ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }
ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }
ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }
ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }
friend istream &operator>>(istream &i, ModInt &x) {
ll v;
i >> v;
x = v;
return i;
}
friend ostream &operator<<(ostream &o, const ModInt &x) {
o << x.val;
return o;
}
ModInt pow(ll x) const {
auto res = ModInt(1ll);
auto b = *this;
while (x) {
if (x & 1)
res *= b;
x >>= 1;
b *= b;
}
return res;
}
};
template <int MOD> ModInt<MOD> pow(ModInt<MOD> a, ll x) {
ModInt<MOD> res = ModInt<MOD>(1ll);
while (x) {
if (x & 1)
res *= a;
x >>= 1;
a *= a;
}
return res;
}
constexpr int MOD = 1e9 + 7;
// constexpr int MOD = 998244353;
using mint = ModInt<MOD>;
vector<mint> inv, fac, facinv;
// notice: 0C0 = 1
mint nCr(int n, int r) {
assert(!(n < r));
assert(!(n < 0 || r < 0));
return fac[n] * facinv[r] * facinv[n - r];
}
void init(int SIZE) {
fac.resize(SIZE + 1);
inv.resize(SIZE + 1);
facinv.resize(SIZE + 1);
fac[0] = inv[1] = facinv[0] = mint(1ll);
for (int i = 1; i <= SIZE; i++)
fac[i] = fac[i - 1] * mint(i);
for (int i = 2; i <= SIZE; i++)
inv[i] = mint(0ll) - mint(MOD / i) * inv[MOD % i];
for (int i = 1; i <= SIZE; i++)
facinv[i] = facinv[i - 1] * inv[i];
return;
}
void solve() {
int K;
string s;
cin >> K;
cin >> s;
int N = s.size();
mint ans;
for (int i = N; i <= K + N; i++)
ans += nCr(K + N, i) * mint(25).pow(K + N - i);
cout << ans << endl;
return;
}
signed main() {
fastio();
init(2000100);
solve();
// int t; cin >> t; while(t--)solve();
// int t; cin >> t;
// for(int i=1;i<=t;i++){
// cout << "Case #" << i << ": ";
// solve();
// }
return 0;
}
| replace | 183 | 184 | 183 | 184 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
const int N = 1000005;
const int M = 1000000007;
long long power(long long a, long long b) {
if (b == 0)
return 1;
long long r = power(a, b / 2);
r = (r * r) % M;
if (b & 1)
return (r * a) % M;
return r;
}
long long f[N], inv[N];
int main() {
int k;
string s;
cin >> k >> s;
int n = s.size();
f[0] = 1;
for (int i = 1; i < N; i++)
f[i] = (f[i - 1] * i) % M;
inv[N - 1] = power(f[N - 1], M - 2);
for (int i = N - 2; i >= 0; i--)
inv[i] = (inv[i + 1] * (i + 1)) % M;
auto C = [&](int x, int y) -> int {
if (x < y || y < 0)
return 0;
if (x == y || y == 0)
return 1;
long long r = f[x];
r = (r * inv[y]) % M;
r = (r * inv[x - y]) % M;
return r;
};
auto get = [&](int i) -> int {
long long r = power(26, i);
r = (r * power(25, k - i)) % M;
r = (r * C(k - i + n - 1, n - 1)) % M;
return r;
};
long long sum = 0;
for (int i = 0; i <= k; i++) {
sum = (sum + get(i)) % M;
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define endl '\n'
const int N = 3000005;
const int M = 1000000007;
long long power(long long a, long long b) {
if (b == 0)
return 1;
long long r = power(a, b / 2);
r = (r * r) % M;
if (b & 1)
return (r * a) % M;
return r;
}
long long f[N], inv[N];
int main() {
int k;
string s;
cin >> k >> s;
int n = s.size();
f[0] = 1;
for (int i = 1; i < N; i++)
f[i] = (f[i - 1] * i) % M;
inv[N - 1] = power(f[N - 1], M - 2);
for (int i = N - 2; i >= 0; i--)
inv[i] = (inv[i + 1] * (i + 1)) % M;
auto C = [&](int x, int y) -> int {
if (x < y || y < 0)
return 0;
if (x == y || y == 0)
return 1;
long long r = f[x];
r = (r * inv[y]) % M;
r = (r * inv[x - y]) % M;
return r;
};
auto get = [&](int i) -> int {
long long r = power(26, i);
r = (r * power(25, k - i)) % M;
r = (r * C(k - i + n - 1, n - 1)) % M;
return r;
};
long long sum = 0;
for (int i = 0; i <= k; i++) {
sum = (sum + get(i)) % M;
}
cout << sum << endl;
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> Q;
typedef complex<double> C;
#define cx real()
#define cy imag()
const ll INF = 1LL << 60;
const double DINF = 1e30;
const ll mod = 1000000007;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, -1, 0, 1};
const C I = C(0, 1);
const double EPS = 1e-10;
const ll NCK_MAX = 510000;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
ll q = a / b, g = extgcd(b, a - q * b, x, y);
ll z = x - q * y;
x = y;
y = z;
return g;
}
ll invmod(ll a, ll m) { // a^-1 mod m
ll x, y;
extgcd(a, m, x, y);
x %= m;
if (x < 0)
x += m;
return x;
}
ll *fac, *finv, *inv;
void nCk_init(ll mod) {
fac = new ll[NCK_MAX];
finv = new ll[NCK_MAX];
inv = new ll[NCK_MAX];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < NCK_MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll nCk(ll n, ll k, ll mod) {
if (fac == NULL)
nCk_init(mod);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
template <typename T> class Zip {
vector<T> d;
bool flag;
void init() {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
public:
Zip() { flag = false; }
void add(T x) {
d.push_back(x);
flag = true;
}
ll getNum(T x) {
if (flag)
init();
return lower_bound(d.begin(), d.end(), x) - d.begin();
}
ll size() {
if (flag)
init();
return (ll)d.size();
}
};
class UnionFind {
vector<ll> par, rank; // par > 0: number, par < 0: -par
public:
UnionFind(ll n) : par(n, 1), rank(n, 0) {}
ll getSize(ll x) { return par[find(x)]; }
ll find(ll x) {
if (par[x] > 0)
return x;
return -(par[x] = -find(-par[x]));
}
void merge(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = -y;
} else {
par[x] += par[y];
par[y] = -x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool isSame(ll x, ll y) { return find(x) == find(y); }
};
template <typename T> class SegmentTree {
ll n;
vector<T> node;
function<T(T, T)> fun, fun2;
bool customChange;
T outValue, initValue;
public:
void init(ll num, function<T(T, T)> resultFunction, T init, T out,
function<T(T, T)> changeFunction = NULL) {
// changeFunction: (input, beforevalue) => newvalue
fun = resultFunction;
fun2 = changeFunction;
customChange = changeFunction != NULL;
n = 1;
while (n < num)
n *= 2;
node.resize(2 * n - 1);
fill(node.begin(), node.end(), init);
outValue = out;
initValue = init;
}
void valueChange(ll num, T value) {
num += n - 1;
if (customChange)
node[num] = fun2(value, node[num]);
else
node[num] = value;
while (num > 0)
num = (num - 1) / 2,
node[num] = fun(node[num * 2 + 1], node[num * 2 + 2]);
}
T rangeQuery(ll a, ll b, ll l = 0, ll r = -1, ll k = 0) { // [a, b)
if (r == -1)
r = n;
if (a <= l && r <= b)
return node[k];
if (b <= l || r <= a)
return outValue;
ll mid = (l + r) / 2;
return fun(rangeQuery(a, b, l, mid, 2 * k + 1),
rangeQuery(a, b, mid, r, 2 * k + 2));
}
};
template <typename T> class Graph {
struct edge {
ll to;
T cost;
};
struct edge_data {
ll from, to;
T cost;
};
ll v;
vector<vector<edge>> e, re;
vector<edge_data> ed;
vector<bool> used;
vector<ll> vs, cmp;
bool isDirected, isMinasEdge;
public:
Graph(ll _v, bool _isDirected = true, ll range_add = 0) {
// range_add 0:no / 1:in / 2:out / 3:in+out
//_v++;
v = _v, isDirected = _isDirected;
isMinasEdge = false;
e.resize(v), re.resize(v);
}
void add_edge(ll s, ll t, T cost = 1) {
e[s].push_back((edge){t, cost});
if (!isDirected)
e[t].push_back((edge){s, cost});
else
re[t].push_back((edge){s, cost});
ed.push_back((edge_data){s, t, cost});
if (cost < 0)
isMinasEdge = true;
}
vector<T> dijkstra(ll s) {
vector<T> d(v, INF);
d[s] = 0;
auto edge_cmp = [](const edge &a, const edge &b) {
return a.cost > b.cost;
};
priority_queue<edge, vector<edge>, decltype(edge_cmp)> pq(edge_cmp);
pq.push((edge){s, 0});
while (!pq.empty()) {
edge temp = pq.top();
pq.pop();
if (d[temp.to] < temp.cost)
continue;
for (const edge &next : e[temp.to]) {
T cost = temp.cost + next.cost;
if (d[next.to] > cost) {
d[next.to] = cost;
pq.push((edge){next.to, cost});
}
}
}
return d;
}
vector<T> bellmanford(ll s) {
vector<T> d(v, INF);
d[s] = 0;
for (ll i = 0; i < v; i++) {
for (const edge_data &temp : ed) {
if (d[temp.from] != INF && d[temp.to] > d[temp.from] + temp.cost)
d[temp.to] = d[temp.from] + temp.cost;
if (!isDirected && d[temp.to] != INF &&
d[temp.from] > d[temp.to] + temp.cost)
d[temp.from] = d[temp.to] + temp.cost;
}
}
for (ll i = 0; i < v; i++) {
for (const edge_data &temp : ed) {
if (d[temp.from] != INF && d[temp.to] > d[temp.from] + temp.cost)
d[temp.to] = -INF;
if (!isDirected && d[temp.to] != INF &&
d[temp.from] > d[temp.to] + temp.cost)
d[temp.from] = -INF;
}
}
return d;
}
vector<T> shortest_path(ll s) {
if (isMinasEdge)
return bellmanford(s);
else
return dijkstra(s);
}
T kruskal() {
// if (isDirected)
UnionFind uf(v);
auto edge_data_cmp = [](const edge_data &a, const edge_data &b) {
return a.cost < b.cost;
};
sort(ed.begin(), ed.end(), edge_data_cmp);
T ans = 0;
for (const edge_data &temp : ed) {
if (uf.isSame(temp.from, temp.to))
continue;
uf.merge(temp.from, temp.to);
ans += temp.cost;
}
return ans;
}
void scc_dfs(ll s) {
used[s] = true;
for (const edge &i : e[s])
if (!used[i.to])
scc_dfs(i.to);
vs.push_back(s);
}
void scc_rdfs(ll s, ll k) {
used[s] = true;
cmp[s] = k;
for (const edge &i : re[s])
if (!used[i.to])
scc_rdfs(i.to, k);
}
vector<ll> scc() {
used.resize(v);
fill(used.begin(), used.end(), false);
cmp.resize(v);
vs.clear();
for (ll i = 0; i < v; i++)
if (!used[i])
scc_dfs(i);
used.resize(v);
fill(used.begin(), used.end(), false);
ll k = 0;
for (ll i = vs.size() - 1; i >= 0; i--)
if (!used[vs[i]])
scc_rdfs(vs[i], k++);
return cmp;
}
};
class RollingHash {
vector<__int128> hash;
vector<__int128> pw;
int base;
const __int128 hashmod = (1ull << 61) - 1;
public:
RollingHash(string s, int base = 10007)
: base(base), hash(s.length() + 1, 0), pw(s.length() + 1, 1) {
for (int i = 0; i < s.length(); i++) {
hash[i + 1] = (hash[i] * base + s[i]) % hashmod;
pw[i + 1] = pw[i] * base % hashmod;
}
}
ll get(ll a, ll b) { // [a, b)
__int128 tmp = hashmod + hash[b] - hash[a] * pw[b - a] % hashmod;
if (tmp >= hashmod)
tmp -= hashmod;
return (ll)tmp;
}
};
ll n, k, ans;
string s;
ll pw(ll i, ll j) {
if (j == 0)
return 1;
if (j % 2 == 1)
return i * pw(i, j - 1) % mod;
ll tmp = pw(i, j / 2);
return tmp * tmp % mod;
}
int main() {
cin >> k >> s;
n = s.length();
for (ll i = 0; i <= k; i++) {
ans +=
pw(25, k - i) * pw(26, i) % mod * nCk(n - 1 + k - i, n - 1, mod) % mod;
if (ans >= mod)
ans -= mod;
}
cout << ans << endl;
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
typedef pair<ll, P> Q;
typedef complex<double> C;
#define cx real()
#define cy imag()
const ll INF = 1LL << 60;
const double DINF = 1e30;
const ll mod = 1000000007;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, -1, 0, 1};
const C I = C(0, 1);
const double EPS = 1e-10;
const ll NCK_MAX = 4100000;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
ll q = a / b, g = extgcd(b, a - q * b, x, y);
ll z = x - q * y;
x = y;
y = z;
return g;
}
ll invmod(ll a, ll m) { // a^-1 mod m
ll x, y;
extgcd(a, m, x, y);
x %= m;
if (x < 0)
x += m;
return x;
}
ll *fac, *finv, *inv;
void nCk_init(ll mod) {
fac = new ll[NCK_MAX];
finv = new ll[NCK_MAX];
inv = new ll[NCK_MAX];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < NCK_MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll nCk(ll n, ll k, ll mod) {
if (fac == NULL)
nCk_init(mod);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
template <typename T> class Zip {
vector<T> d;
bool flag;
void init() {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
public:
Zip() { flag = false; }
void add(T x) {
d.push_back(x);
flag = true;
}
ll getNum(T x) {
if (flag)
init();
return lower_bound(d.begin(), d.end(), x) - d.begin();
}
ll size() {
if (flag)
init();
return (ll)d.size();
}
};
class UnionFind {
vector<ll> par, rank; // par > 0: number, par < 0: -par
public:
UnionFind(ll n) : par(n, 1), rank(n, 0) {}
ll getSize(ll x) { return par[find(x)]; }
ll find(ll x) {
if (par[x] > 0)
return x;
return -(par[x] = -find(-par[x]));
}
void merge(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = -y;
} else {
par[x] += par[y];
par[y] = -x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool isSame(ll x, ll y) { return find(x) == find(y); }
};
template <typename T> class SegmentTree {
ll n;
vector<T> node;
function<T(T, T)> fun, fun2;
bool customChange;
T outValue, initValue;
public:
void init(ll num, function<T(T, T)> resultFunction, T init, T out,
function<T(T, T)> changeFunction = NULL) {
// changeFunction: (input, beforevalue) => newvalue
fun = resultFunction;
fun2 = changeFunction;
customChange = changeFunction != NULL;
n = 1;
while (n < num)
n *= 2;
node.resize(2 * n - 1);
fill(node.begin(), node.end(), init);
outValue = out;
initValue = init;
}
void valueChange(ll num, T value) {
num += n - 1;
if (customChange)
node[num] = fun2(value, node[num]);
else
node[num] = value;
while (num > 0)
num = (num - 1) / 2,
node[num] = fun(node[num * 2 + 1], node[num * 2 + 2]);
}
T rangeQuery(ll a, ll b, ll l = 0, ll r = -1, ll k = 0) { // [a, b)
if (r == -1)
r = n;
if (a <= l && r <= b)
return node[k];
if (b <= l || r <= a)
return outValue;
ll mid = (l + r) / 2;
return fun(rangeQuery(a, b, l, mid, 2 * k + 1),
rangeQuery(a, b, mid, r, 2 * k + 2));
}
};
template <typename T> class Graph {
struct edge {
ll to;
T cost;
};
struct edge_data {
ll from, to;
T cost;
};
ll v;
vector<vector<edge>> e, re;
vector<edge_data> ed;
vector<bool> used;
vector<ll> vs, cmp;
bool isDirected, isMinasEdge;
public:
Graph(ll _v, bool _isDirected = true, ll range_add = 0) {
// range_add 0:no / 1:in / 2:out / 3:in+out
//_v++;
v = _v, isDirected = _isDirected;
isMinasEdge = false;
e.resize(v), re.resize(v);
}
void add_edge(ll s, ll t, T cost = 1) {
e[s].push_back((edge){t, cost});
if (!isDirected)
e[t].push_back((edge){s, cost});
else
re[t].push_back((edge){s, cost});
ed.push_back((edge_data){s, t, cost});
if (cost < 0)
isMinasEdge = true;
}
vector<T> dijkstra(ll s) {
vector<T> d(v, INF);
d[s] = 0;
auto edge_cmp = [](const edge &a, const edge &b) {
return a.cost > b.cost;
};
priority_queue<edge, vector<edge>, decltype(edge_cmp)> pq(edge_cmp);
pq.push((edge){s, 0});
while (!pq.empty()) {
edge temp = pq.top();
pq.pop();
if (d[temp.to] < temp.cost)
continue;
for (const edge &next : e[temp.to]) {
T cost = temp.cost + next.cost;
if (d[next.to] > cost) {
d[next.to] = cost;
pq.push((edge){next.to, cost});
}
}
}
return d;
}
vector<T> bellmanford(ll s) {
vector<T> d(v, INF);
d[s] = 0;
for (ll i = 0; i < v; i++) {
for (const edge_data &temp : ed) {
if (d[temp.from] != INF && d[temp.to] > d[temp.from] + temp.cost)
d[temp.to] = d[temp.from] + temp.cost;
if (!isDirected && d[temp.to] != INF &&
d[temp.from] > d[temp.to] + temp.cost)
d[temp.from] = d[temp.to] + temp.cost;
}
}
for (ll i = 0; i < v; i++) {
for (const edge_data &temp : ed) {
if (d[temp.from] != INF && d[temp.to] > d[temp.from] + temp.cost)
d[temp.to] = -INF;
if (!isDirected && d[temp.to] != INF &&
d[temp.from] > d[temp.to] + temp.cost)
d[temp.from] = -INF;
}
}
return d;
}
vector<T> shortest_path(ll s) {
if (isMinasEdge)
return bellmanford(s);
else
return dijkstra(s);
}
T kruskal() {
// if (isDirected)
UnionFind uf(v);
auto edge_data_cmp = [](const edge_data &a, const edge_data &b) {
return a.cost < b.cost;
};
sort(ed.begin(), ed.end(), edge_data_cmp);
T ans = 0;
for (const edge_data &temp : ed) {
if (uf.isSame(temp.from, temp.to))
continue;
uf.merge(temp.from, temp.to);
ans += temp.cost;
}
return ans;
}
void scc_dfs(ll s) {
used[s] = true;
for (const edge &i : e[s])
if (!used[i.to])
scc_dfs(i.to);
vs.push_back(s);
}
void scc_rdfs(ll s, ll k) {
used[s] = true;
cmp[s] = k;
for (const edge &i : re[s])
if (!used[i.to])
scc_rdfs(i.to, k);
}
vector<ll> scc() {
used.resize(v);
fill(used.begin(), used.end(), false);
cmp.resize(v);
vs.clear();
for (ll i = 0; i < v; i++)
if (!used[i])
scc_dfs(i);
used.resize(v);
fill(used.begin(), used.end(), false);
ll k = 0;
for (ll i = vs.size() - 1; i >= 0; i--)
if (!used[vs[i]])
scc_rdfs(vs[i], k++);
return cmp;
}
};
class RollingHash {
vector<__int128> hash;
vector<__int128> pw;
int base;
const __int128 hashmod = (1ull << 61) - 1;
public:
RollingHash(string s, int base = 10007)
: base(base), hash(s.length() + 1, 0), pw(s.length() + 1, 1) {
for (int i = 0; i < s.length(); i++) {
hash[i + 1] = (hash[i] * base + s[i]) % hashmod;
pw[i + 1] = pw[i] * base % hashmod;
}
}
ll get(ll a, ll b) { // [a, b)
__int128 tmp = hashmod + hash[b] - hash[a] * pw[b - a] % hashmod;
if (tmp >= hashmod)
tmp -= hashmod;
return (ll)tmp;
}
};
ll n, k, ans;
string s;
ll pw(ll i, ll j) {
if (j == 0)
return 1;
if (j % 2 == 1)
return i * pw(i, j - 1) % mod;
ll tmp = pw(i, j / 2);
return tmp * tmp % mod;
}
int main() {
cin >> k >> s;
n = s.length();
for (ll i = 0; i <= k; i++) {
ans +=
pw(25, k - i) * pw(26, i) % mod * nCk(n - 1 + k - i, n - 1, mod) % mod;
if (ans >= mod)
ans -= mod;
}
cout << ans << endl;
}
| replace | 31 | 32 | 31 | 32 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
inline void fastio() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
}
#define whats(x) cerr << #x << " = " << (x) << "\n";
using LL = long long;
using LD = long double;
const LL INF = LLONG_MAX;
const LL MOD = static_cast<LL>(1e9 + 7);
const LL N = 1e6 + 1;
LL fac[N] = {0};
LL modinv_fac[N] = {0};
LL binpow(LL x, LL p, LL mod) {
LL res = 1;
x %= mod;
while (p) {
if (p & 1) {
res *= x;
res %= mod;
}
x *= x;
x %= mod;
p >>= 1;
}
return res;
}
LL binom(LL n, LL r, LL mod) {
if (r < 0 || r > n) {
return 0;
} else {
LL term = fac[n];
// LL den = binpow(fac[n-r], mod-2, mod)*binpow(fac[r], mod-2, mod) % mod;
LL den = modinv_fac[n - r] * modinv_fac[r] % mod;
return (term * den) % mod;
}
}
int main() {
fastio();
// compute fac array
fac[0] = 1;
for (LL i = 1; i < N; ++i) {
fac[i] = i * fac[i - 1] % MOD;
}
// precompute modinv_fac and use this in binpow
modinv_fac[N - 1] = binpow(fac[N - 1], MOD - 2, MOD);
for (LL i = N - 2; i >= 0; --i) {
modinv_fac[i] = (i + 1) * modinv_fac[i + 1] % MOD;
}
LL k;
cin >> k;
string s;
cin >> s;
LL res = 0;
LL S = s.size();
for (LL x = 0; x <= k; ++x) {
LL term = (binpow(25, k - x, MOD) * binpow(26, x, MOD) % MOD);
term = term * binom(S + k - 1 - x, S - 1, MOD) % MOD;
res = (res + term) % MOD;
}
cout << res << "\n";
} | #include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
inline void fastio() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
}
#define whats(x) cerr << #x << " = " << (x) << "\n";
using LL = long long;
using LD = long double;
const LL INF = LLONG_MAX;
const LL MOD = static_cast<LL>(1e9 + 7);
const LL N = 2e6 + 1;
LL fac[N] = {0};
LL modinv_fac[N] = {0};
LL binpow(LL x, LL p, LL mod) {
LL res = 1;
x %= mod;
while (p) {
if (p & 1) {
res *= x;
res %= mod;
}
x *= x;
x %= mod;
p >>= 1;
}
return res;
}
LL binom(LL n, LL r, LL mod) {
if (r < 0 || r > n) {
return 0;
} else {
LL term = fac[n];
// LL den = binpow(fac[n-r], mod-2, mod)*binpow(fac[r], mod-2, mod) % mod;
LL den = modinv_fac[n - r] * modinv_fac[r] % mod;
return (term * den) % mod;
}
}
int main() {
fastio();
// compute fac array
fac[0] = 1;
for (LL i = 1; i < N; ++i) {
fac[i] = i * fac[i - 1] % MOD;
}
// precompute modinv_fac and use this in binpow
modinv_fac[N - 1] = binpow(fac[N - 1], MOD - 2, MOD);
for (LL i = N - 2; i >= 0; --i) {
modinv_fac[i] = (i + 1) * modinv_fac[i + 1] % MOD;
}
LL k;
cin >> k;
string s;
cin >> s;
LL res = 0;
LL S = s.size();
for (LL x = 0; x <= k; ++x) {
LL term = (binpow(25, k - x, MOD) * binpow(26, x, MOD) % MOD);
term = term * binom(S + k - 1 - x, S - 1, MOD) % MOD;
res = (res + term) % MOD;
}
cout << res << "\n";
} | replace | 23 | 24 | 23 | 24 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// mod逆元を使ったnCkの計算(速)
const int64_t MAX = 1000010;
const int64_t MOD = 1000000007;
int64_t 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;
}
}
// 二項係数計算
int64_t COM(int64_t n, int64_t k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 繰り返し二乗法
int64_t powmod(int64_t x, int64_t n) {
int64_t ans = 1;
while (n > 0) {
if ((n & 1) == 1) {
ans = ans * x;
ans %= MOD;
}
x = x * x; // 一周する度にx, x^2, x^4, x^8となる
x %= MOD;
n >>= 1; // 桁をずらす n = n >> 1
}
return ans;
}
int main() {
int64_t K;
cin >> K;
string S;
cin >> S;
int64_t N = S.size();
/*dp[0][0] = 25;
dp[0][1] = 1;
for(int i=0; i<N+K; i++){
for(int j=0; j<N+1; j++){
if(j == 0){
dp[i+1][j] = dp[i][j]*25;
}
else if(j != N){
dp[i+1][j] = dp[i][j-1] + dp[i][j]*25;
}
else{
dp[i+1][j] = dp[i][j]*26 + dp[i][j-1];
}
dp[i+1][j] %= MOD;
}
}
cout << dp[N+K-1][N] << endl;*/
COMinit();
int64_t ans = 0;
for (int i = 0; i <= K; i++) {
int64_t plus = COM(N + i - 1, i);
plus *= powmod(25, i);
plus %= MOD;
plus *= powmod(26, K - i);
plus %= MOD;
ans += plus;
ans %= MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
// mod逆元を使ったnCkの計算(速)
const int64_t MAX = 3000010;
const int64_t MOD = 1000000007;
int64_t 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;
}
}
// 二項係数計算
int64_t COM(int64_t n, int64_t k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 繰り返し二乗法
int64_t powmod(int64_t x, int64_t n) {
int64_t ans = 1;
while (n > 0) {
if ((n & 1) == 1) {
ans = ans * x;
ans %= MOD;
}
x = x * x; // 一周する度にx, x^2, x^4, x^8となる
x %= MOD;
n >>= 1; // 桁をずらす n = n >> 1
}
return ans;
}
int main() {
int64_t K;
cin >> K;
string S;
cin >> S;
int64_t N = S.size();
/*dp[0][0] = 25;
dp[0][1] = 1;
for(int i=0; i<N+K; i++){
for(int j=0; j<N+1; j++){
if(j == 0){
dp[i+1][j] = dp[i][j]*25;
}
else if(j != N){
dp[i+1][j] = dp[i][j-1] + dp[i][j]*25;
}
else{
dp[i+1][j] = dp[i][j]*26 + dp[i][j-1];
}
dp[i+1][j] %= MOD;
}
}
cout << dp[N+K-1][N] << endl;*/
COMinit();
int64_t ans = 0;
for (int i = 0; i <= K; i++) {
int64_t plus = COM(N + i - 1, i);
plus *= powmod(25, i);
plus %= MOD;
plus *= powmod(26, K - i);
plus %= MOD;
ans += plus;
ans %= MOD;
}
cout << ans << endl;
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll a, ll n, ll p) {
if (n == 0)
return 1;
if (n % 2)
return (a * modpow(a, n - 1, p)) % p;
if (!(n % 2)) {
ll t = modpow(a, n / 2, p);
return (t * t) % p;
}
}
int main() {
int k;
string s;
cin >> k >> s;
int n = s.size();
ll ans = 0;
COMinit();
for (int i = 0; i <= k; i++) {
ans += ((COM(k - i + n - 1, n - 1) * modpow(25, k - i, mod)) % mod *
modpow(26, i, mod)) %
mod;
ans %= mod;
}
cout << ans << endl;
} | #include <algorithm>
#include <assert.h>
#include <bitset>
#include <complex>
#include <cstring>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
using ll = long long;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
const ll mod = 1e9 + 7;
const int MAX = 2000000;
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 modpow(ll a, ll n, ll p) {
if (n == 0)
return 1;
if (n % 2)
return (a * modpow(a, n - 1, p)) % p;
if (!(n % 2)) {
ll t = modpow(a, n / 2, p);
return (t * t) % p;
}
}
int main() {
int k;
string s;
cin >> k >> s;
int n = s.size();
ll ans = 0;
COMinit();
for (int i = 0; i <= k; i++) {
ans += ((COM(k - i + n - 1, n - 1) * modpow(25, k - i, mod)) % mod *
modpow(26, i, mod)) %
mod;
ans %= mod;
}
cout << ans << endl;
} | replace | 25 | 26 | 25 | 26 | 0 | |
p02632 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
// #define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
const int MAX = 1001000;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = (finv[i - 1] * inv[i]) % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll n, ll t) {
ll ret = 1;
while (0 < t) {
if (t % 2 == 0) {
n *= n;
n %= MOD;
t >>= 1;
} else {
ret *= n;
ret %= MOD;
--t;
}
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// std::cout << std::fixed << std::setprecision(15); //"for float-base
// problem"
string S;
ll K;
cin >> K >> S;
ll size = S.size();
ll ans = 0;
COMinit();
REP(i, K + 1) {
ll p = modpow(26, i);
ll c = COM((size + K - 1 - i), (size - 1));
ll p2 = modpow(25, (K - i));
// cout << c << " " << p << " " << p2 << endl;
ans += (((p * c) % MOD) * p2) % MOD;
ans %= MOD;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (long long i = 0; i < (long long)n; i++)
// #define _GLIBCXX_DEBUG
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using Vl = vector<ll>;
using vi = vector<int>;
using Graph = vector<vi>;
const int MAX = 2001000;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = (finv[i - 1] * inv[i]) % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll modpow(ll n, ll t) {
ll ret = 1;
while (0 < t) {
if (t % 2 == 0) {
n *= n;
n %= MOD;
t >>= 1;
} else {
ret *= n;
ret %= MOD;
--t;
}
}
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
// std::cout << std::fixed << std::setprecision(15); //"for float-base
// problem"
string S;
ll K;
cin >> K >> S;
ll size = S.size();
ll ans = 0;
COMinit();
REP(i, K + 1) {
ll p = modpow(26, i);
ll c = COM((size + K - 1 - i), (size - 1));
ll p2 = modpow(25, (K - i));
// cout << c << " " << p << " " << p2 << endl;
ans += (((p * c) % MOD) * p2) % MOD;
ans %= MOD;
}
cout << ans << endl;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02632 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// #define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define DEB2(X) cout << X << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define DEB2(X) \
{}
#define END \
{}
#endif
typedef long long ll;
#define int ll
#define uset unordered_set
#define umap unordered_map
// typedef std::pair<int,int> P;
struct edge {
int to, cost;
};
const int INF = 100000000000000000;
const int INF2 = 9223372036854775807;
const int MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define min(X, Y) (((int)(X) < (int)(Y)) ? (X) : (Y))
#define max(X, Y) (((int)(X) > (int)(Y)) ? (X) : (Y))
#define NP(X, Y) next_permutation(X, Y)
#define setdouble(X, Y) cout << fixed << setprecision(X) << Y
int ceil2(int a, int b) {
if (a % b == 0) {
return a / b;
} else {
return a / b + 1;
}
}
int pow2(int a, int b) {
int r = 1;
for (int i = 1; i <= b; i++) {
r *= a;
}
return r;
}
int Log2(int a) {
int t = 0;
while (1) {
if (a == 0 || a == 1) {
break;
}
a /= 2;
t++;
}
return t;
}
int K;
string S;
int A[1000010], B[1000010];
void mul(int &a, int b) {
a *= b;
a %= MOD;
}
void add(int &a, int b) {
a += b;
a %= MOD;
}
int extgcd(int a, int b, int &x, int &y) {
int g = a;
x = 1, y = 0;
if (b != 0) {
g = extgcd(b, a % b, y, x);
y -= (a / b) * x;
}
return g;
}
// 逆元
int mod_inverse(int a, int m) {
int x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
// 階乗
std::vector<int> fact;
void mod_fact(int n, int m) {
fact.resize(n + 1);
fact[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = fact[i - 1] * i % m;
}
}
// nCk mod p
int mod_nCr(int n, int k, int m) {
if (n < k)
return 0;
return fact[n] * mod_inverse(fact[k] * fact[n - k] % m, m) % m;
}
signed main() {
cin >> K >> S;
int N = S.size();
mod_fact(1000010, MOD);
for (int i = 0; i <= 1000000; i++) {
A[i] = 1, B[i] = 1;
}
for (int i = 1; i <= 1000000; i++) {
A[i] = A[i - 1] * 26 % MOD;
B[i] = B[i - 1] * 25 % MOD;
}
int ans = 0;
for (int i = 0; i <= K; i++) {
int res = mod_nCr(N - 1 + K - i, K - i, MOD);
mul(res, A[i]);
mul(res, B[K - i]);
add(ans, res);
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
// #define MODE 1
#ifdef MODE
#define DEB(X) cout << #X << ": " << X << " ";
#define DEB2(X) cout << X << " ";
#define END cout << endl;
#else
#define DEB(X) \
{}
#define DEB2(X) \
{}
#define END \
{}
#endif
typedef long long ll;
#define int ll
#define uset unordered_set
#define umap unordered_map
// typedef std::pair<int,int> P;
struct edge {
int to, cost;
};
const int INF = 100000000000000000;
const int INF2 = 9223372036854775807;
const int MOD = 1000000007;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
#define min(X, Y) (((int)(X) < (int)(Y)) ? (X) : (Y))
#define max(X, Y) (((int)(X) > (int)(Y)) ? (X) : (Y))
#define NP(X, Y) next_permutation(X, Y)
#define setdouble(X, Y) cout << fixed << setprecision(X) << Y
int ceil2(int a, int b) {
if (a % b == 0) {
return a / b;
} else {
return a / b + 1;
}
}
int pow2(int a, int b) {
int r = 1;
for (int i = 1; i <= b; i++) {
r *= a;
}
return r;
}
int Log2(int a) {
int t = 0;
while (1) {
if (a == 0 || a == 1) {
break;
}
a /= 2;
t++;
}
return t;
}
int K;
string S;
int A[1000010], B[1000010];
void mul(int &a, int b) {
a *= b;
a %= MOD;
}
void add(int &a, int b) {
a += b;
a %= MOD;
}
int extgcd(int a, int b, int &x, int &y) {
int g = a;
x = 1, y = 0;
if (b != 0) {
g = extgcd(b, a % b, y, x);
y -= (a / b) * x;
}
return g;
}
// 逆元
int mod_inverse(int a, int m) {
int x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
// 階乗
std::vector<int> fact;
void mod_fact(int n, int m) {
fact.resize(n + 1);
fact[0] = 1;
for (int i = 1; i <= n; i++) {
fact[i] = fact[i - 1] * i % m;
}
}
// nCk mod p
int mod_nCr(int n, int k, int m) {
if (n < k)
return 0;
return fact[n] * mod_inverse(fact[k] * fact[n - k] % m, m) % m;
}
signed main() {
cin >> K >> S;
int N = S.size();
mod_fact(5000010, MOD);
for (int i = 0; i <= 1000000; i++) {
A[i] = 1, B[i] = 1;
}
for (int i = 1; i <= 1000000; i++) {
A[i] = A[i - 1] * 26 % MOD;
B[i] = B[i - 1] * 25 % MOD;
}
int ans = 0;
for (int i = 0; i <= K; i++) {
int res = mod_nCr(N - 1 + K - i, K - i, MOD);
mul(res, A[i]);
mul(res, B[K - i]);
add(ans, res);
}
cout << ans << endl;
return 0;
}
| replace | 123 | 124 | 123 | 124 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.