Utkarsh.25dec's blog

By Utkarsh.25dec, 3 years ago, In English

We invite you to participate in CodeChef’s Starters 28, this Wednesday, 2nd March, rated for Div 2, 3 & 4 Coders.

Time: 8 PM — 11:00 PM IST

Joining me on the problem setting panel are:

The video editorials of the problems will be available on our YouTube channel as soon as the contest ends. Subscribe to get notifications about our new editorials.

Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them here.

Hope to see you participating. Good Luck!

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

| Write comment?
»
3 years ago, # |
  Vote: I like it +3 Vote: I do not like it

Reminder: Contest starts in 25 minutes

»
3 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Lmao, I solved CNTFRAC by calculating number of solutions to $$$wz + xy = kxz$$$ (took around 500s) and then store the answer in an array.

Brute force code
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

In problem travelling in graph can someone help why my approach is wrong I use dsu and checking maximum node from 1 node components and adding necessary nodes till n and 1 are in same components.simlary from nth node

Spoiler