Pagini recente » Cod sursa (job #2106172) | Cod sursa (job #3221352) | Cod sursa (job #3131134) | Cod sursa (job #1990863) | Cod sursa (job #1179368)
#include <fstream>
using namespace std;
int s1[205][205],s2[205][205];
const int mod=98999;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
inline void preprocesare()
{
int i,j;
s1[1][1]=1;
s2[1][1]=1;
for(i=2;i<=200;i++)
{
for(j=1;j<=i;j++)
{
s1[i][j]=(s1[i-1][j-1]-(i-1)*s1[i-1][j])%mod;
s2[i][j]=(s2[i-1][j-1]+j*s2[i-1][j])%mod;
}
}
}
int main()
{
int n,t,ok,i,k;
fin>>t;
s1[0][0]=1;
preprocesare();
for(i=0;i<t;i++)
{
fin>>ok>>n>>k;
if(ok==1) fout<<s1[n][k]%mod<<"\n";
else fout<<s2[n][k]%mod<<"\n";
}
}