OJ Board

i m getting wrong answer in this problem.
it seems to work correctly for all inputs including the 15 carmichael numbers in the range specified.
could anyone plz help me?
my code follows:




#include<iostream>
#include<cmath>
using namespace std;
int isprime(long n)
{ int i;
if(n==1||n==2)
return ...