# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1120635 | vjudge1 | Palindrome-Free Numbers (BOI13_numbers) | C++17 | 1092 ms | 508 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.
// Telebe of adicto yani AzeTurk810
/*
Author: AzeTurk810
Licance: open source(only authors name must be in code)
Begin Time:11/20/2024 20:48
Problem link: https://codeforces.com/problemset/problem/1543/D1
*/
#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
const int MAXN = 50005;
bool check(std::string s)
{
std::string sc = s;
reverse(sc.begin(),sc.end());
return sc == s;
}
signed main()
{
std::ios_base::sync_with_stdio(false);std::cin.tie(0);std::cout.tie(0);
int l,r,ans = 0;
scanf("%d%d", &l, &r);
std:: string s,sc,scc;
for(int i=l;i<=r;i++)
{
bool ok = true;
s = std::to_string(i);
sc="";
for(int i = 0;i<s.size()-1;i++)
{
sc = "";
scc = "";
if(s.size() > i )
{scc = scc + s[i] ;scc = scc + s[i +1] ;scc = scc + s[ i + 2];}
sc = sc + s[i] ;
sc = sc + s[ i+ 1];
if(check(sc) || check(scc)){
ok = false;
//cout<<sc<< ' '<<scc<< ' '<<s<<endl;
break;
}
}
if(ok) ans++;
}printf("%d\n", ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |