209. Areas
time limit per test: 0.25
sec.
memory limit per test: 65536
KB
input: 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.
Input
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_{1}, y_{1}, x_{2} and y_{2} — the coordinates of two different points of the line.
All coordinates do not exceed 10^{2} by their absolute value.
No two lines coincide.
Output
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 nondecreasing order. You answer must be accurate up to 10^{4}.
Due to floating point precision losses possible, do not consider parts with area not exceeding 10^{8}.
Sample test(s)
Input
5
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
Author:  Andrew Stankevich

Resource:  Petrozavodsk Summer Trainings 2003

Date:  20030830

Server time: 20170923 04:15:30  Online Contester Team © 2002  2016. All rights reserved. 

