Pagini recente » Cod sursa (job #1467014) | Cod sursa (job #540825) | Cod sursa (job #2904662) | Cod sursa (job #2359845) | Cod sursa (job #2600716)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
#define MOD 98999
int T,x,n,m;
int s[205][205],S[205][205];
int main()
{
int i,j;
for (i=0;i<=200;++i)
{
S[i][0]=1;
}
s[0][0]=1;
for (i=0;i<=200;++i)
{
for (j=0;j<=200;++j)
{
if (i!=0 && j!=0)
{
s[i][j]=(s[i-1][j-1]-((i-1)%MOD)*(s[i-1][j]%MOD)%MOD);
}
if (j!=0)
{
S[i][j]=(S[i-1][j-1]+(j%MOD)*(S[i-1][j]%MOD)%MOD);
}
}
}
fin >> T;
for (i=1;i<=T;++i)
{
fin >> x >> n >> m;
if (x==1)
{
fout << s[n][m];
}
else
{
fout << S[n][m];
}
fout << '\n';
}
fin.close();
fout.close();
return 0;
}