88分 #9 TLE求调
查看原帖
88分 #9 TLE求调
545516
Habseligkeit楼主2022/10/23 00:24
#include<bits/stdc++.h>
using namespace std;

int l , r;

bool check1(int x) {
	int a[10] , k = 0;
	memset(a , 0 , sizeof(a));
	while(x) {
		a[++ k] = x % 10;
		x /= 10;
	}
	for(int i = 1; i <= k / 2; i ++)
	  if(a[i] != a[k + 1 - i]) return false;
	return true;
}

bool check2(int x) {
	int k = 0 , xx = x;
	while(xx != 0) {
		k ++;
		xx /= 10;
	}
	if(k % 2 == 0 && k != 11) return false;
	for(int i = 2; i <= (int)sqrt(double(x)); i ++)
	  if(x % i == 0 && x != i) return false;
	return true;
}

void work() {
	for(int i = l; i <= r; i ++) {
		if(!check1(i)) continue;
		if(check2(i)) printf("%d\n" , i);
	}
} 

int main() {
	scanf("%d %d" , &l , &r);
	work();
	return 0;
}
2022/10/23 00:24
加载中...