LOADING

加载过慢请开启缓存,浏览器默认开启

daily 2

2023/7/11 daily

CF 1327E

int main(){
    int n;
    cin>>n;
    vector<ll>pw(n+1);
    pw[1]=10;
    for(int i=2;i<=n;++i){
        pw[i]=10*pw[i-1]%MOD;
    }
    for(int i=1;i<=n;++i){
        if(i==n){
            cout<<"10\n";
        }else{
            cout<<(18*pw[n-i]%MOD+(n-i-1)*81*pw[n-i-1]%MOD)%MOD<<" ";
        }
    }
    return 0;
}

CF 997B

int main(){
    int n;
    cin>>n;
    long long ans=0;
    for(int i=0;i<=min(8,n);++i){
        for(int j=0;i+j<=n&&j<=(i==0?8:4);++j){
            ans+=n-i-j+1;
        }
    }
    cout<<ans<<'\n';
}