Pagini recente » Cod sursa (job #1803926) | Cod sursa (job #868860) | Cod sursa (job #763189) | Cod sursa (job #617684) | Cod sursa (job #2564443)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ( "stirling.in" );
ofstream g ( "stirling.out" );
const int NMAX = 201, MOD = 98999;
int s[NMAX + 2][NMAX + 2], S[NMAX + 2][NMAX + 2];
void calcs()
{
s[1][1] = 1;
for ( int i = 2 ; i <= NMAX ; ++i )
for ( int j = 1 ; j <= i ; ++j )
s[i][j] = ( s[i - 1][j - 1] - ( i - 1 ) * s[i - 1][j] ) % MOD ;
}
void calcS()
{
S[1][1] = 1;
for ( int i = 2; i <= NMAX; ++i )
for ( int j = 1; j <= i; ++j )
S[i][j] = ( S[i - 1][j - 1] + j * S[i - 1][j] ) % MOD;
}
int main()
{
int N, n, m, cer;
f >> N;
calcs();
calcS();
while ( N-- )
{
f >> cer >> n >> m;
if ( cer == 1 )
g << s[n][m] << '\n';
else g << S[n][m] << '\n';
}
return 0;
}