Pagini recente » Cod sursa (job #1406404) | Cod sursa (job #2605838) | Cod sursa (job #3129377) | Cod sursa (job #654168) | Cod sursa (job #1676699)
#include <fstream>
#define NM 205
#define MOD 98999
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
int M[NM][NM], N[NM][NM];
void Build1()
{
int i, j;
M[0][0]=1;
M[1][1]=1;
for (i=2; i<NM; i++)
{
for (j=1; j<=i; j++)
{
M[i][j]=M[i-1][j]*j+M[i-1][j-1];
M[i][j] %= MOD;
}
}
}
void Build2()
{
int i, j;
N[0][0]=1;
N[1][1]=1;
for (i=2; i<NM; i++)
{
for (j=1; j<=i; j++)
{
N[i][j]=N[i-1][j]*(i-1)+N[i-1][j-1];
N[i][j] %= MOD;
}
}
}
int main()
{
int t, c, a, b, i;
fin>>t;
Build1();
Build2();
for (i=1; i<=t; i++)
{
fin>>c>>a>>b;
if (c==2)
fout<<M[a][b]<<'\n';
else
{
if ((a-b)%2==1)
{
fout<<(-1)*N[a][b]<<'\n';
}
else
fout<<N[a][b]<<'\n';
}
}
return 0;
}