Solved by 151 users: ...
UserDateAttemptTimeCMSC
stasg7`01 dec 2009`Ruby712.2050
stasg7`01 dec 2009`Ruby612.0651
bush`12 jan 2013`Ruby232.4351
FordPerfect`15 mar 2010`C++702.2053
Vyshnya`03 mar 2010`C++1403.2755
stasg7`01 dec 2009`Ruby512.0655
stasg7`01 dec 2009`Ruby412.0357
stasg7`01 dec 2009`Ruby211.8658
david_it21`16 feb 2009`Ruby112.1158
Vyshnya`02 mar 2010`C++1203.2259
Vyshnya`02 mar 2010`C++1103.0861
Vyshnya`02 mar 2010`C++402.5470
shurik`03 may 2009`Ruby815.9770
Philip_PV`11 feb 2009`C301.9772
Norbert`11 sep 2008`C++503.3674
Philip_PV`11 feb 2009`C201.9175
zhog96`24 apr 2017`C++302.4179
ignat`25 oct 2008`C++102.6579
 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

 © acm.mipt DevGroupThe page was generated in 210ms