Pagini recente » Cod sursa (job #2710536) | Cod sursa (job #1977857) | Cod sursa (job #2430893) | Cod sursa (job #2473041) | Cod sursa (job #918449)
Cod sursa(job #918449)
#include <cstdio>
#include <algorithm>
using namespace std;
int s[201][201],S[201][201];
int main()
{
freopen("stirling.in","r",stdin);
freopen("stirling.out","w",stdout);
int n,speta,i,j,k;
s[1][1]=S[1][1]=1;
for(i=2;i<201;++i)
for(j=1;j<=201;++j)
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%98999;
for(i=2;i<201;++i)
for(j=1;j<=201;++j)
S[i][j]=(S[i-1][j-1]-j*S[i-1][j])%98999;
scanf("%d",&n);
for(i=1;i<=n;++i)
{
scanf("%d%d%d",&speta,&j,&k);
if(speta==1)
printf("%d\n",s[j][k]);
else
printf("%d\n",S[j][k]);
}
return 0;
}