You are not logged in. Please login at www.codechef.com to post your questions!

×

find the smallest partial sum modulo P that is at least K.

Here is the link to the problem-: https://www.codechef.com/problems/BESTSUM I am trying to understand the concept used in the Submissions. I am not able to get it. Need help!

asked 24 Jun '17, 19:45

varun44540's gravatar image

2★varun44540
1
accept rate: 0%

edited 24 Jun '17, 19:48

toggle preview
Preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:

×639
×348

question asked: 24 Jun '17, 19:45

question was seen: 181 times

last updated: 24 Jun '17, 19:48