OJ Board

can anyone give me a hint?

and there is a another similar problem in the warningup II which I also do not know how to solve it.
thx in advance!

SerailHydra wrote:My solution is DP, and runs O(N^2)

can U tell me more details?
I do not know how to dp.
THX

My code doesn't use Brent's improvement just normal Pollard Rho method.
Robert Gerbicz's solution is much faster than mine.

First I wanted to make the test data little more tight so only the Brent versions could pass, but later
stopped from doing that.

I also use the normal Pollard Rho,but i ...

sohel wrote:There is no use of N. I first got WA when I considered that the cone has to be strictly inside the room. But later commenting out that part, the code got AC.

I still WA!!
is there any trick? or maybe my agorithm is wrong?
can you give me any hints?
THX!!

There must be. I also first assumed that the result is regardless of N, and I got WA. Notice that the net is conical, so I think you can place it only so that it is wholly included in the room. Consider the input
100 10 3
0 0
0 1
49 49

I presume the result to be 2, since no way you can cover ...

and is there any use of the N?

I think that: if the answr is m, so there must be a circle who's radius is smaller than r and there are three or 2 point on it,and m point on or in it.
in the condion of 2 point the center of the circle is the mid of the 2 point

is above right?
but i got a WA?somebody help!

but i want to know is any num which can'ti div by 2 or 5 have a mutiple like 111..1111

NO
NO
.

Although none of your graphs would appear in the test-data. because the problem statement says all graphs has only vertices of degree 3.

HINT: All vertices has degree 3. So, If a vertex is the center of a claw, what can we conclude about its neighbors? What about the neighbors of a vertex ...

I did not understand the define of claw.
so is the following graph a claw?
the first graph
1 2
1 3
1 4
4 5
4 6

the second graph
1 2
1 3
1 4
2 5
3 6
4 7

and can anyone give me some hint of the algorithm?
thx.