Pagini recente » Cod sursa (job #2370317) | Cod sursa (job #184457) | Cod sursa (job #748196) | Cod sursa (job #171987) | Cod sursa (job #1163832)
#include <cstdio>
#define MOD 98999
#define Nmax 205
int T, X, N, M;
int s[Nmax][Nmax], S[Nmax][Nmax];
void Calc_s()
{
s[1][1] = 1;
for (int i = 2; i < Nmax; ++i)
for (int j = 1; j <= i; ++j)
s[i][j] = (s[i - 1][j - 1] - (i - 1) * s[i - 1][j]) % MOD;
}
void Calc_S()
{
S[1][1] = 1;
for (int i = 2; i < Nmax; ++i)
for (int j = 1; j <= i; ++j)
S[i][j] = (S[i - 1][j - 1] + j * S[i - 1][j]) % MOD;
}
int main()
{
freopen("stirling.in", "r", stdin);
freopen("stirling.out", "w", stdout);
scanf("%d", &T);
Calc_s();
Calc_S();
for (int i = 1; i <= T; ++i)
{
scanf("%d %d %d", &X, &N, &M);
if (X == 1)
printf("%d\n", s[N][M]);
else
printf("%d\n", S[N][M]);
}
return 0;
}