Pagini recente » Cod sursa (job #181734) | Cod sursa (job #13685) | Cod sursa (job #2077080) | Cod sursa (job #1755037) | Cod sursa (job #956958)
Cod sursa(job #956958)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
const int N = 201, MOD = 98999;
int t, n, k, c, s[N][N], S[N][N];
void Solve_s()
{
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 Solve_S()
{
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()
{
Solve_s();
Solve_S();
fin>>t;
while(t--)
{
fin>>c>>n>>k;
if(c == 1) fout<<s[n][k]<<'\n';
else fout<<S[n][k]<<'\n';
}
return 0;
}