Cod sursa(job #2068703)
| Utilizator | Data | 18 noiembrie 2017 10:34:29 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#define MOD 98999
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
int dis1[210][210],dis2[210][210];
int main()
{
int t,i,x,n,m,j;
fin>>t;
dis1[1][1]=1;
dis2[1][1]=1;
n=200;m=200;
for(i=2;i<=n;i++)
{
for(j=1;j<=i;j++)
{
dis1[i][j]=(dis1[i-1][j-1]-dis1[i-1][j]*(i-1))%MOD;
dis2[i][j]=(dis2[i-1][j-1]+dis2[i-1][j]*j)%MOD;
}
}
for(i=1;i<=t;i++)
{
fin>>x>>n>>m;
if(x==1)
fout<<dis1[n][m]<<'\n';
else
fout<<dis2[n][m]<<'\n';
}
return 0;
}
