中文
English
Toggle navigation
YSACODE
F.A.Qs
Web Board
ProblemSet
Source/Category
Status
Ranklist
Contest
[
ProblemSet
Status
Ranklist
OI Ranklist
Statistics
]
Login
Problem D: 平面分割
Problem D: 平面分割
Time Limit:
1 Sec
Memory Limit:
64 MB
Submit:
17
Solved:
10
[
Submit
] [
Status
] [
Web Board
] [Creator:
]
Description
平面上有 n 条封闭曲线,其中任何两条封闭曲线恰好相交于两点,且任何三条封闭曲线不相交于同一点,计算这些封闭曲线把平面分割成的区域个数。
Sample Input
Copy
3
Sample Output
Copy
8