Submission #930504

#	Time	Username	Problem	Language	Result	Execution time	Memory
930504		magagam	Palindrome-Free Numbers (BOI13_numbers)	C++17	12.50 / 100	1098 ms	604 KiB

numbers

//#pragma optimize ("g",on)
//#pragma GCC optimize ("inline")
//#pragma GCC optimize ("Ofast")
//#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize ("03")
//#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
//#pragma comment(linker, "/stack:200000000")
#include <bits/stdc++.h>
#define npe next_permutation
#define int long long
#define pb push_back
#define pf push_front
#define ppb pop_back()
#define ppf pop_front()
#define len(x) (int)x.size()
#define vi vector<int>
#define vpii vector<pair<int,int>>
#define vvi vector<vi>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define itn int
#define fro for
#define lb(s,x) (lower_bound(all(s),x))-s.begin())
#define ub(s,x) (upper_bound(all(s),x)-s.begin())
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
const int maxn=2e5+5,mod=1e9+7,inf=1e18,bir=1ll,nol=0ll;
/*
20.02.2024
TUESDAY
Taak zdes nado recursiu
*/
void at(bool ok){if(ok) cout<<"YES\n";else cout<<"NO\n";}
bool bit(int mask,int i){if((1<<i)&mask)return 1;return 0;}
int gcd(int a,int b){while(b){if(a>b) swap(a,b);b%=a;}return a;}
int lcm(int a,int b){return a*b/gcd(a,b);}
int binpow(int a,int b){
	a%=mod;
	if(b==0) return 1;
	if(b&1){
		return binpow(a,b-1)*a%mod;
	}
	int x=binpow(a,b>>1);
	return x*x%mod;
}
int x,y;
bool f(int x){
	string s=to_string(x);
	set<char> st;
	for(auto it:s){
		st.insert(it);
	}
	return (len(st)==len(s));
}
void solve(){
	cin>>x>>y;
	int ans=0;
	for(int i=x;i<=y;i++) ans+=f(i);
	cout<<ans<<'\n';
}
signed main(){
//	freopen("A.in","r",stdin),freopen("A.out","w",stdout);
	ios_base::sync_with_stdio(0);cin.tie(0);
	int T=1;
//	cin>>T;
	for(int i=1;i<=T;i++){
//		cout<<"Case #"<<i<<": ";
		solve();
	}
}
//(a/b)%mod=(a*(b^(mod-2)))%mod;
//(a+1)*(2*a+1)/6
//upper_bound(x) first element that is greater than
//lower_bound(x) first element that is greater or equal to x

• Subtask 1: 12.5 / 25
• Subtask 2: 0 / 75