Binary Sudoku Error Checker

Statement

Goal

Binary Sudoku is a variant of Sudoku that only allows the numbers 0 and 1. The following three conditions must be met to pass:
Each row and column must contain an equal number of 0s and 1s (5 each for a 10x10 grid).
No row or column may contain a sequence with more than two repeating digits (e.g. 1 1 0 is valid but 1 1 1 is invalid)
No rows (or columns) can be duplicates of other rows (or columns). (Note: you don't need to check columns against rows, only for duplicates amongst rows or columns separately)

Given a completed 10x10 binary grid of 0s and 1s (space-separated on each row), check if there are any errors.
If there are no errors print "Pass".
If there are errors, then print the first row or column that breaks one of the rules.

"First" here means in order of rows first, top to bottom, then columns, left to right.
Duplicate rows/columns are only counted as errors once they have appeared twice.

Input

10 lines : 10 rows of 10 space-separated 0s and 1s.

Output

"Pass" if the solution is valid or the first row/column to break one of the rules.
(If it was a column, print it as a space-separated row)

Constraints

All input grids will consist of 10 lines of 10 space-separated 0s and 1s.
No input will have a trailing newline after last row.

Example

Input

1 1 0 1 1 0 1 0 0 0
0 0 0 1 1 1 0 1 1 0
1 0 0 0 1 0 1 0 0 0
0 0 0 1 1 0 1 0 0 0
1 0 1 1 1 1 1 0 1 1
0 0 1 1 0 0 0 0 0 1
1 0 1 0 1 1 1 0 0 1
0 0 0 1 0 0 1 1 0 0
1 1 0 1 0 0 1 1 0 1
1 1 1 0 1 1 0 1 0 0

Output

1 1 0 1 1 0 1 0 0 0

Game modes

Fastest, Shortest

Test cases

Test 1 Test

Input

1 1 0 1 1 0 1 0 0 0 0 0 0 1 1 1 0 1 1 0 1 0 0 0 1 0 1 0 0 0 0 0 0 1 1 0 1 0 0 0 1 0 1 1 1 1 1 0 1 1 0 0 1 1 0 0 0 0 0 1 1 0 1 0 1 1 1 0 0 1 0 0 0 1 0 0 1 1 0 0 1 1 0 1 0 0 1 1 0 1 1 1 1 0 1 1 0 1 0 0

Output

1 1 0 1 1 0 1 0 0 0

Validator 1 Validator

Input

1 0 1 0 0 1 0 1 0 1 0 0 0 1 1 0 1 0 0 1 0 1 0 0 0 0 1 0 0 1 1 1 1 1 1 0 1 0 0 0 1 0 1 0 1 1 1 1 1 0 1 0 0 0 0 1 1 1 0 1 1 1 1 1 1 0 1 0 0 0 0 1 1 0 0 1 0 0 1 0 1 1 0 1 0 1 0 1 0 1 1 0 1 0 1 1 1 0 1 0

Output

0 0 0 1 1 0 1 0 0 1

Test 2 Test

Input

0 1 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 1 0

Output

0 1 0 1 0 1 0 1 0 1

Validator 2 Validator

Input

0 0 1 1 0 0 1 0 1 1 1 0 1 0 0 1 0 1 0 1 1 0 1 0 1 0 1 1 0 0 0 0 1 0 1 1 0 1 0 1 1 0 0 1 0 1 0 0 1 1 0 1 0 1 1 0 1 0 0 1 1 0 1 0 1 0 1 0 1 0 0 0 1 1 0 0 1 1 0 1 0 0 1 0 1 0 1 1 0 1 0 1 0 1 1 0 0 1 0 1

Output

0 1 1 0 1 0 1 0 0 0

Test 3 Test

Input

0 0 1 1 0 0 1 0 1 1 0 1 1 0 1 0 1 1 0 0 1 1 0 0 1 0 1 0 0 1 1 0 0 1 1 0 1 0 1 0 1 0 1 0 0 1 0 0 1 0 0 0 1 1 0 0 1 0 1 1 1 0 1 1 0 1 0 1 0 0 0 1 0 0 1 0 1 1 0 1 1 1 0 0 1 0 0 1 0 1 0 1 0 1 0 1 0 1 1 0

Output

1 0 1 0 0 1 0 0 1 0

Validator 3 Validator

Input

0 1 0 1 0 1 0 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 1 0 1 0 1 0 0 1 0 0 1 1 0 1 0 1 0 1 1 0 0 1 1 0 1 0 1 0 1 1 0 0 1 0 0 1 1 1 0 0 1 0 0 1 1 0 0 0 1 0 1 1 0 0 1 1 1 0 1 1 0 0 1 1 0 1 1 1 0 1 1 0 0 1 0 0

Output

1 0 1 1 0 0 1 1 0 1

Test 4 Test

Input

1 0 1 1 0 0 1 0 1 0 0 0 1 0 1 1 0 1 0 1 0 1 0 1 1 0 1 0 1 0 1 0 0 1 0 1 0 0 1 1 0 1 1 0 1 1 0 1 0 0 1 0 0 1 0 0 1 1 0 1 0 1 1 0 0 1 0 0 1 1 1 0 0 1 1 0 1 1 0 0 0 1 1 0 0 1 0 1 0 1 1 1 0 0 1 0 1 0 1 0

Output

Pass

Validator 4 Validator

Input

0 1 0 1 0 1 0 1 0 1 0 0 1 0 0 1 1 0 1 1 1 0 0 1 1 0 1 0 1 0 0 1 0 0 1 1 0 1 0 1 0 1 1 0 0 1 1 0 1 0 1 0 1 1 0 0 1 0 0 1 1 1 0 0 1 0 0 1 1 0 0 0 1 0 1 1 0 0 1 1 1 0 1 1 0 0 1 1 0 0 1 1 0 1 1 0 0 1 0 0

Output

Pass

Solution language

Solution

Stub generator input

Comments

11 Comments

AmyrFezzeni Unnamed CodinGamer

over 3 years ago

✅ Approved the contribution. Comment: i love sudoku game

MrSpoony Unnamed CodinGamer

Like the idea! I don't know how many people from `Easy` are able to do this in the time, but it should be ok.

TheCaptainCoder Unnamed CodinGamer

✅ Approved the contribution. Comment: It is a challenging puzzle that, with the correct approach, is still solvable in 5 minutes.

A nice little puzzle. This condition was confusing to me because of the word "row" at the end: `No row or column can have more than two of the same number in a row.` I think the word sequence may be less confusing: `No row or column may contain a sequence with more than two repeating digits (e.g. 1 1 0 is valid but 1 1 1 is invalid)`

StepBack13 Unnamed CodinGamer

Thanks for the tip, I've updated the description as suggested. I'm glad you enjoyed it!

BleedingWithin Unnamed CodinGamer

✅ Approved the contribution. Comment: This is a valid puzzle. My only suggestion is to emphasise that validity of the rows should be checked before the columns.

GuillaumeLAURIE Unnamed CodinGamer

The contribution is interesting. I was thinking it was more easy but it's not so easy. Finding double line is easy (column too) but you need to keep the information cause it can bug before the double line. So, I like this contribution, if you pass it public, you can count on me to valid it. Great job !

DavidAvsajanishvili Unnamed CodinGamer

almost 4 years ago

Solution in Python: ``` def is_good(items): for i, item in enumerate(items): if (len([c for c in item if c == '1']) != len([c for c in item if c == '0']) ) or ('0 0 0' in item or '1 1 1' in item ) or (item in items[:i]): return print(item) return True rows = [input() for i in range(10)] is_good(rows) and is_good([ ' '.join(r.split(' ')[i] for r in rows) for i in range(10) ]) and print('Pass') ```

10 lines of code in Python... I'm afraid it's too easy! But maybe for the "Easy" category it's fine

Ah, sorry, it's for "clash of code!" Then it should be fine :) Just one suggestion (to make it even more easier): remove spaces (i.e. just "010101" rather than space-separated "0 1 0 1 0 1") - this will make it even easier.