Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- class SubSetSumHarder
- {
- static void Main()
- {
- Console.WriteLine("Enter the wanted sum of the subsets:");
- long wantedSum = long.Parse(Console.ReadLine());
- Console.WriteLine("Enter the length of the subset");
- int lenSub = int.Parse(Console.ReadLine());
- Console.WriteLine("Enter the number of elements:");
- long numberOfElements = long.Parse(Console.ReadLine());
- long[] elements = new long[numberOfElements];
- int counter = 0;
- string subset = "";
- for (int i = 0; i < elements.Length; i++)
- {
- Console.WriteLine("Enter element № {0}", i + 1);
- elements[i] = long.Parse(Console.ReadLine());
- }
- int maxSubsets = (int)Math.Pow(2, numberOfElements);
- for (int i = 1; i < maxSubsets; i++)
- {
- subset = "";
- long checkingSum = 0;
- int lenCounter = 0;
- for (int j = 0; j <= numberOfElements; j++)
- {
- int mask = 1 << j;
- int nAndMask = i & mask;
- int bit = nAndMask >> j;
- if (bit == 1)
- {
- checkingSum = checkingSum + elements[j];
- subset = subset + " " + elements[j];
- lenCounter++;
- }
- }
- if (checkingSum == wantedSum && lenCounter == lenSub)
- {
- Console.WriteLine("Number of subest that have the sum of {0}", wantedSum);
- counter++;
- Console.WriteLine("This subset has a sum of {0} : {1} ", wantedSum, subset);
- }
- }
- Console.WriteLine(counter);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement