Codenation Republic Hiring challenge

Nah. I didn’t appear for the test besides I am a Noob in CP. :slight_smile:

1 Like

I did that thats why it was giving WA idk

1 Like

You need to find all the factors of N in sqrt(N) time… put it in an array… then find the length of the array and print if the length is prime or not

How did you find the P for it ?

I did that too but idk WA :(((

I guess it’s the flow error… send the code if you have. I got AC for what I said above :smiley:

Brother can you plz share the code?

Did you solve the 4th ques???

can you share the code for the 4th ques???

I did this with the same approach.

Yes

4th Question: 7rADZX - Online C++0x Compiler & Debugging Tool - Ideone.com

But (1/i) only denote the winning of ith position.how can we get the expected value for the number of position to win?

bro can you tell me your approach :innocent:

Can you please explain your approach?

watch this video for explanations

watch this video for explanation

This video contains all the explanations

watch my video u will get it

here is a video that tells you the approach

Please like it and share with whoever needs it. Thanks