Още 1 опростено решение на Java, 100 points from Judge:

package ForLoopExercisePlus;

import java.util.Scanner;

public class P08EqualPairs {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        int n = Integer.parseInt(scanner.nextLine());
        int firstSum = 0;
        int secondSum = 0;
        int diff = 0;
        for (int i = 1; i <= n; i++) {
            int n1 = Integer.parseInt(scanner.nextLine());
            int n2 = Integer.parseInt(scanner.nextLine());

            if (i % 2 != 0) {
                firstSum = n1 + n2;
            } else {
                secondSum = n1 + n2;
            }

        }

        diff = Math.abs(firstSum - secondSum);

        if (firstSum == secondSum || n < 2) {
            System.out.printf("Yes, value=%d", firstSum);
        } else {
            System.out.printf("No, maxdiff=%d", diff);
        }


    }
}

Споделям и моето решение :) 
--------------------------------

package ForLoop.MoreExercises;

import java.util.Scanner;

public class EqualPairs_08 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = Integer.parseInt(scanner.nextLine());
        int sum = 0;
        int currentSum = 0;
        int maxCurrentDiff = Integer.MIN_VALUE;
        int previousSum = 0;
        int diff = 0;

        for (int i = 1; i <= n; i++) {
            previousSum = currentSum;

            int numberOne = Integer.parseInt(scanner.nextLine());
            int numberTwo = Integer.parseInt(scanner.nextLine());
            currentSum = numberOne + numberTwo;
            if (i > 1 && i <= n) {
                diff = Math.abs(currentSum - previousSum);
            }
            if (diff > maxCurrentDiff) {
                maxCurrentDiff = diff;
            }
        }
        if (diff == 0) {
            System.out.printf("Yes, value=%d", currentSum);
        } else {
            System.out.printf("No, maxdiff=%d", Math.abs(maxCurrentDiff));
        }
    }
}