Pagini recente » Cod sursa (job #3284740) | Cod sursa (job #3293556) | Cod sursa (job #3291366) | Arhiva educationala - tehnici de programare, algoritmi clasici | Cod sursa (job #3285544)
#include <fstream>
using namespace std;
ifstream fcin("stirling.in");
ofstream fout("stirling.out");
int t,x,n,m,s1[400][400],s2[400][400];
const int nmax=300;
const int mod=98999;
int main()
{
fcin>>t;
s1[1][1]=s2[1][1]=1;
for(int i=2; i<=nmax; 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;
}
}
while(t--)
{
fcin>>x>>n>>m;
if(x==1) fout<<s1[n][m]; else fout<<s2[n][m];
fout<<'\n';
}
return 0;
}