thanks for quick answr "leppy"
#include<math.h>
#include<stdio.h>
int isPrime(int k);
int j;
int isPrime(int k)
{
for(j=2; j<=(int)sqrt(k); j++)
{
if(k%j==0)
return 0;
}
return 1;
}
int main()
{
int u,i,t,m,n,k;
scanf("%d", &t);
while(t--)
{
scanf("%d %d", &m, &n);
for(i=m;i<=n;i++)
{
u = isPrime(i);
if (u == 1)
printf("%d\n", i);
}
}
return 0;
}
this is code for prime Generator problem. I am getting time limit exceeded .. what should i do ..?? i dun understand how to decrease time.. i think my program is fast enough... where is the problem