n = int(input())
L = []
L1 = []
p = 0
for i in range(200):
for j in range(200):
L1 = L1 + [0]
L = L + [L1]
L1 = []
for m in range(n):
x,y = map(int, input().split())
xk = x // 2
yk = y // 2
for i in range(yk):
for j in range(xk):
L[i][j] = 1
for i in range(200):
for j in range(200):
if L[i][j] == 1:
p = p + 1
print(p*4)
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
56 ms |
3636 KB |
Output is correct |
2 |
Correct |
55 ms |
3636 KB |
Output is correct |
3 |
Correct |
55 ms |
3672 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
50 ms |
3716 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
50 ms |
3776 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
49 ms |
3776 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
50 ms |
3780 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
128 ms |
3788 KB |
Output is correct |
2 |
Correct |
126 ms |
3832 KB |
Output is correct |
3 |
Correct |
124 ms |
3868 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
50 ms |
3892 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
51 ms |
3892 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
50 ms |
3892 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Runtime error |
50 ms |
3892 KB |
Execution failed because the return code was nonzero |
2 |
Halted |
0 ms |
0 KB |
- |