Pagini recente » Cod sursa (job #250003) | Cod sursa (job #1668991) | Cod sursa (job #2499730) | Cod sursa (job #1836839) | Cod sursa (job #2600720)
#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;
S[1][1]=s[1][1]=1;
for (i=2;i<=200;++i)
{
for (j=1;j<=i;++j)
{
s[i][j]=(s[i-1][j-1]-((i-1)%MOD)*(s[i-1][j]%MOD)%MOD);
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;
}