Accepted
Code
def count_square_subgrids(H, W):
max_square_size = min(H, W)
total_count = 0
for n in range(1, max_square_size + 1):
subgrids_count = (H - n + 1) * (W - n + 1)
total_count += subgrids_count
return total_count
H, W = map(int,input().split())
print(count_square_subgrids(H, W))
Information
- Submit By
- Type
- Submission
- Problem
- P1121 Square Counting Challenge
- Contest
- Brain Booster #7
- Language
- Python 3 (Python 3.12.3)
- Submit At
- 2024-11-05 14:44:34
- Judged At
- 2024-11-05 14:44:34
- Judged By
- Score
- 100
- Total Time
- 14ms
- Peak Memory
- 3.023 MiB