A string is called diverse if it contains consecutive (adjacent) letters of the Latin alphabet and each letter occurs exactly once. For example, the following strings are diverse: “fced”, “xyz”, “r” and “dabcef”. The following string are not diverse: “az”, “aa”, “bad” and “babc”. Note that the letters ‘a’ and ‘z’ are not adjacent.
Formally, consider positions of all letters in the string in the alphabet. These positions should form contiguous segment, i.e. they should come one by one without any gaps.
You are given a sequence of strings. For each string, if it is diverse, print “Yes”. Otherwise, print “No”.
Input
The first line contains integer n (1≤n≤100), denoting the number of strings to process. The following n lines contains strings, one string per line. Each string contains only lowercase Latin letters, its length is between 1 and 100, inclusive.
Output
Print n lines, one line per a string in the input. The line should contain “Yes” if the corresponding string is diverse and “No” if the corresponding string is not diverse. You can print each letter in any case (upper or lower). For example, “YeS”, “no” and “yES” are all acceptable.
Example
Input
8
fced
xyz
r
dabcef
az
aa
bad
babc
Output
Yes
Yes
Yes
Yes
No
No
No
No
代码：
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<stack>
#include<queue>
#include<vector>
#include<set>
#include<map>
#define ll long long
#define mes(x,y) memset(x,y,sizeof(x))
using namespace std;
int main(){
int n;
while(cin>>n){
while(n--){
int flag=0;
string s;
cin>>s;
set<char>q;
set<char>::iterator it;
map<char,long>p;
vector<char>v;
char cc,c;
q.clear();
for(int i=0;i<s.length();i++){
q.insert(s[i]);
v.push_back(s[i]);
p[s[i]]++;
}
sort(v.begin(),v.end());
char xx=v[0];
int i=0;
for(it=q.begin();it!=q.end();it++,i++){
if(*it!=xx+i){
flag=1;
break;
}
}
for(int i=0;i<s.size();i++){
if(p[s[i]]>1){
flag=1;
break;
}
}
if(flag==0)cout<<"Yes"<<endl;
else cout<<"No"<<endl;
}
}
return 0;
}