### hiddenanonymouskgp's blog

By hiddenanonymouskgp, history, 6 weeks ago,

In the Codeforces Round #727 (Div 2), someone had a rating change of -x and his rank was y. After the plagiarism check, his rank was y-k and had a rating change of -(x+c). Why this occured as rank decreased so either rating change should remain the same or should increase? And that -c is costing that someone person from becoming "Z". Please look into it MikeMirzayanov.
Here, x,y,k and c are all positive and Z is one among them {Pupil, Specialist, Expert, Candidate Master, Master}.

• -12

By hiddenanonymouskgp, 7 weeks ago,

Problem : https://infoarena.ro/problema/xortransform
Why this code passed with 100 points and this code got only 26 points?
The only difference is that in the AC code I did dp[N]={} while in partial AC code I just did dp[N].

• +1

By hiddenanonymouskgp, 2 months ago,

Problem : https://dmoj.ca/problem/tle16c6s3
I could not get the editorial's dp states and its recurrence relation. I could follow the editorial till O(n*2^n) approach. Can someone help me?

• +10

By hiddenanonymouskgp, 2 months ago,

Hi, can anyone tell me is there any way to solve this problem recursively? In iterative way it's obvious to maintain prefix sums.

• -4

By hiddenanonymouskgp, history, 2 months ago,

Problem : https://www.spoj.com/problems/COOLNUMS/
My dp states : dp[N][partition_1_sum][partition_2_sum][2]
but this is incorrect as we also have to keep track of the order in which numbers are added i guess. can someone tell me what's the approach and how have you implemented it?
My code : https://ideone.com/qw85QZ

• -17

By hiddenanonymouskgp, history, 2 months ago,

Can someone provide me some problems based on MCM type dp states or idea? I have solved this problem only : https://www.spoj.com/problems/MIXTURES/