Cod sursa(job #2660663)
| Utilizator | Data | 19 octombrie 2020 23:28:25 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
#define MOD 98999
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
int s[202][202],S[202][202];
int main()
{
int t,p,n,m,i,j;
s[0][0]=1;
S[0][0]=1;
for(i=1;i<=200;i++)
for(j=1;j<=i;j++)
{
s[i][j]=s[i-1][j]*(1-i)+s[i-1][j-1];
s[i][j]%=MOD;
S[i][j]=S[i-1][j]*j+S[i-1][j-1];
S[i][j]%=MOD;
}
fin>>t;
for(i=1;i<=t;i++)
{
fin>>p>>n>>m;
if(p==1)
fout<<s[n][m];
else
fout<<S[n][m];
fout<<'\n';
}
return 0;
}
