comingsoon.cpp's blog

By comingsoon.cpp, history, 13 days ago, In English

I was trying to solve an exercise while studying basic probabilities and while solving the exercise, I thought of this problem which I thought was fun, so I decided to share it with my fellow noobs :)

Please if you're anything above a newbie, (in Ercole Visconti's voice) This problem is not for you (no offence) :)

Problem Statement

You have n tiles numbered from 1 through to n. You are also given an integer K. The task it to count all pairs of integers (a,b) from the n tiles whose difference is K. that means (a — b) = K

Input The one and only line of the input contains two positive integer n and K. Output Print the number of such pairs (a, b) whose difference is K, thank you.

Sample input 100 11 Sample output 89

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

»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

n-k ?)

  • »
    »
    13 days ago, # ^ |
    Rev. 2   Vote: I like it +8 Vote: I do not like it

    Lolzzzz, I'm such a dumb a**.... My actual solution was (n — (k+1)) + 1

    Didn't realize it was that simple honestly.

»
13 days ago, # |
  Vote: I like it +42 Vote: I do not like it

max(n — k, 0) ?

»
13 days ago, # |
  Vote: I like it +12 Vote: I do not like it

I think that is good for problem A of Div4.

»
13 days ago, # |
  Vote: I like it +75 Vote: I do not like it

Answer = $$$\max(\frac{(n-k)^2}{n-k}, \lim_{x\rightarrow\infty}\frac{3x}{2x^2})$$$