Pagini recente » Cod sursa (job #188335) | Cod sursa (job #809260) | Cod sursa (job #2816908) | Cod sursa (job #1941935) | Cod sursa (job #1969477)
#include <fstream>
using namespace std;
ifstream f ("stirling.in");
ofstream g ("stirling.out");
int t,n,m,i,j,s[201][201],S[201][201];
int main()
{
f>>t;
for(i=1;i<=200;++i)
{
for(j=1;j<=200;++j)
if(i>j)
{
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%98999;
S[i][j]=(S[i-1][j-1]+j*S[i-1][j])%98999;
}
else if(i==j) s[i][j]=S[i][j]=1;
}
for(int i=1;i<=t;++i)
{
f>>j>>n>>m;
if(j==1) g<<s[n][m]<<'\n';
else g<<S[n][m]<<'\n';
}
}