Cod sursa(job #588021)
| Utilizator | Data | 6 mai 2011 18:56:00 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream.h>
#define N 201
int t,n,m,k,i,j,l,s[N][N],S[N][N];
int main()
{ifstream f("stirling.in");
ofstream g("stirling.out");
f>>t;
s[0][0]=S[0][1]=1;
s[0][1]=S[0][1]=0;
for(i=1;i<N;i++)
{for(j=i;j<N;j++)
{s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%98999;
S[i][j]=(S[i-1][j-1]+j*S[i-1][j])%98999;}}
for(l=1;l<=t;l++)
{f>>k>>n>>m;
if(k==1)
g<<s[n][m]<<"\n";
else
g<<S[n][m]<<"\n";}
f.close();
g.close();
return 0;}
