Pagini recente » Borderou de evaluare (job #3157266) | Borderou de evaluare (job #2025636) | Cod sursa (job #2231562) | Borderou de evaluare (job #1263838) | Cod sursa (job #978903)
Cod sursa(job #978903)
#include <iostream>
#include <fstream>
using namespace std;
int s[205][205],S[205][205],n,m,i,x,t;
int main(void)
{
s[0][0]=1;
for (n=1;n<=200;n++)
for (m=1;m<=200;m++)
{
s[n][m]=s[n-1][m-1]-(n-1)*s[n-1][m];
}
for (i=1;i<=200;i++)
S[i][1]=S[i][i]=1;
for (n=1;n<=200;n++)
for (m=2;m<=200;m++)
{
S[n][m]=S[n-1][m-1]+m*S[n-1][m];
}
FILE * f;
f=fopen("stirling.in","r");
ofstream g("stirling.out");
fscanf(f,"%d",&t);
for (i=1;i<=t;i++)
{
fscanf(f,"%d%d%d",&x,&n,&m);
if (x==1)
g<<s[n][m]<<'\n';
if (x==2)
g<<S[n][m]<<'\n';
}
g.close();
return 0;
}