提出 #67790457

---

ソースコード 拡げる

#include <bits/stdc++.h>
#include <random>
#include <chrono>
using namespace std;
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops,inline")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<double,double> pdd;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

template<typename T> void _do(T x){cerr<<x<<"\n";}
template<typename T,typename ...U> void _do(T x,U ...y){cerr<<x<<", ";_do(y...);}
#define dbg(...) cerr<<#__VA_ARGS__<<" = ";_do(__VA_ARGS__);

const int MOD1=1e9+7;
const int MOD2=998244353;
const ll INF=3e18;

ll fpow(ll a,ll b,ll m)
{
    if(!b) return 1;
    ll tmp=1;
    for(ll cur=a;b;b>>=1,cur=cur*cur%m) if(b&1) tmp=tmp*cur%m;
    return tmp;
}
ll inv(ll a,ll m) {return fpow(a,m-2,m);}

#define MottoHayaku ios::sync_with_stdio(false);cin.tie(0);
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define F first
#define S second
#define pb push_back
#define uni(c) c.resize(distance(c.begin(),unique(c.begin(),c.end())))
#define unisort(c) sort(c.begin(),c.end()),uni(c)

const int N=2e5+5;

bool vis[N];
int R[N];
int a[N];

map<vector<int>,pii> dp;

pii calc(vector<int> a)
{
    unisort(a);
    reverse(a.begin(),a.end());
    while(!a.empty()&&a.back()<=1) a.pop_back();
    if(a.empty()) return {1,1};
    if(a.size()==1) return {R[a[0]],1};
    if(a.size()<=100&&dp.count(a)) return dp[a];
    vector<int> b(a.begin(),a.end()-1);
    int x=a.back();
    pii res=calc(b);
    rep(i,b.size()) b[i]=__gcd(b[i],x);
    pii tmp=calc(b);
    res.F=1LL*res.F*R[x]%MOD2*tmp.S%MOD2;
    res.S=1LL*res.S*tmp.F%MOD2;
    if(a.size()<=100) dp[a]=res;
    return res;
}


void solve()
{
    int n;
    cin>>n;
    rep1(i,n) cin>>a[i];
    int ans=1;
    vector<int> b;
    rep1(i,n)
    {
        bool found=0;
        for(int j=a[i];j<N;j+=a[i]) if(vis[j])
        {
            found=1;
            break;
        }
        if(!found)
        {
            vector<int> c=b;
            rep(j,c.size()) c[j]=__gcd(c[j],a[i]);
            pii tmp=calc(c);
            ans=1LL*ans*R[a[i]]%MOD2*tmp.S%MOD2*inv(tmp.F,MOD2)%MOD2;
            b.pb(a[i]);
        }
        vis[a[i]]=1;
        cout<<ans<<"\n";
    }
}

signed main()
{
    MottoHayaku
    int cur=1;
    rep1(i,N-1)
    {
        R[i]=(R[i-1]+cur)%MOD2;
        cur=1LL*cur*10%MOD2;
    }
    int t;
    //cin>>t;
    t=1;
    while(t--)
    {
        solve();
    }
}

提出情報

コンパイルエラー

Main.cpp: In function ‘pii calc(std::vector<int>)’:
Main.cpp:33:31: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   33 | #define rep(i,n) for(int i=0;i<n;i++)
      |                               ^
Main.cpp:60:5: note: in expansion of macro ‘rep’
   60 |     rep(i,b.size()) b[i]=__gcd(b[i],x);
      |     ^~~
Main.cpp: In function ‘void solve()’:
Main.cpp:33:31: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::vector<int>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
   33 | #define rep(i,n) for(int i=0;i<n;i++)
      |                               ^
Main.cpp:87:13: note: in expansion of macro ‘rep’
   87 |             rep(j,c.size()) c[j]=__gcd(c[j],a[i]);
      |             ^~~

ジャッジ結果