#include <stdio.h>
#include <math.h>
int isPrime(int n)
{
if (n <= 1) return 0;
if (n % 2 == 0) return n == 2;
int m = sqrt(n);
for (int i = 3; i <= m; i += 2)
if (n % i == 0) return 0;
return 1;
}
int main()
{
int a = 1, b = 100, cnt = 0;;
for (int i = a; i <= b; i++)
{
if (isPrime(i))
{
if (cnt && cnt % 5 == 0)
printf("\n");
printf("%d ", i);
cnt++;
}
}
printf("\n");
return 0;
}
![](https://video.ask-data.xyz/img.php?b=https://iknow-pic.cdn.bcebos.com/5bafa40f4bfbfbed8254bfed76f0f736afc31f16?x-bce-process=image%2Fresize%2Cm_lfit%2Cw_600%2Ch_800%2Climit_1%2Fquality%2Cq_85%2Fformat%2Cf_auto)