Pagini recente » Cod sursa (job #1643021) | ciordeala | Cod sursa (job #3144245) | Borderou de evaluare (job #1330240) | Cod sursa (job #2165269)
#include <iostream>
#include <fstream>
#define mod 98999
using namespace std;
int t,x,m,n,s[205][205],S[205][205];
void fcts()
{
s[1][1]=1;
for(int i=2;i<=201;i++)
for(int j=1;j<=i;j++)
s[i][j]=(s[i-1][j-1]%mod-((i-1)*s[i][j-1])%mod)%mod;
}
void fctS()
{
S[1][1]=1;
for(int i=2;i<=201;i++)
for(int j=1;j<=i;j++)
S[i][j]=(S[i-1][j-1]%mod-(j*S[i-1][j])%mod)%mod;
}
int main()
{
fcts();
fctS();
ifstream fin("stirling.in");
ofstream fout("stirling.out");
fin>>t;
for(int i=0;i<t;i++)
{
fin>>x>>n>>m;
if(x==1)
fout<<s[n][m]<<"\n";
else
fout<<S[n][m]<<"\n";
}
return 0;
}