OJ Board

Moha, my AC program output for your input
^ is end of line
############^
#XXXXXXXXXXXX#^
#X###########X# #^
#X# #X# #X#^
#X# ##### #X# #^
#X# #XXXXX# #X#^
#X# #X#### #X#^
#X# #X# #^
#X# #X#### #X#^
#X# #XXXXX# #X#^
#X# ##### #X# #^
#X# #X# #X#^
#X###########X# #^
#XXXXXXXXXXXX ...

Actually, I have the same output for the samples posted.

I don't think that.
For example this line is wrong:

return sqrt((a[X]-b[X])*(a[X]-b[X]) + (a[Y]-b[Y])*(a[Y]-b[Y])+16.0);
because the cabel is longer by 16 feets than the distance of the two points, so it should be:

return sqrt((a[X]-b ...

Usually I don't paste my code in forums, but ...whatelse...I try to solved it using brute force. This is my code. Someone can find the error?

:-?
Try Sample I/O.
Did you code yourself?
Actually, I have the same output for the samples posted. I like to know if there are some tricky input or some ...

Usually I don't paste my code in forums, but ...whatelse...I try to solved it using brute force. This is my code. Someone can find the error?
//216.getting in line (brute force)
//determine how the computers should be connected into such a chain to minimize the total amount of cable needed
#include ...

If you don't return it to it's original form before printing, you'll get P.E. :wink:
My ACC solution gives no output for your input, just a blank grid with underscores.
Btw, I don't care about tab <'\t'>.

Good luck ! :lol:

I don't know if my output mantain de original form of the input :-?. I ...

It's unnecesary truncates any leading SPACEs and/or TABs.
for this input

26
32
-12
+12
0
12+34
1*(2+3)+3
1(2+3)+3
qwe323
1*(2+3)+399
1*(1*(1*(1*(1*(1*(1*(1+1)+1)+1)+1)+1)+1)+1)*(8+1)
1*(1+2+3)*(1+3)+(1+2)*8
((-1)*9)
((1)*9)
((0)*(9))
1* (1+ 2 + 3) * (1 + 3)+ (1 + 2)*8
2*1*1+1*1*1000*1*1000*1*1 ...

I have tried this input as follows:
2 2 0001

you should omit the leading zeros and as well as your repetance your output.

I think it is not a valid case. Because my code returns
0001 base 2 = 1 base 2
So, you don't have to think about leading zeroes.

I'm agree with you, both outputs are ...

I don't understand, the problem seems similar to offset polygon.
I'm only add this line:

offset*= -1;

the logic is the same or have any special case?

hi Willar, I have some doubts for this problem.

What happen if the width d (to be cut off) is greater than the smallest distance between the center and an edge of the polygon?

the area should be negative or i would be print "0.000"?

what is the output for this input:


2 4 0 0 0 5 5 5 5 0
1 3 0 ...

WA code:
printf ("%.3f %.3lf\n",p_inter.x,p_inter.y);

AC code:
printf ("%.3f %.3lf\n",p_inter.x+1e-8,p_inter.y+1e-8);

hi little joey, I proposed a similar solution as yours, but I can't got AC. Can you post I/O samples? Because I think that i have an precision error.

I can't understand how you can print "-0.000"????

(sorry about my "rusty" english)