Universal Cup Judging System

Universal Cup

Time Limit: 2.0 s Memory Limit: 1024 MB Total points: 100 Difficulty: [show] Hackable ✓
Statistics

按逆時針順序畀定一個凸多邊形嘅 $n$ 個頂點 $P(0), P(1), \cdots, P(n - 1)$,共有 $\binom{n}{k}$ 種方法揀出 $k$ 個頂點 $P(i_0), P(i_1), \cdots, P(i_{k-1})$ ($0 \le i_0 < i_1 < \cdots < i_{k-1} < n$)。將揀出嚟嘅頂點按逆時針順序連埋一齊(即係對每個 $0 \le j < k$,連接頂點 $P(i_j)$ 同 $P(i_{(j+1) \bmod k})$),就可以形成一個有 $k$ 個頂點嘅凸多邊形。

對於每個 $3 \le k \le n$,考慮用上述方式形成嘅所有有 $k$ 個頂點嘅凸多邊形。請計算呢啲凸多邊形面積總和嘅兩倍。

輸入格式

每個測試文件只包含一個測試用例。

第一行包含一個整數 $n$ ($3 \le n \le 2 \times 10^5$),表示凸多邊形嘅頂點數量。

接住落嚟嘅 $n$ 行,第 $i$ 行包含兩個整數 $x_i$ 同 $y_i$ ($-10^9 \le x_i, y_i \le 10^9$),表示凸多邊形第 $i$ 個頂點嘅座標。頂點按逆時針順序畀出,且冇三個頂點共線。

輸出格式

輸出 $(n - 2)$ 行,每行包含一個整數,其中第 $i$ 行係 $k = i + 2$ 嘅答案。

可以證明答案一定係整數。由於答案可能好大,請將答案對 $998\,244\,353$ 取模後輸出。

樣例

樣例輸入 1

6
0 0
1 0
2 1
2 2
1 2
0 1

樣例輸出 1

36
54
30
6

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:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.