// Input: nothing for default test cases, // one positive integer, or two space // separated positive integers forming a // range containing two or more integers. // Created for two challenges, the first // being this: // https://www.sololearn.com/post/234487 // [Coding Challenge 7] - Narcissistic Number // This is seventh coding challenge for you // to improve your coding skills. Take // participate and post your creativity here // or you can post as Comment in code also. // https://code.sololearn.com/WKLxk9AX9X9U // Narcissistic Number // Note 1 : Write a Program in any Language // Note 2 : If you have any doubt ask in // comment // Narcissistic Number: // A number is narcissistic when the sum of // its digits, with each digit raised to the // power of digits quantity, is equal to the // number itself. // 153 ➞ 3 digits ➞ 1³ + 5³ + 3³ = 1 + 125 // + 27 = 153 ➞ Narcissistic // 84 ➞ 2 digits ➞ 8² + 4² = 64 + 16 = 80 // ➞ Not narcissistic // Note : Given a positive integer n, // implement a function that returns true // if the number is narcissistic, and false // if it's not. // Example: // Input - 8208 // 8⁴ + 2⁴ + 0⁴ + 8⁴ = 8208 // Output - true // Input - 22 // 2² + 2² = 8 // Output - false // Input - 9 // 9¹ = 9 // Output - true // Notes: // Trivially, any number in the 1-9 range is // narcissistic and any two-digit number is // not. Curious fact: Only 88 numbers are // narcissistic. // The second: <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<< // https://www.sololearn.com/learn/4708 // Armstrong Numbers // An Armstrong number is a number that is // the sum of its own digits each raised to // the power of the number of digits. // For instance, a 3 digit number will be // considered an Armstrong number if the sum // of the cubes of its digits is equal to // the number itself. // For example, 153 is an Armstrong number, // as 1**3 + 5**3 + 3**3 = 153 // Create a program to check whether a given // number is an Armstrong number or nor. // Also, create a program to print all // Armstrong numbers in a given range. // Method to extend Int class to return the // number of columns needed to display the // value. fun Int.size() = "$this".length // Method to extend Int class with generating // a power as requested. fun Int.pow(exponent: Int) = Math.pow(this.toDouble(), exponent.toDouble()).toInt() // Method to extend Int class with generating // a list of digits. Size is the number of // columns desired. // Digits in only: 1, 2, 3 for 123 fun Int.digits(size: Int = this.size()) = List(size) { this/(10.pow(size-it-1))%10 } // Function to process our challenge. For // each digit, sum it raise to the power // of the number of digits. Return whether // our number equals the sum. fun process(test: Int) = test == test.digits().sumBy { it.pow(test.size()) } // Function to display the inputs and outputs // for our challenge. fun display(test: Int) { println("$test -> ${process(test)}") } // display // Main function created for this challenge. fun main(args: Array) { // Try reading the user's list of integers. // Cause an exception on end of file, non // integer, or out of our supported range. // Otherwise, process it. try { val test = readLine()!!.split(" ").map { it.toInt() } if (test.size !in 1..2 || test.size != test.filter { it > 0 }.size || test.size == 2 && test[0] >= test[1]) throw IllegalArgumentException( "Bad input!") if (test.size == 2) for (value in test[0]..test[1]) display(value) else display(test[0]) // On exception, complain and process our // test cases. } catch (error: Throwable) { println("Bad input using defaults!") for (test in listOf(153, 84, 8208, 22, 9)) display(test) } // try } // main

armstrong ch