1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
| #include <stdio.h> int maxX, maxY; int idxX, idxY; int main() { int k, dir[6], len[6]; int i; int maxY, maxX; int answer = 0; maxY = maxX = 0; scanf ( "%d" ,&k); for (i = 0 ; i < 6; i++) { scanf ( "%d%d" ,dir+i, len+i); if (dir[i] > 2) maxY = (maxY > len[i])?maxY:len[i]; else maxX = (maxX > len[i])?maxX:len[i]; } answer = len[0] * len[5]; for (i = 1 ; i < 6 ;i++) { answer += len[i] * len[i-1]; } answer -= 2*(maxY*maxX); printf ( "%d" ,answer * k); return 0; } |