結果

問題 No.1411 Hundreds of Conditions Sequences
ユーザー tokusakuraitokusakurai
提出日時 2021-02-27 09:41:03
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 382 ms / 2,000 ms
コード長 5,207 bytes
コンパイル時間 2,172 ms
コンパイル使用メモリ 207,352 KB
最終ジャッジ日時 2025-01-19 07:44:51
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 2
other AC * 62
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
struct io_setup{
io_setup(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
template<int mod>
struct Mod_Int{
int x;
Mod_Int() : x(0) {}
Mod_Int(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
Mod_Int &operator += (const Mod_Int &p){
if((x += p.x) >= mod) x -= mod;
return *this;
}
Mod_Int &operator -= (const Mod_Int &p){
if((x += mod - p.x) >= mod) x -= mod;
return *this;
}
Mod_Int &operator *= (const Mod_Int &p){
x = (int) (1LL * x * p.x % mod);
return *this;
}
Mod_Int &operator /= (const Mod_Int &p){
*this *= p.inverse();
return *this;
}
Mod_Int &operator ++ () {return *this += Mod_Int(1);}
Mod_Int operator ++ (int){
Mod_Int tmp = *this;
++*this;
return tmp;
}
Mod_Int &operator -- () {return *this -= Mod_Int(1);}
Mod_Int operator -- (int){
Mod_Int tmp = *this;
--*this;
return tmp;
}
Mod_Int operator - () const {return Mod_Int(-x);}
Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}
Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}
Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}
Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}
bool operator == (const Mod_Int &p) const {return x == p.x;}
bool operator != (const Mod_Int &p) const {return x != p.x;}
Mod_Int inverse() const {
assert(*this != Mod_Int(0));
return pow(mod-2);
}
Mod_Int pow(long long k) const{
Mod_Int now = *this, ret = 1;
for(; k > 0; k >>= 1, now *= now){
if(k&1) ret *= now;
}
return ret;
}
friend ostream &operator << (ostream &os, const Mod_Int &p){
return os << p.x;
}
friend istream &operator >> (istream &is, Mod_Int &p){
long long a;
is >> a;
p = Mod_Int<mod>(a);
return is;
}
};
using mint = Mod_Int<MOD>;
template<typename T>
vector<T> divisors(const T &n){
vector<T> ret;
for(T i = 1; i*i <= n; i++){
if(n%i == 0){
ret.pb(i);
if(i*i != n) ret.pb(n/i);
}
}
sort(all(ret));
return ret;
}
template<typename T>
vector<pair<T, int>> prime_factor(T n){
vector<pair<T, int>> ret;
for(T i = 2; i*i <= n; i++){
int cnt = 0;
while(n%i == 0) cnt++, n /= i;
if(cnt > 0) ret.emplace_back(i, cnt);
}
if(n > 1) ret.emplace_back(n, 1);
return ret;
}
template<typename T>
bool is_prime(const T &n){
if(n == 1) return false;
for(T i = 2; i*i <= n; i++){
if(n%i == 0) return false;
}
return true;
}
vector<bool> Eratosthenes(const int &n){
vector<bool> ret(n+1, true);
if(n >= 0) ret[0] = false;
if(n >= 1) ret[1] = false;
for(int i = 2; i*i <= n; i++){
if(!ret[i]) continue;
for(int j = i+i; j <= n; j += i) ret[j] = false;
}
return ret;
}
vector<int> Eratosthenes2(const int &n){
vector<int> ret(n+1);
iota(begin(ret), end(ret), 0);
if(n >= 0) ret[0] = -1;
if(n >= 1) ret[1] = -1;
for(int i = 2; i*i <= n; i++){
if(ret[i] < i) continue;
for(int j = i+i; j <= n; j += i) ret[j] = min(ret[j], i);
}
return ret;
}
int main(){
int N; cin >> N;
int MAX = 1000000;
vector<int> cnt1(MAX+1, 0), cnt2(MAX+1, 0), id(MAX+1, -1);
vector<int> A(N);
mint ans = 1;
rep(i, N){
cin >> A[i];
for(auto &e: prime_factor(A[i])){
if(cnt1[e.first] < e.second){
id[e.first] = i;
cnt2[e.first] = cnt1[e.first];
cnt1[e.first] = e.second;
}
else if(cnt2[e.first] < e.second){
cnt2[e.first] = e.second;
}
}
ans *= A[i];
}
mint ng = 1;
rep2(i, 1, MAX){
ng *= mint(i).pow(cnt1[i]);
}
vector<vector<int>> check(N);
rep2(i, 1, MAX){
if(id[i] == -1) continue;
check[id[i]].eb(i);
}
rep(i, N){
mint tmp = 1;
for(auto &e: check[i]){
tmp *= mint(e).pow(cnt1[e]-cnt2[e]);
}
cout << (ans/A[i])-(ng/tmp) << '\n';
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0