Pagini recente » Cod sursa (job #2047606) | Cod sursa (job #1125442) | Cod sursa (job #944668) | Cod sursa (job #937198) | Cod sursa (job #2605912)
#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()
{
for(short i=1;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;
A[i][i]=1;
}
for(short i=1;i<=200;i++)
{
for(short j=1;j<i;j++)
B[i][j]=(B[i-1][j-1]+j*B[i][j])%98999;
B[i][i]=1;
}
}
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;
}