Cod sursa(job #2589325)

Utilizator OvidRata Ovidiu Ovid Data 26 martie 2020 10:40:21
Problema Infasuratoare convexa Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.65 kb
#include<bits/stdc++.h>
using namespace std;
#define mp make_pair
#define pb push_back
#define ft first
#define sc second
#define ll long long
#define MOD 998244353

int n, m, t, q, k, a[300010], l;
string s;



long long pow(long long a, long long b ){
long long rez=1;

for(int i=1; i<=b; i++){
    rez*=a;
    rez%=MOD;
}

return rez;
}




int main(){
cin>>n;
vector<long long> u;
u.resize(n+5);





u[1]=10;


for(long long i=2; i<=n; i++){
        int x=i;
    long long d=(i*( pow(10, i)-10 ) );
    u[x]= ( d%MOD); u[x]*=9; u[x]%=MOD;
}



for(int i=1; i<=n; i++){
    cout<<u[i]<<" ";
}

return 0;
}