Start: Jul, 01, 2019 08:30:00
2019年度暑期短学期第四天
End: Jul, 01, 2019 11:30:00
Time elapsed:
Time remaining:

Problem_ID: A
Result: Accepted
Time: 8ms
Memory: 1120kB
Author: Oscar
In contest: 1277

#include <stdio.h>
#include <math.h>
int main (){
	int a,b,c,d,e,m,n,max;
	while(scanf("%d %d %d %d %d",&a,&b,&c,&d,&e)!=EOF){
	if(d>=e){
		if(d>=a||d>=b||d>=c){
		max=2*(e*a*b-(e*(a-2*e)*(b-2*e)))+4*e*e*(c-2*e);
		}
		else{
		m=2*(e*a*b-(e*(a-2*e)*(b-2*e)))+4*e*e*(c-2*e);
		n=(b-2*d)*(a-2*d)*(c-2*d);
		if(m>n){
		max=m;
		}else{
			max=n;
		}
	    }		
	}
	else
	{
	max=a*b*c-2*(((a-2*e)*(c-2*e)+(a-2*e)*(b-2*e)+(b-2*e)*(c-2*e))*d);
	}
	printf("%d\n",max);}
}