CodeCracker 2k18 editorials

Revision en1, by pandusonu, 2018-03-20 06:44:54

Thank you for everyone who participated in the contest :)

The winners of the contest are: 1. @SoMuchDrama 2. @achaitanyasai

Link to problems Qs: questions

Shreyy’s Birthday Gift

There are many ways to solve this problem. Given the solutions submitted by the users, here is an alternate way to think of the problem: For n sized array, the number of modulo operations are n - 1

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en17 English pandusonu 2018-03-20 15:39:32 94
en16 English pandusonu 2018-03-20 15:20:31 0 (published)
en15 English pandusonu 2018-03-20 15:19:56 37
en14 English pandusonu 2018-03-20 12:01:27 212
en13 English pandusonu 2018-03-20 08:07:57 93
en12 English pandusonu 2018-03-20 08:02:20 2 Tiny change: '] = S[k] ∗ S[i − k]$' -> '] = S[k] * S[i − k]$'
en11 English pandusonu 2018-03-20 08:01:38 10 Tiny change: ' problems Qs: [Questi' -> ' problems Statements: [Questi'
en10 English pandusonu 2018-03-20 07:52:53 334
en9 English pandusonu 2018-03-20 07:48:36 143
en8 English pandusonu 2018-03-20 07:44:29 111
en7 English pandusonu 2018-03-20 07:32:31 638
en6 English pandusonu 2018-03-20 07:11:56 2 Tiny change: 'ib(2),……. $(i-fib(x))>=0 }$\n\nFor' -> 'ib(2),……. (i-fib(x))>=0) }$\n\nFor'
en5 English pandusonu 2018-03-20 07:11:18 228
en4 English pandusonu 2018-03-20 07:08:15 826
en3 English pandusonu 2018-03-20 06:57:49 108
en2 English pandusonu 2018-03-20 06:52:59 1480
en1 English pandusonu 2018-03-20 06:44:54 526 Initial revision (saved to drafts)