An integer number is said to be a perfect number if its factors, including 1 (but not the number itself), sum to the number. For example, 6 is a perfect number because 6 = 1 + 2 + 3. Write a C program perfect that determines if parameter number is a perfect number and determines and prints all the perfect numbers between 1 and 1000. Print the factors of each perfect number to confirm that the number is indeed perfect. Challenge the power of your computer by testing numbers much larger than 1000.
I need c++ code this problem...?
Ha enjoy the VB solution to your problem. I leave the conversion to C++ to you.
Function factor(byval num as interger) as boolean
dim sum_of_factors as interger=0
For i as interger =num-1 to 0 step -1
if num mod i = 0 then
sum_of_factors+=i
end if
next
if sum_of_factors=num then
return True
else
return False
end if
end Function
Reply:123
cosmos
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment