① 代码:
#include <stdio.h>
int isPrime(long n);
int main(int argc, char const *argv[])
{
long num;
scanf("%d", &num);
if (isPrime(num)) printf("%d is a prime number.\n", num);
else printf("%d is NOT a prime number.\n");
return 0;
}
int isPrime(long n)
{
int i;
if (n < 2) return 0;
if (n == 2) return 1;
for (i = 2; i*i <= n;i++)
if (n % i == 0) return 0;
return 1;
}
② 运行:
本回答被网友采纳