Pagini recente » Cod sursa (job #2386107) | Cod sursa (job #534509) | Cod sursa (job #2624753) | Cod sursa (job #3172186) | Cod sursa (job #2659741)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
#define N 201
#define mod 98999
int t, a, b, c, s[N][N] = { 1 }, S[N][N] = { 1 };
void f() {
for (int i = 1; i < N; ++i)
for (int j = 1; j < N; ++j) {
s[i][j] = (s[i - 1][j - 1] - ((((i - 1) % mod) * (s[i - 1][j] % mod)) % mod)) % mod;
S[i][j] = ((S[i - 1][j - 1] % mod) + (j * (S[i - 1][j] % mod) % mod) % mod) % mod;
}
}
int main() {
fin >> t;
f();
for (int i = 1; i <= t; ++i) {
fin >> c >> a >> b;
if (c == 1)
fout << s[a][b] << "\n";
else
fout << S[a][b] << "\n";
}
}