Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

tri_e's blog

By tri_e, history, 17 months ago, In English

do we need to solve DP problems separately or just keep solving the problems in mixed pool and eventually everything will fall at its place

Read more »

 
 
 
 
  • Vote: I like it
  • -26
  • Vote: I do not like it

By tri_e, history, 17 months ago, In English

link to problem — (https://onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1285) link to my code — (https://ideone.com/pAMZpL) i am getting WA and not able to figure out why? thank you

Read more »

 
 
 
 
  • Vote: I like it
  • -4
  • Vote: I do not like it

By tri_e, history, 18 months ago, In English

Here is my submission.can someone point out my mistake thanks in advance. link to my submission

`

Read more »

 
 
 
 
  • Vote: I like it
  • -19
  • Vote: I do not like it

By tri_e, history, 18 months ago, In English

can somebody explain me the logic of problem E of abc 168.https://atcoder.jp/contests/abc168/tasks/abc168_e.i know that the points chosen according to given condition will form perpendicular lines but i am not able to proceed further.

Read more »

 
 
 
 
  • Vote: I like it
  • -4
  • Vote: I do not like it

By tri_e, history, 19 months ago, In English

HOW TO SOLVE THE INEQUALITY i*(i + 1) <= n such that i is maximum possible in O(1) time complexity.is their exist any method.

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it

By tri_e, history, 19 months ago, In English

I am using 3 pointer technique to minimize the difference between largest and smallest element chosen and then finding the mid element which minimizes the answer. here is link to my code: https://ideone.com/XzeUzs thanks in advance

Read more »

 
 
 
 
  • Vote: I like it
  • 0
  • Vote: I do not like it