How do you write a 100 to 200 prime number program in C?

There should be a condition:

main()

int i,k;

for (i=1;i<200;i++)

for(k=2;kif(i%k==0)

break;

if (i==k) is the prime number that satisfies this condition, and then outputs.

printf("%d",i);

Prime numbers are only divisible by 1 and itself, and your program is wrong.

Well, I agree with s h w's answer! In fact, the ideas of the above two answers are correct, but TG's answer ignores the details. The same is the case with the if statement, but the difference is between if(i==k+1) and if(i==k).

tg's consideration is correct, and a prime number is a number that is only divisible by 1 and itself. But he didn't consider that if i==k, wouldn't it conflict with the previous statement if(i%k==0)? This will not produce results at all.

Obviously, S h w has this in mind.

Problem solving ideas: first find out all the integers within 100 200, and then let these integers remainder for numbers other than 1 and itself, if there is a divisible number, it is not a prime number, otherwise it is a prime number.

Start by finding all the integers from 100 to 200, all of which are i

Use i to find the remainder of a number other than 1 and itself.

Correct**:

#include

int main()

int conut = 0;

int i = 0;

for(i=100; i<=200; i++)int j = 0;

for(j=2; jif(i%j == 0)break;

if(j==i)

conut++;

printf("%d ", i);

printf("");

printf("The number of primes is: %d", conut);

return 0;

The judgment condition of the second if statement should be j==i; Instead of i%j.

Error reason: After the end of the loop, s is not reset to 1, so the first non-prime number after the second prime is judged is no longer output.

Here are some examples: <>

Direct compilation, the program output result is shown in the following figure: