Pagini recente » Cod sursa (job #579688) | Cod sursa (job #3165437) | Cod sursa (job #867365) | Cod sursa (job #796439) | Cod sursa (job #3241511)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("stirling.in");
ofstream g("stirling.out");
const int MOD = 98999,
MAX = 201;
int s[MAX][MAX], S[MAX][MAX];
void stirling()
{
int i, j;
s[1][1] = S[1][1] = 1;
for(i = 2; i < MAX; ++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()
{
int T, x, n, k;
stirling();
f >> T;
while(T--)
{
f >> x >> n >> k;
if(x == 1)
g << s[n][k];
else
g << S[n][k];
g << '\n';
}
f.close();
g.close();
return 0;
}