Pagini recente » Cod sursa (job #1486673) | Cod sursa (job #881963) | Cod sursa (job #870961) | Cod sursa (job #3150088) | Cod sursa (job #2673827)
#include <fstream>
const int nmax = 205;
const int mod = 98999;
int s[2][nmax][nmax];
void stirling() {
s[0][1][1] = s[1][1][1] = 1;
for(int i=2;i<nmax;i++)
for (int j = 1; j <= i; j++) {
s[0][i][j] = (s[0][i - 1][j - 1] - (i - 1) * s[0][i - 1][j]) % mod;
s[1][i][j] = (s[1][i - 1][j - 1] + j * s[1][i - 1][j]) % mod;
}
}
int main() {
std::ifstream fin("stirling.in");
std::ofstream fout("stirling.out");
stirling();
int t, x, a, b;
fin >> t;
while (t--) {
fin >> x >> a >> b;
fout << s[x - 1][a][b] << "\n";
}
}