Список проголосовавших за комментарий "Рюкзак 0-1 & rosettacode & qbasic qb64 и МЫ<br/> <br/> Классическая задача про рюкзак решается многими способами <br/> оглавление: <a href="/r.php?u=http%3A%2F%2Frosettacode.org%2Fwiki%2FKnapsack_problem&s=2323560756">rosettacode.org/wiki/Knapsack_problem</a><br/> <br/> Long read: rosettacode.org/wiki/Knapsack_problem/0-1<br/> <br/> Новейшая моя программа синтезирует все шифры 0 и 1 <br/> добавляя лишний регистр и 0 остаются слева в шифре <br/> <br/> Количество сравнений уменьшается с N! до 2^N <br/> например N=5 N!=120 >> 2^N=32<br/> <br/> Автоматически присваиваются случайные значения <br/> количества и качества и получается интеграл стоимости <br/> причём возможно и делить только любой человек не поймёт <br/> <br/> Программа пишет в каталог qb64 <br/> <br/> Open «knapsack.txt» For Output As #1<br/> N=7: L=5: a = 2^(N+1): Randomize Timer 'knapsack.bas DANILIN<br/> Dim L(N), C(N), j(N), q(a), q$(a), d(a)<br/> <br/> For m=a-1 To (a-1)/2 Step -1: g=m: Do ' sintez shifr<br/> q$(m)=LTrim$(Str$(g Mod 2))+q$(m)<br/> g=g\2: Loop Until g=0<br/> q$(m)=Mid$(q$(m), 2, Len(q$(m))) <br/> Next<br/> <br/> For i=1 To N: L(i)=Int(Rnd*3+1) ' lenght & cost<br/> C(i)=10+Int(Rnd*9): Print #1, i, L(i), C(i): Next ' origin<br/> <br/> For h=a-1 To (a-1)/2 Step -1<br/> For k=1 To N: j(k)=Val(Mid$(q$(h), k, 1)) ' from shifr<br/> q(h)=q(h)+L(k)*j(k)*C(k) ' 0 or 1<br/> d(h)=d(h)+L(k)*j(k)<br/> Next<br/> If d(h) <= L Then Print #1, d(h), q(h), q$(h)<br/> Next<br/> max=0: m=1<br/> For i=1 To a: If d(i)<=L Then If q(i) > max Then max=q(i): m=i<br/> Next<br/> Print #1,: Print #1, d(m), q(m), q$(m): End<br/> <br/> Результат сокращён вручную<br/> <br/> 1 2 17 <br/> 2 2 14 <br/> 3 2 17 <br/> 4 1 11 <br/> 5 2 18 <br/> 6 3 14 <br/> 7 3 10 <br/> <br/> 5 73 1101000<br/> 4 62 1100000<br/> 5 79 1011000<br/> 4 68 1010000<br/> 2 28 0100000<br/> 5 81 0011100 !!!<br/> 3 45 0011000<br/> 4 70 0010100<br/> 5 76 0010010<br/> 2 36 0000100<br/> <br/> 5 81 0011100<br/> <br/> Главное очень кратко и понятно даже школьникам <br/> <br/> Knapsack 0-1 & rosettacode & qbasic qb64 & WE <br/> <br/> For all people: send yours algorithms to rosettacode <br/> otherwise forum may disappear even in google search<br/> <br/> Classic Knapsack problem is solved in many ways<br/> <br/> Contents: <a href="/r.php?u=http%3A%2F%2Frosettacode.org%2Fwiki%2FKnapsack_problem&s=2323560756">rosettacode.org/wiki/Knapsack_problem</a><br/> Long read: rosettacode.org/wiki/Knapsack_problem/0-1<br/> <br/> Previous topics and long programs: Knapsack<br/> <a href="/r.php?u=https%3A%2F%2Fqb64forum.alephc.xyz%2Findex.php%3Ftopic%3D3091&s=3472202877">qb64forum.alephc.xyz/index.php?topic=3091</a><br/> Ordered Combinations Generator<br/> <a href="/r.php?u=https%3A%2F%2Fqb64forum.alephc.xyz%2Findex.php%3Ftopic%3D2999&s=3746876971">qb64forum.alephc.xyz/index.php?topic=2999</a><br/> <br/> My newest program synthesizes all ciphers from 0 & 1<br/> adding an extra register and 0 remain on left in cipher<br/> <br/> Number of comparisons decreases from N! to 2^N<br/> for example N=5 N!=120 >> 2^N=32<br/> <br/> Random values origin are automatically assigned<br/> quantity and quality and integral of value is obtained<br/> and it is possible to divide only anyone will not understand<br/> <br/> Program write results to qb64 directory<br/> <br/> Main thing is very brief and clear to even all<br/> <br/> Results is reduced manually"