Can anyone share some good CP resources that you follow
suyashchavan#6891 on discord
Now He’s waiting for his account to be deactivated, chill.
lol, it’s quite obvious that you cheated man.
your coding style for ISS is way different than your other submissions.
So I guess cheating was the reason for invitation on discord
I mean who cares as long as you compete to improve
can you please explain how to optimize modular equation ( I am getting tle )
Bro discord link ?
No link. Just enter my id.
can you share your submission so I can see what you were trying to do?
Edit: never mind I got it
Really disgraceful to see the beginners being fooled by some #so_called_expert_coders_in_their_own_world that they even buy solutions from them just for the sake of earning high ratings and star to look fancy. First of all,it is really bad for someone who is really willing to learn programming as cheating and copying will really not help.Instead it will block the thinking process and make even worse to cope up when exposed to some real life competitions without this shitty external aid.
The purpose of long challenges is to fight till the last moment and get as much problem as u could solve with the best of the capabilities of any particular user. But nowadays,the ball is in the other court.In this process, people attempting honestly will get disheartened as they are not being rewarded as much as they have applied the efforts.
@admin something seriously has to be done about it otherwise,soon the long challenge wont be attempted by good coders and these herd mentality cheaters will be shining in the leaderboard.
I send request to you on discord
My name is revenge#1213
that’s the height of shamelessness , don’t try to be oversmart you can’t solve a cakewalk problem on your own lol!
Let count[i] be the count of numbers with remainder i.
observe that if M%b%a = M%a,
then there always exists an integer k suck M%b = M%a + a * k
because of this rather than iterating over numbers for each a, we’ll iterate over all numbers that can be represented as M%a + a*k. we’ll run a loops backward with a = N to 1 and add the number of b’s for each a, which is the sum of count[M%a + a * k], for k=0 to a * k + M%a <= N. because in this M%b%a = (M%a + a * k)%a = M%a
Note that we only want to b’s that are b > a. So we don’t precompute count
we count as we go. So after we processed current a, we’ll do count[M%a]++.
My code.
Sorry if something wasn’t clear I am not quite used to writing long paragraphs on codechef. You can ask though whatever confuses you.
Bruh it cannot be stopped as there is lot of time, take it as opportunity is grasp.
Somebody give this guy a medal facepalm
See the shamelessness of such people who post all solutions. The “Hurray”…
Being coders themselves, they must understand what it feels when one works hard to crack the solution and gets nothing but fall in ratings and people easily get up the ladder by cheating. I think the YouTube channels are the biggest scammers, who leak solutions in every contest, be it long challenge or cook off. Their channels must be reported and banned.
