Accepted
Code
#why you don't get merried now?
H, W = map(int,input().split())
badha = min(H, W)
mut_hisab = 0
for i in range(1, badha + 1):
mut_hisab += (H - i + 1) * (W - i + 1)
print(mut_hisab)
Information
- Submit By
-
Maher_vai LV 4
- Type
- Submission
- Problem
- P1121 Square Counting Challenge
- Contest
- Brain Booster #7
- Language
- Python 3 (Python 3.12.3)
- Submit At
- 2024-11-05 14:45:19
- Judged At
- 2024-11-05 14:45:19
- Judged By
-
judge
- Score
- 100
- Total Time
- 14ms
- Peak Memory
- 3.129 MiB