Pagini recente » Cod sursa (job #3150026) | Cod sursa (job #1295188) | Cod sursa (job #3162576) | Cod sursa (job #1789704) | Cod sursa (job #2555469)
#include <bits/stdc++.h>
using namespace std;
ifstream f("stirling.in");
ofstream g("stirling.out");
const int nmax = 205;
const int mod = 98999;
int s1[nmax][nmax];
void spetaI()
{
s1[1][1] = 1;
for (int i = 2; i < nmax; ++ i)
for (int j = 1; j <= i; ++ j)
s1[i][j] = (s1[i - 1][j - 1] - s1[i - 1][j] * (i - 1)) % mod;
}
int s2[nmax][nmax];
void spetaII()
{
s2[1][1] = 1;
for (int i = 2; i < nmax; ++ i)
for (int j = 1; j <= i; ++ j)
s2[i][j] = (s2[i - 1][j - 1] + s2[i - 1][j] * j) % mod;
}
int main()
{
int t;
f >> t;
spetaI();
spetaII();
while (t --)
{
int speta, n, m;
f >> speta;
f >> n >> m;
if (speta == 1)
g << s1[n][m] << '\n';
else
g << s2[n][m] << '\n';
}
}