Pagini recente » Cod sursa (job #2641553) | Cod sursa (job #2596527) | Cod sursa (job #1811442) | Cod sursa (job #1256467) | Cod sursa (job #2685309)
#include <fstream>
using namespace std;
const int NMAX=201,
MOD=98999;
int s[NMAX][NMAX],S[NMAX][NMAX];
ifstream f("stirling.in");
ofstream g("stirling.out");
void calcul(){
s[1][1]=S[1][1]=1;
for(int i=2;i<NMAX;++i)
for(int j=1;j<=i;++j){
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%MOD;
S[i][j]=(S[i-1][j-1]+j*S[i-1][j])%MOD;
}
}
int main()
{
int T,x,n,m;
calcul();
f>>T;
while(T--){
f>>x>>n>>m;
if(x==1)
g<<s[n][m]<<'\n';
else
g<<S[n][m]<<'\n';
}
f.close();
g.close();
return 0;
}