Pagini recente » Cod sursa (job #1555014) | Cod sursa (job #2124877) | Cod sursa (job #1490199) | Cod sursa (job #2729630) | Cod sursa (job #2187347)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("stirling.in");
ofstream g ("stirling.out");
const int MOD = 98999;
int s[201][201], S[201][201];
int T, N, M;
void precalc()
{
s[1][1] = S[1][1] = 1;
for (int i = 2; i <= 200; i++)
{
for (int j = 1; j <= 200; j++)
{
S[i][j] = (S[i - 1][j - 1] + j * S[i - 1][j]) % MOD;
s[i][j] = (s[i - 1][j - 1] - (i - 1) * s[i - 1][j]) % MOD;
}
}
}
int main()
{
f >> T;
precalc();
while (T--)
{
short int x;
f >> x >> N >> M;
if (x == 1)
g << s[N][M] << '\n';
else
g << S[N][M] << '\n';
}
return 0;
}