can any one pls tell me what is wrong with my code i m continously getting wa.pls help
here is the ling to my code
You are not considering the numbers which are prime or composed of prime greater than thousand like 1013… what about them? Include them in the processing also.
One option is to store the primes in the P[i] array…
Other one is using the same array check whether its prime or not… or has a prime greater than 1000 in it like 3039.To achieve this merge functions calculate and factors such that if count%p[i]==0 is there then it will find the maximum power of p[i] in count then and there.in the last if count!=1 the remaining part will be the prime >1000.
Everything else is good with the code… 