# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
493472 | goodluck2020 | Palindrome-Free Numbers (BOI13_numbers) | C++14 | 67 ms | 288 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 task "numbers"
#define sz(X) ((int)X.size())
using namespace std;
long long L, R;
struct
{
bool PalinFree(long long k)
{
string S;
stringstream ss;
ss << k;
ss >> S;
for(int i = 1; i < sz(S); i++)
{
if(S[i] == S[i-1]) return 0;
if(i > 1 && S[i] == S[i-2]) return 0;
}
return 1;
}
void solve()
{
int ans = 0;
for(long long i = L; i <= R; i++)
if(PalinFree(i)) ans++;
cout << ans;
}
} sub1;
int main()
{
if(fopen(task ".inp","r"))
{
freopen(task ".inp","r",stdin);
freopen(task ".out","w",stdout);
}
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> L >> R;
if(R - L <= 1e5) sub1.solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |