View Code of Problem 120

#include<stdio.h>
#include<math.h>
int su(int n)
{
	long i;
for(i=2;i<=sqrt(n);i++)
if(n%i==0)
{return 1;
break;
}
return 0;
}


int main()
{
	int i,j,n,m,n1,m1,count=0;int d=0;
while(scanf("%2d:%2d\n%2d:%2d",&n,&m,&n1,&m1)!=EOF)
{  if(n>=0&&n<=23&&n1>=0&&n1<=23&&m>=0&&m<=59&&m1>=0&&m1<=59)
{for(i=n;i<=n1;i++)
	{
	for(j=m;j<=m1;j++)
	{
	d=i*2500+j;
	if(!su(d))
	++count;
	}
	
	}
	printf("%d\n",count);
	d=0;count=0;}
}
return 0;
}