城市 - Problème

#5038. 城市

Statistiques

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

歡迎來到西安，各位 ICPC 參賽者。

西安是一座美麗的古都，曾是周、秦、漢、唐等朝代的首都。由於歷史悠久，西安的街道呈現網格狀分佈。

Coach Pang 對這種街道結構很感興趣，他想在黑板上畫一個 $n \times m$ 的網格進行研究。該網格由 $n + 1$ 條垂直線段和 $m + 1$ 條水平線段組成。這些垂直與水平線段在恰好 $(n + 1) \times (m + 1)$ 個點處相交，形成了 $n \times m$ 個單位正方形。我們將這 $(n + 1) \times (m + 1)$ 個交點稱為網格點。請輸出滿足以下三個條件的線段 $l$（不限於垂直或水平線段）的數量：

長度不為零。
$l$ 的兩個端點皆為網格點。
$l$ 的中點為網格點。

輸入格式

輸入僅包含一行，包含兩個整數 $n, m$ ($1 \le n, m \le 1000$)。

輸出格式

請在單行中輸出答案。

範例

輸入 1

1 1

輸出 1

輸入 2

2 3

輸出 2

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0