Pagini recente » Cod sursa (job #1166329) | Cod sursa (job #1617613) | Cod sursa (job #2291676) | Cod sursa (job #460761) | Cod sursa (job #2198065)
#include <iostream>
#include <fstream>
#define NUM 205
#define MOD 98999
int s[NUM][NUM];
int S[NUM][NUM];
int n, m, t, nr;
using namespace std;
void pre_s()
{
s[1][1] = 1;
for(int i = 2; i < NUM; ++i)
for(int j = 1; j <= i; ++j)
s[i][j] = (s[i - 1][j - 1] - (i - 1) * s[i - 1][j]) % MOD;
}
void pre_S()
{
S[1][1] = 1;
for(int i = 2; i < NUM; ++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 f("stirling.in");
ofstream g("stirling.out");
pre_s();
pre_S();
f >> t;
for(int i = 0; i < t; ++i)
{
f >> nr >> n >> m;
(nr == 1) ? (g << s[n][m]) : (g << S[n][m]);
g << "\n";
}
f.close();
g.close();
}