Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- using System;
- namespace _12_Zero_Subset
- {
- class Program
- {
- static void Main()
- {
- int[] fiveNumbers = new int[5];
- int n = fiveNumbers.Length;
- string output = "";
- for (int i = 0; i < n; i++)
- {
- fiveNumbers[i] = int.Parse(Console.ReadLine());
- }
- int sum = 0;
- int result = 0;
- //check if element is 0:
- for (int i = 0; i < n; i++)
- {
- if (fiveNumbers[i] == 0)
- {
- Console.WriteLine(fiveNumbers[i]);
- result ++;
- }
- }
- //check for sum of every two numbers:
- for (int i = 0; i < n; i++)
- {
- for (int k = (i + 1); k < n; k++)
- {
- if ((fiveNumbers[i] + fiveNumbers[k]) == sum)
- {
- Console.WriteLine("{0} + {1} = 0", fiveNumbers[i], fiveNumbers[k]);
- result ++;
- }
- }
- }
- //check for sum of every three numbers:
- for (int i = 0; i < n; i++)
- {
- for (int k = (i+1); k < n; k++)
- {
- for (int p = (k+1); p < n; p++)
- {
- if ((fiveNumbers[i] + fiveNumbers[k] + fiveNumbers[p]) == sum)
- {
- Console.WriteLine("{0} + {1} + {2} = 0", fiveNumbers[i], fiveNumbers[k], fiveNumbers[p]);
- result ++;
- }
- }
- }
- }
- //check for sum of every four elements:
- for (int i = 0; i < n; i++)
- {
- for (int k = (i+1); k < n; k++)
- {
- for (int p = (k+1); p < n; p++)
- {
- for (int q = (p+1); q < n; q++)
- {
- if ((fiveNumbers[i] + fiveNumbers[k] + fiveNumbers[p]+fiveNumbers[q]) == sum)
- {
- Console.WriteLine("{0} + {1} + {2} + {3} = 0", fiveNumbers[i], fiveNumbers[k], fiveNumbers[p], fiveNumbers[q]);
- result ++;
- }
- }
- }
- }
- }
- //check for sum of all five element:
- int allFive = 0;
- for (int i = 0; i < n; i++) allFive = allFive + fiveNumbers[i];
- if (allFive == sum)
- {
- for (int i = 0; i < n; i++) output = output + " " + Convert.ToString(fiveNumbers[i]) + " +";
- output = output.TrimStart(' ');
- output = output.TrimEnd('+');
- Console.Write(output);
- Console.Write(" = 0");
- Console.WriteLine();
- result ++;
- }
- if (result == 0) Console.WriteLine("no zero subset");
- }
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement