Pagini recente » Cod sursa (job #2976961) | Cod sursa (job #2126671) | Cod sursa (job #2178803) | Cod sursa (job #912213) | Cod sursa (job #1797547)
#include <cstdio>
const int NMAX = 201, MOD = 98999;
int s[NMAX][NMAX], S[NMAX][NMAX];
void calcul()
{
s[1][1] = S[1][1] = 1;
for(int i = 2; i < NMAX; ++i)
for(int j = 1; j <= i; ++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;
}
}
int main()
{
freopen("stirling.in", "r", stdin);
freopen("stirling.out", "w", stdout);
int T, x, n, m;
calcul();
scanf("%d", &T);
while(T--)
{
scanf("%d%d%d", &x, &n, &m);
if(x == 1)
printf("%d\n", s[n][m]);
else
printf("%d\n", S[n][m]);
}
}