Pagini recente » Cod sursa (job #138822) | Cod sursa (job #3292099) | Cod sursa (job #1640627) | Cod sursa (job #1834107) | Cod sursa (job #1148008)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("diamant.in");
ofstream fout("diamant.out");
int v[402],d[40][50000];
int main()
{
int n,m,x,i,j,k,mar,ha;
fin>>n>>m>>x;
fin.close();
mar=n*(n+1)*m*(m+1)/4;
if(x<0)
x*=-1;
if(mar<x)
fout<<"0\n";
else
{
k=1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
v[k++]=i*j;
d[1][1]=1;
for(i=2;i<=n*m;i++)
{
for(j=0;j<=mar;j++)
{
d[i][j]=d[i-1][j];
ha=j-v[i];
if(ha<0)
ha*=-1;
d[i][j]+=d[i-1][ha];
if(j+v[i]<=mar)
d[i][j]+=d[i-1][j+v[i]];
}
}
// for(i=0;i<=n*m;i++)
// cout<<v[i]<<' ';
for(i=0;i<=n*m;i++)
{
for(j=0;j<=mar;j++)
cout<<d[i][j]<<' ';
cout<<'\n';
}
fout<<d[n*m][x];
}
return 0;
}