Pagini recente » Cod sursa (job #2285707) | Cod sursa (job #1038016) | Cod sursa (job #3178285) | Cod sursa (job #15967) | Cod sursa (job #1079197)
#include<stdio.h>
#define mod 98999
int i,j,n,m,t,s[201][201],S[201][201],k;
void parcurgere_s()
{
int i,j;
s[1][1]=1;
for(i=2;i<=200;i++)
for(j=1;j<=200;j++)
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%mod;
}
void parcurgere_S()
{
int i,j;
S[1][1]=1;
for(i=2;i<=200;i++)
for(j=1;j<=200;j++)
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);
parcurgere_s();
parcurgere_S();
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%d %d %d",&k,&n,&m);
if(k==1)
printf("%d\n",s[n][m]);
else
printf("%d\n",S[n][m]);
}
return 0;
}