Laivanupotus

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <set>
#include <unordered_set>
#include <cmath>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sstream>
#include <tuple>


using namespace std;
typedef long long LL;



int main() {
	int n;
	cin >> n;
	vector<string> grid(n, string(n, '.'));
	
	for (int row = 0; row < n; row++) {
		for (int col = 0; col < n; col++) {
			if (row % 4 == 0 && col % 4 == 2) {
				grid[row][col] = '*';
			}
			if (row % 4 == 1 && col % 4 == 0) {
				grid[row][col] = '*';
			}
			if (row % 4 == 2 && col % 4 == 3) {
				grid[row][col] = '*';
			}
			if (row % 4 == 3 && col % 4 == 1) {
				grid[row][col] = '*';
			}
		}
	}
	for (auto s : grid) {
		cout << s << '\n';
	}
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: WRONG ANSWER

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: WRONG ANSWER

Test 10

Group: 2

Verdict: WRONG ANSWER

Test 11

Group: 3

Verdict: WRONG ANSWER

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: WRONG ANSWER

Test 15

Group: 3

Verdict: ACCEPTED