Pagini recente » Cod sursa (job #3177902) | Cod sursa (job #1970842) | Cod sursa (job #623498) | Cod sursa (job #225989) | Cod sursa (job #2165485)
#include <fstream>
using namespace std;
ifstream in("stirling.in");
ofstream out("stirling.out");
#define N 201
#define mod 98999
int s[N][N], S[N][N], x, n, m, T;
int main()
{
s[1][1] = 1;
for(int i = 2; i < N; i++) {
for(int j = 1; j <= i; j++) {
s[i][j] = (s[i-1][j-1] - (i-1)*s[i-1][j])%mod;
}
}
S[1][1] = 1;
for(int i = 2; i < N; i++) {
for(int j = 1; j <= i; j++) {
S[i][j] = (S[i-1][j-1] + j*S[i-1][m])%mod;
}
}
in >> T;
for(T; T > 0; T--) {
in >> x >> n >> m;
if(x == 1) out << s[n][m] << "\n";
else out << S[n][m] << "\n";
}
in.close(), out.close();
return 0;
}