Pagini recente » Cod sursa (job #2646959) | Cod sursa (job #1444933) | Cod sursa (job #872464) | Cod sursa (job #1128602) | Cod sursa (job #857228)
Cod sursa(job #857228)
#include <cstdio>
#define nmax 203
#define mod 98999
using namespace std;
int s[nmax][nmax],S[nmax][nmax],T,i,j,c;
int main()
{
freopen("stirling.in","r",stdin);
freopen("stirling.out", "w", stdout);
S[1][1]=1;
s[1][1]=1;
for(i=2;i<=200;i++)
for(j=1;j<=i;j++)
{
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%mod;
S[i][j]=(j*S[i-1][j]+S[i-1][j-1])%mod;
}
scanf("%d", &T);
for(;T;T--)
{
scanf("%d%d%d", &c, &i, &j);
if(c==1) printf("%d\n", s[i][j]);
else printf("%d\n", S[i][j]);
}
return 0;
}