Pagini recente » Cod sursa (job #1341770) | Cod sursa (job #2923016) | Cod sursa (job #1411393) | Cod sursa (job #1380471) | Cod sursa (job #1675904)
#include <iostream>
#include <cstdio>
#define mod 98999
using namespace std;
int n,m,v1[205][205],v2[205][205];
void f1()
{
v1[1][1]=1;
for(int i=2; i<=200; i++)
{
for(int j=1; j<=200; j++)
{
long long tmp=(i-1)*v1[i-1][j]-v1[i-1][j-1];
v1[i][j]=(tmp%mod);
}
}
}
void f2()
{
v2[1][1]=1;
for(int i=2; i<=200; i++)
{
for(int j=1; j<=200; j++)
{
long long tmp=j*v2[i-1][j]+v2[i-1][j-1];
v2[i][j]=(tmp%mod);
}
}
}
void citire()
{
int x;
scanf("%d\n",&x);
for(int i=0; i<x; i++)
{
int t;
scanf("%d %d %d\n",&t,&n,&m);
if(t==1)
{
printf("%d\n",v1[n][m]);
}
else
{
printf("%d\n",v2[n][m]);
}
}
}
int main()
{
freopen("stirling.in","r",stdin);
freopen("stirling.out","w",stdout);
f1();
f2();
citire();
return 0;
}