Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official.
×

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial is loading...

Tutorial of VK Cup 2019-2020 - Elimination Round (Engine)

↑

↓

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/23/2024 14:29:22 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|

Maybe you need to improve your English.

Russian statement and editorial is full of typos and silly mistakes as well, so I think author should either buy a new keyboard or learn to type... (Or maybe stop using google translate)

We need codes also!

In problem F you may observe that one of primitive roots in nimber field of size $$$2^{2^k}$$$ is $$$2^{2^k}-1$$$ so you may precalculate some of its powers beforehand to further simplify BSGS-algorithm and take discrete logarithm with base being a primitive root. If you do so, you won't need to develop tricky multiplication algorithm as $$$64^2$$$ algo with precalc for powers of two would be enough.

Can you give a better explanation for the optimization of problem (A. Recommendations)? I got to the O(n^2) solution during the contest but couldn't improve it.

https://codeforces.com/blog/entry/74214?#comment-583996

Can you please explain more on how to improve the complexity of A.Recommendations from N^2 to Nlogn.

I have used heap and greedy approach 71716787

First i have put all unique elements in a dictionary with list of values.

Then i keep a temp list to store all the list and pop one largest element to keep in that position and others increase one position and carry on doing this till temp is empty , time complexity — O(N) + N*O(log(N))

Same solution using a priority queue 71924309 in C++

Can someone tell me why my solution for Div1A/Div2D will TLE? I think its time complexity is nlogn.

Can anyone please explain more about the problem 1310B. thanks in advance.

Can anyone pls tell me what is wrong with my code? It gives the correct output with my editor. Solution Code: 97113733

Can you explain me your approach

Problem $$$D$$$ is so cool! My favorite 2300 problem I've ever solved (and I've solved 56 problems of that rating).

The tutorial of the problem F seems like Pohlig–Hellman_algorithm.