TooMuchPainTheseDays's blog

By TooMuchPainTheseDays, 21 month(s) ago, In English

I think codeforces should have two different count for upvote and downvote.

See above image,
both of them having totally different meaning.
According to current scheme 50 upvote and 49 downvote = 1 upvote.

What is your opinion on this ?

Full text and comments »

  • Vote: I like it
  • +237
  • Vote: I do not like it

By TooMuchPainTheseDays, history, 23 months ago, In English

I want to extract date and time of submission from creationTimeSeconds (from user status API) , so can you please guide me for the same.
Example : creationTimeSeconds: 1650552092 then what is the date and time to corresponding creationTimeSeconds
Thank you.

Full text and comments »

By TooMuchPainTheseDays, history, 23 months ago, In English

I want to fetch details of problem using problem code (like {contestId}{problemIndex}ex. 1654C).
Is there any separate API exist for this ? (other than make API call to contest with contestId and then fetch problem from result) ?
Thank you.

Full text and comments »

By TooMuchPainTheseDays, history, 2 years ago, In English

Never submit right solution again in google competition !! if you do this than your penalty time will update as last correct submission :(

Full text and comments »

By TooMuchPainTheseDays, 2 years ago, In English

Is there any API available in codeforces by which we can fetch problem statement ?
Thank you.
(as soon as I receive appropriate answer , I will delete the blog so that other than directly view some of good blog in recent action list rather than mine :) )

Full text and comments »

By TooMuchPainTheseDays, 2 years ago, In English

given N queries ( N <= 105 ) of 2 types :
initially , string S is empty.
1 ch : push character ch at the end of the string S
2 : return YES if string S is palindrome else return NO

Input
Output

Full text and comments »

By TooMuchPainTheseDays, history, 2 years ago, In English

Can someone help me to solve this problem ?
Actually, this problem was in my brain but I didn't find it anywhere. (so I can't provide link)

Problem :


Given array of size N ( N <= 105 )
we have to perform 2 queries.
query of type 1 : 1 l r
increase the value of a[l] by 1 , a[l+1] by 2 , a[i+2] by 3 ,... a[r] by r-l+1
query of type 2 : 2 l r
print the sum of range [l,r]
Thanks in advance.

Full text and comments »

By TooMuchPainTheseDays, history, 2 years ago, In English

(Give honest opinion)

Full text and comments »