Cod sursa(job #1594599)
| Utilizator | Data | 9 februarie 2016 16:41:53 | |
|---|---|---|---|
| Problema | Numerele lui Stirling | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("stirling.in");
ofstream fout("stirling.out");
int s[201][201],S[201][201],mod=98999;
void dinamica()
{
int i,j;
s[0][0]=S[0][0]=1;
for(i=1;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 n,i,a,b,c;
fin>>n;
dinamica();
for(i=1;i<=n;i++)
{
fin>>a>>b>>c;
if(a==1) fout<<s[b][c]<<"\n";
else fout<<S[b][c]<<"\n";
}
}
