Test cases failing

#1

https://ide.codingblocks.com/s/395168 (My solution)

Why is my solution not being accepted and TCs failing even though I am providing an O(log N) solution as per what I can see? How can I optimize my solution?

#2

O(log N) while asuming that __builtinpopcount() is O(1)

#3

Hey @anshufirefox first tell me that are you getting TLE or WA for this code?

#4

Time Limit Exceed for this code

#5

Okay so there’s no need to "actually perform the operations on N ". The game just requires counting set-bits in binary representation of N-1 .
Just do
(setBits(n-1) & 1) If answer is true then Louise will win
Else Richard will win

#6

And how do I figure out that this should be the approach to solve the problem? It’s completely a different idea from the actual problem

#7

How good are you with bitwise operator?

#8

know the basic concepts, started solving problems recently

#9

Have learnt the concepts two days ago

#10

I guess there’s a problem in your course name incredible hulk. Have you done that problem on your own?

#11

I haven’t reached that yet. I have done the unique numbers, fast power etc

#12

Incredible hulk is same as of this problem. Try to do that problem on your own. Also keep on practising for bitwise operator. 10-8 are in your course
Few you will find on hackerearth and hackerrank
I guess that will be it.

#13

Thank you, does it get better with time and practice?

#14

Are you asking about bitwise operator?

#15

Yeah, like these stunt/magic out of nowhere like solutions in bitwise. Will I be able to do it as well after a certain level of practice?

#16

See I guess you have just started with bitwise operator. That’s why you aren’t able to get it in a single go. It does take some time. But as you got the concept for this problem na, i would suggest you to do incredible hulk problem now only. So that you can think in this implementation too.

#17

Thank you, gonna do it now itself

#18

And if you need any help in that problem you can ask it here only. Close this doubt , when you solve that problem and not before that.

#19

This does not work at all :frowning:

#20

Tell me the logic you are using.