#include <stdio.h>
 
void main() {
	int n, i, prime, count = 0, num = 2;
 
	printf("Enter the number of prime numbers required\n");
	scanf("%d", &n);
 
	while (count != n) // while count!= number of prime numbers entered keep searching..
	{
		prime = 1; // to determine whether the number is prime or not
		for (int i = 2; i <= num / 2; i++) //efficiency matters
		{
			if (num % i == 0)
			{
				prime = 0; // if number divides any other number its not a prime so set prime to false and break the loop.
				break;
			}
 
		}
		if (prime)
		{
			count++;
			printf("%d\n",num);
		}
		num++; // see if next number is prime or not.
 
	}
 
 
}

I2luY2x1ZGUgPHN0ZGlvLmg+Cgp2b2lkIG1haW4oKSB7CglpbnQgbiwgaSwgcHJpbWUsIGNvdW50ID0gMCwgbnVtID0gMjsKCQoJcHJpbnRmKCJFbnRlciB0aGUgbnVtYmVyIG9mIHByaW1lIG51bWJlcnMgcmVxdWlyZWRcbiIpOwoJc2NhbmYoIiVkIiwgJm4pOwoKCXdoaWxlIChjb3VudCAhPSBuKSAvLyB3aGlsZSBjb3VudCE9IG51bWJlciBvZiBwcmltZSBudW1iZXJzIGVudGVyZWQga2VlcCBzZWFyY2hpbmcuLgoJewoJCXByaW1lID0gMTsgLy8gdG8gZGV0ZXJtaW5lIHdoZXRoZXIgdGhlIG51bWJlciBpcyBwcmltZSBvciBub3QKCQlmb3IgKGludCBpID0gMjsgaSA8PSBudW0gLyAyOyBpKyspIC8vZWZmaWNpZW5jeSBtYXR0ZXJzCgkJewoJCQlpZiAobnVtICUgaSA9PSAwKQoJCQl7CgkJCQlwcmltZSA9IDA7IC8vIGlmIG51bWJlciBkaXZpZGVzIGFueSBvdGhlciBudW1iZXIgaXRzIG5vdCBhIHByaW1lIHNvIHNldCBwcmltZSB0byBmYWxzZSBhbmQgYnJlYWsgdGhlIGxvb3AuCgkJCQlicmVhazsKCQkJfQoKCQl9CgkJaWYgKHByaW1lKQoJCXsKCQkJY291bnQrKzsKCQkJcHJpbnRmKCIlZFxuIixudW0pOwoJCX0KCQludW0rKzsgLy8gc2VlIGlmIG5leHQgbnVtYmVyIGlzIHByaW1lIG9yIG5vdC4KCgl9CgoJCn0=

NQ==

5