Cod sursa(job #2007539)
| Utilizator | Data | 3 august 2017 11:06:28 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
#define mod 98999
using namespace std;
ifstream f("stirling.in");
ofstream g("stirling.out");
long long s[205][205],S[205][205],n,t,m,x;
void precalc()
{
s[0][0]=S[0][0]=1;
for(int i=1;i<=200;++i)
{
for(int j=1;j<=i;++j)
{
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%mod;
S[i][j]=(S[i-1][j-1]+j*S[i-1][j])%mod;
}
}
}
int main()
{
precalc();
f>>t;
for(int i=1;i<=t;++i)
{
f>>x>>n>>m;
if(x==1) g<<s[n][m]<<'\n';
else g<<S[n][m]<<'\n';
}
return 0;
}
