OJ Board

Farid:

May be I misundrestood the problem, but there is said that:
This process continues until she wins by entering the finish room or dies by running out of energy (or quits in frustration).

And when you enters the room 3 you have negative energy(running out of energy). That's why it is ...

May smb. explain how to solve this problem using floyd?
And how it works with this test?

5
0 1 4
100 1 5
-80 1 2
-90 1 3
0 0

The answer is hopeless

Thanks

2Farid:

Let you found cycle d[i,i]. For examle it:
i--(-10)--> j --(11)--> i, and when you entered i you had less then 11 points of energy, then you'll die before room j, but using your algorithm you will be still alive and have 1 point per cycle =).

2ditrix:
I don't know why, but when I rewrote my program it's got AC.
I understood what were you talking about, but I haven't had that mistake.
I didn't use angles, I used sin and cos instead:

sin = vx1*vy2-vx2*vy1;
cos = vx1*vx2+vy1*vy2;
where vx1, vy1, vx2, vy2 - two standardized vectors

Hi All!
You are given 8 numbers:a, b, c, d, e, f, g, h and you should find A, B, C, D such that holds:
( a^2 + b^2 + c^2 + d^2 ) ( e^2 + f^2 + g^2 + h^2 ) = ( A^2 + B^2 + C^2 + D^2 )


How to solve it?

Full desc:
http://acm.zju.edu.cn/SAMS/marriage/marriage.htm

Thanks.

Sorry I don't get it! =(
It's said that "The vertices for both polygons correspond to the same set of features in the same order"

For examle we may have:
1poligon: right ear tip, chin cleft, right eye, nose, left eye, left ear tip, space between front teeth
2poligon: space between front teeth ...

Hi All!

To solve this problem I used assumption, that two poligons should have same angles between corresponding edges and have the same scale factor for all corresponding edge's lengths.
Does it right?

2ditrix:

May be you have the same mistake.

You're doing the problem using: (pred*(10^c-1)+cycle)/((10^c-1)*10^p), where 0.pred(cycle)...

How are you reducing the numbers in numerator and denominator?

Try gcd, If you don't use it.

Input:
2
NE 2
S 1
-90

Output:
1.29

Check it!

2konsept:

I found one problem in your algorithm (the same problem why standard dinamic doesn't work :( ).

For example when you choosing the element i, and have two diferent elements that you can use: i!=n-1 and n-1.
If you choose n-1 element then the last element of another(alternative) doll ...

2konsept:

Your algorithm looks very good. Just a simple dinamic. You genius =).

May be you should change step 3. fits( i+1, i-1 ) because
the i-1 element may be inside the can( i, j-1 ) /* I mean when you made can(i, j-1) you may be used can(i-1, j-2). */.

To solve this problem I used another ...