Pagini recente » Borderou de evaluare (job #3032291) | Borderou de evaluare (job #169987) | Cod sursa (job #2194338)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("stirling.in");
ofstream g("stirling.out");
const int MOD = 98999;
const int vmax = 200;
int T, x, n, m, s1[201][201], s2[201][201];
void rec()
{
s1[1][1] = s2[1][1] = 1;
for(int i = 2; i <= vmax; i++)
for(int j = 1; j <= i; j++)
{
s1[i][j] = (s1[i - 1][j - 1] - (i - 1) * s1[i - 1][j]) % MOD;
s2[i][j] = (s2[i - 1][j - 1] + j * s2[i - 1][j]) % MOD;
}
}
int main()
{
f >> T;
rec();
for(int i = 1; i <= T; i++)
{f >> x >> n >> m;
if(x==1)
g<<s1[n][m]<<'\n';
else
g<<s2[n][m]<<'\n';}
return 0;
}