# Prime Square Codeforces Round #678 SOLUTION

### B. Prime Square Codeforces Round #678 SOLUTION

Sasha likes investigating different math objects, for example, magic squares. But Sasha understands that magic squares have already been studied by hundreds of people, so he sees no sense of studying them further. Instead, he invented his own type of square — a prime square.
A square of size n×n is called prime if the following three conditions are held simultaneously:
all numbers on the square are non-negative integers not exceeding 105;
there are no prime numbers in the square;
sums of integers in each row and each column are prime numbers.
Sasha has an integer n. He asks you to find any prime square of size n×n. Sasha is absolutely sure such squares exist, so just help him!
Input
The first line contains a single integer t (1≤t≤10) — the number of test cases.
Each of the next t lines contains a single integer n (2≤n≤100) — the required size of a square.
Output
For each test case print n lines, each containing n integers — the prime square you built. If there are multiple answers, print any.
Example
inputCopy
2
4
2
outputCopy
4 6 8 1
4 9 9 9
4 10 10 65
1 4 4 4
1 1
1 1
SOLUTION :

1. def is_prime(n):
2. d = 2
3. while d * d <= n:
4. if n % d == 0:
5. return False
6. d += 1
7. return n >= 2
8. for _ in range(int(input())):
9. n = int(input())
10. a = 0
11. for i in range(1, 100000):
12. if not is_prime(i) and is_prime(n 1 + i):
13. a = i
14. break
15. b = 0
16. for i in range(1, 100000):
17. if not is_prime(i) and is_prime(a * (n 1) + i):
18. b = i
19. break
20. for i in range(n1):
21. print(*( * (n1) + [a]))
22. print(*([a] * (n1) + [b]))

### 1 thought on “Prime Square Codeforces Round #678 SOLUTION”

1. mahn….it doesnt work for nos like 96.