Pagini recente » Cod sursa (job #3276134) | Cod sursa (job #3212595) | Cod sursa (job #1945367) | Cod sursa (job #3244572) | Cod sursa (job #3272351)
#include <iostream>
#include <fstream>
#define int long long
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
const int MAX=200,MOD=98999;
int t,c,n,m,i,j,S[MAX+5][MAX+5],s[MAX+5][MAX+5];
signed main()
{
S[1][1]=1;
s[1][1]=1;
for (i=2; i<=MAX; i++)
for (j=1; j<=i; j++)
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%MOD;
for (i=2; i<=MAX; i++)
for (j=1; j<=i; j++)
S[i][j]=(S[i-1][j-1]+j*S[i-1][j])%MOD;
fin>>t;
while (t)
{
fin>>c>>n>>m;
if (c==1)
fout<<s[n][m]<<"\n";
else
fout<<S[n][m]<<"\n";
t--;
}
return 0;
}