Pagini recente » Cod sursa (job #1498247) | Cod sursa (job #637033) | Cod sursa (job #3133896) | Cod sursa (job #2391414) | Cod sursa (job #2228670)
#include <cstdio>
#define Nmax 200
#define Mmax 200
#define mod 98999
using namespace std;
int s[Nmax+1][Mmax+1],S[Nmax+1][Mmax+1];
int main()
{
freopen("stirling.in","rt",stdin);
freopen("stirling.out","wt",stdout);
int t,n,m,x,i,j;
s[0][0]=1;
S[0][0]=1;
for(i=1;i<=Nmax;i++) {
for(j=1;j<=Mmax;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;
}
}
scanf("%d",&t);
for(i=0;i<t;i++) {
scanf("%d%d%d",&x,&n,&m);
switch(x) {
case 1:
printf("%d\n",s[n][m]);
break;
case 2:
printf("%d\n",S[n][m]);
break;
}
}
return 0;
}