Mathematical and Physical Journal
for High Schools
Issued by the MATFUND Foundation
Already signed up?
New to KöMaL?
I want the old design back!!! :-)

Problem I. 136. (September 2006)

I. 136. The aim of the Sudoku puzzle is to fill in a 9×9 grid with digits between 1 and 9 so that each row, column and 3×3 subgrid contain only one instance of each digit. The first figure shows a completed puzzle, while the other one is for your entertainment. (Have fun!) We store the digits from each row one after another in a text file. Write a program that decides whether a given sequence of digits corresponds to a valid Sudoku table. The source code of your program should be submitted.

(10 pont)

Deadline expired on October 16, 2006.


Sorry, the solution is available only in Hungarian. Google translation

Az alábbi fileokban elérhetö a mintamegoldás, illetve a feladat javításához felhasznált tesztadatok, külömbözö formátumokban.

i136.rar

tesztadatok.rar


Statistics:

31 students sent a solution.
10 points:Balambér Dávid, Biró János, Csima Géza, Czigler András, Danka Miklós András, Fábián András, Fehér András, Földes Imre, Gilián Zoltán, Gombos Gergely, Györök Péter, Hudoba Péter, Hunyady Márton, Jégh Tamás, Kiss Dániel Miklós, Kovács 129 Péter, Nádudvari Péter, Ócsvári Ádám, Polgárfi Bálint, Póta Kristóf, Ridinger Tamás, Slemmer András, Szél Péter, Szoldatics András, Takács László, Véges Márton, Vincze János, Zöld Péter.
5 points:1 student.
4 points:2 students.

Problems in Information Technology of KöMaL, September 2006