Pagini recente » Cod sursa (job #1852503) | Cod sursa (job #2881844) | Cod sursa (job #343077) | Cod sursa (job #302329) | Cod sursa (job #3354856)
#include <fstream>
using namespace std;
ifstream f("stirling.in");
ofstream g("stirling.out");
const int MOD = 98999;
int s[201][201], S[201][201], n, m, x, T;
void prel()
{
S[0][0] = s[0][0] = 1;
for(int i = 1; i <= 200; i++)
{
for(int j = 1; j <= i; j++)
{
s[i][j] = (-(i - 1) * s[i - 1][j] + s[i - 1][j - 1]) % MOD;
S[i][j] = (j * S[i - 1][j] + S[i - 1][j - 1]) % MOD;
}
}
}
int main()
{
prel();
f >> T;
while(T--)
{
f >> x >> n >> m;
if(x == 1)
g << s[n][m] << '\n';
else
g << S[n][m] << '\n';
}
return 0;
}