AppDate

package com.company;

import java.util.ArrayDeque;
import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {

        Scanner scanner = new Scanner(System.in);
        String [] male = scanner.nextLine().split(" ");
        String [] female = scanner.nextLine().split(" ");

        ArrayDeque <Integer> maleStack = new ArrayDeque();
        ArrayDeque <Integer> femaleQueue = new ArrayDeque();

        int countMatches = 0;

        for (int i = 0; i<male.length; i++) {
            maleStack.push(Integer.parseInt(male[i]));
        }

        for (int i = 0; i<female.length; i++) {
            femaleQueue.offer(Integer.parseInt(female[i]));
        }


        while (maleStack.size()>0 && femaleQueue.size() > 0) {

            int malePeak = maleStack.peek();
            int femalePeak = femaleQueue.peek();

            if (malePeak <=0 || femalePeak <=0) {
            if (malePeak <=0) {
                maleStack.pop();
            }
            if (femalePeak <=0) {
                femaleQueue.poll();
            }
            continue;
            }

            if (malePeak %25==0 || femalePeak %25 ==0) {

                if (malePeak % 25==0) {
                    if (maleStack.size()>1) {
                        maleStack.pop();
                        maleStack.pop();
                    } else {
                        maleStack.pop();
                    }
                }
                if (femalePeak % 25 == 0) {
                    if (femaleQueue.size()>1) {
                        femaleQueue.poll();
                        femaleQueue.poll();
                    } else {
                        femaleQueue.poll();
                    }
                }
                continue;
            }

            if (malePeak == femalePeak) {
                countMatches++;
                maleStack.pop();
                femaleQueue.poll();

            } else {
                femaleQueue.poll();
                malePeak -=2;
                maleStack.pop();

                ArrayDeque <Integer> setStack = new ArrayDeque();
                setStack.add(malePeak);

                for (int i = 0; i<maleStack.size(); i++) {
                    int current = maleStack.pop();
                    setStack.add(current);
                    i--;
                }

                maleStack = setStack;
            }


        }

        System.out.printf("Matches: %s%n", countMatches);
        if (maleStack.size() == 0 && femaleQueue.size()==0) {
            System.out.println("Males left: none");
            System.out.println("Females left: none");
        } else if (maleStack.size()==0) {
            System.out.println("Males left: none");
            if (femaleQueue.size()>0) {
                System.out.print("Females left: ");
                for (int i = 0; i<femaleQueue.size(); i++) {
                    if (femaleQueue.size() == 1) {
                        System.out.print(femaleQueue.poll());
                    } else {
                        System.out.print(femaleQueue.poll() + ", ");
                        i--;
                    }
                }
                System.out.println();
            }
        } else {
            System.out.print("Males left: ");
            for (int i = 0; i<maleStack.size(); i++) {
                if (maleStack.size() == 1) {
                    System.out.print(maleStack.pop());
                } else {
                    System.out.print(maleStack.pop() + ", ");
                    i--;
                }
            }
            System.out.println();
            System.out.println("Females left: none");
        }


        // write your code here
    }
}