Pagini recente » Cod sursa (job #2219585) | Cod sursa (job #3002452) | Cod sursa (job #468995) | Cod sursa (job #2120896) | Cod sursa (job #459649)
Cod sursa(job #459649)
#include<fstream>
#define max_n 210
#define p 98999
using namespace std;
int s[max_n][max_n],S[max_n][max_n];
bool done[max_n][max_n];
void do_it(int i, int j)
{
if(done[i][j]||i<j)
return;
do_it(i-1,j-1);
do_it(i-1,j);
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%p;
S[i][j]=(S[i-1][j-1]+j*S[i-1][j])%p;
done[i][j]=1;
}
int main()
{
int t,x,n,m;
ifstream read ("stirling.in");
ofstream write ("stirling.out");
for(int i=1;i<max_n;++i)
s[i][i]=S[i][i]=done[i][i]=done[i][0]=1;
read>>t;
while(t--)
{
read>>x>>n>>m;
do_it(n,m);
if(x==1)
write<<s[n][m]<<'\n';
else
write<<S[n][m]<<'\n';
}
return 0;
}