1 solutions

  • 0
    @ 2025-10-28 21:57:19

    此题用简单的方法过不去

    #include<bits/stdc++.h>
    using namespace std;
    bool z(int n){
    	for(int i=3;i*i<=n;i++){
    		if(n%i==0)return false;
    	}
    	return true;
    }
    int main(){
    	int a,b;
    	cin>>a>>b;
    	if(a<=5&&b>=5)cout<<5<<endl;
    	if(a<=7&&b>=7)cout<<7<<endl;
    	if(a<=11&&b>=11)cout<<11<<endl;
    	for(int i=1;i<=9;i+=2){
    		for(int j=0;j<=9;j++){
    			int n=100*i+10*j+i;
    			if(n<a)continue;
    			if(n>b)return 0;
    			if(z(n))
    				cout<<n<<endl;
    		}
    	}
    	for(int i=1;i<=9;i+=2){
    		for(int j=0;j<=9;j++){
    			for(int k=0;k<=9;k++){
    				int n=10000*i+1000*j+k*100+j*10+i;
    				if(n<a)continue;
    				if(n>b)return 0;
    				if(z(n))
    					cout<<n<<endl;
    			}
    		}
    	}
    	for(int i=1;i<=9;i+=2){
    		for(int j=0;j<=9;j++){
    			for(int k=0;k<=9;k++){
    				for(int m=0;m<=9;m++){
    					int n=1000000*i+100000*j+k*10000+m*1000+k*100+j*10+i;
    					if(n<a)continue;
    					if(n>b)return 0;
    					if(z(n))
    						cout<<n<<endl;
    				}
    			}
    		}
    	}
    	return 0;
    }
    
    
    
    • 1

    【深基7.习5】[USACO1.5] 回文质数 Prime Palindromes

    Information

    ID
    496
    Time
    1000ms
    Memory
    256MiB
    Difficulty
    10
    Tags
    # Submissions
    6
    Accepted
    1
    Uploaded By