Olympiad problem about Stones. How to solve this problem?

L

L

love_energy2017-09-20 12:06:50

Programming

love_energy, 2017-09-20 12:06:50

Olympiad problem about Stones. How to solve this problem?

There are N stones of weight A1,A2,...,AN.

It is necessary to split them into two heaps in such a way that the weights of the heaps differ by no more than 2 times. If this cannot be done, then indicate it.

Reply

Answer the question

Answer the question

In order to leave comments, you need to log in

0 answer(s)

Similar questions

E

ellesar20012013-01-18 16:46:23

Formulas in Google SpreadSheet 3Reply

S

Senseich2018-05-17 13:36:02

How to make it so that the list of files is not visible when going to the address? 1Reply

J

jstudent2013-01-26 21:37:00

Is it worth learning Java EE at jpassion.com? 0Reply

T

trollface2013-01-30 23:04:04

MediaPlayer not working? 1Reply

M

mongohtotech2013-02-01 21:24:50

ETL tool for Excel? 6Reply

Didn't find what you were looking for?

Ask your question

Ask a Question

731 491 924 answers to any question