Pagini recente » Cod sursa (job #3000383) | Cod sursa (job #1091886) | Cod sursa (job #2915582) | Cod sursa (job #3004235) | Cod sursa (job #1980875)
#include <iostream>
#include <fstream>
using namespace std;
string problema = "stirling";
ifstream in(problema+".in");
ofstream out(problema+".out");
int t,x,n,m;
const int mod=98999;
int s[201][201],S[201][201];
void gen()
{
s[1][1]=S[1][1]=1;
for(int i=2; i<=200; i++)
for(int j=1; j<=200; j++)
{
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%mod;
S[i][j]=(S[i-1][j-1]+j*S[i-1][j])%mod;
}
}
int main()
{
in>>t;
gen();
for(int i = 1;i<=t;i++)
{
in>>x>>n>>m;
if(x==1)
out<<s[n][m]<<'\n';
else
out<<S[n][m]<<'\n';
}
return 0;
}