OJ Board

i can't get yours points. yours progremm and mine are both ok, i can run them on my computer.

int ifprime(int n) /*justify whether it is a prime*/
{int j;
for(j=2;j<n;j++)
{if (n%j!=0) continue;
else return (0);}
if(n==j)
return (1);
}

int creat_num(int n)
{int m;
m=n*n + n + 41;
return ...

int ifprime(int n)
{int j;
for(j=2;j<n;j++)
{if (n%j!=0) continue;
else return (0);}
if(n==j)
return (1);
}

int creat_num(int n)
{int m;
m=n*n + n + 41;
return m;
}

main()
{int a,b,i;
float pre,sum;
int re=0;
clrscr();
scanf("%d %d",&a,&b);
for(i=a;i<=b;i++)
re=re+ifprime(creat_num(i));
sum=(float ...

i don't konw how to submit that,so i paste it hehe

int ifprime(int n)
{int j;
for(j=2;j<n;j++)
{if (n%j!=0) continue;
else return (0);}
if(n==j)
return (1);
}

int creat_num(int n)
{int m;
m=n*n + n + 41;
return m;
}

main()
{int a,b,i;
float pre,sum;
int re=0;
clrscr();
scanf("%d %d",&a,&b);
for(i=a;i<=b;i++)
re=re+ifprime(creat_num(i));
sum=(float ...