< Back to forum

Walking Between Houses

Question: http://codeforces.com/contest/1015/problem/D

i figured out the cases when the ans will be 'NO'. But how can i complete 's' distance in 'k' moves..?? And what will be the distance covered in each move..?

Help me, with the logic

Asked by: Samrat_De on April 7, 2019, 1:04 p.m. Last updated on April 7, 2019, 1:04 p.m.


Enter your answer details below:


Preview

Enter your comment details below:

Preview




1 Answer(s)

avatar

Yes ,your approach is correct...

(s/k+1)steps up and down for s%k times and remaining steps were of length s/k.. 

Few corner cases would be if the maximum jump allowed is (s/k) then you can't jump the distance of(s/k+1)

if(s/k is zero) you would land in the same place at some time...(jump will have to be of zero size).

Shubham_Gupta last updated on April 7, 2019, 1:04 p.m. 0    Reply    Upvote   

Instruction to write good question
  1. 1. Write a title that summarizes the specific problem
  2. 2. Pretend you're talking to a busy colleague
  3. 3. Spelling, grammar and punctuation are important!

Bad: C# Math Confusion
Good: Why does using float instead of int give me different results when all of my inputs are integers?
Bad: [php] session doubt
Good: How can I redirect users to different pages based on session data in PHP?
Bad: android if else problems
Good: Why does str == "value" evaluate to false when str is set to "value"?

Refer to Stack Overflow guide on asking a good question.