Pagini recente » Cod sursa (job #1660535) | Cod sursa (job #2756118) | Cod sursa (job #1058922) | Cod sursa (job #1564451) | Cod sursa (job #2605913)
#include <fstream>
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
int A[201][201], B[201][201];
short n, m, T, p;
void preprocess()
{
A[1][1]=1;
for(short i=2;i<=200;i++)
{
for(short j=1;j<=i;j++)
A[i][j]=(A[i-1][j-1]-(i-1)*A[i-1][j])%98999;
}
B[1][1]=1;
for(short i=2;i<=200;i++)
{
for(short j=1;j<=i;j++)
B[i][j]=(B[i-1][j-1]+j*B[i-1][j])%98999;
}
}
int main()
{
preprocess();
fin>>T;
for(short i=0;i<T;i++)
{
fin>>p>>n>>m;
if(p==1)
fout<<A[n][m]<<'\n';
else
fout<<B[n][m]<<'\n';
}
return 0;
}