OJ Board

..

Hope the one asking about hint is still interesting in this problem. spoiler alert Consider we have 3 ants Ant_a at position P_a, facing R Ant_b at position P_b, facing R Ant_c at position P_c, facing L with P_a < P_b < P_c If you simulate the scenario you will find that the ant Ant_a will turn arou...

..

Do anyone remember that there is a problem is asking for (almost the same) primality test of big number?
I remember that for one problem I implemented Miller–Rabin primality test and get AC immediately. I want to find that problem again but forget the id....

..

oh yes

I completely forget this is a maze....
I need to find a new algorithm, thanks a lot.

..

Could anyone kindly give some test case? I have no idea if my algorithm ok. Consider the sample input: 1 8 5 8 2 1 1 3 3 2 4 4 5 3 6 4 7 2 7 1 For each combination of obstacle(along x-axis), I consider a "tunnel" that is formed by "ceiling" and "floor", which are both s...

..

Hi Carlos,

I find that my AC program can't handle these 2 cases:

Input:

Code: Select all

1 11 0.1
6 1 0.1

Output:

Code: Select all

1 6
61 10

Thanks,
Lawrence

..

Hi Carlos,

Just find that a wrong program which can't process this case still get AC on judge. Could you add this in judge data? Thanks.

Input:

Code: Select all

3
4
1 0
1 3 0
1 2 0
1 3 2 0
A
AB
AC
ABC
*

Output:

Code: Select all

ACB

..

Hi, Could anyone tell me what is the meaning of this condition? (C) at least one of the points (xi,qi+1) and (pi+1,yi) is in an edge that contains (xi,yi). As I understand, (xi,qi+1) and (xi, yi) is always on the edge x=xi (pi+1,yi) and (xi, yi) is always on the edge y=yi so what does this condition...

..

viniciusweb wrote: I rewrote the code and got AC. My output to the test cases avm posted is:
Code: Select all
1. 127
2. 131
3. 128
4. 129
5. 132
6. 132
7. 261
8. 256
9. 490572

My AC program gets the exact output as avm, so I think your program is still not optimal.

..

Thanks all, I get AC also

..

I not yet start coding, but wonder how to interpret:

Each FD in an acceptable proof sequence must, however, be necessary.

Does necessary mean that we must use non-redundant FS in the proof? If yes, then how should we handle the set number 6?

..

Thanks for help, get AC

..

Hi,

Could any one please verify the output for me? Thanks!

Code: Select all

2

++0L
--0L
**9R
//9R
9/8/7*6*5*4/3/2/1
9*8*7/6*5*4/3*2*1

++1L
--3R
**3L
//3R
34*33/21+3*9/11/2*4

Code: Select all

9/8/7*6*5*4/3/2/1 = 1080
9*8*7/6*5*4/3*2*1 = 24

34*33/21+3*9/11/2*4 = 65

..

Cache up to 8 steps only can make you use less memory.

..

That last trick is very clever (reminds me of another problem dealing with marbles, but i can't remember the problem title). I thought of the DP solution, but rejected it in an early stage, because of the too high memory consumption (which was premature, I see now). I think the problem you talk abo...

..

Hi,

Just curious to know if there is any mail of rejudge result sent to us (just like in the past)? Thanks

Lawrence

OJ Board

Search found 454 matches

Re: 10881 - Piotr's Ants

Search for a problem id....

295 - Fatman

906 weak data

921 "A Word Puzzle in the Sunny Mountains" Weak ju

Mail of rejudge?