Codeforces Round #191 simpler solution to hungry sequence

Правка en1, от rohit_flawless, 2019-12-26 19:30:20

Here's simpler solution to codeforces round 191(div 2) ,question hungry sequence- https://mirror.codeforces.com/contest/327/problem/B Suppose we are given the number N. We can observe that for any N ,number divisible by N is always greater than or equal to 2*N, so we select numbers N+0,N+1,N+2,.......N+N-1 .So, Here we N satisfying conditions of hungry sequence.

Теги round #191, hungry sequence, simpler

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский rohit_flawless 2019-12-26 19:32:58 73 Tiny change: 'Here's sim' -> 'simpler solution to hungry sequence\nHere's sim'
en1 Английский rohit_flawless 2019-12-26 19:30:20 416 Initial revision (published)