- 1. Print graphics
- 2. MadLibs
- 3. Calculator
- 4. Applications
- 5. Numbers
- 6. Conjectures
- 7. StudentMIS
- 8. Tickets System
- 9. Sequence List Basic System
- 10. Sequence List Application System
- 11. Link List Basic System
- 12. Link List Application System
- 13. Complexity of Algorithms
- 14. Queue Application System
- 15. Stack Application System
- 16. Sparse Matrix System
- 17. Triangular Matrix System
- 18. Idioms Solitaire(成语接龙)
- 19. Binary Tree System
- 20. Huffman Tree System
- 21. Graph System
- 22. BitOperation
- 23. BigNumber
- More to be coming...
Projects of C++
C++ Programming and Object-Oriented Design
Project 5. Numbers
Menu
1. Perfect Number(完数)
2. Friendly Number(亲密数)
There are two integers a and b. If the sum of b's divisors equals to a, and the sum of a's divisors equals to b, we call these two integers are "Friendly Numbers".
E.g:
284 and 220
284's divisors: 1+2+4+71+142=220
220's divisors: 1+2+4+5+10+11+20+22+44+55+110=284
So 9 and 4 are not Friendly numbers.
3. Narcissistic Number(水仙花数)
4. Armstrong Number(阿姆斯特朗数)
An Armstrong number is a number that is equal to the sum of digits raise to the power total number of digits in the number.
--The Armstrong numbers of 1 digits are: 1 2 3 4 5 6 7 8 9
--The Armstrong numbers of 2 digits are:
--The Armstrong numbers of 3 digits are: 153 370 371 407
--The Armstrong numbers of 4 digits are: 1634 8208 9474
--The Armstrong numbers of 5 digits are: 54748 92727 93084
--The Armstrong numbers of 6 digits are: 548834
--The Armstrong numbers of 7 digits are: 1741725 4210818 9800817 9926315
--The Armstrong numbers of 8 digits are: 24678050 24678051 88593477
5. Pythagorean Triple(勾股数)
6. Mantissa(高次方数的尾数)
7.Lowest Common Multiple & Greatest Common Divisor(最小公倍数和最大公约数)
Greatest Common Divisor: The largest integer that is an exact divisor of each of two or more integers.
8.Exit
|