Pagini recente » Cod sursa (job #1956309) | Cod sursa (job #2341058) | Cod sursa (job #2067961) | Cod sursa (job #580349) | Cod sursa (job #936622)
Cod sursa(job #936622)
#include <fstream>
using namespace std;
#define in "stirling.in"
#define out "stirling.out"
#define N 202
#define MOD 98999
int s[2][N][N], n, k, t, sp;
int main ()
{
s[0][1][1] = s[1][1][1] = 1;
for (int i = 2; i < N; ++i)
for (int j = 1; j <= i; ++j) {
s[0][i][j] = (s[0][i-1][j-1] + j * s[0][i-1][j]) % MOD;
s[1][i][j] = (s[1][i-1][j-1] - (i - 1) * s[1][i-1][j]) % MOD;
}
ifstream fin (in);
ofstream fout (out);
fin >> t;
while (t--) {
fin >> sp >> n >> k;
fout << s[sp-1][n][k] << "\n";
}
fcloseall();
return 0;
}