// Problem: No.2625 Bouns Ai // Contest: yukicoder // URL: https://yukicoder.me/problems/no/2625 // Memory Limit: 512 MB // Time Limit: 2000 ms #include #define debug(x) cerr<<(#x)<<" "<<(x)< #define rep(i,a,b) for(ll i=(a);i<=(b);++i) #define per(i,a,b) for(ll i=(a);i>=(b);--i) using namespace std; bool Mbe; ll read(){ ll x=0,f=1;char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();} return x*f; } void write(ll x){ if(x<0)putchar('-'),x=-x; if(x>9)write(x/10); putchar(x%10+'0'); } const ll N=2e5+9,V=1e5,Mod=998244353; ll n,a[N],dp[205][N],sum[N]; bool Med; int main(){ cerr<=0)dp[i][j]=sum[min(j,k)]; } sum[0]=dp[i][0]; rep(j,1,V)sum[j]=(sum[j-1]+dp[i][j])%Mod; } write(sum[V]); return 0; }