Pagini recente » Cod sursa (job #1037634) | Cod sursa (job #1608094) | Cod sursa (job #440675) | Cod sursa (job #1542938) | Cod sursa (job #1452567)
#include <stdio.h>
#define MOD 98999
#define MAXN 200
int s[2][MAXN+1][MAXN+1];
inline void precalc(){
int i, j;
s[0][1][1]=1;
for(i=2; i<=MAXN; i++){
for(j=1; j<=i; j++){
s[0][i][j]=(s[0][i-1][j-1]-(i-1)*s[0][i-1][j])%MOD;
}
}
s[1][1][1]=1;
for(i=2; i<=MAXN; i++){
for(j=1; j<=i; j++){
s[1][i][j]=(s[1][i-1][j-1]+j*s[1][i-1][j])%MOD;
}
}
}
int main(){
int t, a, b, x;
FILE *fin, *fout;
fin=fopen("stirling.in", "r");
fout=fopen("stirling.out", "w");
precalc();
fscanf(fin, "%d", &t);
for(; t; t--){
fscanf(fin, "%d%d%d", &x, &a, &b);
fprintf(fout, "%d\n", s[x-1][a][b]);
}
fclose(fin);
fclose(fout);
return 0;
}