# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1120338 | vjudge1 | Palindrome-Free Numbers (BOI13_numbers) | C++17 | 1085 ms | 580 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long
#define pb push_back
#define in insert
#define F first
#define S second
#define vll vector<ll>
#define all(v) v.begin(),v.end()
#define endl '\n'
#define pii pair<ll,ll>
using namespace std;
const ll INF =1e18, mod = 1e9 + 7, N = 1e5 + 5;
void solve(){
ll a,b;
cin >> a >> b;
ll cnt = 0;
for(ll i = a; i <= b; i++){
string s = to_string(i);
bool test = true;
if(s.size() == 2){
if(s[0] != s[1]){
cnt++;
}
continue;
}
if(s.size() ==1){
continue;
}
for(int i = 0; i < s.size() - 1; i++){
string s1 = "";
s1 += s[i];
for(int j = i + 1; j < s.size(); j++){
s1 += s[j];
if(s[j] != s[i]) continue;
string neww = s1;
reverse(neww.begin(),neww.end());
if(neww == s1){
test = false;
break;
}
}
if(!test){
break;
}
}
if(test){
cnt++;
}
}
cout << cnt << endl;
}
int main(){
fast;
solve();
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |