A subset of Sum with a list of 2675 numbers

Question

I am looking for an answer of yes or no to the question of whether it can be solved with efficiency or not. I am almost sure that this is not possible with modern computer technology. I would be happy to know that I am wrong. So nothing happens here.

I have a list of numbers 2576. I am trying to find a combination of numbers in a list that sums up to 44576.54. The list of numbers contains digits from 5 digits (accurate to two digits) to 8 digits (accurate to two digits).

I would be very grateful for your help!

Answer 1

. .

Answer 2

Emercoin UTXO. . .

:

"" ( - ). 4457654.

• LINE , + 1, 4457655. LINE [i] = 1, sum "i" , "i" . , .

• Mark LINE [0]: = 1; , $0.00 - .

• while (LINE [4457654] == 0):

  • .
  • . I.e, LINE [4457654], - LINE [4457654 - ].
  • , , :
  • LINE [ ] == 1, LINE [ ]: = 1;

Answer 3

:

• : sum * n, , .

• : 2 ^ n, , , NP-Hard.

, , n = 400, . , . . , , .

, , ? ?