Why am i getting wrong answer to the below code for PON(prime or not)problem???
include
include
int len;
char s[1000];
int prime[] = {
2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
73, 79, 83, 89, 97, 101, 103, 107, 109, 113,
127, 131, 137, 139, 149, 151, 157, 163, 167, 173,
179, 181, 191, 193, 197, 199, 211, 223, 227, 229,
233, 239, 241, 251, 257, 263, 269, 271, 277, 281,
283, 293, 307, 311, 313, 317, 331, 337, 347, 349,
353, 359, 367, 373, 379, 383, 389, 397, 401, 409,
419, 421, 431, 433, 439, 443, 449, 457, 461, 463,
467, 479, 487, 491, 499, 503, 509, 521, 523, 541,
547, 557, 563, 569, 571, 577, 587, 593, 599, 601,
607, 613, 617, 619, 631, 641, 643, 647, 653, 659,
661, 673, 677, 683, 691, 701, 709, 719, 727, 733,
739, 743, 751, 757, 761, 769, 773, 787, 797, 809,
811, 821, 823, 827, 829, 839, 853, 857, 859, 863,
877, 881, 883, 887, 907, 911, 919, 929, 937, 941,
947, 953, 967, 971, 977, 983, 991, 997, 1009, 1013,
};
int isdiv(long int k)
{
long int l=0;
int j;
for(j=0;j{if(s[j]==',')continue;
l=l*10+(s[j]-'0');
//printf("%d\n",l);
l%=k;
}
l%=k;
return (!l);
}
int num()
{int m=0,l;
for(l=0;lm=m*10 +(s[l]-'0');
return m;
}
int main()
{
int n,k,l=0;
len=0;
scanf("%s",s);
len=strlen(s);
if(len<=4)
{l=1;
n=num();
if(n<=1013)
{
if(n==1)l=0;
for(k=0;k<170 && l;k++)if(prime[k]==n)l=0;
goto ls;
}
}
for(k=0;k<170 && !l;k++)
if(isdiv(prime[k])){l=1;break;}
ls:if(l)printf("COMPOSITE\n"); else printf("PRIME\n");
return 0;
}
