Pagini recente » Cod sursa (job #2916409) | Cod sursa (job #289449) | Cod sursa (job #2375613) | Cod sursa (job #256169) | Cod sursa (job #1775615)
#include <fstream>
using namespace std;
ifstream f("diamant.in");
ofstream g("diamant.out");
int a[25][25],gr[100005],k,n,m,i,j,G,nr;
int main()
{
f>>n>>m>>k;
nr=0;
if(k<44100||k>44100)
{
g<<"0";
return 0;
}
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{
nr++;
gr[nr]=i*j;
nr++;
gr[nr]=i*j*(-1);
}
if(k<0) k=k*(-1);
a[0][0]=1;
for(i=1;i<=n;i++)
{
for(j=0;j<=k;j++)
{
if(gr[i]<=j) a[i][j]=a[i][j]+a[i-1][j-gr[i]];
else a[i][j]=a[i-1][j];
}
}
g<<a[nr][k];
return 0;
}