#include <stdio.h> //by 菜鸟教程
int main()
{
/* 局部变量定义 */
int i, j;
for (i = 2; i < 100; i++) {
for (j = 2; j <= (i / j); j++)
if (!(i % j)) break; // 如果找到,则不是质数
if (j > (i / j)) printf("%d 是质数\n", i);
}
return 0;
}
Find prime numbers by square (so called temporarily)
Guess you like
Origin blog.csdn.net/weixin_42417585/article/details/105126324
Recommended
Ranking