Advertisement
simeon_petrov

Problem 33. Equal Pairs 100%

Dec 4th, 2017
213
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C# 0.95 KB | None | 0 0
  1. using System;
  2.  
  3. class EqualPairs
  4. {
  5.     static void Main(string[] args)
  6.     {
  7.         long n = long.Parse(Console.ReadLine());
  8.  
  9.         long currentSum = 0;
  10.         long previousSum = 0;
  11.         long diff = 0;
  12.         long maxDiff = 0;
  13.         for (long i = 0; i < n; i++)
  14.         {
  15.             previousSum = currentSum;
  16.             currentSum = 0;
  17.             currentSum += long.Parse(Console.ReadLine());
  18.             currentSum += long.Parse(Console.ReadLine());
  19.             if (i != 0)
  20.             {
  21.                 diff = Math.Abs(currentSum - previousSum);
  22.                 if (diff != 0 && diff > maxDiff)
  23.                 {
  24.                     maxDiff = diff;
  25.                 }
  26.             }
  27.         }
  28.         if (previousSum == currentSum || n == 1)
  29.         {
  30.             Console.WriteLine($"Yes, value={currentSum}");
  31.  
  32.         }
  33.         else
  34.         {
  35.             Console.WriteLine("No, maxdiff={0}", maxDiff);
  36.         }
  37.     }
  38. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement