You can precalculate all the results in a char matrix (c++), occupies less than int. With the given memory contraints, you can doit like that.

Before realize that, I had to solve it in the way it's described on the statment, but later of try several test cases, I figured out the real problem. Just sort it in descending way. Good luck. I can't believe this.

Edited by author 25.08.2015 10:37

This problem text add
If there are several solutions output any one.
For example n=3
1 2 2
k=3 sum=7 divisors number 2, k=2 sum=3 divisors number 2, k=1 sum=1 divisors number 1

For those, who has WA4, try this test:
Input:
1 0
1 1 10 20
Output:
0

the test is
1 1
the answer is obvious:)

for input 3 3, I guess the result should be 3. Why it is 2?

I use the algo with N Dijkstras. Does anyone know, can I get AC with that algo, or 0.5 sec is not enough for it?

Slow judging, seems to be an issue

TLE24 with 3 different codes <3

do anyone knows the 25th test?
I think my alg is correct but I can't acc it...
help pls!
Do a dfs on G complement to make it a set of bipartite graphs (remove one way edges) then brute force on set of components after some optimization to avoid TLE and find the best dividing...
any idea?!

Edited by author 20.08.2015 17:30

Hi! After 3 algorithms, I finally nailed it!. Don't try coloring, doesn't work. What I did:

First, convert the teams onto nodes, and create ONE bidirectional edge between two teams when these team are sharing one or two contestants. Then, I make a pair array, and save, in decreasing order, the grades of the nodes ant their "names" (I used  numbers). When I have that ordered array, I delete the nodes when have more than zero adjacent nodes. If have zero adjacent, means that the team is non-sharing any contestant. When you deleted a node, don't need to reorder the grades array. Finally, return the total initial nodes minus the times that I had deleted teams. Hope it helps you. Bye!

give some tests, pls

1) 14 14 5
   =>
   149.422524
   356.315250
   425.279492
   356.315250
   149.422524

2) 66.001 99.9 2
   =>
   113929.225834
   113929.225834

3) 0.45 6.666 10
   =>
   0.019790
   0.053716
   0.079160
   0.096123
   0.104605
   0.104605
   0.096123
   0.079160
   0.053716
   0.019790

4) 1 1 1
   =>
   0.523599

Hello.
Do not pass the test number two. Tested the algorithm all the data found on the Internet, all the tests pass. What is important is whether the value of the order of numbers in the answer? Whether equivalent variants "1 2 3 4" and "3 4 1 2"?
Perhaps you can give a piece of advice.

wwww
wwww
wwww
wwww

I had WA 101 and didn't know what is wrong.
I tried test "0 0 1" and got something like '0 3'. I fixed it, but nothing changed.
Then I realized that the problem is not only for zeros, but for all k=l and n=1, my output was '0 3'. When I fixed it, I got AC.
By the way, big thanks for hints for WA 5 and 90, they helped me a lot.

Edited by author 18.08.2015 20:20

1)Not use double format;
2)Use int64;

I'm looked for cycles. Deleted them. Finally i got some tree without cycles. I think my idea is correct , pass 10 test do not passed/ Help me please???

The output text must be exactly as it was given, without any additional new lines (but with all new lines that were in input data).