Pagini recente » Cod sursa (job #571452) | Cod sursa (job #131175) | Cod sursa (job #1619614) | Cod sursa (job #109068) | Cod sursa (job #2982644)
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
ifstream f ("stirling.in");
ofstream g ("stirling.out");
int s1[250][250] , s2[250][250];
int n , t , x , y , z;
void init ()
{
s1[1][1] = 1;
for (int i = 2 ; i <= 200 ; i++)
for (int j = 1 ; j <= i ; j++)
s1[i][j] = (s1[i - 1][j - 1] - (i - 1) * s1[i - 1][j]) % 98999;
s2[1][1] = 1;
for (int i = 2 ; i <= 200 ; i++)
for (int j = 1 ; j <= i ; j++)
s2[i][j] = (s2[i - 1][j - 1] + j * s2[i - 1][j]) % 98999;
}
int main()
{
f >> t;
init ();
while (t)
{
f >> x >> y >> z;
if (x == 1)
g << s1[y][z] << '\n';
else
g << s2[y][z] << '\n';
t--;
}
return 0;
}