Cod sursa(job #2809351)
| Utilizator | Data | 26 noiembrie 2021 18:46:01 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
const int MOD = 98999;
int s[2][201][201];
int main() {
int T, a, b, c;
s[0][0][0] = s[1][0][0] = 1;
for(int i = 1; i <= 200; i++)
for(int j = 1; j <= i; j++) {
s[0][i][j] = (s[0][i-1][j-1] - (i - 1) * s[0][i-1][j]) % MOD;
s[1][i][j] = (s[1][i-1][j-1] + j * s[1][i-1][j]) % MOD;
}
fin >> T;
while(T--) {
fin >> a >> b >> c;
fout << s[a-1][b][c] << "\n";
}
return 0;
}