90 help
查看原帖
90 help
1398122
Gerianl楼主2024/9/26 20:38
#include<stdio.h>
#include<math.h>
int isPrime(int s){
    int j;
    if(s<2) return 0;
    if(s==2||s==3||s==5||s==7) return 1;
	if(s%2==0) return 0; 
    for(j=3;j<=sqrt(s);j+=2){ 
	    if(s%j==0) return 0;
    }
    return 1;
}
int Fan(int i){
	int fan=0;
	while(i>0){
		fan=fan*10+i%10;
		i/=10;
	}
	return fan;
}
void judge(int n,int m){
	int i,ii,first=1,count=0;
	for(i=n;i<=m;i++){
		if(isPrime(i)){
			ii=Fan(i);
			if(isPrime(ii)){
				count++;
				if(!first){
					printf(",");
				} 
				printf("%d",i);
				first=0;
			} 
		}
	}
	if(count==0){
		printf("no\n");
	}
}
int main(){
	long long n,m;
	scanf("%lld %lld",&n,&m);
	judge(n,m);
	return 0;
}

2024/9/26 20:38
加载中...