Advertisement
Guest User

OddEvenPositions

a guest
May 1st, 2016
63
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C# 1.59 KB | None | 0 0
  1. using System;
  2.  
  3. class OddEvenPosition
  4. {
  5.     static void Main()
  6.     {
  7.         double n = double.Parse(Console.ReadLine());
  8.         double evenNumberSum = 0;
  9.         double oddNumberSum = 0;
  10.         double maxNumberEven = double.MinValue;
  11.         double minNumberEven = double.MaxValue;
  12.         double maxNumberOdd = double.MinValue;
  13.         double minNumberOdd = double.MaxValue;
  14.  
  15.         for (double i = 1; i <= n; i++)
  16.         {
  17.             double numbers = double.Parse(Console.ReadLine());
  18.  
  19.             if (i % 2 == 0)
  20.             {
  21.                 evenNumberSum = evenNumberSum + numbers;
  22.                 if (numbers > maxNumberEven)
  23.                 {
  24.                     maxNumberEven = numbers;
  25.                 }
  26.                 if (numbers < minNumberEven)
  27.                 {
  28.                     minNumberEven = numbers;
  29.                 }
  30.             }
  31.             else
  32.             {
  33.                 oddNumberSum = oddNumberSum + numbers;
  34.                 if (numbers > maxNumberOdd)
  35.                 {
  36.                     maxNumberOdd = numbers;
  37.  
  38.                 }
  39.                 if (numbers > minNumberOdd)
  40.                 {
  41.                     minNumberOdd = numbers;
  42.                 }
  43.             }
  44.         }
  45.  
  46.         Console.WriteLine("OddSum = {0}", oddNumberSum);
  47.         Console.WriteLine("OddMin = {0}", minNumberOdd);
  48.         Console.WriteLine("OddMax = {0}", maxNumberOdd);
  49.         Console.WriteLine("EvenSum = {0}", evenNumberSum);
  50.         Console.WriteLine("EvenMin = {0}", minNumberEven);
  51.         Console.WriteLine("EvenMax = {0}", maxNumberEven);
  52.     }
  53. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement