Editorial of Educational Codeforces Round 13

Revision en1, by Edvard, 2016-06-16 01:19:27

678A - Вася любит числа

The problem was suggested by Abdrakhman Ismail bash.

We should find minimal x, so x·k > n. Easy to see that . To learn more about floor/ceil functions I reccomend the book of authors Graham, Knuth, Patashnik "Concrete Mathematics". There is a chapter there about that functions and their properties.

Решение на С++

Complexity: O(1).

Tags educational round 13, editorial

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en7 English Edvard 2016-06-17 00:08:58 71
en6 English Edvard 2016-06-17 00:06:45 2252
en5 English Edvard 2016-06-16 01:55:47 3667
en4 English Edvard 2016-06-16 01:45:55 1547
en3 English Edvard 2016-06-16 01:38:08 841
en2 English Edvard 2016-06-16 01:35:20 941
en1 English Edvard 2016-06-16 01:19:27 632 Initial revision for English translation
ru9 Russian Edvard 2016-06-16 00:45:21 76 Мелкая правка: ' summary="C++ solution">\n~~~~~\' -> ' summary="Решение на C++">\n~~~~~\'
ru8 Russian Edvard 2016-06-16 00:40:51 307
ru7 Russian Edvard 2016-06-15 00:49:41 3519 Мелкая правка: 'тьего типа отсортиру' -> 'тьего типа, отсортиру'
ru6 Russian Edvard 2016-06-14 23:38:12 51 Мелкая правка: 'ть: $O(log max(a, b))$.\n\n##' -> 'ть: $O(log(max(a, b)))$.\n\n##'
ru5 Russian Edvard 2016-06-14 23:37:44 62 Мелкая правка: 'ность: $O(1)$.\n\n###' -> 'ность: $O(log max(a, b))$.\n\n###'
ru4 Russian Edvard 2016-06-14 23:36:58 1541
ru3 Russian Edvard 2016-06-14 23:20:12 2276 Мелкая правка: '[1, 1]]$, v=[0, 1]$.' -
ru2 Russian Edvard 2016-06-14 01:38:58 832 Мелкая правка: 'т равен: $\lfloor p\frac na \' -> 'т равен: $p\lfloor \frac na \'
ru1 Russian Edvard 2016-06-14 01:21:42 1580 Первая редакция (опубликовано)