Search found 26 matches

by luishhh
Mon Oct 02, 2006 12:13 am
Forum: Volume 110 (11000-11099)
Topic: 11037 - Point of View in Flatland
Replies: 15
Views: 7730

Hi! I'm getting WA in this problem, I tried Darko's input in the first post of this thread and got 2.32 -2.32 3.04 -1.91 1.91 -3.04 1.73 -1.73 is it correct? My approach to the problem is quite simple. The goal is to reach a point such that the quotient between the distance to the center of a circle...
by luishhh
Tue Mar 21, 2006 5:45 pm
Forum: Volume 110 (11000-11099)
Topic: 11013 - Get Straight
Replies: 12
Views: 4364

I suppose eveything is ok now, because I got WA twice ot three times yesterday and today this problem appears in my list of AC
by luishhh
Wed Dec 28, 2005 1:04 pm
Forum: Volume 109 (10900-10999)
Topic: 10967 - The Great Escape
Replies: 1
Views: 1540

It would be easier if you write or generate input, think about corner cases
by luishhh
Mon Nov 14, 2005 11:07 pm
Forum: Volume 109 (10900-10999)
Topic: 10965 - Khepel's Problem
Replies: 18
Views: 5246

10965 - Khepel's Problem

Hi I think this problem is badly specified, basically I don't know how to handle questions such: does [0,1] overlaps [1,2]? I consider the time the cat is sleeping as a closed interval, as well as the times the sprinklers are pouring water in each cell. Maybe this approach is wrong and I should have...
by luishhh
Mon Nov 14, 2005 6:54 pm
Forum: Volume 100 (10000-10099)
Topic: 10035 - Primary Arithmetic
Replies: 328
Views: 54622

Thank you very much ayon! AC
I think I would have never find the spelling mistake. Surely I would have rewritten the code :D
by luishhh
Tue Oct 18, 2005 11:26 pm
Forum: Volume 109 (10900-10999)
Topic: 10938 - Flea circus
Replies: 14
Views: 7777

Thank you very much!!!!
I thought the bug was in the loop... but again it was a silly case
AC in 2 tenths, my algorithm was better than I expected :D
by luishhh
Mon Oct 17, 2005 8:31 pm
Forum: Volume 109 (10900-10999)
Topic: 10938 - Flea circus
Replies: 14
Views: 7777

Why RE!

My approach to this problem is to build the tree while reading the input, for each case. It might not the best one, but I am triyng to make it work. It has given me repeatedly RuntimeError, and I don't know why it cracks. This is my code for reading the input and bulding the tree, if anybody finds t...
by luishhh
Mon Oct 17, 2005 3:48 pm
Forum: Volume 109 (10900-10999)
Topic: 10936 - Land surveyor's job
Replies: 10
Views: 6231

you shouldn't add A[n].distance to total
try it now
by luishhh
Thu Sep 22, 2005 11:49 pm
Forum: Volume 100 (10000-10099)
Topic: 10035 - Primary Arithmetic
Replies: 328
Views: 54622

10035 Primary Artihmetic

Hi! I have no idea why my code is wrong... if anybody finds a silly mistake please reply! /*Primary Arithmetic 10035 UVA*/ #include <stdio.h> int main () { int a, b; int carries, mellevo; for (;;) { scanf ("%u %u", &a, &b); if (a == 0 && b == 0) break; carries = 0; mellevo = 0; while (a > 0 || b > 0...
by luishhh
Tue Oct 26, 2004 11:31 pm
Forum: Volume 4 (400-499)
Topic: 495 - Fibonacci Freeze
Replies: 222
Views: 28621

I got AC !!!
Thanks very much, I had some headache with this problem :D
by luishhh
Mon Oct 25, 2004 8:28 pm
Forum: Volume 4 (400-499)
Topic: 495 - Fibonacci Freeze
Replies: 222
Views: 28621

495 - Fibonacci Freeze

Hi all I dont know why my problem is wrong, it gave OLE last time i submitted Please, if anybody finds a silly mistake, reply the topic Here is the source code [c] /* Fibonacci Freeze UVA 495 */ #include <stdio.h> #include <string.h> int fibo [5010] [1100]; int main () { int llevo, i, j; int n; mems...

Go to advanced search