OJ Board

negative heights ??? what the hell does that mean? and when two of ha, hb, and hc are zero, then we have no triangle but something like a line, which obviously has are 0.000. I don't think it is invalid input. However, when only one of ha, hb, hc is zero, then the input is invalid. Am I right here ...

[quote="Maarten"]did you consider the case where either one of a,b,c is equal to zero int AC = 2*area/b; int BC =2*area/a; my invalid condition is : AC<a,b,c && BC<a,b,c and one of a,b,c equal to 0; please give me more hints.....thank you!!

in 10522
i carculate :
area=(a*b*c*a*b*c)/sqrt((a*b+b*c+a*c)*(a*b+b*c-a*c)*(a*b+a*c-b*c)
*(b*c+a*c-a*b))

am i wrong???
it execuate correctly when using acm's sample

what's the condition 'invalid' ???

please tell me~~ thank you very much!!!

as the algorithm 2 mentioned in http://www.ioi2003.org/ioitasks/data-reverse.pdf i still can't understand it's spirit completely. for the case of N=44,i initialize the registers' value as : register 1 2 3 4 5 6 7 8 9 N N-2 N-5 N-9 N-14 N-20 N-27 N-35 0 and i know no matter what value N is, the last ...

thanks...
the information is useful~~~
thank you many much!!!

Consider a Two-Operation Machine (TOM for short) with nine registers, numbered 1

[cpp] #include<iostream.h> #include<math.h> struct divisor{ int factor; int num; }; bool prime(int X) { int i; i=0; for(i=2;i<X;i++) if((X%i)==0) return false; return true; } int division(int div[],int X,int div_num) { int i=0,N=1,t=0; int X2=X; if(X==1) return 1; for(i=0;i<div_num;i++) { t=0; whil...

I am not sure if I understand your problem right, but to me it sounds like MST... So what you want is: Given a connected graph, find the set of edges with minimum weight such that the graph is still connected. Am I right here ? "Given a connected graph, find the set of edges with minimum weigh...

As the number growing up, i need more time to get result.
But I have used the prime's method....
So,Is there any aspect i have not notice???

I guess it's not MST problem.
Because there may be one or more node connect to one node.
Just let all nodes be in a connected componet.

how should i output my result???
thanks!

There's N vertices. And between two vertice,there may exist path(s) or non. each path between two vertices are not same in length. How could I find the shortest length if these vertices construct a complete graph? in this problem,you don't need to care ablut the start and end point.Just calculate th...

so,this situation i mentioned is invalid.
I can ignore that.....right?

what's the result alfter "pile 4 onto 1":

0:0 1 2 3
1:
2:5
3:
4:4 6
5:
6:

I am not sure where 5,2 wll perform.....