Mai intai trebuie sa te autentifici.
Cod sursa(job #3157331)
| Utilizator | Data | 15 octombrie 2023 12:52:28 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
int s[203][203],M[203][203], t,n,m,x;;
void st1()
{
for(int i=2;i<=200;i++)
for(int j=1;j<=i;j++)
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%98999;
}
void st2()
{
for(int i=2;i<=200;i++)
for(int j=1;j<=i;j++)
M[i][j]=(M[i-1][j-1]+j*M[i-1][j])%98999;
}
int main()
{
s[1][1]=M[1][1]=1;
st1();
st2();
fin>>t;
while(t--)
{
fin>>x>>n>>m;
if(x==1)
fout<<s[n][m]<<'\n';
else
fout<<M[n][m]<<'\n';
}
return 0;
}
