Search found 51 matches

by fpavetic
Mon Feb 26, 2007 3:27 pm
Forum: Volume 111 (11100-11199)
Topic: 11184 - Joyful Ride
Replies: 11
Views: 7077

11184 - Joyful Ride

hello
can somebody please give a hint about this problem?

thank you
by fpavetic
Sat Jan 20, 2007 7:33 pm
Forum: Bugs and suggestions
Topic: statistics error
Replies: 1
Views: 1422

statistics error

hello

my statistics sais i solved 759 problems, but actually i solved 755. i guess it has something to do with contest that was recently erased :roll:
by fpavetic
Sat Dec 30, 2006 11:26 pm
Forum: Volume 111 (11100-11199)
Topic: 11152 - Colourful Flowers
Replies: 45
Views: 21656

emotional blind wrote:Strange :roll:
What is your outout in that case? :-?
785398.1634 0.0000 0.0000
by fpavetic
Sat Dec 30, 2006 11:09 pm
Forum: Volume 111 (11100-11199)
Topic: 11152 - Colourful Flowers
Replies: 45
Views: 21656

emotional blind wrote:
fpavetic wrote:there can be cases where sum of length of two sides is less than length of third side. try this case: 1 2 1000
I dont think so. I got Accepted without checking this.
i got accepted after checking that :)
by fpavetic
Sat Dec 30, 2006 9:41 pm
Forum: Volume 111 (11100-11199)
Topic: 11152 - Colourful Flowers
Replies: 45
Views: 21656

there can be cases where sum of length of two sides is less than length of third side. try this case: 1 2 1000
by fpavetic
Sun Dec 03, 2006 2:10 am
Forum: Volume 102 (10200-10299)
Topic: 10215 - The Largest/Smallest Box ...
Replies: 55
Views: 29179

i got this problem accepted by storing intermediate calculations in long double, and printing the result as double after many failed submissions.
by fpavetic
Sat Nov 18, 2006 10:17 pm
Forum: Volume 111 (11100-11199)
Topic: 11106 - Rectilinear Polygon
Replies: 33
Views: 9268

gvcormac wrote: If you insist on implementing the problem as specified, you have to worry about segment intersection. There are algorithms for this but sub-quadratic is complicated.
in this case it is not that complicated because there are only vertical and horizontal segments.
by fpavetic
Wed Nov 15, 2006 8:08 pm
Forum: Volume 1 (100-199)
Topic: 110 - Meta-Loopless Sorts
Replies: 92
Views: 7504

thank you. i rewrote my solution and i found that a correct solution should contain exactly n!-1 comparisons
by fpavetic
Fri Nov 03, 2006 10:56 pm
Forum: Volume 1 (100-199)
Topic: 110 - Meta-Loopless Sorts
Replies: 92
Views: 7504

can someone please confirm that these are correct outputs for 1,2, 3 and 4. i constantly get output limit exceeded. and if i get rid of indentation, i get wa program sort(input,output); var a : integer; begin readln(a); writeln(a) end. program sort(input,output); var a,b : integer; begin readln(a,b)...
by fpavetic
Tue Oct 24, 2006 9:56 pm
Forum: Volume 111 (11100-11199)
Topic: 11136 - Hoax or what
Replies: 31
Views: 17530

artikali: just add ml.clear() at the begining of each case and you'll get your solution accepted

although i am surprised that a solution using cin for reading passes
by fpavetic
Sun Oct 15, 2006 6:37 pm
Forum: Volume 111 (11100-11199)
Topic: 11122 - Tri Tri
Replies: 29
Views: 8796

kalinov wrote:
david wrote:Anyway here's my code, in case someone wants to test it.
Your program fails on this case:

Code: Select all

input:
1

0 0 5 0 2 4
4 0 6 0 -4 16

output:
pair 1: yes
hvala :)

and here is one more test case that helped me:

1

0 1 2 0 3 1
1 3 2 0 3 3

output:

pair 1: yes
by fpavetic
Sat Oct 14, 2006 7:45 pm
Forum: Volume 111 (11100-11199)
Topic: 11124 - Troubles for Modern Days Problemsetters
Replies: 7
Views: 4729

there is a way to find kth element in unsorted sequence in O(n) average, where n is the length of the sequence.
by fpavetic
Sat Oct 14, 2006 7:40 pm
Forum: Volume 111 (11100-11199)
Topic: 11122 - Tri Tri
Replies: 29
Views: 8796

i think that output for tc9 should be no, because the only points these two triangles share are on the edge they share, and according to the problem statement, points on edges are not interior. or have i misunderstood something?
by fpavetic
Sat Oct 14, 2006 6:13 pm
Forum: Volume 111 (11100-11199)
Topic: 11122 - Tri Tri
Replies: 29
Views: 8796

11122 - Tri Tri

can anybody provide some tricky cases for this task? thanks some io: 11 0 0 2 0 0 2 1 1 3 3 2 3 0 0 2 0 0 2 3 0 5 0 4 2 0 0 1 0 1 1 0 0 1 0 1 1 0 0 0 1 1 0 0 0 3 1 1 3 0 0 100 0 0 100 1 1 3 1 1 3 1 1 3 1 1 3 0 0 100 0 0 100 0 0 2 0 0 2 0 0 1 0 0 1 0 0 1 0 0 1 0 0 2 0 0 2 0 0 0 1 1 0 0 1 1 0 1 1 0 0 ...
by fpavetic
Sat Sep 30, 2006 11:31 am
Forum: Volume 9 (900-999)
Topic: 902 - Password Search
Replies: 68
Views: 31791

think about hashing so you can get rid of slen constant :: "To simplify things, you can assume that the text only includes lower case letters."

Go to advanced search