// Input: nothing to use the default or an integer // between one and 121. // Created for this challenge: // https://www.sololearn.com/post/137704 // [CHALLENGE] SEIDOV SPIRAL // The Seidov spiral is a counterclockwise spiral // such that all of its rows, columns, and // diagonals contain distinct digits. // Write a program to print a Seidov spiral up to // the Nth term considering a(1)=1 and taking the // smallest possible number at each step. // For example: // Input: 42 // Output: // 4--11--10---3---8---7---9 // | | // 7 3---5---6---1---2 4 // | | | | // 8 1 2---4---3 6 5 // | | | | | | // 6 5 3 1---2 4 8 // | | | | | // 3 2 4---5---6---1 7 // | | | // 9 6---1---2---4---5---3 // Enumeration class for the direction we are // moving. enum class Direction { RIGHT, UP, LEFT, DOWN } // Function to calculate the columns required to // hold the requested values. The lines will be // the same or one less. While the matrix can // not hold the values, if the columns are the // same as the lines, increment the columns, // otherwise, increment the lines. fun columns(value: Int): Int { var line = 1 var column = 1 while (line*column < value) if (column == line) column++ else line++ return column } // columns // Function to calculate the lines required to // hold the requested values. While the matrix // can not hold the values, increment the lines. // Assume the columns are one bigger than the // lines. fun lines(value: Int): Int { var line = 1 while (line*(line+1) < value) line++ return line } // columns // Function to get the number from the user or // use the default. fun read(): Int { // Allocate our return and try reading an // integer between one and 121. Cause an // exception on any issues. var value = 0 try { value = readLine()!!.toInt() if (value !in 1..121) throw IllegalArgumentException("Bad input!") // On exception, complain and use the default. } catch (error: Throwable) { println("Bad input using default!") value = 42 } // try return value } // read // Main function for this challenge. fun main(args: Array) { // Read the number to process and allocate a // matrix large enough to hold them. val number = read() val matrix = Array(lines(number)) { Array(columns(number)) { 0 } } val output = Array(matrix.size*2-1) { Array(matrix[0].size*4) { ' ' } } // Function to display our matrix. If the // element is unused (zero), display spaces, // else display it's value. fun display() { for (line in output) { for (element in line) print(element) println() } // for } // display // Function to find the lowest possible value // for the next element. fun find(line: Int, column: Int): Int { // Default our used set to zero. For all // columns in our line, add their value // to the set. val used = mutableSetOf(0) for (index in matrix[0].indices) used.add(matrix[line][index]) // For all lines in our column, add their // value to our set. for (index in matrix.indices) used.add(matrix[index][column]) // Calculste our starting point for our // diagonal starting above & left towards // below & right. For all elements in our // diagonal, add their value to our set. var min = Math.min(line, column) var row = line-min var entry = column-min while (row < matrix.size && entry < matrix[0].size) used.add(matrix[row++][entry++]) // Calculste our starting point for our // diagonal starting above & right towards // below & left. For all elements in our // diagonal, add their value to our set. min = Math.min(line, matrix[0].size-column-1) row = line-min entry = column+min while (row < matrix.size && entry >= 0) used.add(matrix[row++][entry--]) // Return the minimum value currently unused. min = 1 while (min in used) min++ return min } // find // Function to fill in our matrix. fun process() { // Calculate our starting line & column and // set up our data to cause our spiral. This // is the direction going, the offset to // calculate the next corner stop point, and // our current corner stop point. var line = matrix.size/2 var column = (matrix[0].size-1)/2 var direction = Direction.RIGHT var offset = 1 var stop = column+offset // Zero the numbers filled into our matrix // and, while we need more, fill it in. var count = 0 while (count < number) { // Calculate and fill in the current // entry, plus count it. matrix[line][column] = find(line, column) count++ if (matrix[line][column]/10 > 0) output[line*2][column*4+2] = (matrix[line][column]/10+'0'.toInt()). toChar() output[line*2][column*4+3] = (matrix[line][column]%10+'0'.toInt()). toChar() // When going right, if we reached our stop // point, place our connecting line and setup // to go up. Otherwise, place our connecting // line and increment our column. Going up // requires: changing our direction, setting // our stop point, and decrementing our line. when (direction) { Direction.RIGHT -> if (column == stop) { if (count < number) { output[line*2-1][column*4+3] = '|' } // if direction = Direction.UP stop = line-offset line-- } else { if (count < number) { output[line*2][column*4+4] = '-' output[line*2][column*4+5] = '-' output[line*2][column*4+6] = '-' } // if column++ } // if // When going up, if we reached our stop // point, place our connecting line and // setup to go left. Otherwise, place our // connecting line and decrement our line. // Going left requires: increasing our // offset as we must go beyond what is // done, changing our direction, setting // our stop point, and decrementing our // column. Direction.UP -> if (line == stop) { if (count < number) { if (output[line*2][column*4+2] == ' ') output[line*2][column*4+2] = '-' output[line*2][column*4+1] = '-' output[line*2][column*4] = '-' } // if offset++ direction = Direction.LEFT stop = column-offset column-- } else { if (count < number) output[line*2-1][column*4+3] = '|' line-- } // if // When going left, if we reached our stop // point, place our connecting line and // setup to go down. Otherwise, place our // connecting line and decrement our // column. Going down requires: changing // our direction, setting our stop point, // and incrementing our line. Direction.LEFT -> if (column == stop) { if (count < number) output[line*2+1][column*4+3] = '|' direction = Direction.DOWN stop = line+offset line++ } else { if (count < number) { if (output[line*2][column*4+2] == ' ') output[line*2][column*4+2] = '-' output[line*2][column*4+1] = '-' output[line*2][column*4] = '-' } // if column-- } // if // When going down, if we reached our // stop point, place our connecting line // and setup to go right. Otherwise, // place our connecting line and increment // our line. Going right requires: // increasing our offset as we must go // beyond what is done, changing our // direction, setting our stop point, and // incrementing our column. Direction.DOWN -> if (line == stop) { if (count < number) { output[line*2][column*4+4] = '-' output[line*2][column*4+5] = '-' output[line*2][column*4+6] = '-' } // if offset++ direction = Direction.RIGHT stop = column+offset column++ } else { if (count < number) output[line*2+1][column*4+3] = '|' line++ } // if } // direction } // true // Display the finished matrix. display() } // process // Process this challenge. process() } // main

seidov ch