Submission #1120774

#	Time	Username	Problem	Language	Result	Execution time	Memory
1120774		OmarAlimammadzade	Palindrome-Free Numbers (BOI13_numbers)	C++17	45.83 / 100	1092 ms	512 KiB

numbers

// author - alimammadzade

#include <bits/stdc++.h>
#define ll long long
using namespace std;

int free1(ll k) {
    string s = to_string(k);
    for (int i = 0; i < (int)s.size() - 1; i++)
        for (int j = i + 1; j < (int)s.size(); j++) {
            string a = s.substr(i, j - i + 1), b = a;
            reverse(b.begin(), b.end());
            if (a == b) return 0;
        }
    return 1;
}
int free2(int k) {
    string s = to_string(k);
    for (int i = 0; i < (int)s.size() - 1; i++)
        for (int j = i + 1; j < (int)s.size(); j++) {
            string a = s.substr(i, j - i + 1), b = a;
            reverse(b.begin(), b.end());
            if (a == b) return 0;
        }
    return 1;
}

signed main() {
    cin.tie(nullptr)->sync_with_stdio(false);
    // system("cls"), freopen("in.txt", "r", stdin);
    int a, b, res = 0;
    cin >> a >> b;
    if (b - a <= 1e5)
        for (int i = a; i <= b; i++) res += free1(i);
    else
        for (int i = a; i <= b; i++) res += free2(i);
    cout << res;
}

• Subtask 1: 22.5 / 25
• Subtask 2: 23.333333333333332 / 75