Cod sursa(job #1890117)
| Utilizator | Data | 23 februarie 2017 08:32:15 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <fstream>
using namespace std;
ifstream f("stirling.in");
ofstream g("stirling.out");
int mod = 98999;
int str[2][205][205],n,i,j,q;
int main() {
str[0][1][1]=str[1][1][1] = 1;
for (i = 2; i <= 200; i++)
for (j = 1; j <= i; j++) {
str[0][i][j] = (str[0][i-1][j-1] - (str[0][i-1][j]*(i-1))%mod)%mod;
str[1][i][j] = (str[1][i-1][j-1] + (str[1][i-1][j]*j)%mod)%mod;
}
f >> q;
while (q--) {
f >> n >> i >> j;
g << str[n-1][i][j]%mod<<'\n';
}
return 0;
}
