我知道你是在写判断质数的算法.
我刚刚下C++课,刚就在做这个判断质素的算法的练习.
#include
#include
using namespace std;
bool isPrime(long int n)
{
int i;
double c;
for(i=2;i
short number,n; bool prime; cin>>number; for(n=2;n
1个回答
相关问题
-
natual number,counting number,whole number,even number,odd n
-
c++编程T-primes number
-
the number of different prime factors of 48.和the number of d
-
For an arbitrary natural number n,we add 121to it when it is
-
if 3 times a less than a number n is the same as the number
-
英语翻译for each case there is a postive number n on base ten,te
-
Are more prime numbers even or odd?why
-
Express the following numbers as products of their prime
-
If3morethan n is a negative number and if5 more than n is a
-
A number decreased by the difference between eight and the n