prithivMLmods/Coder-Stat

1 2 3 4<H1>JPEG Compression</H1>5 6<p>7    The fundamental idea in the JPEG compression algorithm is to sort coeffi-8cient of given image by zigzag path and encode it. In this problem, we don’t9discuss about details of the algorithm, but you are asked to make simple pro-10gram. You are given single integer N , and you must output zigzag path on11a matrix where size is N by N . The zigzag scanning is start at the upper-left12corner (0, 0) and end up at the bottom-right corner. See the following Figure13and sample output to make sure rule of the zigzag scanning. For example, if you14are given N = 8, corresponding output should be a matrix shown in right-side15of the Figure. This matrix consists of visited time for each element.16</p>17 18<center>19<img src="https://judgeapi.u-aizu.ac.jp/resources/images/IMAGE1_1007">20</center>21 22 23 24<H2>Input</H2>25 26<p>27Several test cases are given. Each test case consists of one integer N (0 < N <2810) in a line. The input will end at a line contains single zero.29 30</p>31 32<H2>Output</H2>33 34<p>35For each input, you must output a matrix where each element is the visited36time. All numbers in the matrix must be right justified in a field of width 3.37Each matrix should be prefixed by a header “Case x:” where x equals test case38number.39 40</p>41 42<H2>Sample Input</H2>43<pre>44345446047</pre>48 49<H2>Output for the Sample Input</H2>50<pre>51Case 1:52  1  2  653  3  5  754  4  8  955Case 2:56  1  2  6  757  3  5  8 1358  4  9 12 1459 10 11 15 1660</pre>61