Cod sursa(job #2195389)
| Utilizator | Data | 16 aprilie 2018 11:37:53 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("stirling.in");
ofstream g("stirling.out");
const int N=201,MOD=98999;
int s[201][201],S[201][201];
int T,n,m,sp;
int main()
{
for(int i=0; i<=N-1; i++)
S[i][i]=s[i][i]=1;
for(int i=1; i<=N-1; i++)
for(int j=1; j<i; j++)
{
s[i][j]=s[i-1][j-1]-(i-1)*s[i-1][j];
S[i][j]=S[i-1][j-1]+j*S[i-1][j];
}
f>>T;
for(int i=1; i<=T; i++)
{
f>>sp>>n>>m;
if(sp==1) g<<s[n][m]<<'\n';
if(sp==2) g<<S[n][m]<<'\n';
}
return 0;
}
