Pagini recente » Cod sursa (job #419003) | Cod sursa (job #2503146) | Cod sursa (job #2157902) | Cod sursa (job #344361) | Cod sursa (job #467911)
Cod sursa(job #467911)
#include <cstdio>
#define N 205
#define M 98999
int s[N][N],S[N][N];
inline void precalc()
{
s[0][0]=1;
S[1][1]=1;
int n=200;
for(int i=1; i<=n; ++i)
{
s[i][0]=((1-i)*s[i-1][0]) % M;
for(int j=1; j<=n; ++j)
s[i][j]= (s[i-1][j-1] - (i-1)*s[i-1][j]) % M;
}
for(int i=2; i<=n; ++i)
{
for(int j=1; j<=i; ++j)
S[i][j]= (S[i-1][j]*j + S[i-1][j-1]) % M;
}
}
int main()
{
freopen("stirling.in","r",stdin);
freopen("stirling.out","w",stdout);
precalc();
int T;
int x,i,j;
for(scanf("%d",&T); T; --T)
{
scanf("%d%d%d",&x,&i,&j);
printf("%d\n", ( (x==1) ? (s[i][j]) : (S[i][j]) ) );
}
return 0;
}