OJ Board

Any hints for problem B, Arranging a Contest?
I am getting TLE. I am basically doing a pruned DFS.

Hello,
I think more than one points may be repeated. If you are trying to construct the hull just by going around the edges of the given polygon and checking for correct turns then try the following case.
input:
1
9
0 0
1 2
2 1
1 1
2 0
3 1
3 3
0 3
0 0
output:
1
6
0 0
2 0
3 1
3 3
0 3
0 0

Fahim ...

I just got AC with my same old code. I don't know why it give WA earlier. May be I submitted the wrong version.

BTW, for the test case: my AC code prints:

My program gives the same output as given above for all cases, except for the last 2 cases, which as specified above are not valid inputs:-

5 ( 5 () 1 () ())
4 ( 2 (2 () 1()()) ())


But I am still getting WA :(

What should be the output for:
0 ()

BTW, I have submitted my code by printing ...

The value of a coin varies from 1 cent to 500 cents.

Yes. But Minilek was talking about the case when there are 0 coins and not about a coin with value of 0 cents.

@sclo:
1. Is their some faster sieve algo? Can you provide some links?
2. Calculating result +=result[i-1]+result <<1 and just printing result[n] seems similar to what you suggest. I can't see what computational advantages your method has.

Below is my code for calculating totient using sieve ...

Thanx. I am already following it now.

That sounds strange...

@gits:
I got AC, but I have this doubt.

tmp = best[k][steps-1] * best[k][j][1]

I feel the above statement should be:-
and m should vary from 1 to steps-1 (making the solution O(n^5)).

But why is it not required? Why is just calculating for m=1 enough?

IIIT Hyderabad is back with its Online Programming Contest CodeCraft 2007. This is the 5th year of Codecraft. It has grown over the years and has witnessed huge participation on a global scale. The contest is known for having a high quality problemset.

It will be held on February 21st, 2007, 6 PM ...

IIIT Hyderabad is back with its OPC CodeCraft.
It will be held on February 21st, 2007, 6 PM - 12 AM IST.

Contest is open to all. Registration has started. Everyone is invited Enjoy!

IIIT Hyderabad is back with its OPC CodeCraft. C,C++ and Java coders are invited.
It will be held on February 21st, 2007, 6 PM - 12 AM IST.

Contest is open to all. Registration has started. Everyone is invited

IIIT Hyderabad is back with its OPC CodeCraft.
It will be held on February 21st, 2007, 6 PM - 12 AM IST.

Contest is open to all. Registration has started. Everyone is invited

IIIT Hyderabad is back with its OPC CodeCraft.
It will be held on February 21st, 2007, 6 PM - 12 AM IST.

Contest is open to all. Registration has started. Everyone is invited

AC in 0.12 but still not satisfied.
I am now not using medv's function but a variant of sieve.
I calculate totient function for all n from 1 to 50,000.
Then I calculate all answers from 1 to 50,000.
Then i just scan and print the apropriate answer from the array.

Please suggest a better method. How ...