Pagini recente » Borderou de evaluare (job #201672) | Borderou de evaluare (job #2401909) | Cod sursa (job #1795127) | Cod sursa (job #1970391) | Cod sursa (job #1967295)
#include <iostream>
#include <fstream>
#define NMAX 201
#define MOD 98999
using namespace std;
ifstream f ("stirling.in");
ofstream g ("stirling.out");
int t, n, m, x;
int s[NMAX][NMAX], S[NMAX][NMAX];
inline void calc() {
s[1][1] = S[1][1] = 1;
for(int i = 2; i < NMAX; i++)
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()
{
calc();
f>>t;
while(t--) {
f>>x>>n>>m;
if (x == 1)
g<<s[n][m]<<'\n';
else
g<<S[n][m]<<'\n';
}
return 0;
}