View Code of Problem 120

# include<stdio.h>
# include<math.h>
# include<stdbool.h>
bool isPrime(int n){
	bool flag=true;
	for(int i=2;i<=sqrt(n);i++){
		if(n%i==0){
			flag=false;
			break;
		}
	}
	return flag;
}
int main(){
	int h1,m1,h2,m2,t1,t2,count;
	while(scanf("%d:%d %d:%d",&h1,&m1,&h2,&m2)!=EOF){
		t1=h1*2500+m1;
		t2=h2*2500+m2;
		count=0;
		for(int i=t1;i<=t2;i++){
			if(i==0||i==1){
				continue;
			}
			if(isPrime(i)){
				count++;
			}
		}
		printf("%d",count);
	}
	return 0;
} 

Double click to view unformatted code.


Back to problem 120