Pagini recente » Cod sursa (job #2313936) | Istoria paginii runda/concursul_bebras | Cod sursa (job #1660356) | Istoria paginii runda/cerculdeinfo-lectiile9_10_11_12_13 | Cod sursa (job #1723660)
#include <cstdio>
#define MAXN 200
#define MOD 98999
int s[MAXN+1][MAXN+1],S[MAXN+1][MAXN+1];
int main(){
FILE*fi,*fout;
int i,j,n,t,m,x;
fi=fopen("stirling.in" ,"r");
fout=fopen("stirling.out" ,"w");
fscanf(fi,"%d" ,&t);
s[1][1]=1;
for(i=1;i<=MAXN;i++)
for(j=1;j<=MAXN;j++)
if(!(i==1&&j==1))
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%MOD;
S[1][1]=1;
for(i=1;i<=MAXN;i++)
for(j=1;j<=MAXN;j++)
if(!(i==1&&j==1))
S[i][j]=(S[i-1][j]*j+S[i-1][j-1])%MOD;
while(t>0){
t--;
fscanf(fi,"%d%d%d" ,&x,&n,&m);
if(x==1)
fprintf(fout,"%d\n" ,s[n][m]);
else
fprintf(fout,"%d\n" ,S[n][m]);
}
fclose(fi);
fclose(fout);
return 0;
}