Cod sursa(job #989505)
Utilizator | Data | 25 august 2013 18:55:46 | |
---|---|---|---|
Problema | Numerele lui Stirling | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define Nmax 202
uint64_t S[Nmax][Nmax];
int N, K;
void gen()
{
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] );
}
int main()
{
ifstream f("permutari.in");
ofstream g("permutari.out");
f >> N >> K;
gen();
g << S[N][K] << "\n";
f.close();
g.close();
return 0;
}