Pagini recente » Cod sursa (job #3269797) | Cod sursa (job #156467) | Cod sursa (job #1578756) | Cod sursa (job #3169461) | Cod sursa (job #3250516)
#include <bits/stdc++.h>
using namespace std;
const int NMAX = 201;
const int MOD = 98999;
int s[NMAX][NMAX],S[NMAX][NMAX];
ifstream f("stirling.in");
ofstream g("stirling.out");
int main()
{
int t,c,n,m;
f>>t;
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[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]+j*S[i-1][j])%MOD;
}
}
while(t--)
{
f>>c>>n>>m;
if(c==2)
g<<s[n][m]<<'\n';
else
g<<S[n][m]<<'\n';
}
return 0;
}