Write a C program that reads an integer n and uses an array to efficiently find out the first n prime numbers.

#include
int prime(int n)
{
int i,j,arr[200],count;
for (i=0;i<200;i++)
arr[i]=i+1;
for (i=0;i{
for (j=1,count=0;j<=arr[i];j++){
if (arr[i]%j==0)
++count;
}
if (count==2)
printf("%d\n",arr[i]);
}
}
main()
{
int n;
printf("Enter the number to which prime numbers are to be printed ");
scanf("%d",&n);
prime(n);
}