Pagini recente » Cod sursa (job #238163) | Cod sursa (job #369022) | Cod sursa (job #2881580) | Cod sursa (job #1476370) | Cod sursa (job #2575687)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("diamant.in");
ofstream g("diamant.out");
int N,M,X,sum,nr,v[405],cnt;
const int c=10000,Mx=44100;
int dp[4500][4500];
int main()
{
f>>N>>M>>X;
for(int i=1; i<=N; i++)
for(int j=1; j<=M; j++)
{
sum+=(i*j);
v[++cnt]=i*j;
}
if(sum==X)
g<<1;
else
{
if(sum<X)
g<<0;
else{
dp[0][X]=1;
for(int i=1;i<=M*N;i++)
{
for(int j=0;j<=2*X;j++)
dp[i][j+X]=dp[i-1][j+X-v[i]]+dp[i-1][j+X+v[i]]+dp[i-1][j+X];
}
}
}
g<<dp[N*M][X];
return 0;
}