Cod sursa(job #2535611)
| Utilizator | Data | 1 februarie 2020 09:21:39 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
#define Mod 98999
using namespace std;
ifstream in("stirling.in");
ofstream out("stirling.out");
int t,x,n,m;
int s[201][201],s1[201][201];
int main()
{
in>>t;
s[1][1]=s1[1][1]=1;
for(int i=2; i<=200; i++)
{
for(int j=1; j<=i; j++)
{
s[i][j]=(s[i-1][j-1]+j*s[i-1][j]%Mod)%Mod;
s1[i][j]=(s1[i-1][j-1]-s1[i-1][j]*(i-1)%Mod)%Mod;
}
}
for(int i=1; i<=t; i++)
{
in>>x>>n>>m;
if(x==2)
{
out<<s[n][m];
}
else
{
out<<s1[n][m];
}
out<<'\n';
}
return 1024;
}
