Pagini recente » Cod sursa (job #2550913) | Cod sursa (job #332815) | Cod sursa (job #1140101) | Cod sursa (job #2657179) | Cod sursa (job #2660661)
#include <fstream>
#define N 204
#define MOD 98999
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
int t, n, m, x, s[N][N], S[N][N];
void pre_s() {
for(int i=1;i<=200;i++)
for(int j=1;j<=i;j++)
if(i==j)
s[i][j]=1;
else
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%MOD;
}
void pre_S() {
for(int i=1;i<=200;i++)
for(int j=1;j<=i;j++)
if(i==j)
S[i][j]=1;
else
S[i][j]=(j*S[i-1][j]+S[i-1][j-1])%MOD;
}
int main() {
pre_s();
pre_s();
fin>>t;
while(t--) {
fin>>x>>n>>m;
if(x==1)
fout<<s[n][m]<<'\n';
else
fout<<S[n][m]<<'\n';
}
return 0;
}