Alternative solution for a problem

Правка en1, от branimir116, 2015-07-27 00:13:27

Good day everybody,

I've been going true some old problems and I've found this problem: 453B - Little Pony and Harmony Chest

And I've been wondering why can't I just cout [sum of (A0,A1,A2,...,AN) — N] and cout 1, N times ?

I'd be harmony sequence and it'd minimaze the sum.

I tryed subminting solution that did that but it failed.

Can someone explain why is this wrong?

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский branimir116 2015-07-27 00:13:27 405 Initial revision (published)