Pagini recente » Cod sursa (job #133259) | Cod sursa (job #3247740) | Cod sursa (job #2014038) | Cod sursa (job #2015165) | Cod sursa (job #3354959)
#include <fstream>
using namespace std;
const int MOD=98999;
ifstream f("stirling.in");
ofstream g("stirling.out");
int a[201][201],b[201][201];
void s(int n){
a[1][1]=1;
for(int i=2;i<=n;i++){
for(int j=1;j<=i;j++)
a[i][j]=(a[i-1][j-1]-(i-1)*a[i-1][j])%MOD;
}
}
void S(int n){
b[1][1]=1;
for(int i=2;i<=n;i++){
for(int j=1;j<=i;j++)
b[i][j]=(b[i-1][j-1]+ j*b[i-1][j])%MOD;
}
}
int main()
{
int t;
f>>t;
s(200);
S(200);
while(t--){
int x,n,k;
f>>x>>n>>k;
if(x==1)
g<<a[n][k]<<'\n';
else g<<b[n][k]<<'\n';
}
f.close();
g.close();
return 0;
}