Cod sursa(job #2070027)
| Utilizator | Data | 19 noiembrie 2017 10:20:52 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#define mod 98999
using namespace std;
int s[205][205], S[205][205], n, m, t;
fstream f1("stirling.in", ios::in);
fstream f2("stirling.out", ios::out);
void precalc()
{
int i, j;
S[1][1]=s[1][1]=1;
for(i=2; i<=200; i++)
for(j=1; j<=200; 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;
}
}
int main()
{
int x, n, m;
precalc();
f1 >>t;
while(t--)
{
f1>>x>>n>>m;
if(x==1) f2<<s[n][m];
else f2<<S[n][m];
f2<<"\n";
}
return 0;
}
