№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
link to question — https://www.codechef.com/problems/CHEFINV
MY APPROACH -
using a mergesort tree
find swaps decreased and increased for A[L] due to L-R
find swaps decreased and increased for A[R] due to L-R
calculate answer
complexity — Mlog^n?
my code — https://ideone.com/tgs2nU
i also tried testing my code against one of the AC codes still couldnt find my mistake. any help would be appreciated!
https://cses.fi/problemset/task/1684 => GIANT PIZZA
I cannot understand how to proceed with this question. Any help will be appreciated.
https://cses.fi/problemset/task/1160
can someone please help me in this question?
I am not getting any ideas as to how i should proceed...
question — Kuroni and Cowsheds
link to question — https://www.codechef.com/LTIME85A/problems/COWSHEDS
can someone please explain the solution?
I couldnt do better than Q*N basically go L to R + dsu
We can rotate a string any number of times
We need to find the minimum possible string lexicographically.
E.g. inp — BCABDADAB op — ABBCABDAD
This is doable by Booth's algorithm in O(n).
I couldnt quite understand the way it is being done...can someone please help?
my code click here im getting runtime error (SIGSEGV) on 11th testcase..why? i have also increased the SIZE significantly as people were saying in the comment section that its more than 10^5.. i dont see a reason for long long as well in the question.. can someone please help??
but that isnt my doubt
so sum of all coprime numbers with n upto n = sum of all numbers part of phi(n) = phi(n)*(n/2)
i wrote the code for it.. apparently my function where i do the above computation was erroneous..
i tried stresstesting...here is my codee
its not giving correct anwer from around 1650... can someone please help? my functionname is phifunc editorial is phi
(P.S. i know that using sieve its n loglog n but both the editorial and my solution are sqrt n to it)
Название |
---|