제출 #448491

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
448491		Khizri	Palindrome-Free Numbers (BOI13_numbers)	C++17	65 / 100	1095 ms	304 KiB

numbers

#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;
		}
		if(q){
			ans++;
		}
		if(i>=100&&i+10<=b){
			int x=(i/10)%10,y=(i/100)%10;
			if(x==y){
				ans+=9;
			}
			else{
				ans+=8;
			}
			i+=9;
		}
	}
	cout<<ans<<endl;
}
int main(){
	IOS;
	//cin>>t;
	while(t--){
		solve();
	}
	return 0;
}

• Subtask 1: 25 / 25
• Subtask 2: 40 / 75