Laivanupotus

//package laivanupotus;
 
import java.util.Scanner;
 
/**
 *
 * @author Adreno
 */
public class Laivanupotus {
 
    public static int n;
    
    public static void main(String[] args) {
        n = new Scanner(System.in).nextInt();
        int bestShiftValue = 1000000;
        int bestShiftID = -1;
        for (int shift=0; shift<=3; shift++) {
            int value = countStars(shift);
            if (value < bestShiftValue) {
                bestShiftValue = value;
                bestShiftID = shift;
            }
        }
        printStars(bestShiftID);
    }
 
    private static int countStars(int shift) {
        int count = 0;
        for (int y=0; y<n; y++) {
            for (int x=shift; x<n; x+=4) {
                count++;
            }
            shift = (shift+1) % 4;
        }
        return count;
    }
 
    private static void printStars(int shift) {
        for (int y=0; y<n; y++) {
            for (int x=0; x<n; x++) {
                if (x % 4 != shift) System.out.print(".");
                else System.out.print("*");
            }
            System.out.println("");
            shift = (shift+1) % 4;
        }
    }
    
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED