<PREV Problem:
NEXT>
Solved by 151 users: ...
UserDateAttemptTimeCMSC
stasg701 dec 2009Ruby712.2050 
stasg701 dec 2009Ruby612.0651 
bush12 jan 2013Ruby232.4351 
FordPerfect15 mar 2010C++702.2053 
Vyshnya03 mar 2010C++1403.2755 
stasg701 dec 2009Ruby512.0655 
stasg701 dec 2009Ruby412.0357 
stasg701 dec 2009Ruby211.8658 
david_it2116 feb 2009Ruby112.1158 
Vyshnya02 mar 2010C++1203.2259 
Vyshnya02 mar 2010C++1103.0861 
Vyshnya02 mar 2010C++402.5470 
shurik03 may 2009Ruby815.9770 
Philip_PV11 feb 2009C301.9772 
Norbert11 sep 2008C++503.3674 
Philip_PV11 feb 2009C201.9175 
zhog9624 apr 2017C++302.4179 
ignat25 oct 2008C++102.6579 
Languages
C++
116
C
20
FPC
8
Java
5
Ruby
5
Kylix
4
Python
1
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 
 > 

Sudoku

Time limit = 8 second(s)

Sudoku of size N is square with side length M = N2. Sudoku is divided into N2 N-squares of size N x N. Each N-square is divided into N2 small squares. Each small square contains one integer from {1, 2, ..., N2}.

Each row, each column and each N-square of sudoku contains integer numbers {1, 2, ..., N2}.

Input Integer number N, 0 < N < 51.

Output Sudoku of size N.

Input#1
3
Output#1
1 3 2 5 4 6 9 8 7
4 6 5 8 7 9 3 2 1
7 9 8 2 1 3 6 5 4
9 2 1 4 3 5 8 7 6
3 5 4 7 6 8 2 1 9
6 8 7 1 9 2 5 4 3
5 7 6 9 8 1 4 3 2
2 4 3 6 5 7 1 9 8
8 1 9 3 2 4 7 6 5

Author:
Abzal Orzaliev
12 November 2007

<PREV | Problem set | Search related messages | NEXT>


© acm.mipt DevGroup
The page was generated in 190ms

SW soft NIX
ID = 18.232.133.231