Pagini recente » Cod sursa (job #586279) | Cod sursa (job #909641) | Cod sursa (job #3232497) | Cod sursa (job #2416454) | Cod sursa (job #1450796)
#include <bits/stdc++.h>
#define modulo 98999
using namespace std;
int s[205][205], S[205][205], n, m;
void C_s()
{
int i, j;
s[1][1]= 1;
for(i = 2; i <= 200; ++i)
for(j = 1; j <= i; ++j)
s[i][j]= (s[i-1][j-1] - (i-1) * s[i-1][j])% modulo ;
}
void C_S()
{
int i, j;
S[1][1]= 1;
for(i = 2; i <= 200; ++i)
for(j = 1; j <= i; ++j)
S[i][j]= (S[i-1][j-1] + j * S[i-1][j] )% modulo;
}
int main()
{
int i, T, op;
C_s();
C_S();
ifstream fin("stirling.in");
ofstream fout("stirling.out");
fin >> T;
for (i = 1; i <= T; ++i)
{
fin >> op >> n >> m;
if (op == 1) fout << s[n][m] << "\n";
else fout << S[n][m] << "\n";
}
fin.close();
fout.close();
return 0;
}