Pagini recente » Cod sursa (job #2729666) | Cod sursa (job #2436211) | Cod sursa (job #2238811) | Cod sursa (job #2260722) | Cod sursa (job #2376516)
#include <bits/stdc++.h>
#define MAXN 205
#define MOD 98999
int T;
int Stirling[2][MAXN][MAXN];
void Precompute() {
Stirling[0][1][1] = Stirling[1][1][1] = 1;
for (int i=2, j; i<MAXN; ++i)
for (j=1; j<=i; ++j) {
Stirling[0][i][j] = (Stirling[0][i-1][j] * (1-i) + Stirling[0][i-1][j-1]) % MOD;
Stirling[1][i][j] = (Stirling[1][i-1][j] * j + Stirling[1][i-1][j-1]) % MOD;
}
}
std::ifstream In ("stirling.in");
std::ofstream Out("stirling.out");
void Citire() {
In >> T;
}
void Rezolvare() {
Precompute();
int X, Y, type;
while (T--)
In >> type >> X >> Y,
Out << Stirling[type-1][X][Y] << '\n';
}
int main()
{
Citire();
Rezolvare();
return 0;
}