Pagini recente » Cod sursa (job #710243) | Cod sursa (job #1939687) | Borderou de evaluare (job #2565362) | Cod sursa (job #1095467) | Cod sursa (job #2371967)
#include <bits/stdc++.h>
using namespace std;
#define LMAX 200
#define MOD 98999
long long s[LMAX+5][LMAX+5],S[LMAX+5][LMAX+5];
int main(){
freopen("stirling.in","r",stdin);
freopen("stirling.out","w",stdout);
s[1][1]=S[1][1]=1;
for(int i=2;i<=LMAX;++i)
for(int j=1;j<=i;++j){
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%MOD;
S[i][j]=(S[i-1][j-1]+j*S[i-1][j])%MOD;
}
int q;
scanf("%d",&q);
while(q--){
int tip,n,m;
scanf("%d %d %d",&tip,&n,&m);
if(tip==1)
printf("%lld\n",s[n][m]);
else printf("%lld\n",S[n][m]);
}
return 0;
}