TLE in prime or not code

[prathma_rast]

getting TLE... plsssss help!!!!

include

include

int main()
{
int i,j,t;
long long int a;
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%lld",&a);
j=2;
while(j<=a-1)
{
if(a%j==0)
{
printf("NO\n");
break;
}
j++;
}
if(j==a)
printf("YES\n");
}
getch();
return 0;
}

[daft_wullie]

Please use code tags and give a uniqe reference to the problem (ISPRIME?).

Your approach is very much brute force. There are not many SPOJ problems which can be solved without efficient algorithms. Although I do not work on shorten problems, I think it applies for these problems, too.