제출 #1120377

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1120377		vjudge1	Palindrome-Free Numbers (BOI13_numbers)	C++11	33.33 / 100	1081 ms	512 KiB

numbers

#include <bits/stdc++.h>
#define GOOD_LUCK ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define int long long
#define itn int
#define Int int
#define INF -1000000
#define MOD 1000000007
#define endl "\n"
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
using namespace std;

int temp;

vector <vector<int>> dp;

bool pnd(string a) {
	string b = a;
	reverse(a.begin(), a.end());
	return (a == b);
}

bool sub_pnd(string a, int x, int y) {
	int k=0, m = (x + y - 1) / 2;
	while (k <= m - x) {
		if (a[x+k] != a[y -k]) return false;
		k++;
	}
	return true;
}

bool check(int n) {
	string a = to_string(n);
	int x = a.size();
	for (int i=0; i < x-1; i++) {
		for (int j=i+1; j < x; j++) {
			if (sub_pnd(a, i, j)) return false;
		}
	}
	return true;
}

signed main() {
	
	GOOD_LUCK
	
    int t;
	t = 1;
//	cin >> t;
    while (t--) {
    	int a, b;
    	cin >> a >> b;
    	int cnt=0;
    	for (int i=a; i <= b; i++) {
    		if (check(i)) cnt++;
		}
		cout << cnt;
	}

    return 0;
}
// Problem C
// by Ekber_Ekber

• Subtask 1: 25 / 25
• Subtask 2: 8.333333333333334 / 75