C Exercise Example 12
100 cases of classic C language
Title: Analyzing the prime numbers between 101-200.
Program Analysis: Analyzing primes methods: a number were removed from 2 to sqrt (this number), if divisible, indicates that this number is not a prime number, and vice versa is a prime number.
// Created by www.w3big.com on 15/11/9.
// Copyright © 2015年 本教程. All rights reserved.
//
#include <stdio.h>
int main()
{
int i,j;
int count=0;
for (i=101; i<=200; i++)
{
for (j=2; j<i; j++)
{
// 如果j能被i整出在跳出循环
if (i%j==0)
break;
}
// 判断循环是否提前跳出，如果j<i说明在2~j之间,i有可整出的数
if (j>=i)
{
count++;
printf("%d ",i);
// 换行，用count计数，每五个数换行
if (count % 5 == 0)
printf("\n");
}
}
return 0;
}
The above example output is:
101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199