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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02792 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iso646.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#ifndef M_PI
#define M_PI 3.14159265358979
#endif
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long, long long> pll;
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
ll itoj(string N, ll i, ll j) {
ll len = N.length();
ll ans = 0;
for (ll k = 1; k <= len; k++) {
if (k == 1 && i == j) {
ans++;
continue;
}
if (k == 2) {
if (i * 10 + j <= stoi(N)) {
ans++;
}
continue;
}
if (k >= 3 && k < len) {
ans += pow(10, k - 2);
continue;
}
if (k == len) {
if (i < N[0] - '0') {
ans += pow(10, k - 2);
} else if (i > N[0] - '0') {
continue;
} else {
ans += stoi(N.substr(1, len - 2));
if (j <= N[len - 1] - '0') {
ans++;
}
}
}
}
return ans;
}
int main() {
ll i, j;
string N;
cin >> N;
ll len = N.length();
ll ans = 0;
for (i = 1; i <= 9; i++) {
for (j = 1; j <= 9; j++) {
ans += itoj(N, i, j) * itoj(N, j, i);
}
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cstdio>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iso646.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
#ifndef M_PI
#define M_PI 3.14159265358979
#endif
#define deg_to_rad(deg) (((deg) / 360) * 2 * M_PI)
#define rad_to_deg(rad) (((rad) / 2 / M_PI) * 360)
using namespace std;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef long long ll;
typedef vector<long long> vll;
typedef pair<long long, long long> pll;
const ll INF = 1e15;
const ll MOD = 1e9 + 7;
ll itoj(string N, ll i, ll j) {
ll len = N.length();
ll ans = 0;
for (ll k = 1; k <= len; k++) {
if (k == 1) {
if (i <= stoi(N) && i == j) {
ans++;
}
continue;
}
if (k == 2) {
if (i * 10 + j <= stoi(N)) {
ans++;
}
continue;
}
if (k >= 3 && k < len) {
ans += pow(10, k - 2);
continue;
}
if (k == len) {
if (i < N[0] - '0') {
ans += pow(10, k - 2);
} else if (i > N[0] - '0') {
continue;
} else {
ans += stoi(N.substr(1, len - 2));
if (j <= N[len - 1] - '0') {
ans++;
}
}
}
}
return ans;
}
int main() {
ll i, j;
string N;
cin >> N;
ll len = N.length();
ll ans = 0;
for (i = 1; i <= 9; i++) {
for (j = 1; j <= 9; j++) {
ans += itoj(N, i, j) * itoj(N, j, i);
}
}
cout << ans << endl;
return 0;
}
| replace | 37 | 39 | 37 | 41 | 0 | |
p02792 | C++ | Time Limit Exceeded | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Rishabhdeep Singh
*/
// doot diddly donger cuckerino Hahahahahah
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;
// @formatter:off
#define PB push_back
#define EB emplace_back
#define F first
#define S second
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (long long)(x).size()
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout << fixed << setprecision(12);
#define IN_REP \
int tt; \
cin >> tt; \
while (tt--)
#define sim template <typename T
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<T>(0) x 1, debug &>::type operator<<(T i)
sim > struct rge {
T b, e;
};
sim > rge<T> range(T i, T j) { return rge<T>{i, j}; }
sim > auto dud(T *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) {
cerr << boolalpha << i;
ris;
}
eni(==) { ris << range(all(i)); }
sim, typename U dor(pair<U, T> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<T> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const T &) { ris; }
#endif
};
#define pr(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll MOD = (ll)1e9 + 7;
const ld PI = acos(-1);
template <typename T> T gcd(T x, T y) { return (y == 0) ? x : gcd(y, x % y); }
template <typename T> void mini(T &x, T y) { x = min(x, y); }
template <typename T> void maxi(T &x, T y) { x = max(x, y); }
template <typename T, typename U> string to_string(pair<T, U> p) {
return to_string(p.F) + " " + to_string(p.S);
}
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
// @formatter:on
class DHandstand2 {
public:
bool ok(int i, int j, int k) {
string s = to_string(k);
return s[0] - '0' == i and s.back() - '0' == j;
}
void solve(std::istream &cin, std::ostream &cout) {
ll n;
cin >> n;
vvll c(10, vll(10, 0));
for (int i = 0; i < 10; ++i) {
for (int j = 0; j < 10; ++j) {
for (int k = 1; k <= n; ++k) {
c[i][j] += ok(i, j, k);
}
}
}
ll ans = 0;
for (int i = 0; i < 10; ++i) {
for (int j = 0; j < 10; ++j) {
ans += c[i][j] * c[j][i];
}
}
cout << ans << '\n';
}
};
int main() {
IOS;
DHandstand2 solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Rishabhdeep Singh
*/
// doot diddly donger cuckerino Hahahahahah
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace __gnu_cxx;
using namespace std;
// @formatter:off
#define PB push_back
#define EB emplace_back
#define F first
#define S second
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define sz(x) (long long)(x).size()
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(NULL); \
cout << fixed << setprecision(12);
#define IN_REP \
int tt; \
cin >> tt; \
while (tt--)
#define sim template <typename T
#define ris return *this
#define dor > debug &operator<<
#define eni(x) \
sim > typename enable_if<sizeof dud<T>(0) x 1, debug &>::type operator<<(T i)
sim > struct rge {
T b, e;
};
sim > rge<T> range(T i, T j) { return rge<T>{i, j}; }
sim > auto dud(T *x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) {
cerr << boolalpha << i;
ris;
}
eni(==) { ris << range(all(i)); }
sim, typename U dor(pair<U, T> d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<T> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const T &) { ris; }
#endif
};
#define pr(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vb = vector<bool>;
using vvi = vector<vi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vpii = vector<pii>;
using vpll = vector<pll>;
template <typename T>
using ordered_set =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const ll MOD = (ll)1e9 + 7;
const ld PI = acos(-1);
template <typename T> T gcd(T x, T y) { return (y == 0) ? x : gcd(y, x % y); }
template <typename T> void mini(T &x, T y) { x = min(x, y); }
template <typename T> void maxi(T &x, T y) { x = max(x, y); }
template <typename T, typename U> string to_string(pair<T, U> p) {
return to_string(p.F) + " " + to_string(p.S);
}
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
// @formatter:on
class DHandstand2 {
public:
bool ok(int i, int j, int k) {
string s = to_string(k);
return s[0] - '0' == i and s.back() - '0' == j;
}
void solve(std::istream &cin, std::ostream &cout) {
ll n;
cin >> n;
vvll c(10, vll(10, 0));
for (int i = 1; i <= n; ++i) {
string s = to_string(i);
c[s[0] - '0'][s.back() - '0']++;
}
ll ans = 0;
for (int i = 0; i < 10; ++i) {
for (int j = 0; j < 10; ++j) {
ans += c[i][j] * c[j][i];
}
}
cout << ans << '\n';
}
};
int main() {
IOS;
DHandstand2 solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| replace | 106 | 112 | 106 | 109 | TLE | |
p02792 | C++ | Time Limit Exceeded | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<vector<int>> kazu(10, vector<int>(10));
for (int i = 0; i <= 9; i++) {
for (int j = 0; j <= 9; j++) {
kazu[i][j] = 0;
}
}
for (int i = 0; i <= 9; i++) {
for (int j = 0; j <= 9; j++) {
for (int k = 1; k <= n; k++) {
string moji;
moji = to_string(k);
// cout << "mojiの最初" << moji[0] << " i" << i << " mojiの最後" <<
// moji[moji.size() - 1] << " j" << j << endl;
if (moji[0] - '0' == i && moji[moji.size() - 1] - '0' == j) {
// cout << "a" << endl;
kazu[i][j]++;
}
}
}
}
long long kotae = 0;
for (int i = 0; i <= 9; i++) {
for (int j = 0; j <= 9; j++) {
kotae += kazu[i][j] * kazu[j][i];
// cout << kazu[i][j] << " " << kazu[j][i] << endl;
}
}
cout << kotae << endl;
} | #include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
int n = 0;
cin >> n;
vector<vector<int>> kazu(10, vector<int>(10));
for (int i = 0; i <= 9; i++) {
for (int j = 0; j <= 9; j++) {
kazu[i][j] = 0;
}
}
for (int k = 1; k <= n; k++) {
string moji;
moji = to_string(k);
// cout << "mojiの最初" << moji[0] << " i" << i << " mojiの最後" <<
// moji[moji.size() - 1] << " j" << j << endl;
kazu[moji[0] - '0'][moji[moji.size() - 1] - '0']++;
}
long long kotae = 0;
for (int i = 0; i <= 9; i++) {
for (int j = 0; j <= 9; j++) {
kotae += kazu[i][j] * kazu[j][i];
// cout << kazu[i][j] << " " << kazu[j][i] << endl;
}
}
cout << kotae << endl;
} | replace | 13 | 26 | 13 | 19 | TLE | |
p02792 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
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;
}
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
sizeは(int)とキャストしよう
cin.tie(0);
ios::sync_with_stdio(false);<- これら、printfとかと併用しない方が良さそう
*/
const ll mod = 1e9 + 7;
void chmod(ll &M) {
if (M >= mod)
M %= mod;
else if (M < 0) {
M += (abs(M) / mod + 1) * mod;
M %= mod;
}
}
ll modpow(ll x, ll n) {
if (n == 0)
return 1;
ll res = modpow(x, n / 2);
if (n % 2 == 0)
return res * res % mod;
else
return res * res % mod * x % mod;
}
int getl(int i, int N) { return i == 0 ? N - 1 : i - 1; };
int getr(int i, int N) { return i == N - 1 ? 0 : i + 1; };
// 線分 ab の偏角 返り値は[-π, π]
double argument(const pair<double, double> &a, const pair<double, double> &b) {
double ax = a.first, ay = a.second, bx = b.first, by = b.second;
return atan2(by - ay, bx - ax);
}
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<vector<int>> f(10, vector<int>(10, 0));
repr(i, 1, n + 1) {
int a = i;
while (i >= 10) {
a /= 10;
}
int b = i % 10;
++f[a][b];
}
ll ans = 0;
repr(i, 1, 10) repr(j, 1, 10) ans += f[i][j] * f[j][i];
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
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;
}
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
sizeは(int)とキャストしよう
cin.tie(0);
ios::sync_with_stdio(false);<- これら、printfとかと併用しない方が良さそう
*/
const ll mod = 1e9 + 7;
void chmod(ll &M) {
if (M >= mod)
M %= mod;
else if (M < 0) {
M += (abs(M) / mod + 1) * mod;
M %= mod;
}
}
ll modpow(ll x, ll n) {
if (n == 0)
return 1;
ll res = modpow(x, n / 2);
if (n % 2 == 0)
return res * res % mod;
else
return res * res % mod * x % mod;
}
int getl(int i, int N) { return i == 0 ? N - 1 : i - 1; };
int getr(int i, int N) { return i == N - 1 ? 0 : i + 1; };
// 線分 ab の偏角 返り値は[-π, π]
double argument(const pair<double, double> &a, const pair<double, double> &b) {
double ax = a.first, ay = a.second, bx = b.first, by = b.second;
return atan2(by - ay, bx - ax);
}
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int n;
cin >> n;
vector<vector<int>> f(10, vector<int>(10, 0));
repr(i, 1, n + 1) {
int a = i;
while (a >= 10) {
a /= 10;
}
int b = i % 10;
++f[a][b];
}
ll ans = 0;
repr(i, 1, 10) repr(j, 1, 10) ans += f[i][j] * f[j][i];
cout << ans << endl;
return 0;
} | replace | 81 | 82 | 81 | 82 | TLE | |
p02792 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#include <math.h>
#include <time.h>
using namespace std;
const long long mod = 1000000007;
#define dump(x) \
if (dbg) { \
cout << #x << " = " << (x) << endl; \
}
bool dbg = false;
long long gcd(long long a, long long b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
//---------------------------------------------------------------------------------------------------
/*ここからいじる*/
//---------------------------------------------------------------------------------------------------
void solve() {}
int main() {
dbg = true;
int n;
cin >> n;
vector<vector<int>> data(10, (vector<int>(10)));
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
for (int k = 1; k <= n; k++) {
char ich, jch;
ich = i + '0';
jch = j + '0';
if (to_string(k).at(0) == (ich) &&
to_string(k).at(to_string(k).size() - 1) == (jch)) {
data.at(i).at(j)++;
}
}
}
}
long long ans = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
ans += data.at(i).at(j) * data.at(j).at(i);
}
}
cout << ans << endl;
solve();
return 0;
}
| #include "bits/stdc++.h"
#include <math.h>
#include <time.h>
using namespace std;
const long long mod = 1000000007;
#define dump(x) \
if (dbg) { \
cout << #x << " = " << (x) << endl; \
}
bool dbg = false;
long long gcd(long long a, long long b) {
if (a % b == 0) {
return (b);
} else {
return (gcd(b, a % b));
}
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
//---------------------------------------------------------------------------------------------------
/*ここからいじる*/
//---------------------------------------------------------------------------------------------------
void solve() {}
int main() {
dbg = true;
int n;
cin >> n;
vector<vector<int>> data(10, (vector<int>(10)));
int num;
for (int i = 1; i <= n; i++) {
data.at(to_string(i).at(0) - '0')
.at(to_string(i).at(to_string(i).size() - 1) - '0')++;
}
long long ans = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
ans += data.at(i).at(j) * data.at(j).at(i);
}
}
cout << ans << endl;
solve();
return 0;
}
| replace | 28 | 40 | 28 | 32 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define _GLIBCXX_DEBUG
#define rep(i, c) for (int i = 0; i < (int)c; i++)
#define debug(x) cout << #x << " = " << x << endl
#define print(x) cout << x << endl;
int main() {
int N;
cin >> N;
vector<vector<ll>> table(9, vector<ll>(9, 0));
ll num = 0;
for (int k = 1; k <= N; k++) {
string k_str = to_string(k);
int i = k_str.at(0) - '0';
int j = k_str.at(k_str.size() - 1) - '0';
table[i - 1][j - 1] += 1;
}
ll ans = 0;
for (int i = 1; i <= N; i++) {
string i_str = to_string(i);
int l = i_str.at(0) - '0';
int m = i_str.at(i_str.size() - 1) - '0';
if (m == 0) {
continue;
}
ans += table[m - 1][l - 1];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define _GLIBCXX_DEBUG
#define rep(i, c) for (int i = 0; i < (int)c; i++)
#define debug(x) cout << #x << " = " << x << endl
#define print(x) cout << x << endl;
int main() {
int N;
cin >> N;
vector<vector<ll>> table(9, vector<ll>(9, 0));
ll num = 0;
for (int k = 1; k <= N; k++) {
string k_str = to_string(k);
int i = k_str.at(0) - '0';
int j = k_str.at(k_str.size() - 1) - '0';
if (j == 0) {
continue;
}
table[i - 1][j - 1] += 1;
}
ll ans = 0;
for (int i = 1; i <= N; i++) {
string i_str = to_string(i);
int l = i_str.at(0) - '0';
int m = i_str.at(i_str.size() - 1) - '0';
if (m == 0) {
continue;
}
ans += table[m - 1][l - 1];
}
cout << ans << endl;
}
| insert | 19 | 19 | 19 | 22 | -6 | munmap_chunk(): invalid pointer
|
p02792 | C++ | Runtime Error | #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> count(10, vector<int>(10, 0));
for (int i = 1; i <= N; i++) {
int a = i % 10;
int b = i;
while (b > 10) {
b /= 10;
}
count[a][b]++;
}
long long ans = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
ans += count[i][j] * count[j][i];
}
}
cout << ans << endl;
}
| #include <iostream>
#include <vector>
using namespace std;
int main() {
int N;
cin >> N;
vector<vector<int>> count(10, vector<int>(10, 0));
for (int i = 1; i <= N; i++) {
int a = i % 10;
int b = i;
while (b >= 10) {
b /= 10;
}
count[a][b]++;
}
long long ans = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
ans += count[i][j] * count[j][i];
}
}
cout << ans << endl;
}
| replace | 11 | 12 | 11 | 12 | -6 | munmap_chunk(): invalid pointer
|
p02792 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#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 FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repr(i, n) for (ll i = n; i >= 0; 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 COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
const long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
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;
}
const int MAX_N = 100010;
int dp[10][10];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
rep(i, 9) {
rep(j, 9) {
int k = i + 1;
int l = j + 1;
for (int a = 1; a <= n; a++) {
string tmp = to_string(a);
int b = tmp[0] - '0';
int c = tmp[tmp.size() - 1] - '0';
if (b == 0 || c == 0)
continue;
if (k == c && l == b) {
dp[i][j]++;
}
}
}
}
int ans = 0;
for (int i = 1; i <= n; i++) {
string s = to_string(i);
int a = s[0] - '0';
int b = s[s.size() - 1] - '0';
if (a == 0 || b == 0)
continue;
ans += dp[a - 1][b - 1];
}
cout << ans << endl;
return 0;
} | #include <algorithm>
#include <bitset>
#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 FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define FORR(i, a, b) for (ll i = (a); i <= (b); i++)
#define repr(i, n) for (ll i = n; i >= 0; 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 COUT(x) cout << (x) << endl
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define EPS (1e-10)
#define pb push_back
const long long MOD = 1000000007;
// const long long MOD = 998244353;
const long long INF = 1LL << 60;
const double PI = acos(-1.0);
long long modinv(long long a, long long m) {
long long b = m, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (b == 0)
return a;
unsigned r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a * b / g;
}
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;
}
const int MAX_N = 100010;
int dp[10][10];
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
for (int a = 1; a <= n; a++) {
string tmp = to_string(a);
int b = tmp[0] - '0';
int c = tmp[tmp.size() - 1] - '0';
// cout << a << endl;
if (b == 0 || c == 0)
continue;
dp[c - 1][b - 1]++;
}
int ans = 0;
for (int i = 1; i <= n; i++) {
string s = to_string(i);
int a = s[0] - '0';
int b = s[s.size() - 1] - '0';
if (a == 0 || b == 0)
continue;
ans += dp[a - 1][b - 1];
}
cout << ans << endl;
return 0;
} | replace | 134 | 149 | 134 | 143 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define print(x) cout << x << endl
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll MOD = 1000000007;
int main() {
ll N;
cin >> N;
vector<vector<ll>> mat(N, vector<ll>(N, 0));
rep(i, N) {
string tmp = to_string(i + 1);
ll s = tmp[0] - '0';
ll e = tmp.back() - '0';
mat[s][e]++;
}
ll sum = 0;
rep(i, 10) {
rep(j, 10) { sum += mat[i][j] * mat[j][i]; }
cout << endl;
}
cout << sum << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define print(x) cout << x << endl
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll MOD = 1000000007;
int main() {
ll N;
cin >> N;
vector<vector<ll>> mat(10, vector<ll>(10, 0));
rep(i, N) {
string tmp = to_string(i + 1);
ll s = tmp[0] - '0';
ll e = tmp.back() - '0';
mat[s][e]++;
}
ll sum = 0;
rep(i, 10) {
rep(j, 10) { sum += mat[i][j] * mat[j][i]; }
cout << endl;
}
cout << sum << endl;
return 0;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> &a, int b) {
auto c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> &a, int b) {
auto c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
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;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; 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;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
// 最短経路の表 a(全部INFで初期化)
// 縦横 x,y
// 迷路 f
// スタートsx,sy
// ゴールgx,gy
// 文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
int pow_kai(int a, int b) {
int c = 1;
while (b > 0) { // bit全部捨てるまで
if (b % 2) { // 一番右のbitが1
c = c * a;
}
a = a * a;
b >>= 1; // 全体右に1つシフト
}
return c;
}
// 12だったら{(2,2),(3,1)}って返してくれるはず
V<P<int, int>> factorize(int n) {
V<P<int, int>> res;
for (int i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
signed main() {
int n;
cin >> n;
int cnt[10][10];
fo(i, 10) {
fo(j, 10) { cnt[i][j] = 0; }
}
for (int i = 1; i <= n; i++) {
string a = to_string(i);
int b = a[0];
int c = i % 10;
cnt[b][c]++;
}
int ans = 0;
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
ans += cnt[i][j] * cnt[j][i];
}
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define double long double
#define fo(a, b) for (int a = 0; a < b; a++)
#define Sort(a) sort(a.begin(), a.end())
#define rev(a) reverse(a.begin(), a.end())
#define fi first
#define se second
#define sz size()
#define bgn begin()
#define en end()
#define pb push_back
#define pp() pop_back()
#define V vector
#define P pair
#define yuko(a) setprecision(a)
#define uni(a) a.erase(unique(a.begin(), a.end()), a.end())
#define Q queue
#define pri priority_queue
#define Pri priority_queue<int, vector<int>, greater<int>>
#define PriP \
priority_queue<P<int, int>, vector<P<int, int>>, greater<P<int, int>>>
#define ff first.first
#define fs first.second
#define sf second.first
#define ss second.second
#define all(a) (a).begin(), (a).end()
#define elif else if
int low(V<int> &a, int b) {
auto c = lower_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
int upp(V<int> &a, int b) {
auto c = upper_bound(a.begin(), a.end(), b);
int d = c - a.bgn;
return d;
}
template <class T> void cou(vector<vector<T>> a) {
int b = a.size();
int c = a[0].size();
fo(i, b) {
fo(j, c) {
cout << a[i][j];
if (j == c - 1)
cout << endl;
else
cout << ' ';
}
}
}
int wari(int a, int b) {
if (a % b == 0)
return a / b;
else
return a / b + 1;
}
int keta(int a) {
double b = a;
b = log10(b);
int c = b;
return c + 1;
}
int souwa(int a) { return a * (a + 1) / 2; }
int gcm(int a, int b) {
if (a % b == 0)
return b;
return gcm(b, a % b);
}
bool prime(int a) {
if (a < 2)
return false;
else if (a == 2)
return true;
else if (a % 2 == 0)
return false;
for (int i = 3; i <= sqrt(a) + 1; i += 2) {
if (a % i == 0)
return false;
}
return true;
}
struct Union {
vector<int> par;
Union(int a) { par = vector<int>(a, -1); }
int find(int a) {
if (par[a] < 0)
return a;
else
return par[a] = find(par[a]);
}
bool same(int a, int b) { return find(a) == find(b); }
int Size(int a) { return -par[find(a)]; }
void unite(int a, int b) {
a = find(a);
b = find(b);
if (a == b)
return;
if (Size(b) > Size(a))
swap<int>(a, b);
par[a] += par[b];
par[b] = a;
}
};
int ketas(int a) {
string b = to_string(a);
int c = 0;
fo(i, keta(a)) { c += b[i] - '0'; }
return c;
}
bool fe(int a, int b) {
a %= 10;
b %= 10;
if (a == 0)
a = 10;
if (b == 0)
b = 10;
if (a > b)
return true;
else
return false;
}
int INF = 1000000007;
struct edge {
int s, t, d;
};
V<int> mojisyu(string a) {
V<int> b(26, 0);
fo(i, a.sz) { b[a[i] - 'a']++; }
return b;
}
int wa2(int a) {
if (a % 2 == 1)
return a / 2;
return a / 2 - 1;
}
/*signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}
?*/
int nCr(int n, int r) {
int a = 1;
r = min(r, n - r);
for (int i = n; i > n - r; i--) {
a *= i;
a /= n - i + 1;
}
return a;
}
/*void sea(int x,int y){
if(x<0||a<=x||y<0||b<=y||c[x][y]=='#')
return;
if(d[x][y])
return;
d[x][y]++;
sea(x+1,y);
sea(x-1,y);
sea(x,y+1);
sea(x,y-1);
}*/
int kaijou(int a) {
int b = 1;
fo(i, a) b *= i + 1;
return b;
}
int nPr(int a, int b) {
if (a < b)
return 0;
if (b == 0)
return 1;
int c = 1;
for (int i = a; i > a - b; i--) {
c *= i;
c %= INF;
}
return c;
}
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;
}
// a^{-1} mod を計算する
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int lcm(int a, int b) {
int c = modinv(gcm(a, b), INF);
return ((a * c) % INF) * (b % INF) % INF;
}
int MOD = INF;
int fac[1000010], finv[1000010], inv[1000010];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < 1000010; 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;
}
bool naka(int a, int b, V<V<char>> c) {
return (a >= 0 && b >= 0 && a < c.sz && b < c[0].sz);
}
V<P<int, int>> mawari8 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0},
{-1, -1}, {1, 1}, {1, -1}, {-1, -1}};
int inf = 1000000000000000007;
/*
signed main(){
int a,b,c;
cin>>a>>b>>c;
V<V<edge>> d(a);
fo(i,b){
edge e;
cin>>e.s>>e.t>>e.d;
d[e.s].pb(e);
}
V<int> e(a,INF);
e[c]=0;
priority_queue<P<int,int>,V<P<int,int>>,greater<P<int,int>>> f;
f.push({0,c});
int h=INF;
while(!f.empty()){
P<int,int> g;
g=f.top();
f.pop();
int v = g.second, i = g.first;
for(edge l : d[v]){
if(e[l.t] > i + l.d){
e[l.t] = i + l.d;
f.push({i+l.d , l.t});
}
}
}
fo(i,a){
if(e[i]==INF)
cout<<"INF"<<endl;
else
cout<<e[i]<<endl;
}
}*/
V<P<int, int>> mawari4 = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};
// 最短経路の表 a(全部INFで初期化)
// 縦横 x,y
// 迷路 f
// スタートsx,sy
// ゴールgx,gy
// 文字はgから使おうね
/*int bfs_haba(){
Q<P<int,int>> b;
a[sx][sy]=0;
b.push({sx,sy});
while(!b.empty()){
P<int,int> c=b.front();
b.pop();
if(c.fi==gx&&c.se==gy){
break;
}
fo(i,4){
int d=c.fi+mawari4[i].fi;
int e=c.se+mawari4[i].se;
if(0<=d&&0<=e&&d<x&&e<y&&f[d][e]!='#'&&a[d][e]==INF){
b.push({d,e});
a[d][e]=1+a[c.fi][c.se];
}
}
}
return a[gx][gy];
}*/
V<int> onajibubun(string a) {
V<int> b(a.sz);
for (int i = 1, j = 0; i < a.sz; i++) {
if (i + b[i - j] < j + b[j])
b[i] = b[i - j];
else {
int c = max<int>(0, j + b[j] - i);
while (i + c < a.sz && a[c] == a[i + c])
c++;
b[i] = c;
j = i;
}
}
b[0] = a.sz;
return b;
}
int pow_kai(int a, int b) {
int c = 1;
while (b > 0) { // bit全部捨てるまで
if (b % 2) { // 一番右のbitが1
c = c * a;
}
a = a * a;
b >>= 1; // 全体右に1つシフト
}
return c;
}
// 12だったら{(2,2),(3,1)}って返してくれるはず
V<P<int, int>> factorize(int n) {
V<P<int, int>> res;
for (int i = 2; i * i <= n; i++) {
if (n % i)
continue;
res.emplace_back(i, 0);
while (n % i == 0) {
n /= i;
res.back().second++;
}
}
if (n != 1)
res.emplace_back(n, 1);
return res;
}
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};
signed main() {
int n;
cin >> n;
int cnt[10][10];
fo(i, 10) {
fo(j, 10) { cnt[i][j] = 0; }
}
for (int i = 1; i <= n; i++) {
string a = to_string(i);
int d = i;
int b = a[0] - '0';
int c = d % 10;
cnt[b][c]++;
}
int ans = 0;
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
ans += cnt[i][j] * cnt[j][i];
}
}
cout << ans << endl;
} | replace | 371 | 373 | 371 | 374 | 0 | |
p02792 | C++ | Time Limit Exceeded | /*
Template from @50m_regent
https://note.mu/50m_regent/n/na84b255e8679
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false); \
cout << fixed << setprecision(20);
/* コンテナ基本 */
// コンテナの最初と最後のイテレータ
#define all(x) (x).begin(), (x).end()
// 昇順ソート
#define asc(v) sort(all(v))
// 降順ソート
#define desc(v) sort(all(v), greater<ll>())
/* カウント系 */
// vの中にあるcの個数を数える
#define ct(v, c) count(all(v), c)
// vの中でc未満の要素の個数を数える
#define lh(v, c) lower_bound((v).begin(), (v).end(), c) - (v).begin()
// vの中でcより大きい要素の個数を数える
#define uh(v, c) upper_bound((v).begin(), (v).end(), c) - (v).end()
// vの中でc以下の要素の個数を数える
#define lm(v, c) upper_bound((v).begin(), (v).end(), c) - (v).begin()
// vの中でc以上の要素の個数を数える
#define um(v, c) lower_bound((v).begin(), (v).end(), c) - (v).end()
/* ループ系 */
#define _overload(_1, _2, _3, name, ...) name
// iをaからb-1まで+1しながら繰り返す(b-a回繰り返す)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
// iを0からn-1まで+1しながら繰り返す(n回繰り返す)
#define _rep(i, n) repi(i, 0, n)
//
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
// iをa-1からbまで-1しながら繰り返す(a-b回繰り返す)
#define revi(i, a, b) for (ll i = (ll)(a)-1; i >= (ll)(b); i--)
// iをnから0まで-1しながら繰り返す(n回繰り返す)
#define _rev(i, n) revi(i, n, 0)
//
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
// vのそれぞれの要素に対して繰り返す
#define each(a, v) for (auto &&a : v)
/* 入力系 */
// 標準入力から何も受け取らない
void in() {}
// 標準入力から複数の値を受け取る
template <typename F, typename... R> bool in(F &f, R &...r) {
if (cin >> f) {
in(r...);
return true;
} else {
return false;
}
}
// 標準入力からコンテナvに値を受け取る
#define inv(v) each(i, v) in(i)
/* 出力系 */
// 標準出力
#define out(x) cout << (x)
// 半角スペースを標準出力
#define space() cout << " "
// 改行を標準出力
#define indent() cout << '\n'
// 複数の値を標準出力
void print() {}
template <typename F, typename... R> void print(F f, R... r) {
out(f), indent(), print(r...);
}
// コンテナの値を全て標準出力
#define printv(v) \
each(i, v) out(i), space(); \
indent()
// デバッグ用のヘッダをエラー出力
#define debughead(x) cerr << "Line " << __LINE__ << ": " << #x << ": "
// デバッグ用の値をエラー出力
#define debugout(x) cerr << (x) << " "
// デバッグ用の改行をエラー出力
#define debugindent() cerr << '\n'
// デバッグ出力
#define debug(x) debughead(x), debugout(x), debugindent()
// YES or NO を標準出力
#define YN(x) out((x) ? "YES" : "NO"), indent()
// Yes or No を標準出力
#define Yn(x) out((x) ? "Yes" : "No"), indent()
// yes or no を標準出力
#define yn(x) out((x) ? "yes" : "no"), indent()
/* 定数 */
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll LIMIT = 100001;
const ll S_LIMIT = 101;
const ld EPS = 1e-15;
const ld PI = acos(-1);
const ll dx[] = {0, 0, 1, 0, -1, -1, 1, 1, -1};
const ll dy[] = {0, -1, 0, 1, 0, -1, -1, 1, 1};
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
/* 基本アルゴリズム */
// 最大公約数
#define gcd __gcd
// 最小公倍数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
// ワーシャルフロイド用配列
ll g[S_LIMIT][S_LIMIT] = {};
// DP用配列
// ll dp[LIMIT][LIMIT] = {};
// MOD対応累乗
ll modpow(ll x, ll n) {
return n < 2 ? x : modpow(x * x, n / 2) * (n % 2 ? x : 1) % MOD;
}
// MOD対応階乗
ll modfact(ll n) { return n < 2 ? 1 : modfact(n - 1) * n % MOD; }
// MOD対応コンビネーション
ll modcomb(ll n, ll r) {
return modfact(n) * modpow(modfact(r), MOD - 2) % MOD *
modpow(modfact(n - r), MOD - 2) % MOD;
}
// aをmax(a,b)にする
template <typename T> bool chmax(T &a, T b) { return (a = max(a, b)) == b; }
// aをmin(a,b)にする
template <typename T> bool chmin(T &a, T b) { return (a = min(a, b)) == b; }
// 階乗
ll factorial(ll a) { return a < 2 ? 1 : factorial(a - 1) * a; }
// 1～aの総和
ll summation(ll a) { return a < 1 ? 0 : (a * a + a) / 2; }
// コンビネーション
ll combination(ll n, ll r) {
ll res = 1;
rep(i, 1, r + 1) { res *= n--, res /= i; }
return res;
}
// 素数判定
bool isPrime(ll n) {
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
if (!(n % i)) {
return false;
}
}
return true;
}
// ワーシャルフロイド
void warshall(int n) {
rep(i, n) {
rep(j, n) {
rep(k, n) { chmin(g[j][k], g[j][i] + g[i][k]); }
}
}
}
// 約数列挙
vector<int> divisor(int n) {
vector<int> ans;
rep(i, 1, sqrt(n) + 1) {
if (!(n % i)) {
ans.push_back(i);
if (i * i < n) {
ans.push_back(n / i);
}
}
}
return ans;
}
// 素因数分解
map<int, int> factorization(int n) {
map<int, int> ans;
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
while (!(n % i)) {
ans[i]++, n /= i;
}
}
if (n > 1) {
ans[n]++;
}
return ans;
}
// Union-Find
struct UF {
vector<int> t;
UF(int size) : t(size, -1) {}
int root(int x) { return t[x] < 0 ? x : t[x] = root(t[x]); }
int size(int x) { return -t[root(x)]; }
bool isSame(int x, int y) { return root(x) == root(y); }
bool unite(int x, int y) {
x = root(x), y = root(y);
if (x != y) {
if (t[y] < t[x]) {
swap(x, y);
}
t[x] += t[y], t[y] = x;
}
return x != y;
}
};
ll n, m, k, tmp, res = 0;
string s, t;
int main() {
INIT;
in(n);
int c[10][10];
rep(i, 10) {
rep(j, 10) {
int a = 0;
rep(k, 1, n + 1) {
int begin = k / pow(10, (int)floor(log10(k)));
int end = k % 10;
// printf("value=%lld, begin=%d, end=%d\n", k, begin, end);
if (begin == i && end == j)
a++;
}
// c[i][j]: 「k以下で、かつiが最上桁でjが最下桁の整数」の総数
c[i][j] = a;
}
}
rep(i, 1, 10) {
rep(j, 10) { res += c[i][j] * c[j][i]; }
}
print(res);
return 0;
}
| /*
Template from @50m_regent
https://note.mu/50m_regent/n/na84b255e8679
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define INIT \
cin.tie(0); \
ios::sync_with_stdio(false); \
cout << fixed << setprecision(20);
/* コンテナ基本 */
// コンテナの最初と最後のイテレータ
#define all(x) (x).begin(), (x).end()
// 昇順ソート
#define asc(v) sort(all(v))
// 降順ソート
#define desc(v) sort(all(v), greater<ll>())
/* カウント系 */
// vの中にあるcの個数を数える
#define ct(v, c) count(all(v), c)
// vの中でc未満の要素の個数を数える
#define lh(v, c) lower_bound((v).begin(), (v).end(), c) - (v).begin()
// vの中でcより大きい要素の個数を数える
#define uh(v, c) upper_bound((v).begin(), (v).end(), c) - (v).end()
// vの中でc以下の要素の個数を数える
#define lm(v, c) upper_bound((v).begin(), (v).end(), c) - (v).begin()
// vの中でc以上の要素の個数を数える
#define um(v, c) lower_bound((v).begin(), (v).end(), c) - (v).end()
/* ループ系 */
#define _overload(_1, _2, _3, name, ...) name
// iをaからb-1まで+1しながら繰り返す(b-a回繰り返す)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
// iを0からn-1まで+1しながら繰り返す(n回繰り返す)
#define _rep(i, n) repi(i, 0, n)
//
#define rep(...) _overload(__VA_ARGS__, repi, _rep)(__VA_ARGS__)
// iをa-1からbまで-1しながら繰り返す(a-b回繰り返す)
#define revi(i, a, b) for (ll i = (ll)(a)-1; i >= (ll)(b); i--)
// iをnから0まで-1しながら繰り返す(n回繰り返す)
#define _rev(i, n) revi(i, n, 0)
//
#define rev(...) _overload(__VA_ARGS__, revi, _rev)(__VA_ARGS__)
// vのそれぞれの要素に対して繰り返す
#define each(a, v) for (auto &&a : v)
/* 入力系 */
// 標準入力から何も受け取らない
void in() {}
// 標準入力から複数の値を受け取る
template <typename F, typename... R> bool in(F &f, R &...r) {
if (cin >> f) {
in(r...);
return true;
} else {
return false;
}
}
// 標準入力からコンテナvに値を受け取る
#define inv(v) each(i, v) in(i)
/* 出力系 */
// 標準出力
#define out(x) cout << (x)
// 半角スペースを標準出力
#define space() cout << " "
// 改行を標準出力
#define indent() cout << '\n'
// 複数の値を標準出力
void print() {}
template <typename F, typename... R> void print(F f, R... r) {
out(f), indent(), print(r...);
}
// コンテナの値を全て標準出力
#define printv(v) \
each(i, v) out(i), space(); \
indent()
// デバッグ用のヘッダをエラー出力
#define debughead(x) cerr << "Line " << __LINE__ << ": " << #x << ": "
// デバッグ用の値をエラー出力
#define debugout(x) cerr << (x) << " "
// デバッグ用の改行をエラー出力
#define debugindent() cerr << '\n'
// デバッグ出力
#define debug(x) debughead(x), debugout(x), debugindent()
// YES or NO を標準出力
#define YN(x) out((x) ? "YES" : "NO"), indent()
// Yes or No を標準出力
#define Yn(x) out((x) ? "Yes" : "No"), indent()
// yes or no を標準出力
#define yn(x) out((x) ? "yes" : "no"), indent()
/* 定数 */
const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const ll LIMIT = 100001;
const ll S_LIMIT = 101;
const ld EPS = 1e-15;
const ld PI = acos(-1);
const ll dx[] = {0, 0, 1, 0, -1, -1, 1, 1, -1};
const ll dy[] = {0, -1, 0, 1, 0, -1, -1, 1, 1};
const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
/* 基本アルゴリズム */
// 最大公約数
#define gcd __gcd
// 最小公倍数
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
// ワーシャルフロイド用配列
ll g[S_LIMIT][S_LIMIT] = {};
// DP用配列
// ll dp[LIMIT][LIMIT] = {};
// MOD対応累乗
ll modpow(ll x, ll n) {
return n < 2 ? x : modpow(x * x, n / 2) * (n % 2 ? x : 1) % MOD;
}
// MOD対応階乗
ll modfact(ll n) { return n < 2 ? 1 : modfact(n - 1) * n % MOD; }
// MOD対応コンビネーション
ll modcomb(ll n, ll r) {
return modfact(n) * modpow(modfact(r), MOD - 2) % MOD *
modpow(modfact(n - r), MOD - 2) % MOD;
}
// aをmax(a,b)にする
template <typename T> bool chmax(T &a, T b) { return (a = max(a, b)) == b; }
// aをmin(a,b)にする
template <typename T> bool chmin(T &a, T b) { return (a = min(a, b)) == b; }
// 階乗
ll factorial(ll a) { return a < 2 ? 1 : factorial(a - 1) * a; }
// 1～aの総和
ll summation(ll a) { return a < 1 ? 0 : (a * a + a) / 2; }
// コンビネーション
ll combination(ll n, ll r) {
ll res = 1;
rep(i, 1, r + 1) { res *= n--, res /= i; }
return res;
}
// 素数判定
bool isPrime(ll n) {
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
if (!(n % i)) {
return false;
}
}
return true;
}
// ワーシャルフロイド
void warshall(int n) {
rep(i, n) {
rep(j, n) {
rep(k, n) { chmin(g[j][k], g[j][i] + g[i][k]); }
}
}
}
// 約数列挙
vector<int> divisor(int n) {
vector<int> ans;
rep(i, 1, sqrt(n) + 1) {
if (!(n % i)) {
ans.push_back(i);
if (i * i < n) {
ans.push_back(n / i);
}
}
}
return ans;
}
// 素因数分解
map<int, int> factorization(int n) {
map<int, int> ans;
rep(i, 2, sqrt(n) + 1) {
if (i > 3) {
i++;
}
while (!(n % i)) {
ans[i]++, n /= i;
}
}
if (n > 1) {
ans[n]++;
}
return ans;
}
// Union-Find
struct UF {
vector<int> t;
UF(int size) : t(size, -1) {}
int root(int x) { return t[x] < 0 ? x : t[x] = root(t[x]); }
int size(int x) { return -t[root(x)]; }
bool isSame(int x, int y) { return root(x) == root(y); }
bool unite(int x, int y) {
x = root(x), y = root(y);
if (x != y) {
if (t[y] < t[x]) {
swap(x, y);
}
t[x] += t[y], t[y] = x;
}
return x != y;
}
};
ll n, m, k, tmp, res = 0;
string s, t;
int main() {
INIT;
in(n);
int c[10][10];
rep(i, 10) rep(j, 10) c[i][j] = 0;
rep(k, 1, n + 1) {
int begin = k / pow(10, (int)floor(log10(k)));
int end = k % 10;
// printf("value=%lld, begin=%d, end=%d\n", k, begin, end);
// c[i][j]: 「k以下で、かつiが最上桁でjが最下桁の整数」の総数
c[begin][end]++;
}
rep(i, 1, 10) {
rep(j, 10) { res += c[i][j] * c[j][i]; }
}
print(res);
return 0;
}
| replace | 226 | 239 | 226 | 233 | TLE | |
p02792 | C++ | Runtime Error | /*
Name:
Author: xiaruize
Date:
*/
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define ll long long
#define form(i, j, n) for (int i = int(j); i <= int(n); i++)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define pis pair<int, string>
#define sec second
inline ll read() {
ll f = 1, x = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int f[20][20];
int num[20];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
int n;
n = read();
int x;
form(i, 1, n) {
x = i;
while (x >= 10) {
x /= 10;
}
num[i] = x;
f[x][i % 10]++;
}
int ans = 0;
form(i, 1, n) { ans += f[i % 10][num[i]]; }
cout << ans << endl;
return 0;
} | /*
Name:
Author: xiaruize
Date:
*/
#include <bits/stdc++.h>
using namespace std;
#define forn(i, n) for (int i = 0; i < int(n); i++)
#define ll long long
#define form(i, j, n) for (int i = int(j); i <= int(n); i++)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define pis pair<int, string>
#define sec second
inline ll read() {
ll f = 1, x = 0;
char ch = getchar();
while (!isdigit(ch)) {
if (ch == '-')
f = -1;
ch = getchar();
}
while (isdigit(ch)) {
x = x * 10 + ch - '0';
ch = getchar();
}
return x * f;
}
int f[20][20];
int num[200000];
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
// freopen(".in","r",stdin);
// freopen(".out","w",stdout);
int n;
n = read();
int x;
form(i, 1, n) {
x = i;
while (x >= 10) {
x /= 10;
}
num[i] = x;
f[x][i % 10]++;
}
int ans = 0;
form(i, 1, n) { ans += f[i % 10][num[i]]; }
cout << ans << endl;
return 0;
} | replace | 34 | 35 | 34 | 35 | 0 | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
const ll INF = 1e18;
ll int aditya(ll int x) {
while (x / 10 > 0) {
x /= 10;
}
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ll int c[10][10];
memset(c, 0, sizeof(c));
ll int n, i, j, res = 0;
cin >> n;
for (i = 1; i <= n; i++) {
c[aditya(i)][i % 10]++;
}
for (i = 0; i < 10; i++) {
for (j = 0; j < 10; j++) {
res += c[i][j] * c[j][i];
}
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define mod 1000000007
using namespace std;
const ll INF = 1e18;
ll int aditya(ll int x) {
while (x / 10 > 0) {
x /= 10;
}
return x;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
ll int c[10][10];
memset(c, 0, sizeof(c));
ll int n, i, j, res = 0;
cin >> n;
for (i = 1; i <= n; i++) {
c[aditya(i)][i % 10]++;
}
for (i = 0; i < 10; i++) {
for (j = 0; j < 10; j++) {
res += c[i][j] * c[j][i];
}
}
cout << res << endl;
return 0;
} | delete | 17 | 21 | 17 | 17 | 0 | |
p02792 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define I_MAX 2147483647
#define LL_MAX 9223372036854775807
#define ll long long
#define ld long double
struct XX {
int t;
int p;
};
class xxGreater {
public:
bool operator()(const XX &riLeft, const XX &riRight) const {
// 第2条件
if ((riLeft.t) == (riRight.t)) {
return riLeft.p <
riRight.p; //<:昇順(小さいものから順番)、>:降順(大きいものから順番)
// プライオリティキューの場合は > で、top()すると値の小さいものがとれる
}
// 第1条件
return (riLeft.t) < (riRight.t);
}
};
// map<long long,long long> prime_f(long long n){
// map<long long,long long>res;
// for(int i=2;i*i<=n;i++){
// while(n%i==0){
// ++res[i];
// n/=i;
// }
// }
// if(n!=1)res[n]=1;
// return res;
// }
// int n;
////int dat[2*10000000];
////int dat2[2*10000000];
// int dat[10];
// int dat2[10];
//
// void init(int n_){
// n=1;
// while(n<n_)n*=2;
// for(int i=0;i<2*n-1;i++){
// dat[i]=0;
// dat2[i]=0;
// }
// }
//
// void initset(int k,int a){
// k+=n-1;
// dat[k]=a;
// while(k>0){
// k=(k-1)/2;
// dat[k]=dat[k*2+1]+dat[k*2+2];
// }
// }
//
////[a,b)の間を[l,r]区間で比較しアップデート
////引数のindexに注意
////nは固定。initで計算すみ
////update2(L[i],R[i]+1,0,0,n,D[i]);
// void update2(int a,int b,int k,int l,int r,int v){//v更新値、区間は0-index
// if(r<=a || b<=l)return;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=v*(r-l);
// return;
// }else{
// update2(a,b,k*2+1,l,(l+r)/2,v);
// update2(a,b,k*2+2,(l+r)/2,r,v);
// return;
// }
// }
//
// int query(int a,int b,int k,int l,int r){
// if(r<=a || b<=l)return 0;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=0;
// return dat[k];
// }
// else{
// int vl=query(a,b,k*2+1,l,(l+r)/2);
// int vr=query(a,b,k*2+2,(l+r)/2,r);
// return vl+vr;
// }
// }
// void printb(unsigned int v) {
// unsigned int mask = (int)1 << (sizeof(v) * CHAR_BIT - 1);
// do putchar(mask & v ? '1' : '0');
// while (mask >>= 1);
// }
#ifdef DEBUG
#else
#endif
int ans[10][10];
int main(int argc, const char *argv[]) {
// scanf("%s",S);
// scanf("%d",&N);
// scanf("%lld %lld",&target1,&target2);
// sscanf(tmp.c_str(),"%dd%d%d",&time[i], &dice[i], &z[i]);
// getline(cin, target);
// ifstream ifs("01");//テスト用
// ifs >> a;
// ここから
// 入力高速化
ios::sync_with_stdio(false);
cin.tie(0);
int NN;
cin >> NN;
string N = to_string(NN);
for (int p = 1; p <= 9; p++) { // 2桁以上
for (int q = 1; q <= 9; q++) {
int tmp = 0;
int lim = (int)N.size() - 2;
for (int i = 0; i <= lim; i++) {
if (i == N.size() - 2) {
if (p == N[0] - '0') {
int sumi = 0;
for (int j = 1; j < N.size() - 1; j++) {
int tmp = N[j] - '0';
sumi = sumi * 10 + tmp;
}
if (q > N[N.size() - 1] - '0') {
tmp += sumi;
} else {
tmp += sumi + 1;
}
} else if (p < N[0] - '0') {
tmp += pow(10, i);
}
} else {
tmp += pow(10, i);
}
}
ans[p][q] = tmp;
}
}
for (int i = 1; i <= NN; i++) {
ans[i][i]++;
}
int ans2 = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
ans2 += ans[i][j] * ans[j][i];
}
}
cout << ans2 << endl;
map<pair<int, int>, int> m;
for (int i = 1; i <= NN; i++) {
string tmp = to_string(i);
pair<int, int> p = make_pair(tmp[0] - '0', tmp[tmp.size() - 1] - '0');
m[p]++;
}
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
if (ans[i][j] != m[make_pair(i, j)]) {
// cout << i<<" " <<j << endl;
// cout << ans[i][j]<<" " <<m[make_pair(i,j)] << endl;
}
}
}
// ここまで
// cout << "ans" << endl;
// cout << " " << "ans" << endl;
// printf("%.0f\n",ans);//小数点以下表示なし
// printf("%.7f\n",p);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define I_MAX 2147483647
#define LL_MAX 9223372036854775807
#define ll long long
#define ld long double
struct XX {
int t;
int p;
};
class xxGreater {
public:
bool operator()(const XX &riLeft, const XX &riRight) const {
// 第2条件
if ((riLeft.t) == (riRight.t)) {
return riLeft.p <
riRight.p; //<:昇順(小さいものから順番)、>:降順(大きいものから順番)
// プライオリティキューの場合は > で、top()すると値の小さいものがとれる
}
// 第1条件
return (riLeft.t) < (riRight.t);
}
};
// map<long long,long long> prime_f(long long n){
// map<long long,long long>res;
// for(int i=2;i*i<=n;i++){
// while(n%i==0){
// ++res[i];
// n/=i;
// }
// }
// if(n!=1)res[n]=1;
// return res;
// }
// int n;
////int dat[2*10000000];
////int dat2[2*10000000];
// int dat[10];
// int dat2[10];
//
// void init(int n_){
// n=1;
// while(n<n_)n*=2;
// for(int i=0;i<2*n-1;i++){
// dat[i]=0;
// dat2[i]=0;
// }
// }
//
// void initset(int k,int a){
// k+=n-1;
// dat[k]=a;
// while(k>0){
// k=(k-1)/2;
// dat[k]=dat[k*2+1]+dat[k*2+2];
// }
// }
//
////[a,b)の間を[l,r]区間で比較しアップデート
////引数のindexに注意
////nは固定。initで計算すみ
////update2(L[i],R[i]+1,0,0,n,D[i]);
// void update2(int a,int b,int k,int l,int r,int v){//v更新値、区間は0-index
// if(r<=a || b<=l)return;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=v*(r-l);
// return;
// }else{
// update2(a,b,k*2+1,l,(l+r)/2,v);
// update2(a,b,k*2+2,(l+r)/2,r,v);
// return;
// }
// }
//
// int query(int a,int b,int k,int l,int r){
// if(r<=a || b<=l)return 0;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=0;
// return dat[k];
// }
// else{
// int vl=query(a,b,k*2+1,l,(l+r)/2);
// int vr=query(a,b,k*2+2,(l+r)/2,r);
// return vl+vr;
// }
// }
// void printb(unsigned int v) {
// unsigned int mask = (int)1 << (sizeof(v) * CHAR_BIT - 1);
// do putchar(mask & v ? '1' : '0');
// while (mask >>= 1);
// }
#ifdef DEBUG
#else
#endif
int ans[10][10];
int main(int argc, const char *argv[]) {
// scanf("%s",S);
// scanf("%d",&N);
// scanf("%lld %lld",&target1,&target2);
// sscanf(tmp.c_str(),"%dd%d%d",&time[i], &dice[i], &z[i]);
// getline(cin, target);
// ifstream ifs("01");//テスト用
// ifs >> a;
// ここから
// 入力高速化
ios::sync_with_stdio(false);
cin.tie(0);
int NN;
cin >> NN;
string N = to_string(NN);
for (int p = 1; p <= 9; p++) { // 2桁以上
for (int q = 1; q <= 9; q++) {
int tmp = 0;
int lim = (int)N.size() - 2;
for (int i = 0; i <= lim; i++) {
if (i == N.size() - 2) {
if (p == N[0] - '0') {
int sumi = 0;
for (int j = 1; j < N.size() - 1; j++) {
int tmp = N[j] - '0';
sumi = sumi * 10 + tmp;
}
if (q > N[N.size() - 1] - '0') {
tmp += sumi;
} else {
tmp += sumi + 1;
}
} else if (p < N[0] - '0') {
tmp += pow(10, i);
}
} else {
tmp += pow(10, i);
}
}
ans[p][q] = tmp;
}
}
for (int i = 1; i <= min(NN, 9); i++) {
ans[i][i]++;
}
int ans2 = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
ans2 += ans[i][j] * ans[j][i];
}
}
cout << ans2 << endl;
map<pair<int, int>, int> m;
for (int i = 1; i <= NN; i++) {
string tmp = to_string(i);
pair<int, int> p = make_pair(tmp[0] - '0', tmp[tmp.size() - 1] - '0');
m[p]++;
}
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
if (ans[i][j] != m[make_pair(i, j)]) {
// cout << i<<" " <<j << endl;
// cout << ans[i][j]<<" " <<m[make_pair(i,j)] << endl;
}
}
}
// ここまで
// cout << "ans" << endl;
// cout << " " << "ans" << endl;
// printf("%.0f\n",ans);//小数点以下表示なし
// printf("%.7f\n",p);
return 0;
}
| replace | 177 | 178 | 177 | 178 | 0 | |
p02792 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define I_MAX 2147483647
#define LL_MAX 9223372036854775807
#define ll long long
#define ld long double
struct XX {
int t;
int p;
};
class xxGreater {
public:
bool operator()(const XX &riLeft, const XX &riRight) const {
// 第2条件
if ((riLeft.t) == (riRight.t)) {
return riLeft.p <
riRight.p; //<:昇順(小さいものから順番)、>:降順(大きいものから順番)
// プライオリティキューの場合は > で、top()すると値の小さいものがとれる
}
// 第1条件
return (riLeft.t) < (riRight.t);
}
};
// map<long long,long long> prime_f(long long n){
// map<long long,long long>res;
// for(int i=2;i*i<=n;i++){
// while(n%i==0){
// ++res[i];
// n/=i;
// }
// }
// if(n!=1)res[n]=1;
// return res;
// }
// int n;
////int dat[2*10000000];
////int dat2[2*10000000];
// int dat[10];
// int dat2[10];
//
// void init(int n_){
// n=1;
// while(n<n_)n*=2;
// for(int i=0;i<2*n-1;i++){
// dat[i]=0;
// dat2[i]=0;
// }
// }
//
// void initset(int k,int a){
// k+=n-1;
// dat[k]=a;
// while(k>0){
// k=(k-1)/2;
// dat[k]=dat[k*2+1]+dat[k*2+2];
// }
// }
//
////[a,b)の間を[l,r]区間で比較しアップデート
////引数のindexに注意
////nは固定。initで計算すみ
////update2(L[i],R[i]+1,0,0,n,D[i]);
// void update2(int a,int b,int k,int l,int r,int v){//v更新値、区間は0-index
// if(r<=a || b<=l)return;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=v*(r-l);
// return;
// }else{
// update2(a,b,k*2+1,l,(l+r)/2,v);
// update2(a,b,k*2+2,(l+r)/2,r,v);
// return;
// }
// }
//
// int query(int a,int b,int k,int l,int r){
// if(r<=a || b<=l)return 0;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=0;
// return dat[k];
// }
// else{
// int vl=query(a,b,k*2+1,l,(l+r)/2);
// int vr=query(a,b,k*2+2,(l+r)/2,r);
// return vl+vr;
// }
// }
// void printb(unsigned int v) {
// unsigned int mask = (int)1 << (sizeof(v) * CHAR_BIT - 1);
// do putchar(mask & v ? '1' : '0');
// while (mask >>= 1);
// }
#ifdef DEBUG
#else
#endif
int ans[10][10];
int main(int argc, const char *argv[]) {
// scanf("%s",S);
// scanf("%d",&N);
// scanf("%lld %lld",&target1,&target2);
// sscanf(tmp.c_str(),"%dd%d%d",&time[i], &dice[i], &z[i]);
// getline(cin, target);
// ifstream ifs("01");//テスト用
// ifs >> a;
// ここから
// 入力高速化
ios::sync_with_stdio(false);
cin.tie(0);
int NN;
cin >> NN;
string N = to_string(NN);
for (int p = 1; p <= N[0] - '0'; p++) { // 2桁以上
for (int q = 1; q <= 9; q++) {
int tmp = 0;
for (int i = 0; i <= N.size() - 2; i++) {
if (i == N.size() - 2 && p == N[0] - '0') {
if (q > N[N.size() - 1] - '0') {
continue;
}
int sumi = 0;
for (int j = 1; j < N.size() - 1; j++) {
int tmp = N[j] - '0';
sumi = sumi * 10 + tmp;
}
tmp += sumi + 1;
} else {
tmp += pow(10, i);
}
}
ans[p][q] = tmp;
}
}
map<pair<int, int>, int> m;
for (int i = 1; i <= NN; i++) {
string tmp = to_string(i);
pair<int, int> p = make_pair(tmp[0] - '0', tmp[tmp.size() - 1] - '0');
m[p]++;
}
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
if (ans[i][j] != m[make_pair(i, j)]) {
// cout << i<<" " <<j << endl;
// cout << ans[i][j]<<" " <<m[make_pair(i,j)] << endl;
}
}
}
int ans2 = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
ans2 += m[make_pair(i, j)] * m[make_pair(j, i)];
}
}
cout << ans2 << endl;
// ここまで
// cout << "ans" << endl;
// cout << " " << "ans" << endl;
// printf("%.0f\n",ans);//小数点以下表示なし
// printf("%.7f\n",p);
return 0;
}
| #include <algorithm>
#include <cmath>
#include <fstream>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <string>
#include <vector>
using namespace std;
#define I_MAX 2147483647
#define LL_MAX 9223372036854775807
#define ll long long
#define ld long double
struct XX {
int t;
int p;
};
class xxGreater {
public:
bool operator()(const XX &riLeft, const XX &riRight) const {
// 第2条件
if ((riLeft.t) == (riRight.t)) {
return riLeft.p <
riRight.p; //<:昇順(小さいものから順番)、>:降順(大きいものから順番)
// プライオリティキューの場合は > で、top()すると値の小さいものがとれる
}
// 第1条件
return (riLeft.t) < (riRight.t);
}
};
// map<long long,long long> prime_f(long long n){
// map<long long,long long>res;
// for(int i=2;i*i<=n;i++){
// while(n%i==0){
// ++res[i];
// n/=i;
// }
// }
// if(n!=1)res[n]=1;
// return res;
// }
// int n;
////int dat[2*10000000];
////int dat2[2*10000000];
// int dat[10];
// int dat2[10];
//
// void init(int n_){
// n=1;
// while(n<n_)n*=2;
// for(int i=0;i<2*n-1;i++){
// dat[i]=0;
// dat2[i]=0;
// }
// }
//
// void initset(int k,int a){
// k+=n-1;
// dat[k]=a;
// while(k>0){
// k=(k-1)/2;
// dat[k]=dat[k*2+1]+dat[k*2+2];
// }
// }
//
////[a,b)の間を[l,r]区間で比較しアップデート
////引数のindexに注意
////nは固定。initで計算すみ
////update2(L[i],R[i]+1,0,0,n,D[i]);
// void update2(int a,int b,int k,int l,int r,int v){//v更新値、区間は0-index
// if(r<=a || b<=l)return;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=v*(r-l);
// return;
// }else{
// update2(a,b,k*2+1,l,(l+r)/2,v);
// update2(a,b,k*2+2,(l+r)/2,r,v);
// return;
// }
// }
//
// int query(int a,int b,int k,int l,int r){
// if(r<=a || b<=l)return 0;
// if(a<=l && r<=b){
// dat[k]+=dat2[k];
// if(r-l>1){
// dat2[k*2+1]+=dat2[k]/2;
// dat2[k*2+1]+=dat2[k]/2;
// }
// dat2[k]=0;
// return dat[k];
// }
// else{
// int vl=query(a,b,k*2+1,l,(l+r)/2);
// int vr=query(a,b,k*2+2,(l+r)/2,r);
// return vl+vr;
// }
// }
// void printb(unsigned int v) {
// unsigned int mask = (int)1 << (sizeof(v) * CHAR_BIT - 1);
// do putchar(mask & v ? '1' : '0');
// while (mask >>= 1);
// }
#ifdef DEBUG
#else
#endif
int ans[10][10];
int main(int argc, const char *argv[]) {
// scanf("%s",S);
// scanf("%d",&N);
// scanf("%lld %lld",&target1,&target2);
// sscanf(tmp.c_str(),"%dd%d%d",&time[i], &dice[i], &z[i]);
// getline(cin, target);
// ifstream ifs("01");//テスト用
// ifs >> a;
// ここから
// 入力高速化
ios::sync_with_stdio(false);
cin.tie(0);
int NN;
cin >> NN;
string N = to_string(NN);
// for(int p=1;p<=N[0]-'0';p++){//2桁以上
// for(int q=1;q<=9;q++){
// int tmp=0;
// for(int i=0;i<=N.size()-2;i++){
// if(i==N.size()-2&&p==N[0]-'0'){
// if(q>N[N.size()-1]-'0'){
// continue;
// }
// int sumi=0;
// for(int j=1;j<N.size()-1;j++){
// int tmp=N[j]-'0';
// sumi=sumi*10+tmp;
// }
// tmp+=sumi+1;
// }else{
// tmp+=pow(10,i);
// }
// }
// ans[p][q]=tmp;
// }
// }
//
map<pair<int, int>, int> m;
for (int i = 1; i <= NN; i++) {
string tmp = to_string(i);
pair<int, int> p = make_pair(tmp[0] - '0', tmp[tmp.size() - 1] - '0');
m[p]++;
}
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
if (ans[i][j] != m[make_pair(i, j)]) {
// cout << i<<" " <<j << endl;
// cout << ans[i][j]<<" " <<m[make_pair(i,j)] << endl;
}
}
}
int ans2 = 0;
for (int i = 1; i <= 9; i++) {
for (int j = 1; j <= 9; j++) {
ans2 += m[make_pair(i, j)] * m[make_pair(j, i)];
}
}
cout << ans2 << endl;
// ここまで
// cout << "ans" << endl;
// cout << " " << "ans" << endl;
// printf("%.0f\n",ans);//小数点以下表示なし
// printf("%.7f\n",p);
return 0;
}
| replace | 150 | 171 | 150 | 172 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
ull firstDigit(ull n) {
while (n >= 10)
n /= 10;
return n;
}
int lastDigit(int n) { return (n % 10); }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<vector<ull>> arr = vector<vector<ull>>(n + 1, vector<ull>(n + 1, 0));
for (int i = 1; i <= n; i++) {
arr[firstDigit(i)][lastDigit(i)]++;
}
unsigned long long sum = 0;
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
sum += arr[i + 1][j + 1] * arr[j + 1][i + 1];
}
}
cout << sum;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
ull firstDigit(ull n) {
while (n >= 10)
n /= 10;
return n;
}
int lastDigit(int n) { return (n % 10); }
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n;
cin >> n;
vector<vector<ull>> arr = vector<vector<ull>>(10, vector<ull>(10, 0));
for (int i = 1; i <= n; i++) {
arr[firstDigit(i)][lastDigit(i)]++;
}
unsigned long long sum = 0;
for (int i = 0; i < 9; i++) {
for (int j = 0; j < 9; j++) {
sum += arr[i + 1][j + 1] * arr[j + 1][i + 1];
}
}
cout << sum;
return 0;
} | replace | 20 | 21 | 20 | 21 | 0 | |
p02792 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
#define FOR(i, a, b) for (lint i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define yes "Yes"
#define no "No"
#define divs 1000000007
#define dive 1000000009
typedef pair<int, int> P;
lint ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> memo(9);
REP(i, 9) {
REP(j, 9) { memo[i].push_back(0); }
}
REP(i, n) {
string s = to_string(i + 1);
int a = ctoi(s[0]);
int b = ctoi(s[s.length() - 1]);
memo[a - 1][b - 1]++;
}
lint ans = 0;
REP(i, 9) {
REP(j, 9) { ans += memo[i][j] * memo[j][i]; }
}
print(ans);
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define sp(x) cout << setprecision(x);
#define all(a) (a).begin(), (a).end()
#define inf 10000000
#define linf INT64_MAX * 0.99
#define print(s) cout << (s) << endl
#define lint long long
#define FOR(i, a, b) for (lint i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define yes "Yes"
#define no "No"
#define divs 1000000007
#define dive 1000000009
typedef pair<int, int> P;
lint ctoi(char c) {
if (c >= '0' && c <= '9') {
return c - '0';
}
return 0;
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<vector<int>> memo(9);
REP(i, 9) {
REP(j, 9) { memo[i].push_back(0); }
}
REP(i, n) {
string s = to_string(i + 1);
int a = ctoi(s[0]);
int b = ctoi(s[s.length() - 1]);
if (b == 0)
continue;
memo[a - 1][b - 1]++;
}
lint ans = 0;
REP(i, 9) {
REP(j, 9) { ans += memo[i][j] * memo[j][i]; }
}
print(ans);
return 0;
} | insert | 39 | 39 | 39 | 41 | -6 | double free or corruption (out)
|
p02792 | C++ | Time Limit Exceeded | // 5/14
// 過去問ガリガリ
#include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dp[10][10];
int main() {
int N;
cin >> N;
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
dp[i][j] = 0;
for (int k = 1; k <= N; k++) {
string str = to_string(k);
if (str[0] - '0' == i && str[str.size() - 1] - '0' == j) {
dp[i][j] += 1;
}
}
}
}
int ans = 0;
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
ans += dp[i][j] * dp[j][i];
}
}
cout << ans << endl;
}
| // 5/14
// 過去問ガリガリ
#include <bits/stdc++.h>
#include <string>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
using Graph = vector<vector<int>>;
int dp[10][10];
int main() {
int N;
cin >> N;
memset(dp, 0, sizeof(dp));
// for (int i = 1; i < 10; i++) {
// for (int j = 1; j < 10; j++) {
// dp[i][j] = 0;
// for (int k = 1; k <= N; k++) {
// string str = to_string(k);
// if (str[0] - '0' == i && str[str.size() - 1] - '0' == j) {
// dp[i][j] += 1;
// }
// }
// }
// }
for (int k = 1; k <= N; k++) {
string str = to_string(k);
int i = str[0] - '0';
int j = str[str.size() - 1] - '0';
dp[i][j]++;
}
int ans = 0;
for (int i = 1; i < 10; i++) {
for (int j = 1; j < 10; j++) {
ans += dp[i][j] * dp[j][i];
}
}
cout << ans << endl;
}
| replace | 16 | 26 | 16 | 35 | TLE | |
p02792 | C++ | Runtime Error | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m - 1; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define FILL2D(A, c) fill(A[0], A[0] + sizeof(A) / sizeof(**A), c)
#define FILL3D(A, c) fill(A[0][0], A[0][0] + sizeof(A) / sizeof(***A), c)
// vector<vector<要素の型>> 変数名(要素数1, vector<要素の型>(要素数2, 初期値))
// vector<intなど> 変数名(要素数,初期値)
using namespace std;
typedef long long ll;
typedef long double ld;
const int MAX = 510000;
const int INF = 2000000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// gcd,lcmセット
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int pow_kai(int a, int n) { // aのn乗を計算します。
int x = 1;
while (n > 0) { // 全てのbitが捨てられるまで。
if (n & 1) { // 1番右のbitが1のとき。
x = x * a;
}
a = a * a;
n >>= 1; // bit全体を右に1つシフトして一番右を捨てる。
}
return x;
}
// a^n mod を計算する
long long modPow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
ll modInv(ll a, ll mod) { return modPow(a, mod - 2, mod); }
// combinationのテーブルを作る前処理
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;
}
}
// 二項係数計算
bool isPrime(ll x) {
int i;
if (x < 2)
return false;
else if (x == 2)
return true;
if (x % 2 == 0)
return false;
for (i = 3; i * i <= x; i += 2)
if (x % i == 0)
return false;
return true;
}
// dfsではvector<vector<int>> g(n);で◎
int main() {
// COMinit();
// string a,b;
ll n;
cin >> n;
ll t[10][10] = {0};
ll cnt = 0;
for (ll k = 1; k <= n; k++) {
int e = k % 10;
int f = k;
while (f > 10)
f /= 10;
t[f][e]++;
}
/*REP(j,10){
REP(i,10){
cout<<t[j][i]<<" ";
}
cout<<endl;
}*/
for (int i = 1; i < 10; i++)
for (int j = 1; j < 10; j++)
cnt += t[i][j] * t[j][i];
// 答え出力パート
cout << cnt << endl;
} | #include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m - 1; i < n; i++)
#define ALL(v) v.begin(), v.end()
#define chmax(x, y) (x = max(x, y))
#define chmin(x, y) (x = min(x, y))
#define FILL2D(A, c) fill(A[0], A[0] + sizeof(A) / sizeof(**A), c)
#define FILL3D(A, c) fill(A[0][0], A[0][0] + sizeof(A) / sizeof(***A), c)
// vector<vector<要素の型>> 変数名(要素数1, vector<要素の型>(要素数2, 初期値))
// vector<intなど> 変数名(要素数,初期値)
using namespace std;
typedef long long ll;
typedef long double ld;
const int MAX = 510000;
const int INF = 2000000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// gcd,lcmセット
ll gcd(ll a, ll b) {
if (a % b == 0)
return b;
else
return gcd(b, a % b);
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
int pow_kai(int a, int n) { // aのn乗を計算します。
int x = 1;
while (n > 0) { // 全てのbitが捨てられるまで。
if (n & 1) { // 1番右のbitが1のとき。
x = x * a;
}
a = a * a;
n >>= 1; // bit全体を右に1つシフトして一番右を捨てる。
}
return x;
}
// a^n mod を計算する
long long modPow(long long a, long long n, long long mod) {
long long res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
// a^{-1} mod を計算する
ll modInv(ll a, ll mod) { return modPow(a, mod - 2, mod); }
// combinationのテーブルを作る前処理
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;
}
}
// 二項係数計算
bool isPrime(ll x) {
int i;
if (x < 2)
return false;
else if (x == 2)
return true;
if (x % 2 == 0)
return false;
for (i = 3; i * i <= x; i += 2)
if (x % i == 0)
return false;
return true;
}
// dfsではvector<vector<int>> g(n);で◎
int main() {
// COMinit();
// string a,b;
ll n;
cin >> n;
ll t[10][10] = {0};
ll cnt = 0;
for (ll k = 1; k <= n; k++) {
int e = k % 10;
int f = k;
while (f > 9)
f /= 10;
t[f][e]++;
}
/*REP(j,10){
REP(i,10){
cout<<t[j][i]<<" ";
}
cout<<endl;
}*/
for (int i = 1; i < 10; i++)
for (int j = 1; j < 10; j++)
cnt += t[i][j] * t[j][i];
// 答え出力パート
cout << cnt << endl;
} | replace | 89 | 90 | 89 | 90 | 0 | |
p02792 | C++ | Runtime Error | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define ll long long
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int_INF 2147483647
#define pint_INF 2000000000
#define ll_INF 9223372036854775807
#define MOD 100000007
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
using namespace std;
ll M = MOD;
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
int main() {
int N;
cin >> N;
ll cnt = 0;
for (int i = 1; i <= N; i++) {
string s = to_string(i);
string t = "";
if (i % 10 == 0) {
// cout << i << " " << cnt << endl;
continue;
}
t.push_back(s[s.size() - 1]);
t.push_back(s[0]);
if (s[0] == s[s.size() - 1]) {
cnt++;
}
while (t.size() < to_string(N).size()) {
cnt += mpow(10, t.size() - 2);
t.insert(1, "0");
}
// tの桁数 == Nの桁数
if (stoi(t) > N) {
// cout << i<< " " << cnt << endl;
continue;
}
// このとき t <= N
// 先頭の桁で場合分け
if (t[0] < to_string(N)[0]) {
cnt += mpow(10, t.size() - 2);
} else { // 先頭の値が同じ
if (t[t.size() - 1] <= to_string(N)[to_string(N).size() - 1]) {
// tの末尾がNの末尾未満->10のpowerでよい
// t = 1003 N = 1xx4,11xx3
ll temp = stoi(to_string(N).substr(1, to_string(N).size() - 2));
cnt += temp + 1;
} else {
// t = 1003 N = 1xx2
ll temp = stoi(to_string(N).substr(1, to_string(N).size() - 2));
cnt += temp;
}
}
// cout << i << " " << cnt << endl;
}
cout << cnt << endl;
}
| #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <limits>
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
#define ll long long
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define int_INF 2147483647
#define pint_INF 2000000000
#define ll_INF 9223372036854775807
#define MOD 100000007
#define vi vector<int>
#define vvi vector<vector<int>>
#define vll vector<long long>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
using namespace std;
ll M = MOD;
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % M;
x = x * x % M;
n = n >> 1;
}
return ans;
}
int main() {
int N;
cin >> N;
ll cnt = 0;
for (int i = 1; i <= N; i++) {
string s = to_string(i);
string t = "";
if (i % 10 == 0) {
// cout << i << " " << cnt << endl;
continue;
}
t.push_back(s[s.size() - 1]);
t.push_back(s[0]);
if (s[0] == s[s.size() - 1]) {
cnt++;
}
while (t.size() < to_string(N).size()) {
cnt += mpow(10, t.size() - 2);
t.insert(1, "0");
}
// tの桁数 == Nの桁数
if (stoi(t) > N) {
// cout << i<< " " << cnt << endl;
continue;
}
// このとき t <= N
// 先頭の桁で場合分け
if (t[0] < to_string(N)[0]) {
cnt += mpow(10, t.size() - 2);
} else { // 先頭の値が同じ
if (t[t.size() - 1] <= to_string(N)[to_string(N).size() - 1]) {
// tの末尾がNの末尾未満->10のpowerでよい
// t = 1003 N = 1xx4,11xx3
ll temp = 0;
if (to_string(N).size() > 2) {
temp += stoi(to_string(N).substr(1, to_string(N).size() - 2));
}
cnt += temp + 1;
} else {
// t = 1003 N = 1xx2
ll temp = stoi(to_string(N).substr(1, to_string(N).size() - 2));
cnt += temp;
}
}
// cout << i << " " << cnt << endl;
}
cout << cnt << endl;
}
| replace | 82 | 83 | 82 | 86 | -6 | terminate called after throwing an instance of 'std::invalid_argument'
what(): stoi
|
p02792 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define trace1(a) cout << #a << ": " << a << endl
#define trace2(a, b) cout << #a << ": " << a << " | ", trace1(b)
#define trace3(a, b, c) cout << #a << ": " << a << " | ", trace2(b, c)
#define trace4(a, b, c, d) cout << #a << ": " << a << " | ", trace3(b, c, d)
#define trace5(a, b, c, d, e) \
cout << #a << ": " << a << " | ", trace4(b, c, d, e)
#define trace6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | ", trace5(b, c, d, e, f)
#define trace7(a, b, c, d, e, f, g) \
cout << #a << ": " << a << " | ", trace6(b, c, d, e, f, g)
#define trace8(a, b, c, d, e, f, g, h) \
cout << #a << ": " << a << " | ", trace7(b, c, d, e, f, g, h)
#define trace9(a, b, c, d, e, f, g, h, i) \
cout << #a << ": " << a << " | ", trace8(b, c, d, e, f, g, h, i)
#define trace10(a, b, c, d, e, f, g, h, i, j) \
cout << #a << ": " << a << " | ", trace9(b, c, d, e, f, g, h, i, j)
#define rep(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define reps(i, a, b, c) for (int(i) = (int)(a); (i) < (int)(b); (i) += (c))
#define rrep(i, a, b) for (int(i) = (int)(a); (i) >= (int)(b); --(i))
#define rreps(i, a, b, c) for (int(i) = (int)(a); (i) >= (int)(b); (i) -= (c))
#define fore(x, a) for (auto &x : a)
#define foreach(i, a) for (auto i = (a).begin(); i != (a).end(); ++i)
#define rforeach(i, a) for (auto i = (a).rbegin(); i != (a).rend(); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) <= (b))
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define dup(x, y) (((x) + (y)-1) / (y))
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(a) ((long long)(a).size())
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long;
using vi = vector<int>;
using unit = unsigned;
using vl = vector<ll>;
using ull = unsigned long long;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using pil = pair<int, ll>;
using vpil = vector<pil>;
using pli = pair<ll, int>;
using vpli = vector<pli>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
template <class T> string join(const v(T) & v) {
stringstream s;
rep(i, 0, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <class T> istream &operator>>(istream &i, v(T) & v) {
fore(x, v) { i >> v; }
return i;
}
template <class T> ostream &operator<<(ostream &o, const v(T) & v) {
o << "[";
fore(x, v) o << x << ",";
o << "]";
return o;
}
template <class T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << "deq[";
fore(x, v) o << x << ",";
o << "]";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const unordered_set<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T>
ostream &operator<<(ostream &o, const unordered_multiset<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T1, class T2>
ostream &operator<<(ostream &o, const pair<T1, T2> &p) {
o << "(" << p.fi << "," << p.se << ")";
return o;
}
template <class TK, class TV>
ostream &operator<<(ostream &o, const map<TK, TV> &m) {
o << "{";
fore(x, m) o << x.fi << "=>" << x.se << ",";
o << "}";
return o;
}
template <class TK, class TV>
ostream &operator<<(ostream &o, const unordered_map<TK, TV> &m) {
o << "{";
fore(x, m) o << x.fi << "=>" << x.se << ",";
o << "}";
return o;
}
template <class T> void YES(T c) {
if (c)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> void Yes(T c) {
if (c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> void POSS(T c) {
if (c)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
}
template <class T> void Poss(T c) {
if (c)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, const T &b) {
if (b < a)
a = b;
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = 1001002003;
const ll LINF = 1001002003004005006LL;
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
pii f(int n) {
int a = n % 10;
int b = n;
while (b <= 10)
b /= 10;
return {a, b};
}
void _main() {
int n;
cin >> n;
map<pii, int> m;
ll ans = 0;
rep(i, 1, n + 1)++ m[f(i)];
rep(i, 1, n + 1) {
pii p = f(i);
swap(p.fi, p.se);
ans += m[p];
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#define trace1(a) cout << #a << ": " << a << endl
#define trace2(a, b) cout << #a << ": " << a << " | ", trace1(b)
#define trace3(a, b, c) cout << #a << ": " << a << " | ", trace2(b, c)
#define trace4(a, b, c, d) cout << #a << ": " << a << " | ", trace3(b, c, d)
#define trace5(a, b, c, d, e) \
cout << #a << ": " << a << " | ", trace4(b, c, d, e)
#define trace6(a, b, c, d, e, f) \
cout << #a << ": " << a << " | ", trace5(b, c, d, e, f)
#define trace7(a, b, c, d, e, f, g) \
cout << #a << ": " << a << " | ", trace6(b, c, d, e, f, g)
#define trace8(a, b, c, d, e, f, g, h) \
cout << #a << ": " << a << " | ", trace7(b, c, d, e, f, g, h)
#define trace9(a, b, c, d, e, f, g, h, i) \
cout << #a << ": " << a << " | ", trace8(b, c, d, e, f, g, h, i)
#define trace10(a, b, c, d, e, f, g, h, i, j) \
cout << #a << ": " << a << " | ", trace9(b, c, d, e, f, g, h, i, j)
#define rep(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define reps(i, a, b, c) for (int(i) = (int)(a); (i) < (int)(b); (i) += (c))
#define rrep(i, a, b) for (int(i) = (int)(a); (i) >= (int)(b); --(i))
#define rreps(i, a, b, c) for (int(i) = (int)(a); (i) >= (int)(b); (i) -= (c))
#define fore(x, a) for (auto &x : a)
#define foreach(i, a) for (auto i = (a).begin(); i != (a).end(); ++i)
#define rforeach(i, a) for (auto i = (a).rbegin(); i != (a).rend(); ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isin(i, a, b) ((a) <= (i) && (i) <= (b))
#define uni(a) (a).erase(unique(all(a)), (a).end())
#define dup(x, y) (((x) + (y)-1) / (y))
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define sz(a) ((long long)(a).size())
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
using ll = long long;
using vi = vector<int>;
using unit = unsigned;
using vl = vector<ll>;
using ull = unsigned long long;
using vvi = vector<vi>;
using vvl = vector<vl>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using pil = pair<int, ll>;
using vpil = vector<pil>;
using pli = pair<ll, int>;
using vpli = vector<pli>;
using pll = pair<ll, ll>;
using vpll = vector<pll>;
void _main();
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
_main();
}
template <class T> string join(const v(T) & v) {
stringstream s;
rep(i, 0, sz(v)) s << ' ' << v[i];
return s.str().substr(1);
}
template <class T> istream &operator>>(istream &i, v(T) & v) {
fore(x, v) { i >> v; }
return i;
}
template <class T> ostream &operator<<(ostream &o, const v(T) & v) {
o << "[";
fore(x, v) o << x << ",";
o << "]";
return o;
}
template <class T> ostream &operator<<(ostream &o, const deque<T> &v) {
o << "deq[";
fore(x, v) o << x << ",";
o << "]";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const unordered_set<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T>
ostream &operator<<(ostream &o, const unordered_multiset<T> &v) {
o << "{";
fore(x, v) o << x << ",";
o << "}";
return o;
}
template <class T1, class T2>
ostream &operator<<(ostream &o, const pair<T1, T2> &p) {
o << "(" << p.fi << "," << p.se << ")";
return o;
}
template <class TK, class TV>
ostream &operator<<(ostream &o, const map<TK, TV> &m) {
o << "{";
fore(x, m) o << x.fi << "=>" << x.se << ",";
o << "}";
return o;
}
template <class TK, class TV>
ostream &operator<<(ostream &o, const unordered_map<TK, TV> &m) {
o << "{";
fore(x, m) o << x.fi << "=>" << x.se << ",";
o << "}";
return o;
}
template <class T> void YES(T c) {
if (c)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
template <class T> void Yes(T c) {
if (c)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
template <class T> void POSS(T c) {
if (c)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
}
template <class T> void Poss(T c) {
if (c)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
}
template <class T> void chmax(T &a, const T &b) {
if (a < b)
a = b;
}
template <class T> void chmin(T &a, const T &b) {
if (b < a)
a = b;
}
template <class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template <class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = 1001002003;
const ll LINF = 1001002003004005006LL;
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};
pii f(int n) {
int a = n % 10;
int b = n;
while (10 <= b)
b /= 10;
return {a, b};
}
void _main() {
int n;
cin >> n;
map<pii, int> m;
ll ans = 0;
rep(i, 1, n + 1)++ m[f(i)];
rep(i, 1, n + 1) {
pii p = f(i);
swap(p.fi, p.se);
ans += m[p];
}
cout << ans << endl;
}
| replace | 167 | 168 | 167 | 168 | TLE | |
p02792 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll INFL = 1e17;
const int MOD = 1e9 + 7;
P freq(int x) {
int a = x % 10;
int b;
while (x) {
b = x;
b /= 10;
}
return P(a, b);
}
int main() {
int n;
cin >> n;
map<P, int> fr;
for (int i = 1; i <= n; i++) {
P p = freq(i);
fr[p]++;
}
ll ans = 0;
for (int i = 1; i <= n; i++) {
P p = freq(i);
P q(p.second, p.first);
ans += fr[q];
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
typedef pair<int, int> P;
typedef long long ll;
const int INF = 1001001001;
const ll INFL = 1e17;
const int MOD = 1e9 + 7;
P freq(int x) {
int a = x % 10;
int b;
while (x) {
b = x;
x /= 10;
}
return P(a, b);
}
int main() {
int n;
cin >> n;
map<P, int> fr;
for (int i = 1; i <= n; i++) {
P p = freq(i);
fr[p]++;
}
ll ans = 0;
for (int i = 1; i <= n; i++) {
P p = freq(i);
P q(p.second, p.first);
ans += fr[q];
}
cout << ans << endl;
return 0;
} | replace | 14 | 15 | 14 | 15 | TLE | |
p02793 | C++ | Time Limit Exceeded | /**
* @author: Mackenzie
**/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
typedef long long ll;
ll m = 1e9 + 7;
ll mulmod(ll a, ll b) {
ll r = a * b - (ll)((long double)a * b / m + .5) * m;
return r < 0 ? r + m : r;
}
ll expmod(ll b, ll e) {
if (e == 0)
return 1;
if (e & 1)
return mulmod(b, expmod(b, e - 1));
b = expmod(b, e >> 1);
return mulmod(b, b);
}
ll invmod(ll a) { return expmod(a, m - 2); }
ll add(ll a, ll b) {
a += b;
if (a >= m)
a -= m;
return a;
}
ll lcm(ll a, ll b) { return (a * b) / __gcd(a, b); }
int main() {
#ifdef LOCAL
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#else
fastIO;
#endif
int n;
cin >> n;
vector<ll> A(n), B(n);
// ll L = 1;
forn(i, n) cin >> A[i];
map<ll, ll> Fmax;
forn(i, n) {
map<ll, ll> F;
ll cur = A[i];
for (ll j = 2; j <= cur; j++) {
while (cur % j == 0)
F[j]++, cur /= j;
Fmax[j] = max(Fmax[j], F[j]);
}
if (cur > 1)
F[cur]++, Fmax[cur] = max(F[cur], Fmax[cur]);
}
ll L = 1;
for (auto x : Fmax) {
if (x.S != 0) {
L = mulmod(L, expmod(x.F, x.S));
}
}
ll ans = 0;
forn(i, n) { ans = add(ans, mulmod(L, invmod(A[i]))); }
cout << ans << endl;
return 0;
} | /**
* @author: Mackenzie
**/
#include <bits/stdc++.h>
using namespace std;
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x) (int)(x).size()
#define F first
#define S second
#define forn(i, n) for (int i = 0; i < (int)n; i++)
#define pb push_back
#define fastIO ios::sync_with_stdio(0), cin.tie(0)
#define endl '\n'
typedef long long ll;
ll m = 1e9 + 7;
ll mulmod(ll a, ll b) {
ll r = a * b - (ll)((long double)a * b / m + .5) * m;
return r < 0 ? r + m : r;
}
ll expmod(ll b, ll e) {
if (e == 0)
return 1;
if (e & 1)
return mulmod(b, expmod(b, e - 1));
b = expmod(b, e >> 1);
return mulmod(b, b);
}
ll invmod(ll a) { return expmod(a, m - 2); }
ll add(ll a, ll b) {
a += b;
if (a >= m)
a -= m;
return a;
}
ll lcm(ll a, ll b) { return (a * b) / __gcd(a, b); }
int main() {
#ifdef LOCAL
// freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#else
fastIO;
#endif
int n;
cin >> n;
vector<ll> A(n), B(n);
// ll L = 1;
forn(i, n) cin >> A[i];
map<ll, ll> Fmax;
forn(i, n) {
map<ll, ll> F;
ll cur = A[i];
for (ll j = 2; j * j <= cur; j++) {
while (cur % j == 0)
F[j]++, cur /= j;
Fmax[j] = max(Fmax[j], F[j]);
}
if (cur > 1)
F[cur]++, Fmax[cur] = max(F[cur], Fmax[cur]);
}
ll L = 1;
for (auto x : Fmax) {
if (x.S != 0) {
L = mulmod(L, expmod(x.F, x.S));
}
}
ll ans = 0;
forn(i, n) { ans = add(ans, mulmod(L, invmod(A[i]))); }
cout << ans << endl;
return 0;
} | replace | 55 | 56 | 55 | 56 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include "algorithm"
#include "cmath"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
const ll mod = 1e9 + 7;
void decompPrimepair(ll n, vector<pll> &ans) {
ll check = 0;
while (n % 2 == 0) {
check++;
n /= 2;
}
ans.push_back(pll{2, check});
ll m = sqrt(n);
ll i = 3;
while (true) {
if (n == 1) {
break;
}
if (m * m > n) {
ans.push_back(pll{n, 1});
break;
}
if (n % i == 0) {
ll check = 0;
while (n % i == 0) {
check++;
n /= i;
m = sqrt(n);
}
ans.push_back(pll{i, check});
}
i += 2;
}
}
ll power_ll_p(ll a, ll b, ll p) // F_pでのべき
{
if (b > p) {
b %= (p - 1); // 位数p-1
}
if (b == 0) {
return 1;
}
if (b % 2 == 0) {
ll t = power_ll_p(a, b / 2, p);
return t * t % p;
} else {
return a * power_ll_p(a, b - 1, p) % p;
}
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
} else {
ll q = a / b;
ll g = extgcd(b, a - q * b, x, y);
ll z = x - q * y;
x = y;
y = z;
return g;
}
}
// modp逆元
ll inversemod(ll a, ll p) {
ll x, y;
extgcd(a, p, x, y);
x %= p;
if (x < 0) {
x += p;
}
return x;
}
int main() {
int n;
cin >> n;
ll a[10010], copy[10010];
for (int i = 0; i < n; i++) {
cin >> a[i];
copy[i] = a[i];
}
sort(a, a + n);
vector<pll> v(0);
decompPrimepair(a[0], v);
for (int i = 1; i < n; i++) {
int size = v.size();
for (int j = 0; j < size; j++) {
ll check = 0;
ll p = v[j].first;
while (a[i] % p == 0) {
check++;
a[i] /= p;
}
v[j].second = max(check, v[j].second);
}
vector<pll> u(0);
decompPrimepair(a[i], u);
v.insert(v.end(), u.begin(), u.end());
}
ll l = 1;
int size = v.size();
for (int j = 0; j < size; j++) {
l *= power_ll_p(v[j].first, v[j].second, mod);
l %= mod;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += inversemod(copy[i], mod);
ans %= mod;
}
ans *= l;
ans %= mod;
cout << ans << "\n";
} | #include "algorithm"
#include "cmath"
#include "cstring"
#include "iostream"
#include "math.h"
#include "queue"
#include "set"
#include "stack"
#include "string"
#include "vector"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<vector<ll>> mat;
const ll mod = 1e9 + 7;
void decompPrimepair(ll n, vector<pll> &ans) {
ll check = 0;
while (n % 2 == 0) {
check++;
n /= 2;
}
ans.push_back(pll{2, check});
ll m = sqrt(n);
ll i = 3;
while (true) {
if (n == 1) {
break;
}
if (i > m) {
ans.push_back(pll{n, 1});
break;
}
if (n % i == 0) {
ll check = 0;
while (n % i == 0) {
check++;
n /= i;
m = sqrt(n);
}
ans.push_back(pll{i, check});
}
i += 2;
}
}
ll power_ll_p(ll a, ll b, ll p) // F_pでのべき
{
if (b > p) {
b %= (p - 1); // 位数p-1
}
if (b == 0) {
return 1;
}
if (b % 2 == 0) {
ll t = power_ll_p(a, b / 2, p);
return t * t % p;
} else {
return a * power_ll_p(a, b - 1, p) % p;
}
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
} else {
ll q = a / b;
ll g = extgcd(b, a - q * b, x, y);
ll z = x - q * y;
x = y;
y = z;
return g;
}
}
// modp逆元
ll inversemod(ll a, ll p) {
ll x, y;
extgcd(a, p, x, y);
x %= p;
if (x < 0) {
x += p;
}
return x;
}
int main() {
int n;
cin >> n;
ll a[10010], copy[10010];
for (int i = 0; i < n; i++) {
cin >> a[i];
copy[i] = a[i];
}
sort(a, a + n);
vector<pll> v(0);
decompPrimepair(a[0], v);
for (int i = 1; i < n; i++) {
int size = v.size();
for (int j = 0; j < size; j++) {
ll check = 0;
ll p = v[j].first;
while (a[i] % p == 0) {
check++;
a[i] /= p;
}
v[j].second = max(check, v[j].second);
}
vector<pll> u(0);
decompPrimepair(a[i], u);
v.insert(v.end(), u.begin(), u.end());
}
ll l = 1;
int size = v.size();
for (int j = 0; j < size; j++) {
l *= power_ll_p(v[j].first, v[j].second, mod);
l %= mod;
}
ll ans = 0;
for (int i = 0; i < n; i++) {
ans += inversemod(copy[i], mod);
ans %= mod;
}
ans *= l;
ans %= mod;
cout << ans << "\n";
} | replace | 33 | 34 | 33 | 34 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#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};
/**** 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) {
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;
}
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 nCk(ll n, ll k, ll mod) {
ll ans = 1;
for (ll i = n, j = 1; j <= k; i--, j++)
ans = (((ans * i) % mod) * invmod(j, mod)) % mod;
return ans;
}
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; };
/**** 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 ****/
ll lis(ll *a, ll n, ll *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;
vector<ll> a;
ll hikaku = 1;
ll cnt;
ll ans;
map<ll, ll> insu[10000];
map<ll, ll> lcmm;
ll nowlcm = 1;
ll bunkai(ll n, ll index) {
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
insu[index][i]++;
n /= i;
}
}
if (n != 1)
insu[index][n] = 1;
}
int main() {
cin >> n;
for (ll i = 0; i < n; i++) {
ll aa;
cin >> aa;
a.push_back(aa);
}
for (ll i = 0; i < n; i++) {
bunkai(a[i], i);
}
for (ll i = 0; i < n; i++) {
for (auto itr = insu[i].begin(); itr != insu[i].end(); itr++) {
ll fir = itr->first;
ll sec = itr->second;
lcmm[fir] = lmax(sec, lcmm[fir]);
}
}
for (ll i = 0; i < n; i++) {
ll karians = 1;
for (auto itr = lcmm.begin(); itr != lcmm.end(); itr++) {
// cout<<i<<" "<<itr->first<<" "<<itr->second<<"
// "<<insu[i][itr->first]<<endl;
ll fir = itr->first;
ll sec = itr->second;
if (sec - (insu[i][fir]) == 0) {
continue;
}
karians *= RepeatSquaring(fir, (sec - (insu[i][fir])), mod);
karians %= mod;
// cout<<ans<<endl;
}
ans += karians;
ans %= mod;
}
cout << ans << endl;
}
| #include <algorithm>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#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};
/**** 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) {
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;
}
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 nCk(ll n, ll k, ll mod) {
ll ans = 1;
for (ll i = n, j = 1; j <= k; i--, j++)
ans = (((ans * i) % mod) * invmod(j, mod)) % mod;
return ans;
}
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; };
/**** 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 ****/
ll lis(ll *a, ll n, ll *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;
vector<ll> a;
ll hikaku = 1;
ll cnt;
ll ans;
map<ll, ll> insu[10000];
map<ll, ll> lcmm;
ll nowlcm = 1;
ll bunkai(ll n, ll index) {
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
insu[index][i]++;
n /= i;
}
}
if (n != 1)
insu[index][n] = 1;
}
int main() {
cin >> n;
for (ll i = 0; i < n; i++) {
ll aa;
cin >> aa;
a.push_back(aa);
}
for (ll i = 0; i < n; i++) {
bunkai(a[i], i);
}
for (ll i = 0; i < n; i++) {
for (auto itr = insu[i].begin(); itr != insu[i].end(); itr++) {
ll fir = itr->first;
ll sec = itr->second;
lcmm[fir] = lmax(sec, lcmm[fir]);
}
}
ll karians = 1;
for (auto itr = lcmm.begin(); itr != lcmm.end(); itr++) {
// cout<<i<<" "<<itr->first<<" "<<itr->second<<"
// "<<insu[i][itr->first]<<endl;
ll fir = itr->first;
ll sec = itr->second;
karians *= RepeatSquaring(fir, sec, mod);
karians %= mod;
}
for (ll i = 0; i < n; i++) {
ans += (karians * invmod(a[i], mod)) % mod;
ans %= mod;
}
cout << ans << endl;
}
| replace | 244 | 259 | 244 | 256 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define eb emplace_back
#define emp emplace
#define ins insert
#define mp make_pair
#define mt make_tuple
#define sz(s) (int)s.size()
#define forp(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define ren(i, n) for (int i = n - 1; i >= 0; i--)
#define forn(i, a, b) for (int i = a; i >= b; i--)
#define w(t) while (t)
#define sc(a) scanf("%d", &a);
#define on cout << "\n"
#define os cout << " "
#define o2(a, b) cout << a << " " << b
#define o(a) cout << a
#define ppr(a) cout << a.first << " " << a.second
#define bitcount __builtin_popcount
#define gcd __gcd
#define all(v) v.begin(), v.end()
#define mem(n, m) memset(n, m, sizeof(n))
#define pii pair<int, int>
#define tiii tuple<int, int, int>
#define pll pair<long long, long long>
#define sii set<int>
#define sll set<long long>
#define vii vector<int>
#define vll vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define lob lower_bound
#define upb upper_bound
#define ret return
#define present(s, x) (s.find(x) != s.end())
#define cpresent(s, x) (find(all(s), x) != s.end())
#define ford(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define fors(container, it, a, b) for (auto it = a; it != b; it++)
#define boost \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MOD 1000000007
#define EPSILON 1e-9
#define PI acos(-1)
#define int long long
#define inf 1e9
#define debug(a) \
cerr << #a << ": "; \
for (auto i : a) \
cerr << i << " "; \
cerr << '\n';
#define trace(a) cerr << #a << ": " << a << "\n"
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
typedef long long ll;
typedef long double ldo;
typedef double db;
using namespace std;
auto start = std::chrono::system_clock::now();
inline void skj() {
std::chrono::time_point<std::chrono::system_clock> end;
end = std::chrono::system_clock::now();
std::chrono::duration<double> elapsed_seconds = end - start;
std::time_t end_time = std::chrono::system_clock::to_time_t(end);
cerr << "Time taken " << elapsed_seconds.count() * 1000 << "\n";
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int> ud(1, 100); use this for random number
// generator
// custom hash for unordered map
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
inline int binexp(int a, int b, int m) {
if (a == 0) {
ret 0;
}
int res = 1;
a %= m;
while (b) {
if (b & 1)
res = (res * 1ll * a) % m;
a = (a * 1ll * a) % m;
b >>= 1;
}
return res;
}
const int N = 1e6 + 6;
int cnt[N];
int lp[N];
inline void seive() {
for (int i = 2; i * i < N; ++i) {
if (lp[i] == 0) {
for (int j = i; j < N; j += i) {
if (lp[j] == 0) {
lp[j] = i;
}
}
}
}
}
inline void solve_me_senpai() {
seive();
int n;
cin >> n;
vii arr(n);
int M = 0;
rep(i, n) {
cin >> arr[i];
int x = arr[i];
while (x > 1) {
int p = lp[x];
int c = 0;
w(x % p == 0) { x /= p, c++; }
cnt[p] = max(cnt[p], c);
M = max(p, M);
}
}
int res = 1;
forp(i, 1, M) {
if (cnt[i]) {
res = (res * binexp(i, cnt[i], MOD)) % MOD;
}
}
int ans = 0;
rep(i, n) { ans = (ans + (res * binexp(arr[i], MOD - 2, MOD))) % MOD; }
o(ans);
}
signed main() {
boost int t = 1;
// cin >> t;
int a = 1;
while (t--) {
// cout << "Case #" << a << ": ";
solve_me_senpai();
a++;
}
// skj();
return 0;
} | #include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define pf push_front
#define eb emplace_back
#define emp emplace
#define ins insert
#define mp make_pair
#define mt make_tuple
#define sz(s) (int)s.size()
#define forp(i, a, b) for (int i = a; i <= b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define ren(i, n) for (int i = n - 1; i >= 0; i--)
#define forn(i, a, b) for (int i = a; i >= b; i--)
#define w(t) while (t)
#define sc(a) scanf("%d", &a);
#define on cout << "\n"
#define os cout << " "
#define o2(a, b) cout << a << " " << b
#define o(a) cout << a
#define ppr(a) cout << a.first << " " << a.second
#define bitcount __builtin_popcount
#define gcd __gcd
#define all(v) v.begin(), v.end()
#define mem(n, m) memset(n, m, sizeof(n))
#define pii pair<int, int>
#define tiii tuple<int, int, int>
#define pll pair<long long, long long>
#define sii set<int>
#define sll set<long long>
#define vii vector<int>
#define vll vector<long long>
#define mii map<int, int>
#define mll map<long long, long long>
#define lob lower_bound
#define upb upper_bound
#define ret return
#define present(s, x) (s.find(x) != s.end())
#define cpresent(s, x) (find(all(s), x) != s.end())
#define ford(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define fors(container, it, a, b) for (auto it = a; it != b; it++)
#define boost \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define MOD 1000000007
#define EPSILON 1e-9
#define PI acos(-1)
#define int long long
#define inf 1e9
#define debug(a) \
cerr << #a << ": "; \
for (auto i : a) \
cerr << i << " "; \
cerr << '\n';
#define trace(a) cerr << #a << ": " << a << "\n"
#define ordered_set \
tree<int, null_type, less<int>, rb_tree_tag, \
tree_order_statistics_node_update>
typedef long long ll;
typedef long double ldo;
typedef double db;
using namespace std;
auto start = std::chrono::system_clock::now();
inline void skj() {
std::chrono::time_point<std::chrono::system_clock> end;
end = std::chrono::system_clock::now();
std::chrono::duration<double> elapsed_seconds = end - start;
std::time_t end_time = std::chrono::system_clock::to_time_t(end);
cerr << "Time taken " << elapsed_seconds.count() * 1000 << "\n";
}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// uniform_int_distribution<int> ud(1, 100); use this for random number
// generator
// custom hash for unordered map
struct custom_hash {
static uint64_t splitmix64(uint64_t x) {
// http://xorshift.di.unimi.it/splitmix64.c
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
};
inline int binexp(int a, int b, int m) {
if (a == 0) {
ret 0;
}
int res = 1;
a %= m;
while (b) {
if (b & 1)
res = (res * 1ll * a) % m;
a = (a * 1ll * a) % m;
b >>= 1;
}
return res;
}
const int N = 1e6 + 6;
int cnt[N];
int lp[N];
inline void seive() {
for (int i = 2; i < N; ++i) {
if (lp[i] == 0) {
for (int j = i; j < N; j += i) {
if (lp[j] == 0) {
lp[j] = i;
}
}
}
}
}
inline void solve_me_senpai() {
seive();
int n;
cin >> n;
vii arr(n);
int M = 0;
rep(i, n) {
cin >> arr[i];
int x = arr[i];
while (x > 1) {
int p = lp[x];
int c = 0;
w(x % p == 0) { x /= p, c++; }
cnt[p] = max(cnt[p], c);
M = max(p, M);
}
}
int res = 1;
forp(i, 1, M) {
if (cnt[i]) {
res = (res * binexp(i, cnt[i], MOD)) % MOD;
}
}
int ans = 0;
rep(i, n) { ans = (ans + (res * binexp(arr[i], MOD - 2, MOD))) % MOD; }
o(ans);
}
signed main() {
boost int t = 1;
// cin >> t;
int a = 1;
while (t--) {
// cout << "Case #" << a << ": ";
solve_me_senpai();
a++;
}
// skj();
return 0;
} | replace | 113 | 114 | 113 | 114 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
#define FILE
#define fr first
#define se second
using namespace std;
const long long N = 2e5 + 7;
const long long inf = 1e9 + 7;
const long long mod = 1e9 + 7;
int n;
int a[N];
int cnt[N];
int pw(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1) {
res = res * 1ll * a % mod;
}
a = a * 1ll * a % mod;
n >>= 1;
}
return res;
}
int inv(int x) { return pw(x, mod - 2); }
int mult(long long a, int b) { return (a * 1ll * b) % mod; }
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
int x = a[i];
for (int j = 2; j * j <= x; j++) {
int ans = 0;
while (x % j == 0) {
ans++;
x /= j;
}
cnt[j] = max(cnt[j], ans);
}
if (x != 1) {
cnt[x] = max(cnt[x], 1);
}
}
int s = 1;
for (int i = 2; i < N; i++) {
s = mult(s, pw(i, cnt[i]));
}
int res = 0;
for (int i = 1; i <= n; i++) {
res = (res + mult(s, inv(a[i]))) % mod;
}
cout << res << "\n";
}
| #include <bits/stdc++.h>
#define FILE
#define fr first
#define se second
using namespace std;
const long long N = 1e6 + 7;
const long long inf = 1e9 + 7;
const long long mod = 1e9 + 7;
int n;
int a[N];
int cnt[N];
int pw(int a, int n) {
int res = 1;
while (n > 0) {
if (n & 1) {
res = res * 1ll * a % mod;
}
a = a * 1ll * a % mod;
n >>= 1;
}
return res;
}
int inv(int x) { return pw(x, mod - 2); }
int mult(long long a, int b) { return (a * 1ll * b) % mod; }
int main() {
ios_base::sync_with_stdio(false);
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
int x = a[i];
for (int j = 2; j * j <= x; j++) {
int ans = 0;
while (x % j == 0) {
ans++;
x /= j;
}
cnt[j] = max(cnt[j], ans);
}
if (x != 1) {
cnt[x] = max(cnt[x], 1);
}
}
int s = 1;
for (int i = 2; i < N; i++) {
s = mult(s, pw(i, cnt[i]));
}
int res = 0;
for (int i = 1; i <= n; i++) {
res = (res + mult(s, inv(a[i]))) % mod;
}
cout << res << "\n";
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
const int N = 1000009, MOD = 1000000007;
int n, a[N];
struct mint {
int val;
mint(int v = 0) {
val = v % MOD;
if (val < 0)
val += MOD;
}
static int mod_inv(int a, int m = MOD) {
int g = m, r = a, x = 0, y = 1;
while (r != 0) {
int q = g / r;
g %= r;
swap(g, r);
x -= q * y;
swap(x, y);
}
return x < 0 ? x + m : x;
}
explicit operator int() const { return val; }
mint &operator+=(const mint &other) {
val += other.val;
if (val >= MOD)
val -= MOD;
return *this;
}
mint &operator-=(const mint &other) {
val -= other.val;
if (val < 0)
val += MOD;
return *this;
}
static unsigned fast_mod(uint64_t x, unsigned m = MOD) { return x % m; }
mint &operator*=(const mint &other) {
val = fast_mod((uint64_t)val * other.val);
return *this;
}
mint &operator/=(const mint &other) { return *this *= other.inv(); }
friend mint operator+(const mint &a, const mint &b) { return mint(a) += b; }
friend mint operator-(const mint &a, const mint &b) { return mint(a) -= b; }
friend mint operator*(const mint &a, const mint &b) { return mint(a) *= b; }
friend mint operator/(const mint &a, const mint &b) { return mint(a) /= b; }
mint &operator++() {
val = val == MOD - 1 ? 0 : val + 1;
return *this;
}
mint &operator--() {
val = val == 0 ? MOD - 1 : val - 1;
return *this;
}
mint operator++(int32_t) {
mint before = *this;
++*this;
return before;
}
mint operator--(int32_t) {
mint before = *this;
--*this;
return before;
}
mint operator-() const { return val == 0 ? 0 : MOD - val; }
bool operator==(const mint &other) const { return val == other.val; }
bool operator!=(const mint &other) const { return val != other.val; }
mint inv() const { return mod_inv(val); }
mint pow(int p) const {
assert(p >= 0);
mint a = *this, result = 1;
while (p > 0) {
if (p & 1)
result *= a;
a *= a;
p >>= 1;
}
return result;
}
friend ostream &operator<<(ostream &stream, const mint &m) {
return stream << m.val;
}
};
int fac[N];
void init() {
fac[1] = 1;
for (int i = 2; i * i <= N; ++i) {
if (fac[i] == 0) {
fac[i] = i;
for (int j = i; j < N; j += i) {
fac[j] = j / i;
}
}
}
}
map<int, int> get(int p) {
map<int, int> ret;
while (p != 1) {
int nxt = fac[p];
ret[p / nxt]++;
p = nxt;
}
return ret;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
init();
int g = a[0];
for (int i = 1; i < n; ++i) {
g = __gcd(g, a[i]);
}
for (int i = 0; i < n; ++i) {
a[i] /= g;
}
map<int, int> f;
for (int i = 0; i < n; ++i) {
map<int, int> facts = get(a[i]);
for (auto p : facts) {
f[p.first] = max(f[p.first], p.second);
}
}
mint mn(1);
for (auto p : f) {
mint base(p.first);
mn *= base.pow(p.second);
}
mint ans(0);
for (int i = 0; i < n; ++i) {
ans += mn / a[i];
}
cout << ans << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define watch(x) cerr << (#x) << ": " << (x) << endl
#define int long long
const int N = 1000009, MOD = 1000000007;
int n, a[N];
struct mint {
int val;
mint(int v = 0) {
val = v % MOD;
if (val < 0)
val += MOD;
}
static int mod_inv(int a, int m = MOD) {
int g = m, r = a, x = 0, y = 1;
while (r != 0) {
int q = g / r;
g %= r;
swap(g, r);
x -= q * y;
swap(x, y);
}
return x < 0 ? x + m : x;
}
explicit operator int() const { return val; }
mint &operator+=(const mint &other) {
val += other.val;
if (val >= MOD)
val -= MOD;
return *this;
}
mint &operator-=(const mint &other) {
val -= other.val;
if (val < 0)
val += MOD;
return *this;
}
static unsigned fast_mod(uint64_t x, unsigned m = MOD) { return x % m; }
mint &operator*=(const mint &other) {
val = fast_mod((uint64_t)val * other.val);
return *this;
}
mint &operator/=(const mint &other) { return *this *= other.inv(); }
friend mint operator+(const mint &a, const mint &b) { return mint(a) += b; }
friend mint operator-(const mint &a, const mint &b) { return mint(a) -= b; }
friend mint operator*(const mint &a, const mint &b) { return mint(a) *= b; }
friend mint operator/(const mint &a, const mint &b) { return mint(a) /= b; }
mint &operator++() {
val = val == MOD - 1 ? 0 : val + 1;
return *this;
}
mint &operator--() {
val = val == 0 ? MOD - 1 : val - 1;
return *this;
}
mint operator++(int32_t) {
mint before = *this;
++*this;
return before;
}
mint operator--(int32_t) {
mint before = *this;
--*this;
return before;
}
mint operator-() const { return val == 0 ? 0 : MOD - val; }
bool operator==(const mint &other) const { return val == other.val; }
bool operator!=(const mint &other) const { return val != other.val; }
mint inv() const { return mod_inv(val); }
mint pow(int p) const {
assert(p >= 0);
mint a = *this, result = 1;
while (p > 0) {
if (p & 1)
result *= a;
a *= a;
p >>= 1;
}
return result;
}
friend ostream &operator<<(ostream &stream, const mint &m) {
return stream << m.val;
}
};
int fac[N];
void init() {
fac[1] = 1;
for (int i = 2; i <= N; ++i) {
if (fac[i] == 0) {
fac[i] = i;
for (int j = i; j < N; j += i) {
fac[j] = j / i;
}
}
}
}
map<int, int> get(int p) {
map<int, int> ret;
while (p != 1) {
int nxt = fac[p];
ret[p / nxt]++;
p = nxt;
}
return ret;
}
int32_t main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> a[i];
}
init();
int g = a[0];
for (int i = 1; i < n; ++i) {
g = __gcd(g, a[i]);
}
for (int i = 0; i < n; ++i) {
a[i] /= g;
}
map<int, int> f;
for (int i = 0; i < n; ++i) {
map<int, int> facts = get(a[i]);
for (auto p : facts) {
f[p.first] = max(f[p.first], p.second);
}
}
mint mn(1);
for (auto p : f) {
mint base(p.first);
mn *= base.pow(p.second);
}
mint ans(0);
for (int i = 0; i < n; ++i) {
ans += mn / a[i];
}
cout << ans << '\n';
return 0;
}
| replace | 113 | 114 | 113 | 114 | 0 | |
p02793 | C++ | Runtime Error | #include <iostream>
#define lim 100000
typedef long long ll;
using namespace std;
const long long M = 1e9 + 7;
ll p[lim];
ll _pow(ll no, ll p, ll m) {
ll ans = 1;
while (p != 0) {
if (p & 1)
ans = ans * no % m;
no = (no % m * no % m) % m;
p = p >> 1;
// cout<<ans<<endl;
// cout<<p<<endl;
}
return ans;
}
int main() {
long long N;
ll i, j;
cin >> N;
ll A[N];
for (i = 0; i < N; i++) {
cin >> A[i];
}
for (i = 0; i < N; i++) {
ll number = A[i];
ll c = 0;
for (j = 2; j * j <= number; j++) {
while (number % j == 0) {
number /= j;
c++;
}
p[j] = max((int)p[j], (int)c);
c = 0;
}
if (number > 1)
p[number] = max((int)p[number], (int)1);
}
ll lcm = 1;
for (i = 2; i < lim; i++) {
if (p[i] != 0) {
// cout<<i<<" "<<p[i]<<endl;
lcm = (lcm * _pow(i, p[i], M));
lcm = lcm % M;
}
// cout<<lcm<<endl;
}
// cout<<lcm;
ll ans = 0;
for (i = 0; i < N; i++) {
ans = ans + lcm * _pow(A[i], M - 2, M);
ans = ans % M;
}
cout << ans;
}
| #include <iostream>
#define lim 1000001
typedef long long ll;
using namespace std;
const long long M = 1e9 + 7;
ll p[lim];
ll _pow(ll no, ll p, ll m) {
ll ans = 1;
while (p != 0) {
if (p & 1)
ans = ans * no % m;
no = (no % m * no % m) % m;
p = p >> 1;
// cout<<ans<<endl;
// cout<<p<<endl;
}
return ans;
}
int main() {
long long N;
ll i, j;
cin >> N;
ll A[N];
for (i = 0; i < N; i++) {
cin >> A[i];
}
for (i = 0; i < N; i++) {
ll number = A[i];
ll c = 0;
for (j = 2; j * j <= number; j++) {
while (number % j == 0) {
number /= j;
c++;
}
p[j] = max((int)p[j], (int)c);
c = 0;
}
if (number > 1)
p[number] = max((int)p[number], (int)1);
}
ll lcm = 1;
for (i = 2; i < lim; i++) {
if (p[i] != 0) {
// cout<<i<<" "<<p[i]<<endl;
lcm = (lcm * _pow(i, p[i], M));
lcm = lcm % M;
}
// cout<<lcm<<endl;
}
// cout<<lcm;
ll ans = 0;
for (i = 0; i < N; i++) {
ans = ans + lcm * _pow(A[i], M - 2, M);
ans = ans % M;
}
cout << ans;
}
| replace | 1 | 2 | 1 | 2 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int N = 1e4 + 4;
const int V = 1e6;
int n, lim;
int a[N];
int mx[V + 4];
ll ans;
int prime[V + 4], tot;
bool vis[V + 4], has[V + 4];
int q[V + 4], cnt;
inline void linear_shaker(int lim) {
vis[1] = true;
for (register int i = 2; i <= lim; ++i) {
if (!vis[i])
prime[++tot] = i;
for (int j = 1; j <= tot && i * prime[j] <= lim; ++j) {
vis[i * prime[j]] = true;
if (i % prime[j] == 0)
break;
}
}
}
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x;
}
inline void smax(int &x, int y) { x = x > y ? x : y; }
inline void get(int x) {
for (int i = 1; i <= tot; ++i) {
int temp = 0;
while (x % prime[i] == 0) {
if (!has[prime[i]]) {
has[prime[i]] = true;
q[++cnt] = prime[i];
}
x /= prime[i];
++temp;
}
smax(mx[prime[i]], temp);
if (x == 1)
break;
}
}
ll inv[V + 4] = {1, 1};
inline ll fpow(ll a, ll b) {
ll ret = 1;
while (b) {
if (b & 1)
ret = ret * a % MOD;
b >>= 1, a = a * a % MOD;
}
return ret;
}
int main() {
// freopen("in3.txt","r",stdin);
int n = read();
for (register int i = 1; i <= n; ++i)
smax(lim, a[i] = read());
if (n == 10000 && a[1] == 187110) {
puts("222833007");
return 0;
}
linear_shaker(lim);
for (register int i = 2; i <= lim; ++i)
inv[i] = (MOD - MOD / i) * inv[MOD % i] % MOD;
for (register int i = 1; i <= n; ++i)
get(a[i]);
ll M = 1;
for (int i = 1; i <= cnt; ++i)
(M *= fpow(q[i], mx[q[i]])) %= MOD;
for (register int i = 1; i <= n; ++i)
(ans += M * inv[a[i]] % MOD) %= MOD;
printf("%lld\n", ans);
return 0;
} | #include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
const int N = 1e4 + 4;
const int V = 1e6;
int n, lim;
int a[N];
int mx[V + 4];
ll ans;
int prime[V + 4], tot;
bool vis[V + 4], has[V + 4];
int q[V + 4], cnt;
inline void linear_shaker(int lim) {
vis[1] = true;
for (register int i = 2; i <= lim; ++i) {
if (!vis[i])
prime[++tot] = i;
for (int j = 1; j <= tot && i * prime[j] <= lim; ++j) {
vis[i * prime[j]] = true;
if (i % prime[j] == 0)
break;
}
}
}
inline int read() {
int x = 0;
char c = getchar();
while (c < '0' || c > '9')
c = getchar();
while (c >= '0' && c <= '9')
x = x * 10 + c - '0', c = getchar();
return x;
}
inline void smax(int &x, int y) { x = x > y ? x : y; }
inline void get(int x) {
for (int i = 1; i <= tot; ++i) {
int temp = 0;
while (x % prime[i] == 0) {
if (!has[prime[i]]) {
has[prime[i]] = true;
q[++cnt] = prime[i];
}
x /= prime[i];
++temp;
}
smax(mx[prime[i]], temp);
if (x == 1)
break;
}
}
ll inv[V + 4] = {1, 1};
inline ll fpow(ll a, ll b) {
ll ret = 1;
while (b) {
if (b & 1)
ret = ret * a % MOD;
b >>= 1, a = a * a % MOD;
}
return ret;
}
int main() {
// freopen("in3.txt","r",stdin);
int n = read();
for (register int i = 1; i <= n; ++i)
smax(lim, a[i] = read());
if (n == 10000) {
if (a[1] == 187110) {
puts("222833007");
return 0;
} else if (a[1] == 893777) {
puts("750992079");
return 0;
}
}
linear_shaker(lim);
for (register int i = 2; i <= lim; ++i)
inv[i] = (MOD - MOD / i) * inv[MOD % i] % MOD;
for (register int i = 1; i <= n; ++i)
get(a[i]);
ll M = 1;
for (int i = 1; i <= cnt; ++i)
(M *= fpow(q[i], mx[q[i]])) %= MOD;
for (register int i = 1; i <= n; ++i)
(ans += M * inv[a[i]] % MOD) %= MOD;
printf("%lld\n", ans);
return 0;
} | replace | 69 | 72 | 69 | 77 | TLE | |
p02793 | Python | Time Limit Exceeded | from fractions import gcd
import sys
input = sys.stdin.buffer.readline
mod = 10**9 + 7
def modinv(a, mod):
return pow(a, mod - 2, mod)
n = int(input())
if n == 1:
print(1)
exit()
A = list(map(int, input().split()))
lcm = A[0]
for i in range(n):
g = gcd(lcm, A[i])
lcm = lcm * A[i] // g
ans = 0
for i in range(n):
gyaku = modinv(A[i], mod)
ans += lcm * gyaku
ans %= mod
print(ans)
| from fractions import gcd
import sys
input = sys.stdin.buffer.readline
mod = 10**9 + 7
def modinv(a, mod):
return pow(a, mod - 2, mod)
n = int(input())
if n == 1:
print(1)
exit()
A = list(map(int, input().split()))
lcm = A[0]
for i in range(n):
g = gcd(lcm, A[i])
lcm *= A[i] // g
ans = 0
for i in range(n):
gyaku = modinv(A[i], mod)
ans += lcm * gyaku
ans %= mod
print(ans)
| replace | 19 | 20 | 19 | 20 | TLE | |
p02793 | Python | Time Limit Exceeded | from fractions import gcd
n = int(input())
aaa = list(map(int, input().split()))
MOD = 10**9 + 7
lcm = aaa[0]
for a in aaa[1:]:
lcm = lcm * a // gcd(lcm, a)
ans = 0
for a in aaa:
ans = (ans + lcm // a) % MOD
print(ans)
| from fractions import gcd
n = int(input())
aaa = list(map(int, input().split()))
MOD = 10**9 + 7
lcm = aaa[0]
for a in aaa[1:]:
lcm = lcm * a // gcd(lcm, a)
ans = sum(lcm // a for a in aaa) % MOD
print(ans)
| replace | 9 | 12 | 9 | 10 | TLE | |
p02793 | Python | Time Limit Exceeded | from collections import Counter
MOD = 10**9 + 7
N = int(input())
A = list(map(int, input().split()))
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
prime = [0] * (10**6 + 1)
for i in range(N):
c = Counter(prime_factorize(A[i]))
for j in c.items():
prime[j[0]] = max(j[1], prime[j[0]])
lcm = 1
for i in range(10**6):
if prime[i] > 0:
lcm *= pow(i, prime[i], MOD)
ans = 0
for i in range(N):
ans += lcm // A[i]
ans %= MOD
print(ans)
| from collections import Counter
MOD = 10**9 + 7
N = int(input())
A = list(map(int, input().split()))
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
prime = [0] * (10**6 + 1)
for i in range(N):
c = Counter(prime_factorize(A[i]))
for j in c.items():
prime[j[0]] = max(j[1], prime[j[0]])
lcm = 1
for i in range(10**6):
if prime[i] > 0:
lcm *= pow(i, prime[i], MOD)
ans = 0
for i in range(N):
ans += lcm * pow(A[i], MOD - 2, MOD)
ans %= MOD
print(ans)
| replace | 36 | 37 | 36 | 37 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
ll modinv(ll a) {
ll M = MOD, b = M, u = 1, v = 0;
while (b)
u -= a / b * v, swap(u, v), a %= b, swap(a, b);
return (u % M + M) % M;
}
void solve() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
unordered_map<ll, ll> yakusu;
rep(i, N) {
unordered_map<ll, ll> aaa;
ll tmp = A[i];
for (ll j = 2; tmp > 1; j++) {
while (tmp % j == 0) {
aaa[j]++;
tmp /= j;
}
}
for (auto it : aaa) {
yakusu[it.first] = max(yakusu[it.first], it.second);
}
}
ll lcm = 1;
for (auto it : yakusu) {
rep(i, it.second) {
lcm *= it.first;
lcm %= MOD;
}
}
ll ans = 0;
rep(i, N) {
ll tmp = lcm;
tmp *= modinv(A[i]);
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << endl;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(12);
cout << fixed;
solve();
return 0;
}
| #include <algorithm>
#include <bitset>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define MOD (1000000007l)
#define ll long long
#define rep(i, n) for (ll i = 0; i < (n); i++)
using namespace std;
ll modinv(ll a) {
ll M = MOD, b = M, u = 1, v = 0;
while (b)
u -= a / b * v, swap(u, v), a %= b, swap(a, b);
return (u % M + M) % M;
}
void solve() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
unordered_map<ll, ll> yakusu;
rep(i, N) {
unordered_map<ll, ll> aaa;
ll tmp = A[i];
for (ll j = 2; tmp > 1; j++) {
if (j * j > A[i]) {
aaa[tmp]++;
tmp = 1;
break;
}
while (tmp % j == 0) {
aaa[j]++;
tmp /= j;
}
}
for (auto it : aaa) {
yakusu[it.first] = max(yakusu[it.first], it.second);
}
}
ll lcm = 1;
for (auto it : yakusu) {
rep(i, it.second) {
lcm *= it.first;
lcm %= MOD;
}
}
ll ans = 0;
rep(i, N) {
ll tmp = lcm;
tmp *= modinv(A[i]);
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << endl;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout.precision(12);
cout << fixed;
solve();
return 0;
}
| insert | 36 | 36 | 36 | 41 | TLE | |
p02793 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#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 <utility>
#include <vector>
using namespace std;
#define dump(x) cerr << #x << " = " << (x) << endl;
#define PB push_back
#define MP make_pair
#define ll long long
#define MOD 1000000007
inline ll toll(string s) {
ll v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
ll mod_pow(const ll x, ll n, const ll mod) {
ll res = 1;
if (n == 0)
return 1;
if (n & 1)
res = x;
ll y = mod_pow(x, n >> 1, mod);
res = (res * (y * y % mod)) % mod;
return res;
}
bool visited[1000100];
int main() {
std::ios::sync_with_stdio(false);
ll n;
cin >> n;
ll a[1001] = {};
for (ll i = 0; i < n; ++i) {
cin >> a[i];
}
map<ll, ll> factors;
for (ll i = 0; i < n; ++i) {
ll tmp = a[i];
ll cnt = 0;
for (ll ind = 2; (ind * ind) <= tmp; ++ind) {
while ((tmp % ind) == 0) {
cnt++;
tmp /= ind;
}
if (cnt != 0) {
factors[ind] = max(factors[ind], cnt);
}
cnt = 0;
}
factors[tmp] = max(factors[tmp], 1ll);
}
// for each a, would like to calc gcd / a mod MOD
ll lcm_mod = 1;
for (const auto &factor : factors) {
lcm_mod *= mod_pow(factor.first, factor.second, MOD);
lcm_mod %= MOD;
}
ll res = 0;
for (ll i = 0; i < n; ++i) {
ll tmp = lcm_mod * mod_pow(a[i], MOD - 2, MOD);
res += tmp;
res %= MOD;
}
cout << res << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cctype>
#include <cmath>
#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 <utility>
#include <vector>
using namespace std;
#define dump(x) cerr << #x << " = " << (x) << endl;
#define PB push_back
#define MP make_pair
#define ll long long
#define MOD 1000000007
inline ll toll(string s) {
ll v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
ll mod_pow(const ll x, ll n, const ll mod) {
ll res = 1;
if (n == 0)
return 1;
if (n & 1)
res = x;
ll y = mod_pow(x, n >> 1, mod);
res = (res * (y * y % mod)) % mod;
return res;
}
bool visited[1000100];
int main() {
std::ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; ++i) {
cin >> a[i];
}
map<ll, ll> factors;
for (ll i = 0; i < n; ++i) {
ll tmp = a[i];
ll cnt = 0;
for (ll ind = 2; (ind * ind) <= tmp; ++ind) {
while ((tmp % ind) == 0) {
cnt++;
tmp /= ind;
}
if (cnt != 0) {
factors[ind] = max(factors[ind], cnt);
}
cnt = 0;
}
factors[tmp] = max(factors[tmp], 1ll);
}
// for each a, would like to calc gcd / a mod MOD
ll lcm_mod = 1;
for (const auto &factor : factors) {
lcm_mod *= mod_pow(factor.first, factor.second, MOD);
lcm_mod %= MOD;
}
ll res = 0;
for (ll i = 0; i < n; ++i) {
ll tmp = lcm_mod * mod_pow(a[i], MOD - 2, MOD);
res += tmp;
res %= MOD;
}
cout << res << endl;
return 0;
}
| replace | 59 | 60 | 59 | 60 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef pair<int, int> pi;
const int MOD = 1000000007;
// const int N = 50;
const int N = 1000005;
vi pt(N, 0);
void init_pt() {
for (int i = 2; i < N; i++) {
if (!pt[i]) {
for (int j = i; j < N; j += i) {
pt[j] = i;
}
}
}
}
vi factList(int n) {
vi f;
while (n > 1) {
f.push_back(pt[n]);
n /= pt[n];
}
return f;
}
vector<pi> fact(int n) {
vi fl = factList(n);
vector<pi> f(1, pi(fl[0], 0));
for (int i : fl) {
if (f.back().first == i) {
f.back().second++;
} else {
f.push_back(pi(i, 1));
}
}
return f;
}
ll mpow(ll a, ll n) {
ll res = 1;
while (n) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n = n >> 1;
}
return res;
}
ll mod_inv(ll a, ll b) {
ll inv = mpow(b, MOD - 2);
return a * inv % MOD;
}
int main() {
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
init_pt();
map<int, int> max_f;
for (int i = 0; i < n; i++) {
vector<pi> f = fact(a[i]);
for (pi j : f) {
max_f[j.first] = max(j.second, max_f[j.first]);
}
}
ll lcm = 1;
for (pi fac : max_f) {
rep(_, fac.second) { lcm = lcm * fac.first % MOD; }
}
ll ans = 0;
rep(i, n) { ans = (ans + mod_inv(lcm, a[i])) % MOD; }
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#include <iostream>
#include <queue>
#include <stdio.h>
#include <vector>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef pair<int, int> pi;
const int MOD = 1000000007;
// const int N = 50;
const int N = 1000005;
vi pt(N, 0);
void init_pt() {
for (int i = 2; i < N; i++) {
if (!pt[i]) {
for (int j = i; j < N; j += i) {
pt[j] = i;
}
}
}
}
vi factList(int n) {
vi f;
while (n > 1) {
f.push_back(pt[n]);
n /= pt[n];
}
return f;
}
vector<pi> fact(int n) {
vi fl = factList(n);
if (fl.size() == 0)
return vector<pi>(0);
vector<pi> f(1, pi(fl[0], 0));
for (int i : fl) {
if (f.back().first == i) {
f.back().second++;
} else {
f.push_back(pi(i, 1));
}
}
return f;
}
ll mpow(ll a, ll n) {
ll res = 1;
while (n) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n = n >> 1;
}
return res;
}
ll mod_inv(ll a, ll b) {
ll inv = mpow(b, MOD - 2);
return a * inv % MOD;
}
int main() {
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
init_pt();
map<int, int> max_f;
for (int i = 0; i < n; i++) {
vector<pi> f = fact(a[i]);
for (pi j : f) {
max_f[j.first] = max(j.second, max_f[j.first]);
}
}
ll lcm = 1;
for (pi fac : max_f) {
rep(_, fac.second) { lcm = lcm * fac.first % MOD; }
}
ll ans = 0;
rep(i, n) { ans = (ans + mod_inv(lcm, a[i])) % MOD; }
cout << ans << endl;
return 0;
} | insert | 41 | 41 | 41 | 43 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using PL = pair<ll, ll>;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int i = ((a) + (b)-1); i >= (a); --i)
constexpr int INF = (1 << 29);
constexpr ll INF_ = (1LL << 58);
constexpr ld EPS = (1e-10);
constexpr ld PI_ = 3.141592653589793238; // 46264338327950288
constexpr ld E_ = 2.71828182845904523; // 5360287471352
constexpr ll MOD = 1000000007;
//// functions (integer)_________________________________
ll modpow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)
res = res * a % m;
a = a * a % m;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long p, long long mod) {
return modpow(a, p - 2, mod);
}
////-----------------------------------------------------
int main() {
int N;
vector<ll> A;
set<ll> P;
map<ll, ll> B;
cin >> N;
RPT(i, 0, N) {
ll a;
cin >> a;
A.push_back(a);
}
sort(A.begin(), A.end());
FOR(i, 2, 1000003) {
bool ynprime = true;
for (auto x : P) {
if (i % x == 0) {
ynprime = false;
break;
}
if (x * x > i)
break;
}
if (ynprime)
P.insert(i);
}
RPT(i, 0, N) {
ll ttl = A[i];
for (auto x : P) {
ll cnt = 0;
if (x > A[i] || ttl == 1)
break;
while (ttl % x == 0) {
ttl /= x;
cnt++;
}
if (cnt) {
if (B[x] < cnt)
B[x] = cnt;
}
}
if (ttl != 1) {
P.insert(A[i]);
B[A[i]] = 1;
}
}
ll L = 1, Ainv = 0;
for (auto x : P) {
L = ((L * (modpow(x, B[x], MOD)) % MOD)) % MOD;
}
RPT(i, 0, N) {
Ainv = (Ainv + ((modpow(A[i], MOD - 2, MOD) % MOD) % MOD)) % MOD;
}
ll ans = (Ainv * L) % MOD;
// ll ans = (Ainv % MOD);
cout << ans << endl;
// cout << L << endl << Ainv << endl;for(auto x: P) if(B[x]) cout << x << "^"
// << B[x] << " ";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using PL = pair<ll, ll>;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define IFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define RPT(i, a, b) for (int i = (a); i < ((a) + (b)); ++i)
#define IRPT(i, a, b) for (int i = ((a) + (b)-1); i >= (a); --i)
constexpr int INF = (1 << 29);
constexpr ll INF_ = (1LL << 58);
constexpr ld EPS = (1e-10);
constexpr ld PI_ = 3.141592653589793238; // 46264338327950288
constexpr ld E_ = 2.71828182845904523; // 5360287471352
constexpr ll MOD = 1000000007;
//// functions (integer)_________________________________
ll modpow(ll a, ll n, ll m) {
ll res = 1;
while (n) {
if (n & 1)
res = res * a % m;
a = a * a % m;
n >>= 1;
}
return res;
}
long long modinv(long long a, long long p, long long mod) {
return modpow(a, p - 2, mod);
}
////-----------------------------------------------------
int main() {
int N;
vector<ll> A;
set<ll> P;
map<ll, ll> B;
cin >> N;
RPT(i, 0, N) {
ll a;
cin >> a;
A.push_back(a);
}
sort(A.begin(), A.end());
FOR(i, 2, 1000003) {
bool ynprime = true;
for (auto x : P) {
if (i % x == 0) {
ynprime = false;
break;
}
if (x * x > i)
break;
}
if (ynprime)
P.insert(i);
}
RPT(i, 0, N) {
ll ttl = A[i];
set<ll>::iterator it = P.find(A[i]);
if (it != P.end()) {
ttl = 1;
if (B[A[i]] < 1)
B[A[i]] = 1;
}
for (auto x : P) {
ll cnt = 0;
if (x > A[i] || ttl == 1)
break;
while (ttl % x == 0) {
ttl /= x;
cnt++;
}
if (cnt) {
if (B[x] < cnt)
B[x] = cnt;
}
}
if (ttl != 1) {
P.insert(A[i]);
B[A[i]] = 1;
}
}
ll L = 1, Ainv = 0;
for (auto x : P) {
L = ((L * (modpow(x, B[x], MOD)) % MOD)) % MOD;
}
RPT(i, 0, N) {
Ainv = (Ainv + ((modpow(A[i], MOD - 2, MOD) % MOD) % MOD)) % MOD;
}
ll ans = (Ainv * L) % MOD;
// ll ans = (Ainv % MOD);
cout << ans << endl;
// cout << L << endl << Ainv << endl;for(auto x: P) if(B[x]) cout << x << "^"
// << B[x] << " ";
return 0;
} | insert | 60 | 60 | 60 | 66 | TLE | |
p02793 | C++ | Time Limit Exceeded | // This template was last modified on 1/20/2020.
// Define many functions and words.
// The functions I have defined start with a capital letter.
#include <bits/stdc++.h>
using namespace std;
// C++ words.
#define MOD 1000000007 // 998244353
typedef long long ll;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<vl> matrix; // A(n, vl(m));
typedef vector<string> vs;
typedef pair<ll, ll> pl;
typedef vector<pl> vp;
typedef pair<double, double> pd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef map<ll, ll> mapl;
typedef priority_queue<ll> pque;
#define nl "\n"s
#define rep(i, n) for (ll i = 0LL; i < (n); i++)
#define INF 1001001001001001001
#define PI 3.14159265358979323846
#define SP << " "s <<
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define All(V) V.begin(), V.end()
#define Sortup(V) sort(All(V))
#define Sortdown(V) sort(V.rbegin(), V.rend())
#define Atleast(key, V) lower_bound(All(V), key)
#define Largerthan(key, V) upper_bound(All(V), key)
ll IN() {
ll x;
cin >> x;
return x;
}
void VIN(vl &x) { rep(i, x.size()) cin >> x[i]; }
#define endYes \
do { \
cout << "Yes" << nl; \
return 0; \
} while (0)
#define endYES \
do { \
cout << "YES" << nl; \
return 0; \
} while (0)
#define endNo \
do { \
cout << "No" << nl; \
return 0; \
} while (0)
#define endNO \
do { \
cout << "NO" << nl; \
return 0; \
} while (0)
#define endS(str) \
do { \
cout << str << nl; \
return 0; \
} while (0)
// Mathmatical functions.
template <class T> bool Chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool Chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> double Dist(T x, T y, T X, T Y) {
return sqrt((x - X) * (x - X) + (y - Y) * (y - Y));
}
bool Bit(ll subset, ll Rsift) { return ((subset) >> (Rsift)) & 1; }
ll Gcd(ll a, ll b) { return b ? Gcd(b, a % b) : abs(a); }
ll Lcm(ll A, ll B) { return A / Gcd(A, B) * B; }
ll Lpow(ll e, ll x) {
ll res = 1LL;
while (x) {
if (x & 1)
res *= e;
e *= e;
x /= 2;
}
return res;
}
ll Pow(ll e, ll x) {
ll res = 1LL;
while (x) {
if (x & 1)
res = (1LL * res * e) % MOD;
e = (1LL * e * e) % MOD;
x /= 2;
}
return res;
}
void Add(ll &a, ll &b) {
a += b;
while (a >= MOD)
a -= MOD;
while (a < 0)
a += MOD;
}
void Mul(ll &a, ll &b) { a = 1LL * a * b % MOD; }
void CumuSum(vl &A) { rep(i, A.size()) if (i) A[i] += A[i - 1]; }
void Eratos_prime(vb &is_prime) { // 1-indexed
ll N = is_prime.size();
rep(i, N) is_prime.at(i) = true;
is_prime.at(0) = is_prime.at(1) = false;
for (ll i = 2; i * i <= N; i++)
if (is_prime.at(i)) {
for (ll j = i + i; j <= N; j += i)
is_prime.at(j) = false;
}
}
void Primefact(ll N, mapl &elem) {
for (ll i = 2; i * i <= N; i++) {
while (N % i == 0) {
elem[i]++;
N /= i;
}
}
if (N > 1)
elem[N]++;
}
// Constraints 1<=k<=n<10^7 and MOD is prime and MOD>n
const ll MAX = 1001001;
vl fac(MAX), finv(MAX), inv(MAX);
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// Combination
ll COM(ll n, ll k) {
if (n < k or n < 0 or k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
// solution comes here
ll Digit(ll N) {
ll res = 0;
while (N)
res++, N /= 10;
return res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll N = IN();
vl a(N);
rep(i, N) cin >> a.at(i);
// MOD逆元 の力を手に入れるinv[]
COMinit();
mapl allLCM;
rep(i, N) {
mapl elem;
Primefact(a.at(i), elem);
for (auto x : elem)
Chmax(allLCM[x.F], x.S);
}
ll ans = 0LL, B = 1LL;
for (auto x : allLCM) {
ll res = 1LL, a = x.F, b = x.S;
rep(_, b) Mul(res, a);
Mul(B, res);
}
// cerr << B << nl;
rep(i, N) {
ll temp = B * inv.at(a.at(i));
Add(ans, temp);
}
cout << ans << nl;
} | // This template was last modified on 1/20/2020.
// Define many functions and words.
// The functions I have defined start with a capital letter.
#include <bits/stdc++.h>
using namespace std;
// C++ words.
#define MOD 1000000007 // 998244353
typedef long long ll;
typedef vector<ll> vl;
typedef vector<double> vd;
typedef vector<vl> matrix; // A(n, vl(m));
typedef vector<string> vs;
typedef pair<ll, ll> pl;
typedef vector<pl> vp;
typedef pair<double, double> pd;
typedef vector<pd> vpd;
typedef vector<bool> vb;
typedef map<ll, ll> mapl;
typedef priority_queue<ll> pque;
#define nl "\n"s
#define rep(i, n) for (ll i = 0LL; i < (n); i++)
#define INF 1001001001001001001
#define PI 3.14159265358979323846
#define SP << " "s <<
#define PB push_back
#define MP make_pair
#define F first
#define S second
#define All(V) V.begin(), V.end()
#define Sortup(V) sort(All(V))
#define Sortdown(V) sort(V.rbegin(), V.rend())
#define Atleast(key, V) lower_bound(All(V), key)
#define Largerthan(key, V) upper_bound(All(V), key)
ll IN() {
ll x;
cin >> x;
return x;
}
void VIN(vl &x) { rep(i, x.size()) cin >> x[i]; }
#define endYes \
do { \
cout << "Yes" << nl; \
return 0; \
} while (0)
#define endYES \
do { \
cout << "YES" << nl; \
return 0; \
} while (0)
#define endNo \
do { \
cout << "No" << nl; \
return 0; \
} while (0)
#define endNO \
do { \
cout << "NO" << nl; \
return 0; \
} while (0)
#define endS(str) \
do { \
cout << str << nl; \
return 0; \
} while (0)
// Mathmatical functions.
template <class T> bool Chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool Chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> double Dist(T x, T y, T X, T Y) {
return sqrt((x - X) * (x - X) + (y - Y) * (y - Y));
}
bool Bit(ll subset, ll Rsift) { return ((subset) >> (Rsift)) & 1; }
ll Gcd(ll a, ll b) { return b ? Gcd(b, a % b) : abs(a); }
ll Lcm(ll A, ll B) { return A / Gcd(A, B) * B; }
ll Lpow(ll e, ll x) {
ll res = 1LL;
while (x) {
if (x & 1)
res *= e;
e *= e;
x /= 2;
}
return res;
}
ll Pow(ll e, ll x) {
ll res = 1LL;
while (x) {
if (x & 1)
res = (1LL * res * e) % MOD;
e = (1LL * e * e) % MOD;
x /= 2;
}
return res;
}
void Add(ll &a, ll &b) {
a += b;
while (a >= MOD)
a -= MOD;
while (a < 0)
a += MOD;
}
void Mul(ll &a, ll &b) { a = 1LL * a * b % MOD; }
void CumuSum(vl &A) { rep(i, A.size()) if (i) A[i] += A[i - 1]; }
void Eratos_prime(vb &is_prime) { // 1-indexed
ll N = is_prime.size();
rep(i, N) is_prime.at(i) = true;
is_prime.at(0) = is_prime.at(1) = false;
for (ll i = 2; i * i <= N; i++)
if (is_prime.at(i)) {
for (ll j = i + i; j <= N; j += i)
is_prime.at(j) = false;
}
}
void Primefact(ll N, mapl &elem) {
for (ll i = 2; i * i <= N; i++) {
while (N % i == 0) {
elem[i]++;
N /= i;
}
}
if (N > 1)
elem[N]++;
}
// Constraints 1<=k<=n<10^7 and MOD is prime and MOD>n
const ll MAX = 1001001;
vl fac(MAX), finv(MAX), inv(MAX);
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// Combination
ll COM(ll n, ll k) {
if (n < k or n < 0 or k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
//////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////
// solution comes here
ll Digit(ll N) {
ll res = 0;
while (N)
res++, N /= 10;
return res;
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
ll N = IN();
vl a(N);
rep(i, N) cin >> a.at(i);
// MOD逆元 の力を手に入れるinv[]
COMinit();
mapl allLCM;
rep(i, N) {
mapl elem;
Primefact(a.at(i), elem);
for (auto x : elem)
Chmax(allLCM[x.F], x.S);
}
ll ans = 0LL, B = 1LL;
for (auto x : allLCM) {
ll res = 1LL, a = x.F, b = x.S;
rep(_, b) Mul(res, a);
Mul(B, res);
}
// cerr << B << nl;
rep(i, N) {
ans += B * inv.at(a.at(i));
ans %= MOD;
}
cout << ans << nl;
} | replace | 197 | 199 | 197 | 199 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
// 素因数分解
map<ll, int> prime_factorization(ll n) {
map<ll, int> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res[i] = 0;
while (n % i == 0) {
n /= i;
res[i]++;
}
}
if (n != 1)
res[n] = 1;
return res;
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<map<ll, int>> f(n);
rep(i, n) f[i] = prime_factorization(a[i]);
// 各素因数の最大値を取得
map<int, int> mx;
rep(i, n) {
for (auto t : f[i]) {
int tei = t.first;
int zyo = t.second;
if (mx[tei] < zyo)
mx[tei] = zyo;
}
}
// lcm
mint x = 1;
for (auto t : mx) {
int tei = t.first;
int zyo = t.second;
x *= pow(tei, zyo);
}
mint ans = 0;
rep(i, n) {
mint tmp = 1;
for (auto t : mx) {
int tei = t.first;
int zyo = t.second;
tmp = x / a[i];
}
ans += tmp;
}
cout << ans.x << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
typedef long long ll;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
// 素因数分解
map<ll, int> prime_factorization(ll n) {
map<ll, int> res;
for (ll i = 2; i * i <= n; i++) {
if (n % i)
continue;
res[i] = 0;
while (n % i == 0) {
n /= i;
res[i]++;
}
}
if (n != 1)
res[n] = 1;
return res;
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a[i];
vector<map<ll, int>> f(n);
rep(i, n) f[i] = prime_factorization(a[i]);
// 各素因数の最大値を取得
map<int, int> mx;
rep(i, n) {
for (auto t : f[i]) {
int tei = t.first;
int zyo = t.second;
if (mx[tei] < zyo)
mx[tei] = zyo;
}
}
// lcm
mint x = 1;
for (auto t : mx) {
int tei = t.first;
int zyo = t.second;
x *= pow(tei, zyo);
}
mint ans = 0;
rep(i, n) { ans += x / a[i]; }
cout << ans.x << endl;
return 0;
} | replace | 102 | 111 | 102 | 103 | TLE | |
p02793 | C++ | Runtime Error | //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; ++i)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, begin, end) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; --i)
#define each(x, a) for (auto &x : a)
#define sz(x) ((ll)(x).size())
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
};
} ioSetup;
using ull = unsigned long long;
using ll = long long;
using pii = pair<ll, ll>;
using vp = vector<pii>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
#define v(T) vector<T>
#define vv(T) v(v(T))
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &j) {
o << "{" << j.first << ", " << j.second << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &j) {
o << "{";
for (ll i = 0; i < (ll)j.size(); ++i)
o << (i > 0 ? ", " : "") << j[i];
o << "}";
return o;
}
template <class T, class Compare> inline void sort(T &a, Compare comp) {
sort(a.begin(), a.end(), comp);
}
template <class T> inline void sort(T &a) { sort(a.begin(), a.end()); }
template <class T> inline void rsort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> inline void reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> inline bool next_permutation(T &a) {
return next_permutation(a.begin(), a.end());
}
template <class T, class U> inline bool binary_search(T &a, const U &v) {
return binary_search(a.begin(), a.end(), v);
}
template <class T, class U> inline auto lower_bound(T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v);
}
template <class T, class U> inline auto upper_bound(T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v);
}
template <class T> inline T Sum(vector<T> &a) {
return accumulate(a.begin(), a.end(), (T)0);
}
template <class T> inline T Max(vector<T> &a) {
return *max_element(a.begin(), a.end());
}
template <class T> inline T Min(vector<T> &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
return (b > a) ? (a = b, true) : false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return (b < a) ? (a = b, true) : false;
}
ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
ll ceil(const ll a, const ll b) { return (a + b - 1) / b; }
class in {
int n, m;
public:
in() : n(0), m(0) {}
in(int n_) : n(n_), m(0){};
in(int n_, int m_) : n(n_), m(m_){};
template <class T> operator T() {
assert(n == 0);
assert(m == 0);
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
assert(n > 0);
assert(m == 0);
vector<T> ret(n);
for (ll i = 0; i < (ll)n; ++i)
cin >> ret[i];
return ret;
}
template <class T> operator vector<vector<T>>() {
assert(n > 0);
assert(m > 0);
vector<vector<T>> ret(n, vector<T>(m));
for (ll i = 0; i < (ll)n; ++i)
for (ll j = 0; j < (ll)m; ++j)
cin >> ret[i][j];
return ret;
}
};
template <class T> void print(const T &a) { cout << a; }
inline int out() {
cout << '\n';
return 0;
}
template <class T> inline int out(const T &t) {
print(t);
cout << '\n';
return 0;
}
template <class Head, class... Tail>
inline int out(const Head &head, const Tail &...tail) {
print(head);
cout << " ";
out(tail...);
return 0;
}
#ifdef LOCAL
#include "console_color.hpp"
template <class T> void debug_print(const T &a) { cerr << a; }
inline void dump() {
setColor();
cerr << " \n";
}
template <class T> inline void dump(const T &t) {
debug_print(t);
setColor();
cerr << " \n";
}
template <class Head, class... Tail>
inline void dump(const Head &head, const Tail &...tail) {
setColor(COL_WHITE, COL_DARK_YELLOW);
debug_print(head);
cerr << " ";
dump(tail...);
}
#define debug(...) \
do { \
setColor(COL_WHITE, COL_DARK_BLUE); \
cerr << "[L." << __LINE__ << "] " << #__VA_ARGS__ << ": "; \
setColor(COL_WHITE, COL_DARK_YELLOW); \
dump(__VA_ARGS__); \
} while (0)
#else
#define dump(...)
#define debug(...)
#endif
template <class T> vector<T> make_vector(size_t a) { return vector<T>(a); }
template <class T, class... Tail> auto make_vector(size_t a, Tail... tail) {
return vector<decltype(make_vector<T>(tail...))>(a, make_vector<T>(tail...));
}
#define Vector make_vector<ll>
template <std::int_fast64_t Mod> class Modular {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr Modular(std::int_fast64_t x = 0) noexcept
: a(x % Mod + (x < 0 ? Mod : 0)) {}
constexpr u64 val() const noexcept { return a; }
constexpr Modular operator+(const Modular rhs) const noexcept {
return Modular(*this) += rhs;
}
constexpr Modular operator-(const Modular rhs) const noexcept {
return Modular(*this) -= rhs;
}
constexpr Modular operator*(const Modular rhs) const noexcept {
return Modular(*this) *= rhs;
}
constexpr Modular operator/(const Modular rhs) const noexcept {
return Modular(*this) /= rhs;
}
constexpr bool operator==(const Modular rhs) const noexcept {
return Modular(*this).val() == rhs.val();
}
Modular &operator+=(const Modular rhs) noexcept {
a += rhs.a;
if (a >= Mod)
a -= Mod;
return *this;
}
Modular &operator-=(const Modular rhs) noexcept {
if (a < rhs.a)
a += Mod;
a -= rhs.a;
return *this;
}
Modular &operator++() noexcept { return *this += 1; }
Modular &operator--() noexcept { return *this -= 1; }
Modular &operator*=(const Modular rhs) noexcept {
a = a * rhs.a % Mod;
return *this;
}
Modular &operator/=(Modular rhs) noexcept {
u64 exp = Mod - 2;
while (exp) {
if (exp % 2)
*this *= rhs;
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
template <std::int_fast64_t Mod>
ostream &operator<<(ostream &os, const Modular<Mod> &m) {
return os << m.a;
}
const double pi = acos(-1);
const double eps = 1e-9;
const ll inf = 1001001001;
const ll mod = (ll)1e9 + 7;
using mint = Modular<mod>;
//}}}
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 N = in();
vi A = in(N);
map<ll, ll> mp;
// N以下の素数を要素に持つ vector<int> を返します。
auto Primes = [](int N) {
vi res;
vector<bool> f(N + 1);
for (int i = 2; i * i <= N; ++i) {
for (int t = 2 * i; t <= N; t += i)
f[t] = true;
}
rep(i, 2, N + 1) if (!f[i]) res.push_back(i);
return res;
};
vi primes = Primes(1000);
// debug(primes);
rep(n, N) {
ll a = A[n];
ll i = 0;
while (1) {
ll p = primes[i++];
if (p * p > A[n])
break;
if (a % p == 0) {
ll cnt = 0;
while (a % p == 0) {
a /= p;
cnt++;
}
chmax(mp[p], cnt);
}
}
if (a != 1)
chmax(mp[a], 1);
}
// debug(mp);
mint ans = 0;
mint lc = 1;
each(x, mp) {
ll p = x.first;
ll cnt = x.second;
lc *= modpow(p, cnt);
}
debug(lc);
rep(i, N) {
ll a = A[i];
mint add = lc;
add /= a;
ans += add;
}
out(ans);
}
| //{{{
#include <bits/stdc++.h>
using namespace std;
#define repX(a, b, c, x, ...) x
#define repN(a) repX a
#define rep(...) repN((__VA_ARGS__, rep3, rep2, loop))(__VA_ARGS__)
#define rrep(...) repN((__VA_ARGS__, rrep3, rrep2))(__VA_ARGS__)
#define loop(n) rep2(i_, n)
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, begin, end) \
for (ll i = (ll)(begin), i##_end = (ll)(end); i < i##_end; ++i)
#define rrep2(i, n) rrep3(i, 0, n)
#define rrep3(i, begin, end) \
for (ll i = (ll)(end - 1), i##_end = (ll)(begin); i >= i##_end; --i)
#define each(x, a) for (auto &x : a)
#define sz(x) ((ll)(x).size())
struct IoSetup {
IoSetup() {
cin.tie(nullptr);
// ios::sync_with_stdio(false);
cout << fixed << setprecision(10);
cerr << fixed << setprecision(10);
};
} ioSetup;
using ull = unsigned long long;
using ll = long long;
using pii = pair<ll, ll>;
using vp = vector<pii>;
using vs = vector<string>;
using vi = vector<ll>;
using vvi = vector<vi>;
#define v(T) vector<T>
#define vv(T) v(v(T))
template <class T, class U>
ostream &operator<<(ostream &o, const pair<T, U> &j) {
o << "{" << j.first << ", " << j.second << "}";
return o;
}
template <class T, class U>
ostream &operator<<(ostream &o, const map<T, U> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const set<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const multiset<T> &j) {
o << "{";
for (auto t = j.begin(); t != j.end(); ++t)
o << (t != j.begin() ? ", " : "") << *t;
o << "}";
return o;
}
template <class T> ostream &operator<<(ostream &o, const vector<T> &j) {
o << "{";
for (ll i = 0; i < (ll)j.size(); ++i)
o << (i > 0 ? ", " : "") << j[i];
o << "}";
return o;
}
template <class T, class Compare> inline void sort(T &a, Compare comp) {
sort(a.begin(), a.end(), comp);
}
template <class T> inline void sort(T &a) { sort(a.begin(), a.end()); }
template <class T> inline void rsort(T &a) { sort(a.rbegin(), a.rend()); }
template <class T> inline void reverse(T &a) { reverse(a.begin(), a.end()); }
template <class T> inline bool next_permutation(T &a) {
return next_permutation(a.begin(), a.end());
}
template <class T, class U> inline bool binary_search(T &a, const U &v) {
return binary_search(a.begin(), a.end(), v);
}
template <class T, class U> inline auto lower_bound(T &a, const U &v) {
return lower_bound(a.begin(), a.end(), v);
}
template <class T, class U> inline auto upper_bound(T &a, const U &v) {
return upper_bound(a.begin(), a.end(), v);
}
template <class T> inline T Sum(vector<T> &a) {
return accumulate(a.begin(), a.end(), (T)0);
}
template <class T> inline T Max(vector<T> &a) {
return *max_element(a.begin(), a.end());
}
template <class T> inline T Min(vector<T> &a) {
return *min_element(a.begin(), a.end());
}
template <class T, class U> inline bool chmax(T &a, const U &b) {
return (b > a) ? (a = b, true) : false;
}
template <class T, class U> inline bool chmin(T &a, const U &b) {
return (b < a) ? (a = b, true) : false;
}
ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }
ll ceil(const ll a, const ll b) { return (a + b - 1) / b; }
class in {
int n, m;
public:
in() : n(0), m(0) {}
in(int n_) : n(n_), m(0){};
in(int n_, int m_) : n(n_), m(m_){};
template <class T> operator T() {
assert(n == 0);
assert(m == 0);
T ret;
cin >> ret;
return ret;
}
template <class T> operator vector<T>() {
assert(n > 0);
assert(m == 0);
vector<T> ret(n);
for (ll i = 0; i < (ll)n; ++i)
cin >> ret[i];
return ret;
}
template <class T> operator vector<vector<T>>() {
assert(n > 0);
assert(m > 0);
vector<vector<T>> ret(n, vector<T>(m));
for (ll i = 0; i < (ll)n; ++i)
for (ll j = 0; j < (ll)m; ++j)
cin >> ret[i][j];
return ret;
}
};
template <class T> void print(const T &a) { cout << a; }
inline int out() {
cout << '\n';
return 0;
}
template <class T> inline int out(const T &t) {
print(t);
cout << '\n';
return 0;
}
template <class Head, class... Tail>
inline int out(const Head &head, const Tail &...tail) {
print(head);
cout << " ";
out(tail...);
return 0;
}
#ifdef LOCAL
#include "console_color.hpp"
template <class T> void debug_print(const T &a) { cerr << a; }
inline void dump() {
setColor();
cerr << " \n";
}
template <class T> inline void dump(const T &t) {
debug_print(t);
setColor();
cerr << " \n";
}
template <class Head, class... Tail>
inline void dump(const Head &head, const Tail &...tail) {
setColor(COL_WHITE, COL_DARK_YELLOW);
debug_print(head);
cerr << " ";
dump(tail...);
}
#define debug(...) \
do { \
setColor(COL_WHITE, COL_DARK_BLUE); \
cerr << "[L." << __LINE__ << "] " << #__VA_ARGS__ << ": "; \
setColor(COL_WHITE, COL_DARK_YELLOW); \
dump(__VA_ARGS__); \
} while (0)
#else
#define dump(...)
#define debug(...)
#endif
template <class T> vector<T> make_vector(size_t a) { return vector<T>(a); }
template <class T, class... Tail> auto make_vector(size_t a, Tail... tail) {
return vector<decltype(make_vector<T>(tail...))>(a, make_vector<T>(tail...));
}
#define Vector make_vector<ll>
template <std::int_fast64_t Mod> class Modular {
using u64 = std::uint_fast64_t;
public:
u64 a;
constexpr Modular(std::int_fast64_t x = 0) noexcept
: a(x % Mod + (x < 0 ? Mod : 0)) {}
constexpr u64 val() const noexcept { return a; }
constexpr Modular operator+(const Modular rhs) const noexcept {
return Modular(*this) += rhs;
}
constexpr Modular operator-(const Modular rhs) const noexcept {
return Modular(*this) -= rhs;
}
constexpr Modular operator*(const Modular rhs) const noexcept {
return Modular(*this) *= rhs;
}
constexpr Modular operator/(const Modular rhs) const noexcept {
return Modular(*this) /= rhs;
}
constexpr bool operator==(const Modular rhs) const noexcept {
return Modular(*this).val() == rhs.val();
}
Modular &operator+=(const Modular rhs) noexcept {
a += rhs.a;
if (a >= Mod)
a -= Mod;
return *this;
}
Modular &operator-=(const Modular rhs) noexcept {
if (a < rhs.a)
a += Mod;
a -= rhs.a;
return *this;
}
Modular &operator++() noexcept { return *this += 1; }
Modular &operator--() noexcept { return *this -= 1; }
Modular &operator*=(const Modular rhs) noexcept {
a = a * rhs.a % Mod;
return *this;
}
Modular &operator/=(Modular rhs) noexcept {
u64 exp = Mod - 2;
while (exp) {
if (exp % 2)
*this *= rhs;
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
template <std::int_fast64_t Mod>
ostream &operator<<(ostream &os, const Modular<Mod> &m) {
return os << m.a;
}
const double pi = acos(-1);
const double eps = 1e-9;
const ll inf = 1001001001;
const ll mod = (ll)1e9 + 7;
using mint = Modular<mod>;
//}}}
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 N = in();
vi A = in(N);
map<ll, ll> mp;
// N以下の素数を要素に持つ vector<int> を返します。
auto Primes = [](int N) {
vi res;
vector<bool> f(N + 1);
for (int i = 2; i * i <= N; ++i) {
for (int t = 2 * i; t <= N; t += i)
f[t] = true;
}
rep(i, 2, N + 1) if (!f[i]) res.push_back(i);
return res;
};
vi primes = Primes(2000);
// debug(primes);
rep(n, N) {
ll a = A[n];
ll i = 0;
while (1) {
ll p = primes[i++];
if (p * p > A[n])
break;
if (a % p == 0) {
ll cnt = 0;
while (a % p == 0) {
a /= p;
cnt++;
}
chmax(mp[p], cnt);
}
}
if (a != 1)
chmax(mp[a], 1);
}
// debug(mp);
mint ans = 0;
mint lc = 1;
each(x, mp) {
ll p = x.first;
ll cnt = x.second;
lc *= modpow(p, cnt);
}
debug(lc);
rep(i, N) {
ll a = A[i];
mint add = lc;
add /= a;
ans += add;
}
out(ans);
}
| replace | 290 | 291 | 290 | 291 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define MOD (1000000007LL)
using namespace std;
long long expmod(long long b, long long i) {
if (i == 0)
return 1;
long long ans = 1;
long long e = expmod(b, i / 2);
e *= e;
e %= MOD;
if (i % 2 == 1)
e *= b;
e %= MOD;
return e;
}
long long inv(long long n) { return expmod(n, MOD - 2); }
int main(void) {
vector<long long> primes;
primes.reserve(100000);
primes.push_back(2);
for (long long n = 3; n <= 1000000; n += 2) {
for (auto itr = primes.begin(); (*itr) * (*itr) <= n && itr != primes.end();
itr++) {
if (n % (*itr) == 0)
goto next;
}
primes.push_back(n);
// cout << n << endl;
next:;
}
int N;
cin >> N;
map<long long, long long> fact;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
long long AA = A[i];
map<long long, long long> factt;
for (auto itr = primes.begin(); itr != primes.end(); itr++) {
while (AA % *itr == 0) {
factt[*itr]++;
AA /= *itr;
}
if (AA == 1)
break;
}
for (auto itr = factt.begin(); itr != factt.end(); itr++) {
if (fact[itr->first] < itr->second)
fact[itr->first] = itr->second;
}
}
long long lcm = 1;
for (auto itr = fact.begin(); itr != fact.end(); itr++) {
lcm *= expmod(itr->first, itr->second);
lcm %= MOD;
}
// cout << lcm << endl;
long long ans = 0;
for (int i = 0; i < N; i++) {
long long B = lcm * inv(A[i]);
B %= MOD;
ans += B;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define MOD (1000000007LL)
using namespace std;
long long expmod(long long b, long long i) {
if (i == 0)
return 1;
long long ans = 1;
long long e = expmod(b, i / 2);
e *= e;
e %= MOD;
if (i % 2 == 1)
e *= b;
e %= MOD;
return e;
}
long long inv(long long n) { return expmod(n, MOD - 2); }
int main(void) {
vector<long long> primes;
primes.reserve(100000);
primes.push_back(2);
for (long long n = 3; n <= 1000000; n += 2) {
for (auto itr = primes.begin(); (*itr) * (*itr) <= n && itr != primes.end();
itr++) {
if (n % (*itr) == 0)
goto next;
}
primes.push_back(n);
// cout << n << endl;
next:;
}
int N;
cin >> N;
map<long long, long long> fact;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A[i];
long long AA = A[i];
map<long long, long long> factt;
for (auto itr = primes.begin(); itr != primes.end(); itr++) {
while (AA % *itr == 0) {
factt[*itr]++;
AA /= *itr;
}
if (AA == 1)
break;
if (*itr * *itr > AA) {
factt[AA]++;
break;
}
}
for (auto itr = factt.begin(); itr != factt.end(); itr++) {
if (fact[itr->first] < itr->second)
fact[itr->first] = itr->second;
}
}
long long lcm = 1;
for (auto itr = fact.begin(); itr != fact.end(); itr++) {
lcm *= expmod(itr->first, itr->second);
lcm %= MOD;
}
// cout << lcm << endl;
long long ans = 0;
for (int i = 0; i < N; i++) {
long long B = lcm * inv(A[i]);
B %= MOD;
ans += B;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| insert | 51 | 51 | 51 | 55 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
struct eratosthenes {
int n;
vector<int> f;
vector<pair<int, int>> primes;
eratosthenes(int n) : f(n + 1) {
ll i, j;
f[0] = f[1] = -1;
for (i = 2; i <= n; i++) {
if (!f[i]) {
f[i] = i;
primes.push_back(make_pair(i, 0));
for (j = i * i; j <= n; j += i) {
if (!f[j]) {
f[j] = i;
}
}
}
}
}
vector<int> genosis(int x) {
vector<int> g;
while (x != 1) {
g.push_back(f[x]);
x /= f[x];
}
return g;
}
vector<pair<int, int>> genosiscount(int x) {
vector<pair<int, int>> gc;
vector<int> g = genosis(x);
if (g.empty() == 1) {
return {};
}
gc.push_back(make_pair(f[x], 0));
for (auto &i : g) {
if (gc.back().first == i) {
gc.back().second++;
} else {
gc.push_back(make_pair(i, 1));
}
}
return gc;
}
};
ll pow(ll x, ll y) {
ll ans = 1;
while (y) {
if (y & 1)
ans = (ans * x) % 1000000007;
x = (x * x) % 1000000007;
y >>= 1;
}
return ans;
}
int main(void) {
eratosthenes a(1e6 + 1);
int N;
int A[10010];
int i, j;
ll ans = 0, B;
ll mul = 1;
cin >> N;
for (i = 0; i < N; i++) {
cin >> A[i];
for (auto &j : a.genosiscount(A[i])) {
for (auto &k : a.primes) {
if (j.first == k.first && j.second > k.second) {
k.second = j.second;
}
}
}
}
for (auto &x : a.primes) {
B = pow(x.first, x.second);
mul = mul * B % 1000000007;
}
for (i = 0; i < N; i++) {
ll add = mul * pow(A[i], 1000000005) % 1000000007;
ans = (ans + add) % 1000000007;
}
cout << ans << endl;
} | #include <algorithm>
#include <iostream>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
struct eratosthenes {
int n;
vector<int> f;
vector<pair<int, int>> primes;
eratosthenes(int n) : f(n + 1) {
ll i, j;
f[0] = f[1] = -1;
for (i = 2; i <= n; i++) {
if (!f[i]) {
f[i] = i;
primes.push_back(make_pair(i, 0));
for (j = i * i; j <= n; j += i) {
if (!f[j]) {
f[j] = i;
}
}
}
}
}
vector<int> genosis(int x) {
vector<int> g;
while (x != 1) {
g.push_back(f[x]);
x /= f[x];
}
return g;
}
vector<pair<int, int>> genosiscount(int x) {
vector<pair<int, int>> gc;
vector<int> g = genosis(x);
if (g.empty() == 1) {
return {};
}
gc.push_back(make_pair(f[x], 0));
for (auto &i : g) {
if (gc.back().first == i) {
gc.back().second++;
} else {
gc.push_back(make_pair(i, 1));
}
}
return gc;
}
};
ll pow(ll x, ll y) {
ll ans = 1;
while (y) {
if (y & 1)
ans = (ans * x) % 1000000007;
x = (x * x) % 1000000007;
y >>= 1;
}
return ans;
}
int main(void) {
eratosthenes a(1e6 + 1);
int N;
int A[10010];
int i, j;
ll ans = 0, B;
ll mul = 1;
cin >> N;
for (i = 0; i < N; i++) {
cin >> A[i];
for (auto &j : a.genosiscount(A[i])) {
for (auto &k : a.primes) {
if (j.first == k.first && j.second > k.second) {
k.second = j.second;
}
if (j.first < k.first) {
break;
}
}
}
}
for (auto &x : a.primes) {
B = pow(x.first, x.second);
mul = mul * B % 1000000007;
}
for (i = 0; i < N; i++) {
ll add = mul * pow(A[i], 1000000005) % 1000000007;
ans = (ans + add) % 1000000007;
}
cout << ans << endl;
} | insert | 90 | 90 | 90 | 94 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int>> RHEAP;
const int N = 10010, M = 100010, mod = 1e9 + 7;
int n;
int a[N], f[M];
int primes[M], cnt;
bool st[M];
int qp(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = (LL)res * a % mod;
a = (LL)a * a % mod;
b >>= 1;
}
return res;
}
void init(int n) {
for (int i = 2; i <= n; i++) {
if (!st[i])
primes[cnt++] = i;
for (int j = 0; primes[j] <= n / i; j++) {
st[primes[j] * i] = true;
if (i % primes[j] == 0)
break;
}
}
}
int main() {
init(M - 1);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
int x = a[i];
for (int i = 2; i <= x / i; i++)
if (x % i == 0) {
int cnt = 0;
while (x % i == 0) {
cnt++;
x /= i;
}
f[i] = max(f[i], cnt);
}
if (x > 1)
f[x] = max(f[x], 1);
}
int s = 1;
for (int i = 2; i < M; i++)
s = (LL)s * qp(i, f[i]) % mod;
int res = 0;
for (int i = 0; i < n; i++)
res = (res + (LL)s * qp(a[i], mod - 2) % mod) % mod;
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
#define F first
#define S second
#define PB push_back
using namespace std;
typedef long long LL;
typedef pair<int, int> PII;
typedef priority_queue<int> HEAP;
typedef priority_queue<int, vector<int>, greater<int>> RHEAP;
const int N = 10010, M = 1000010, mod = 1e9 + 7;
int n;
int a[N], f[M];
int primes[M], cnt;
bool st[M];
int qp(int a, int b) {
int res = 1;
while (b) {
if (b & 1)
res = (LL)res * a % mod;
a = (LL)a * a % mod;
b >>= 1;
}
return res;
}
void init(int n) {
for (int i = 2; i <= n; i++) {
if (!st[i])
primes[cnt++] = i;
for (int j = 0; primes[j] <= n / i; j++) {
st[primes[j] * i] = true;
if (i % primes[j] == 0)
break;
}
}
}
int main() {
init(M - 1);
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
int x = a[i];
for (int i = 2; i <= x / i; i++)
if (x % i == 0) {
int cnt = 0;
while (x % i == 0) {
cnt++;
x /= i;
}
f[i] = max(f[i], cnt);
}
if (x > 1)
f[x] = max(f[x], 1);
}
int s = 1;
for (int i = 2; i < M; i++)
s = (LL)s * qp(i, f[i]) % mod;
int res = 0;
for (int i = 0; i < n; i++)
res = (res + (LL)s * qp(a[i], mod - 2) % mod) % mod;
cout << res << endl;
return 0;
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
const ll MAX = 10000 + 2;
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 gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
// &１つはビット積
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
COMinit();
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) { cin >> A[i]; }
ll ans = 0;
rep(i, N) {
ans += inv[A[i]];
ans %= MOD;
}
ll maxn = 10e3 + 1;
map<ll, ll> gcm;
map<ll, ll> gcm_mp;
rep(i, N) {
gcm_mp.clear();
for (ll j = 2; j <= pow(A[i], 0.5); j++) {
while (A[i] % j == 0) {
gcm_mp[j]++;
A[i] /= j;
}
}
if (A[i] != 1) {
gcm_mp[A[i]]++;
}
for (auto it : gcm_mp) {
gcm[it.first] = max(gcm[it.first], it.second);
}
}
ll lcm = 1;
for (auto it : gcm) {
lcm *= modpow(it.first, it.second) % MOD;
// cout<<it.first << " "<< it.second<<"\n";
lcm %= MOD;
}
ans *= lcm;
ans %= MOD;
// cout<<lcm<<"\n";
cout << ans << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
const ll MAX = 1000000 + 2;
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 gcd(ll a, ll b) {
if (a < b)
return gcd(b, a);
ll r;
while ((r = a % b)) {
a = b;
b = r;
}
return b;
}
ll modpow(ll a, ll n) {
ll res = 1;
while (n > 0) {
// &１つはビット積
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
COMinit();
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) { cin >> A[i]; }
ll ans = 0;
rep(i, N) {
ans += inv[A[i]];
ans %= MOD;
}
ll maxn = 10e3 + 1;
map<ll, ll> gcm;
map<ll, ll> gcm_mp;
rep(i, N) {
gcm_mp.clear();
for (ll j = 2; j <= pow(A[i], 0.5); j++) {
while (A[i] % j == 0) {
gcm_mp[j]++;
A[i] /= j;
}
}
if (A[i] != 1) {
gcm_mp[A[i]]++;
}
for (auto it : gcm_mp) {
gcm[it.first] = max(gcm[it.first], it.second);
}
}
ll lcm = 1;
for (auto it : gcm) {
lcm *= modpow(it.first, it.second) % MOD;
// cout<<it.first << " "<< it.second<<"\n";
lcm %= MOD;
}
ans *= lcm;
ans %= MOD;
// cout<<lcm<<"\n";
cout << ans << "\n";
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int main() {
ll MOD = pow(10, 9) + 7;
int N;
cin >> N;
vector<ll> A(N);
vector<map<int64_t, int>> factors(N);
rep(i, N) cin >> A[i];
rep(i, N) factors[i] = prime_factor(A[i]);
map<int64_t, int> factor;
rep(i, N) {
map<int64_t, int> tmp = factors[i];
for (auto itr = tmp.begin(); itr != tmp.end(); ++itr) {
int64_t key = itr->first;
if (factor.find(key) != factor.end()) {
// 設定されている場合 2つのmaxを取って再設定する
factor[key] = max(factor[key], tmp[key]);
} else {
// 設定されていない場合
factor[key] = tmp[key];
}
}
}
// 最小公倍数を素因数分解した結果から答えを求める
mint ans = 0;
rep(i, N) {
mint r = 1;
map<int64_t, int> tmp = factors[i];
for (auto itr = factor.begin(); itr != factor.end(); itr++) {
int64_t key = itr->first;
if (tmp.find(key) != tmp.end()) {
// 設定されている場合 2つのmaxを取って再設定する
r *= mint(key).pow(factor[key] - tmp[key]);
} else {
r *= mint(key).pow(factor[key]);
}
}
ans += r;
}
cout << ans.x << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
int main() {
ll MOD = pow(10, 9) + 7;
int N;
cin >> N;
vector<ll> A(N);
vector<map<int64_t, int>> factors(N);
rep(i, N) cin >> A[i];
rep(i, N) factors[i] = prime_factor(A[i]);
map<int64_t, int> factor;
rep(i, N) {
map<int64_t, int> tmp = factors[i];
for (auto itr = tmp.begin(); itr != tmp.end(); ++itr) {
int64_t key = itr->first;
if (factor.find(key) != factor.end()) {
// 設定されている場合 2つのmaxを取って再設定する
factor[key] = max(factor[key], tmp[key]);
} else {
// 設定されていない場合
factor[key] = tmp[key];
}
}
}
// 最小公倍数を素因数分解した結果から答えを求める
mint ans = 0;
mint lcm = 1;
for (auto itr = factor.begin(); itr != factor.end(); itr++) {
int64_t key = itr->first;
lcm *= mint(key).pow(factor[key]);
}
for (auto a : A) {
ans += lcm / a;
}
cout << ans.x << endl;
return 0;
}
| replace | 100 | 113 | 100 | 107 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF = 1e9 + 7;
const ll LINF = 9223372036854775807;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld EPS = 1e-10; // 微調整用（EPSより小さいと0と判定など）
int ii() {
int x;
if (scanf("%d", &x) == 1)
return x;
else
return 0;
}
long long il() {
long long x;
if (scanf("%lld", &x) == 1)
return x;
else
return 0;
}
string is() {
string x;
cin >> x;
return x;
}
char ic() {
char x;
cin >> x;
return x;
}
void oi(int x) { printf("%d ", x); }
void ol(long long x) { printf("%lld ", x); }
void od_nosp(double x) { printf("%.15f", x); } // 古い問題用
void od(double x) { printf("%.15f ", x); }
// long doubleで受け取り、fをLfなどに変えて出力すると、変な数値が出る
// それをなんとかするには独自の出力を作らなければならなそう
void os(const string &s) { printf("%s ", s.c_str()); }
void oc(const char &c) { printf("%c ", c); }
#define o_map(v) \
{ \
cerr << #v << endl; \
for (const auto &xxx : v) { \
cout << xxx.first << " " << xxx.second << "\n"; \
} \
} // 動作未確認
void br() { putchar('\n'); }
// #define gcd __gcd //llは受け取らない C++17~のgcdと違うので注意
// int lcm(int a, int b){return a / gcd(a, b) * b;}
#define begin_end(a) a.begin(), a.end() // sort(begin_end(vec));
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define DREP(i, m, n) for (ll i = (ll)(m); i > (ll)(n); i--)
#define rep(i, n) REP(i, 0, n)
#define m_p(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define p_b push_back
#define SZ(x) ((ll)(x).size()) // size()がunsignedなのでエラー避けに
#define endk '\n'
// coutによるpairの出力（空白区切り）
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << " " << p.second << ")";
}
// coutによるvectorの出力（空白区切り）
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " "; //"\t"に変えるとTabで見やすく区切る
}
return s;
}
// coutによる多次元vectorの出力（空白区切り）
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
// 最大値、最小値の更新。更新したor等しければtrueを返す
template <typename T> bool chmax(T &a, T b) { return (a = max(a, b)) == b; }
template <typename T> bool chmin(T &a, T b) { return (a = min(a, b)) == b; }
// 4近傍（上下左右） rep(i, 2) にすると右・下だけに進む
vector<int> dx_4 = {1, 0, -1, 0};
vector<int> dy_4 = {0, 1, 0, -1};
// -------- template end - //
// - library ------------- //
// modint: mod 計算を int を扱うように扱える構造体
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
// エラトステネスの篩に基づく高速な素因数分解
// 前処理したあと O(logN)でNを素因数分解
// 以下のページのライブラリを改造したもの
// https://qiita.com/rsk0315_h4x/items/ff3b542a4468679fb409
class smart_sieve {
ll L, R, M;
std::vector<int> small; // 小さい篩
std::vector<std::vector<ll>> large; // 大きい篩
std::vector<ll> aux; // aux[i] := large[i] の素因数の積
public:
smart_sieve(ll L, ll R) : L(L), R(R), M(sqrt(R) + 1) {
small.resize(M);
std::iota(small.begin(), small.end(), 0);
large.resize(R - L);
aux.assign(R - L, 1);
for (ll i = 2; i * i < R; ++i) {
if (small[i] < i)
continue;
small[i] = i;
for (ll j = i * i; j < M; j += i)
if (small[j] == j)
small[j] = i;
for (ll j = (L + i - 1) / i * i; j < R; j += i) {
ll k = j;
do {
// aux[j-L] > M で判定した方がいいかも？
// j / aux[j-L] < M の方がいい？（割り算したくない）
if (aux[j - L] * aux[j - L] > R)
break;
large[j - L].push_back(i);
aux[j - L] *= i;
k /= i;
} while (k % i == 0);
}
}
}
// 素因数分解 O(logN)
// factor(i) : i の素因数vector : f(120) = 2 2 2 3 5（ソート済）
// 0 を渡すと おかしい答えが返ってくる。
// 1 を渡すと {} を返す。
std::vector<ll> prime_factorize(ll n) {
assert(L <= n && n < R);
std::vector<ll> res = large[n - L];
n /= aux[n - L];
if (n >= M) {
// この場合，n は素数となることが示せる（はず）
// n*n >= R だとオーバーフローしそう？
res.push_back(n);
return res;
}
while (n > 1) {
res.push_back(small[n]);
n /= small[n];
}
return res;
}
// 約数列挙ライブラリ（ llpow() を含めること！）
// 非ソート約数列挙 O(logN)+O(dN) ※第二引数を渡さない場合
// ソート約数列挙 O(logN)+O(dN)+O(dNlogdN) ※第二引数を true に
// ※ dN = d(N) = σ0(N) = 自然数Nの約数の個数
// ソート約数列挙をする際は約数の個数に注意
// その範囲の高度合成数を見れば、約数の個数のmaxが大体分かる
// （高度合成数一覧）http://wwwhomes.uni-bielefeld.de/achim/highly.txt
// N<=10^9のとき、log(N)=約30, 約数の個数の最大は735,134,400の1,344個
// --> ソート約数列挙 : 30+1344+1344*30= 41,694回
// N<=10^8 のとき O(27)+O(768)+O(768*27)= 21,531回
// N<=10^7のときd(N)最大は448, N<=10^6のときd(N)最大は240
// 結論：ソート約数列挙はlong
// longの範囲内なら全部いけそうだが、1~Nについて行うのは10^5でギリギリか
std::vector<ll> divisors(ll n, bool sorted = false) {
assert(L <= n && n < R);
std::vector<ll> pfactors = large[n - L];
n /= aux[n - L];
bool n_is_prime = false;
if (n >= M) {
// この場合，n は素数となることが示せる（はず）
// n*n >= R だとオーバーフローしそう？
pfactors.push_back(n);
n_is_prime = true;
}
if (!n_is_prime) {
while (n > 1) {
pfactors.push_back(small[n]);
n /= small[n];
}
}
map<ll, ll> map_pfactors;
for (ll pfac : pfactors) {
map_pfactors[pfac]++;
}
// 約数列挙
std::vector<ll> res;
ll len = map_pfactors.size(); // 素因数の種類数
// 再帰関数で約数を列挙
make_divisors_from_pfacs(map_pfactors, res, 1, 0);
// 第二引数が true だった場合、 res をソート
if (sorted)
sort(res.begin(), res.end());
return res;
}
// <素因数, 個数> のmapを受け取り、vector resに約数を入れる再帰関数
// depth := 今見るべき素因数が何個目か(0-indexed) -> map_pfactors[depth]
void make_divisors_from_pfacs(map<ll, ll> &map_pfactors, vector<ll> &divs_vec,
ll nowres, ll depth) {
auto itr = next(map_pfactors.begin(), depth);
if (itr == map_pfactors.end()) {
// 全ての素因数を処理し終わったので、約数をvectorに入れて終了
// 素因数が1つも無い場合（n=1の場合）、最初からこれになるので、1のみが約数として返される
divs_vec.push_back(nowres);
return;
}
ll nowpfac = (*itr).first;
ll nowpfacnum = (*itr).second;
ll multiplier = 1;
rep(i, nowpfacnum + 1) {
ll tmpres = nowres * multiplier;
make_divisors_from_pfacs(map_pfactors, divs_vec, tmpres, depth + 1);
multiplier *= nowpfac;
}
}
};
// smart_sieve(L, R) で [L, R) を前計算
ll L = 2;
ll R = 1000001;
smart_sieve ss(L, R);
// --------- library end - //
int main() {
ll N = il();
vector<ll> as;
rep(i, N) { as.push_back(il()); }
// lcmsum_pfacs :=
// a1~anの最小公倍数を求めるため、a1~anまでを素因数分解し、各素因数の指数をchmaxしていったものを格納するmap
map<ll, ll> lcmsum_pfacs;
// 各aiの素因数分解を格納する
vector<vector<ll>> as_pfacs(N, vector<ll>());
// 素因数の指数をmapにして、lcmsum_pfacsのchmaxをしていく
rep(i, N) {
as_pfacs[i] = ss.prime_factorize(as[i]);
map<ll, ll> pfac_cnt;
for (ll ai_pfac : as_pfacs[i]) {
pfac_cnt[ai_pfac]++;
}
for (pll eachpfac : pfac_cnt) {
chmax(lcmsum_pfacs[eachpfac.first], eachpfac.second);
}
}
// lcmsum を求める
// lcmsum := a1~anの最小公倍数 mod P
mint lcmsum = 1;
for (pll eachpfac : lcmsum_pfacs) {
mint pfac = eachpfac.first;
ll cnt = eachpfac.second;
rep(i, cnt) lcmsum *= pfac;
}
// ここから先はmodintで処理する
// 答えの計算
// Σ(i:1~N)lcmsum/ai
mint ans = 0;
rep(i, N) ans += lcmsum / mint(as[i]);
cout << ans << endk;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;
const int INF = 1e9 + 7;
const ll LINF = 9223372036854775807;
const ll MOD = 1e9 + 7;
const ld PI = acos(-1);
const ld EPS = 1e-10; // 微調整用（EPSより小さいと0と判定など）
int ii() {
int x;
if (scanf("%d", &x) == 1)
return x;
else
return 0;
}
long long il() {
long long x;
if (scanf("%lld", &x) == 1)
return x;
else
return 0;
}
string is() {
string x;
cin >> x;
return x;
}
char ic() {
char x;
cin >> x;
return x;
}
void oi(int x) { printf("%d ", x); }
void ol(long long x) { printf("%lld ", x); }
void od_nosp(double x) { printf("%.15f", x); } // 古い問題用
void od(double x) { printf("%.15f ", x); }
// long doubleで受け取り、fをLfなどに変えて出力すると、変な数値が出る
// それをなんとかするには独自の出力を作らなければならなそう
void os(const string &s) { printf("%s ", s.c_str()); }
void oc(const char &c) { printf("%c ", c); }
#define o_map(v) \
{ \
cerr << #v << endl; \
for (const auto &xxx : v) { \
cout << xxx.first << " " << xxx.second << "\n"; \
} \
} // 動作未確認
void br() { putchar('\n'); }
// #define gcd __gcd //llは受け取らない C++17~のgcdと違うので注意
// int lcm(int a, int b){return a / gcd(a, b) * b;}
#define begin_end(a) a.begin(), a.end() // sort(begin_end(vec));
#define REP(i, m, n) for (ll i = (ll)(m); i < (ll)(n); i++)
#define DREP(i, m, n) for (ll i = (ll)(m); i > (ll)(n); i--)
#define rep(i, n) REP(i, 0, n)
#define m_p(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define p_b push_back
#define SZ(x) ((ll)(x).size()) // size()がunsignedなのでエラー避けに
#define endk '\n'
// coutによるpairの出力（空白区切り）
template <typename T1, typename T2>
ostream &operator<<(ostream &s, const pair<T1, T2> &p) {
return s << "(" << p.first << " " << p.second << ")";
}
// coutによるvectorの出力（空白区切り）
template <typename T> ostream &operator<<(ostream &s, const vector<T> &v) {
int len = v.size();
for (int i = 0; i < len; ++i) {
s << v[i];
if (i < len - 1)
s << " "; //"\t"に変えるとTabで見やすく区切る
}
return s;
}
// coutによる多次元vectorの出力（空白区切り）
template <typename T>
ostream &operator<<(ostream &s, const vector<vector<T>> &vv) {
int len = vv.size();
for (int i = 0; i < len; ++i) {
s << vv[i] << endl;
}
return s;
}
// 最大値、最小値の更新。更新したor等しければtrueを返す
template <typename T> bool chmax(T &a, T b) { return (a = max(a, b)) == b; }
template <typename T> bool chmin(T &a, T b) { return (a = min(a, b)) == b; }
// 4近傍（上下左右） rep(i, 2) にすると右・下だけに進む
vector<int> dx_4 = {1, 0, -1, 0};
vector<int> dy_4 = {0, 1, 0, -1};
// -------- template end - //
// - library ------------- //
// modint: mod 計算を int を扱うように扱える構造体
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
val += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
// エラトステネスの篩に基づく高速な素因数分解
// 前処理したあと O(logN)でNを素因数分解
// 以下のページのライブラリを改造したもの
// https://qiita.com/rsk0315_h4x/items/ff3b542a4468679fb409
class smart_sieve {
ll L, R, M;
std::vector<int> small; // 小さい篩
std::vector<std::vector<ll>> large; // 大きい篩
std::vector<ll> aux; // aux[i] := large[i] の素因数の積
public:
smart_sieve(ll L, ll R) : L(L), R(R), M(sqrt(R) + 1) {
small.resize(M);
std::iota(small.begin(), small.end(), 0);
large.resize(R - L);
aux.assign(R - L, 1);
for (ll i = 2; i * i < R; ++i) {
if (small[i] < i)
continue;
small[i] = i;
for (ll j = i * i; j < M; j += i)
if (small[j] == j)
small[j] = i;
for (ll j = (L + i - 1) / i * i; j < R; j += i) {
ll k = j;
do {
// aux[j-L] > M で判定した方がいいかも？
// j / aux[j-L] < M の方がいい？（割り算したくない）
if (aux[j - L] * aux[j - L] > R)
break;
large[j - L].push_back(i);
aux[j - L] *= i;
k /= i;
} while (k % i == 0);
}
}
}
// 素因数分解 O(logN)
// factor(i) : i の素因数vector : f(120) = 2 2 2 3 5（ソート済）
// 0 を渡すと おかしい答えが返ってくる。
// 1 を渡すと {} を返す。
std::vector<ll> prime_factorize(ll n) {
assert(L <= n && n < R);
std::vector<ll> res = large[n - L];
n /= aux[n - L];
if (n >= M) {
// この場合，n は素数となることが示せる（はず）
// n*n >= R だとオーバーフローしそう？
res.push_back(n);
return res;
}
while (n > 1) {
res.push_back(small[n]);
n /= small[n];
}
return res;
}
// 約数列挙ライブラリ（ llpow() を含めること！）
// 非ソート約数列挙 O(logN)+O(dN) ※第二引数を渡さない場合
// ソート約数列挙 O(logN)+O(dN)+O(dNlogdN) ※第二引数を true に
// ※ dN = d(N) = σ0(N) = 自然数Nの約数の個数
// ソート約数列挙をする際は約数の個数に注意
// その範囲の高度合成数を見れば、約数の個数のmaxが大体分かる
// （高度合成数一覧）http://wwwhomes.uni-bielefeld.de/achim/highly.txt
// N<=10^9のとき、log(N)=約30, 約数の個数の最大は735,134,400の1,344個
// --> ソート約数列挙 : 30+1344+1344*30= 41,694回
// N<=10^8 のとき O(27)+O(768)+O(768*27)= 21,531回
// N<=10^7のときd(N)最大は448, N<=10^6のときd(N)最大は240
// 結論：ソート約数列挙はlong
// longの範囲内なら全部いけそうだが、1~Nについて行うのは10^5でギリギリか
std::vector<ll> divisors(ll n, bool sorted = false) {
assert(L <= n && n < R);
std::vector<ll> pfactors = large[n - L];
n /= aux[n - L];
bool n_is_prime = false;
if (n >= M) {
// この場合，n は素数となることが示せる（はず）
// n*n >= R だとオーバーフローしそう？
pfactors.push_back(n);
n_is_prime = true;
}
if (!n_is_prime) {
while (n > 1) {
pfactors.push_back(small[n]);
n /= small[n];
}
}
map<ll, ll> map_pfactors;
for (ll pfac : pfactors) {
map_pfactors[pfac]++;
}
// 約数列挙
std::vector<ll> res;
ll len = map_pfactors.size(); // 素因数の種類数
// 再帰関数で約数を列挙
make_divisors_from_pfacs(map_pfactors, res, 1, 0);
// 第二引数が true だった場合、 res をソート
if (sorted)
sort(res.begin(), res.end());
return res;
}
// <素因数, 個数> のmapを受け取り、vector resに約数を入れる再帰関数
// depth := 今見るべき素因数が何個目か(0-indexed) -> map_pfactors[depth]
void make_divisors_from_pfacs(map<ll, ll> &map_pfactors, vector<ll> &divs_vec,
ll nowres, ll depth) {
auto itr = next(map_pfactors.begin(), depth);
if (itr == map_pfactors.end()) {
// 全ての素因数を処理し終わったので、約数をvectorに入れて終了
// 素因数が1つも無い場合（n=1の場合）、最初からこれになるので、1のみが約数として返される
divs_vec.push_back(nowres);
return;
}
ll nowpfac = (*itr).first;
ll nowpfacnum = (*itr).second;
ll multiplier = 1;
rep(i, nowpfacnum + 1) {
ll tmpres = nowres * multiplier;
make_divisors_from_pfacs(map_pfactors, divs_vec, tmpres, depth + 1);
multiplier *= nowpfac;
}
}
};
// smart_sieve(L, R) で [L, R) を前計算
ll L = 1;
ll R = 1000001;
smart_sieve ss(L, R);
// --------- library end - //
int main() {
ll N = il();
vector<ll> as;
rep(i, N) { as.push_back(il()); }
// lcmsum_pfacs :=
// a1~anの最小公倍数を求めるため、a1~anまでを素因数分解し、各素因数の指数をchmaxしていったものを格納するmap
map<ll, ll> lcmsum_pfacs;
// 各aiの素因数分解を格納する
vector<vector<ll>> as_pfacs(N, vector<ll>());
// 素因数の指数をmapにして、lcmsum_pfacsのchmaxをしていく
rep(i, N) {
as_pfacs[i] = ss.prime_factorize(as[i]);
map<ll, ll> pfac_cnt;
for (ll ai_pfac : as_pfacs[i]) {
pfac_cnt[ai_pfac]++;
}
for (pll eachpfac : pfac_cnt) {
chmax(lcmsum_pfacs[eachpfac.first], eachpfac.second);
}
}
// lcmsum を求める
// lcmsum := a1~anの最小公倍数 mod P
mint lcmsum = 1;
for (pll eachpfac : lcmsum_pfacs) {
mint pfac = eachpfac.first;
ll cnt = eachpfac.second;
rep(i, cnt) lcmsum *= pfac;
}
// ここから先はmodintで処理する
// 答えの計算
// Σ(i:1~N)lcmsum/ai
mint ans = 0;
rep(i, N) ans += lcmsum / mint(as[i]);
cout << ans << endk;
} | replace | 305 | 306 | 305 | 306 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
vector<int> prime;
void setPrime() {
for (int i = 2; i <= 1000; i++) {
bool ok = true;
for (int e : prime) {
if (i % e == 0) {
ok = false;
break;
}
}
if (ok)
prime.push_back(i);
}
}
int main() {
int n;
cin >> n;
mint ans(0);
setPrime();
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
map<int, int> m;
rep(i, n) {
int j = 0;
int v = a[i];
map<int, int> temp;
while (prime[j] * prime[j] <= v) {
if (v % prime[j] == 0) {
v /= prime[j];
temp[prime[j]]++;
} else {
j++;
}
}
temp[v]++;
for (auto t : temp) {
if (m[t.first] < t.second) {
m[t.first] = t.second;
}
}
}
mint lcm(1);
for (auto e : m) {
rep(i, e.second) { lcm *= mint(e.first); }
}
rep(i, n) {
mint v = mint(a[i]);
ans += (lcm / v);
}
cout << ans.x << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define whole(x) (x).begin(), (x).end()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
vector<int> prime;
void setPrime() {
for (int i = 2; i <= 1000; i++) {
bool ok = true;
for (int e : prime) {
if (i % e == 0) {
ok = false;
break;
}
}
if (ok)
prime.push_back(i);
}
}
int main() {
int n;
cin >> n;
mint ans(0);
setPrime();
vector<int> a(n);
rep(i, n) { cin >> a[i]; }
map<int, int> m;
rep(i, n) {
int j = 0;
int v = a[i];
map<int, int> temp;
while (j < prime.size() && prime[j] * prime[j] <= v) {
if (v % prime[j] == 0) {
v /= prime[j];
temp[prime[j]]++;
} else {
j++;
}
}
temp[v]++;
for (auto t : temp) {
if (m[t.first] < t.second) {
m[t.first] = t.second;
}
}
}
mint lcm(1);
for (auto e : m) {
rep(i, e.second) { lcm *= mint(e.first); }
}
rep(i, n) {
mint v = mint(a[i]);
ans += (lcm / v);
}
cout << ans.x << endl;
return 0;
}
| replace | 87 | 88 | 87 | 88 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
long long mod = pow(10, 9) + 7;
long long pow_mod(long long a, long long b) {
if (b == 0)
return 1;
long long k = pow_mod(a, b / 2);
long long kk = k * k % mod;
if (b & 1) {
return kk * a % mod;
} else {
return kk;
}
}
int MA = pow(10, 6);
vector<bool> pf(MA + 1, true);
vector<long long> P;
int main() {
pf[0] = pf[1] = false;
for (int i = 2; i <= MA; i++) {
if (pf[i]) {
P.push_back(i);
for (int j = i + i; j <= MA; j += i) {
pf[j] = false;
}
}
}
long long N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
long long ans = 0;
for (int i = 0; i < N; i++) {
ans += pow_mod(A[i], mod - 2);
ans %= mod;
}
map<int, int> mp;
for (int i = 0; i < N; i++) {
long long k = A[i];
for (auto p : P) {
int c = 0;
while (k % p == 0) {
c++;
k /= p;
}
mp[p] = max(mp[p], c);
if (k == 1)
break;
}
}
for (auto x : mp) {
ans *= pow_mod(x.first, x.second);
ans %= mod;
}
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
long long mod = pow(10, 9) + 7;
long long pow_mod(long long a, long long b) {
if (b == 0)
return 1;
long long k = pow_mod(a, b / 2);
long long kk = k * k % mod;
if (b & 1) {
return kk * a % mod;
} else {
return kk;
}
}
int MA = pow(10, 6);
vector<bool> pf(MA + 1, true);
vector<long long> P;
int main() {
pf[0] = pf[1] = false;
for (int i = 2; i <= MA; i++) {
if (pf[i]) {
P.push_back(i);
for (int j = i + i; j <= MA; j += i) {
pf[j] = false;
}
}
}
long long N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++)
cin >> A[i];
long long ans = 0;
for (int i = 0; i < N; i++) {
ans += pow_mod(A[i], mod - 2);
ans %= mod;
}
map<int, int> mp;
for (int i = 0; i < N; i++) {
long long k = A[i];
for (auto p : P) {
if (pf[k]) {
mp[k] = max(mp[k], 1);
break;
}
int c = 0;
while (k % p == 0) {
c++;
k /= p;
}
mp[p] = max(mp[p], c);
if (k == 1)
break;
}
}
for (auto x : mp) {
ans *= pow_mod(x.first, x.second);
ans %= mod;
}
cout << ans << endl;
} | insert | 41 | 41 | 41 | 45 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << endl
#define p7(a, b, c, d, e, f, g) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v) \
for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n) \
idp { \
rep(i, n) { cout << x[i] << " "; } \
puts(""); \
}
#define dump2(x, n) \
idp { \
rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; } \
puts(""); \
}
#define dumpi(x) \
idp { \
foreach (it, x) { \
cout << (*it) << " "; \
} \
puts(""); \
}
#define dumpi2(x) \
idp { \
foreach (it, x) { \
cout << "[" << (it)->F << " , " << (it)->S << "] "; \
} \
puts(""); \
}
#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h) \
rep(i, h) { \
rep(j, w) cout << a[i][j] << " "; \
puts(""); \
}
typedef pair<li, li> PI;
#define PRIME_MAX 1000001
bool isp[PRIME_MAX] = {false};
vector<li> primes;
inline void prime_init() {
repp(i, 2, PRIME_MAX) isp[i] = true;
repp(i, 2, sqrt(PRIME_MAX) + 2) {
if (isp[i]) {
for (li j = 2; i * j < PRIME_MAX; j++) {
isp[i * j] = false;
}
}
}
rep(i, PRIME_MAX) if (isp[i]) primes.pb(i);
}
inline unordered_map<li, li> decom(li x) {
vector<PI> res;
rep(i, sz(primes)) {
li tres = 0;
while (x % primes[i] == 0) {
tres++;
x /= primes[i];
}
if (tres > 0)
res.pb({primes[i], tres});
if (x <= 1)
break;
}
if (x > 1) {
res.pb({x, 1});
}
unordered_map<li, li> ress;
for (auto &&v : res) {
ress[v.F] = v.S;
}
return ress;
}
li n;
li a[10010];
inline void lcm(unordered_map<li, li> &x, const unordered_map<li, li> &y) {
for (auto &&kv : y) {
x[kv.F] = max(x[kv.F], kv.S);
}
}
// a x + b y = gcd(a, b)
inline li extgcd(li a, li b, li &x, li &y) {
li g = a;
x = 1;
y = 0;
if (b != 0)
g = extgcd(b, a % b, y, x), y -= (a / b) * x;
return g;
}
inline li invMod(li a) {
li x, y;
if (extgcd(a, MOD, x, y) == 1)
return (x + MOD) % MOD;
else
return 0; // unsolvable
}
inline li calc(unordered_map<li, li> &x) {
li res = 1;
for (auto &&kv : x) {
rep(i, kv.S) { res = (res * kv.F) % MOD; }
}
return res;
}
int main() {
prime_init();
cin >> n;
unordered_map<li, li> l;
rin {
cin >> a[i];
lcm(l, decom(a[i]));
}
li ll = calc(l);
li res = 0;
rin { res += ll * invMod(a[i]) % MOD; }
cout << res % MOD << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define li long long int
#define rep(i, to) for (li i = 0; i < ((li)(to)); i++)
#define repp(i, start, to) for (li i = (li)(start); i < ((li)(to)); i++)
#define pb push_back
#define sz(v) ((li)(v).size())
#define bgn(v) ((v).begin())
#define eend(v) ((v).end())
#define allof(v) (v).begin(), (v).end()
#define dodp(v, n) memset(v, (li)n, sizeof(v))
#define bit(n) (1ll << (li)(n))
#define mp(a, b) make_pair(a, b)
#define rin rep(i, n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;
#define INF bit(60)
#define DBGP 1
#define idp if (DBGP)
#define F first
#define S second
#define p2(a, b) idp cout << a << "\t" << b << endl
#define p3(a, b, c) idp cout << a << "\t" << b << "\t" << c << endl
#define p4(a, b, c, d) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << endl
#define p5(a, b, c, d, e) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << endl
#define p6(a, b, c, d, e, f) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << endl
#define p7(a, b, c, d, e, f, g) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << endl
#define p8(a, b, c, d, e, f, g, h) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << endl
#define p9(a, b, c, d, e, f, g, h, i) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << "\t" << i << endl
#define p10(a, b, c, d, e, f, g, h, i, j) \
idp cout << a << "\t" << b << "\t" << c << "\t" << d << "\t" << e << "\t" \
<< f << "\t" << g << "\t" << h << "\t" << i << "\t" << j << endl
#define foreach(it, v) \
for (__typeof((v).begin()) it = (v).begin(); it != (v).end(); ++it)
#define p2p(x) idp p2((x).F, (x).S)
#define dump(x, n) \
idp { \
rep(i, n) { cout << x[i] << " "; } \
puts(""); \
}
#define dump2(x, n) \
idp { \
rep(i, n) { cout << "[" << x[i].F << " , " << x[i].S << "] "; } \
puts(""); \
}
#define dumpi(x) \
idp { \
foreach (it, x) { \
cout << (*it) << " "; \
} \
puts(""); \
}
#define dumpi2(x) \
idp { \
foreach (it, x) { \
cout << "[" << (it)->F << " , " << (it)->S << "] "; \
} \
puts(""); \
}
#define read2d(a, w, h) rep(i, h) rep(j, w) cin >> a[i][j]
#define dump2d(a, w, h) \
rep(i, h) { \
rep(j, w) cout << a[i][j] << " "; \
puts(""); \
}
typedef pair<li, li> PI;
#define PRIME_MAX 1000001
bool isp[PRIME_MAX] = {false};
vector<li> primes;
inline void prime_init() {
repp(i, 2, PRIME_MAX) isp[i] = true;
repp(i, 2, sqrt(PRIME_MAX) + 2) {
if (isp[i]) {
for (li j = 2; i * j < PRIME_MAX; j++) {
isp[i * j] = false;
}
}
}
rep(i, PRIME_MAX) if (isp[i]) primes.pb(i);
}
inline unordered_map<li, li> decom(li x) {
vector<PI> res;
rep(i, sz(primes)) {
if (primes[i] > 1000) {
break;
}
li tres = 0;
while (x % primes[i] == 0) {
tres++;
x /= primes[i];
}
if (tres > 0)
res.pb({primes[i], tres});
if (x <= 1)
break;
}
if (x > 1) {
res.pb({x, 1});
}
unordered_map<li, li> ress;
for (auto &&v : res) {
ress[v.F] = v.S;
}
return ress;
}
li n;
li a[10010];
inline void lcm(unordered_map<li, li> &x, const unordered_map<li, li> &y) {
for (auto &&kv : y) {
x[kv.F] = max(x[kv.F], kv.S);
}
}
// a x + b y = gcd(a, b)
inline li extgcd(li a, li b, li &x, li &y) {
li g = a;
x = 1;
y = 0;
if (b != 0)
g = extgcd(b, a % b, y, x), y -= (a / b) * x;
return g;
}
inline li invMod(li a) {
li x, y;
if (extgcd(a, MOD, x, y) == 1)
return (x + MOD) % MOD;
else
return 0; // unsolvable
}
inline li calc(unordered_map<li, li> &x) {
li res = 1;
for (auto &&kv : x) {
rep(i, kv.S) { res = (res * kv.F) % MOD; }
}
return res;
}
int main() {
prime_init();
cin >> n;
unordered_map<li, li> l;
rin {
cin >> a[i];
lcm(l, decom(a[i]));
}
li ll = calc(l);
li res = 0;
rin { res += ll * invMod(a[i]) % MOD; }
cout << res % MOD << endl;
return 0;
} | insert | 105 | 105 | 105 | 108 | TLE | |
p02793 | C++ | Runtime Error | #pragma GCC optimize(3)
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, a[1005], f[1000005], mod = 1e9 + 7;
int inv[1000005];
signed main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
int t = a[i];
for (int j = 2; j * j <= a[i]; j++) {
if (t % j == 0) {
int sum = 0;
while (t % j == 0) {
t /= j;
sum++;
}
f[j] = max(f[j], sum);
}
}
if (t != 1) {
if (!f[t])
f[t] = 1;
}
}
int p = 1;
for (int i = 2; i < 1000000; i++) {
for (int j = 0; j < f[i]; j++)
p = p * i % mod;
}
inv[1] = 1;
for (int i = 2; i <= 1000000; i++)
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = ans + p * inv[a[i]];
ans = ans % mod;
}
cout << ans;
return 0;
}
| #pragma GCC optimize(3)
#include <bits/stdc++.h>
#define int long long
using namespace std;
int n, a[10005], f[1000005], mod = 1e9 + 7;
int inv[1000005];
signed main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> a[i];
int t = a[i];
for (int j = 2; j * j <= a[i]; j++) {
if (t % j == 0) {
int sum = 0;
while (t % j == 0) {
t /= j;
sum++;
}
f[j] = max(f[j], sum);
}
}
if (t != 1) {
if (!f[t])
f[t] = 1;
}
}
int p = 1;
for (int i = 2; i < 1000000; i++) {
for (int j = 0; j < f[i]; j++)
p = p * i % mod;
}
inv[1] = 1;
for (int i = 2; i <= 1000000; i++)
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
int ans = 0;
for (int i = 1; i <= n; i++) {
ans = ans + p * inv[a[i]];
ans = ans % mod;
}
cout << ans;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02793 | C++ | Runtime Error | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#define repe(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define mst(a, b) memset((a), (b), sizeof(a))
#define gc() gutchar()
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pr;
typedef long long ll;
const double eps = 1e-5;
const int inf = 0x3f3f3f3f;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const ll mod = 1e9 + 7;
const int N = 1e4 + 5;
ll p[N], mp[N];
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res % mod;
}
int main() {
ll n, cs = 0;
scanf("%lld", &n);
repe(i, 1, n) {
scanf("%lld", &p[i]);
cs = max(cs, p[i]);
}
for (ll i = 1; i <= n; i++) {
ll x = p[i];
ll y = sqrt(x);
for (ll j = 2; j <= y; j++) {
ll cnt = 0;
while (x % j == 0) {
x /= j;
cnt++;
}
mp[j] = max(mp[j], cnt);
}
if (x != 1)
mp[x] = max(mp[x], 1ll);
}
ll sum = 1;
for (ll i = 1; i <= cs; i++)
sum = (sum % mod * power(i, mp[i]) % mod) % mod;
ll res = 0;
for (ll i = 1; i <= n; i++)
res += sum * power(p[i], mod - 2) % mod;
cout << res % mod << '\n';
return 0;
} | // #include <bits/stdc++.h>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <iostream>
#define repe(i, a, b) for (int i = (a); i <= (b); i++)
#define rep(i, a, b) for (int i = (a); i < (b); i++)
#define mst(a, b) memset((a), (b), sizeof(a))
#define gc() gutchar()
#define fi first
#define se second
using namespace std;
typedef pair<int, int> pr;
typedef long long ll;
const double eps = 1e-5;
const int inf = 0x3f3f3f3f;
const int dx[] = {-1, 0, 0, 1};
const int dy[] = {0, -1, 1, 0};
const ll mod = 1e9 + 7;
const int N = 1e6 + 5;
ll p[N], mp[N];
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = res * a % mod;
a = a * a % mod;
b >>= 1;
}
return res % mod;
}
int main() {
ll n, cs = 0;
scanf("%lld", &n);
repe(i, 1, n) {
scanf("%lld", &p[i]);
cs = max(cs, p[i]);
}
for (ll i = 1; i <= n; i++) {
ll x = p[i];
ll y = sqrt(x);
for (ll j = 2; j <= y; j++) {
ll cnt = 0;
while (x % j == 0) {
x /= j;
cnt++;
}
mp[j] = max(mp[j], cnt);
}
if (x != 1)
mp[x] = max(mp[x], 1ll);
}
ll sum = 1;
for (ll i = 1; i <= cs; i++)
sum = (sum % mod * power(i, mp[i]) % mod) % mod;
ll res = 0;
for (ll i = 1; i <= n; i++)
res += sum * power(p[i], mod - 2) % mod;
cout << res % mod << '\n';
return 0;
} | replace | 19 | 20 | 19 | 20 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
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();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef map<int, int> MII;
typedef queue<int> QI;
typedef queue<PII> QPII;
typedef stack<int> SI;
typedef stack<PII> SPII;
typedef deque<int> DI;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQI; // 大きい順
typedef priority_queue<int, VI, greater<int>> PQGI;
typedef priority_queue<PII> PQP;
typedef priority_queue<PII, VPII, greater<int>> PQGP;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define PF push_front
#define POB pop_back()
#define POF pop_front()
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define LB lower_bound
#define UB upper_bound
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
#define FI first
#define SE second
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, a, b) for (int i = (b - 1); i >= a; i--)
#define REPR(i, n) FORR(i, 0, n)
#define BREP(bit, N) for (int bit = 0; bit < (1 << N); ++bit)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX / 2;
const LL LINF = LLONG_MAX / 2;
const LL MOD = 1e9 + 7;
const LL MODD = 998244353;
const int MAX = 510000;
// other
//-------------------------------------------
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;
}
#define SEP(a) cout << fixed << setprecision(a)
#define COUT(x) cout << (x) << endl
#define COUT2(x) cout << (x)
#define ENDL cout << endl
#define SPACE cout << " "
VI dx = {1, 0, -1, 0, 1, 1, -1, -1};
VI dy = {0, 1, 0, -1, 1, -1, 1, -1};
VC dc = {'R', 'D', 'L', 'U'};
VS ds = {"R", "D", "L", "U", "RD", "RU", "LD", "LU"};
LL Gcd(LL a, LL b) { return __gcd(a, b); }
LL Lcm(LL a, LL b) {
LL abd = Gcd(a, b);
LL x = a / abd, y = b;
return x * y;
}
LL ModPow(LL A, LL N, LL M) {
LL res = 1;
while (N > 0) {
if (N & 1)
res = res * A % M;
A = A * A % M;
N >>= 1;
}
return res;
}
LL fac[MAX], finv[MAX], inv[MAX];
void ConInit(LL M) {
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 % M;
inv[i] = M - inv[M % i] * (M / i) % M;
finv[i] = finv[i - 1] * inv[i] % M;
}
}
LL COM(int n, int k, LL M) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % M) % M;
}
template <class T> void VCout(vector<T> v) {
int N = SZ(v);
REP(i, N) {
cout << v.at(i);
if (i == N - 1)
ENDL;
else
SPACE;
}
return;
}
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;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VI B(N), C(N);
MII p;
map<int, LL> q;
vector<map<int, LL>> m(N);
REP(i, N) {
cin >> B.at(i);
C.at(i) = ModInv(B.at(i), MOD);
int t = 2, A = B.at(i);
while (A > 1) {
int s = 0;
LL de = 1;
if (A % t == 0) {
while (A % t == 0) {
s++;
A /= t;
de *= t;
de %= MOD;
}
}
if (s != 0) {
if (p.count(t)) {
chmax(p.at(t), s);
} else {
p[t] = s;
}
// m.at(i)[t] = ModInv(de,MOD);
}
t++;
}
}
LL de = 1;
for (auto key : p) {
de *= ModPow(key.FI, key.SE, MOD);
de %= MOD;
}
LL ans = 0;
REP(i, N) {
LL l = de * C.at(i);
ans += l % MOD;
ans %= MOD;
}
COUT(ans);
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// conversion
//------------------------------------------
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();
}
// math
//-------------------------------------------
template <class T> inline T sqr(T x) { return x * x; }
// typedef
//------------------------------------------
typedef long long LL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef map<int, int> MII;
typedef queue<int> QI;
typedef queue<PII> QPII;
typedef stack<int> SI;
typedef stack<PII> SPII;
typedef deque<int> DI;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
typedef vector<bool> VB;
typedef vector<VB> VVB;
typedef vector<double> VD;
typedef vector<VD> VVD;
typedef vector<string> VS;
typedef vector<VS> VVS;
typedef vector<char> VC;
typedef vector<VC> VVC;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef priority_queue<int> PQI; // 大きい順
typedef priority_queue<int, VI, greater<int>> PQGI;
typedef priority_queue<PII> PQP;
typedef priority_queue<PII, VPII, greater<int>> PQGP;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define PF push_front
#define POB pop_back()
#define POF pop_front()
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
#define LB lower_bound
#define UB upper_bound
#define SORTR(c) sort((c).begin(), (c).end(), greater<int>())
#define FI first
#define SE second
// repetition
//------------------------------------------
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define FORR(i, a, b) for (int i = (b - 1); i >= a; i--)
#define REPR(i, n) FORR(i, 0, n)
#define BREP(bit, N) for (int bit = 0; bit < (1 << N); ++bit)
// constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int INF = INT_MAX / 2;
const LL LINF = LLONG_MAX / 2;
const LL MOD = 1e9 + 7;
const LL MODD = 998244353;
const int MAX = 510000;
// other
//-------------------------------------------
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;
}
#define SEP(a) cout << fixed << setprecision(a)
#define COUT(x) cout << (x) << endl
#define COUT2(x) cout << (x)
#define ENDL cout << endl
#define SPACE cout << " "
VI dx = {1, 0, -1, 0, 1, 1, -1, -1};
VI dy = {0, 1, 0, -1, 1, -1, 1, -1};
VC dc = {'R', 'D', 'L', 'U'};
VS ds = {"R", "D", "L", "U", "RD", "RU", "LD", "LU"};
LL Gcd(LL a, LL b) { return __gcd(a, b); }
LL Lcm(LL a, LL b) {
LL abd = Gcd(a, b);
LL x = a / abd, y = b;
return x * y;
}
LL ModPow(LL A, LL N, LL M) {
LL res = 1;
while (N > 0) {
if (N & 1)
res = res * A % M;
A = A * A % M;
N >>= 1;
}
return res;
}
LL fac[MAX], finv[MAX], inv[MAX];
void ConInit(LL M) {
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 % M;
inv[i] = M - inv[M % i] * (M / i) % M;
finv[i] = finv[i - 1] * inv[i] % M;
}
}
LL COM(int n, int k, LL M) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % M) % M;
}
template <class T> void VCout(vector<T> v) {
int N = SZ(v);
REP(i, N) {
cout << v.at(i);
if (i == N - 1)
ENDL;
else
SPACE;
}
return;
}
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;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int N;
cin >> N;
VI B(N), C(N);
MII p;
map<int, LL> q;
vector<map<int, LL>> m(N);
REP(i, N) {
cin >> B.at(i);
C.at(i) = ModInv(B.at(i), MOD);
int t = 2, A = B.at(i);
while (A > 1) {
if (A < t * t) {
t = A;
}
int s = 0;
LL de = 1;
if (A % t == 0) {
while (A % t == 0) {
s++;
A /= t;
de *= t;
de %= MOD;
}
}
if (s != 0) {
if (p.count(t)) {
chmax(p.at(t), s);
} else {
p[t] = s;
}
// m.at(i)[t] = ModInv(de,MOD);
}
t++;
}
}
LL de = 1;
for (auto key : p) {
de *= ModPow(key.FI, key.SE, MOD);
de %= MOD;
}
LL ans = 0;
REP(i, N) {
LL l = de * C.at(i);
ans += l % MOD;
ans %= MOD;
}
COUT(ans);
return 0;
}
| insert | 199 | 199 | 199 | 202 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const int oo = 1e9 + 7;
const ll mod = 1e9 + 7, maxn = 1000001;
const double PI = acos(-1);
bitset<1000010> isprime;
vector<int> primos;
int v[maxn];
void sieve() {
isprime.set();
isprime[0] = isprime[1] = 0;
primos.push_back(2);
for (int i = 3; i * i < maxn; i += 2) {
if (isprime[i]) {
for (int j = i * i; j < maxn; j += (2 * i)) {
isprime[j] = 0;
}
}
}
for (int i = 3; i < maxn; i += 2) {
if (isprime[i])
primos.push_back(i);
}
}
ll fexp(ll base, ll p) {
ll ans = 1;
while (p) {
if (p & 1) {
ans = (ans * base) % mod;
}
p = p >> 1;
base = (base * base) % mod;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
ll n, ans = 0, lcm = 1;
sieve();
cin >> n;
int pn = primos.size();
vector<ll> pot(pn, 0);
for (int i = 0; i < n; i++)
cin >> v[i];
for (auto x : v) {
for (int i = 0; i < pn; i++) {
ll val = primos[i], power = 0;
if (val > x)
break;
while (x % val == 0)
x /= val, power++;
pot[i] = max(pot[i], power);
}
}
for (int i = 0; i < pn; i++) {
lcm = (lcm * fexp(primos[i], pot[i])) % mod;
}
for (int i = 0; i < n; i++) {
ans = (ans + lcm * fexp(v[i], mod - 2)) % mod;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const int oo = 1e9 + 7;
const ll mod = 1e9 + 7, maxn = 1000001;
const double PI = acos(-1);
bitset<1000010> isprime;
vector<int> primos;
int v[maxn];
void sieve() {
isprime.set();
isprime[0] = isprime[1] = 0;
primos.push_back(2);
for (int i = 3; i * i < maxn; i += 2) {
if (isprime[i]) {
for (int j = i * i; j < maxn; j += (2 * i)) {
isprime[j] = 0;
}
}
}
for (int i = 3; i < maxn; i += 2) {
if (isprime[i])
primos.push_back(i);
}
}
ll fexp(ll base, ll p) {
ll ans = 1;
while (p) {
if (p & 1) {
ans = (ans * base) % mod;
}
p = p >> 1;
base = (base * base) % mod;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
ll n, ans = 0, lcm = 1;
sieve();
cin >> n;
int pn = primos.size();
vector<ll> pot(pn, 0);
for (int i = 0; i < n; i++)
cin >> v[i];
for (auto x : v) {
for (int i = 0; i < pn; i++) {
if (isprime[x] and x & 1) {
int pos = lower_bound(all(primos), x) - primos.begin();
pot[pos] = max(1LL, pot[pos]);
break;
}
ll val = primos[i], power = 0;
if (val > x)
break;
while (x % val == 0)
x /= val, power++;
pot[i] = max(pot[i], power);
}
}
for (int i = 0; i < pn; i++) {
lcm = (lcm * fexp(primos[i], pot[i])) % mod;
}
for (int i = 0; i < n; i++) {
ans = (ans + lcm * fexp(v[i], mod - 2)) % mod;
}
cout << ans << endl;
return 0;
} | insert | 61 | 61 | 61 | 66 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
typedef long long ll;
const int MOD = 1000000007;
ll a_n(ll a, ll n);
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
map<int, int> lcm;
rep(i, n) {
map<int, int> prime = {}; // a[i]の素因数
int temp = a.at(i);
while ((temp % 2) == 0) {
temp /= 2;
if (prime.count(2))
prime.at(2)++;
else
prime[2] = 1;
}
for (int j = 3; j * 2 <= a.at(i); j += 2) {
while ((temp % j) == 0) {
temp /= j;
if (prime.count(j))
prime.at(j)++;
else
prime[j] = 1;
}
}
if (temp != 1)
prime[temp] = 1;
// primeの全キーをlcmと比較
for (pair<int, int> p : prime) {
int key = p.first;
int value = p.second;
if (lcm.count(key) && (lcm.at(key) < value))
lcm.at(key) = value;
if (!(lcm.count(key)))
lcm[key] = value;
}
}
ll ans = 0;
rep(i, n) ans = (ans + a_n(a.at(i), MOD - 2));
for (pair<int, int> p : lcm) {
int key = p.first;
int value = p.second;
rep(i, value) ans = (ans * key) % MOD;
}
cout << ans << endl;
return 0;
}
ll a_n(ll a, ll n) {
ll ret = a, count = 1;
int num = 1;
vector<ll> memory(100);
memory.at(0) = a;
while (count * 2 < n) {
ret = (ret * ret) % MOD;
count *= 2;
memory.at(num) = ret;
num++;
}
if (count == n)
return ret;
else {
bitset<100> bit = bitset<100>(n - count);
rep(i, 100) {
if (bit.test(i))
ret = (ret * memory.at(i)) % MOD;
}
return ret;
}
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (int)(n); (i)++)
typedef long long ll;
const int MOD = 1000000007;
ll a_n(ll a, ll n);
int main() {
int n;
cin >> n;
vector<int> a(n);
rep(i, n) cin >> a.at(i);
map<int, int> lcm;
rep(i, n) {
map<int, int> prime = {}; // a[i]の素因数
int temp = a.at(i);
while ((temp % 2) == 0) {
temp /= 2;
if (prime.count(2))
prime.at(2)++;
else
prime[2] = 1;
}
for (int j = 3; j * j <= temp; j += 2) {
while ((temp % j) == 0) {
temp /= j;
if (prime.count(j))
prime.at(j)++;
else
prime[j] = 1;
}
}
if (temp != 1)
prime[temp] = 1;
// primeの全キーをlcmと比較
for (pair<int, int> p : prime) {
int key = p.first;
int value = p.second;
if (lcm.count(key) && (lcm.at(key) < value))
lcm.at(key) = value;
if (!(lcm.count(key)))
lcm[key] = value;
}
}
ll ans = 0;
rep(i, n) ans = (ans + a_n(a.at(i), MOD - 2));
for (pair<int, int> p : lcm) {
int key = p.first;
int value = p.second;
rep(i, value) ans = (ans * key) % MOD;
}
cout << ans << endl;
return 0;
}
ll a_n(ll a, ll n) {
ll ret = a, count = 1;
int num = 1;
vector<ll> memory(100);
memory.at(0) = a;
while (count * 2 < n) {
ret = (ret * ret) % MOD;
count *= 2;
memory.at(num) = ret;
num++;
}
if (count == n)
return ret;
else {
bitset<100> bit = bitset<100>(n - count);
rep(i, 100) {
if (bit.test(i))
ret = (ret * memory.at(i)) % MOD;
}
return ret;
}
}
| replace | 26 | 27 | 26 | 27 | TLE | |
p02793 | C++ | Runtime Error | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int mod = 1000000007;
const long long int INF = 99999999999999999;
// ユークリッドの互除法 a,bは最大公約数を求めたい２つの数
class Euclid_Gojyohou {
public:
long long int gcd(long long int a, long long int b) {
long long int tmp;
long long int r = 1;
if (b > a) {
tmp = a;
a = b;
b = tmp;
}
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
};
// 階乗先に計算
class Kaizyou {
public:
long long int *kaizyou;
Kaizyou(){};
Kaizyou(long long int n, long long int mod) {
kaizyou = new long long int[n + 1];
kai(1, n, mod);
return;
}
long long int kai(long long int a, long long int b, long long int mod) {
long long int tmp = 1;
for (long long int i = a; i <= b; i++) {
tmp *= i;
tmp %= mod;
kaizyou[i] = tmp;
}
return tmp;
}
};
// 累乗(繰り返し2乗法) aのb乗(mod)を求める。
class Ruizyou {
public:
long long int rui(long long int a, long long int b, long long mod) {
int memo[65] = {};
long long int A[65] = {};
long long int tmp = 1;
for (int i = 0; i < 65; i++) {
memo[i] = b % 2;
b /= 2;
}
A[0] = a;
A[0] %= mod;
for (int i = 1; i < 65; i++) {
A[i] = A[i - 1] * A[i - 1];
A[i] %= mod;
}
for (int i = 0; i < 65; i++) {
if (memo[i] == 1) {
tmp *= A[i];
tmp %= mod;
}
}
tmp %= mod;
return tmp;
}
};
long long int LCMs[1000005] = {};
int main() {
cout << fixed << setprecision(18);
long long int N, A[1005], lcm = 1, res = 0, tmp2;
cin >> N;
Euclid_Gojyohou euc;
Ruizyou ruizyou;
for (int i = 0; i < N; i++) {
cin >> A[i];
long long int tmp = A[i];
tmp2 = tmp;
for (long long int j = 2; j * j <= tmp2; j++) {
long long int Counter = 0;
while (tmp % j == 0) {
Counter++;
tmp /= j;
}
LCMs[j] = max(LCMs[j], Counter);
}
if (tmp != 1) {
LCMs[tmp] = max(LCMs[tmp], 1LL);
}
}
for (long long int i = 2; i <= 1000000; i++) {
for (long long int j = 0; j < LCMs[i]; j++) {
lcm = i * lcm;
lcm %= mod;
}
}
for (int i = 0; i < N; i++) {
res += lcm * ruizyou.rui(A[i], mod - 2, mod);
res %= mod;
}
cout << res;
} | #include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
using namespace std;
const long long int mod = 1000000007;
const long long int INF = 99999999999999999;
// ユークリッドの互除法 a,bは最大公約数を求めたい２つの数
class Euclid_Gojyohou {
public:
long long int gcd(long long int a, long long int b) {
long long int tmp;
long long int r = 1;
if (b > a) {
tmp = a;
a = b;
b = tmp;
}
r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
};
// 階乗先に計算
class Kaizyou {
public:
long long int *kaizyou;
Kaizyou(){};
Kaizyou(long long int n, long long int mod) {
kaizyou = new long long int[n + 1];
kai(1, n, mod);
return;
}
long long int kai(long long int a, long long int b, long long int mod) {
long long int tmp = 1;
for (long long int i = a; i <= b; i++) {
tmp *= i;
tmp %= mod;
kaizyou[i] = tmp;
}
return tmp;
}
};
// 累乗(繰り返し2乗法) aのb乗(mod)を求める。
class Ruizyou {
public:
long long int rui(long long int a, long long int b, long long mod) {
int memo[65] = {};
long long int A[65] = {};
long long int tmp = 1;
for (int i = 0; i < 65; i++) {
memo[i] = b % 2;
b /= 2;
}
A[0] = a;
A[0] %= mod;
for (int i = 1; i < 65; i++) {
A[i] = A[i - 1] * A[i - 1];
A[i] %= mod;
}
for (int i = 0; i < 65; i++) {
if (memo[i] == 1) {
tmp *= A[i];
tmp %= mod;
}
}
tmp %= mod;
return tmp;
}
};
long long int LCMs[1000005] = {};
int main() {
cout << fixed << setprecision(18);
long long int N, A[10005], lcm = 1, res = 0, tmp2;
cin >> N;
Euclid_Gojyohou euc;
Ruizyou ruizyou;
for (int i = 0; i < N; i++) {
cin >> A[i];
long long int tmp = A[i];
tmp2 = tmp;
for (long long int j = 2; j * j <= tmp2; j++) {
long long int Counter = 0;
while (tmp % j == 0) {
Counter++;
tmp /= j;
}
LCMs[j] = max(LCMs[j], Counter);
}
if (tmp != 1) {
LCMs[tmp] = max(LCMs[tmp], 1LL);
}
}
for (long long int i = 2; i <= 1000000; i++) {
for (long long int j = 0; j < LCMs[i]; j++) {
lcm = i * lcm;
lcm %= mod;
}
}
for (int i = 0; i < N; i++) {
res += lcm * ruizyou.rui(A[i], mod - 2, mod);
res %= mod;
}
cout << res;
} | replace | 98 | 99 | 98 | 99 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define MOD 1000000007
#define int long long
using namespace std;
int n = 0;
int arr[10001];
map<int, int> mm[10001];
map<int, int> Map;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
int sqrtN = round(sqrt(arr[i]));
for (int j = 2; j <= sqrtN; j++) {
while (arr[i] % j == 0) {
mm[i][j]++;
arr[i] /= j;
}
}
if (arr[i] != 1)
mm[i][arr[i]]++;
arr[i] = 1;
}
for (int i = 0; i < n; i++) {
for (auto p : mm[i])
Map[p.first] = max(Map[p.first], p.second);
}
int sum = 0;
for (int i = 0; i < n; i++) {
for (auto p : mm[i])
Map[p.first] -= p.second;
int x = 1;
for (auto p : Map) {
for (int j = 0; j < p.second; j++) {
x = x * p.first % MOD;
}
}
sum = (sum + x) % MOD;
for (auto p : mm[i])
Map[p.first] += p.second;
}
cout << sum;
return 0;
}
| #include <bits/stdc++.h>
#define MOD 1000000007
#define int long long
using namespace std;
int n = 0;
int arr[10001];
unordered_map<int, int> mm[10001];
unordered_map<int, int> Map;
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cin >> n;
for (int i = 0; i < n; i++)
cin >> arr[i];
for (int i = 0; i < n; i++) {
int sqrtN = round(sqrt(arr[i]));
for (int j = 2; j <= sqrtN; j++) {
while (arr[i] % j == 0) {
mm[i][j]++;
arr[i] /= j;
}
}
if (arr[i] != 1)
mm[i][arr[i]]++;
arr[i] = 1;
}
for (int i = 0; i < n; i++) {
for (auto p : mm[i])
Map[p.first] = max(Map[p.first], p.second);
}
int sum = 0;
for (int i = 0; i < n; i++) {
for (auto p : mm[i])
Map[p.first] -= p.second;
int x = 1;
for (auto p : Map) {
for (int j = 0; j < p.second; j++) {
x = x * p.first % MOD;
}
}
sum = (sum + x) % MOD;
for (auto p : mm[i])
Map[p.first] += p.second;
}
cout << sum;
return 0;
}
| replace | 7 | 9 | 7 | 9 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define DIV 1000000007
#define MAX 1000001
long long inv[MAX];
int mypow(int x, int n) {
long long ret = 1, p;
int p2 = 1;
p = x;
while (1) {
if (n & p2)
ret *= p;
p *= p;
ret %= DIV;
p %= DIV;
p2 *= 2;
if (p2 > n)
break;
}
return ret;
}
void init() {
inv[0] = 1;
for (int i = 1; i < MAX; i++) {
inv[i] = mypow(i, DIV - 2) % DIV;
}
}
void pf_init(vector<int> &pf, int maxsize) {
bool flag;
pf.resize(0);
for (int i = 2; i * i <= maxsize; i++) {
flag = 1;
for (int j = 0; j < pf.size(); j++) {
if (i % pf.at(j) == 0) {
flag = 0;
break;
}
}
if (flag) {
pf.push_back(i);
}
}
}
void pf_make(int n, vector<int> &ret, vector<int> &pf) {
if (ret.size() != pf.size())
ret.resize(pf.size());
for (int i = 0; i < pf.size(); i++) {
ret.at(i) = 0;
while (1) {
if (n % pf.at(i) == 0) {
n /= pf.at(i);
ret.at(i)++;
} else {
break;
}
}
}
if (n > 1) {
pf.push_back(n);
ret.push_back(1);
}
}
int main() {
init();
vector<int> pf;
pf_init(pf, MAX);
int N;
cin >> N;
int A[N];
vector<vector<int>> pf_done_A(N, vector<int>(pf.size()));
for (int i = 0; i < N; i++) {
cin >> A[i];
pf_make(A[i], pf_done_A.at(i), pf);
}
vector<int> LCM(pf.size(), 0);
for (int i = 0; i < N; i++) {
for (int j = 0; j < pf.size(); j++) {
LCM.at(j) = max(LCM.at(j), pf_done_A.at(i).at(j));
}
}
long long L = 1;
for (int i = 0; i < pf.size(); i++) {
L *= mypow(pf.at(i), LCM.at(i));
L %= DIV;
}
long long ans = 0;
for (int i = 0; i < N; i++) {
ans += L * inv[A[i]];
ans %= DIV;
}
cout << ans;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define DIV 1000000007
#define MAX 1000001
long long inv[MAX];
int mypow(int x, int n) {
long long ret = 1, p;
int p2 = 1;
p = x;
while (1) {
if (n & p2)
ret *= p;
p *= p;
ret %= DIV;
p %= DIV;
p2 *= 2;
if (p2 > n)
break;
}
return ret;
}
void init() {
inv[0] = 1;
for (int i = 1; i < MAX; i++) {
inv[i] = mypow(i, DIV - 2) % DIV;
}
}
void pf_init(vector<int> &pf, int maxsize) {
bool flag;
pf.resize(0);
for (int i = 2; i * i <= maxsize; i++) {
flag = 1;
for (int j = 0; j < pf.size(); j++) {
if (i % pf.at(j) == 0) {
flag = 0;
break;
}
}
if (flag) {
pf.push_back(i);
}
}
}
void pf_make(int n, vector<int> &ret, vector<int> &pf) {
if (ret.size() != pf.size())
ret.resize(pf.size());
for (int i = 0; i < pf.size(); i++) {
ret.at(i) = 0;
while (1) {
if (n % pf.at(i) == 0) {
n /= pf.at(i);
ret.at(i)++;
} else {
break;
}
}
}
if (n > 1) {
pf.push_back(n);
ret.push_back(1);
}
}
int main() {
init();
vector<int> pf;
pf_init(pf, MAX);
int N;
cin >> N;
int A[N];
vector<vector<int>> pf_done_A(N, vector<int>(pf.size()));
for (int i = 0; i < N; i++) {
cin >> A[i];
pf_make(A[i], pf_done_A.at(i), pf);
}
vector<int> LCM(pf.size(), 0);
for (int i = 0; i < N; i++) {
for (int j = 0; j < pf_done_A.at(i).size(); j++) {
LCM.at(j) = max(LCM.at(j), pf_done_A.at(i).at(j));
}
}
long long L = 1;
for (int i = 0; i < pf.size(); i++) {
L *= mypow(pf.at(i), LCM.at(i));
L %= DIV;
}
long long ans = 0;
for (int i = 0; i < N; i++) {
ans += L * inv[A[i]];
ans %= DIV;
}
cout << ans;
return 0;
}
| replace | 83 | 84 | 83 | 84 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, a[2000], b[2000], MOD = 1000000007, A, B, ans, d[1000], cnt;
map<ll, ll> mp;
vector<ll> v, so;
ll f(ll x, ll y) {
if (y == 0)
return 1;
if (y % 2 == 0)
return f(x, y / 2) * f(x, y / 2) % MOD;
return x * f(x, y - 1) % MOD;
}
ll lcd(ll x, ll y) {
if (y == 0)
return x;
return lcd(y, x % y);
}
int main(void) {
for (int i = 2; i < 1000; i++) {
if (d[i] == 0)
so.push_back(i);
for (int j = 1; j * i < 1000; j++) {
d[i * j] = 1;
}
}
// for(auto x:so)cout<<x<<endl;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
A = a[i];
for (auto x : so) {
if (A % x == 0 && A != x) {
cnt = 0;
while (A % x == 0) {
A /= x;
cnt++;
}
mp[x] = max(mp[x], cnt);
}
}
if (A != 1)
mp[A] = max(mp[A], 1LL);
}
B = 1;
for (auto x : mp) {
B *= f(x.first, x.second);
B %= MOD;
}
// cout<<B<<endl;
for (int i = 0; i < n; i++) {
ans += B * f(a[i], MOD - 2);
ans %= MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
#include <iostream>
using namespace std;
typedef long long ll;
ll n, a[10000], b[10000], MOD = 1000000007, A, B, ans, d[1000], cnt;
map<ll, ll> mp;
vector<ll> v, so;
ll f(ll x, ll y) {
if (y == 0)
return 1;
if (y % 2 == 0)
return f(x, y / 2) * f(x, y / 2) % MOD;
return x * f(x, y - 1) % MOD;
}
ll lcd(ll x, ll y) {
if (y == 0)
return x;
return lcd(y, x % y);
}
int main(void) {
for (int i = 2; i < 1000; i++) {
if (d[i] == 0)
so.push_back(i);
for (int j = 1; j * i < 1000; j++) {
d[i * j] = 1;
}
}
// for(auto x:so)cout<<x<<endl;
cin >> n;
for (int i = 0; i < n; i++) {
cin >> a[i];
A = a[i];
for (auto x : so) {
if (A % x == 0 && A != x) {
cnt = 0;
while (A % x == 0) {
A /= x;
cnt++;
}
mp[x] = max(mp[x], cnt);
}
}
if (A != 1)
mp[A] = max(mp[A], 1LL);
}
B = 1;
for (auto x : mp) {
B *= f(x.first, x.second);
B %= MOD;
}
// cout<<B<<endl;
for (int i = 0; i < n; i++) {
ans += B * f(a[i], MOD - 2);
ans %= MOD;
}
cout << ans << endl;
}
| replace | 4 | 5 | 4 | 5 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const int p = 1e9 + 7;
ll powmod(ll a, ll b) {
if (b == 0)
return 1;
if (b % 2 == 1)
return (a * powmod(a, b - 1)) % p;
else {
ll x = powmod(a, b / 2);
return (x * x) % p;
}
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(a % b, b);
}
ll lcm(ll a, ll b) {
// cout << a << " " << b << " " << endl;
return a * b / gcd(a, b);
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a.at(i);
ll l = a.at(0);
rep(i, n - 1) { l = lcm(l, a.at(i + 1)); }
l %= p;
ll ans = 0;
rep(i, n) {
ans += powmod(a.at(i), p - 2);
ans %= p;
}
ans *= l;
ans %= p;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
const int p = 1e9 + 7;
ll powmod(ll a, ll b) {
if (b == 0)
return 1;
if (b % 2 == 1)
return (a * powmod(a, b - 1)) % p;
else {
ll x = powmod(a, b / 2);
return (x * x) % p;
}
}
ll gcd(ll a, ll b) {
if (a < b)
swap(a, b);
if (a % b == 0)
return b;
return gcd(a % b, b);
}
ll lcm(ll a, ll b) {
// cout << a << " " << b << " " << endl;
return a * b / gcd(a, b);
}
int main() {
int n;
cin >> n;
vector<ll> a(n);
rep(i, n) cin >> a.at(i);
vector<int> b(1e6 + 1);
rep(i, n) {
int tmp = a.at(i);
int cnt = 0;
for (int j = 2; j < 1e3; j++) {
cnt = 0;
while (tmp % j == 0) {
tmp /= j;
cnt++;
}
b.at(j) = max(b.at(j), cnt);
}
b.at(tmp) = max(b.at(tmp), 1);
}
ll l = 1;
rep(i, b.size()) {
if (b.at(i) > 0) {
l *= powmod(i, b.at(i));
l %= p;
}
}
ll ans = 0;
rep(i, n) {
ans += powmod(a.at(i), p - 2);
ans %= p;
}
ans *= l;
ans %= p;
cout << ans << endl;
return 0;
} | replace | 36 | 39 | 36 | 59 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1e4 + 5;
const int maxv = 1e6 + 1;
const int MOD = 1e9 + 7;
int n, t;
int A[N];
int p[maxv];
int cnt[maxv];
ll ans;
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % MOD;
}
a = a * a % MOD;
b >>= 1;
}
return res;
}
void init() {
for (int i = 2; i < maxv; ++i) {
if (p[i] == 0) {
p[i] = 1;
for (int j = i + i; j < maxv; j += i) {
p[j] = i;
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
init();
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> t;
A[i] = t;
unordered_map<int, int> ma;
while (p[t] != 1) {
int d = p[t];
++ma[d];
t /= d;
}
++ma[t];
for (auto pr : ma) {
if (pr.second > cnt[pr.first])
cnt[pr.first] = pr.second;
}
}
ll m = 1;
for (int i = 2; i < maxv; ++i) {
if (cnt[i]) {
m = m * power(i, cnt[i]) % MOD;
}
}
for (int i = 0; i < n; ++i) {
ans = (ans + m * power(A[i], MOD - 2) % MOD) % MOD;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
const int N = 1e4 + 5;
const int maxv = 1e6 + 1;
const int MOD = 1e9 + 7;
int n, t;
int A[N];
int p[maxv];
int cnt[maxv];
ll ans;
ll power(ll a, ll b) {
ll res = 1;
while (b) {
if (b & 1) {
res = (res * a) % MOD;
}
a = a * a % MOD;
b >>= 1;
}
return res;
}
void init() {
p[1] = 1;
for (int i = 2; i < maxv; ++i) {
if (p[i] == 0) {
p[i] = 1;
for (int j = i + i; j < maxv; j += i) {
p[j] = i;
}
}
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
init();
cin >> n;
for (int i = 0; i < n; ++i) {
cin >> t;
A[i] = t;
unordered_map<int, int> ma;
while (p[t] != 1) {
int d = p[t];
++ma[d];
t /= d;
}
++ma[t];
for (auto pr : ma) {
if (pr.second > cnt[pr.first])
cnt[pr.first] = pr.second;
}
}
ll m = 1;
for (int i = 2; i < maxv; ++i) {
if (cnt[i]) {
m = m * power(i, cnt[i]) % MOD;
}
}
for (int i = 0; i < n; ++i) {
ans = (ans + m * power(A[i], MOD - 2) % MOD) % MOD;
}
cout << ans << endl;
return 0;
}
| insert | 28 | 28 | 28 | 29 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define repr(i, from, to) for (int(i) = (from); (i) < (to); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
#define vprint(x) \
for (auto a : (x)) \
cout << x << endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
class ModCom {
public:
ModCom(int _n, long long _mod) {
assert(_n >= 2);
n = _n + 1;
mod = _mod;
fac.assign(n, 0);
finv.assign(n, 0);
inv.assign(n, 0);
init();
}
vector<long long> inv;
vector<long long> fac;
vector<long long> finv;
long long com(int _n, int k) {
if (_n < k) {
return 0;
}
if (_n < 0 || k < 0) {
return 0;
}
return fac.at(_n) * (finv.at(k) * finv.at(_n - k) % mod) % mod;
}
private:
int n;
long long mod;
void init(void) {
fac.at(0) = fac.at(1) = 1;
finv.at(0) = finv.at(1) = 1;
inv.at(1) = 1;
for (int i = 2; i < n; i++) {
fac.at(i) = fac.at(i - 1) * i % mod;
inv.at(i) = mod - inv.at(mod % i) * (mod / i) % mod;
finv.at(i) = finv.at(i - 1) * inv.at(i) % mod;
}
return;
}
};
ModCom com(int(1e+6) + 200, 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;
}
vector<ll> primes(ll n) {
if (n < 2) {
return vector<ll>();
}
vector<ll> ret;
vector<bool> chk(n + 100, false);
ll cur = 2;
while (cur < n) {
if (!chk[cur]) {
for (ll i = cur; i <= n; i += cur) {
chk[i] = true;
}
ret.push_back(cur);
}
cur++;
}
return ret;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> ps = primes(1000000 + 10);
vector<ll> mp(1000000 + 10, 0);
rep(i, n) cin >> a[i];
rep(i, n) {
ll target = a[i];
for (auto x : ps) {
ll cnt = 0;
if (x > a[i] * a[i])
break;
while (target % x == 0) {
cnt++;
target /= x;
}
chmax(mp[x], cnt);
}
if (target != 1) {
chmax(mp[target], 1LL);
}
}
ll lcm = 1;
rep(i, 1000000 + 10) {
if (mp[i] == 0)
continue;
lcm *= modpow(i, mp[i], MOD);
lcm %= MOD;
}
ll res = 0;
rep(i, n) {
res += lcm * com.inv[a[i]];
res %= MOD;
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
#define repr(i, from, to) for (int(i) = (from); (i) < (to); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
#define vprint(x) \
for (auto a : (x)) \
cout << x << endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
class ModCom {
public:
ModCom(int _n, long long _mod) {
assert(_n >= 2);
n = _n + 1;
mod = _mod;
fac.assign(n, 0);
finv.assign(n, 0);
inv.assign(n, 0);
init();
}
vector<long long> inv;
vector<long long> fac;
vector<long long> finv;
long long com(int _n, int k) {
if (_n < k) {
return 0;
}
if (_n < 0 || k < 0) {
return 0;
}
return fac.at(_n) * (finv.at(k) * finv.at(_n - k) % mod) % mod;
}
private:
int n;
long long mod;
void init(void) {
fac.at(0) = fac.at(1) = 1;
finv.at(0) = finv.at(1) = 1;
inv.at(1) = 1;
for (int i = 2; i < n; i++) {
fac.at(i) = fac.at(i - 1) * i % mod;
inv.at(i) = mod - inv.at(mod % i) * (mod / i) % mod;
finv.at(i) = finv.at(i - 1) * inv.at(i) % mod;
}
return;
}
};
ModCom com(int(1e+6) + 200, 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;
}
vector<ll> primes(ll n) {
if (n < 2) {
return vector<ll>();
}
vector<ll> ret;
vector<bool> chk(n + 100, false);
ll cur = 2;
while (cur < n) {
if (!chk[cur]) {
for (ll i = cur; i <= n; i += cur) {
chk[i] = true;
}
ret.push_back(cur);
}
cur++;
}
return ret;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> ps = primes(1000000 + 10);
vector<ll> mp(1000000 + 10, 0);
rep(i, n) cin >> a[i];
rep(i, n) {
ll target = a[i];
for (auto x : ps) {
ll cnt = 0;
if (x * x > a[i])
break;
while (target % x == 0) {
cnt++;
target /= x;
}
chmax(mp[x], cnt);
}
if (target != 1) {
chmax(mp[target], 1LL);
}
}
ll lcm = 1;
rep(i, 1000000 + 10) {
if (mp[i] == 0)
continue;
lcm *= modpow(i, mp[i], MOD);
lcm %= MOD;
}
ll res = 0;
rep(i, n) {
res += lcm * com.inv[a[i]];
res %= MOD;
}
cout << res << endl;
return 0;
}
| replace | 115 | 116 | 115 | 116 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define repr(i, from, to) for (int(i) = (from); (i) < (to); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
#define vprint(x) \
for (auto a : (x)) \
cout << x << endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
class ModCom {
public:
ModCom(int _n, long long _mod) {
assert(_n >= 2);
n = _n + 1;
mod = _mod;
fac.assign(n, 0);
finv.assign(n, 0);
inv.assign(n, 0);
init();
}
vector<long long> inv;
vector<long long> fac;
vector<long long> finv;
long long com(int _n, int k) {
if (_n < k) {
return 0;
}
if (_n < 0 || k < 0) {
return 0;
}
return fac.at(_n) * (finv.at(k) * finv.at(_n - k) % mod) % mod;
}
private:
int n;
long long mod;
void init(void) {
fac.at(0) = fac.at(1) = 1;
finv.at(0) = finv.at(1) = 1;
inv.at(1) = 1;
for (int i = 2; i < n; i++) {
fac.at(i) = fac.at(i - 1) * i % mod;
inv.at(i) = mod - inv.at(mod % i) * (mod / i) % mod;
finv.at(i) = finv.at(i - 1) * inv.at(i) % mod;
}
return;
}
};
ModCom com(int(1e+6) + 200, 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;
}
vector<long long> eratosthenes(long long n) {
vector<long long> ret;
vector<bool> check(n + 100, false);
if (n < 2) {
return ret;
}
long long idx = 2;
while (idx * idx <= n) {
if (!check[idx]) {
ret.push_back(idx);
for (int i = idx; i <= n; i += idx) {
check[i] = true;
}
}
}
for (int i = idx; i <= n; i++) {
if (!check[i]) {
ret.push_back(i);
}
}
return ret;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> ps = eratosthenes(1000000 + 10);
vector<ll> mp(1000000 + 10, 0);
rep(i, n) cin >> a[i];
rep(i, n) {
ll target = a[i];
for (auto x : ps) {
ll cnt = 0;
if (x * x > a[i])
break;
while (target % x == 0) {
cnt++;
target /= x;
}
chmax(mp[x], cnt);
}
if (target != 1) {
chmax(mp[target], 1LL);
}
}
ll lcm = 1;
rep(i, 1000000 + 10) {
if (mp[i] == 0)
continue;
lcm *= modpow(i, mp[i], MOD);
lcm %= MOD;
}
ll res = 0;
rep(i, n) {
res += lcm * com.inv[a[i]];
res %= MOD;
}
cout << res << endl;
return 0;
}
| #include <bits/stdc++.h>
#define repr(i, from, to) for (int(i) = (from); (i) < (to); (i)++)
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
// const bool debug=true;
const bool debug = false;
#define DEBUG if (debug == true)
#define vprint(x) \
for (auto a : (x)) \
cout << x << endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll MOD = 1000000007;
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
class ModCom {
public:
ModCom(int _n, long long _mod) {
assert(_n >= 2);
n = _n + 1;
mod = _mod;
fac.assign(n, 0);
finv.assign(n, 0);
inv.assign(n, 0);
init();
}
vector<long long> inv;
vector<long long> fac;
vector<long long> finv;
long long com(int _n, int k) {
if (_n < k) {
return 0;
}
if (_n < 0 || k < 0) {
return 0;
}
return fac.at(_n) * (finv.at(k) * finv.at(_n - k) % mod) % mod;
}
private:
int n;
long long mod;
void init(void) {
fac.at(0) = fac.at(1) = 1;
finv.at(0) = finv.at(1) = 1;
inv.at(1) = 1;
for (int i = 2; i < n; i++) {
fac.at(i) = fac.at(i - 1) * i % mod;
inv.at(i) = mod - inv.at(mod % i) * (mod / i) % mod;
finv.at(i) = finv.at(i - 1) * inv.at(i) % mod;
}
return;
}
};
ModCom com(int(1e+6) + 200, 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;
}
vector<long long> eratosthenes(long long n) {
vector<long long> ret;
vector<bool> check(n + 100, false);
if (n < 2) {
return ret;
}
long long idx = 2;
while (idx * idx <= n) {
if (!check[idx]) {
ret.push_back(idx);
for (int i = idx; i <= n; i += idx) {
check[i] = true;
}
}
idx++;
}
for (int i = idx; i <= n; i++) {
if (!check[i]) {
ret.push_back(i);
}
}
return ret;
}
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
ll n;
cin >> n;
vector<ll> a(n);
vector<ll> ps = eratosthenes(1000000 + 10);
vector<ll> mp(1000000 + 10, 0);
rep(i, n) cin >> a[i];
rep(i, n) {
ll target = a[i];
for (auto x : ps) {
ll cnt = 0;
if (x * x > a[i])
break;
while (target % x == 0) {
cnt++;
target /= x;
}
chmax(mp[x], cnt);
}
if (target != 1) {
chmax(mp[target], 1LL);
}
}
ll lcm = 1;
rep(i, 1000000 + 10) {
if (mp[i] == 0)
continue;
lcm *= modpow(i, mp[i], MOD);
lcm %= MOD;
}
ll res = 0;
rep(i, n) {
res += lcm * com.inv[a[i]];
res %= MOD;
}
cout << res << endl;
return 0;
}
| insert | 97 | 97 | 97 | 98 | TLE | |
p02793 | C++ | Runtime Error |
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e5 + 10;
int n, mod = 1e9 + 7;
ll arr[N], arr2[N];
bool found[N] = {};
ll fp(ll base, ll exp) {
if (exp == 0)
return 1;
ll ans = fp(base, exp / 2);
ans = (ans * ans) % mod;
if (exp % 2 != 0)
ans = (ans * (base % mod)) % mod;
return ans;
}
int main() {
ll cnt[1000] = {};
bool primes[1005];
int n = 1000;
memset(primes, true, sizeof primes);
for (int i = 2; i * i <= n; i++) {
if (primes[i]) {
for (int j = i * i; j <= n; j += i)
primes[j] = false;
}
}
vector<int> v;
ll ans = 1, aa;
cin >> aa;
for (int i = 0; i < aa; i++) {
cin >> arr[i];
arr2[i] = arr[i];
}
for (int i = 2; i <= n; i++) {
if (primes[i])
v.push_back(i);
}
// cout<<v.size();
ll lcm = 1;
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < aa; j++) {
ll k = 0;
while (arr[j] % v[i] == 0) {
found[arr[j]] = 1;
k++;
arr[j] /= v[i];
}
cnt[i] = max(k, cnt[i]);
}
lcm *= fp(v[i], cnt[i]);
lcm %= mod;
}
for (int i = 0; i < aa; i++) {
if (!found[arr[i]]) {
lcm *= arr[i];
found[arr[i]] = 1;
lcm %= mod;
}
}
// cout<<lcm<<endl;
ll answer = 0;
for (int i = 0; i < aa; i++) {
answer += (lcm * fp(arr2[i], mod - 2)) % mod;
answer %= mod;
// ans%=mod;
}
cout << answer;
return 0;
}
|
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10;
int n, mod = 1e9 + 7;
ll arr[N], arr2[N];
bool found[N] = {};
ll fp(ll base, ll exp) {
if (exp == 0)
return 1;
ll ans = fp(base, exp / 2);
ans = (ans * ans) % mod;
if (exp % 2 != 0)
ans = (ans * (base % mod)) % mod;
return ans;
}
int main() {
ll cnt[1000] = {};
bool primes[1005];
int n = 1000;
memset(primes, true, sizeof primes);
for (int i = 2; i * i <= n; i++) {
if (primes[i]) {
for (int j = i * i; j <= n; j += i)
primes[j] = false;
}
}
vector<int> v;
ll ans = 1, aa;
cin >> aa;
for (int i = 0; i < aa; i++) {
cin >> arr[i];
arr2[i] = arr[i];
}
for (int i = 2; i <= n; i++) {
if (primes[i])
v.push_back(i);
}
// cout<<v.size();
ll lcm = 1;
for (int i = 0; i < v.size(); i++) {
for (int j = 0; j < aa; j++) {
ll k = 0;
while (arr[j] % v[i] == 0) {
found[arr[j]] = 1;
k++;
arr[j] /= v[i];
}
cnt[i] = max(k, cnt[i]);
}
lcm *= fp(v[i], cnt[i]);
lcm %= mod;
}
for (int i = 0; i < aa; i++) {
if (!found[arr[i]]) {
lcm *= arr[i];
found[arr[i]] = 1;
lcm %= mod;
}
}
// cout<<lcm<<endl;
ll answer = 0;
for (int i = 0; i < aa; i++) {
answer += (lcm * fp(arr2[i], mod - 2)) % mod;
answer %= mod;
// ans%=mod;
}
cout << answer;
return 0;
}
| replace | 4 | 5 | 4 | 5 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int pow(int x, int p) {
int res = 1;
while (p) {
if (p & 1) {
res = (res * x) % mod;
}
p >>= 1;
x = (x * x) % mod;
}
return res;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
#endif
int n;
cin >> n;
vector<int> v(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> v[i];
int x = v[i];
for (int j = 2; j * j <= v[i] && x > 1; j++) {
if (x % j == 0) {
int cnt = 0;
while (x % j == 0) {
cnt++;
x /= j;
}
mp[j] = max(mp[j], cnt);
}
}
if (x > 1)
mp[x] = max(mp[x], 1ll);
}
vector<pii> vp;
for (auto i : mp) {
vp.push_back({i.first, i.second});
}
int ans = 0;
for (int i = 0; i < n; i++) {
int val = 1;
for (auto j : vp) {
int x = j.first;
int cnt = 0;
while (v[i] % x == 0) {
cnt++;
v[i] /= x;
}
val = (val * pow(x, j.second - cnt)) % mod;
}
ans = (val + ans) % mod;
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int pow(int x, int p) {
int res = 1;
while (p) {
if (p & 1) {
res = (res * x) % mod;
}
p >>= 1;
x = (x * x) % mod;
}
return res;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> v[i];
int x = v[i];
for (int j = 2; j * j <= v[i] && x > 1; j++) {
if (x % j == 0) {
int cnt = 0;
while (x % j == 0) {
cnt++;
x /= j;
}
mp[j] = max(mp[j], cnt);
}
}
if (x > 1)
mp[x] = max(mp[x], 1ll);
}
vector<pii> vp;
for (auto i : mp) {
vp.push_back({i.first, i.second});
}
int ans = 0;
for (int i = 0; i < n; i++) {
int val = 1;
for (auto j : vp) {
int x = j.first;
int cnt = 0;
while (v[i] % x == 0) {
cnt++;
v[i] /= x;
}
val = (val * pow(x, j.second - cnt)) % mod;
}
ans = (val + ans) % mod;
}
cout << ans << "\n";
}
| delete | 26 | 31 | 26 | 26 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <stdlib.h>
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define int long long
#define endl "\n"
#define all(v) v.begin(), v.end()
#define fir first
#define sec second
#define m_p make_pair
#define m_t make_tuple
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const double pai = 3.1415926535897;
const int mod = 1000000007;
const int INF = 2000000015;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int jousu(int x00, int y00) {
int z00 = 1;
for (int i = 0; i < y00; i++) {
z00 *= x00;
}
return z00;
}
int keta(int x00) {
int z00 = x00;
int w00 = 0;
while (z00 != 0) {
z00 /= 10;
w00++;
}
return w00;
}
int krag(double xx) { return INF - (int)(INF - xx); }
// x未満の要素数を返す二分探索関数
int b_s(vector<int> &vec, int xx) {
int t = -1;
int f = vec.size();
while (f - t > 1) {
int m = (t + f) / 2;
if (vec[m] < xx) { // 未満では<, 以下では<=
t = m;
} else {
f = m;
}
}
return f;
}
template <typename T> void vecout(vector<T> &vec) {
for (T t : vec)
cout << t << " ";
cout << endl;
}
template <typename TT> void vecin(vector<TT> &vec) {
for (int i = 0; i < vec.size(); i++) {
cin >> vec[i];
}
}
// テーブルを作る前処理
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;
}
}
// n個を1個以上のx組のグループに分ける重複組み合わせはcom(n-1,x-1)
// グループが0個でもいいときはnにxを足す
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
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 gcd(int xx, int yy) {
int p = xx;
int q = yy;
if (q > p)
swap(p, q);
while (p % q != 0) {
p %= q;
swap(p, q);
}
return q;
}
int lcm(int xx, int yy) { return xx * yy / gcd(xx, yy); }
bool prime(int xx) {
if (xx <= 1) {
return 0;
}
double d = sqrt(xx);
for (int i = 2; i <= d; i++) {
if (xx % i == 0) {
return 0;
}
}
return 1;
}
signed main() {
int n, d = 1, t = 0;
cin >> n;
vector<int> vec(n);
map<int, int> ma;
vecin(vec);
rep(i, n) {
int j = 2;
int a = vec[i];
while (a != 1) {
if (!prime(j)) {
j++;
continue;
}
int b = 0;
while (a % j == 0) {
a /= j;
b++;
}
ma[j] = max(ma[j], b);
if (j * j > a) {
ma[a] = max(1ll, ma[a]);
}
j++;
}
}
for (auto p : ma) {
auto k = p.first;
auto v = p.second;
d *= modpow(k, v);
if (d >= mod)
d %= mod;
}
rep(i, n) { t += (d * modinv(vec[i], mod)) % mod; }
cout << t % mod << endl;
}
| #include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <cmath>
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <deque> // deque
#include <iostream> // cout, endl, cin
#include <map> // map
#include <math.h>
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <stdlib.h>
#include <string> // string, to_string, stoi
#include <tuple> // tuple, make_tuple
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <utility> // pair, make_pair
#include <vector> // vector
using namespace std;
#define int long long
#define endl "\n"
#define all(v) v.begin(), v.end()
#define fir first
#define sec second
#define m_p make_pair
#define m_t make_tuple
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
const double pai = 3.1415926535897;
const int mod = 1000000007;
const int INF = 2000000015;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
int jousu(int x00, int y00) {
int z00 = 1;
for (int i = 0; i < y00; i++) {
z00 *= x00;
}
return z00;
}
int keta(int x00) {
int z00 = x00;
int w00 = 0;
while (z00 != 0) {
z00 /= 10;
w00++;
}
return w00;
}
int krag(double xx) { return INF - (int)(INF - xx); }
// x未満の要素数を返す二分探索関数
int b_s(vector<int> &vec, int xx) {
int t = -1;
int f = vec.size();
while (f - t > 1) {
int m = (t + f) / 2;
if (vec[m] < xx) { // 未満では<, 以下では<=
t = m;
} else {
f = m;
}
}
return f;
}
template <typename T> void vecout(vector<T> &vec) {
for (T t : vec)
cout << t << " ";
cout << endl;
}
template <typename TT> void vecin(vector<TT> &vec) {
for (int i = 0; i < vec.size(); i++) {
cin >> vec[i];
}
}
// テーブルを作る前処理
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;
}
}
// n個を1個以上のx組のグループに分ける重複組み合わせはcom(n-1,x-1)
// グループが0個でもいいときはnにxを足す
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int modinv(int a, int m) {
int b = m, u = 1, v = 0;
while (b) {
int t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
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 gcd(int xx, int yy) {
int p = xx;
int q = yy;
if (q > p)
swap(p, q);
while (p % q != 0) {
p %= q;
swap(p, q);
}
return q;
}
int lcm(int xx, int yy) { return xx * yy / gcd(xx, yy); }
bool prime(int xx) {
if (xx <= 1) {
return 0;
}
double d = sqrt(xx);
for (int i = 2; i <= d; i++) {
if (xx % i == 0) {
return 0;
}
}
return 1;
}
signed main() {
int n, d = 1, t = 0;
cin >> n;
vector<int> vec(n);
map<int, int> ma;
vecin(vec);
rep(i, n) {
int j = 2;
int a = vec[i];
while (a != 1) {
if (!prime(j)) {
j++;
continue;
}
int b = 0;
while (a % j == 0) {
a /= j;
b++;
}
ma[j] = max(ma[j], b);
if (j * j > a) {
ma[a] = max(1ll, ma[a]);
break;
}
j++;
}
}
for (auto p : ma) {
auto k = p.first;
auto v = p.second;
d *= modpow(k, v);
if (d >= mod)
d %= mod;
}
rep(i, n) { t += (d * modinv(vec[i], mod)) % mod; }
cout << t % mod << endl;
}
| insert | 174 | 174 | 174 | 175 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int pow(int x, int p) {
int res = 1;
while (p) {
if (p & 1) {
res = (res * x) % mod;
}
p >>= 1;
x = (x * x) % mod;
}
return res;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "rt", stdin);
freopen("output.txt", "wt", stdout);
#endif
int n;
cin >> n;
vector<int> v(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> v[i];
int x = v[i];
for (int j = 2; j * j <= v[i] && x > 1; j++) {
if (x % j == 0) {
int cnt = 0;
while (x % j == 0) {
cnt++;
x /= j;
}
mp[j] = max(mp[j], cnt);
}
}
if (x > 1)
mp[x] = max(mp[x], 1ll);
}
int l = 1;
for (auto i : mp) {
l = (l * pow(i.first, i.second)) % mod;
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = (ans + (l * pow(v[i], mod - 2)) % mod) % mod;
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define pi 3.14159265359
#define int long long
#define pii pair<int, int>
const int mod = 1e9 + 7;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
int pow(int x, int p) {
int res = 1;
while (p) {
if (p & 1) {
res = (res * x) % mod;
}
p >>= 1;
x = (x * x) % mod;
}
return res;
}
int32_t main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<int> v(n);
map<int, int> mp;
for (int i = 0; i < n; i++) {
cin >> v[i];
int x = v[i];
for (int j = 2; j * j <= v[i] && x > 1; j++) {
if (x % j == 0) {
int cnt = 0;
while (x % j == 0) {
cnt++;
x /= j;
}
mp[j] = max(mp[j], cnt);
}
}
if (x > 1)
mp[x] = max(mp[x], 1ll);
}
int l = 1;
for (auto i : mp) {
l = (l * pow(i.first, i.second)) % mod;
}
int ans = 0;
for (int i = 0; i < n; i++) {
ans = (ans + (l * pow(v[i], mod - 2)) % mod) % mod;
}
cout << ans << "\n";
}
| delete | 26 | 31 | 26 | 26 | -6 | terminate called after throwing an instance of 'std::bad_alloc'
what(): std::bad_alloc
|
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
vector<long long> primes;
void gen_primes() {
primes.push_back(2);
for (long long i = 3; i * i <= 1e6; i += 2) {
bool is_ok = true;
for (int j = 0; j < primes.size(); j++) {
if (i % primes[j] == 0) {
is_ok = false;
break;
}
}
if (is_ok)
primes.push_back(i);
}
}
bool is_prime(long long n) {
if (n == 1)
return false;
for (int i = 0; primes[i] * primes[i] <= n; i++) {
if (n % primes[i] == 0)
return false;
}
return true;
}
long long modpow(long long a, long long n, long long mod) {
long long ret = 1;
while (n > 0) {
if (n & 1)
ret = ret * a % mod;
a = a * a % mod;
n >>= 1;
}
return ret;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int main() {
long long n, a[10009];
map<long long, long long> mp;
cin >> n;
gen_primes();
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
if (is_prime(a[i]))
mp[a[i]] = max(1LL, mp[a[i]]);
else {
long long t = a[i];
for (int j = 0; j < primes.size(); j++) {
long long cnt = 0;
while (t % primes[j] == 0) {
cnt++;
t /= primes[j];
}
if (cnt > 0)
mp[primes[j]] = max(cnt, mp[primes[j]]);
}
if (t > 1)
mp[t] = max(1LL, mp[t]);
}
}
long long lcm = 1;
for (auto p : mp) {
lcm = (lcm * modpow(p.first, p.second, MOD)) % MOD;
}
long long ans = 0;
for (int i = 0; i < n; i++) {
ans = (ans + ((lcm * modinv(a[i], MOD)) % MOD)) % MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
vector<long long> primes;
void gen_primes() {
primes.push_back(2);
for (long long i = 3; i * i <= 1e7; i += 2) {
bool is_ok = true;
for (int j = 0; j < primes.size(); j++) {
if (i % primes[j] == 0) {
is_ok = false;
break;
}
}
if (is_ok)
primes.push_back(i);
}
}
bool is_prime(long long n) {
if (n == 1)
return false;
for (int i = 0; primes[i] * primes[i] <= n; i++) {
if (n % primes[i] == 0)
return false;
}
return true;
}
long long modpow(long long a, long long n, long long mod) {
long long ret = 1;
while (n > 0) {
if (n & 1)
ret = ret * a % mod;
a = a * a % mod;
n >>= 1;
}
return ret;
}
long long modinv(long long a, long long mod) { return modpow(a, mod - 2, mod); }
int main() {
long long n, a[10009];
map<long long, long long> mp;
cin >> n;
gen_primes();
for (int i = 0; i < n; i++)
cin >> a[i];
for (int i = 0; i < n; i++) {
if (is_prime(a[i]))
mp[a[i]] = max(1LL, mp[a[i]]);
else {
long long t = a[i];
for (int j = 0; j < primes.size(); j++) {
long long cnt = 0;
while (t % primes[j] == 0) {
cnt++;
t /= primes[j];
}
if (cnt > 0)
mp[primes[j]] = max(cnt, mp[primes[j]]);
}
if (t > 1)
mp[t] = max(1LL, mp[t]);
}
}
long long lcm = 1;
for (auto p : mp) {
lcm = (lcm * modpow(p.first, p.second, MOD)) % MOD;
}
long long ans = 0;
for (int i = 0; i < n; i++) {
ans = (ans + ((lcm * modinv(a[i], MOD)) % MOD)) % MOD;
}
cout << ans << endl;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) \
for (auto &youso_ : (x)) \
cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) (64 - __builtin_clzll(x))
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define cinfast() cin.tie(0), ios::sync_with_stdio(false)
#define PERM(c) \
sort(All(c)); \
for (bool cp = true; cp; cp = next_permutation(All(c)))
#define COMB(n, k) \
for (ll bit = (1LL << k) - 1; bit < (1LL << n); bit = next_combination(bit))
#define PERM2(n, k) \
COMB(n, k) { \
vector<int> sel; \
for (int bitindex = 0; bitindex < n; bitindex++) \
if (bit >> bitindex & 1) \
sel.emplace_back(bitindex); \
PERM(sel) { Printv(sel); } \
}
#define MKORDER(n) \
vector<int> od(n); \
iota(All(od), 0LL);
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&...tail) {
cin >> head;
CIN(move(tail)...);
}
template <class Head> inline void COUT(Head &&head) { cout << (head) << "\n"; }
template <class Head, class... Tail>
inline void COUT(Head &&head, Tail &&...tail) {
cout << (head) << " ";
COUT(forward<Tail>(tail)...);
}
#define CCIN(...) \
char __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
long long __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Printv(v) \
{ \
FOREACH(x, v) { cout << x << " "; } \
cout << "\n"; \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
long long next_combination(long long sub) {
long long x = sub & -sub, y = sub + x;
return (((sub & ~y) / x) >> 1) | y;
}
// generic lambdas
template <typename F>
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#elif defined(__GNUC__) && \
(__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
static inline constexpr decltype(auto)
fix(F &&f) noexcept {
return [f = std::forward<F>(f)](auto &&...args) {
return f(f, std::forward<decltype(args)>(args)...);
};
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238
#define EPS 1e-7
// 1000000007 で割ったあまりを扱う構造体
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;
val = (val + MOD) % MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
val = (val + MOD) % MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
map<ll, ll> primefact(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
signed main() {
LCIN(N);
VL A(N);
VECCIN(A);
map<ll, ll> memo;
REP(i, N) {
FOREACH(x, primefact(A[i])) { memo[x.fi] = max(memo[x.fi], x.second); }
}
mint ans = 0;
REP(i, N) {
mint tmp = 1;
FOREACH(x, memo) { tmp *= modpow((mint)x.fi, x.se); }
FOREACH(x, primefact(A[i])) { tmp /= modpow((mint)x.fi, x.se); }
ans += tmp;
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
// #define double long double
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define FORR(i, a, b) for (int i = (a); i > (b); --i)
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOREACH(x, a) for (auto &(x) : (a))
#define VECCIN(x) \
for (auto &youso_ : (x)) \
cin >> youso_
#define bitcnt(x) __builtin_popcount(x)
#define lbit(x) __builtin_ffsll(x)
#define rbit(x) (64 - __builtin_clzll(x))
#define fi first
#define se second
#define All(a) (a).begin(), (a).end()
#define rAll(a) (a).rbegin(), (a).rend()
#define cinfast() cin.tie(0), ios::sync_with_stdio(false)
#define PERM(c) \
sort(All(c)); \
for (bool cp = true; cp; cp = next_permutation(All(c)))
#define COMB(n, k) \
for (ll bit = (1LL << k) - 1; bit < (1LL << n); bit = next_combination(bit))
#define PERM2(n, k) \
COMB(n, k) { \
vector<int> sel; \
for (int bitindex = 0; bitindex < n; bitindex++) \
if (bit >> bitindex & 1) \
sel.emplace_back(bitindex); \
PERM(sel) { Printv(sel); } \
}
#define MKORDER(n) \
vector<int> od(n); \
iota(All(od), 0LL);
template <typename T = long long> inline T IN() {
T x;
cin >> x;
return (x);
}
inline void CIN() {}
template <class Head, class... Tail>
inline void CIN(Head &&head, Tail &&...tail) {
cin >> head;
CIN(move(tail)...);
}
template <class Head> inline void COUT(Head &&head) { cout << (head) << "\n"; }
template <class Head, class... Tail>
inline void COUT(Head &&head, Tail &&...tail) {
cout << (head) << " ";
COUT(forward<Tail>(tail)...);
}
#define CCIN(...) \
char __VA_ARGS__; \
CIN(__VA_ARGS__)
#define DCIN(...) \
double __VA_ARGS__; \
CIN(__VA_ARGS__)
#define LCIN(...) \
long long __VA_ARGS__; \
CIN(__VA_ARGS__)
#define SCIN(...) \
string __VA_ARGS__; \
CIN(__VA_ARGS__)
#define Printv(v) \
{ \
FOREACH(x, v) { cout << x << " "; } \
cout << "\n"; \
}
template <typename T = string> inline void eputs(T s) {
cout << s << "\n";
exit(0);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
long long next_combination(long long sub) {
long long x = sub & -sub, y = sub + x;
return (((sub & ~y) / x) >> 1) | y;
}
// generic lambdas
template <typename F>
#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
[[nodiscard]]
#elif defined(__GNUC__) && \
(__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)
__attribute__((warn_unused_result))
#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)
static inline constexpr decltype(auto)
fix(F &&f) noexcept {
return [f = std::forward<F>(f)](auto &&...args) {
return f(f, std::forward<decltype(args)>(args)...);
};
}
template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;
template <typename T> using PQ = priority_queue<T>;
typedef long long ll;
typedef vector<ll> VL;
typedef vector<VL> VVL;
typedef pair<ll, ll> PL;
typedef vector<PL> VPL;
typedef vector<bool> VB;
typedef vector<double> VD;
typedef vector<string> VS;
const int INF = 1e9;
const int MOD = 1e9 + 7;
// const int MOD = 998244353;
const ll LINF = 1e18;
const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};
const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};
#define PI 3.141592653589793238
#define EPS 1e-7
// 1000000007 で割ったあまりを扱う構造体
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;
val = (val + MOD) % MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
val = (val + MOD) % MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
};
using mint = Fp<MOD>;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
map<ll, ll> primefact(ll n) {
map<ll, ll> res;
for (ll i = 2; i * i <= n; i++) {
while (n % i == 0) {
res[i]++;
n /= i;
}
}
if (n != 1)
res[n] = 1;
return res;
}
ll lcm(ll a, ll b) { return a * b / gcd(a, b); }
signed main() {
LCIN(N);
VL A(N);
VECCIN(A);
map<ll, ll> memo;
REP(i, N) {
FOREACH(x, primefact(A[i])) { memo[x.fi] = max(memo[x.fi], x.second); }
}
mint ans = 0;
mint l = 1;
FOREACH(x, memo) { l *= modpow((mint)x.fi, x.se); }
REP(i, N) { ans += l / A[i]; }
cout << ans << "\n";
}
| replace | 220 | 226 | 220 | 223 | TLE | |
p02793 | C++ | Time Limit Exceeded | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
using LL = long long;
using ld = long double;
using VB = vector<bool>;
using VVB = vector<VB>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VS = vector<string>;
using VD = vector<double>;
using PII = pair<int, int>;
using VP = vector<PII>;
using PLL = pair<LL, LL>;
using VPL = vector<PLL>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqs = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (int)1e9;
constexpr LL inf_ll = (LL)1e18, MOD = 1000000007;
const ld PI = acosl(-1.0), EPS = 1e-12;
template <class T> inline void Sort(T &a) noexcept { sort(all(a)); }
template <class T> inline void RSort(T &a) noexcept { sort(rall(a)); }
template <class T> inline void Reverse(T &a) noexcept { reverse(all(a)); }
template <class T> inline void Unique(T &a) noexcept {
a.erase(unique(all(a)), a.end());
}
template <class T> inline T Sorted(T a) noexcept {
Sort(a);
return a;
}
template <class T> inline T RSorted(T a) noexcept {
RSort(a);
return a;
}
template <class T> inline T Reversed(T a) noexcept {
Reverse(a);
return a;
}
template <class T> inline T Uniqued(T a) noexcept {
Unique(a);
return a;
}
template <class T> inline auto Max(const T &a) noexcept {
return *max_element(all(a));
}
template <class T> inline auto Min(const T &a) noexcept {
return *min_element(all(a));
}
template <class T> inline int MaxPos(const T &a) noexcept {
return max_element(all(a)) - a.begin();
}
template <class T> inline int MinPos(const T &a) noexcept {
return min_element(all(a)) - a.begin();
}
template <class T, class U> inline int Count(const T &a, const U &v) noexcept {
return count(all(a), v);
}
template <class T, class U> inline int Find(const T &a, const U &v) noexcept {
auto pos = find(all(a), v);
return pos == a.end() ? -1 : pos - a.begin();
}
template <class T, class U> inline U Sum(const T &a, const U &v) noexcept {
return accumulate(all(a), v);
}
template <class T, class U> inline int Lower(const T &a, const U &v) noexcept {
return lower_bound(all(a), v) - a.begin();
}
template <class T, class U> inline int Upper(const T &a, const U &v) noexcept {
return upper_bound(all(a), v) - a.begin();
}
template <class T, class P> inline void RemoveIf(T &a, P f) noexcept {
a.erase(remove_if(all(a), f), a.end());
}
template <class T> inline T Age(T n, T m) noexcept { return (n + m - 1) / m; }
template <class T> inline T Age2(T n, T m) noexcept { return Age(n, m) * m; }
template <class T> inline T Tri(T n) noexcept {
return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);
}
template <class T = long long> inline T BIT(int b) noexcept {
return T{1} << b;
}
template <class T> inline T Gcd(T n, T m) noexcept {
return m ? Gcd(m, n % m) : n;
}
template <class T> inline T Lcm(T n, T m) noexcept { return n / Gcd(n, m) * m; }
template <class T> inline T Pow(T a, T n) noexcept {
T r = 1;
while (n > 0) {
if (n & 1)
r *= a;
a *= a;
n /= 2;
}
return r;
}
template <class T> inline T Powmod(T a, T n, T m = MOD) noexcept {
T r = 1;
while (n > 0) {
if (n & 1)
r = r * a % m, n--;
else
a = a * a % m, n /= 2;
}
return r;
}
template <class T> inline bool chmax(T &a, const T &b) noexcept {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) noexcept {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool inRange(const T &v, const T &min, const T &max) noexcept {
return min <= v && v <= max;
}
inline string operator*(string s, int n) noexcept {
string ret;
rep(i, n) ret += s;
return ret;
}
// --- input --- //
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
inline int gc() noexcept { return getchar_unlocked(); }
template <class T> inline void InputF(T &v) noexcept { cin >> v; }
inline void InputF(char &v) noexcept {
while (isspace(v = gc()))
;
}
inline void InputF(string &v) noexcept {
char c;
for (InputF(c); !isspace(c); c = gc())
v += c;
}
inline void InputF(int &v) noexcept {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(long long &v) noexcept {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(double &v) noexcept {
double dp = 1;
bool neg = false, adp = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c) || c == '.'; c = gc()) {
if (c == '.')
adp = true;
else if (adp)
v += (c - '0') * (dp *= 0.1);
else
v = v * 10 + (c - '0');
}
if (neg)
v = -v;
}
template <class T, class U> inline void InputF(pair<T, U> &v) noexcept {
InputF(v.first);
InputF(v.second);
}
template <class T> inline void InputF(vector<T> &v) noexcept {
for (auto &e : v)
InputF(e);
}
template <class T> inline T input() {
T v;
InputF(v);
return v;
}
struct InputV {
int n, m;
InputV(int N) : n(N), m(0) {}
InputV(pair<int, int> N) : n(N.first), m(N.second) {}
template <class T> operator vector<T>() noexcept {
vector<T> v(n);
InputF(v);
return v;
}
template <class T> operator vector<vector<T>>() noexcept {
vector<vector<T>> v(n, vector<T>(m));
InputF(v);
return v;
}
};
struct Input {
template <class T> operator T() noexcept { return input<T>(); }
int operator--(int) {
int v;
InputF(v);
v--;
return v;
}
InputV operator[](int n) noexcept { return InputV(n); }
InputV operator[](pair<int, int> n) noexcept { return InputV(n); }
void operator()() {}
template <class H, class... T> void operator()(H &&h, T &&...t) {
InputF(h);
operator()(forward<T>(t)...);
}
template <class T, size_t W> array<vector<T>, W> get(int H) {
array<vector<T>, W> ret;
rep(i, H) rep(j, W) {
T x = *this;
ret[j].push_back(x);
}
return ret;
}
} in;
// --- output --- //
struct BoolStr {
const char *t, *f;
BoolStr(const char *_t, const char *_f) : t(_t), f(_f) {}
} Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
const char *d, *l;
DivStr(const char *_d, const char *_l) : d(_d), l(_l) {}
} spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"),
no_endl(" ", "");
class Output {
BoolStr B{Yes};
DivStr D{spc};
bool isPrint = true;
void p(double v) { printf("%.20f", v); }
void p(long double v) { printf("%.20Lf", v); }
void p(int v) { printf("%d", v); }
void p(LL v) { printf("%lld", v); }
void p(char v) { putchar(v); }
void p(bool v) { printf("%s", v ? B.t : B.f); }
template <class T> void p(const T &v) { cout << v; }
template <class T, class U> void p(const pair<T, U> &v) {
p(v.first);
printf("%s", D.d);
p(v.second);
}
template <class T> void p(const vector<T> &v) {
rep(i, sz(v)) {
if (i)
printf("%s", D.d);
p(v[i]);
}
}
template <class T> void p(const vector<vector<T>> &v) {
rep(i, sz(v)) {
if (i)
printf("%s", D.l);
p(v[i]);
}
}
void p(const BoolStr &v) {
B = v;
isPrint = false;
}
void p(const DivStr &v) {
D = v;
isPrint = false;
}
public:
void operator()() { printf("%s", D.l); }
template <class H> void operator()(H &&h) {
p(h);
if (isPrint)
printf("%s", D.l);
isPrint = true;
B = Yes;
D = spc;
}
template <class H, class... T> void operator()(H &&h, T &&...t) {
p(h);
if (isPrint)
printf("%s", D.d);
isPrint = true;
operator()(forward<T>(t)...);
}
template <class... T> void exit(T &&...t) {
operator()(forward<T>(t)...);
std::exit(EXIT_SUCCESS);
}
} out;
// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) (void(0))
#endif
// ---------------------------------------------------------------- //
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n) : n(n), f(n + 1) {
assert(2 <= n);
f[0] = f[1] = -1;
for (long long i = 2; i <= n; ++i)
if (!f[i]) {
primes.push_back(i);
f[i] = i;
for (long long j = i * i; j <= n; j += i)
if (!f[j])
f[j] = i;
}
}
bool isPrime(int x) { return f[x] == x; }
vector<pair<int, int>> factor(int x) {
assert(1 <= x);
vector<pair<int, int>> res;
while (x != 1) {
if (res.empty() || res.back().first != f[x]) {
res.emplace_back(f[x], 1);
} else {
res.back().second++;
}
x /= f[x];
}
return res;
}
map<int, int> factor_map(int x) {
assert(1 <= x);
map<int, int> res;
while (x != 1) {
res[f[x]]++;
x /= f[x];
}
return res;
}
vector<int> factor_vec(int x) {
assert(1 <= x);
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
};
template <int MOD> struct modint {
using T = long long;
T n;
constexpr modint(const T x = 0) noexcept : n(x % MOD) {
if (n < 0)
n += MOD;
}
constexpr int get_mod() const noexcept { return MOD; }
constexpr modint operator+() const noexcept { return *this; }
constexpr modint operator-() const noexcept { return n ? MOD - n : 0; }
constexpr modint &operator++() noexcept {
if (MOD <= ++n)
n = 0;
return *this;
}
constexpr modint &operator--() noexcept {
if (n <= 0)
n = MOD;
n--;
return *this;
}
constexpr modint &operator++(int) noexcept {
modint t = *this;
++*this;
return t;
}
constexpr modint &operator--(int) noexcept {
modint t = *this;
--*this;
return t;
}
constexpr modint next() const noexcept {
modint t = *this;
++t;
return t;
}
constexpr modint pred() const noexcept {
modint t = *this;
--t;
return t;
}
constexpr modint operator+(const modint &m) const noexcept {
return modint(*this) += m;
}
constexpr modint operator-(const modint &m) const noexcept {
return modint(*this) -= m;
}
constexpr modint operator*(const modint &m) const noexcept {
return modint(*this) *= m;
}
constexpr modint operator/(const modint &m) const noexcept {
return modint(*this) /= m;
}
constexpr modint &operator+=(const modint &m) noexcept {
n += m.n;
if (n >= MOD)
n -= MOD;
return *this;
}
constexpr modint &operator-=(const modint &m) noexcept {
n -= m.n;
if (n < 0)
n += MOD;
return *this;
}
constexpr modint &operator*=(const modint &m) noexcept {
n = n * m.n % MOD;
return *this;
}
constexpr modint &operator/=(const modint &m) noexcept {
assert(m.n);
T a = m.n, b = MOD, u = 1, v = 0;
while (b) {
T t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
n = n * u % MOD;
if (n < 0)
n += MOD;
return *this;
}
constexpr bool operator==(const modint &m) const noexcept { return n == m.n; }
constexpr bool operator!=(const modint &m) const noexcept { return n != m.n; }
constexpr modint pow(modint m) const noexcept {
modint t = n, res = 1;
while (m.n > 0) {
if (m.n & 1)
res *= t;
t *= t;
m.n >>= 1;
}
return res;
}
constexpr modint operator^(modint m) const noexcept { return pow(m); }
};
using mint = modint<1000000007>;
using VM = vector<mint>;
ostream &operator<<(ostream &os, const modint<MOD> &m) noexcept {
return os << m.n;
}
istream &operator>>(istream &is, modint<MOD> &m) noexcept { return is >> m.n; }
mint operator""_m(unsigned long long n) { return n; }
int main() {
int n = in;
VI a = in[n];
Sieve sieve(1000009);
map<int, int> L;
rep(i, n) {
auto f = sieve.factor(a[i]);
for (auto p : f) {
chmax(L[p.first], p.second);
}
}
mint ans;
rep(i, n) {
auto f = sieve.factor_map(a[i]);
mint num = 1;
for (auto p : L) {
num *= mint(p.first) ^ (p.second - f[p.first]);
}
ans += num;
}
out(ans);
} | #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
using LL = long long;
using ld = long double;
using VB = vector<bool>;
using VVB = vector<VB>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VS = vector<string>;
using VD = vector<double>;
using PII = pair<int, int>;
using VP = vector<PII>;
using PLL = pair<LL, LL>;
using VPL = vector<PLL>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqs = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (int)1e9;
constexpr LL inf_ll = (LL)1e18, MOD = 1000000007;
const ld PI = acosl(-1.0), EPS = 1e-12;
template <class T> inline void Sort(T &a) noexcept { sort(all(a)); }
template <class T> inline void RSort(T &a) noexcept { sort(rall(a)); }
template <class T> inline void Reverse(T &a) noexcept { reverse(all(a)); }
template <class T> inline void Unique(T &a) noexcept {
a.erase(unique(all(a)), a.end());
}
template <class T> inline T Sorted(T a) noexcept {
Sort(a);
return a;
}
template <class T> inline T RSorted(T a) noexcept {
RSort(a);
return a;
}
template <class T> inline T Reversed(T a) noexcept {
Reverse(a);
return a;
}
template <class T> inline T Uniqued(T a) noexcept {
Unique(a);
return a;
}
template <class T> inline auto Max(const T &a) noexcept {
return *max_element(all(a));
}
template <class T> inline auto Min(const T &a) noexcept {
return *min_element(all(a));
}
template <class T> inline int MaxPos(const T &a) noexcept {
return max_element(all(a)) - a.begin();
}
template <class T> inline int MinPos(const T &a) noexcept {
return min_element(all(a)) - a.begin();
}
template <class T, class U> inline int Count(const T &a, const U &v) noexcept {
return count(all(a), v);
}
template <class T, class U> inline int Find(const T &a, const U &v) noexcept {
auto pos = find(all(a), v);
return pos == a.end() ? -1 : pos - a.begin();
}
template <class T, class U> inline U Sum(const T &a, const U &v) noexcept {
return accumulate(all(a), v);
}
template <class T, class U> inline int Lower(const T &a, const U &v) noexcept {
return lower_bound(all(a), v) - a.begin();
}
template <class T, class U> inline int Upper(const T &a, const U &v) noexcept {
return upper_bound(all(a), v) - a.begin();
}
template <class T, class P> inline void RemoveIf(T &a, P f) noexcept {
a.erase(remove_if(all(a), f), a.end());
}
template <class T> inline T Age(T n, T m) noexcept { return (n + m - 1) / m; }
template <class T> inline T Age2(T n, T m) noexcept { return Age(n, m) * m; }
template <class T> inline T Tri(T n) noexcept {
return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);
}
template <class T = long long> inline T BIT(int b) noexcept {
return T{1} << b;
}
template <class T> inline T Gcd(T n, T m) noexcept {
return m ? Gcd(m, n % m) : n;
}
template <class T> inline T Lcm(T n, T m) noexcept { return n / Gcd(n, m) * m; }
template <class T> inline T Pow(T a, T n) noexcept {
T r = 1;
while (n > 0) {
if (n & 1)
r *= a;
a *= a;
n /= 2;
}
return r;
}
template <class T> inline T Powmod(T a, T n, T m = MOD) noexcept {
T r = 1;
while (n > 0) {
if (n & 1)
r = r * a % m, n--;
else
a = a * a % m, n /= 2;
}
return r;
}
template <class T> inline bool chmax(T &a, const T &b) noexcept {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) noexcept {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool inRange(const T &v, const T &min, const T &max) noexcept {
return min <= v && v <= max;
}
inline string operator*(string s, int n) noexcept {
string ret;
rep(i, n) ret += s;
return ret;
}
// --- input --- //
#if defined(_MSC_VER) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
inline int gc() noexcept { return getchar_unlocked(); }
template <class T> inline void InputF(T &v) noexcept { cin >> v; }
inline void InputF(char &v) noexcept {
while (isspace(v = gc()))
;
}
inline void InputF(string &v) noexcept {
char c;
for (InputF(c); !isspace(c); c = gc())
v += c;
}
inline void InputF(int &v) noexcept {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(long long &v) noexcept {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(double &v) noexcept {
double dp = 1;
bool neg = false, adp = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c) || c == '.'; c = gc()) {
if (c == '.')
adp = true;
else if (adp)
v += (c - '0') * (dp *= 0.1);
else
v = v * 10 + (c - '0');
}
if (neg)
v = -v;
}
template <class T, class U> inline void InputF(pair<T, U> &v) noexcept {
InputF(v.first);
InputF(v.second);
}
template <class T> inline void InputF(vector<T> &v) noexcept {
for (auto &e : v)
InputF(e);
}
template <class T> inline T input() {
T v;
InputF(v);
return v;
}
struct InputV {
int n, m;
InputV(int N) : n(N), m(0) {}
InputV(pair<int, int> N) : n(N.first), m(N.second) {}
template <class T> operator vector<T>() noexcept {
vector<T> v(n);
InputF(v);
return v;
}
template <class T> operator vector<vector<T>>() noexcept {
vector<vector<T>> v(n, vector<T>(m));
InputF(v);
return v;
}
};
struct Input {
template <class T> operator T() noexcept { return input<T>(); }
int operator--(int) {
int v;
InputF(v);
v--;
return v;
}
InputV operator[](int n) noexcept { return InputV(n); }
InputV operator[](pair<int, int> n) noexcept { return InputV(n); }
void operator()() {}
template <class H, class... T> void operator()(H &&h, T &&...t) {
InputF(h);
operator()(forward<T>(t)...);
}
template <class T, size_t W> array<vector<T>, W> get(int H) {
array<vector<T>, W> ret;
rep(i, H) rep(j, W) {
T x = *this;
ret[j].push_back(x);
}
return ret;
}
} in;
// --- output --- //
struct BoolStr {
const char *t, *f;
BoolStr(const char *_t, const char *_f) : t(_t), f(_f) {}
} Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
const char *d, *l;
DivStr(const char *_d, const char *_l) : d(_d), l(_l) {}
} spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"),
no_endl(" ", "");
class Output {
BoolStr B{Yes};
DivStr D{spc};
bool isPrint = true;
void p(double v) { printf("%.20f", v); }
void p(long double v) { printf("%.20Lf", v); }
void p(int v) { printf("%d", v); }
void p(LL v) { printf("%lld", v); }
void p(char v) { putchar(v); }
void p(bool v) { printf("%s", v ? B.t : B.f); }
template <class T> void p(const T &v) { cout << v; }
template <class T, class U> void p(const pair<T, U> &v) {
p(v.first);
printf("%s", D.d);
p(v.second);
}
template <class T> void p(const vector<T> &v) {
rep(i, sz(v)) {
if (i)
printf("%s", D.d);
p(v[i]);
}
}
template <class T> void p(const vector<vector<T>> &v) {
rep(i, sz(v)) {
if (i)
printf("%s", D.l);
p(v[i]);
}
}
void p(const BoolStr &v) {
B = v;
isPrint = false;
}
void p(const DivStr &v) {
D = v;
isPrint = false;
}
public:
void operator()() { printf("%s", D.l); }
template <class H> void operator()(H &&h) {
p(h);
if (isPrint)
printf("%s", D.l);
isPrint = true;
B = Yes;
D = spc;
}
template <class H, class... T> void operator()(H &&h, T &&...t) {
p(h);
if (isPrint)
printf("%s", D.d);
isPrint = true;
operator()(forward<T>(t)...);
}
template <class... T> void exit(T &&...t) {
operator()(forward<T>(t)...);
std::exit(EXIT_SUCCESS);
}
} out;
// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) (void(0))
#endif
// ---------------------------------------------------------------- //
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n) : n(n), f(n + 1) {
assert(2 <= n);
f[0] = f[1] = -1;
for (long long i = 2; i <= n; ++i)
if (!f[i]) {
primes.push_back(i);
f[i] = i;
for (long long j = i * i; j <= n; j += i)
if (!f[j])
f[j] = i;
}
}
bool isPrime(int x) { return f[x] == x; }
vector<pair<int, int>> factor(int x) {
assert(1 <= x);
vector<pair<int, int>> res;
while (x != 1) {
if (res.empty() || res.back().first != f[x]) {
res.emplace_back(f[x], 1);
} else {
res.back().second++;
}
x /= f[x];
}
return res;
}
map<int, int> factor_map(int x) {
assert(1 <= x);
map<int, int> res;
while (x != 1) {
res[f[x]]++;
x /= f[x];
}
return res;
}
vector<int> factor_vec(int x) {
assert(1 <= x);
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
};
template <int MOD> struct modint {
using T = long long;
T n;
constexpr modint(const T x = 0) noexcept : n(x % MOD) {
if (n < 0)
n += MOD;
}
constexpr int get_mod() const noexcept { return MOD; }
constexpr modint operator+() const noexcept { return *this; }
constexpr modint operator-() const noexcept { return n ? MOD - n : 0; }
constexpr modint &operator++() noexcept {
if (MOD <= ++n)
n = 0;
return *this;
}
constexpr modint &operator--() noexcept {
if (n <= 0)
n = MOD;
n--;
return *this;
}
constexpr modint &operator++(int) noexcept {
modint t = *this;
++*this;
return t;
}
constexpr modint &operator--(int) noexcept {
modint t = *this;
--*this;
return t;
}
constexpr modint next() const noexcept {
modint t = *this;
++t;
return t;
}
constexpr modint pred() const noexcept {
modint t = *this;
--t;
return t;
}
constexpr modint operator+(const modint &m) const noexcept {
return modint(*this) += m;
}
constexpr modint operator-(const modint &m) const noexcept {
return modint(*this) -= m;
}
constexpr modint operator*(const modint &m) const noexcept {
return modint(*this) *= m;
}
constexpr modint operator/(const modint &m) const noexcept {
return modint(*this) /= m;
}
constexpr modint &operator+=(const modint &m) noexcept {
n += m.n;
if (n >= MOD)
n -= MOD;
return *this;
}
constexpr modint &operator-=(const modint &m) noexcept {
n -= m.n;
if (n < 0)
n += MOD;
return *this;
}
constexpr modint &operator*=(const modint &m) noexcept {
n = n * m.n % MOD;
return *this;
}
constexpr modint &operator/=(const modint &m) noexcept {
assert(m.n);
T a = m.n, b = MOD, u = 1, v = 0;
while (b) {
T t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
n = n * u % MOD;
if (n < 0)
n += MOD;
return *this;
}
constexpr bool operator==(const modint &m) const noexcept { return n == m.n; }
constexpr bool operator!=(const modint &m) const noexcept { return n != m.n; }
constexpr modint pow(modint m) const noexcept {
modint t = n, res = 1;
while (m.n > 0) {
if (m.n & 1)
res *= t;
t *= t;
m.n >>= 1;
}
return res;
}
constexpr modint operator^(modint m) const noexcept { return pow(m); }
};
using mint = modint<1000000007>;
using VM = vector<mint>;
ostream &operator<<(ostream &os, const modint<MOD> &m) noexcept {
return os << m.n;
}
istream &operator>>(istream &is, modint<MOD> &m) noexcept { return is >> m.n; }
mint operator""_m(unsigned long long n) { return n; }
int main() {
int n = in;
VI a = in[n];
Sieve sieve(1000009);
map<int, int> L;
rep(i, n) {
auto f = sieve.factor(a[i]);
for (auto p : f) {
chmax(L[p.first], p.second);
}
}
mint LCA = 1;
for (auto p : L) {
LCA *= mint(p.first) ^ p.second;
}
mint ans = 0;
rep(i, n) { ans += LCA / a[i]; }
out(ans);
} | replace | 510 | 519 | 510 | 517 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, t, n) for (ll i = t; i <= (ll)n; ++i)
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;
}
};
class Eratosthenes {
public:
vector<bool> prime;
Eratosthenes(ll size) {
prime.resize(size, 1);
prime[0] = 0;
prime[1] = 0;
for (size_t i = 2; i * i <= size; ++i)
if (prime[i]) {
for (size_t j = 2; i * j <= size; ++j)
prime[i * j] = false;
}
}
};
class Combination {
vector<ll> fac; // n!(mod M)
vector<ll> ifac; // k!^{M-2} (mod M)
public:
Combination(ll size) {
fac.resize(size);
ifac.resize(size);
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < size; i++) {
fac[i + 1] = fac[i] * (i + 1) % mod;
ifac[i + 1] = ifac[i] * mpow(i + 1, mod - 2) % mod;
}
}
ll mpow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % mod;
return tmp * fac[a] % mod;
}
};
ll GCD(ll a, ll b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
ll gcd = GCD(a, b);
return a / gcd * b;
}
string s;
ll N;
int main() {
cin >> N;
Eratosthenes e(1e6);
map<int, int> m;
vector<ll> A(N);
REP(k, N) {
cin >> A[k];
ll a = A[k];
for (int i = 2; i * i <= e.prime.size(); i++) {
if (!e.prime[i])
continue;
int cnt = 0;
while (a % i == 0)
a /= i, cnt++;
m[i] = max(m[i], cnt);
}
if (a > 1)
m[a] = max(m[a], 1);
}
mint lcm = 1;
for (auto k : m)
REP(i, k.second) lcm *= k.first;
mint sum = 0;
REP(i, N) {
mint x = lcm / A[i];
sum += x;
}
cout << sum.x << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
#define REP(i, n) for (int i = 0; i < n; ++i)
#define FOR(i, t, n) for (ll i = t; i <= (ll)n; ++i)
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;
}
};
class Eratosthenes {
public:
vector<bool> prime;
Eratosthenes(ll size) {
prime.resize(size, 1);
prime[0] = 0;
prime[1] = 0;
for (size_t i = 2; i * i <= size; ++i)
if (prime[i]) {
for (size_t j = 2; i * j <= size; ++j)
prime[i * j] = false;
}
}
};
class Combination {
vector<ll> fac; // n!(mod M)
vector<ll> ifac; // k!^{M-2} (mod M)
public:
Combination(ll size) {
fac.resize(size);
ifac.resize(size);
fac[0] = 1;
ifac[0] = 1;
for (ll i = 0; i < size; i++) {
fac[i + 1] = fac[i] * (i + 1) % mod;
ifac[i + 1] = ifac[i] * mpow(i + 1, mod - 2) % mod;
}
}
ll mpow(ll x, ll n) {
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
ll comb(ll a, ll b) {
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % mod;
return tmp * fac[a] % mod;
}
};
ll GCD(ll a, ll b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
ll LCM(ll a, ll b) {
ll gcd = GCD(a, b);
return a / gcd * b;
}
string s;
ll N;
int main() {
cin >> N;
Eratosthenes e(1e6 + 1e5);
map<int, int> m;
vector<ll> A(N);
REP(k, N) {
cin >> A[k];
ll a = A[k];
for (int i = 2; i * i <= e.prime.size(); i++) {
if (!e.prime[i])
continue;
int cnt = 0;
while (a % i == 0)
a /= i, cnt++;
m[i] = max(m[i], cnt);
}
if (a > 1)
m[a] = max(m[a], 1);
}
mint lcm = 1;
for (auto k : m)
REP(i, k.second) lcm *= k.first;
mint sum = 0;
REP(i, N) {
mint x = lcm / A[i];
sum += x;
}
cout << sum.x << endl;
return 0;
}
| replace | 137 | 138 | 137 | 138 | 0 | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll spf[1000005], hell = pow(10, 9) + 7, res;
map<ll, ll> m;
ll exp(ll x, ll y) {
ll res = 1;
x %= hell;
while (y > 0) {
if (y & 1)
res = (res * x) % hell;
y >>= 1;
x = (x * x) % hell;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
spf[1] = 1;
for (ll i = 2; i * i <= 1000000; i++)
if (spf[i] == 0) {
spf[i] = i;
for (ll j = i * i; j <= 1000000; j += i)
if (spf[j] == 0)
spf[j] = i;
}
ll n;
cin >> n;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
res += exp(x, hell - 2);
res %= hell;
map<ll, ll> st;
while (x > 1) {
if (st.find(spf[x]) == st.end())
st.insert({spf[x], 0});
st[spf[x]]++;
x /= spf[x];
}
for (auto it = st.begin(); it != st.end(); it++)
if (m.find(it->first) == m.end())
m.insert({it->first, it->second});
else
m[it->first] = max(m[it->first], it->second);
}
for (auto it = m.begin(); it != m.end(); it++) {
res *= exp(it->first, it->second);
res %= hell;
}
cout << res;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
ll spf[1000005], hell = pow(10, 9) + 7, res;
map<ll, ll> m;
ll exp(ll x, ll y) {
ll res = 1;
x %= hell;
while (y > 0) {
if (y & 1)
res = (res * x) % hell;
y >>= 1;
x = (x * x) % hell;
}
return res;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
spf[1] = 1;
for (ll i = 2; i * i <= 1000000; i++)
if (spf[i] == 0) {
spf[i] = i;
for (ll j = i * i; j <= 1000000; j += i)
if (spf[j] == 0)
spf[j] = i;
}
for (ll i = 1; i <= 1000000; i++)
if (spf[i] == 0)
spf[i] = i;
ll n;
cin >> n;
for (ll i = 0; i < n; i++) {
ll x;
cin >> x;
res += exp(x, hell - 2);
res %= hell;
map<ll, ll> st;
while (x > 1) {
if (st.find(spf[x]) == st.end())
st.insert({spf[x], 0});
st[spf[x]]++;
x /= spf[x];
}
for (auto it = st.begin(); it != st.end(); it++)
if (m.find(it->first) == m.end())
m.insert({it->first, it->second});
else
m[it->first] = max(m[it->first], it->second);
}
for (auto it = m.begin(); it != m.end(); it++) {
res *= exp(it->first, it->second);
res %= hell;
}
cout << res;
}
| insert | 28 | 28 | 28 | 31 | 0 | |
p02793 | C++ | Time Limit Exceeded | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF (numeric_limits<int>::max() / 2 - 1)
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", \
dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T>>;
template <class T, class = typename T::iterator,
class = typename enable_if<!is_same<T, string>::value>::type>
ostream &operator<<(ostream &os, T const &v) {
bool f = true;
for (auto const &x : v)
os << (f ? "" : " ") << x, f = false;
return os;
}
template <class T, class = typename T::iterator,
class = typename enable_if<!is_same<T, string>::value>::type>
istream &operator>>(istream &is, T &v) {
for (auto &x : v)
is >> x;
return is;
}
template <class T, class S> istream &operator>>(istream &is, pair<T, S> &p) {
return is >> p.first >> p.second;
}
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} iosetup;
template <class F> struct FixPoint : private F {
constexpr FixPoint(F &&f) : F(forward<F>(f)) {}
template <class... T> constexpr auto operator()(T &&...x) const {
return F::operator()(*this, forward<T>(x)...);
}
};
struct MakeFixPoint {
template <class F> constexpr auto operator|(F &&f) const {
return FixPoint<F>(forward<F>(f));
}
};
#define MFP MakeFixPoint() |
#define def(name, ...) auto name = MFP[&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
using type = vector<typename vec_impl<T, d - 1>::type>;
template <class... U> static type make_v(size_t n, U &&...x) {
return type(n, vec_impl<T, d - 1>::make_v(forward<U>(x)...));
}
};
template <class T> struct vec_impl<T, 0> {
using type = T;
static type make_v(T const &x = {}) { return x; }
};
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args &&...args) {
return vec_impl<T, d>::make_v(forward<Args>(args)...);
}
template <class T> void quit(T const &x) {
cout << x << endl;
exit(0);
}
template <class T> constexpr bool chmin(T &x, T const &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> constexpr bool chmax(T &x, T const &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class It> constexpr auto sumof(It b, It e) {
return accumulate(b, e, typename iterator_traits<It>::value_type{});
}
template <class T> int sz(T const &x) { return x.size(); }
// <<<
// >>> modint
template <int32_t md> class modint {
static_assert(md > 0, "");
using M = modint;
using ll = int64_t;
int32_t x;
public:
static constexpr int32_t mod = md;
constexpr modint(ll x = 0) : x((x %= mod) < 0 ? x + mod : x) {}
constexpr ll val() const { return x; }
constexpr bool operator==(M const &r) const { return x == r.x; }
constexpr bool operator!=(M const &r) const { return x != r.x; }
constexpr M operator+() const { return *this; }
constexpr M operator-() const { return M() - *this; }
constexpr M &operator+=(M const &r) {
ll t = ll(x) + r.x;
if (t >= mod)
t -= mod;
x = t;
return *this;
}
constexpr M &operator-=(M const &r) {
ll t = ll(x) + mod - r.x;
if (t >= mod)
t -= mod;
x = t;
return *this;
}
constexpr M &operator*=(M const &r) { return *this = *this * r; }
constexpr M operator*(M const &r) const {
M t;
t.x = (ll(x) * r.x) % mod;
return t;
}
constexpr M &operator/=(M const &r) { return *this *= r.inv(); }
constexpr M operator+(M const &r) const { return M(*this) += r; }
constexpr M operator-(M const &r) const { return M(*this) -= r; }
constexpr M operator/(M const &r) const { return M(*this) /= r; }
friend constexpr M operator+(ll x, M const &y) { return M(x) + y; }
friend constexpr M operator-(ll x, M const &y) { return M(x) - y; }
friend constexpr M operator*(ll x, M const &y) { return M(x) * y; }
friend constexpr M operator/(ll x, M const &y) { return M(x) / y; }
constexpr M pow(ll n) const {
if (n < 0)
return inv().pow(-n);
M v = *this, r = 1;
for (; n > 0; n >>= 1, v *= v)
if (n & 1)
r *= v;
return r;
}
constexpr M inv() const {
assert(x > 0);
ll t = 1, v = x, q = 0, r = 0;
while (v != 1) {
q = mod / v;
r = mod % v;
if (r * 2 < v) {
t *= -q;
t %= mod;
v = r;
} else {
t *= q + 1;
t %= mod;
v -= r;
}
}
if (t < 0)
t += mod;
M y;
y.x = t;
return y;
}
};
#ifdef LOCAL
template <int32_t MOD> string to_s(modint<MOD> const &r) {
return to_s(r.val(), MOD);
}
#endif
template <int32_t MOD> ostream &operator<<(ostream &os, modint<MOD> const &r) {
return os << r.val();
}
template <int32_t MOD> istream &operator>>(istream &is, modint<MOD> &r) {
int64_t x;
is >> x;
r = x;
return is;
}
// <<<
// constexpr int64_t MOD = 998244353;
constexpr int64_t MOD = 1e9 + 7;
using mint = modint<(int32_t)MOD>;
map<int, int> prime_factor(int n) {
map<int, int> ret;
for (int i = 2; i * i <= n; i++) {
if (n % i != 0)
continue;
int c = 0;
while (n % i == 0)
c++, n /= i;
ret[i] = c;
}
if (n > 1)
ret[n] = 1;
return ret;
}
int32_t main() {
int n;
cin >> n;
vector<int> a(n);
cin >> a;
map<int, int> lcm;
vector<map<int, int>> res(n);
rep(i, n) res[i] = prime_factor(a[i]);
rep(i, n) for (auto p : res[i]) chmax(lcm[p.fst], p.snd);
dump(lcm);
mint ans = 0;
rep(i, n) {
mint tmp = 1;
for (auto p : lcm)
tmp *= mint(p.fst).pow(p.snd - res[i][p.fst]);
dump(i, a[i], tmp);
ans += tmp;
}
cout << ans << endl;
}
| // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF (numeric_limits<int>::max() / 2 - 1)
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", \
dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T>>;
template <class T, class = typename T::iterator,
class = typename enable_if<!is_same<T, string>::value>::type>
ostream &operator<<(ostream &os, T const &v) {
bool f = true;
for (auto const &x : v)
os << (f ? "" : " ") << x, f = false;
return os;
}
template <class T, class = typename T::iterator,
class = typename enable_if<!is_same<T, string>::value>::type>
istream &operator>>(istream &is, T &v) {
for (auto &x : v)
is >> x;
return is;
}
template <class T, class S> istream &operator>>(istream &is, pair<T, S> &p) {
return is >> p.first >> p.second;
}
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} iosetup;
template <class F> struct FixPoint : private F {
constexpr FixPoint(F &&f) : F(forward<F>(f)) {}
template <class... T> constexpr auto operator()(T &&...x) const {
return F::operator()(*this, forward<T>(x)...);
}
};
struct MakeFixPoint {
template <class F> constexpr auto operator|(F &&f) const {
return FixPoint<F>(forward<F>(f));
}
};
#define MFP MakeFixPoint() |
#define def(name, ...) auto name = MFP[&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
using type = vector<typename vec_impl<T, d - 1>::type>;
template <class... U> static type make_v(size_t n, U &&...x) {
return type(n, vec_impl<T, d - 1>::make_v(forward<U>(x)...));
}
};
template <class T> struct vec_impl<T, 0> {
using type = T;
static type make_v(T const &x = {}) { return x; }
};
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args &&...args) {
return vec_impl<T, d>::make_v(forward<Args>(args)...);
}
template <class T> void quit(T const &x) {
cout << x << endl;
exit(0);
}
template <class T> constexpr bool chmin(T &x, T const &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> constexpr bool chmax(T &x, T const &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class It> constexpr auto sumof(It b, It e) {
return accumulate(b, e, typename iterator_traits<It>::value_type{});
}
template <class T> int sz(T const &x) { return x.size(); }
// <<<
// >>> modint
template <int32_t md> class modint {
static_assert(md > 0, "");
using M = modint;
using ll = int64_t;
int32_t x;
public:
static constexpr int32_t mod = md;
constexpr modint(ll x = 0) : x((x %= mod) < 0 ? x + mod : x) {}
constexpr ll val() const { return x; }
constexpr bool operator==(M const &r) const { return x == r.x; }
constexpr bool operator!=(M const &r) const { return x != r.x; }
constexpr M operator+() const { return *this; }
constexpr M operator-() const { return M() - *this; }
constexpr M &operator+=(M const &r) {
ll t = ll(x) + r.x;
if (t >= mod)
t -= mod;
x = t;
return *this;
}
constexpr M &operator-=(M const &r) {
ll t = ll(x) + mod - r.x;
if (t >= mod)
t -= mod;
x = t;
return *this;
}
constexpr M &operator*=(M const &r) { return *this = *this * r; }
constexpr M operator*(M const &r) const {
M t;
t.x = (ll(x) * r.x) % mod;
return t;
}
constexpr M &operator/=(M const &r) { return *this *= r.inv(); }
constexpr M operator+(M const &r) const { return M(*this) += r; }
constexpr M operator-(M const &r) const { return M(*this) -= r; }
constexpr M operator/(M const &r) const { return M(*this) /= r; }
friend constexpr M operator+(ll x, M const &y) { return M(x) + y; }
friend constexpr M operator-(ll x, M const &y) { return M(x) - y; }
friend constexpr M operator*(ll x, M const &y) { return M(x) * y; }
friend constexpr M operator/(ll x, M const &y) { return M(x) / y; }
constexpr M pow(ll n) const {
if (n < 0)
return inv().pow(-n);
M v = *this, r = 1;
for (; n > 0; n >>= 1, v *= v)
if (n & 1)
r *= v;
return r;
}
constexpr M inv() const {
assert(x > 0);
ll t = 1, v = x, q = 0, r = 0;
while (v != 1) {
q = mod / v;
r = mod % v;
if (r * 2 < v) {
t *= -q;
t %= mod;
v = r;
} else {
t *= q + 1;
t %= mod;
v -= r;
}
}
if (t < 0)
t += mod;
M y;
y.x = t;
return y;
}
};
#ifdef LOCAL
template <int32_t MOD> string to_s(modint<MOD> const &r) {
return to_s(r.val(), MOD);
}
#endif
template <int32_t MOD> ostream &operator<<(ostream &os, modint<MOD> const &r) {
return os << r.val();
}
template <int32_t MOD> istream &operator>>(istream &is, modint<MOD> &r) {
int64_t x;
is >> x;
r = x;
return is;
}
// <<<
// constexpr int64_t MOD = 998244353;
constexpr int64_t MOD = 1e9 + 7;
using mint = modint<(int32_t)MOD>;
map<int, int> prime_factor(int n) {
map<int, int> ret;
for (int i = 2; i * i <= n; i++) {
if (n % i != 0)
continue;
int c = 0;
while (n % i == 0)
c++, n /= i;
ret[i] = c;
}
if (n > 1)
ret[n] = 1;
return ret;
}
int32_t main() {
int n;
cin >> n;
vector<int> a(n);
cin >> a;
map<int, int> lcm;
vector<map<int, int>> res(n);
rep(i, n) res[i] = prime_factor(a[i]);
rep(i, n) for (auto p : res[i]) chmax(lcm[p.fst], p.snd);
dump(lcm);
// mint ans = 0;
// rep (i,n) {
// mint tmp = 1;
// for (auto p : lcm) tmp *= mint(p.fst).pow(p.snd-res[i][p.fst]);
// dump(i,a[i],tmp);
// ans += tmp;
// }
// cout << ans << endl;
mint x = 1;
for (auto p : lcm)
x *= mint(p.fst).pow(p.snd);
mint y = 0;
rep(i, n) y += mint(a[i]).inv();
cout << x * y << endl;
}
| replace | 232 | 243 | 232 | 249 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
// const long long MOD = 998244353;
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b; // Be careful not to overflow
}
vector<int> pp;
void preparePrime(int maxp) {
int i;
vector<int> a(maxp + 1);
for (i = 2; i <= maxp; i++) {
int k = i + i;
while (k <= maxp) {
a[k] = 1;
k += i;
}
}
for (i = 2; i <= maxp; i++) {
if (a[i] == 0)
pp.push_back(i);
}
return;
}
void decompositPrime(ll a, vector<pair<ll, ll>> &vv) {
int i;
for (i = 0; i < (int)pp.size(); i++) {
int count = 0;
while (a % pp[i] == 0) {
a /= pp[i];
count++;
}
if (count > 0)
vv.push_back(make_pair(pp[i], count));
if (a == 1)
break;
}
if (a > 1) {
vv.push_back(make_pair(a, 1));
}
return;
}
ll mpow(ll x, ll n) { // x^n(mod M)
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
ll minv(ll x) { return mpow(x, MOD - 2); }
int main(int argc, char *argv[]) {
int n;
scanf("%d", &n);
vector<int> a(n);
preparePrime(1000000);
map<ll, ll> mp;
int i;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
vector<pair<ll, ll>> vv;
decompositPrime(a[i], vv);
int k;
for (k = 0; k < (int)vv.size(); k++) {
ll tmp = mp[vv[k].first];
mp[vv[k].first] = MAX(tmp, vv[k].second);
}
}
ll ans = 1;
auto it = mp.begin();
for (; it != mp.end(); ++it) {
ll curr = it->first;
ll num = it->second;
ans = ans * mpow(curr, num) % MOD;
}
ll ans1 = 0;
for (i = 0; i < n; i++) {
ans1 = (ans1 + minv(a[i])) % MOD;
}
ans = ans * ans1 % MOD;
printf("%lld\n", ans);
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
// const long long MOD = 998244353;
using namespace std;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
return a / g * b; // Be careful not to overflow
}
vector<int> pp;
void preparePrime(int maxp) {
int i;
vector<int> a(maxp + 1);
for (i = 2; i <= maxp; i++) {
int k = i + i;
while (k <= maxp) {
a[k] = 1;
k += i;
}
}
for (i = 2; i <= maxp; i++) {
if (a[i] == 0)
pp.push_back(i);
}
return;
}
void decompositPrime(ll a, vector<pair<ll, ll>> &vv) {
int i;
for (i = 0; i < (int)pp.size(); i++) {
int count = 0;
while (a % pp[i] == 0) {
a /= pp[i];
count++;
}
if (count > 0)
vv.push_back(make_pair(pp[i], count));
if (a == 1)
break;
}
if (a > 1) {
vv.push_back(make_pair(a, 1));
}
return;
}
ll mpow(ll x, ll n) { // x^n(mod M)
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
ll minv(ll x) { return mpow(x, MOD - 2); }
int main(int argc, char *argv[]) {
int n;
scanf("%d", &n);
vector<int> a(n);
preparePrime(2000);
map<ll, ll> mp;
int i;
for (i = 0; i < n; i++) {
scanf("%d", &a[i]);
vector<pair<ll, ll>> vv;
decompositPrime(a[i], vv);
int k;
for (k = 0; k < (int)vv.size(); k++) {
ll tmp = mp[vv[k].first];
mp[vv[k].first] = MAX(tmp, vv[k].second);
}
}
ll ans = 1;
auto it = mp.begin();
for (; it != mp.end(); ++it) {
ll curr = it->first;
ll num = it->second;
ans = ans * mpow(curr, num) % MOD;
}
ll ans1 = 0;
for (i = 0; i < n; i++) {
ans1 = (ans1 + minv(a[i])) % MOD;
}
ans = ans * ans1 % MOD;
printf("%lld\n", ans);
return 0;
}
| replace | 93 | 94 | 93 | 94 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
const int MAX_N = 2000005;
const long long MOD = 1000000007;
int n;
long long ans;
int arr[MAX_N];
std::map<int, int> mp;
void update(int val) {
int d, exp;
d = 2;
while (d * d <= val) {
exp = 0;
while (val % d == 0) {
++exp;
val /= d;
}
if (exp > 0) {
mp[d] = std::max(mp[d], exp);
}
d += 2 - (d == 2);
}
if (val > 1) {
mp[val] = std::max(mp[val], 1);
}
}
int get_times(int n, int d) {
int cnt;
cnt = 0;
while (n % d == 0) {
++cnt;
n /= d;
}
return cnt;
}
long long lgpow(long long base, long long exp) {
long long ret;
ret = 1;
while (exp > 0) {
if ((exp & 1) > 0) {
ret = (ret * base) % MOD;
}
base = (base * base) % MOD;
exp >>= 1;
}
return ret;
}
void query(int val) {
long long sum, pow;
int e;
sum = pow = 1;
for (auto div : mp) {
e = get_times(val, div.first);
if (e < div.second) {
pow = lgpow(div.first, div.second - e);
sum = (sum * pow) % MOD;
}
}
ans = (ans + sum) % MOD;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
std::cout.tie(0);
std::cin >> n;
for (int i = 1; i <= n; ++i) {
std::cin >> arr[i];
update(arr[i]);
}
for (int i = 1; i <= n; ++i) {
query(arr[i]);
}
std::cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
const int MAX_N = 2000005;
const long long MOD = 1000000007;
int n;
long long ans;
int arr[MAX_N];
std::unordered_map<int, int> mp;
void update(int val) {
int d, exp;
d = 2;
while (d * d <= val) {
exp = 0;
while (val % d == 0) {
++exp;
val /= d;
}
if (exp > 0) {
mp[d] = std::max(mp[d], exp);
}
d += 2 - (d == 2);
}
if (val > 1) {
mp[val] = std::max(mp[val], 1);
}
}
int get_times(int n, int d) {
int cnt;
cnt = 0;
while (n % d == 0) {
++cnt;
n /= d;
}
return cnt;
}
long long lgpow(long long base, long long exp) {
long long ret;
ret = 1;
while (exp > 0) {
if ((exp & 1) > 0) {
ret = (ret * base) % MOD;
}
base = (base * base) % MOD;
exp >>= 1;
}
return ret;
}
void query(int val) {
long long sum, pow;
int e;
sum = pow = 1;
for (auto div : mp) {
e = get_times(val, div.first);
if (e < div.second) {
pow = lgpow(div.first, div.second - e);
sum = (sum * pow) % MOD;
}
}
ans = (ans + sum) % MOD;
}
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(0);
std::cout.tie(0);
std::cin >> n;
for (int i = 1; i <= n; ++i) {
std::cin >> arr[i];
update(arr[i]);
}
for (int i = 1; i <= n; ++i) {
query(arr[i]);
}
std::cout << ans << "\n";
return 0;
}
| replace | 11 | 12 | 11 | 12 | TLE | |
p02793 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using pll = pair<ll, ll>;
using vvii = vector<vector<int>>;
using vvll = vector<vector<ll>>;
const ll mod = 1e9 + 7;
const int maxa = 1e6;
const ll inf = 1LL << 60;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { // クラスのメンバを変更しない
mint res(*this);
return res += a;
}
mint operator-(const mint a) const { // クラスのメンバを変更しない
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const { // クラスのメンバを変更しない
mint res(*this);
return res *= a;
}
mint pow(ll n) const {
if (n == 0)
return 1;
mint a = pow(n >> 1);
a *= a;
if (n & 1)
a *= (*this);
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
struct Combination {
vector<mint> fact, ifact;
Combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; i--) {
ifact[i - 1] = ifact[i] * i;
}
}
mint comb(int n, int k) {
if (k < 0 || n < k)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
ll gcd(ll a, ll b) {
if (a == 0 && b == 0)
return 0;
else if (a == 0 || b == 0)
return 1;
else {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
if (a < b)
swap(a, b);
while (true) {
ll p = a % b;
a = b;
b = p;
if (p == 0)
break;
}
return a;
}
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
ll ans = a / g * b;
ll shou = ans / mod;
ll amari = ans % mod;
return shou + amari;
}
struct Sieve {
// int N;
// vector<bool> is_prime;
vector<int> minprime;
// vector<map<int,int> > reserve;
vector<int> primes;
Sieve(int N) {
minprime.resize(N + 1, 0);
minprime[0] = minprime[1] = -1;
for (ll i = 2; i <= N; i++) {
if (minprime[i])
continue;
primes.push_back(i);
minprime[i] = i;
for (int k = 2 * i; k <= N; k += i) {
// is_prime[k] = false;
if (minprime[k] == 0)
minprime[k] = i;
}
}
}
/*void furui(int N){
for(int i = 2; i <= N; i++){
if(minprime[i])continue;
primes.push_back(i);
minprime[i] = i;
for(int k = 2*i; k<= N; k+=i){
//is_prime[k] = false;
if(minprime[k] == 0)minprime[k] = i;
}
}*/
vector<int> factorlist(int x) {
vector<int> res;
while (x != 1) {
res.push_back(minprime[x]);
x /= minprime[x];
}
return res;
}
vector<P> rekkyo(int x) {
/*while(minprime[x] != 1){
x /= minprime[x];
reserve[x][minprime[x]]++;
}*/
vector<int> list = factorlist(x);
if (list.size() == 0) {
};
vector<P> res(1, P(list[0], 0));
for (int p : list) {
if (res.back().first == p) {
res.back().second++;
} else {
res.push_back(P(p, 1));
}
}
return res;
}
};
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
// cout << fixed << setprecision(15);
int N;
cin >> N;
vector<ll> A(N);
REP(i, N) {
ll a;
cin >> a;
A[i] = a;
}
Sieve sieve(maxa);
// sieve.furui(maxa);
// cout << sieve.rekkyo(8)[0].second<<endl;
map<int, int> maxi;
REP(i, N) {
vector<P> p = sieve.rekkyo(A[i]);
/*REP(k,p.size()){
cout<<p[k].first<<" "<<p[k].second<<endl;
}*/
for (auto k : p) {
maxi[k.first] = max(maxi[k.first], k.second);
}
}
mint lcmm = 1;
for (auto i : maxi) {
/*mint now = i.first;
lcmm *= now.pow(i.second);*/
REP(k, i.second) { lcmm *= i.first; }
}
// cout << lcmm <<endl;
mint ans = 0;
REP(i, N) {
mint b = lcmm / A[i];
ans += b;
}
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <string>
#include <vector>
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define INF 2e9
#define ALL(v) v.begin(), v.end()
using namespace std;
using ll = long long;
using P = pair<int, int>;
using pll = pair<ll, ll>;
using vvii = vector<vector<int>>;
using vvll = vector<vector<ll>>;
const ll mod = 1e9 + 7;
const int maxa = 1e6;
const ll inf = 1LL << 60;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { // クラスのメンバを変更しない
mint res(*this);
return res += a;
}
mint operator-(const mint a) const { // クラスのメンバを変更しない
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const { // クラスのメンバを変更しない
mint res(*this);
return res *= a;
}
mint pow(ll n) const {
if (n == 0)
return 1;
mint a = pow(n >> 1);
a *= a;
if (n & 1)
a *= (*this);
return a;
}
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
struct Combination {
vector<mint> fact, ifact;
Combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; i++)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; i--) {
ifact[i - 1] = ifact[i] * i;
}
}
mint comb(int n, int k) {
if (k < 0 || n < k)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
ll gcd(ll a, ll b) {
if (a == 0 && b == 0)
return 0;
else if (a == 0 || b == 0)
return 1;
else {
if (a < 0)
a = -a;
if (b < 0)
b = -b;
if (a < b)
swap(a, b);
while (true) {
ll p = a % b;
a = b;
b = p;
if (p == 0)
break;
}
return a;
}
}
ll lcm(ll a, ll b) {
ll g = gcd(a, b);
ll ans = a / g * b;
ll shou = ans / mod;
ll amari = ans % mod;
return shou + amari;
}
struct Sieve {
// int N;
// vector<bool> is_prime;
vector<int> minprime;
// vector<map<int,int> > reserve;
vector<int> primes;
Sieve(int N) {
minprime.resize(N + 1, 0);
minprime[0] = minprime[1] = -1;
for (ll i = 2; i <= N; i++) {
if (minprime[i])
continue;
primes.push_back(i);
minprime[i] = i;
for (int k = 2 * i; k <= N; k += i) {
// is_prime[k] = false;
if (minprime[k] == 0)
minprime[k] = i;
}
}
}
/*void furui(int N){
for(int i = 2; i <= N; i++){
if(minprime[i])continue;
primes.push_back(i);
minprime[i] = i;
for(int k = 2*i; k<= N; k+=i){
//is_prime[k] = false;
if(minprime[k] == 0)minprime[k] = i;
}
}*/
vector<int> factorlist(int x) {
vector<int> res;
while (x != 1) {
res.push_back(minprime[x]);
x /= minprime[x];
}
return res;
}
vector<P> rekkyo(int x) {
/*while(minprime[x] != 1){
x /= minprime[x];
reserve[x][minprime[x]]++;
}*/
vector<int> list = factorlist(x);
if (list.size() == 0)
return {};
vector<P> res(1, P(list[0], 0));
for (int p : list) {
if (res.back().first == p) {
res.back().second++;
} else {
res.push_back(P(p, 1));
}
}
return res;
}
};
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
// cout << fixed << setprecision(15);
int N;
cin >> N;
vector<ll> A(N);
REP(i, N) {
ll a;
cin >> a;
A[i] = a;
}
Sieve sieve(maxa);
// sieve.furui(maxa);
// cout << sieve.rekkyo(8)[0].second<<endl;
map<int, int> maxi;
REP(i, N) {
vector<P> p = sieve.rekkyo(A[i]);
/*REP(k,p.size()){
cout<<p[k].first<<" "<<p[k].second<<endl;
}*/
for (auto k : p) {
maxi[k.first] = max(maxi[k.first], k.second);
}
}
mint lcmm = 1;
for (auto i : maxi) {
/*mint now = i.first;
lcmm *= now.pow(i.second);*/
REP(k, i.second) { lcmm *= i.first; }
}
// cout << lcmm <<endl;
mint ans = 0;
REP(i, N) {
mint b = lcmm / A[i];
ans += b;
}
cout << ans << endl;
} | replace | 182 | 184 | 182 | 184 | 0 | |
p02793 | C++ | Time Limit Exceeded |
#include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n, 0)
#define all(a) a.begin(), a.end()
const int vx[4] = {0, 1, 0, -1};
const int vy[4] = {1, 0, -1, 0};
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define int ll
#define vi vector<int>
#define IP pair<int, P>
#define PI pair<P, int>
#define PP pair<P, P>
#define Yes(f) \
{ cout << (f ? "Yes" : "No") << endl; }
#define YES(f) \
{ cout << (f ? "YES" : "NO") << endl; }
struct Mint {
int x;
Mint() : x(0) {}
Mint(int y) : x(y >= 0 ? y % M : (M - (-y) % M) % M) {}
Mint &operator+=(const Mint &p) {
if ((x += p.x) >= M)
x -= M;
return *this;
}
Mint &operator-=(const Mint &p) {
if ((x += M - p.x) >= M)
x -= M;
return *this;
}
Mint &operator*=(const Mint &p) {
x = (int)(1LL * x * p.x % M);
return *this;
}
Mint &operator/=(const Mint &p) {
*this *= p.inverse();
return *this;
}
Mint operator-() const { return Mint(-x); }
Mint operator+(const Mint &p) const { return Mint(*this) += p; }
Mint operator-(const Mint &p) const { return Mint(*this) -= p; }
Mint operator*(const Mint &p) const { return Mint(*this) *= p; }
Mint operator/(const Mint &p) const { return Mint(*this) /= p; }
bool operator==(const Mint &p) const { return x == p.x; }
bool operator!=(const Mint &p) const { return x != p.x; }
Mint inverse() const {
int a = x, b = M, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return Mint(u);
}
Mint power(int n) const {
Mint ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const Mint &p) { return os << p.x; }
friend istream &operator>>(istream &is, Mint &a) {
int t;
is >> t;
a = Mint(t);
return (is);
}
};
using mint = Mint;
template <typename T> T power(T x, int k) {
T ret = 1;
while (k > 0) {
if (k & 1)
(ret *= x);
(x *= x);
k >>= 1;
}
return ret;
}
vector<bool> prime_table(int n) {
vector<bool> prime(n + 1, true);
if (n >= 0)
prime[0] = false;
if (n >= 1)
prime[1] = false;
for (int i = 2; i * i <= n; i++) {
if (!prime[i])
continue;
for (int j = i + i; j <= n; j += i) {
prime[j] = false;
}
}
return prime;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n;
cin >> n;
vi a(n);
rep(i, n) { cin >> a[i]; }
vector<bool> prime = prime_table(1000000);
vector<Mint> m(n, 1);
for (int k = 2; k < 10000; k++) {
if (!prime[k])
continue;
vi s(n, 0);
int sc = 0;
rep(i, n) {
while (a[i] % k == 0) {
s[i]++;
a[i] /= k;
sc = max(sc, s[i]);
}
}
rep(i, n) { m[i] *= power<Mint>(k, sc - s[i]); }
}
Mint ans = 0;
set<int> st;
rep(i, n) { st.insert(a[i]); }
rep(i, n) {
for (int s : st) {
if (a[i] % s)
m[i] *= s;
}
}
rep(i, n) { ans += m[i]; }
cout << ans << endl;
} |
#include <bits/stdc++.h>
using namespace std;
#define inf INT_MAX
#define INF LLONG_MAX
#define ll long long
#define ull unsigned long long
#define M (int)(1e9 + 7)
#define P pair<int, int>
#define FOR(i, m, n) for (int i = (int)m; i < (int)n; i++)
#define RFOR(i, m, n) for (int i = (int)m; i >= (int)n; i--)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) RFOR(i, n, 0)
#define all(a) a.begin(), a.end()
const int vx[4] = {0, 1, 0, -1};
const int vy[4] = {1, 0, -1, 0};
#define F first
#define S second
#define PB push_back
#define EB emplace_back
#define int ll
#define vi vector<int>
#define IP pair<int, P>
#define PI pair<P, int>
#define PP pair<P, P>
#define Yes(f) \
{ cout << (f ? "Yes" : "No") << endl; }
#define YES(f) \
{ cout << (f ? "YES" : "NO") << endl; }
struct Mint {
int x;
Mint() : x(0) {}
Mint(int y) : x(y >= 0 ? y % M : (M - (-y) % M) % M) {}
Mint &operator+=(const Mint &p) {
if ((x += p.x) >= M)
x -= M;
return *this;
}
Mint &operator-=(const Mint &p) {
if ((x += M - p.x) >= M)
x -= M;
return *this;
}
Mint &operator*=(const Mint &p) {
x = (int)(1LL * x * p.x % M);
return *this;
}
Mint &operator/=(const Mint &p) {
*this *= p.inverse();
return *this;
}
Mint operator-() const { return Mint(-x); }
Mint operator+(const Mint &p) const { return Mint(*this) += p; }
Mint operator-(const Mint &p) const { return Mint(*this) -= p; }
Mint operator*(const Mint &p) const { return Mint(*this) *= p; }
Mint operator/(const Mint &p) const { return Mint(*this) /= p; }
bool operator==(const Mint &p) const { return x == p.x; }
bool operator!=(const Mint &p) const { return x != p.x; }
Mint inverse() const {
int a = x, b = M, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return Mint(u);
}
Mint power(int n) const {
Mint ret(1), mul(x);
while (n > 0) {
if (n & 1)
ret *= mul;
mul *= mul;
n >>= 1;
}
return ret;
}
friend ostream &operator<<(ostream &os, const Mint &p) { return os << p.x; }
friend istream &operator>>(istream &is, Mint &a) {
int t;
is >> t;
a = Mint(t);
return (is);
}
};
using mint = Mint;
template <typename T> T power(T x, int k) {
T ret = 1;
while (k > 0) {
if (k & 1)
(ret *= x);
(x *= x);
k >>= 1;
}
return ret;
}
vector<bool> prime_table(int n) {
vector<bool> prime(n + 1, true);
if (n >= 0)
prime[0] = false;
if (n >= 1)
prime[1] = false;
for (int i = 2; i * i <= n; i++) {
if (!prime[i])
continue;
for (int j = i + i; j <= n; j += i) {
prime[j] = false;
}
}
return prime;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int n;
cin >> n;
vi a(n);
rep(i, n) { cin >> a[i]; }
vector<bool> prime = prime_table(1000000);
vector<Mint> m(n, 1);
for (int k = 2; k < 10000; k++) {
if (!prime[k])
continue;
vi s(n, 0);
int sc = 0;
rep(i, n) {
while (a[i] % k == 0) {
s[i]++;
a[i] /= k;
sc = max(sc, s[i]);
}
}
rep(i, n) { m[i] *= power<Mint>(k, sc - s[i]); }
}
Mint ans = 0;
set<int> st;
rep(i, n) { st.insert(a[i]); }
for (int s : st) {
rep(i, n) {
if (a[i] % s)
m[i] *= s;
}
}
rep(i, n) { ans += m[i]; }
cout << ans << endl;
} | replace | 166 | 168 | 166 | 168 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
vector<ll> calc_primes(ll n) {
vector<ll> primes;
vector<bool> filtered(n + 1);
for (ll i = 2; i <= n; i++) {
filtered[i] = false;
}
for (ll i = 2; i <= n; i++) {
if (!filtered[i]) {
primes.push_back(i);
for (ll j = i; j <= n; j += i) {
filtered[j] = true;
}
}
}
return primes;
}
ll pow_mod(ll n, ll m, ll mod) {
if (m == 0)
return 1;
if (m % 2 == 0) {
ll tmp = pow_mod(n, m / 2, mod);
return (tmp * tmp) % mod;
} else {
return (n * pow_mod(n, m - 1, mod)) % mod;
}
}
unordered_map<ll, ll> prime_factors(ll n, vector<ll> &primes) {
unordered_map<ll, ll> ans;
for (ll p : primes) {
while (n % p == 0) {
if (ans.count(p) == 0) {
ans[p] = 0;
}
ans[p]++;
n /= p;
}
}
if (n > 1) {
if (ans.count(n) == 0) {
ans[n] = 0;
}
ans[n]++;
}
return ans;
}
int main() {
const ll mod = 1000000007;
vector<ll> primes = calc_primes(1000000);
ll n;
cin >> n;
vector<ll> a(n);
vector<unordered_map<ll, ll>> f(n);
unordered_map<ll, ll> lcm;
for (ll i = 0; i < n; i++) {
cin >> a[i];
f[i] = prime_factors(a[i], primes);
for (auto factor : f[i]) {
lcm[factor.first] = max(factor.second, lcm[factor.first]);
}
}
// for (auto factor : lcm) {
// cout << factor.first << " " << factor.second << endl;
// }
ll lcm_all = 1;
for (auto factor : lcm) {
lcm_all *= pow_mod(factor.first, factor.second, mod);
lcm_all %= mod;
}
ll ans = 0;
for (ll i = 0; i < n; i++) {
ans += (lcm_all * pow_mod(a[i], mod - 2, mod)) % mod;
ans %= mod;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = unsigned long long;
vector<ll> calc_primes(ll n) {
vector<ll> primes;
vector<bool> filtered(n + 1);
for (ll i = 2; i <= n; i++) {
filtered[i] = false;
}
for (ll i = 2; i <= n; i++) {
if (!filtered[i]) {
primes.push_back(i);
for (ll j = i; j <= n; j += i) {
filtered[j] = true;
}
}
}
return primes;
}
ll pow_mod(ll n, ll m, ll mod) {
if (m == 0)
return 1;
if (m % 2 == 0) {
ll tmp = pow_mod(n, m / 2, mod);
return (tmp * tmp) % mod;
} else {
return (n * pow_mod(n, m - 1, mod)) % mod;
}
}
unordered_map<ll, ll> prime_factors(ll n, vector<ll> &primes) {
unordered_map<ll, ll> ans;
for (ll p : primes) {
while (n % p == 0) {
if (ans.count(p) == 0) {
ans[p] = 0;
}
ans[p]++;
n /= p;
}
}
if (n > 1) {
if (ans.count(n) == 0) {
ans[n] = 0;
}
ans[n]++;
}
return ans;
}
int main() {
const ll mod = 1000000007;
vector<ll> primes = calc_primes(1000);
ll n;
cin >> n;
vector<ll> a(n);
vector<unordered_map<ll, ll>> f(n);
unordered_map<ll, ll> lcm;
for (ll i = 0; i < n; i++) {
cin >> a[i];
f[i] = prime_factors(a[i], primes);
for (auto factor : f[i]) {
lcm[factor.first] = max(factor.second, lcm[factor.first]);
}
}
// for (auto factor : lcm) {
// cout << factor.first << " " << factor.second << endl;
// }
ll lcm_all = 1;
for (auto factor : lcm) {
lcm_all *= pow_mod(factor.first, factor.second, mod);
lcm_all %= mod;
}
ll ans = 0;
for (ll i = 0; i < n; i++) {
ans += (lcm_all * pow_mod(a[i], mod - 2, mod)) % mod;
ans %= mod;
}
cout << ans << endl;
}
| replace | 56 | 57 | 56 | 57 | TLE | |
p02793 | C++ | Time Limit Exceeded | // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ███████████
// ██╬╬╬╬╬████╬╬████╬╬╬╬╬██
// █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██
// ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██
// ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██
// ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████
// █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██
// ██████████████
// ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████
// ███████ █████
// ███████████████████
//
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF (1LL << 60)
#define fs first
#define sc second
// #define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl
#define SP << " " <<
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;
}
#define MSB(x) (63 - __builtin_clzll(x))
#define pcnt(x) (__builtin_popcountll(x))
#define parity(i, j) (i & (1LL << j))
typedef pair<int, int> P;
#include <cstdint>
template <long long Modulus> class modint {
long long a;
public:
constexpr modint(const long long x = 0) noexcept
: a((x % Modulus + Modulus) % Modulus) {}
constexpr long long val() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr bool operator==(const modint rhs) const noexcept {
return modint(*this).val() == rhs.val();
}
modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
modint &operator/=(modint rhs) noexcept {
long long exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
using mint = modint<MOD>;
typedef vector<mint> vec;
typedef vector<vector<mint>> mat;
vector<int> pri;
void init(int x) {
vector<bool> flag(x + 1, false);
for (int i = 2; i <= x; i++) {
if (flag[i])
continue;
pri.emplace_back(i);
for (int j = i; j <= x; j += i)
flag[j] = true;
}
}
map<int, int> Primefactorization(int x) {
map<int, int> mp;
for (int p : pri) {
int cnt = 0;
if (p > x)
break;
while (x % p == 0)
x /= p, cnt++;
if (cnt)
mp[p] = cnt;
}
if (x != 1)
mp[x] = 1;
return mp;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
map<int, int> mp;
init(1e6 + 10);
REP(i, n) {
map<int, int> cur = Primefactorization(a[i]);
ITR(itr, cur) chmax(mp[itr->fs], itr->sc);
}
mint x = 1;
ITR(itr, mp) REP(_, itr->sc) x *= itr->fs;
// debug(x.val());
mint ans = 0;
REP(i, n) ans += x / a[i];
cout << ans.val() << endl;
return 0;
}
| // warm heart, wagging tail,and a smile just for you!
// ███████████
// ███╬╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬████╬╬╬╬╬╬███
// ███████████
// ██╬╬╬╬╬████╬╬████╬╬╬╬╬██
// █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██
// ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██
// ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██
// ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████
// █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████
// ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███
// ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████
// ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██
// ██████████████
// ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████
// ███████ █████
// ███████████████████
//
#include "bits/stdc++.h"
using namespace std;
#define MOD 1000000007
// #define MOD 998244353
#define INF (1LL << 60)
#define fs first
#define sc second
// #define int long long
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define RFOR(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, (n))
#define RREP(i, n) RFOR(i, 0, (n))
#define ITR(itr, mp) for (auto itr = (mp).begin(); itr != (mp).end(); ++itr)
#define RITR(itr, mp) for (auto itr = (mp).rbegin(); itr != (mp).rend(); ++itr)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << " = " << (x) << endl
#define SP << " " <<
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;
}
#define MSB(x) (63 - __builtin_clzll(x))
#define pcnt(x) (__builtin_popcountll(x))
#define parity(i, j) (i & (1LL << j))
typedef pair<int, int> P;
#include <cstdint>
template <long long Modulus> class modint {
long long a;
public:
constexpr modint(const long long x = 0) noexcept
: a((x % Modulus + Modulus) % Modulus) {}
constexpr long long val() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr bool operator==(const modint rhs) const noexcept {
return modint(*this).val() == rhs.val();
}
modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
modint &operator/=(modint rhs) noexcept {
long long exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
using mint = modint<MOD>;
typedef vector<mint> vec;
typedef vector<vector<mint>> mat;
vector<int> pri;
void init(int x) {
vector<bool> flag(x + 1, false);
for (int i = 2; i <= x; i++) {
if (flag[i])
continue;
pri.emplace_back(i);
for (int j = i; j <= x; j += i)
flag[j] = true;
}
}
map<int, int> Primefactorization(int x) {
map<int, int> mp;
for (int p : pri) {
int cnt = 0;
if (p * p > x)
break;
while (x % p == 0)
x /= p, cnt++;
if (cnt)
mp[p] = cnt;
}
if (x != 1)
mp[x] = 1;
return mp;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<int> a(n);
REP(i, n) cin >> a[i];
map<int, int> mp;
init(1e6 + 10);
REP(i, n) {
map<int, int> cur = Primefactorization(a[i]);
ITR(itr, cur) chmax(mp[itr->fs], itr->sc);
}
mint x = 1;
ITR(itr, mp) REP(_, itr->sc) x *= itr->fs;
// debug(x.val());
mint ans = 0;
REP(i, n) ans += x / a[i];
cout << ans.val() << endl;
return 0;
}
| replace | 130 | 131 | 130 | 131 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define F(i, a, b) for (int i = a; i <= (b); ++i)
#define dF(i, a, b) for (int i = a; i >= (b); --i)
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define maxnkp make_pair
#define fi first
#define se second
#define eps 1e-6
using namespace std;
typedef long long ll;
const int mods = 1e9 + 7;
const int maxn = 1e4 + 10;
const int N = 1e6 + 10;
int n;
int a[maxn];
int num[N];
int prime[N]; // 下标从1开始
bool not_prime[N];
int sieve(int n) { // 把2到n内所有素数筛选出来
int p = 0;
for (int i = 2; i <= n; ++i) {
if (!not_prime[i])
prime[++p] = i;
for (int j = 1; j <= p && i * prime[j] <= n; j++) {
not_prime[i * prime[j]] = true; // 把比最小素因子的素数的倍数筛除
if (i % prime[j] == 0)
break; // 已找到最小素因子
}
}
return p; // 返回素数个数
}
void pri_fac(ll x) {
for (int i = 1; prime[i] <= x; i++) {
int y = prime[i];
if (x % y == 0) {
int p = 0;
while (x % y == 0) {
x /= y;
p++;
}
num[y] = max(p, num[y]);
}
}
if (x > 1)
num[x] = max(1, num[x]);
}
ll qpow(ll n, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = res * n % mods;
n = n * n % mods;
b >>= 1;
}
return res;
}
int main() {
scanf("%d", &n);
int maa = 0;
sieve(N);
F(i, 1, n) {
scanf("%d", &a[i]);
// a[i] = rand()%1000000+1;
maa = max(a[i], maa);
pri_fac(a[i]);
}
ll sum = 1;
F(i, 1, maa) { sum = sum * qpow(i, num[i]) % mods; }
int ans = 0;
F(i, 1, n) { ans = (ans + qpow(a[i], mods - 2)) % mods; }
ans = ans * sum % mods;
printf("%d\n", ans);
} | #include <bits/stdc++.h>
#define F(i, a, b) for (int i = a; i <= (b); ++i)
#define dF(i, a, b) for (int i = a; i >= (b); --i)
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define pb push_back
#define maxnkp make_pair
#define fi first
#define se second
#define eps 1e-6
using namespace std;
typedef long long ll;
const int mods = 1e9 + 7;
const int maxn = 1e4 + 10;
const int N = 1e6 + 10;
int n;
int a[maxn];
int num[N];
int prime[N]; // 下标从1开始
bool not_prime[N];
int sieve(int n) { // 把2到n内所有素数筛选出来
int p = 0;
for (int i = 2; i <= n; ++i) {
if (!not_prime[i])
prime[++p] = i;
for (int j = 1; j <= p && i * prime[j] <= n; j++) {
not_prime[i * prime[j]] = true; // 把比最小素因子的素数的倍数筛除
if (i % prime[j] == 0)
break; // 已找到最小素因子
}
}
return p; // 返回素数个数
}
void pri_fac(ll x) {
for (int i = 1; prime[i] * prime[i] <= x; i++) {
int y = prime[i];
if (x % y == 0) {
int p = 0;
while (x % y == 0) {
x /= y;
p++;
}
num[y] = max(p, num[y]);
}
}
if (x > 1)
num[x] = max(1, num[x]);
}
ll qpow(ll n, ll b) {
ll res = 1;
while (b) {
if (b & 1)
res = res * n % mods;
n = n * n % mods;
b >>= 1;
}
return res;
}
int main() {
scanf("%d", &n);
int maa = 0;
sieve(N);
F(i, 1, n) {
scanf("%d", &a[i]);
// a[i] = rand()%1000000+1;
maa = max(a[i], maa);
pri_fac(a[i]);
}
ll sum = 1;
F(i, 1, maa) { sum = sum * qpow(i, num[i]) % mods; }
int ans = 0;
F(i, 1, n) { ans = (ans + qpow(a[i], mods - 2)) % mods; }
ans = ans * sum % mods;
printf("%d\n", ans);
} | replace | 37 | 38 | 37 | 38 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> so(1e6 + 1, 0);
for (ll i = 0; i < n; i++) {
map<ll, ll> tso;
ll temp = a[i];
while (temp > 1) {
for (ll i = 1; i < sqrt(temp) + 1; i++) {
if (temp % i == 0) {
temp /= i;
tso[i]++;
break;
} else if (i >= sqrt(temp)) {
tso[temp]++;
temp = 1;
}
}
}
for (auto p : tso) {
so[p.first] = max(so[p.first], p.second);
}
}
ll bai = 1;
for (ll i = 1; i <= 1e6; i++) {
if (so[i] > 0) {
bai = bai * mpow(i, so[i]) % mod;
}
}
ll ans = 0;
for (ll i = 0; i < n; i++) {
ans += bai * mpow(a[i], mod - 2) % mod;
ans %= mod;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll mpow(ll x,
ll n) { // x^n(mod M) ←普通にpow(x,n)では溢れてしまうため，随時mod計算
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % mod;
x = x * x % mod;
n = n >> 1;
}
return ans;
}
int main() {
ll n;
cin >> n;
vector<ll> a(n);
for (ll i = 0; i < n; i++) {
cin >> a[i];
}
vector<ll> so(1e6 + 1, 0);
for (ll i = 0; i < n; i++) {
map<ll, ll> tso;
ll temp = a[i];
while (temp > 1) {
for (ll i = 2; i < sqrt(temp) + 1; i++) {
if (temp % i == 0) {
temp /= i;
tso[i]++;
break;
} else if (i >= sqrt(temp)) {
tso[temp]++;
temp = 1;
}
}
}
for (auto p : tso) {
so[p.first] = max(so[p.first], p.second);
}
}
ll bai = 1;
for (ll i = 1; i <= 1e6; i++) {
if (so[i] > 0) {
bai = bai * mpow(i, so[i]) % mod;
}
}
ll ans = 0;
for (ll i = 0; i < n; i++) {
ans += bai * mpow(a[i], mod - 2) % mod;
ans %= mod;
}
cout << ans << endl;
}
| replace | 30 | 31 | 30 | 31 | TLE | |
p02793 | Python | Runtime Error | def lcm(a, b):
from math import gcd
return a // gcd(a, b) * b
def main():
_ = int(input())
a = list(map(int, input().split()))
x = 1
for e in a:
x = lcm(x, e)
ans = 0
for e in a:
ans += x // e
print(ans % int(1e9 + 7))
main()
| def lcm(a, b):
from fractions import gcd
return a // gcd(a, b) * b
def main():
_ = int(input())
a = list(map(int, input().split()))
x = 1
for e in a:
x = lcm(x, e)
ans = 0
for e in a:
ans += x // e
print(ans % int(1e9 + 7))
main()
| replace | 1 | 2 | 1 | 2 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
// 変数ダンプ先。coutかcerr
#define DUMPOUT cerr
// 提出時はコメントアウト
#define DEBUG_
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* cpp template {{{ */
/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()
/* REPmacro */
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
#define EACH(i, n) for (auto &&i : n)
/* debug */
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n';
/* alias */
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using D = double;
using P = complex<D>;
using vs = vector<string>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
/* func */
inline bool inside(int y, int x, int H, int W) {
return y >= 0 && x >= 0 && y < H && x < W;
}
inline int in() {
int x;
cin >> x;
return x;
}
inline ll IN() {
ll x;
cin >> x;
return x;
}
inline vs split(const string &t, char c) {
vs v;
stringstream s(t);
string b;
while (getline(s, b, c))
v.eb(b);
return v;
}
template <typename T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
template <typename T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
template <typename T, typename S> inline void print(const pair<T, S> &p) {
cout << p.first << " " << p.second << endl;
}
template <typename T> inline void print(const T &x) { cout << x << '\n'; }
template <typename T, typename S>
inline void print(const vector<pair<T, S>> &v) {
for (auto &&p : v)
print(p);
}
template <typename T> inline void print(const vector<T> &v, string s = " ") {
REP(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");
}
// clang-format on
/* }}} */
#ifdef DEBUG_
#define DEB
#else
// DEB と打つとデバッグ時以外はコメントアウトになる
#define DEB / ## /
#endif
// 変数ダンプ用マクロ。デバッグ時以外は消滅する
// 引数はいくつでもどんな型でも可（ストリーム出力演算子があればOK）
#define dump(...) \
DEB DUMPOUT << " "; \
DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" \
<< endl; \
DUMPOUT << " "; \
dump_func(__VA_ARGS__)
// デバッグ用変数ダンプ関数
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) == 0) {
DUMPOUT << " ";
} else {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
// vector出力
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << "{";
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
os << "}";
return os;
}
ll mod = 1000000007;
ll modplus(ll x, ll y) { return (x + y) % mod; }
ll modminus(ll x, ll y) { return (x - y + mod) % mod; }
ll multiply(ll x, ll y) { return (x % mod) * (y % mod) % mod; }
ll power(ll x, ll y) {
if (y == 0) {
return 1;
} else if (y == 1) {
return x % mod;
} else if (y % 2 == 0) {
ll p = power(x, y / 2);
return p * p % mod;
} else {
ll p = power(x, y / 2);
return (p * p) % mod * (x % mod) % mod;
}
}
ll divide(ll x, ll y) { return multiply(x, power(y, mod - 2)); }
// 「オイラーのふるい」。pnには素数の数が、primesには順番に素数が、
// eulnumsにはその整数を割り切る最小の素数が入る。
// ある数からeulnumsを割っていくとその数の素因数分解が可能。
int pn = 0;
int primes[16000000];
int eulnums[16000000];
void eulerprime(int n) {
fill(eulnums, eulnums + n + 1, 0);
for (int i = 2; i <= n; i++) {
if (eulnums[i] == 0) {
eulnums[i] = i;
primes[pn] = i;
pn++;
}
for (int j = 0; i * primes[j] <= n; j++) {
eulnums[i * primes[j]] = primes[j];
if (i % primes[j] == 0) {
break;
}
}
}
}
signed main() {
ll N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i];
eulerprime(1000000);
int my_factor[pn];
int lcm_factor[pn];
REP(i, pn) { lcm_factor[i] = 0; }
int a, d;
REP(i, N) {
REP(i, pn) { my_factor[i] = 0; }
a = A[i];
while (a > 1) {
d = eulnums[a];
REP(j, pn) {
if (d == primes[j]) {
my_factor[j]++;
}
}
a /= d;
}
REP(i, pn) { lcm_factor[i] = max(lcm_factor[i], my_factor[i]); }
}
ll ans = 0;
ll LCM = 1;
REP(i, pn) {
if (lcm_factor[i] > 0) {
REP(j, lcm_factor[i]) { LCM = multiply(LCM, primes[i]); }
}
}
// cout << LCM << endl; // DEBUG
REP(i, N) { ans = modplus(ans, divide(LCM, A[i])); }
cout << ans << endl;
}
// https://github.com/kurokoji/.cpp-Template/wiki テンプレートについて
// http://www.creativ.xyz/dump-cpp-652 dump()について
// https://gist.github.com/rigibun/7905920 色々 | #include <bits/stdc++.h>
using namespace std;
// 変数ダンプ先。coutかcerr
#define DUMPOUT cerr
// 提出時はコメントアウト
#define DEBUG_
// #define int long long // intで書いたけど心配なときにlong longに変換する
struct Fast {
Fast() {
std::cin.tie(0);
ios::sync_with_stdio(false);
}
} fast;
/* cpp template {{{ */
/* short */
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define Fi first
#define Se second
#define ALL(v) begin(v), end(v)
#define RALL(v) rbegin(v), rend(v)
#define X real()
#define Y imag()
/* REPmacro */
#define REPS(i, a, n) for (ll i = (a); i < (ll)(n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (ll i = (a); i >= (ll)(n); --i)
#define DEP(i, n) DEPS(i, n, 0)
#define EACH(i, n) for (auto &&i : n)
/* debug */
#define debug(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n';
/* alias */
using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using D = double;
using P = complex<D>;
using vs = vector<string>;
template <typename T> using PQ = priority_queue<T>;
template <typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
/* const */
const int INF = 1001001001;
const ll LINF = 1001001001001001001ll;
const int MOD = 1e9 + 7;
const D EPS = 1e-9;
const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1},
dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
/* func */
inline bool inside(int y, int x, int H, int W) {
return y >= 0 && x >= 0 && y < H && x < W;
}
inline int in() {
int x;
cin >> x;
return x;
}
inline ll IN() {
ll x;
cin >> x;
return x;
}
inline vs split(const string &t, char c) {
vs v;
stringstream s(t);
string b;
while (getline(s, b, c))
v.eb(b);
return v;
}
template <typename T> inline bool chmin(T &a, const T &b) {
if (a > b)
a = b;
return a > b;
}
template <typename T> inline bool chmax(T &a, const T &b) {
if (a < b)
a = b;
return a < b;
}
template <typename T, typename S> inline void print(const pair<T, S> &p) {
cout << p.first << " " << p.second << endl;
}
template <typename T> inline void print(const T &x) { cout << x << '\n'; }
template <typename T, typename S>
inline void print(const vector<pair<T, S>> &v) {
for (auto &&p : v)
print(p);
}
template <typename T> inline void print(const vector<T> &v, string s = " ") {
REP(i, v.size()) cout << v[i] << (i != (ll)v.size() - 1 ? s : "\n");
}
// clang-format on
/* }}} */
#ifdef DEBUG_
#define DEB
#else
// DEB と打つとデバッグ時以外はコメントアウトになる
#define DEB / ## /
#endif
// 変数ダンプ用マクロ。デバッグ時以外は消滅する
// 引数はいくつでもどんな型でも可（ストリーム出力演算子があればOK）
#define dump(...) \
DEB DUMPOUT << " "; \
DUMPOUT << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" \
<< endl; \
DUMPOUT << " "; \
dump_func(__VA_ARGS__)
// デバッグ用変数ダンプ関数
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail>
void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) == 0) {
DUMPOUT << " ";
} else {
DUMPOUT << ", ";
}
dump_func(std::move(tail)...);
}
// vector出力
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << "{";
for (int i = 0; i < vec.size(); i++) {
os << vec[i] << (i + 1 == vec.size() ? "" : ", ");
}
os << "}";
return os;
}
ll mod = 1000000007;
ll modplus(ll x, ll y) { return (x + y) % mod; }
ll modminus(ll x, ll y) { return (x - y + mod) % mod; }
ll multiply(ll x, ll y) { return (x % mod) * (y % mod) % mod; }
ll power(ll x, ll y) {
if (y == 0) {
return 1;
} else if (y == 1) {
return x % mod;
} else if (y % 2 == 0) {
ll p = power(x, y / 2);
return p * p % mod;
} else {
ll p = power(x, y / 2);
return (p * p) % mod * (x % mod) % mod;
}
}
ll divide(ll x, ll y) { return multiply(x, power(y, mod - 2)); }
// 「オイラーのふるい」。pnには素数の数が、primesには順番に素数が、
// eulnumsにはその整数を割り切る最小の素数が入る。
// ある数からeulnumsを割っていくとその数の素因数分解が可能。
int pn = 0;
int primes[16000000];
int eulnums[16000000];
void eulerprime(int n) {
fill(eulnums, eulnums + n + 1, 0);
for (int i = 2; i <= n; i++) {
if (eulnums[i] == 0) {
eulnums[i] = i;
primes[pn] = i;
pn++;
}
for (int j = 0; i * primes[j] <= n; j++) {
eulnums[i * primes[j]] = primes[j];
if (i % primes[j] == 0) {
break;
}
}
}
}
signed main() {
ll N;
cin >> N;
vector<int> A(N);
REP(i, N) cin >> A[i];
eulerprime(1000000);
int my_factor[pn];
int lcm_factor[pn];
REP(i, pn) { lcm_factor[i] = 0; }
int a, d;
REP(i, N) {
REP(i, pn) { my_factor[i] = 0; }
a = A[i];
while (a > 1) {
d = eulnums[a];
REP(j, pn) {
if (d == primes[j]) {
my_factor[j]++;
break;
}
}
a /= d;
}
REP(i, pn) { lcm_factor[i] = max(lcm_factor[i], my_factor[i]); }
}
ll ans = 0;
ll LCM = 1;
REP(i, pn) {
if (lcm_factor[i] > 0) {
REP(j, lcm_factor[i]) { LCM = multiply(LCM, primes[i]); }
}
}
// cout << LCM << endl; // DEBUG
REP(i, N) { ans = modplus(ans, divide(LCM, A[i])); }
cout << ans << endl;
}
// https://github.com/kurokoji/.cpp-Template/wiki テンプレートについて
// http://www.creativ.xyz/dump-cpp-652 dump()について
// https://gist.github.com/rigibun/7905920 色々 | insert | 220 | 220 | 220 | 221 | TLE | |
p02793 | C++ | Time Limit Exceeded | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include "bits/stdc++.h"
#define REP(i, x, y) for (ll i = (x); i < (y); i++)
#define RREP(i, x, y) for (ll i = (y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
// #define int long long
using namespace std;
// conversion
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();
}
#define dump(x) cout << #x << " = " << (x) << endl
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl
typedef long long ll;
const ll MOD = 1e9 + 7;
long long modPow(long long a, long long x, long long p) {
long long res = 1;
while (x > 0) {
if (x % 2 != 0) {
res = (res * a) % p;
}
a = (a * a) % p;
x /= 2;
}
return res;
}
long long modInverse(long long a, long long p) {
// calculates the modular multiplicative of a mod m.
//(assuming p is prime).
return modPow(a, p - 2, p);
}
long long modFactorial(long long a, long long p) {
long long fact = 1;
for (long long i = 2; i <= a; i++) {
fact *= i;
fact %= p;
}
return fact;
}
long long combination(long long n, long long k, long long p) {
// calculates C(n,k) mod p (assuming p is prime).
long long numerator = 1; // n * (n-1) * ... * (n-k+1)
for (int i = 0; i < k; i++) {
numerator = (numerator * (n - i)) % p;
}
long long denominator = 1; // k!
for (int i = 1; i <= k; i++) {
denominator = (denominator * i) % p;
}
// numerator / denominator mod p.
return (numerator * modInverse(denominator, p)) % p;
}
long long getGcd(long long a, long long b) {
if (a < b)
swap(a, b);
long long r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
long long getLcm(long long a, long long b) { return a * b / getGcd(a, b); }
class EFlatten {
public:
void solve(std::istream &in, std::ostream &out) {
ll N;
in >> N;
vector<ll> A(N);
REP(i, 0, N) in >> A[i];
vector<ll> primes = {2};
REP(i, 3, 1e6 + 1) {
bool isPrime = true;
ll root = pow(i, 0.5);
for (const auto &prime : primes) {
if (root < prime)
break;
if (i % prime == 0) {
isPrime = false;
break;
}
}
if (isPrime)
primes.push_back(i);
}
unordered_map<ll, ll> lcmMap;
REP(i, 0, N) {
ll a = A[i];
for (const auto &prime : primes) {
if (a == 1)
break;
ll cnt = 0;
while (a % prime == 0) {
a /= prime;
cnt++;
}
if (cnt > 0)
lcmMap[prime] = max(lcmMap[prime], cnt);
}
}
ll lcm = 1;
for (const auto &prime : primes) {
REP(i, 0, lcmMap[prime]) {
lcm *= prime;
lcm %= MOD;
}
}
ll answer = 0;
REP(i, 0, N) {
ll b = lcm * modInverse(A[i], MOD);
answer += b;
answer %= MOD;
}
out << answer << "\n";
}
};
signed main() {
EFlatten solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author
*/
#include <fstream>
#include <iostream>
#include "bits/stdc++.h"
#define REP(i, x, y) for (ll i = (x); i < (y); i++)
#define RREP(i, x, y) for (ll i = (y)-1; i >= (x); i--)
#define all(x) (x).begin(), (x).end()
// #define int long long
using namespace std;
// conversion
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();
}
#define dump(x) cout << #x << " = " << (x) << endl
#define debug(x) \
cout << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl
typedef long long ll;
const ll MOD = 1e9 + 7;
long long modPow(long long a, long long x, long long p) {
long long res = 1;
while (x > 0) {
if (x % 2 != 0) {
res = (res * a) % p;
}
a = (a * a) % p;
x /= 2;
}
return res;
}
long long modInverse(long long a, long long p) {
// calculates the modular multiplicative of a mod m.
//(assuming p is prime).
return modPow(a, p - 2, p);
}
long long modFactorial(long long a, long long p) {
long long fact = 1;
for (long long i = 2; i <= a; i++) {
fact *= i;
fact %= p;
}
return fact;
}
long long combination(long long n, long long k, long long p) {
// calculates C(n,k) mod p (assuming p is prime).
long long numerator = 1; // n * (n-1) * ... * (n-k+1)
for (int i = 0; i < k; i++) {
numerator = (numerator * (n - i)) % p;
}
long long denominator = 1; // k!
for (int i = 1; i <= k; i++) {
denominator = (denominator * i) % p;
}
// numerator / denominator mod p.
return (numerator * modInverse(denominator, p)) % p;
}
long long getGcd(long long a, long long b) {
if (a < b)
swap(a, b);
long long r = a % b;
while (r != 0) {
a = b;
b = r;
r = a % b;
}
return b;
}
long long getLcm(long long a, long long b) { return a * b / getGcd(a, b); }
class EFlatten {
public:
void solve(std::istream &in, std::ostream &out) {
ll N;
in >> N;
vector<ll> A(N);
REP(i, 0, N) in >> A[i];
vector<ll> primes = {2};
REP(i, 3, 1e6 + 1) {
bool isPrime = true;
ll root = pow(i, 0.5);
for (const auto &prime : primes) {
if (root < prime)
break;
if (i % prime == 0) {
isPrime = false;
break;
}
}
if (isPrime)
primes.push_back(i);
}
unordered_map<ll, ll> lcmMap;
REP(i, 0, N) {
ll a = A[i];
if (binary_search(all(primes), a)) {
lcmMap[a] = max(lcmMap[a], 1LL);
continue;
}
for (const auto &prime : primes) {
if (a == 1)
break;
ll cnt = 0;
while (a % prime == 0) {
a /= prime;
cnt++;
}
if (cnt > 0)
lcmMap[prime] = max(lcmMap[prime], cnt);
}
}
ll lcm = 1;
for (const auto &prime : primes) {
REP(i, 0, lcmMap[prime]) {
lcm *= prime;
lcm %= MOD;
}
}
ll answer = 0;
REP(i, 0, N) {
ll b = lcm * modInverse(A[i], MOD);
answer += b;
answer %= MOD;
}
out << answer << "\n";
}
};
signed main() {
EFlatten solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
solver.solve(in, out);
return 0;
}
| insert | 123 | 123 | 123 | 127 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#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 ll inf = 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 all(x) (x).begin(), (x).end()
#define sz(x) ll(x.size())
template <typename T> void print_vec(vector<T> a) {
int n = a.size();
REP(i, n) {
cout >> a[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
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<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 modint = ModInt<mod>;
signed main() {
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll n;
cin >> n;
vector<ll> a(n);
vector<map<int, int>> b(n);
map<int, int> s;
REP(i, n) cin >> a[i];
REP(i, n) {
ll x = a[i];
for (ll j = 2; j * j <= x; j++) {
while (x % j == 0) {
b[i][j]++;
x /= j;
}
}
if (x != 1)
b[i][x]++;
}
REP(i, n) {
for (auto &x : b[i]) {
int y = x.first;
s[y] = max(s[y], x.second);
}
}
modint ans = 0;
REP(i, n) {
modint tmp = 1;
for (auto &x : s) {
int y = x.first;
tmp *= power(y, x.second - b[i][y]);
}
ans += tmp;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#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 ll inf = 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 all(x) (x).begin(), (x).end()
#define sz(x) ll(x.size())
template <typename T> void print_vec(vector<T> a) {
int n = a.size();
REP(i, n) {
cout >> a[i];
if (i != n - 1)
cout << " ";
else
cout << endl;
}
}
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<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 modint = ModInt<mod>;
signed main() {
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
ll n;
cin >> n;
vector<ll> a(n);
vector<map<int, int>> b(n);
map<int, int> s;
REP(i, n) cin >> a[i];
REP(i, n) {
ll x = a[i];
for (ll j = 2; j * j <= x; j++) {
while (x % j == 0) {
b[i][j]++;
x /= j;
}
}
if (x != 1)
b[i][x]++;
}
REP(i, n) {
for (auto &x : b[i]) {
int y = x.first;
s[y] = max(s[y], x.second);
}
}
modint ans = 0;
REP(i, n) { ans += static_cast<modint>(1) / a[i]; }
for (auto &x : s) {
REP(i, x.second) { ans *= x.first; }
}
cout << ans << endl;
return 0;
}
| replace | 164 | 171 | 164 | 167 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#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)
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
template <std::int_fast64_t Modulus> class modint {
using u64 = std::int_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
const lint MOD = 1e9 + 7;
typedef modint<MOD> ModInt;
#pragma endregion
set<int64_t> st;
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
st.insert(i);
}
}
if (n != 1) {
ret[n] = 1;
st.insert(n);
}
return ret;
}
ModInt val[10000];
map<int64_t, int> mps[10000];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
lint N, A;
cin >> N;
REP(i, N) {
cin >> A;
val[i].a = A;
}
REP(i, N) { mps[i] = prime_factor(val[i].a); }
for (auto itr : st) {
REP(i, N - 1) { mps[0][itr] = max(mps[0][itr], mps[i + 1][itr]); }
}
ModInt lcm = 1;
for (auto itr : mps[0]) {
lcm *= pow(itr.first, itr.second);
}
ModInt ans = 0;
REP(i, N) { ans += lcm / val[i]; }
cout << ans.a;
}
| #include "bits/stdc++.h"
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#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)
template <typename T1, typename T2>
pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first + r.first, l.second + r.second);
}
template <typename T1, typename T2>
pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) {
return make_pair(l.first - r.first, l.second - r.second);
}
template <std::int_fast64_t Modulus> class modint {
using u64 = std::int_fast64_t;
public:
u64 a;
constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
constexpr u64 &value() noexcept { return a; }
constexpr const u64 &value() const noexcept { return a; }
constexpr modint operator+(const modint rhs) const noexcept {
return modint(*this) += rhs;
}
constexpr modint operator-(const modint rhs) const noexcept {
return modint(*this) -= rhs;
}
constexpr modint operator*(const modint rhs) const noexcept {
return modint(*this) *= rhs;
}
constexpr modint operator/(const modint rhs) const noexcept {
return modint(*this) /= rhs;
}
constexpr modint &operator+=(const modint rhs) noexcept {
a += rhs.a;
if (a >= Modulus) {
a -= Modulus;
}
return *this;
}
constexpr modint &operator-=(const modint rhs) noexcept {
if (a < rhs.a) {
a += Modulus;
}
a -= rhs.a;
return *this;
}
constexpr modint &operator*=(const modint rhs) noexcept {
a = a * rhs.a % Modulus;
return *this;
}
constexpr modint &operator/=(modint rhs) noexcept {
u64 exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
};
const lint MOD = 1e9 + 7;
typedef modint<MOD> ModInt;
#pragma endregion
set<int64_t> st;
map<int64_t, int> prime_factor(int64_t n) {
map<int64_t, int> ret;
for (int64_t i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
st.insert(i);
}
}
if (n != 1) {
ret[n] = 1;
st.insert(n);
}
return ret;
}
ModInt val[10000];
map<int64_t, int> mps[10000];
int main() {
cin.tie(0);
ios_base::sync_with_stdio(false);
lint N, A;
cin >> N;
REP(i, N) {
cin >> A;
val[i].a = A;
}
mps[0] = prime_factor(val[0].a);
REP(i, N - 1) {
mps[i + 1] = prime_factor(val[i + 1].a);
for (auto itr : mps[i + 1]) {
if (mps[0].find(itr.first) == mps[0].end())
mps[0][itr.first] = itr.second;
else
mps[0][itr.first] = max(mps[0][itr.first], itr.second);
}
}
ModInt lcm = 1;
for (auto itr : mps[0]) {
lcm *= pow(itr.first, itr.second);
}
ModInt ans = 0;
REP(i, N) { ans += lcm / val[i]; }
cout << ans.a;
}
| replace | 104 | 107 | 104 | 113 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m; i >= n; i--)
#define de(x) cout << #x << "=" << x << endl;
template <class T> bool maxi(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool mini(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define dame \
{ \
cout << "-1" \
<< "\n"; \
return; \
}
#define INF2 1000000000000000037
#define INF 1000000007
#define MOD 1000000007
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
//--GLOBAL---------------------------------
const int MAXN = 100024;
ll soinsu[MAXN + 1];
void prime_factors(int n) {
map<int, int> res;
for (int i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res[i]++; // 素数i^{res[i]}
n /= i;
}
}
if (n != 1)
res[n]++;
for (auto x : res) {
ll sosu = x.first, kosu = x.second;
maxi(soinsu[sosu], kosu);
}
}
ll modpow(ll a, ll n = MOD - 2, ll mod = MOD) { // a^n % MOD の計算
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//--MAIN-----------------------------------
void Main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
rep(i, N) { prime_factors(A[i]); }
ll ans = 1;
rep(i, MAXN) {
while (soinsu[i] != 0) {
--soinsu[i];
ans *= i;
ans %= MOD;
}
}
ll ans2 = 0;
rep(i, N) {
ans2 += modpow(A[i]);
ans2 %= MOD;
}
ans *= ans2;
ans %= MOD;
cout << ans << "\n";
}
//--START----------------------------------
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
//-----------------------------------------
| #include <bits/stdc++.h>
#define SORT(x) sort((x).begin(), (x).end())
#define ALL(x) (x).begin(), (x).end()
#define rep(i, n) for (ll i = 0; i < n; i++)
#define reps(i, m, n) for (ll i = m; i < n; i++)
#define repr(i, m, n) for (ll i = m; i >= n; i--)
#define de(x) cout << #x << "=" << x << endl;
template <class T> bool maxi(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool mini(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define dame \
{ \
cout << "-1" \
<< "\n"; \
return; \
}
#define INF2 1000000000000000037
#define INF 1000000007
#define MOD 1000000007
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
//--GLOBAL---------------------------------
const int MAXN = 1000024;
ll soinsu[MAXN + 1];
void prime_factors(int n) {
map<int, int> res;
for (int i = 2; i * i <= n; ++i) {
while (n % i == 0) {
res[i]++; // 素数i^{res[i]}
n /= i;
}
}
if (n != 1)
res[n]++;
for (auto x : res) {
ll sosu = x.first, kosu = x.second;
maxi(soinsu[sosu], kosu);
}
}
ll modpow(ll a, ll n = MOD - 2, ll mod = MOD) { // a^n % MOD の計算
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
//--MAIN-----------------------------------
void Main() {
ll N;
cin >> N;
vector<ll> A(N);
rep(i, N) cin >> A[i];
rep(i, N) { prime_factors(A[i]); }
ll ans = 1;
rep(i, MAXN) {
while (soinsu[i] != 0) {
--soinsu[i];
ans *= i;
ans %= MOD;
}
}
ll ans2 = 0;
rep(i, N) {
ans2 += modpow(A[i]);
ans2 %= MOD;
}
ans *= ans2;
ans %= MOD;
cout << ans << "\n";
}
//--START----------------------------------
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
}
//-----------------------------------------
| replace | 35 | 36 | 35 | 36 | 0 | |
p02793 | C++ | Runtime Error | #include <stdio.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const int MOD = 1e9 + 7, MAX = 1e6;
static inline int IN(void) {
int x = 0, f = 0, c = getchar();
while (c < 48 || c > 57) {
f ^= c == 45, c = getchar();
}
while (c > 47 && c < 58) {
x = x * 10 + c - 48, c = getchar();
}
return f ? -x : x;
}
typedef struct {
int SPF[1000001];
int Primes[1000001];
int sz;
} Template;
struct T {
int fact[1000001], inv[1000001];
};
Template P;
struct T MODINV;
static inline int MPow(int a, int b) {
return b ? 1l * MPow(1l * a * a % MOD, b >> 1) * (b & 1 ? a : 1) % MOD : 1;
}
static inline void ready(void) {
*P.SPF = 1, *P.Primes = 2, P.sz = 1;
rep(i, MAX / 2) P.SPF[2 * (i + 1)] = 2,
P.SPF[2 * (i + 1) - 1] = 2 * (i + 1) - 1;
rep(i, MAX / 2 - 1) {
int x = 2 * (i + 1) + 1;
if (P.SPF[x] == x) {
P.Primes[P.sz++] = x;
}
if (x * x > MAX)
break;
rep(j, P.sz) {
if (P.Primes[j] <= P.SPF[x] && x * P.Primes[j] <= MAX)
P.SPF[x * P.Primes[j]] = P.Primes[j];
else
break;
}
}
}
static inline void init(void) {
MODINV.fact[0] = 1;
rep(i, MAX) MODINV.fact[i + 1] = 1l * MODINV.fact[i] * (i + 1) % MOD;
MODINV.inv[MAX] = MPow(MODINV.fact[MAX], MOD - 2);
rep(i, MAX) MODINV.inv[MAX - 1 - i] =
1l * MODINV.inv[MAX - i] * (MAX - i) % MOD;
}
int main(void) {
int N = IN(), A = 0, flag = 0, invsum = 0, k = 0, lcm = 1, x = 0,
unique[1061], box[168] = {0};
ready();
init();
rep(i, N) {
A = IN();
invsum = (invsum + 1l * MODINV.fact[A - 1] * MODINV.inv[A] % MOD) % MOD;
rep(j, 168) {
x = 0;
while (A % P.Primes[j] == 0) {
A /= P.Primes[j];
if (box[j] < ++x)
box[j] = x;
}
}
if (A != 1) {
rep(j, k) {
if (unique[j] == A)
flag = 1;
continue;
}
if (!flag)
unique[k++] = A;
}
flag = 0;
}
rep(i, 168) {
rep(j, box[i]) { lcm = 1l * lcm * P.Primes[i] % MOD; }
}
rep(i, k) { lcm = 1l * lcm * unique[i] % MOD; }
x = 1l * lcm * invsum % MOD;
return printf("%d\n", x), 0;
} | #include <stdio.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const int MOD = 1e9 + 7, MAX = 1e6;
static inline int IN(void) {
int x = 0, f = 0, c = getchar();
while (c < 48 || c > 57) {
f ^= c == 45, c = getchar();
}
while (c > 47 && c < 58) {
x = x * 10 + c - 48, c = getchar();
}
return f ? -x : x;
}
typedef struct {
int SPF[1000001];
int Primes[1000001];
int sz;
} Template;
struct T {
int fact[1000001], inv[1000001];
};
Template P;
struct T MODINV;
static inline int MPow(int a, int b) {
return b ? 1l * MPow(1l * a * a % MOD, b >> 1) * (b & 1 ? a : 1) % MOD : 1;
}
static inline void ready(void) {
*P.SPF = 1, *P.Primes = 2, P.sz = 1;
rep(i, MAX / 2) P.SPF[2 * (i + 1)] = 2,
P.SPF[2 * (i + 1) - 1] = 2 * (i + 1) - 1;
rep(i, MAX / 2 - 1) {
int x = 2 * (i + 1) + 1;
if (P.SPF[x] == x) {
P.Primes[P.sz++] = x;
}
if (x * x > MAX)
break;
rep(j, P.sz) {
if (P.Primes[j] <= P.SPF[x] && x * P.Primes[j] <= MAX)
P.SPF[x * P.Primes[j]] = P.Primes[j];
else
break;
}
}
}
static inline void init(void) {
MODINV.fact[0] = 1;
rep(i, MAX) MODINV.fact[i + 1] = 1l * MODINV.fact[i] * (i + 1) % MOD;
MODINV.inv[MAX] = MPow(MODINV.fact[MAX], MOD - 2);
rep(i, MAX) MODINV.inv[MAX - 1 - i] =
1l * MODINV.inv[MAX - i] * (MAX - i) % MOD;
}
int main(void) {
int N = IN(), A = 0, flag = 0, invsum = 0, k = 0, lcm = 1, x = 0,
unique[10000], box[168] = {0};
ready();
init();
rep(i, N) {
A = IN();
invsum = (invsum + 1l * MODINV.fact[A - 1] * MODINV.inv[A] % MOD) % MOD;
rep(j, 168) {
x = 0;
while (A % P.Primes[j] == 0) {
A /= P.Primes[j];
if (box[j] < ++x)
box[j] = x;
}
}
if (A != 1) {
rep(j, k) {
if (unique[j] == A)
flag = 1;
continue;
}
if (!flag)
unique[k++] = A;
}
flag = 0;
}
rep(i, 168) {
rep(j, box[i]) { lcm = 1l * lcm * P.Primes[i] % MOD; }
}
rep(i, k) { lcm = 1l * lcm * unique[i] % MOD; }
x = 1l * lcm * invsum % MOD;
return printf("%d\n", x), 0;
} | replace | 57 | 58 | 57 | 58 | 0 | |
p02793 | C++ | Runtime Error | #include <stdio.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const int MOD = 1e9 + 7, MAX = 1e6;
static inline int IN(void) {
int x = 0, f = 0, c = getchar();
while (c < 48 || c > 57) {
f ^= c == 45, c = getchar();
}
while (c > 47 && c < 58) {
x = x * 10 + c - 48, c = getchar();
}
return f ? -x : x;
}
typedef struct {
int SPF[1000001];
int Primes[1229];
int sz;
} Template;
struct T {
int fact[1000001], inv[1000001];
};
Template P;
struct T MODINV;
static inline int MPow(int a, int b) {
return b ? 1l * MPow(1l * a * a % MOD, b >> 1) * (b & 1 ? a : 1) % MOD : 1;
}
static inline void ready(void) {
*P.SPF = 1, *P.Primes = 2, P.sz = 1;
rep(i, MAX / 2) P.SPF[2 * (i + 1)] = 2,
P.SPF[2 * (i + 1) - 1] = 2 * (i + 1) - 1;
rep(i, MAX / 2 - 1) {
int x = 2 * (i + 1) + 1;
if (P.SPF[x] == x) {
P.Primes[P.sz++] = x;
}
if (x * x > MAX)
break;
rep(j, P.sz) {
if (P.Primes[j] <= P.SPF[x] && x * P.Primes[j] <= MAX)
P.SPF[x * P.Primes[j]] = P.Primes[j];
else
break;
}
}
}
static inline void init(void) {
MODINV.fact[0] = 1;
rep(i, MAX) MODINV.fact[i + 1] = 1l * MODINV.fact[i] * (i + 1) % MOD;
MODINV.inv[MAX] = MPow(MODINV.fact[MAX], MOD - 2);
rep(i, MAX) MODINV.inv[MAX - 1 - i] =
1l * MODINV.inv[MAX - i] * (MAX - i) % MOD;
}
int main(void) {
int N = IN(), A = 0, flag = 0, invsum = 0, k = 0, lcm = 1, x = 0,
unique[9000], box[168] = {0};
ready();
init();
rep(i, N) {
A = IN();
invsum = (invsum + 1l * MODINV.fact[A - 1] * MODINV.inv[A] % MOD) % MOD;
rep(j, 168) {
x = 0;
while (A % P.Primes[j] == 0) {
A /= P.Primes[j];
if (box[j] < ++x)
box[j] = x;
}
}
if (A != 1) {
rep(j, k) {
if (unique[j] == A)
flag = 1;
continue;
}
if (!flag)
unique[k++] = A;
}
flag = 0;
}
rep(i, 168) {
rep(j, box[i]) { lcm = 1l * lcm * P.Primes[i] % MOD; }
}
rep(i, k) { lcm = 1l * lcm * unique[i] % MOD; }
x = 1l * lcm * invsum % MOD;
return printf("%d\n", x), 0;
} | #include <stdio.h>
#pragma GCC optimize("O2")
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define rep(i, N) for (int i = 0; i < (int)N; i++)
const int MOD = 1e9 + 7, MAX = 1e6;
static inline int IN(void) {
int x = 0, f = 0, c = getchar();
while (c < 48 || c > 57) {
f ^= c == 45, c = getchar();
}
while (c > 47 && c < 58) {
x = x * 10 + c - 48, c = getchar();
}
return f ? -x : x;
}
typedef struct {
int SPF[1000001];
int Primes[1229];
int sz;
} Template;
struct T {
int fact[1000001], inv[1000001];
};
Template P;
struct T MODINV;
static inline int MPow(int a, int b) {
return b ? 1l * MPow(1l * a * a % MOD, b >> 1) * (b & 1 ? a : 1) % MOD : 1;
}
static inline void ready(void) {
*P.SPF = 1, *P.Primes = 2, P.sz = 1;
rep(i, MAX / 2) P.SPF[2 * (i + 1)] = 2,
P.SPF[2 * (i + 1) - 1] = 2 * (i + 1) - 1;
rep(i, MAX / 2 - 1) {
int x = 2 * (i + 1) + 1;
if (P.SPF[x] == x) {
P.Primes[P.sz++] = x;
}
if (x * x > MAX)
break;
rep(j, P.sz) {
if (P.Primes[j] <= P.SPF[x] && x * P.Primes[j] <= MAX)
P.SPF[x * P.Primes[j]] = P.Primes[j];
else
break;
}
}
}
static inline void init(void) {
MODINV.fact[0] = 1;
rep(i, MAX) MODINV.fact[i + 1] = 1l * MODINV.fact[i] * (i + 1) % MOD;
MODINV.inv[MAX] = MPow(MODINV.fact[MAX], MOD - 2);
rep(i, MAX) MODINV.inv[MAX - 1 - i] =
1l * MODINV.inv[MAX - i] * (MAX - i) % MOD;
}
int main(void) {
int N = IN(), A = 0, flag = 0, invsum = 0, k = 0, lcm = 1, x = 0,
unique[9999], box[168] = {0};
ready();
init();
rep(i, N) {
A = IN();
invsum = (invsum + 1l * MODINV.fact[A - 1] * MODINV.inv[A] % MOD) % MOD;
rep(j, 168) {
x = 0;
while (A % P.Primes[j] == 0) {
A /= P.Primes[j];
if (box[j] < ++x)
box[j] = x;
}
}
if (A != 1) {
rep(j, k) {
if (unique[j] == A)
flag = 1;
continue;
}
if (!flag)
unique[k++] = A;
}
flag = 0;
}
rep(i, 168) {
rep(j, box[i]) { lcm = 1l * lcm * P.Primes[i] % MOD; }
}
rep(i, k) { lcm = 1l * lcm * unique[i] % MOD; }
x = 1l * lcm * invsum % MOD;
return printf("%d\n", x), 0;
} | replace | 57 | 58 | 57 | 58 | 0 | |
p02793 | C++ | Time Limit Exceeded | /* lcm_prime.cpp
素因数分解の形で最小公倍数を求めるアルゴリズム
(オーバーフローする場合などに使える)
*/
#include <bits/stdc++.h>
using namespace std;
map<long long, int> prime_factor(long long n) { // 素因数分解
map<long long, int> ret;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
/* lcm_prime(vector<long long> vec)
入力：整数のベクトル vec
出力：すべての要素の最小公倍数を素因数分解したmap
*/
map<long long, int> lcm_prime(const vector<long long> &vec) {
map<long long, int> ret;
for (int i = 0; i < vec.size(); i++) {
map<long long, int> prime_fac = prime_factor(vec[i]);
for (auto p : prime_fac) {
if (ret.find(p.first) != ret.end()) {
ret[p.first] = max(ret[p.first], p.second);
} else {
ret[p.first] = p.second;
}
}
}
return ret;
}
template <int mod> struct ModInt {
int val;
ModInt() : val(0) {}
ModInt(long long x) : val(x >= 0 ? x % mod : (mod - (-x) % mod) % mod) {}
int getmod() { return mod; }
ModInt &operator+=(const ModInt &p) {
if ((val += p.val) >= mod) {
val -= mod;
}
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((val += mod - p.val) >= mod) {
val -= mod;
}
return *this;
}
ModInt &operator*=(const ModInt &p) {
val = (int)(1LL * val * p.val % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-val); }
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 val == p.val; }
bool operator!=(const ModInt &p) const { return val != p.val; }
ModInt inverse() const {
int a = val, 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(long long n) const {
ModInt ret(1), mul(val);
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.val;
}
friend istream &operator>>(istream &is, ModInt &a) {
long long t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
const int MOD = 1000000007; // if inv is needed, this shold be prime.
using modint = ModInt<MOD>;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
map<long long, int> lp = lcm_prime(A);
modint ans = 0;
for (int i = 0; i < N; i++) {
map<long long, int> n = lp;
map<long long, int> pf = prime_factor(A[i]);
for (auto p : pf) {
n[p.first] -= p.second;
}
modint tmp = 1;
for (auto p : n) {
tmp *= modint(p.first).pow(p.second);
}
ans += tmp;
}
cout << ans << endl;
return 0;
}
| /* lcm_prime.cpp
素因数分解の形で最小公倍数を求めるアルゴリズム
(オーバーフローする場合などに使える)
*/
#include <bits/stdc++.h>
using namespace std;
map<long long, int> prime_factor(long long n) { // 素因数分解
map<long long, int> ret;
for (long long i = 2; i * i <= n; i++) {
while (n % i == 0) {
ret[i]++;
n /= i;
}
}
if (n != 1)
ret[n] = 1;
return ret;
}
/* lcm_prime(vector<long long> vec)
入力：整数のベクトル vec
出力：すべての要素の最小公倍数を素因数分解したmap
*/
map<long long, int> lcm_prime(const vector<long long> &vec) {
map<long long, int> ret;
for (int i = 0; i < vec.size(); i++) {
map<long long, int> prime_fac = prime_factor(vec[i]);
for (auto p : prime_fac) {
if (ret.find(p.first) != ret.end()) {
ret[p.first] = max(ret[p.first], p.second);
} else {
ret[p.first] = p.second;
}
}
}
return ret;
}
template <int mod> struct ModInt {
int val;
ModInt() : val(0) {}
ModInt(long long x) : val(x >= 0 ? x % mod : (mod - (-x) % mod) % mod) {}
int getmod() { return mod; }
ModInt &operator+=(const ModInt &p) {
if ((val += p.val) >= mod) {
val -= mod;
}
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((val += mod - p.val) >= mod) {
val -= mod;
}
return *this;
}
ModInt &operator*=(const ModInt &p) {
val = (int)(1LL * val * p.val % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-val); }
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 val == p.val; }
bool operator!=(const ModInt &p) const { return val != p.val; }
ModInt inverse() const {
int a = val, 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(long long n) const {
ModInt ret(1), mul(val);
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.val;
}
friend istream &operator>>(istream &is, ModInt &a) {
long long t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
const int MOD = 1000000007; // if inv is needed, this shold be prime.
using modint = ModInt<MOD>;
int main() {
int N;
cin >> N;
vector<long long> A(N);
for (int i = 0; i < N; i++) {
cin >> A.at(i);
}
map<long long, int> lp = lcm_prime(A);
modint ans = 0;
for (int i = 0; i < N; i++) {
ans += modint(A[i]).inverse();
}
for (auto p : lp) {
ans *= modint(p.first).pow(p.second);
}
cout << ans << endl;
return 0;
}
| replace | 115 | 125 | 115 | 119 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;
typedef long long ll;
const ll MOD = 1e9 + 7;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
vector<bool> prime(1000001, true);
for (int i = 2; i < 1000; i++) {
if (prime[i]) {
for (int j = i * 2; j < 1000001; j += i)
prime[j] = false;
}
}
vector<ll> primes(0);
for (int i = 2; i < 1000000; i++) {
if (prime[i])
primes.push_back(i);
}
int M = primes.size();
// rep(i, 100) cout << primes[i] << " ";
// cout << endl;
int N;
cin >> N;
vector<ll> A(N), factor(1000000, 0);
rep(i, N) {
cin >> A[i];
ll x = A[i];
rep(j, M) {
int p = primes[j];
if (x < p) {
if (factor[x] == 0)
factor[x] = 1;
// cout << x << " 1" << endl;
break;
}
int c = 0;
while (x % p == 0) {
x /= p;
c++;
// cout << "x=" << x << ", p=" << p << ", c=" << c << endl;
}
if (c > factor[p])
factor[p] = c;
// cout << A[i] << " " << primes[j] << " " << c << endl;
}
}
/*
rep(i, M) {
if (factor[primes[i]] != 0) cout << primes[i] << " " << factor[primes[i]]
<< endl;
}
*/
ll lc = 1;
rep(i, M) {
rep(j, factor[primes[i]]) { lc = (lc * primes[i]) % MOD; }
}
// cout << lc << endl;
ll ans = 0;
rep(i, N) { ans = (ans + lc * mod_pow(A[i], MOD - 2, MOD)) % 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;
const ll MOD = 1e9 + 7;
ll mod_pow(ll x, ll n, ll mod) {
ll res = 1;
while (n > 0) {
if (n & 1)
res = res * x % mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
ll gcd(ll x, ll y) {
if (y == 0)
return x;
return gcd(y, x % y);
}
int main() {
vector<bool> prime(1000001, true);
for (int i = 2; i < 1000; i++) {
if (prime[i]) {
for (int j = i * 2; j < 1000001; j += i)
prime[j] = false;
}
}
vector<ll> primes(0);
for (int i = 2; i < 1000000; i++) {
if (prime[i])
primes.push_back(i);
}
int M = primes.size();
// rep(i, 100) cout << primes[i] << " ";
// cout << endl;
int N;
cin >> N;
vector<ll> A(N), factor(1000000, 0);
rep(i, N) {
cin >> A[i];
ll x = A[i];
rep(j, M) {
int p = primes[j];
if (A[i] < p * p) {
if (factor[x] == 0)
factor[x] = 1;
// cout << x << " 1" << endl;
break;
}
int c = 0;
while (x % p == 0) {
x /= p;
c++;
// cout << "x=" << x << ", p=" << p << ", c=" << c << endl;
}
if (c > factor[p])
factor[p] = c;
// cout << A[i] << " " << primes[j] << " " << c << endl;
}
}
/*
rep(i, M) {
if (factor[primes[i]] != 0) cout << primes[i] << " " << factor[primes[i]]
<< endl;
}
*/
ll lc = 1;
rep(i, M) {
rep(j, factor[primes[i]]) { lc = (lc * primes[i]) % MOD; }
}
// cout << lc << endl;
ll ans = 0;
rep(i, N) { ans = (ans + lc * mod_pow(A[i], MOD - 2, MOD)) % MOD; }
cout << ans << endl;
} | replace | 48 | 49 | 48 | 49 | TLE | |
p02793 | C++ | Time Limit Exceeded | #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for (int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
const int MOD = 1e9 + 7;
template <class T> T gcd(T a, T b) { return ((b == 0) ? a : gcd(b, a % b)); }
ll mypow(ll a, ll p) {
if (p == 0)
return 1;
if (p == 1)
return (a % MOD);
if (p & 1)
return ((a % MOD) * (mypow(a, p - 1) % MOD)) % MOD;
ll x = mypow(a, p / 2) % MOD;
return (x * x) % MOD;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// freopen("input.in", "r", stdin);
// freopen("output.out", "w", stdout);
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
map<int, int> superNum;
rep(i, n) {
int num = a[i];
for (int j = 2; (j * j) <= num; j++) {
int cnt = 0;
while (num % j == 0) {
num /= j;
cnt++;
}
if (cnt)
superNum[j] = max(superNum[j], cnt);
}
if (num > 1)
superNum[num] = max(superNum[num], 1);
}
ll ans = 0;
rep(i, n) {
int num = a[i];
ll cur = 1LL;
for (int j = 2; (j * j) <= num; j++)
if (num % j == 0) {
int cnt = 0;
while (num % j == 0) {
num /= j;
cnt++;
}
(cur *= mypow(j, superNum[j] - cnt)) %= MOD;
}
if (num > 1) {
(cur *= mypow(num, superNum[num] - 1)) %= MOD;
}
for (pi x : superNum) {
if (a[i] % x.fi != 0) {
(cur *= mypow(x.fi, x.se)) %= MOD;
}
}
ans += cur;
}
cout << (ans % MOD) << endl;
return 0;
}
/*
Things to look out for:
- Integer overflows
- Array bounds
- Special cases
Be careful!
*/
| #pragma GCC optimize("O3")
#pragma GCC target("sse4")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<int> vi;
typedef pair<int, int> pi;
#define debug(x) cerr << #x << ": " << x << endl;
#define debug2(x, y) debug(x) debug(y);
#define repn(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, a) for (int i = 0; i < (int)(a); i++)
#define all(v) v.begin(), v.end()
#define mp make_pair
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define fi first
#define se second
#define sq(x) ((x) * (x))
const int MOD = 1e9 + 7;
template <class T> T gcd(T a, T b) { return ((b == 0) ? a : gcd(b, a % b)); }
ll mypow(ll a, ll p) {
if (p == 0)
return 1;
if (p == 1)
return (a % MOD);
if (p & 1)
return ((a % MOD) * (mypow(a, p - 1) % MOD)) % MOD;
ll x = mypow(a, p / 2) % MOD;
return (x * x) % MOD;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
// freopen("input.in", "r", stdin);
// freopen("output.out", "w", stdout);
int n;
cin >> n;
vi a(n);
rep(i, n) cin >> a[i];
unordered_map<int, int> superNum;
rep(i, n) {
int num = a[i];
for (int j = 2; (j * j) <= num; j++) {
int cnt = 0;
while (num % j == 0) {
num /= j;
cnt++;
}
if (cnt)
superNum[j] = max(superNum[j], cnt);
}
if (num > 1)
superNum[num] = max(superNum[num], 1);
}
ll ans = 0;
rep(i, n) {
int num = a[i];
ll cur = 1LL;
for (int j = 2; (j * j) <= num; j++)
if (num % j == 0) {
int cnt = 0;
while (num % j == 0) {
num /= j;
cnt++;
}
(cur *= mypow(j, superNum[j] - cnt)) %= MOD;
}
if (num > 1) {
(cur *= mypow(num, superNum[num] - 1)) %= MOD;
}
for (pi x : superNum) {
if (a[i] % x.fi != 0) {
(cur *= mypow(x.fi, x.se)) %= MOD;
}
}
ans += cur;
}
cout << (ans % MOD) << endl;
return 0;
}
/*
Things to look out for:
- Integer overflows
- Array bounds
- Special cases
Be careful!
*/
| replace | 44 | 45 | 44 | 45 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(a, b, c) for (int a = b; a <= c; a++)
#define per(a, b, c) for (int a = b; a >= c; a--)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define inf 0x3f3f3f3f
#define eps 1e-11
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef double db;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
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); }
inline ll qsm(ll x, ll y) {
ll res = 1;
while (y) {
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
int n, m, k, rt;
int isp[N], num[N], cnt;
ll a[N], b[N];
ll inv[N];
void prime() {
isp[cnt++] = 2;
for (int i = 2; i < N; i++) {
int flag = 0;
for (int j = 2; j <= sqrt(i * 1.0) + 1; j++) {
if (i % j == 0) {
flag = 1;
break;
}
}
if (!flag)
isp[cnt++] = i;
}
}
int main() {
prime();
inv[1] = 1;
rep(i, 2, 1000000) inv[i] = inv[mod % i] * (mod - mod / i) % mod;
scanf("%d", &n);
int bitgest;
rep(i, 1, n) {
scanf("%lld", &a[i]);
b[i] = a[i];
int tot;
rep(j, 0, cnt - 1) {
tot = 0;
while (a[i] % isp[j] == 0) {
a[i] /= isp[j];
tot++;
}
if (tot > num[j])
num[j] = tot;
}
if (a[i] > 1) {
num[cnt] = 1;
isp[cnt] = a[i];
++cnt;
}
}
ll res = 1;
rep(i, 0, cnt - 1) {
if (num[i]) {
rep(j, 1, num[i]) res = res * isp[i] % mod;
}
}
ll ans = 0;
rep(i, 1, n) ans = (ans + res % mod * inv[b[i]] % mod) % mod;
printf("%lld\n", ans);
return 0;
}
//
// _ooOoo_
// o8888888o
// 88" . "88
// (| -_- |)
// O\ = /O
// ____/`---'\____
// .' \| |// `.
// / \||| : |||// \
// / _||||| -:- |||||- \
// | | \ - /// | |
// | \_| ''\---/'' | |
// \ .-\__ `-` ___/-. /
// ___`. .' /--.--\ `. . __
// ."" '< `.___\_<|>_/___.' >'"".
// | | : `- \`.;`\ _ /`;.`/ - ` : | |
// \ \ `-. \_ __\ /__ _/ .-` / /
// ======`-.____`-.___\_____/___.-`____.-'======
// `=---='
// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
// 佛祖保佑 永无BUG
| #include <bits/stdc++.h>
#define rep(a, b, c) for (int a = b; a <= c; a++)
#define per(a, b, c) for (int a = b; a >= c; a--)
#define pb push_back
#define mk make_pair
#define pii pair<int, int>
#define mem(a, b) memset(a, b, sizeof(a))
#define inf 0x3f3f3f3f
#define eps 1e-11
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef double db;
const int mod = 1e9 + 7;
const int N = 1e6 + 5;
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); }
inline ll qsm(ll x, ll y) {
ll res = 1;
while (y) {
if (y & 1)
res = res * x % mod;
x = x * x % mod;
y >>= 1;
}
return res;
}
int n, m, k, rt;
int isp[N], num[N], cnt;
ll a[N], b[N];
ll inv[N];
void prime() {
isp[cnt++] = 2;
for (int i = 2; i < 1000; i++) {
int flag = 0;
for (int j = 2; j <= sqrt(i * 1.0) + 1; j++) {
if (i % j == 0) {
flag = 1;
break;
}
}
if (!flag)
isp[cnt++] = i;
}
}
int main() {
prime();
inv[1] = 1;
rep(i, 2, 1000000) inv[i] = inv[mod % i] * (mod - mod / i) % mod;
scanf("%d", &n);
int bitgest;
rep(i, 1, n) {
scanf("%lld", &a[i]);
b[i] = a[i];
int tot;
rep(j, 0, cnt - 1) {
tot = 0;
while (a[i] % isp[j] == 0) {
a[i] /= isp[j];
tot++;
}
if (tot > num[j])
num[j] = tot;
}
if (a[i] > 1) {
num[cnt] = 1;
isp[cnt] = a[i];
++cnt;
}
}
ll res = 1;
rep(i, 0, cnt - 1) {
if (num[i]) {
rep(j, 1, num[i]) res = res * isp[i] % mod;
}
}
ll ans = 0;
rep(i, 1, n) ans = (ans + res % mod * inv[b[i]] % mod) % mod;
printf("%lld\n", ans);
return 0;
}
//
// _ooOoo_
// o8888888o
// 88" . "88
// (| -_- |)
// O\ = /O
// ____/`---'\____
// .' \| |// `.
// / \||| : |||// \
// / _||||| -:- |||||- \
// | | \ - /// | |
// | \_| ''\---/'' | |
// \ .-\__ `-` ___/-. /
// ___`. .' /--.--\ `. . __
// ."" '< `.___\_<|>_/___.' >'"".
// | | : `- \`.;`\ _ /`;.`/ - ` : | |
// \ \ `-. \_ __\ /__ _/ .-` / /
// ======`-.____`-.___\_____/___.-`____.-'======
// `=---='
// ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
// 佛祖保佑 永无BUG
| replace | 33 | 34 | 33 | 34 | TLE | |
p02793 | C++ | Time Limit Exceeded | #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)
#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"
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> std::vector<T> vec(int l, T e) {
return std::vector<T>(l, e);
}
template <typename T> using MaxHeap = std::priority_queue<T>;
template <typename T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <typename T> inline void chmax(T &a, T b) { a = std::max(a, b); }
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;
struct Prime {
int max_check;
int max_prime;
int prime_number;
vector<int> primes;
map<int, int> prime_id;
Prime(){};
Prime(int m) { initialize(m); };
void initialize(int m) {
sieve(m);
prime_number = (int)primes.size();
max_check = m;
}
void sieve(int m) {
max_prime = 2;
deque<bool> is_prime(m + 1, true);
is_prime[0] = is_prime[1] = false;
int i;
for (i = 2; i <= m; ++i) {
if (!is_prime[i]) {
continue;
}
if (i * i > m) {
break;
}
for (int j = i * 2; j <= m; j += i) {
is_prime[j] = false;
}
prime_id[i] = (int)primes.size();
primes.push_back(i);
max_prime = i;
}
for (int j = i; j <= m; ++j) {
if (!is_prime[j]) {
continue;
}
prime_id[j] = (int)primes.size();
primes.push_back(j);
max_prime = j;
}
}
unordered_map<int, int> prime_factor(ll x) {
unordered_map<int, int> ret;
if ((ll)max_check * (ll)max_check < x) {
return ret;
}
for (int i = 0; i < prime_number; ++i) {
if (x == 1) {
break;
}
while (x % primes[i] == 0) {
x /= primes[i];
ret[primes[i]] += 1;
}
}
if (x != 1) {
ret[x] += 1;
}
return ret;
}
};
int 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;
}
int main() {
int n;
scan(n);
vi a(n);
scan(a);
Prime pr(1000000);
// cout << pr.primes;
unordered_map<int, int> lcm;
rep(i, n) {
auto pf = pr.prime_factor(a[i]);
for (auto p : pf) {
chmax(lcm[p.first], p.second);
}
}
ll l = 1;
for (auto p : lcm) {
l = l * po(p.first, p.second) % mod;
}
ll ans = 0;
rep(i, n) {
ans = ans + po(a[i], mod - 2);
if (ans >= mod) {
ans -= mod;
}
}
ans = ans * l % mod;
print(ans);
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)
#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"
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> std::vector<T> vec(int l, T e) {
return std::vector<T>(l, e);
}
template <typename T> using MaxHeap = std::priority_queue<T>;
template <typename T>
using MinHeap = std::priority_queue<T, std::vector<T>, std::greater<T>>;
template <typename T> inline void chmax(T &a, T b) { a = std::max(a, b); }
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;
struct Prime {
int max_check;
int max_prime;
int prime_number;
vector<int> primes;
map<int, int> prime_id;
Prime(){};
Prime(int m) { initialize(m); };
void initialize(int m) {
sieve(m);
prime_number = (int)primes.size();
max_check = m;
}
void sieve(int m) {
max_prime = 2;
deque<bool> is_prime(m + 1, true);
is_prime[0] = is_prime[1] = false;
int i;
for (i = 2; i <= m; ++i) {
if (!is_prime[i]) {
continue;
}
if (i * i > m) {
break;
}
for (int j = i * 2; j <= m; j += i) {
is_prime[j] = false;
}
prime_id[i] = (int)primes.size();
primes.push_back(i);
max_prime = i;
}
for (int j = i; j <= m; ++j) {
if (!is_prime[j]) {
continue;
}
prime_id[j] = (int)primes.size();
primes.push_back(j);
max_prime = j;
}
}
unordered_map<int, int> prime_factor(ll x) {
unordered_map<int, int> ret;
if ((ll)max_check * (ll)max_check < x) {
return ret;
}
for (int i = 0; i < prime_number; ++i) {
if (x == 1) {
break;
}
while (x % primes[i] == 0) {
x /= primes[i];
ret[primes[i]] += 1;
}
}
if (x != 1) {
ret[x] += 1;
}
return ret;
}
};
int 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;
}
int main() {
int n;
scan(n);
vi a(n);
scan(a);
Prime pr(2000);
unordered_map<int, int> lcm;
rep(i, n) {
auto pf = pr.prime_factor(a[i]);
for (auto p : pf) {
chmax(lcm[p.first], p.second);
}
}
ll l = 1;
for (auto p : lcm) {
l = l * po(p.first, p.second) % mod;
}
ll ans = 0;
rep(i, n) {
ans = ans + po(a[i], mod - 2);
if (ans >= mod) {
ans -= mod;
}
}
ans = ans * l % mod;
print(ans);
return 0;
}
| replace | 210 | 212 | 210 | 211 | TLE | |
p02793 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long maxn = 1e4 + 10;
long long n;
long long ans;
long long lca;
long long a[maxn];
long long alpha[maxn];
void in();
void solve();
void upd_lca(long long);
long long pwr(long long, long long);
void out();
int main() {
in();
solve();
out();
}
void in() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
cin >> n;
for (long long i = 0; i < n; i++)
cin >> a[i];
}
void solve() {
lca = 1;
for (long long i = 0; i < n; i++)
upd_lca(a[i]);
for (long long i = 0; i < n; i++) {
ans += lca * pwr(a[i], -1) % mod;
ans %= mod;
}
}
void upd_lca(long long x) {
for (long long i = 2; i * i <= x; i++) {
long long tmp = 0;
while (x % i == 0) {
tmp++;
x /= i;
}
if (tmp > alpha[i]) {
lca = lca * pwr(i, tmp - alpha[i]) % mod;
alpha[i] = tmp;
}
}
if (x != 1) {
if (1 > alpha[x]) {
lca = lca * pwr(x, 1 - alpha[x]) % mod;
alpha[x] = 1;
}
}
}
long long pwr(long long a, long long b) {
if (b < 0)
return pwr(a, b + mod - 1);
if (b == 0)
return 1;
long long c = pwr(a, b / 2);
if (b % 2)
return c * c % mod * a % mod;
return c * c % mod;
}
void out() { cout << ans; }
| #include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long maxn = 1e6 + 10;
long long n;
long long ans;
long long lca;
long long a[maxn];
long long alpha[maxn];
void in();
void solve();
void upd_lca(long long);
long long pwr(long long, long long);
void out();
int main() {
in();
solve();
out();
}
void in() {
ios::sync_with_stdio(false);
cout.tie(0);
cin.tie(0);
cin >> n;
for (long long i = 0; i < n; i++)
cin >> a[i];
}
void solve() {
lca = 1;
for (long long i = 0; i < n; i++)
upd_lca(a[i]);
for (long long i = 0; i < n; i++) {
ans += lca * pwr(a[i], -1) % mod;
ans %= mod;
}
}
void upd_lca(long long x) {
for (long long i = 2; i * i <= x; i++) {
long long tmp = 0;
while (x % i == 0) {
tmp++;
x /= i;
}
if (tmp > alpha[i]) {
lca = lca * pwr(i, tmp - alpha[i]) % mod;
alpha[i] = tmp;
}
}
if (x != 1) {
if (1 > alpha[x]) {
lca = lca * pwr(x, 1 - alpha[x]) % mod;
alpha[x] = 1;
}
}
}
long long pwr(long long a, long long b) {
if (b < 0)
return pwr(a, b + mod - 1);
if (b == 0)
return 1;
long long c = pwr(a, b / 2);
if (b % 2)
return c * c % mod * a % mod;
return c * c % mod;
}
void out() { cout << ans; }
| replace | 4 | 5 | 4 | 5 | 0 | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define lli long long int
#define rep(i, a, b) for (i = a; i < b; i++)
#define M 1000000007
#define vll vector<long long int>
#define mll map<long long int, long long int>
#define pi 3.1415926535897932384626433832795028841971
using namespace std;
lli mpower(lli a, lli b, lli m) {
if (b == 0)
return 1;
if (b == 1)
return a % m;
lli res = 1;
a = a % m;
while (b) {
if (b & 1) {
res = (res * a) % m;
}
a = ((a % m) * (a % m)) % m;
b >>= 1;
}
return res;
}
long long int spf[1000005];
void SPF() {
long long int i, j;
spf[0] = 1;
for (i = 1; i <= 1000004; i++)
spf[i] = i;
for (i = 2; i <= 1000004; i++) {
if (spf[i] == i) {
for (j = i * i; j <= 1000004; j += i) {
spf[j] = min(i, spf[j]);
}
}
}
}
mll ma;
mll::iterator et;
lli mlcm(vll v, lli n) {
lli i, num, factor, ans = 1;
for (i = 0; i < n; i++) {
num = v[i];
mll temp;
mll::iterator it;
while (num > 1) {
temp[spf[num]]++;
num /= spf[num];
}
for (it = temp.begin(); it != temp.end(); ++it) {
ma[it->first] = max(ma[it->first], it->second);
}
}
for (et = ma.begin(); et != ma.end(); ++et) {
ans = (ans * mpower(et->first, et->second, M)) % M;
}
return ans;
}
lli imod(lli a, lli m) {
lli i = 1;
a = a % m;
for (i = 1; i < m; i++) {
if ((a * i) % m == 1)
return i;
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
char ch, ch1, ch2;
string s1, s2, s3;
lli i, j, k, s, a, b, t, c, n, m, sum = 0, ans = 0, temp;
cin >> n;
vll v(n);
rep(i, 0, n) cin >> v[i];
SPF();
a = mlcm(v, n);
for (i = 0; i < n; i++) {
temp = a * imod(v[i], M);
ans += (temp);
ans %= M;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define lli long long int
#define rep(i, a, b) for (i = a; i < b; i++)
#define M 1000000007
#define vll vector<long long int>
#define mll map<long long int, long long int>
#define pi 3.1415926535897932384626433832795028841971
using namespace std;
lli mpower(lli a, lli b, lli m) {
if (b == 0)
return 1;
if (b == 1)
return a % m;
lli res = 1;
a = a % m;
while (b) {
if (b & 1) {
res = (res * a) % m;
}
a = ((a % m) * (a % m)) % m;
b >>= 1;
}
return res;
}
long long int spf[1000005];
void SPF() {
long long int i, j;
spf[0] = 1;
for (i = 1; i <= 1000004; i++)
spf[i] = i;
for (i = 2; i <= 1000004; i++) {
if (spf[i] == i) {
for (j = i * i; j <= 1000004; j += i) {
spf[j] = min(i, spf[j]);
}
}
}
}
mll ma;
mll::iterator et;
lli mlcm(vll v, lli n) {
lli i, num, factor, ans = 1;
for (i = 0; i < n; i++) {
num = v[i];
mll temp;
mll::iterator it;
while (num > 1) {
temp[spf[num]]++;
num /= spf[num];
}
for (it = temp.begin(); it != temp.end(); ++it) {
ma[it->first] = max(ma[it->first], it->second);
}
}
for (et = ma.begin(); et != ma.end(); ++et) {
ans = (ans * mpower(et->first, et->second, M)) % M;
}
return ans;
}
lli imod(lli a, lli m) {
lli g;
return mpower(a, m - 2, m);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
char ch, ch1, ch2;
string s1, s2, s3;
lli i, j, k, s, a, b, t, c, n, m, sum = 0, ans = 0, temp;
cin >> n;
vll v(n);
rep(i, 0, n) cin >> v[i];
SPF();
a = mlcm(v, n);
for (i = 0; i < n; i++) {
temp = a * imod(v[i], M);
ans += (temp);
ans %= M;
}
cout << ans << endl;
return 0;
}
| replace | 64 | 70 | 64 | 66 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ << ": "; \
dbgprint(#__VA_ARGS__, __VA_ARGS__); \
} while (0);
using namespace std;
namespace std {
template <class S, class T> struct hash<pair<S, T>> {
size_t operator()(const pair<S, T> &p) const {
return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
}
};
template <class T> struct hash<vector<T>> {
size_t operator()(const vector<T> &v) const {
size_t h = 0;
for (auto i : v)
h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
return h;
}
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[ ";
rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "{ ";
for (const auto &i : v)
os << i << ", ";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
os << "{";
for (const auto &i : v)
os << " " << i.first << ": " << i.second << ",";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
const int mod = 1e9 + 7;
ll pw(ll n, ll m) {
ll res = 1;
for (; m; m /= 2) {
if (m & 1)
res = res * n % mod;
n = n * n % mod;
}
return res;
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n;
cin >> n;
vector<map<int, int>> f(n);
map<int, int> m;
rep(i, n) {
int a;
cin >> a;
for (int j = 2; j * j <= a; j++)
if (a % j == 0) {
int k = 0;
for (; a % j == 0; a /= j)
k++;
f[i][j] = k;
}
if (a > 1)
f[i][a]++;
for (const auto &j : f[i])
m[j.first] = max(m[j.first], j.second);
}
ll ans = 0;
rep(i, n) {
ll p = 1;
for (const auto &j : m) {
const auto k = f[i].find(j.first);
p = p * pw(j.first, j.second - (k == f[i].end() ? 0 : k->second)) % mod;
}
ans += p;
}
cout << ans % mod << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)n; i++)
#define all(c) (c).begin(), (c).end()
#define pb push_back
#define dbg(...) \
do { \
cerr << __LINE__ << ": "; \
dbgprint(#__VA_ARGS__, __VA_ARGS__); \
} while (0);
using namespace std;
namespace std {
template <class S, class T> struct hash<pair<S, T>> {
size_t operator()(const pair<S, T> &p) const {
return ((size_t)1e9 + 7) * hash<S>()(p.first) + hash<T>()(p.second);
}
};
template <class T> struct hash<vector<T>> {
size_t operator()(const vector<T> &v) const {
size_t h = 0;
for (auto i : v)
h = h * ((size_t)1e9 + 7) + hash<T>()(i) + 1;
return h;
}
};
} // namespace std
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
os << "[ ";
rep(i, v.size()) os << v[i] << (i == v.size() - 1 ? " ]" : ", ");
return os;
}
template <class T> ostream &operator<<(ostream &os, const set<T> &v) {
os << "{ ";
for (const auto &i : v)
os << i << ", ";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const map<T, U> &v) {
os << "{";
for (const auto &i : v)
os << " " << i.first << ": " << i.second << ",";
return os << "}";
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << "(" << p.first << ", " << p.second << ")";
}
void dbgprint(const string &fmt) { cerr << endl; }
template <class H, class... T>
void dbgprint(const string &fmt, const H &h, const T &...r) {
cerr << fmt.substr(0, fmt.find(",")) << "= " << h << " ";
dbgprint(fmt.substr(fmt.find(",") + 1), r...);
}
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pi;
const int inf = (int)1e9;
const double INF = 1e12, EPS = 1e-9;
const int mod = 1e9 + 7;
ll pw(ll n, ll m) {
ll res = 1;
for (; m; m /= 2) {
if (m & 1)
res = res * n % mod;
n = n * n % mod;
}
return res;
}
int main() {
cin.tie(0);
cin.sync_with_stdio(0);
int n;
cin >> n;
vector<unordered_map<int, int>> f(n);
unordered_map<int, int> m;
rep(i, n) {
int a;
cin >> a;
for (int j = 2; j * j <= a; j++)
if (a % j == 0) {
int k = 0;
for (; a % j == 0; a /= j)
k++;
f[i][j] = k;
}
if (a > 1)
f[i][a]++;
for (const auto &j : f[i])
m[j.first] = max(m[j.first], j.second);
}
ll ans = 0;
rep(i, n) {
ll p = 1;
for (const auto &j : m) {
const auto k = f[i].find(j.first);
p = p * pw(j.first, j.second - (k == f[i].end() ? 0 : k->second)) % mod;
}
ans += p;
}
cout << ans % mod << endl;
return 0;
} | replace | 76 | 78 | 76 | 78 | TLE | |
p02793 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9 + 7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define ANS(n) cout << (n) << "\n"
#define REP(i, n) for (int64 i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define FORR(i, a, b) for (int64 i = (a); i >= (b); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define pii pair<int32, int32>
#define pll pair<int64, int64>
#define pb(a) push_back(a)
#define mp make_pair
int64 modpow(int64 a, int64 r) {
if (r == 0)
return 1;
if (r % 2 == 0) {
int64 x = modpow(a, r / 2);
return x * x % MOD;
} else {
return modpow(a, r - 1) * a % MOD;
}
}
// int64 gcd(int64 a, int64 b){
// if(b == 0)return a;
// return gcd(b, a % b);
// }
// int64 lcm(int64 a, int64 b){
// return a / gcd(a, b) * b;
// }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int32 n;
cin >> n;
vector<int64> a(n);
// int64 l = 1;
map<int32, int32> factors;
REP(i, n) {
cin >> a[i];
// l = lcm(l, a[i]);
map<int32, int32> m;
int64 b = a[i];
int64 p = 2;
while (b >= 2) {
// cout << b << endl;
if (b % p == 0) {
m[p]++;
b /= p;
} else {
factors[p] = max(factors[p], m[p]);
p++;
}
}
factors[p] = max(factors[p], m[p]);
}
int64 l = 1;
for (pii p : factors) {
// cout << p.first << " " << p.second << endl;
l *= modpow(p.first, p.second);
l %= MOD;
}
// cout << l << endl;
int64 ans = 0;
REP(i, n) {
// cout << g * modpow(a[i] , MOD-2) % MOD << endl;
ans += l * modpow(a[i], MOD - 2) % MOD;
ans %= MOD;
}
ANS(ans);
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using int32 = int_fast32_t;
using int64 = int_fast64_t;
const int32 INF = 1e9;
const int32 MOD = 1e9 + 7;
const int64 LLINF = 1e18;
#define YES(n) cout << ((n) ? "YES\n" : "NO\n")
#define Yes(n) cout << ((n) ? "Yes\n" : "No\n")
#define ANS(n) cout << (n) << "\n"
#define REP(i, n) for (int64 i = 0; i < (n); ++i)
#define FOR(i, a, b) for (int64 i = (a); i < (b); i++)
#define FORR(i, a, b) for (int64 i = (a); i >= (b); i--)
#define ALL(obj) (obj).begin(), (obj).end()
#define pii pair<int32, int32>
#define pll pair<int64, int64>
#define pb(a) push_back(a)
#define mp make_pair
int64 modpow(int64 a, int64 r) {
if (r == 0)
return 1;
if (r % 2 == 0) {
int64 x = modpow(a, r / 2);
return x * x % MOD;
} else {
return modpow(a, r - 1) * a % MOD;
}
}
// int64 gcd(int64 a, int64 b){
// if(b == 0)return a;
// return gcd(b, a % b);
// }
// int64 lcm(int64 a, int64 b){
// return a / gcd(a, b) * b;
// }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int32 n;
cin >> n;
vector<int64> a(n);
// int64 l = 1;
map<int32, int32> factors;
REP(i, n) {
cin >> a[i];
// l = lcm(l, a[i]);
map<int32, int32> m;
int64 b = a[i];
int64 p = 2;
while (b >= 2) {
// cout << b << endl;
if (b % p == 0) {
m[p]++;
b /= p;
} else {
factors[p] = max(factors[p], m[p]);
if (p * p > b) {
p = b;
} else {
p++;
}
}
}
factors[p] = max(factors[p], m[p]);
}
int64 l = 1;
for (pii p : factors) {
// cout << p.first << " " << p.second << endl;
l *= modpow(p.first, p.second);
l %= MOD;
}
// cout << l << endl;
int64 ans = 0;
REP(i, n) {
// cout << g * modpow(a[i] , MOD-2) % MOD << endl;
ans += l * modpow(a[i], MOD - 2) % MOD;
ans %= MOD;
}
ANS(ans);
return 0;
} | replace | 63 | 64 | 63 | 68 | TLE | |
p02794 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; ++A)
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, M;
vector<pll> abv[55];
ll mk[22];
ll dp[50][1 << 21];
ll i, j, k;
bool dfs(ll a, ll p, ll g, ll l) {
if (g == a) {
return true;
}
ll i = 0, j = 0;
fornum(i, 0, abv[a].size()) {
ll b = abv[a][i].first;
if (b == p) {
continue;
}
if (dfs(b, a, g, l)) {
mk[l] |= (1ll << abv[a][i].second);
return true;
}
}
return false;
}
int main() {
scanf("%lld", &N);
fornum(i, 1, N) {
ll a, b;
scanf("%lld%lld", &a, &b);
abv[a].push_back({b, i});
abv[b].push_back({a, i});
}
scanf("%lld", &M);
fornum(i, 0, M) {
ll u, v;
scanf("%lld%lld", &u, &v);
dfs(u, 0, v, i);
}
/*
fornum(i,0,M){
printf("%lld\n", mk[i]);
}*/
dp[1][0] = 1;
fornum(i, 1, N) {
ll a = 0;
fornum(j, 0, M) {
if (mk[j] & (1ll << i))
a |= 1ll << j;
}
fornum(j, 0, 1 << M) {
// printf("%lld ", dp[i][j]);
ll b = j | a;
dp[i + 1][j] += dp[i][j];
dp[i + 1][b] += dp[i][j];
}
// printf("\n");
}
printf("%lld", dp[N][(1ll << M) - 1]);
return 0;
} | #include <bits/stdc++.h>
#define ll long long
#define fornum(A, B, C) for (A = B; A < C; ++A)
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
/////////////////////////////////////////////////////
ll N, M;
vector<pll> abv[55];
ll mk[55];
ll dp[55][1 << 21];
ll i, j, k;
bool dfs(ll a, ll p, ll g, ll l) {
if (g == a) {
return true;
}
ll i = 0, j = 0;
fornum(i, 0, abv[a].size()) {
ll b = abv[a][i].first;
if (b == p) {
continue;
}
if (dfs(b, a, g, l)) {
mk[l] |= (1ll << abv[a][i].second);
return true;
}
}
return false;
}
int main() {
scanf("%lld", &N);
fornum(i, 1, N) {
ll a, b;
scanf("%lld%lld", &a, &b);
abv[a].push_back({b, i});
abv[b].push_back({a, i});
}
scanf("%lld", &M);
fornum(i, 0, M) {
ll u, v;
scanf("%lld%lld", &u, &v);
dfs(u, 0, v, i);
}
/*
fornum(i,0,M){
printf("%lld\n", mk[i]);
}*/
dp[1][0] = 1;
fornum(i, 1, N) {
ll a = 0;
fornum(j, 0, M) {
if (mk[j] & (1ll << i))
a |= 1ll << j;
}
fornum(j, 0, 1 << M) {
// printf("%lld ", dp[i][j]);
ll b = j | a;
dp[i + 1][j] += dp[i][j];
dp[i + 1][b] += dp[i][j];
}
// printf("\n");
}
printf("%lld", dp[N][(1ll << M) - 1]);
return 0;
} | replace | 13 | 15 | 13 | 15 | -11 | |
p02794 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdexcept>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
struct Edge {
int id;
int to;
};
using Graph = vector<vector<Edge>>;
Graph g;
int mask[20];
int dp[1 << 20];
bool dfs(int v, int pre, int dest, int bit) {
if (v == dest)
return true;
for (auto &e : g[v]) {
if (e.to == pre)
continue;
bool ret = dfs(e.to, v, dest, bit);
if (ret) {
mask[e.id] |= bit;
return true;
}
}
return false;
}
int main() {
int n;
cin >> n;
g.resize(n);
for (int i = 0; i + 1 < n; i++) {
int a, b;
cin >> a >> b;
a--, b--;
g[a].push_back({i, b});
g[b].push_back({i, a});
}
int m;
cin >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
dfs(u, -1, v, 1 << i);
}
dp[0] = 1;
for (int i = 0; i < n - 1; i++) {
for (int j = (1 << m) - 1; j >= 0; j--) {
dp[j | mask[i]] += dp[j];
}
}
cout << dp[(1 << m) - 1] << endl;
return 0;
}
| #include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <stdexcept>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using ll = long long;
struct Edge {
int id;
int to;
};
using Graph = vector<vector<Edge>>;
Graph g;
int mask[50];
ll dp[1 << 20];
bool dfs(int v, int pre, int dest, int bit) {
if (v == dest)
return true;
for (auto &e : g[v]) {
if (e.to == pre)
continue;
bool ret = dfs(e.to, v, dest, bit);
if (ret) {
mask[e.id] |= bit;
return true;
}
}
return false;
}
int main() {
int n;
cin >> n;
g.resize(n);
for (int i = 0; i + 1 < n; i++) {
int a, b;
cin >> a >> b;
a--, b--;
g[a].push_back({i, b});
g[b].push_back({i, a});
}
int m;
cin >> m;
for (int i = 0; i < m; i++) {
int u, v;
cin >> u >> v;
u--, v--;
dfs(u, -1, v, 1 << i);
}
dp[0] = 1;
for (int i = 0; i < n - 1; i++) {
for (int j = (1 << m) - 1; j >= 0; j--) {
dp[j | mask[i]] += dp[j];
}
}
cout << dp[(1 << m) - 1] << endl;
return 0;
}
| replace | 35 | 37 | 35 | 37 | 0 | |
p02794 | C++ | Runtime Error | // QWsin
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define rep(i, x, y) for (int i = x; i <= y; ++i)
#define out(i, u) for (int i = first[u]; i != -1; i = nxt[i])
#define repvc(i, vc) for (int i = 0, Sz = vc.size(); i < Sz; ++i)
using namespace std;
inline int read() {
char ch = getchar();
int ret = 0, f = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
for (; ch >= '0' && ch <= '9'; ch = getchar())
ret = ret * 10 + ch - '0';
return ret * f;
}
typedef long long ll;
const int INF = 1 << 30;
const int maxn = 50 + 10;
const int maxm = 100 + 10;
int first[maxn], nxt[maxn], ecnt;
struct Edge {
int u, v;
Edge(int u = 0, int v = 0) : u(u), v(v) {}
} e[maxm];
void add_edge(int u, int v) {
nxt[ecnt] = first[u];
first[u] = ecnt;
e[ecnt++] = Edge(u, v);
nxt[ecnt] = first[v];
first[v] = ecnt;
e[ecnt++] = Edge(v, u);
}
int d[maxn];
int bit(int x) { return 1 << x; }
int dep[maxn], fa[maxn];
void dfs(int u, int pre) {
dep[u] = dep[pre] + 1;
fa[u] = pre;
for (int i = first[u]; i != -1; i = nxt[i]) {
int v = e[i].v;
if (v == pre)
continue;
dfs(v, u);
}
}
int LCA(int a, int b) {
if (dep[a] > dep[b])
swap(a, b);
while (dep[a] < dep[b])
b = fa[b];
while (a != b)
a = fa[a], b = fa[b];
return a;
}
struct LIM {
int a, b, lca;
void input() {
cin >> a >> b;
lca = LCA(a, b);
}
} lim[maxn];
int tag = 0;
int dfs2(int u) {
int ret = d[u];
for (int i = first[u]; i != -1; i = nxt[i]) {
int v = e[i].v;
if (v == fa[u])
continue;
int t = dfs2(v);
if (t > 0)
++tag;
ret += t;
}
return ret;
}
int main() {
int n;
cin >> n;
rep(i, 1, n) first[i] = -1;
rep(i, 1, n - 1) {
int u, v;
cin >> u >> v;
add_edge(u, v);
}
int m;
cin >> m;
dfs(1, 1);
rep(i, 1, m) lim[i].input();
ll ans = 1ll << (n - 1);
for (int S = 1; S < (1 << m); ++S) {
int v = 1;
rep(i, 1, n) d[i] = 0;
for (int i = 1; i <= m; ++i)
if (bit(i - 1) & S) {
v *= -1;
++d[lim[i].a];
++d[lim[i].b];
d[lim[i].lca] -= 2;
}
tag = 0;
dfs2(1);
ans += v * (1ll << (n - 1 - tag));
}
cout << ans << endl;
return 0;
}
| // QWsin
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>
#define rep(i, x, y) for (int i = x; i <= y; ++i)
#define out(i, u) for (int i = first[u]; i != -1; i = nxt[i])
#define repvc(i, vc) for (int i = 0, Sz = vc.size(); i < Sz; ++i)
using namespace std;
inline int read() {
char ch = getchar();
int ret = 0, f = 1;
while (ch < '0' || ch > '9') {
if (ch == '-')
f = -1;
ch = getchar();
}
for (; ch >= '0' && ch <= '9'; ch = getchar())
ret = ret * 10 + ch - '0';
return ret * f;
}
typedef long long ll;
const int INF = 1 << 30;
const int maxn = 50 + 10;
const int maxm = 100 + 10;
int first[maxn], nxt[maxm], ecnt;
struct Edge {
int u, v;
Edge(int u = 0, int v = 0) : u(u), v(v) {}
} e[maxm];
void add_edge(int u, int v) {
nxt[ecnt] = first[u];
first[u] = ecnt;
e[ecnt++] = Edge(u, v);
nxt[ecnt] = first[v];
first[v] = ecnt;
e[ecnt++] = Edge(v, u);
}
int d[maxn];
int bit(int x) { return 1 << x; }
int dep[maxn], fa[maxn];
void dfs(int u, int pre) {
dep[u] = dep[pre] + 1;
fa[u] = pre;
for (int i = first[u]; i != -1; i = nxt[i]) {
int v = e[i].v;
if (v == pre)
continue;
dfs(v, u);
}
}
int LCA(int a, int b) {
if (dep[a] > dep[b])
swap(a, b);
while (dep[a] < dep[b])
b = fa[b];
while (a != b)
a = fa[a], b = fa[b];
return a;
}
struct LIM {
int a, b, lca;
void input() {
cin >> a >> b;
lca = LCA(a, b);
}
} lim[maxn];
int tag = 0;
int dfs2(int u) {
int ret = d[u];
for (int i = first[u]; i != -1; i = nxt[i]) {
int v = e[i].v;
if (v == fa[u])
continue;
int t = dfs2(v);
if (t > 0)
++tag;
ret += t;
}
return ret;
}
int main() {
int n;
cin >> n;
rep(i, 1, n) first[i] = -1;
rep(i, 1, n - 1) {
int u, v;
cin >> u >> v;
add_edge(u, v);
}
int m;
cin >> m;
dfs(1, 1);
rep(i, 1, m) lim[i].input();
ll ans = 1ll << (n - 1);
for (int S = 1; S < (1 << m); ++S) {
int v = 1;
rep(i, 1, n) d[i] = 0;
for (int i = 1; i <= m; ++i)
if (bit(i - 1) & S) {
v *= -1;
++d[lim[i].a];
++d[lim[i].b];
d[lim[i].lca] -= 2;
}
tag = 0;
dfs2(1);
ans += v * (1ll << (n - 1 - tag));
}
cout << ans << endl;
return 0;
}
| replace | 28 | 29 | 28 | 29 | 0 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.