#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define run ios_base::sync_with_stdio(false);cin.tie(0);
#define ll int
#define pll pair<ll, ll>
#define ull unsigned ll
#define ld double
#define endl "\n"
#define pb push_back
#define fi first
#define se second
#define pi acos(-1)
#define N 100007
#define minimum -9223372036854775807
#define maximum -minimum
#define mod 1000000007
using namespace std;
using namespace __gnu_pbds;
template <class t>
using ordered_set=tree<t, null_type,less_equal<t>, rb_tree_tag,tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ll gcd(ll a, ll b)
{
if(b==0)
return a;
return gcd(b, a%b);
}
ll lcm(ll a, ll b)
{
return a/gcd(a, b)*b;
}
bool isprime(ll n)
{
if(n==1)
return 0;
for(ll i=2; i*i<=n; i++)
{
if(n%i==0)
return 0;
}
return 1;
}
ll binpow(ll a, ll b)
{
a%=mod;
ll res=1;
while(b>0)
{
if(b%2==1)
res=(res*a)%mod;
a=(a*a)%mod;
b/=2;
}
return res;
}
int main()
{
run;
ll a, b;
cin>>a>>b;
ll cvb=0;
for(ll i=a; i<=b; i++)
{
string s=to_string(i);
// cout<<s<<" ";
if(s.length()<=2)
{
if(s.length()==1)
continue;
if(s[0]==s[1])
cvb++;
continue;
}
bool bul=1;
for(ll j=0; j<s.length()-1; j++)
{
string x="";
x+=s[j];
for(ll k=j+1; k<s.length(); k++)
{
x+=s[k];
// cout<<x<<endl;
string revx=x;
reverse(revx.begin(), revx.end());
if(revx==x)
bul=0;
}
}
if(bul)
cvb++;
}
cout<<cvb<<endl;
}
// By Xanlar
Compilation message
numbers.cpp: In function 'int main()':
numbers.cpp:85:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
85 | for(ll j=0; j<s.length()-1; j++)
| ~^~~~~~~~~~~~~
numbers.cpp:89:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
89 | for(ll k=j+1; k<s.length(); k++)
| ~^~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
2 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
4 |
Incorrect |
23 ms |
464 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
504 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
10 |
Correct |
1 ms |
336 KB |
Output is correct |
11 |
Correct |
1 ms |
336 KB |
Output is correct |
12 |
Correct |
1 ms |
504 KB |
Output is correct |
13 |
Correct |
1 ms |
336 KB |
Output is correct |
14 |
Incorrect |
23 ms |
460 KB |
Output isn't correct |
15 |
Incorrect |
21 ms |
504 KB |
Output isn't correct |
16 |
Correct |
2 ms |
336 KB |
Output is correct |
17 |
Correct |
12 ms |
464 KB |
Output is correct |
18 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
19 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
20 |
Incorrect |
23 ms |
336 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1053 ms |
336 KB |
Time limit exceeded |
2 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
3 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
5 |
Execution timed out |
1094 ms |
336 KB |
Time limit exceeded |
6 |
Execution timed out |
1066 ms |
336 KB |
Time limit exceeded |
7 |
Execution timed out |
1066 ms |
336 KB |
Time limit exceeded |
8 |
Correct |
960 ms |
588 KB |
Output is correct |
9 |
Execution timed out |
1033 ms |
336 KB |
Time limit exceeded |
10 |
Execution timed out |
1053 ms |
336 KB |
Time limit exceeded |
11 |
Execution timed out |
1076 ms |
336 KB |
Time limit exceeded |
12 |
Execution timed out |
1046 ms |
336 KB |
Time limit exceeded |
13 |
Execution timed out |
1036 ms |
336 KB |
Time limit exceeded |
14 |
Execution timed out |
1040 ms |
336 KB |
Time limit exceeded |
15 |
Execution timed out |
1030 ms |
336 KB |
Time limit exceeded |
16 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
17 |
Correct |
1 ms |
336 KB |
Output is correct |
18 |
Correct |
1 ms |
336 KB |
Output is correct |
19 |
Correct |
1 ms |
336 KB |
Output is correct |
20 |
Correct |
1 ms |
336 KB |
Output is correct |
21 |
Incorrect |
1 ms |
512 KB |
Output isn't correct |
22 |
Correct |
1 ms |
336 KB |
Output is correct |
23 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
24 |
Correct |
1 ms |
336 KB |
Output is correct |
25 |
Incorrect |
1 ms |
504 KB |
Output isn't correct |
26 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
27 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
28 |
Incorrect |
1 ms |
508 KB |
Output isn't correct |
29 |
Correct |
1 ms |
336 KB |
Output is correct |
30 |
Correct |
1 ms |
336 KB |
Output is correct |
31 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
32 |
Correct |
1 ms |
336 KB |
Output is correct |
33 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
34 |
Correct |
1 ms |
508 KB |
Output is correct |
35 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
36 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
37 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
38 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
39 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
40 |
Correct |
1 ms |
336 KB |
Output is correct |
41 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
42 |
Correct |
1 ms |
504 KB |
Output is correct |
43 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |
44 |
Incorrect |
1 ms |
504 KB |
Output isn't correct |
45 |
Incorrect |
1 ms |
336 KB |
Output isn't correct |