Cod sursa(job #806144)
| Utilizator | Data | 1 noiembrie 2012 21:38:11 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream F("stirling.in");
ofstream G("stirling.out");
int Nmax = 200;
int Mod = 98999;
int s[210][210];
int S[210][210];
int N,M,T;
int main()
{
s[1][1]=S[1][1]=1;
for (int i=2;i<=Nmax;++i)
for (int j=1;j<=i;++j)
{
s[i][j]=( s[i-1][j-1]-(i-1)*s[i-1][j] ) % Mod;
S[i][j]=( S[i-1][j-1]+j*S[i-1][j] ) % Mod;
}
F>>T;
while ( T-- )
{
int Speta;
F>>Speta>>N>>M;
Speta=(Speta==1) ? s[N][M] : S[N][M];
G<<Speta<<'/n';
}
}
