# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
977113 | VMaksimoski008 | Palindrome-Free Numbers (BOI13_numbers) | C++17 | 1083 ms | 756 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 sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
//#define int long long
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;
int32_t main() {
ll a, b, ans=0;
cin >> a >> b;
for(ll i=a; i<=b; i++) {
bool ok = 1;
string s = to_string(i);
for(int j=0; j+1<s.size(); j++) {
if(s[j] == s[j+1]) ok = 0;
if(j+2 < s.size() && s[j] == s[j+2]) ok = 0;
}
ans += ok;
}
cout << ans << '\n';
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |