#include <bits/stdc++.h>
using namespace std;
//------------------------------DEFINE------------------------------
//******************************************************************
#define IOS ios_base::sync_with_stdio(false); cin.tie(0),cout.tie(0)
#define ll long long
#define pb push_back
#define F first
#define S second
#define INF 1e18
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pii pair<int,int>
#define pll pair<ll,ll>
#define OK cout<<"Ok"<<endl;
#define MOD (ll)(1e9+7)
#define endl "\n"
//******************************************************************
//----------------------------FUNCTION------------------------------
//******************************************************************
ll gcd(ll a,ll b){
if(a>b) swap(a,b);
if(a==0) return a+b;
return gcd(b%a,a);
}
ll lcm(ll a,ll b){
return a/gcd(a,b)*b;
}
bool is_prime(ll n){
ll k=sqrt(n);
if(n==2) return true;
if(n<2||n%2==0||k*k==n) return false;
for(int i=3;i<=k;i+=2){
if(n%i==0){
return false;
}
}
return true;
}
//*****************************************************************
//--------------------------MAIN-CODE------------------------------
const int mxn=1e6+5;
ll t=1,A,B,ans,dp[30];
void solve(){
dp[0]=1;
for(int i=1;i<=18;i++){
dp[i]=dp[i-1]*10;
}
cin>>A>>B;
for(ll i=A;i<=B;i++){
bool q=true;;
ll k=i,a=-1,b=-1,say=0;
while(k>0){
int x=k%10;
if(x==a){
q=false;
k=k*dp[say]+(a+1)*dp[say-1];
break;
}
else if(x==b){
q=false;
k=k*dp[say]+a*dp[say-1]+(x+1)*(dp[say-2]);
break;
}
b=a;
a=x;
k/=10;
say++;
}
if(k!=0){
i=k-1;
}
else if(i>=100&&i%10==0&&i+10<=B){
int x=(i/10)%10,y=(i/100)%10;
if(x==y){
ans+=1;
}
else{
ans+=8;
}
i+=9;
}
else if(q){
ans++;
}
}
cout<<ans<<endl;
}
int main(){
IOS;
//cin>>t;
while(t--){
solve();
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
204 KB |
Output is correct |
| 2 |
Correct |
1 ms |
204 KB |
Output is correct |
| 3 |
Correct |
1 ms |
204 KB |
Output is correct |
| 4 |
Correct |
1 ms |
204 KB |
Output is correct |
| 5 |
Correct |
0 ms |
204 KB |
Output is correct |
| 6 |
Correct |
1 ms |
204 KB |
Output is correct |
| 7 |
Correct |
0 ms |
204 KB |
Output is correct |
| 8 |
Correct |
0 ms |
204 KB |
Output is correct |
| 9 |
Correct |
0 ms |
204 KB |
Output is correct |
| 10 |
Correct |
0 ms |
204 KB |
Output is correct |
| 11 |
Correct |
0 ms |
204 KB |
Output is correct |
| 12 |
Correct |
1 ms |
204 KB |
Output is correct |
| 13 |
Correct |
0 ms |
204 KB |
Output is correct |
| 14 |
Correct |
1 ms |
204 KB |
Output is correct |
| 15 |
Correct |
1 ms |
204 KB |
Output is correct |
| 16 |
Correct |
0 ms |
204 KB |
Output is correct |
| 17 |
Correct |
1 ms |
204 KB |
Output is correct |
| 18 |
Correct |
1 ms |
204 KB |
Output is correct |
| 19 |
Correct |
1 ms |
204 KB |
Output is correct |
| 20 |
Correct |
1 ms |
204 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
20 ms |
204 KB |
Output is correct |
| 2 |
Execution timed out |
1091 ms |
204 KB |
Time limit exceeded |
| 3 |
Execution timed out |
1054 ms |
204 KB |
Time limit exceeded |
| 4 |
Execution timed out |
1086 ms |
204 KB |
Time limit exceeded |
| 5 |
Correct |
175 ms |
204 KB |
Output is correct |
| 6 |
Correct |
185 ms |
288 KB |
Output is correct |
| 7 |
Correct |
9 ms |
204 KB |
Output is correct |
| 8 |
Correct |
6 ms |
204 KB |
Output is correct |
| 9 |
Correct |
12 ms |
304 KB |
Output is correct |
| 10 |
Correct |
16 ms |
304 KB |
Output is correct |
| 11 |
Correct |
19 ms |
304 KB |
Output is correct |
| 12 |
Correct |
103 ms |
288 KB |
Output is correct |
| 13 |
Correct |
24 ms |
308 KB |
Output is correct |
| 14 |
Correct |
179 ms |
284 KB |
Output is correct |
| 15 |
Correct |
203 ms |
204 KB |
Output is correct |
| 16 |
Execution timed out |
1058 ms |
204 KB |
Time limit exceeded |
| 17 |
Correct |
0 ms |
204 KB |
Output is correct |
| 18 |
Correct |
0 ms |
204 KB |
Output is correct |
| 19 |
Correct |
0 ms |
204 KB |
Output is correct |
| 20 |
Correct |
0 ms |
204 KB |
Output is correct |
| 21 |
Execution timed out |
1090 ms |
204 KB |
Time limit exceeded |
| 22 |
Correct |
0 ms |
204 KB |
Output is correct |
| 23 |
Execution timed out |
1074 ms |
204 KB |
Time limit exceeded |
| 24 |
Correct |
1 ms |
204 KB |
Output is correct |
| 25 |
Execution timed out |
1083 ms |
204 KB |
Time limit exceeded |
| 26 |
Execution timed out |
1092 ms |
204 KB |
Time limit exceeded |
| 27 |
Execution timed out |
1091 ms |
204 KB |
Time limit exceeded |
| 28 |
Execution timed out |
1057 ms |
204 KB |
Time limit exceeded |
| 29 |
Correct |
1 ms |
204 KB |
Output is correct |
| 30 |
Correct |
0 ms |
204 KB |
Output is correct |
| 31 |
Execution timed out |
1086 ms |
204 KB |
Time limit exceeded |
| 32 |
Correct |
0 ms |
204 KB |
Output is correct |
| 33 |
Execution timed out |
1089 ms |
204 KB |
Time limit exceeded |
| 34 |
Correct |
1 ms |
204 KB |
Output is correct |
| 35 |
Execution timed out |
1085 ms |
204 KB |
Time limit exceeded |
| 36 |
Execution timed out |
1068 ms |
204 KB |
Time limit exceeded |
| 37 |
Execution timed out |
1077 ms |
204 KB |
Time limit exceeded |
| 38 |
Execution timed out |
1096 ms |
204 KB |
Time limit exceeded |
| 39 |
Execution timed out |
1081 ms |
204 KB |
Time limit exceeded |
| 40 |
Correct |
1 ms |
204 KB |
Output is correct |
| 41 |
Execution timed out |
1083 ms |
204 KB |
Time limit exceeded |
| 42 |
Correct |
0 ms |
204 KB |
Output is correct |
| 43 |
Execution timed out |
1072 ms |
204 KB |
Time limit exceeded |
| 44 |
Execution timed out |
1084 ms |
204 KB |
Time limit exceeded |
| 45 |
Execution timed out |
1086 ms |
204 KB |
Time limit exceeded |
