Rosetta Code

Knapsack problem/0-1: Difference between revisions

Page Discussion

Knapsack problem/0-1 (view source)

Revision as of 10:36, 4 June 2022

490 bytes removed ,  1 year ago
→‎{{header|C#}}
Line 1,109:
Random values origin are automatically assigned create integral of quantity and quality
 
<lang QB64C#>using System; // Knapsack C# binary DANILIN
using System.Text; // rextester.com/EAFWD33169YRFA61366
namespace Knapsack
{
Line 1,138:
mass[i]=1+rand.Next(3);
cost[i]=10+rand.Next(9);
Console.WriteWriteLine("{0} {1} {2}", i+1, mass[i], cost[i]);
Console.Write(" ");
Console.Write(mass[i]);
Console.Write(" ");
Console.Write(cost[i]);
Console.WriteLine();
}
Console.WriteLine();
Line 1,160 ⟶ 1,155:
}
bin[list]=bin[list].Substring(1,bin[list].Length-1);
 
for (k=0; k<n; k++) // inside 01
{
Line 1,169 ⟶ 1,163:
if (amount[list]<= Inside) // current mass < Knapsack
{
Console.WriteWriteLine("{0} {1} {2} {3}", Inside, amount[list], quality[list], bin[list]);
Console.Write(" ");
Console.Write(amount[list]);
Console.Write(" ");
Console.Write(quality[list]);
Console.Write(" ");
Console.WriteLine(bin[list]);
}
}
Line 1,182 ⟶ 1,170:
max=0;
max_num=1;
for (i=0; i < all; i++)
{
if (amount[i]<=Inside && quality[i]>max)
Line 1,189 ⟶ 1,177:
}
}
Console.WriteLine ("{0} {1} {2}",amount[max_num],quality[max_num],bin[max_num]);▼
Console.Write(amount[max_num]);
Console.Write(" ");
Console.Write(quality[max_num]);
Console.Write(" ");
▲ Console.WriteLine (bin[max_num]);
}
}
DANILIN
51

edits

Retrieved from "https://rosettacode.org/wiki/Special:MobileDiff/139456"