Pagini recente » Cod sursa (job #921896) | Cod sursa (job #1265571) | Cod sursa (job #1906242) | Cod sursa (job #1766367) | Cod sursa (job #2285818)
#include <iostream>
#include <fstream>
using namespace std;
const int MOD=98999,N=201;
int s[N][N],S[N][N];
void cerinta1()
{
s[1][1]= 1;
for( int i=2 ; i<N ; ++i )
for( int j=1 ; j<=i ; ++j )
s[i][j]= ( s[i-1][j-1] - (i-1)*s[i-1][j] )%MOD ;
}
void cerinta2()
{
S[1][1]= 1;
for( int i=2 ; i<N ; ++i )
for( int j=1 ; j<=i ; ++j )
S[i][j]= ( S[i-1][j-1] + j*S[i-1][j] )%MOD;
}
int main()
{
ifstream fin ("stirling.in");
ofstream fout ("stirling.out");
cerinta1();
cerinta2();
int n;
fin>>n;
for (int var=0; var<n; ++var)
{
char cer;
int x,y;
fin>>cer>>x>>y;
if (cer=='1')
fout<<s[x][y]<<'\n';
else
fout<<S[x][y]<<'\n';
}
return 0;
}