Pagini recente » Cod sursa (job #147194) | Cod sursa (job #404323) | Cod sursa (job #866452) | Cod sursa (job #2670118) | Cod sursa (job #1476214)
#include<iostream>
#include<stdio.h>
#define lim 201
#define MOD 98999
using namespace std;
int s[lim][lim];
int S[lim][lim];
void precalculeaza_s()
{
for(int i=1;i<lim;i++)
for(int j=1;j<=i;j++)
{
s[i][j] = (s[i-1][j-1] - (i-1)*s[i-1][j]) %MOD;
}
}
void precalculeaza_S()
{
for(int i=1;i<lim;i++)
for(int j=1;j<=i;j++)
{
S[i][j] = (S[i-1][j-1] + j * S[i-1][j]) %MOD;
}
}
int main()
{
int N,K;
int n, m;
freopen("stirling.in","r",stdin);
freopen("stirling.out", "w", stdout);
int T;
scanf("%d", &T);
s[0][0] = 1;
S[0][0] = 1;
precalculeaza_s();
precalculeaza_S();
for(int i=1;i<=T;i++)
{
int x,n,m;
scanf("%d %d %d", &x, &n, &m);
if(x==1)
printf("%d \n", s[n][m]);
else
printf("%d \n", S[n][m]);
}
return 0;
}