No tags yet

No tag edit access

В условии задачи недавно были сделаны правки. Просмотреть изменения.

×
time limit per test: 0.25 sec.

memory limit per test: 65536 KB

memory limit per test: 65536 KB

input: standard

output: standard

output: standard

Consider N different lines on the plane. They divide it to several parts,some of which are finite, some infinite.

Your task in this problem is for each finite part to find its area.

Your task in this problem is for each finite part to find its area.

The first line of the input file contains N — the number of lines (1 ≤ N ≤ 80). Each of next N lines contains four integer numbers x

All coordinates do not exceed 10

No two lines coincide.

First output K — the number of finite parts among those the lines divide the plane to.

Next K lines of the output file must contain area parts sorted in non-decreasing order. You answer must be accurate up to 10

Due to floating point precision losses possible, do not consider parts with area not exceeding 10

Input

5

0 0 1 0

1 0 1 1

1 1 0 1

0 1 0 0

0 0 1 1

0 0 1 0

1 0 1 1

1 1 0 1

0 1 0 0

0 0 1 1

Output

2

0.5000

0.5000

0.5000

0.5000

Author: | Andrew Stankevich |

Resource: | Petrozavodsk Summer Trainings 2003 |

Date: | 2003-08-30 |

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Sep/29/2020 14:40:18 (i2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|