Codeforces Round #785 (Div. 2)

#include<bits/stdc++.h>
using namespace std;
#define lowbit(x) x&(-x)
#define ll long long
const int maxn=5e4+5; 
void solve();
int main(){
	int T;cin>>T;
	while(T--)solve();
     return 0;
}
void solve(){
	string s;
	cin>>s;
	ll sum=0,len=s.size();
	for(int i=0;i<len;i++)
	sum+=(s[i]-'a'+1);
	if(!(len&1))
		cout<<"Alice "<<sum<<endl;
	else {
		int minn=min(s[0]-'a',s[len-1]-'a')+1;
		//cout<<"minn="<<minn<<endl;
		if(minn>sum-minn)
			cout<<"Bob "<<minn<<endl;
		else cout<<"Alice "<<sum-2*minn<<endl;
	}
}

#include<bits/stdc++.h>
using namespace std;
#define lowbit(x) x&(-x)
#define ll long long
int T;
map<char,int>mp;
void solve();
int main(){
	cin>>T;
	while(T--)solve();
     return 0;
}
void solve(){
	string s;
	cin>>s;
	int len=s.size(),tot=0;
	mp.clear();
	for(int i=0;i<len;i++)
	if(!mp.count(s[i]))mp[s[i]]=1,tot++;
	tot++;
	mp.clear();
	for(int i=0;i<len;i++){
		if(!mp.count(s[i]))mp[s[i]]=i;
		else {
			if(i-mp[s[i]]+1<tot)
			{
				cout<<"NO"<<endl;
				return ;
			}else mp[s[i]]=i;
		}
	}
	cout<<"YES"<<endl;
}

#include<bits/stdc++.h>
using namespace std;
#define lowbit(x) x&(-x)
#define ll long long
const int maxn=4e4+5;
const int mod=1e9+7;
ll dp[maxn][500];
int a[6],n;
vector<int>Q;
void ck(int);
void calc();
int main(){
	int T;
	cin>>T;
	Q.push_back(0);
	for(int i=1;i<=4e4;i++)
	ck(i);
	calc();
	while(T--){
		scanf("%d",&n);
		int t,L=1,R=Q.size()-1;
		while(L<=R){
			int mid=L+R>>1;
			if(Q[mid]<=n)t=mid,L=mid+1;
			else R=mid-1;
		}
		printf("%lld\n",dp[n][t]);
	}
     return 0;
}
void ck(int now){
	int cnt=0,x=now;
	while(x)a[++cnt]=x%10,x/=10;
	for(int i=1;i<=(cnt/2);i++)
	if(a[cnt-i+1]!=a[i])return;
	Q.push_back(now);
}
void calc(){
	for(int i=1;i<=4e4;i++){
		int pp=1,tt;
		for(int j=1;j<Q.size();j++){
			int to=Q[j];
			if(i>=to&&pp)tt=j;
			else pp=0;
			if(i<to)
				dp[i][j]=dp[i][tt];
			else if(i>to)
			dp[i][j]=(dp[i-to][j]+dp[i][j-1])%mod;
			else dp[i][j]=(dp[i][j-1]+1)%mod;
		}
	}
}