100以内的素数

#include<stdio.h>
//输出100之内的所有素数
int main()
{
    int i;
    int j;
    int flag = 1;
    
    for(i = 2;i <= 100;i++)
    {
        for(j = 2;j <= i / 2;j++)
 {
     if(i % j ==0)
     {
         flag = 0;
  break;
     }
 }
     if(flag == 1)
     {
         static k = 0;
         if(k%5 == 0)
         printf("\n");
         printf("%3d",i);
		 k++;
     }
     flag = 1;

    }

    return 0;
}

#include <stdio.h>

int is_prime(int n)		//子函数，判断是否是素数
{
	int count = 0;
	int i = 0;
	
	for (i = 1; i <= n; i++)
	{
		if (0 == n % i)
		{
			count++;
		}
	}
	if (2 == count)
	{
		return 1;
	}
	else
	{
		return 0;
	}
}

int main()
{
	int i = 0;
	int count = 0;

	for (i = 1; i <= 100; i++)
	{
		if (is_prime(i))
		{
			printf("%d\n", i);
			count++;
		}
	}
	printf("a total of %d prime numbers less than 100\n", count); 	//打印结果
	
	return 0;
}