用于计算素数和完美数的程序 [英] Program to calculate prime and perfect numbers

问题描述

我是c ++编程的初学者，我坚持使用循环，所以plz帮助我!!!


i需要编写一个分析一个或多个＃的程序（在1和1之间） 1000）由用户输入。然后确定它是素数还是完美数。

我必须在较大的数量级上使用循环。所以PLZ帮助我通过一个简单的程序来解决这个问题!!!!!!!!!!!! TANX

i am a begginer in c++ programming and im stuck at using loops so plz help me!!!

i need to write a program that analyze one or more # (between 1 and 1000) entered by a user. Then determin if it is a prime number or perfect number.
And i have to use the loops at a bigginer level. so plz help me to get through this with a simple program!!!!!!!!!!!!TANX

推荐答案

我们很乐意提供帮助你通过它 - 所以到目前为止你有什么？

We''d be glad to help you through it - so what do you have so far?

好的我有代码找到任何数字的devisor !!!!!我只是无法找到如何编写一个代码显示用户输入的数字是素数？还有如何获得完美数字的因子总和?????? TANX为你提供帮助

到目前为止我有这个基本代码~~ ~~不要笑!!!

ok i have the code for finding the devisor of any number!!!!!i just cant find how to write a code that show the number entered by user is a prime number?and also how to get the sum of factors for perfect number??????TANX FOR YOU HELPS
so far i have this basic code~~~~dont laugh!!!

展开 | 选择 | Wrap | 行号

这是一个提示，你应该尝试使用 mod运算符％" ..

它会给你一位数对于完美的数字评估。

并且素数是重复使用运算符mod的。直到余数不等于零

Heres a hint you should try using the mod operator"%"..
It will give you single digits for perfect number evaluation.
And prime is repeated use of operator "mod" until remainder is not equal to zero

这篇关于用于计算素数和完美数的程序的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！