Search found 5 matches

by AxM
Sat Sep 29, 2007 1:11 am
Forum: Volume 110 (11000-11099)
Topic: 11096 - Nails
Replies: 28
Views: 14214

hahaha what a stupid mistake...

I need more I/O !
by AxM
Fri Sep 28, 2007 6:53 pm
Forum: Volume 110 (11000-11099)
Topic: 11096 - Nails
Replies: 28
Views: 14214

why

input

1 2
1 0
2 0

output

2.00000

??
by AxM
Fri Sep 28, 2007 5:53 pm
Forum: Volume 110 (11000-11099)
Topic: 11096 - Nails
Replies: 28
Views: 14214

Hi there is anybody to help me?? Some I/O ?? But why WA. this is my code #include <iostream.h> #include <stdlib.h> #include <stdio.h> #include <math.h> #include <string.h> typedef struct { long long x; long long y; }Point; Point point[101]; Point p0; long stack[101]; long long ps; long long i,a; lon...
by AxM
Sat Oct 21, 2006 8:38 am
Forum: Volume 111 (11100-11199)
Topic: 11122 - Tri Tri
Replies: 29
Views: 8772

Just sweeping left to right is enough. Imagine a vertical line through each vertex. You get O(N) strips, and in each strip at most 4 edges => each strip can be processed in O(1) time. That's all. Could you explain the process? step by step.. I cant figure out what I have to search in each strip. If...
by AxM
Thu Oct 19, 2006 5:28 pm
Forum: Volume 111 (11100-11199)
Topic: 11123 - Counting Trapizoid
Replies: 16
Views: 5676

I have all the slopes in an STRUCT, so I want to sort them.. but I think that an n^2 algorithm is not the answer, so how can I sort an struct using qsort C++? or.. If you have another idea?

Go to advanced search