PLEASE PUT IT IN TEXT FORMAT

C++ CODE FOR

Check for Armstrong 1.) Armstrong number is a n digit number that is equal to the sum of nth power of its digits. For example 0, 1, 153, 370, 371 and 407 are the Armstrong numbers.

Sample Executions:

(i)

1

Armstrong

(ii)

153

Armstrong

(iii)

12

Not Armstrong

------------------------------------------------------------------------

2.)

Algorithm to convert the given amount into minimum count denominations (1, 2, 5, 10, 20, 50, 100, 500, 1000)

Example

input:

528

Output

1 X 500

1 x 20

1 x 5

1 x 2

1 x 1

-------------------------------------------

3.) String exercises

Write a program that takes data a line at a time and reverses the words of the line. For example,

Input: birds and bees

Reversed: bees and birds

The data should have one blank between each pair of words.