Search found 15 matches

by Pedrinho UFPE
Sat Jun 21, 2003 5:53 am
Forum: Volume 3 (300-399)
Topic: 310 - L--system
Replies: 29
Views: 8452

What's the correct meaning of this problem?

Do we must to change all the letters every step, or no?
Please.. I cant get Accepted.
I've done what DailyBite've done.. are we correct?

Thank you VERY much!
by Pedrinho UFPE
Fri May 02, 2003 1:49 am
Forum: Volume 1 (100-199)
Topic: 175 - Keywords
Replies: 13
Views: 3553

175 - Keywords

Hi people, I'm getting WA in this problem. But I think there's some ambiguities. Can anyone who had AC explain those ambiguities? Thanks. 1) If we have a profile with more than 2 words, we have to search for All the pairs that we can have (a) with the K words or aonly pair by pair (b)? Example: a - ...
by Pedrinho UFPE
Thu Apr 17, 2003 5:35 pm
Forum: Volume 1 (100-199)
Topic: 171 - Car Trialling
Replies: 19
Views: 4404

I din't believe it.. how I'm stupid!!
Thank you little joey very much, I would never get by myself.
:)
by Pedrinho UFPE
Thu Apr 17, 2003 5:49 am
Forum: Volume 1 (100-199)
Topic: 171 - Car Trialling
Replies: 19
Views: 4404

171 - Car Trialling

This problem must be REALLY tricky.
I'm trying it for a long time, and I took an enormous test case of more then 500 tests.. and I still WA! Can somebody who had AC see what is my problem?

Code: Select all

... :) .. ok little joey, by your commands  


Thank you very much for any help!!

Pedro
by Pedrinho UFPE
Mon Apr 14, 2003 6:33 pm
Forum: Volume 1 (100-199)
Topic: 157 - Route Finding
Replies: 17
Views: 2507

Still WA :(
by Pedrinho UFPE
Mon Apr 14, 2003 3:24 am
Forum: Volume 1 (100-199)
Topic: 149 - Forests
Replies: 37
Views: 3944

Excuse me people! I've pressed the wrong button :(
by Pedrinho UFPE
Mon Apr 14, 2003 3:12 am
Forum: Volume 1 (100-199)
Topic: 149 - Forests
Replies: 37
Views: 3944

Forests

I've already solved the problem. Anyway Thank you for the help. (The problem was 149, we can see it at acm.uva.es/p/v1/ the link Forests)
by Pedrinho UFPE
Sun Apr 13, 2003 2:32 am
Forum: Volume 1 (100-199)
Topic: 149 - Forests
Replies: 37
Views: 3944

Forests

Hi!

When I tried to solve this problem I found in my solution 312 trees in the firs quadrant (x > 0 && y > 0). It makes me crazy cause I didn't find any error in the logic or elsewhere.. :evil:

I think I didn't understand the limit of the vision field of the guy.
0,01
by Pedrinho UFPE
Fri Apr 11, 2003 3:35 am
Forum: Volume 1 (100-199)
Topic: 139 - Telephone Tangles
Replies: 66
Views: 7787

I found

I found my problem.
If someone has a problem with this problem cansend a e-mail and i'll reply.
This problem is REALLY TRICKY!!! :-)

pmmc@cin.ufpe.br
by Pedrinho UFPE
Thu Apr 10, 2003 6:09 pm
Forum: Volume 1 (100-199)
Topic: 139 - Telephone Tangles
Replies: 66
Views: 7787

139 - Telephone Tangles

Hi!
This problem is really tricky and I couldn't got it yet :(.
I try everthing I could wonder.
Case like:

03 Arrow.town$ 38
0061 Australia$ 140
0911 N
by Pedrinho UFPE
Wed Oct 23, 2002 4:28 am
Forum: Volume 100 (10000-10099)
Topic: 10056 - What is the Probability ?
Replies: 26
Views: 8023

solved

I got AC.
The problem was precision error.
I have to print p + EPSILON...

Thanks all :-)
by Pedrinho UFPE
Wed Oct 23, 2002 3:54 am
Forum: Volume 100 (10000-10099)
Topic: 10056 - What is the Probability ?
Replies: 26
Views: 8023

why WA??

Hi people! I'm tired having WA in this question!! I real dont know why! The case of p = 0.000000 is ok My code is below: [cpp] #include <stdio.h> #include <math.h> double N, n, p; void readdata() { scanf("%lf%lf%lf",&N,&p,&n); } void process() { if(p == 0) { printf("%.4lf\n",0); return; } printf("%....
by Pedrinho UFPE
Thu Sep 19, 2002 12:58 am
Forum: Volume 102 (10200-10299)
Topic: 10212 - The Last Non-zero Digit.
Replies: 63
Views: 30163

10212 - the problem of an O(n) solution

I have a problem with the complexity of my algorithm to solve this problem. :-? let pick N and M, with N >= M if we do: [cpp] unsigned long i, k = 1; for(i=M+1;i<=N;i++) { k = k * i; takeTheZerosFrom(k); takeTheGoodPartOf(k); } printf("%u\n",lastDigitOf(k)); [/cpp] it produces the right solution. ta...
by Pedrinho UFPE
Tue Sep 10, 2002 2:47 am
Forum: Volume 103 (10300-10399)
Topic: 10314 - Three Pigs
Replies: 20
Views: 9628

Three pigs reduction

Are you sure it's a NP-Problem? Why? This problem is: Given a graph G = (V,E), a subset S of V and 2 vertices x and y of V, find a path from x to y visiting the maximum elements of S. For each vertex v of the path xy in S, do S' = S - {v}. Return to the first problem with S'. Do this 2 times, and pr...
by Pedrinho UFPE
Tue Sep 10, 2002 2:05 am
Forum: Volume 2 (200-299)
Topic: 209 - Triangular Vertices
Replies: 51
Views: 6634

Problem 209 - Big trouble

Hi people! Thanks for Ivor and Adrian Kougel for the interesting commentaries about this problem. But, I'm here to tell that a shape like {2,5,3,6,8,9} should be accepted, the problem dont wanna a "regular convex" hexagon. At least the problem statment don't tell anything about it. / / \ \ Another ...

Go to advanced search