/* Challenge by Rajesh Kumar posted here: https://www.sololearn.com/Discuss/909843/?ref=app Challenge: Crazy Number An Crazy number is an n-digit positive number such that the sum of its digits raised to the power n is the number itself. Write a program to check whether a number is Crazy number or not. If number is a Crazy number, print "Yes" else "No". See sample test case given below for more clarification. N.B: We are assuming all numbers given are in base 10. Input Specification: First input is an interger t denotes number of test cases. Next there will be t lines denoting t test cases. Each test case line will have a number N for which you have to check whether it is Crazy Number of not. Output Specification: Output contains t lines. ith line output will be either "Yes" or "No" depending on the number in ith test case. Constraints: 0 < t < 2^31 0 < N < 2^63 Sample Input: 3 153 12 1634 Sample Output: Yes No Yes Explanation: There are three test cases. First testcase: 153 is a 3 digit number. So 1^3 + 5^3 + 3^3 = = 1 + 125 + 27 = 153. So, 157 is Crazy number. Second testcase: 12 is a 2 digit number. So 1^2 + 2^2 = 1 + 4 = 5 != 12. So, 12 is not a Crazy number. Third testcase: 1634 is a 4 digit number. So 1^4 + 6^4 + 3^4 + 4^4 = 1 + 1296 + 81 + 256 = 1634. So, 1634 is a Crazy number. Hence the ouput is : Yes No Yes My Program: https://code.sololearn.com/cXme4sSLqqfu/#java Edit: Except few peoples everyone else write code for just a simple Armstrong Number Checker. All you need to read the question again specially the Input/output Specifications. and few coders like @Dipta @Rame#1 @Reniel @Yerucham @LukArToDo writes code according to input/output specication but only few of them passes this case ((Constraints: 0 < t < 2^31 0 < N < 2^63)) */ /* 1 82693916578 Yes */ #include // ************************************************** // Function to count the digits in a number. // Increment count and divide number by 10 until // it becomes 0. // // Argument & return: // num: the number to process. // return of digits. 5 returned for 12345. int digits(long long num) { int rsl = 0; while (num > 0) { num /= 10; rsl++; } return rsl; } // ************************************************** // Function to raise the digit to the power. // // Arguments & return: // dig: the current digit to process. // pwr: the power to use. // return of dig**pwr. 2**3=8. long long power(int dig, int pwr) { long long rsl = 1; for (int i = 0; i < pwr; i++) rsl *= dig; return rsl; } // ************************************************** // Function to test for being crazy. 153 is a 3 // digit number so 1**3+5**3+3**3 = 1+125+27 = 153. // // Argument & return: // num: number to test. // return true, when number is crazy. bool crazy(long long num) { // Count the digits in the number, save the number // for checking later, and zero the result. int n = digits(num); long long chk = num; long long rsl = 0; // For each digit, raise it to the power of the // number of digits and add it to the result. for (int i = 0; i < n; i++) { rsl += power(num%10, n); num /= 10; } // Return true, when the result is the same as our // original number. return rsl == chk; } // ************************************************** // Main entry function to input our number of test // cases and loop getting that test case number, // checking it for being crazy, and outputting the // yes or no. // // Return: // return of 0 to indicate no errors, int main() { int t; std::cout << "Number of inputs to check: " << std::flush; std::cin >> t; while (t-- > 0) { long long N; std::cout << std::endl << "Next input: " << std::flush; std::cin >> N; std::cout << std::endl << (crazy(N)?"Yes":"No") << std::endl; } return 0; }

crazy ch