알고리즘문제들/알고리즘문제풀이전략_문제
챕터10_섹션6_소수 구하기
Beabletoet
2017. 5. 19. 14:56
#include <stdio.h>
int main()
{
for (int i = 2, bool_sosu = 0, count = 0; i < 1001; ++i, bool_sosu = 0)
{
for (int j = i - 1; j > 1; --j)
if (i % j == 0)
{
bool_sosu = 1;
break;
}
if (bool_sosu == 0)
{
printf("%d\t", i);
++count;
if (count % 8 == 0)
printf("\n");
}
}
}