I had a very similar contest, got A and B within 10 min, struggled with C coz I didn't know about that theorem and didn't consider googling it for a long time, finally got it after reading it online :P and then could not solve D coz I didn't practice Mo's Algorithm!
Can you share some good source of questions list basically im in 1st year i have nearly completed backtracking and dp but before going any further i want to solve some good questions to solidify my logics
Hi Priyansh, I saw that in contest 715 you failed to solve even 1 problem .......... you might have felt low but how to tackle this.....like when sometimes i fail i feel very very bad .
Hey priyansh, I didn't even understood what was asked in the prob C. Here is what m thinking. So we had to take take numbers between 1 to (n-1) of our choice and then multiply them, lets call this Product. So now the Product should be just 1 greater than any multiple of n. For e.g lets say that n=8, so we had to try to achieve a product such that product could be 9(8+1) or 17(2*8+1) or 25(3*8+1). Is this what we had to do?
That's right. And you need to try and pick up the maximum numbers you can pick so that the product satisfies this condition. You need to know some Number Theory to get the basic observations in this problem like the numbers that you pick should have a gcd of 1 with n and that the product of other numbers apart from the one chosen should be unique as well. But I guess there was a whole article on Stack Exchange about it and it was very easy to get a good construction for this problem after reading that.
Was waiting for this✌️
That ASMR gave me motivation to code🤩
Firstly I was thinking that I played your video at 1.5x then I recognised that the speed is normal but reading is so
Fast and typing also🔥🔥🔥
Ohh my god. 😂❤️
I had a very similar contest, got A and B within 10 min, struggled with C coz I didn't know about that theorem and didn't consider googling it for a long time, finally got it after reading it online :P and then could not solve D coz I didn't practice Mo's Algorithm!
I see even googling right thing is a skill ! You really have faith in yourself. I would have given up instead of searching. :p
Can you share some good source of questions list basically im in 1st year i have nearly completed backtracking and dp but before going any further i want to solve some good questions to solidify my logics
Hi Priyansh,
I saw that in contest 715 you failed to solve even 1 problem .......... you might have felt low but how to tackle this.....like when sometimes i fail i feel very very bad .
Lol I googled C a lot too, but couldn't solve. I thought it would involve some weird concept of number theory.
That googling One 😂😂
We can check if an element is perfect square if ceil(sqrt(n)) = floor(sqrt(n)) right? Is this wrong?
that is correct too but mind you there might be some precision issues too.
Didn't you overcomplicate the perfect function?
int x= (int) sqrt(a);
if(x*x==a) return true;
return false;
This will work as well
True. I don't know what came to my mind to check that every prime should occur an even number of times lol. Dumb me.
Yes first time I did A in 2 minutes using same logic
Hey priyansh, I didn't even understood what was asked in the prob C. Here is what m thinking.
So we had to take take numbers between 1 to (n-1) of our choice and then multiply them, lets call this Product.
So now the Product should be just 1 greater than any multiple of n.
For e.g lets say that n=8, so we had to try to achieve a product such that product could be 9(8+1) or 17(2*8+1) or 25(3*8+1).
Is this what we had to do?
That's right. And you need to try and pick up the maximum numbers you can pick so that the product satisfies this condition. You need to know some Number Theory to get the basic observations in this problem like the numbers that you pick should have a gcd of 1 with n and that the product of other numbers apart from the one chosen should be unique as well. But I guess there was a whole article on Stack Exchange about it and it was very easy to get a good construction for this problem after reading that.
please make tutorials on different cp topics
Is it a virtual contest?
bhaiya aapka koi discord server hai ??
discord.gg/zTbtxRXW
HIS TYPING IS FASTER THAN MY HEART BEAT
Hehe. xD
I didn't get the problem B can you please explain
In b think like you have k bit set of n numbers now for every pos you have to change 1 bit to 0 for max sum that's why n^k is the ans
Bro what about setup and debugging?
Sorry man. Coming soon. I was sick.
@@PriyanshAgarwal no problem bro....get well soon
waiting for this✌️