write a function sumDigitCube$()$ that takes a positive integer as a parameter and returns the sum of cube of each digit of the number.

Then in the main function, take an integer n $($n$>=1)$ as input and generate each number from $1$ to n and call the sumDigitCube$()$ function.

Based on the returned result, compare it with the value of the generated number and take a decision and print the number if it is Armstrong number.write a function sumDigitCube$()$ that takes a positive integer as a parameter and returns the sum of cube of each digit of the number.

Then in the main function, take an integer n $($n$>=1)$ as input and generate each number from $1$ to n and call the sumDigitCube$()$ function.

Based on the returned result, compare it with the value of the generated number and take a decision and print the number if it is Armstrong number.write a function sumDigitCube$()$ that takes a positive integer as a parameter and returns the sum of cube of each digit of the number.

Then in the main function, take an integer n $($n$>=1)$ as input and generate each number from $1$ to n and call the sumDigitCube$()$ function.

Based on the returned result, compare it with the value of the generated number and take a decision and print the number if it is Armstrong number.