Pagini recente » Istoria paginii jc2016/runda-2/solutii | Cod sursa (job #1856454) | Cod sursa (job #1566938) | Cod sursa (job #477424) | Cod sursa (job #2068653)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sterling.in");
ofstream fout("sterling.out");
int t,i,x,n,m,j;
int s[202][202], S[202][202];
int main()
{
s[1][1]=1;
for (i=2;i<=201;i++)
for (j=1;j<=i;j++)
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%98999;
S[1][1]=1;
for (i=2;i<=201;i++)
for (j=1;j<=i;j++)
S[i][j]=(S[i-1][j-1]+j*S[i-1][j])%98999;
fin>>t;
for (i=1;i<=t;i++)
{
fin>>x>>n>>m;
if (x==1)
fout<<s[n][m];
else fout<<S[n][m];
fout<<'\n';
}
return 0;
}