![](data:image/svg+xml;utf8,<svg xmlns="http://www.w3.org/2000/svg" xmlns:xlink="http://www.w3.org/1999/xlink" viewBox="0 0 72 71" width="72"></svg>)
Print out all the "Narcissus numbers". The so-called "narcissus number" refers to a 3-digit number whose cube sum of each digit is equal to the number itself. For example, 153 is a number
First, decompose the hundred, ten and individual digits of three digits, and finally calculate whether the sum of each digit cube is equal to the number itself. If the condition is satisfied, output the number. If the condition is not satisfied, continue to cycle until the end of the program
one
#include
void main()
{
int i,j,k,n=100;
while(n
RELATED INFORMATIONS
- 1. Programming output within 1000 of all the narcissus number, the so-called narcissus number refers to a 3-digit number, the cube sum of its digits is equal to itself
- 2. C language programming input a three digit positive integer to judge whether it is "narcissus number". The so-called Narcissus is a three digit number whose sub cube sum is equal to itself
- 3. The so-called "narcissus number" refers to a three digit number whose cubic sum of each digit is equal to the number itself Program analysis: use for loop to control 100-999 numbers, and each number is decomposed into 10 bits, Number of daffodils in 100 places: 153 = 13 + 53 + 33
- 4. For any positive integer n, what is the greatest common divisor of all numbers in the form of "the 3rd power of N + 3 times of n square + 2 times of n"
- 5. The 17th power of 2 + the 12th power of 17 * 2 + the nth power of 2 is a complete square number. Find all positive integer values of n
- 6. For any positive integer n, what is the greatest common divisor of all numbers in the form of "the third power of N + 3 times of n square + 2 times of n"
- 7. There are several positive integers n that make 3 ^ n + 81 a complete square number
- 8. (3 ^ n + 81) is a complete square number. How many positive integers are there?
- 9. A positive integer a is exactly equal to the square of another number B, then a is called a complete square number. For example, 36 = 6, 36 is a complete square number If M = (2008 times 2009) + (3 times 2010) - 3, we prove that M is a complete square ...
- 10. a. B is a positive integer no more than 20. If B of a is equal to 1 of 18, find the numbers represented by a and B
- 11. 1. Output all the Narcissus numbers. The so-called narcissus number refers to a 3-digit number whose cubic sum of each digit is equal to the number itself. For example, 153 = 1 * 1 * 1 + 5 * 5 * 5 + 3*
- 12. "Narcissus number" refers to a three digit number whose cubic sum is exactly equal to the number itself, such as: 153 = 1 ^ 3 + 3 ^ 3 + 5 ^ 3. Please design an algorithm to find a "narcissus number" within 100
- 13. VFP programming problem: daffodil number, that is, a three digit number, to you on the number of cubes and equal to itself. Such as 153 = 1 ^ 3 + 5 ^ 3 + 3 ^ 3 Find the narcissus number, that is, a three digit number, and the sum of the cubes of the numbers on you is equal to itself. For example, 153 = 1 ^ 3 + 5 ^ 3 + 3 ^ 3
- 14. (1 / 2) VB programming, if a three digit integer is equal to the cube sum of its digits, then this number is called narcissus number, such as 153 = 1 ^ 3 + 5 (1 / 2) VB programming, if a three digit integer is equal to the cube sum of its digits, then this number is called narcissus number, such as 153 = 1 ^ 3 + 5 ^ 3 + 3 ^ 3, try programming, find out the number
- 15. (- A ^ 3) ^ 3 is equal to (power)
- 16. The third power of X + the third power of X=
- 17. When is the second-third power of (x-1) + the third-half power of (x + 1) - (x-1) meaningful Clear, problem solving process
- 18. One part of X is equal to several powers of X And what's the - 2 power of X
- 19. 14 (a ^ 2 + B ^ 2 + C ^ 2) = (a + 2B + 3C) ^ 2, and a = 1, the value of B and C
- 20. a: B: C = 4:3:2, and a + 2b-3c = 12, find the value of C ditto