/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 37ms 18.258 MiB
#2 Accepted 38ms 17.863 MiB
#3 Accepted 37ms 17.875 MiB
#4 Accepted 38ms 17.992 MiB
#5 Accepted 38ms 17.746 MiB
#6 Accepted 38ms 17.75 MiB

Code

#!/usr/bin/env python3
import sys
import math
import random
import os
from io import BytesIO, IOBase

FAST_IO_BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._file = file
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, FAST_IO_BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, FAST_IO_BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

class solution:
    lim = 2 * 10**6 + 5

    def __init__(self) -> None:
        pass

    def solve(self) -> None:
        self.solve_case()

    def solve_case(self) -> None:
        h, w = map(int, input().split())
        mn = min(h, w)
        ans = 0
        for i in range(0, mn):
            ans += (h - i) * (w - i)
        print(ans)
        
if __name__ == "__main__":
    solution().solve()

Information

Submit By
Type
Submission
Problem
P1121 Square Counting Challenge
Contest
Lockout contest round-1 ( Araf al jami vs Kamonasish Roy)
Language
PyPy 3 (Python 3.9.18 PyPy 7.3.15)
Submit At
2024-10-30 15:18:48
Judged At
2024-10-30 15:18:48
Judged By
Score
100
Total Time
38ms
Peak Memory
18.258 MiB