Cod sursa(job #3166531)
| Utilizator | Data | 8 noiembrie 2023 21:54:45 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#define mod 98999
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
int v[203][203], s[203][203];
int main()
{
int n, i, j, op, x, y;
fin>>n;
v[1][1]=s[1][1]=1;
for(i=2;i<=200;i++)
{
for(j=1;j<=i;j++)
{
s[i][j]=((s[i-1][j-1]-(i-1)*s[i-1][j]%mod))%mod;
v[i][j]=(v[i-1][j-1]+j*v[i-1][j]%mod)%mod;
}
}
for(i=1;i<=n;i++)
{
fin>>op>>x>>y;
if(op==1)
{
fout<<s[x][y]<<"\n";
}
else
{
fout<<v[x][y]<<"\n";
}
}
}
