Pagini recente » Cod sursa (job #1683854) | Cod sursa (job #2055559) | Cod sursa (job #267947) | Cod sursa (job #282264) | Cod sursa (job #1867671)
#include <fstream>
using namespace std;
int st1[201][201], st2[201][201];
int sp ,n, m, t, i;
int main()
{
ifstream fin ("stirling.in");
ofstream fout ("stirling.out");
st1[1][1] = st2[1][1] = 1;
for(n = 2; n <= 200; n++)
for(m = 1; m <= 200; m++)
{
st1[n][m] = (st1[n - 1][m - 1] - (n - 1) * st1[n - 1][m]) % 98999;
st2[n][m] = (st2[n - 1][m - 1] + m * st2[n - 1][m]) % 98999;
}
fin>>t;
for(i = 0; i < t; i++)
{
fin>>sp>>n>>m;
if(sp == 1) fout<<st1[n][m]<<'\n';
else fout<<st2[n][m]<<'\n';
}
return 0;
}