Pagini recente » Cod sursa (job #1634258) | Cod sursa (job #512019) | Cod sursa (job #2873405) | Cod sursa (job #2485426) | Cod sursa (job #2314335)
#include <fstream>
using namespace std;
ifstream in("stirling.in");
ofstream out("stirling.out");
const int MOD = 98999;
const int N_MAX = 200;
int T;
int s[N_MAX + 1][N_MAX + 1];
int S[N_MAX + 1][N_MAX + 1];
void compute_stirling() {
s[0][0] = S[0][0] = 1;
for(int i = 1; i <= N_MAX; ++i) {
s[i][0] = S[i][0] = 0;
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() {
compute_stirling();
in >> T;
int speta, n, m;
while(T--) {
in >> speta >> n >> m;
if(speta == 1)
out << s[n][m] << '\n';
if(speta == 2)
out << S[n][m]<< '\n';
}
return 0;
}