Cod sursa(job #1477874)
Utilizator | Panaete Adrian proflaurian | Data | 27 august 2015 11:52:39 |
---|---|---|---|
Problema | Numerele lui Stirling | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
#define N 202
#define M 98999
using namespace std;
ifstream f("stirling.in");
ofstream g("stirling.out");
int t,i,j,k,s[N][N],S[N][N];
int main()
{
for(i=1;i<N;i++)
for(j=1;j<N;j++)
s[i][j]=(s[i-1][j-1]-(i-1)*s[i-1][j])%M;
for(i=1;i<N;i++)
for(j=1;j<N;j++)
S[i][j]=(S[i-1][j-1]+j*S[i-1][j])%M;
f>>t;
for(;t;t--)
{
f>>i>>j>>k;
if(k==1)
g<<s[i][j]<<'\n';
else
g<<S[i][j]<<'\n';
}
return 0;
}
void afiseaza(int m)
{
for(int j=1;m;j++,m>>=1)
if(m&1)
g<<j<<' ';
g<<'\n';
}