#618222 (C++14) No.1396 Giri

• 問題: No.1396 Giri
• ユーザー: t98slider
• 提出日時: 2021-02-14 21:55:52
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 69 ms / 2,000 ms
• コード長: 5,250 bytes
• コンパイル時間: 1,530 ms
• コンパイル使用メモリ: 179,096 KB
• 実行使用メモリ: 15,232 KB
• 最終ジャッジ日時: 2024-07-22 09:29:53
• 合計ジャッジ時間: 2,966 ms
• ジャッジサーバーID （参考情報）: judge3 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	10 ms; 7,360 KB
testcase_01	AC	10 ms; 7,296 KB
testcase_02	AC	68 ms; 15,232 KB
testcase_03	AC	10 ms; 7,188 KB
testcase_04	AC	10 ms; 7,392 KB
testcase_05	AC	69 ms; 15,220 KB
testcase_06	AC	10 ms; 7,228 KB
testcase_07	AC	9 ms; 7,388 KB
testcase_08	AC	11 ms; 7,336 KB
testcase_09	AC	10 ms; 7,280 KB
testcase_10	AC	10 ms; 7,296 KB
testcase_11	AC	10 ms; 7,296 KB
testcase_12	AC	10 ms; 7,352 KB
testcase_13	AC	10 ms; 7,296 KB
testcase_14	AC	10 ms; 7,296 KB
testcase_15	AC	10 ms; 7,288 KB
testcase_16	AC	10 ms; 7,296 KB
testcase_17	AC	10 ms; 7,424 KB
testcase_18	AC	13 ms; 7,808 KB
testcase_19	AC	36 ms; 11,392 KB
testcase_20	AC	47 ms; 12,928 KB
testcase_21	AC	61 ms; 14,352 KB
testcase_22	AC	67 ms; 15,076 KB
testcase_23	AC	67 ms; 15,104 KB
testcase_24	AC	68 ms; 15,232 KB
testcase_25	AC	69 ms; 15,188 KB

ソースコード

#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define drep(i,j,n) for(int i=0;i<(int)(n-1);i++)for(int j=i+1;j<(int)(n);j++)
#define trep(i,j,k,n) for(int i=0;i<(int)(n-2);i++)for(int j=i+1;j<(int)(n-1);j++)for(int k=j+1;k<(int)(n);k++)
#define codefor int test;scanf("%d",&test);while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define yes(ans) if(ans)printf("yes\n");else printf("no\n")
#define Yes(ans) if(ans)printf("Yes\n");else printf("No\n")
#define YES(ans) if(ans)printf("YES\n");else printf("NO\n")
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
#define umap unordered_map
#define uset unordered_set
using namespace std;
using ll = long long;
const int MOD=1000000007;
const int MOD2=998244353;
const int INF=1<<30;
const ll INF2=(ll)1<<60;
//入力系
void scan(int& a){scanf("%d",&a);}
void scan(long long& a){scanf("%lld",&a);}
template<class T,class L>void scan(pair<T, L>& p){scan(p.first);scan(p.second);}
template<class T,class U,class V>void scan(tuple<T,U,V>& p){scan(get<0>(p));scan(get<1>(p));scan(get<2>(p));}
template<class T> void scan(T& a){cin>>a;}
template<class T> void scan(vector<T>& vec){for(auto&& it:vec)scan(it);}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){scan(head);in(tail...);}
//出力系
void print(const int& a){printf("%d",a);}
void print(const long long& a){printf("%lld",a);}
void print(const double& a){printf("%.15lf",a);}
template<class T,class L>void print(const pair<T, L>& p){print(p.first);putchar(' ');print(p.second);}
template<class T> void print(const T& a){cout<<a;}
template<class T> void print(const vector<T>& vec){if(vec.empty())return;print(vec[0]);for(auto it=vec.begin();++it!= vec.end();){putchar(' ');print(*it);}}
void out(){putchar('\n');}
template<class T> void out(const T& t){print(t);putchar('\n');}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){print(head);putchar(' ');out(tail...);}
//デバッグ系
template<class T> void dprint(const T& a){cerr<<a;}
template<class T> void dprint(const vector<T>& vec){if(vec.empty())return;cerr<<vec[0];for(auto it=vec.begin();++it!= vec.end();){cerr<<" "<<*it;}}
void debug(){cerr<<endl;}
template<class T> void debug(const T& t){dprint(t);cerr<<endl;}
template <class Head, class... Tail> void debug(const Head& head, const Tail&... tail){dprint(head);cerr<<" ";debug(tail...);}
ll intpow(ll a, ll b){ ll ans = 1; while(b){ if(b & 1) ans *= a; a *= a; b /= 2; } return ans; }
ll modpow(ll a, ll b, ll p){ ll ans = 1; while(b){ if(b & 1) (ans *= a) %= p; (a *= a) %= p; b /= 2; } return ans; }
ll modinv(ll a, ll m) {ll b = m, u = 1, v = 0;while (b) {ll t = a / b;a -= t * b; swap(a, b);u -= t * v; swap(u, v);}u %= m;if (u < 0) u += m;return u;}
ll updivide(ll a,ll b){if(a%b==0) return a/b;else return (a/b)+1;}
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

//osa_k法に基づく素因数分解
struct osa_k{
    int n;
    vector<int> osak_calc;
    osa_k(int n = 1000001) {
        osak_calc.resize(n, -1);
        for(int i=2;i<n;i++){
            if(osak_calc[i]==-1){
                for(int j=i;j<n;j+=i){
                    if(osak_calc[j]==-1)osak_calc[j]=i;
                }
            }
        }
    }
    vector<pair<int,int>> prime_factor(int x){
        vector<pair<int,int>> ret;
        if(x<=1)return ret;
        ret.push_back(make_pair(osak_calc[x],1));
        x/=osak_calc[x];
        while(osak_calc[x]!=-1){
            if(osak_calc[x]==ret[ret.size()-1].first){
                ret[ret.size()-1].second++;
            }else{
                ret.push_back(make_pair(osak_calc[x],1));
            }
            x/=osak_calc[x];
        }
        return ret;
    }
    //最小公倍数の数列を返す
    vector<pair<int,int>> array_lcm(vector<int> a){
        map<int,int> Map;
        for(int i=0;i<(int)a.size();i++){
            vector<pair<int,int>> b=prime_factor(a[i]);
            for(int j=0;j<(int)b.size();j++){
                if(Map.count(b[j].first)){
                    if(b[j].second>Map[b[j].first])Map[b[j].first]=b[j].second;
                }else{
                    Map[b[j].first]=b[j].second;
                }
            }
        }
        vector<pair<int,int>> ret;
        for(auto v:Map)ret.emplace_back(v.first,v.second);
        return ret;
    }
};

int main(){
    LL(n);
    ll ans=1;
    osa_k prime(1000001);
    vector<int> p(n+1),a(n);
    for(int i=0;i<=n;i++)p[i]=i;
    for(int i=0;i<n;i++)a[i]=i+1;
    /*auto b=prime.array_lcm(a);
    rep(i,b.size()){
        ans*=modpow(b[i].first,b[i].second,MOD2);
        ans%=MOD2;
    }*/
    for(int i=2;i<=n;i++){
        ans*=p[i];
        ans%=MOD2;
        for(int j=i*2;j<=n;j+=i){
            p[j]/=p[i];
        }
    }
    ll maxv=0;
    for(ll i=1;i<=n;i++){
        chmax(maxv,(ll)p[i]);
    }
    ans*=modinv(maxv,MOD2);
    out(ans%MOD2);
}