Pagini recente » Cod sursa (job #152948) | Cod sursa (job #2204768) | Cod sursa (job #1776324) | Cod sursa (job #1830673) | Cod sursa (job #1989518)
#include<fstream>
using namespace std;
ifstream in("diamant.in");
ofstream out("diamant.out");
int sum,i,j,v[4001],d,n,m,k,sol,mat[2][90200],bonus;
int main(){
in >> n >> m >> k;
for( i = 1; i <= n; i ++ ){
for( j = 1; j <= m; j ++ ){
v[++d]=i*j;
sum+=i*j;
}
}
sum+=n*m;
if( k < -1*sum ){
out<<0;
}
else{
for( i = 1; i <= d; i ++ ){
for( j = -sum+n*m; j <= sum;j ++ ){
bonus = 0;
if(mat[(i-1)%2][j+sum-v[i]] > 0 ){
bonus+=mat[(i-1)%2][j+sum-v[i]];
}
if( mat[(i-1)%2][j+sum+v[i]] > 0 ){
bonus+=mat[(i-1)%2][j+sum+v[i]];
}
if( v[i] == j || v[i] == -1*j ){
bonus += 1;
}
mat[i%2][j+sum] = bonus + mat[(i-1)%2][j+sum];
}
}
out << mat[d%2][k+sum];
}
return 0;
}