Pagini recente » Cod sursa (job #1806144) | Cod sursa (job #702470) | jc2015 | Cod sursa (job #1695091) | Cod sursa (job #1795529)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("stirling.in");
ofstream g("stirling.out");
const int MOD = 98999;
int S[201][201], n, m, s[201][201], t, x;
void stirling1(int n, int m) {
s[0][0] = 1;
s[1][1] = 1;
for (int i = 2; i <= n; i++) {
s[i][i] = 1;
for (int j = 1; j < i; j++)
s[i][j] = (s[i - 1][j - 1] - (i - 1) * s[i - 1][j]) % MOD;
}
}
void stirling2(int n, int m) {
S[0][0] = 1;
S[1][1] = 1;
for (int i = 2; i <= n; i++) {
S[i][1] = 1;
S[i][i] = 1;
for (int j = 2; j < i; j++)
S[i][j] = (S[i - 1][j - 1] + j * S[i - 1][j]) % MOD;
}
}
int main()
{
f >> t;
stirling1(200, 200);
stirling2(200, 200);
for (int i = 1; i <= t; i++) {
f >> x >> n >> m;
if (x == 1) g << s[n][m] << '\n';
else g << S[n][m] << '\n';
}
return 0;
}