| Task: | Simplified Sudoku |
| Sender: | madwarge |
| Submission time: | 2018-09-13 17:21:10 +0300 |
| Language: | Java |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.22 s | details |
| #2 | ACCEPTED | 0.23 s | details |
| #3 | ACCEPTED | 0.22 s | details |
| #4 | ACCEPTED | 0.22 s | details |
| #5 | ACCEPTED | 0.22 s | details |
| #6 | ACCEPTED | 0.22 s | details |
| #7 | ACCEPTED | 0.32 s | details |
| #8 | ACCEPTED | 0.32 s | details |
| #9 | ACCEPTED | 0.33 s | details |
| #10 | ACCEPTED | 0.32 s | details |
Code
//package kilpaohjelmointi;
import java.util.Scanner;
/**
*
* @author madwarge
*/
public class Kilpaohjelmointi {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int n = s.nextInt();
int[][] t = new int[n][n];
for (int i = 0; i < t.length; i++) {
for (int j = 0; j < t.length; j++) {
t[i][j] = s.nextInt();
}
}
boolean vastaus = true;
//rows
for (int i = 0; i < t.length; i++) {
boolean[] tarkistus = new boolean[n + 1];
for (int j = 0; j < t.length; j++) {
if(tarkistus[t[i][j]] == true) {
vastaus = false;
} else {
tarkistus[t[i][j]] = true;
}
}
}
//columns
for (int i = 0; i < t.length; i++) {
boolean[] tarkistus = new boolean[n + 1];
for (int j = 0; j < t.length; j++) {
if(tarkistus[t[j][i]] == true) {
vastaus = false;
} else {
tarkistus[t[j][i]] = true;
}
}
}
if(vastaus) {
System.out.println("YES");
} else {
System.out.println("NO");
}
}
}
Test details
Test 1
Verdict: ACCEPTED
| input |
|---|
| 1 1 |
| correct output |
|---|
| YES |
| user output |
|---|
| YES |
Test 2
Verdict: ACCEPTED
| input |
|---|
| 2 1 2 2 1 |
| correct output |
|---|
| YES |
| user output |
|---|
| YES |
Test 3
Verdict: ACCEPTED
| input |
|---|
| 2 1 1 1 1 |
| correct output |
|---|
| NO |
| user output |
|---|
| NO |
Test 4
Verdict: ACCEPTED
| input |
|---|
| 2 2 2 2 2 |
| correct output |
|---|
| NO |
| user output |
|---|
| NO |
Test 5
Verdict: ACCEPTED
| input |
|---|
| 2 1 2 1 2 |
| correct output |
|---|
| NO |
| user output |
|---|
| NO |
Test 6
Verdict: ACCEPTED
| input |
|---|
| 2 1 2 1 1 |
| correct output |
|---|
| NO |
| user output |
|---|
| NO |
Test 7
Verdict: ACCEPTED
| input |
|---|
| 100 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ... |
| correct output |
|---|
| NO |
| user output |
|---|
| NO |
Test 8
Verdict: ACCEPTED
| input |
|---|
| 100 32 84 70 64 50 82 33 91 77 56 ... |
| correct output |
|---|
| NO |
| user output |
|---|
| NO |
Test 9
Verdict: ACCEPTED
| input |
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| YES |
| user output |
|---|
| YES |
Test 10
Verdict: ACCEPTED
| input |
|---|
| 100 1 2 3 4 5 6 7 8 9 10 11 12 13 ... |
| correct output |
|---|
| NO |
| user output |
|---|
| NO |
