/* Created for Nevfy's challenge https://www.sololearn.com/Discuss/1207965 [ASSIGNMENT] Magnetic numbers (extended version) PART 1: Let's pretend that numbers from 0 to 9 are the poles of a magnet. - if the number is even its a positive pole (+) - if the number is odd its a negitive pole (-) Two numbers can either attract ( >< ) or repel ( <> ). For example: 6 <> 2 or 3 >< 4 Numbers with several digits can attract ( >< ), repel ( <> ) or be balanced ( ~~ ) depending on attraction or repeling of their corresponding digits. For example: 105 <> 397 because 1 <> 3 and 0 >< 9 and 5 <> 7 12 ~~ 13 because 1 <> 1 and 2 >< 3 PART 2: Your task is: Using a random number generator build a matrix of given size with given numbers length and print it out together with numbers magnetic states. Good luck! Example of the output for the input 3,2,4 (matrix 3 by 2 with 4 digits numbers): 6185 <> 8306 ^ v v ^ 2523 >< 9417 ~ ^ ~ v 3533 ~~ 4695 CREDENTIALS: This task is an extension of the other one, which operates only with one digit numbers. So if you didn't solve it before, you can find its full text here: https://www.sololearn.com/Discuss/1207800/?ref=app I thank @D_Stark for the initial idea of the task and @John Wells for the idea of its extension.*/ // Expecting three numbers on a single line // rows columns digits import java.util.Random val random = Random() //************************************************** // Get a random number in the range fun rand(from: Int, to: Int) = random.nextInt(to-from+1)+from //************************************************** // Extend Int to add raise to power. fun Int.pow(number: Int): Int = if (number == 0) 1 else this.pow(number-1)*this //************************************************** // Test attraction or repulsion of the numbers. fun test(digits: Int, first_: Int, second_: Int): Int { // For each digit, count how many more pairs are // both even or odd vs how many are one of each. var result = 0; var first = first_ var second = second_ for (digit in 1..digits) { if (first%2 == second%2) result++ else result-- first /= 10 second /= 10 } // for // Return 0 when the pairs are evenly split, 1 // when there are more matching pairs, or -1 when // there are more unmatching pairs. return if (result > 0) 1 else if (result < 0) -1 else 0 } // test //************************************************** // Do the challenge... fun main(args: Array) { // Default to 3 rows, 2 columns, and try reading // the numbers. var rows = 3 var columns = 2 var digits = 1 try { val nums = readLine()!!.split(" ") rows = nums[0].toInt() columns = nums[1].toInt() digits = nums[2].toInt() // Catch any error and use the defaults. } catch (error: Throwable) { print("Error, defaulting to ${rows}x$columns") println(" with $digits digits") // Verify the numbers are reasonable. } finally { if (digits !in 1..7) { digits = 1 print("Digits out of range, ") println("defaulting to $digits") } // if if (columns*digits > 36 || columns > 9) { columns = 2 print("Too many columns, ") println("defaulting to $columns") } else if (columns < 1) { columns = 2 print("Too few columns, ") println("defaulting to $columns") } // if if (rows !in 1..9) { rows = 3 print("Rows out of range, ") println("defaulting to $rows") } } // try // Create the array. Fill array with random numbers. // Figure out the bottom and top of the range for // the digits allowing 0 for single digits. var array = Array(rows, {_ -> Array(columns, {_ -> 0})}) val bottom = if (digits == 1) 0 else 10.pow(digits-1) val top = 10.pow(digits)-1 for (row in 0 until rows) for (column in 0 until columns) array[row][column] = rand(bottom, top) // For each row, process it. for (row in 0 until rows) { // For each column, if it is the second or beyond // print the attraction or repulsion characters // as needed. Follow up with the value. for (column in 0 until columns) { if (column > 0) print( when (test(digits, array[row][column-1], array[row][column])) { 1 -> "<>" 0 -> "~~" else -> "><"}) print("${array[row][column]}") } // for // Finishing off the line. println() // If this isn't the last row, we need to // print lines for the attraction or repulsion. if (row < rows-1) { // Figure out spacing needed before character. val pre = when (digits) { 1, 2 -> "" 3, 4 -> " " 5, 6 -> " " else -> " " } // when // Figure out spacing needed after character. val post = when (digits) { 1 -> "" 2, 3 -> " " 4, 5 -> " " else -> " " } // when // Output the top row of characters for each // column between this row and the next. for (column in 0 until columns) print( when (test(digits, array[row][column], array[row+1][column])) { 1 -> pre+"^ "+post 0 -> pre+"~ "+post else -> pre+"v "+post}) println() // Output the bottom row of characters for each // column between this row and the next. for (column in 0 until columns) print( when (test(digits, array[row][column], array[row+1][column])) { 1 -> pre+"v "+post 0 -> pre+"~ "+post else -> pre+"^ "+post}) println() } // if } // for } // main

extendedMagnet ch