Pagini recente » Cod sursa (job #3183473) | Cod sursa (job #1073954) | Cod sursa (job #285687) | Cod sursa (job #356309) | Cod sursa (job #697503)
Cod sursa(job #697503)
#include <stdio.h>
using namespace std;
const int dim = 205, mod = 98999;
int s[dim][dim], S[dim][dim];
void prep ()
{
s[1][1] = S[1][1] = 1;
for (int i = 2; i <= dim; i++)
{
for (int j = 1; j <= dim; 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;
}
}
}
void rez ()
{
int t, x, a, b;
scanf ("%d", &t);
while ( t-- )
{
scanf ("%d%d%d", &x, &a, &b);
if (x == 1)
printf ("%d\n", s[a][b]);
if (x == 2)
printf ("%d\n", S[a][b]);
}
}
int main ()
{
freopen ("stirling.in", "r", stdin);
freopen ("stirling.out", "w", stdout);
prep ();
rez ();
}