Pagini recente » Cod sursa (job #3235159) | Cod sursa (job #378886) | Cod sursa (job #3292588) | Arhiva Educationala | Cod sursa (job #3278791)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
int t, s1[205][205], s2[205][205], n, m, x, MOD=98999;
void precalc() {
s1[1][1]=s2[1][1]=1;
for(int i=2; i<=200; i++) {
for(int j=1; j<=i; j++) {
s1[i][j]=(s1[i-1][j-1]-(i-1)*s1[i-1][j])%MOD;
s2[i][j]=(s2[i-1][j-1]+j*s2[i-1][j])%MOD;
}
}
}
int main()
{
precalc();
fin >> t;
while(t--) {
fin >> x >> n >> m;
if(x==1) {
fout << s1[n][m] << "\n";
} else {
fout << s2[n][m] << "\n";
}
}
return 0;
}