OJ Board

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!

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 ...

I din't believe it.. how I'm stupid!!
Thank you little joey very much, I would never get by myself.

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?


Thank you very much for any help!!

Pedro

Still WA

Excuse me people! I've pressed the wrong button

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)

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..

I think I didn't understand the limit of the vision field of the guy.
0,01

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

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

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

Thanks all

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 ...

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 ...

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 ...

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 ...