Pagini recente » Cod sursa (job #1255941) | Cod sursa (job #543484) | Cod sursa (job #1138841) | Cod sursa (job #937676) | Cod sursa (job #3331608)
#include <iostream>
#include <fstream>
using namespace std;
const int N = 205,
MOD = 98999;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
int s[N][N], S[N][N];
void precalc()
{
s[1][1] = 1;
S[1][1] = 1;
for(int i = 2; i <= 200; ++i)
{
for(int j = 1; j <= i; ++j)
{
s[i][j] = (s[i - 1][j - 1] - (i - 1) * s[i - 1][j]) % MOD;
S[i][j] = (S[i - 1][j - 1] + j * S[i - 1][j]) % MOD;
}
}
}
int main()
{
precalc();
int t;
fin >> t;
while(t--)
{
int speta, n, m;
fin >> speta >> n >> m;
if(speta == 1)
fout << s[n][m] << '\n';
else
fout << S[n][m] << '\n';
}
fin.close();
fout.close();
return 0;
}