Pagini recente » Cod sursa (job #1226683) | Cod sursa (job #3176616) | Cod sursa (job #1356402) | Cod sursa (job #2924183) | Cod sursa (job #544426)
Cod sursa(job #544426)
#include<fstream>
using namespace std;
const int MaxN = 201;
const int Mod = 98999;
int T,speta,n,m,s[MaxN][MaxN],S[MaxN][MaxN];
void precalculare()
{
int i,j;
S[1][1] = s[1][1] = 1;
for( i = 2 ; i < MaxN ; ++i )
for( j = 1 ; j <= i ; ++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()
{
ifstream f ("stirling.in");
ofstream g ("stirling.out");
precalculare();
f >> T;
while (T-- )
{
f >> speta >> n >> m;
if( speta == 1)
g << s[n][m] << '\n';
else
g << S[n][m] << '\n';
}
f.close();
g.close();
return 0;
}