label
stringlengths 1
2
| index
stringlengths 1
5
| code
stringlengths 87
8.24k
|
---|---|---|
37
|
18400
|
/*
* ????first.cpp
* ???00948343_??
* ?????2012/9/16
* ?????1???100?????????
*/
int main(){
int length, t=0, i, j, k, flag=0, count;
cin >> t;
char a[100000];
for (i=0;i<t;i++){
cin >> a;
length = strlen(a);
flag=0, count=0;
for (j=0;j<length;j++){
count=0;
if (a[j]!='0'){
for (k=j+1;k<length;k++){
if (a[j]==a[k]){
a[k]='0';
count++;
}
}
if (k==length&&count==0){
cout << a[j] << endl;
flag=1;
break;
}
}
}
if (flag==0)
cout << "no" << endl;
}
return 0;
}
|
37
|
18401
|
int main()
{
char **p,*j,*k;
int t,i,flag=0;
scanf("%d",&t);
p = (char **)malloc(t*sizeof(char*));
for (i=0;i<=t;i++){
*(p+i) = (char *)malloc(10000*sizeof(char));
gets(*(p+i));
}
for (i=1;i<=t;i++){
for(j=*(p+i);*j!='\0';j++){
for (k=j+1;*k!='\0';k++){
if (*k==*j){
*k='0';
flag=1;
}
}
if (flag==1) *j='0';
flag = 0;
}
}
for (i=1;i<=t;i++){
for (j=*(p+i);*j!='\0';j++){
if (*j!='0'){
printf("%c\n",*j);
break;
}
}
if (*j=='\0') printf("no\n");
}
}
|
37
|
18402
|
int main()
{
char word[100000],l[1];
char y[10000];
int n=0,q,i=0,j=0,k=0,fei=0,x;
cin>>n;
// cin.getline(l,1);
for(q=0;q<n;q++)
{
cin>>word;
// cin.getline(word,100000);
x=strlen(word);
for(j=0;j<x;j++)
{
fei=0;
for(k=0;k<x;k++)
{
if(word[j]==word[k])
{
fei++;
}
}
if(fei==1)
{
y[q]=word[j];
//cout<<word[j]<<endl;
break;
}
//else cout<<"no"<<endl;
}
if(fei!=1) y[q]=96;//cout<<"no"<<endl;
}
for(q=0;q<n;q++)
{
if(y[q]==96) cout<<"no"<<endl;
else cout<<y[q]<<endl;
}
return 0;
}
|
37
|
18403
|
void search()
{
char s[100];
int i,j,k=0;
gets(s);
for(i=0;i<strlen(s);i++)
{
k=0;
for(j=0;j<strlen(s);j++)
if(s[i]==s[j]) k++;
if(k==1) break;
}
if(k>1) printf("no\n");
else
printf("%c\n",s[i]);
}
int main()
{
int n;
scanf("%d",&n);
getchar();
while(n>0)
{
search();
n--;
}
return 0;
}
|
37
|
18404
|
/**
* @file 1000012853_2
* @author 1000012853 ??
* @date 2010?11?19
* @desc ????????????
*/
int main()
{
int n, i, j, m, len, count[26];
char a[100000];
cin >> n;
cin.get(); //????\n
for(m = 1; m <= n; m ++)
{
memset(count,0,sizeof(count)); //count?0
//memset(a,0,sizeof(a)); //a?0
cin.getline(a,100000);
len = strlen(a); //a???
for(i = 0; i < len; i ++)
{
count[a[i] - 'a'] ++; //???????????
}
for(j = 0; j < len; j ++)
{
if (count[a[j] - 'a'] == 1) //?????????????????
{
cout << a[j] << endl;
break;
}
}
if(j == len) //?????????no
cout << "no" << endl;
}
return 0;
}
|
37
|
18405
|
/**
* @file ?????????????
* @author ???
* @date 11-17
* @description ??????????
*/
int main()
{
int n, a[27] = {0},b[27] = {0}, i, j, k , len, flag, m ;
char ch[100001],c;
cin >> n;
cin.get();
for (i = 1; i <= n; i ++)
{
cin.getline(ch,100001);
len = strlen(ch) ;
k = 0;
flag = 1;
for (j= 0; j <= 26; j ++) {a[j] = 0; b[j] = 0;}
for (j = 0; j < len; j ++)
{
m = ch[j] - 96 ;
a[m] ++;
if (a[m] == 1) { k ++;b[k] = m;}
}
for (j = 1; j <= k; j ++)
{
if (a[b[j]] == 1)
{
c = 'a' +b[j] -1;
cout << c << endl;
flag = 0;
break;
}
}
if (flag == 1) cout << "no" << endl ;
}
return 0;
}
|
37
|
18406
|
int main()
{
int t,i,j,k,flag;
char a[100000];
cin>>t;
for(i=0;i<=t;i++)
{
cin.getline(a,100000);
int len=strlen(a);
for(j=0;j<len;j++)
{
flag=1;
for(k=0;k<len;k++)
if(a[j]==a[k]&&k!=j)
{
flag=0;
break;
}
if(flag==1)
{
cout<<a[j]<<endl;
break;
}
if(flag==0)
continue;
}
if(flag==0)
cout<<"no"<<endl;
}
return 0;
}
|
37
|
18407
|
int main()
{
int n;
cin >> n;
cin.get();
int i=0;
while(i<n)
{
i++;
char a[100001];
cin.getline(a,100001);
int j,k,l;
l=strlen(a);
const int l1=l;
int b[l1];
for(j=0;j<l;j++)
{
b[j]=0;
}
for(j=0;j<l;j++)
{
for(k=0;k<l;k++)
{
if(a[j]==a[k])
{
b[j]++;
}
}
}
int t=0;
for(j=0;j<l;j++)
{
if(b[j]==1)
{
cout << a[j] << endl;
t++;
break;
}
}
if(t==0)
{
cout << "no" << endl;
}
}
cin.get();cin.get();cin.get();
return 0;
}
|
37
|
18408
|
main()
{
int t,i,j,k,m;
char s[100005];
scanf("%d",&t);
for(k=1;k<=t;k++)
{
scanf("%s",s); for(i=0;s[i]!='\0';i++) m=i;
for(i=0;i<=m;i++)
{
for(j=0;j<=m;j++)
{
if(j==i) continue;
if(s[j]==s[i]) break;
}
if(j==m+1)
{
printf("%c\n",s[i]);
break;
}
}
if(i==m+1)
printf("no\n");
}
}
|
37
|
18409
|
main()
{
int a[26],n,i,I,j,p,k;
char s[100000],first=124;
scanf("%d",&n);
for (I=1;I<=n;I++)
{
first=124;
for (j=0;j<=25;j++)
a[j]=0;
scanf("%s",s);
for (j=0;j<strlen(s);j++)
{
a[s[j]-97]++;
if ((a[s[j]-97]==1)&&(first==124))
{
p=0;
for (k=j+1;k<strlen(s);k++)
if (s[k]==s[j]) p=1;
if (p==0)
first=s[j];
}
}
p=0;
for (i=0;i<=25;i++)
if (a[i]==1)
p=1;
if (p==0)
printf("no\n");
else
printf("%c\n",first);
}
}
|
37
|
18410
|
int main()
{
char str[100001];
int i, j, t, k, flag;
cin >> t;
for (k = 1; k <= t; k++)
{
cin >> str;
int l = strlen(str);
for (i = 0; i < l; i++)
{
flag = 0;
for (j = 0; j < l; j++)
{
if (j != i)
{if (str[j] == str[i])
{
flag = 1;
}
}}
if (flag == 0)
{
cout << str[i] << endl;
break;
}
}
if (flag == 1) cout << "no" << endl;
}
return 0;
}
|
37
|
18411
|
int main()
{
char str[100][10010];
int num[26];
int len , cnt , i , j , k ,t;
cin >> t;
for(i = 0 ; i < t ; i++)
cin >> str[i];
for(j = 0 ; j < t ; j++)
{
cnt = 0;
for(i = 0 ; i < 26 ; i++)
num[i] = 0;
len = strlen(str[j]);
for(k = 0 ; k < len ; k++)
num[str[j][k] - 'a']++;
for(i = 0 ; i < len ; i++)
{
if(num[str[j][i] - 'a'] == 1)
{
cout << str[j][i] << endl;
cnt++;
break;
}
}
if(cnt == 0)
cout <<"no"<<endl;
}
return 0;
}
|
37
|
18412
|
int main()
{
int t;
cin>>t;
char a[10][100000] = {{'\0'}},b[10][2] = {{'\0'}};
for(int i=0;i<t;i++)
{
cin >> a[i];
for(int j=0 ; a[i][j]!='\0' ;j++)
{
int flag = 0;
for(int k=0 ;a[i][k]!='\0';k++)
{
if( k==j ) continue;
if( a[i][j] == a[i][k] ){ flag = 1 ;break;}
}
if( flag == 0 ) {b[i][0] = a[i][j];break;}
}
if(b[i][0] == '\0') b[i][0]='n',b[i][1]='o';
}
for(int i=0;i<t;i++)cout<<b[i]<<endl<<endl;
return 0;
}
|
37
|
18413
|
main()
{
int t,i,j,k,x;
char a[100000],firstone;
int c;
scanf ("%d",&t);
for (i=0;i<t;i++)
{
c=0;
scanf("%s",&a);
for (j=0;a[j]!='\0';j++)
{
x=0;
for (k=0;a[k]!='\0';k++)
{
if (a[j]==a[k]) x=x+1;
}
if (x==1)
{
firstone=a[j];
break;
}
}
if (x!=1) c=c+1;
if (c==0) printf ("%c\n",firstone);
else printf ("no\n");
}
}
|
37
|
18414
|
int main()
{
char a[100];
int i,j,n,k,h,z,t;
scanf("%d",&k);
getchar();
for(h=0;h<k;h++)
{
z=0;
gets(a);
n=strlen(a);
for(i=0;i<n;i++)
{
t=1;
for(j=0;j<i;j++)
{
if(a[i]==a[j])t=0;
}
for(j=i+1;j<n;j++)
{
if(a[i]==a[j])t=0;
}
if(t==1)
{
printf("%c\n",a[i]);
z++;
break;
}
}
if(z==0)printf("no\n");
}
}
|
37
|
18415
|
main()
{
int n;
scanf("%d",&n);
for (int u = 1;u <= n;u ++)
{
char c[10010];
int len,ok,y = 1;
scanf("%s",c);
len=strlen(c);
for (int i = 0;i < len;i ++)
{
ok = 0;
for (int j = 0;j < len;j ++)
{
if(i == j)
continue;
else if (c[i]==c[j])
ok = 1;
}
if (ok == 0)
{
printf("%c\n\n",c[i]);
y = 0;
break;
}
}
if (y)
printf("no\n\n");
}
}
|
37
|
18416
|
int main()
{
int t,i,j,b,min;
char c;
cin>>t;
cin.get();
for(i=0;i<t;i++)
{
int a[26]={0},d[26]={0};
char ch[100000]={'\0'};
cin.getline(ch,100000);
j=0;
while(ch[j]!='\0')
{
c=ch[j]-'a';
b=c;
a[b]++;
if(a[b]==1)
d[b]=j;
j++;
}
min=100000;
for(j=0;j<26;j++)
if(a[j]==1&&min>d[j])
min=d[j];
if(min!=100000)
cout<<ch[min];
else cout<<"no";
cout<<endl;
}
return 0;
}
|
37
|
18417
|
main()
{
int q;
scanf("%d",&q);
for(int s=0;s<q;s++)
{ char a[100000];
int n,i,j,m,k=0;
scanf("%s",a);
n=strlen(a);
for(i=0;i<n;i++)
{ m=0;
for(j=0;j<n;j++)
{
if(a[i]==a[j])
m++;
}
if(m==1)
{printf("%c\n",a[i]);
k=1;
break;}
}
if(k==0)
printf("no\n");
}
}
|
37
|
18418
|
main()
{
int n,i,j,k;
char a[100000],b[100],*pa,*pb;
scanf("%d",&n);
gets(a);
pb=b;
for(i=0;i<n;i++){
gets(a);
pa=a;
for(j=0;j<strlen(a);j++){
for(k=0;k<strlen(a);k++){
if(k==j)
;
else if(*(pa+j)==*(pa+k)){
break;
}
}
if(k==strlen(a)){
*(pb+i)=*(pa+j);
break;
}
}
if(j==strlen(a)){
*(pb+i)=0;
}
}
for(i=0;i<n;i++){
if(*(pb+i)==0){
printf("no\n");
}
else{
printf("%c\n",*(pb+i));
}
}
}
|
37
|
18419
|
int main()
{
char c;
int letter[26][2] = {0}, i = 0, j, n, flag = 26;
cin >> n;
c = getchar();
for (; n > 0; n--)
{
c = getchar();
while (c != '\n')
{
letter[c - 'a'][0]++;
if (letter[c - 'a'][1] == 0)
{
letter[c - 'a'][1] = i;
i++;
}
c = getchar();
}
for (i = 0; i < 26; i++)
{
if (letter[i][0] == 1 && letter[i][1] < flag)
{
j = i;
flag = letter[i][1];
}
letter[i][0] = 0;
letter[i][1] = 0;
}
if (flag == 26)
cout << "no";
else
putchar(j + 'a');
cout << endl;
flag = 26;
i = 0;
}
return 0;
}
|
37
|
18420
|
int main()
{
int t,i,j,k,l,m,n,b[100000];
char a[100000];
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%s",a);
l=strlen(a);
for(j=0;j<l;j++)
{
b[j]=0;
}
for(j=0;j<l;j++)
{
for(k=0;k<l;k++)
{
if(j==k) continue;
if(a[j]==a[k]) b[j]++;
}
}
for(j=0;j<l;j++)
{
if(b[j]==0) {printf("%c\n",a[j]); break;}
else m=j;
}
if(m==l-1) printf("no\n");
}
}
|
37
|
18421
|
int main()
{
int k;
int i,j,r;
char a[300]={'\0'};
gets(a);
k=atoi(a);
int m;
for(i=0;i<=k-1;i++)
{
char a[300]={'\0'};
gets(a);
for(j=0;a[j]!='\0';j++)
{
m=0;
for(r=0;a[r]!='\0';r++)
{
if(a[r]==a[j])
{
m++;
}
}
if(m==1)
{
printf("%c\n",a[j]);
break;
}
}
if(a[j]=='\0')
{
printf("no\n");
}
}
return 0;
}
|
37
|
18422
|
main(){
char s[100000]={'\0'},c;
int n,a[100000]={0},i,j,k,len,num2;
scanf("%d\n",&n);
for(i=0;i<n;i++){
gets(s);
len=strlen(s);
for(j=0;j<len;j++){
for(k=0;k<len;k++){if(s[j]==s[k]) a[j]++;}
if(a[j]==1){
c=s[j];
printf("%c\n",c);
for(j=0;j<len;j++){
s[j]='\0';}
continue;}
}
num2=0;
for(k=0;k<len;k++){if(a[k]!=1) num2++;}
if(num2==len) printf("no\n");
for(j=0;j<len;j++){
s[j]='\0';a[j]=0;}
}
}
|
37
|
18423
|
int main(int argc, char* argv[])
{
int i,j,k,count,n;
scanf("%d\n",&n);
char s[100000];
for(i=0;i<n;i++){
gets(s);
int len=strlen(s);
int sum=0;
for(j=0;j<len;j++){
int count=0;
for(k=0;k<len;k++){
if(s[j]!=s[k]){
count++;
}
}
if(count==len-1){
sum++;
}
}
if(sum==0){
printf("no\n");
}
else{
for(j=0;j<len;j++){
count=0;
for(k=0;k<len;k++){
if(s[j]!=s[k]){
count++;
}
}
if(count==len-1){
printf("%c\n",s[j]);
break;
}
}
}
}
return 0;
}
|
37
|
18424
|
int i,j,len,n;
char s[1000];
int cnt[1000];
main()
{
scanf("%d",&n);
for (i = 0; i < n ;++i)
{
scanf("%s",s);
len = strlen(s);
memset(cnt,0,sizeof(cnt));
for (j = 0; j < len; ++j)
cnt[s[j]-'a']++;
for (j = 0; j < len; ++j)
if (cnt[s[j]-'a']==1) break;
if (j<len) printf("%c\n",s[j]);
else puts("no");
}
}
|
37
|
18425
|
int main()
{
int t;
char a[N][M];
int i,j,r,num;
for(i=0;i<N;i++)
{
for(j=0;j<M;j++)
a[i][j]='\0';
}
scanf("%d",&t);
for(i=0;i<t;i++)
{
scanf("%s",a[i]);
}
for(i=0;i<t;i++)
{
for(j=0;a[i][j]!='\0';j++)
{
for(r=0,num=0;a[i][r]!='\0';r++)
{
if(a[i][j]==a[i][r])
num++;
}
if(num==1)
{
printf("%c\n",a[i][j]);
break;
}
}
if(a[i][j]=='\0')
printf("no\n");
}
return 0;
}
|
37
|
18426
|
//***********************************
//????1000012825_2 *
//?????? *
//???11. 18 *
//??????????? *
//***********************************
int main ()
{
int t, i, j, k;
cin >> t;
char str[100][10000];
for ( i = 1; i <= t; i++ )
{
cin >> str[i]; // ????????????
for ( j = 0; str[i][j] != '\0'; j++ )
{
for ( k = 0; str[i][k] != '\0' ; k++) //????? ????
{
if ( j == k ) continue ; // ?? j=k?????
if ( str[i][k] == str[i][j] ) break; //???????????
}
if ( str[i][k] == '\0') // ???????????????????????????????
{
cout << str[i][j] << endl ; break;
}
}
if ( str[i][j] == '\0' ) // ????????????no
cout << "no" << endl;
}
return 0;
}
|
37
|
18427
|
int main()
{
char a[100001];
int l, count[26], i, j, n, flag;
cin >> n;
for(i = 0;i < n;i++)
{
flag = 0;
memset(count,0,sizeof(count));
cin >> a;
for(j = 0;j < strlen(a);j++)
{
count[a[j] - 'a']++;
}
for(j = 0;j < strlen(a);j++)
if(count[a[j] - 'a'] == 1)
{
flag = 1;
cout << a[j] << endl;
break;
}
if(flag == 0)
cout << "no" << endl;
}
return 0;
}
|
37
|
18428
|
int main()
{
int t,i;
cin>>t;
cin.get(); //?????
for (i=0;i<t;i++)
{
int num[26]={0},j,k,length=0,x=0; //num[]????26?????????????
char ch[10000]={'\0'};
cin.getline(ch,10000);
length=strlen(ch); //????????
for (j=0;j<length;j++)
{
k=ch[j]-'a';
num[k]++; //?26???????????????
}
for (j=0;j<length;j++)
{
k=ch[j]-'a';
if (num[k]==1)
{
cout<<ch[j]<<endl;
x=1;
break;
}
}
if (x==0)
cout<<"no"<<endl;
}
return 0;
}
|
37
|
18429
|
int main ()
{
int t, i, j, len, flag2 = 0, temp, flag[26] = {0};
char get[100001];
cin >> t;
cin.get();
for (i = 0; i < t; i++)
{
cin.getline(get, 100001);
len = strlen(get);
for (j = 0; j < len; j++)
{
temp = get[j] - 'a';
flag[temp]++;
}
for (j = 0; j < len; j++)
{
temp = get[j] - 'a';
if (flag[temp] == 1)
{
cout << get[j]<<endl;
flag2 = 1;
break;
}
}
if (!flag2)
cout <<"no"<<endl;
flag2 = 0;
memset(flag,0,sizeof(flag));
}
return 0;
}
|
37
|
18430
|
int main()
{
int n,i,x,j,y,f,z[26],k,m;
char a[100][10000],b[26];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",a[i]);
f=0;
for(x=0;x<26;x++)
{
z[x]=0;
}
for(j=0;j<strlen(a[i]);j++)
{
z[a[i][j]-'a']++;
}
y=0;
k=0;
for(x=0;x<26;x++)
{
if(z[x]==1)
{
b[k]=x+'a';
y=1;
k++;
}
}
if(y==0)printf("no\n");
else
{
for(m=0;m<strlen(a[i]);m++)
{
for(j=0;j<k;j++)
{
if(a[i][m]==b[j])
{
printf("%c\n",b[j]);
f=1;
break;
}
}
if(f==1)break;
}
}
}
return 0;
}
|
37
|
18431
|
int main()
{
int t,rd,check=0,output=0;
char str[100001],*p,*pm;
scanf("%d",&t);
for(rd=0;rd<t;rd++)
{
output=0;
scanf("%s",str);
p=str;
for(;p<(str+strlen(str));p++)
{
pm=str;
for(;pm<(str+strlen(str));pm++)
{
if(*p==*pm)
{
check++;
}
if(check==2)
{
check=0;
break;
}
}
if(pm==str+strlen(str))
{
printf("%c\n",*p);
check=0;
output++;
break;
}
}
if(output==0)
{
printf("no\n");
}
}
return 0;
}
|
37
|
18432
|
int main()
{
char str[100000];
int a[26]={0},i,j,n,len,flag=1,symbol=1;
scanf("%d",&n);
getchar();
for(j=0;j<n;j++)
{
symbol=1;
flag=1;
gets(str);
len=strlen(str);
for(i=0;i<len;i++)
a[str[i]-97]+=1;
for(i=0;i<26;i++)
{
if(a[i]!=1)
flag*=1;
else
{
flag*=0;
break;
}
}
if(flag==1)
printf("no\n");
else
{
for(i=0;i<len;i++)
if(a[str[i]-97]==1)
{
printf("%c\n",str[i]);
break;
}
}
for(i=0;i<26;i++)
a[i]=0;
}
return 0;
}
|
37
|
18433
|
int main (){
int n, i, j, k, l, count;
char a[100001];
char* p;
p=a;
scanf("%d", &n);
for (i=0; i<n; i++){
scanf ("%s", a);
l=strlen (a);
for (j=0; j<l; j++){
for (k=j+1; k<l; k++){
if (*(p+j)!='0'){
if (*(p+j)==*(p+k)){
*(p+k)='0';
count=1;
}
}
if (count>0&&k==l-1){
*(p+j)='0';
count=0;
}
}
}
for (j=0; j<l; j++){
if (*(p+j)!='0'){
printf ("%c\n", *(p+j));
break;
}
if (j==l-1){
printf("no\n");
}
}
}
return 0;
}
|
37
|
18434
|
int main(){
int n,i,j,k,sum,len;
scanf("%d",&n);
char a[100];
for(i=0;i<n;i++){
scanf("%s",a);
len=strlen(a);
for(j=0;j<len;j++){
sum=0;
for(k=0;k<len;k++){
if(a[j]==a[k]){
sum++;
}
}
if(sum==1){
printf("%c\n",a[j]);
break;
}
}
if(sum!=1){
printf("no\n");
}
}
return 0;
}
|
37
|
18435
|
int main()
{
char a[100],c=0;
unsigned int N,i,j,k;
cin>>N;
for(i=0;i<N;i++)
{
cin>>a;
for(j=0;j<strlen(a);j++)
{
c=a[j];
for(k=0;k<strlen(a);k++)
{
if(c==a[k]&&k!=j)
break;
}
///cout<<k<<strlen(a);
if(k==strlen(a)&&c!=a[k])
{
//cout<<"asdf";
cout<<c<<endl;
break;
}
}
if(j==strlen(a)&&k!=strlen(a))
cout<<"no"<<endl;
}
return 0;
}
|
37
|
18436
|
int main()
{
int n,i,j,zimu[27]={0},loci[27]={0},minadr=100009,flag=0;
char str[100001],num[10],*ptr,list[27];
gets(num);n=atoi(num);
for(i=0;i<n;i++){
gets(str);
for(j=0;*(j+str)!='\0';j++){
ptr=j+str;
*(zimu+*ptr-'a'+1)+=1;
if(*(zimu+*ptr-'a'+1)==1){
*(loci+*ptr-'a'+1)=j;
}
}
for(j=1;j<27;j++){
if(*(zimu+j)==1){
if(*(loci+j)<minadr)
minadr=*(loci+j);
flag=1;
}
}
if(flag){
printf("%c\n",*(str+minadr));
}
else
printf("no\n");
for(j=1;j<27;j++){
*(zimu+j)=0;*(loci+j)=0;minadr=100009;flag=0;
}
minadr=100009;flag=0;
}
return 0;
}
|
37
|
18437
|
int main()
{
int n,i,a[30],min,j;
char s[150000];
scanf("%d\n",&n);
for (i=1;i<=n;i++)
{
scanf("%s",s);
memset(a,255,sizeof(a));
a[0]=1000000;
for (j=0;j<strlen(s);j++)
if (a[s[j]-96]==-1)
a[s[j]-96]=j;
else
a[s[j]-96]=-2;
min=0;
for (j=1;j<=26;j++)
if ((a[j]>=0)&&(a[j]<a[min]))
min=j;
if (min==0)
printf("no\n");
else
printf("%c\n",min+96);
}
}
|
37
|
18438
|
int main()
{
int t,a[27]={0},i,j,k;
char str[100000];
scanf("%d",&t);
for(i=0;i<t;t++)
{
memset(str,'\0',100000*sizeof(char));
memset(a,0,27*sizeof(int));
scanf("%s",str);
for(j=0;j<strlen(str);j++)
{
k=str[j]-96;
a[k]++;
}
for(j=0;j<strlen(str);j++)
{
k=str[j]-96;
if(a[k]==1)
{ printf("%c\n",str[j]);
break;}
}
if(j==strlen(str))
{printf("no\n");
break;}
}
return 0;
}
|
37
|
18439
|
int main()
{
int f(char *str);
int t,i;
char str[100][100000];
scanf("%d\n",&t);
for(i=0;i<t;i++)
{
gets(str[i]);
}
for(i=0;i<t;i++)
{
f(str[i]);
}
return 0;
}
int f(char *str)
{
int letter[26],i,p=0;
char c;
for(i=0;i<26;i++)
{
letter[i]=0;
}
for(i=0;*(str+i)!='\0';i++)
{
c=*(str+i);
letter[c-97]++;
}
for(i=0;*(str+i)!=0;i++)
{
c=*(str+i);
if(letter[c-97]==1)
{
printf("%c\n",c);
p=1;
break;
}
}
if(p==0)
printf("no\n");
return 0;
}
|
37
|
18440
|
int main(){
int n,i,j,l,num;
char zf[1000];
scanf("%d",&n);
for(l=1;l<=n;l++){
scanf("%s",&zf);
for(j=0;zf[j]!='\0';j++){
num=0;
for(i=0;zf[i]!='\0';i++){
if(zf[i]==zf[j]){
num++;
}
}
if(num==1){
printf("%c\n",zf[j]);
break;
}
}
if(zf[j]=='\0'){
printf("no\n");
}
}
return 0;
}
|
37
|
18441
|
int main()
{
int t,i,j,count=0,k;
scanf("%d",&t);
for(i=0;i<t;i++)
{
char a[100005];
int b[100005];
for(j=0;j<100005;j++)
b[j]=0;
scanf("%s",a);
for(j=0;j<strlen(a);j++)
{
for(k=j+1;k<strlen(a);k++)
{
if(a[j]==a[k])
{
b[j]++;
b[k]++;
}
}
}
for(j=0;j<strlen(a);j++)
{
if(b[j]==0){
printf("%c\n",a[j]);
break;}
}
if(j==strlen(a))
printf("no\n");
}
return 0;
}
|
37
|
18442
|
char oneChar(const char* str){
char deq[26];
unsigned int i = 0,j=0;
unsigned char letter[26];
memset(letter,0,26);
while(*str!='\0'){
letter[*str-'a']++;
if(letter[*str-'a']==1)deq[i++]=*str;
str++;
}
for(;j<i;j++)
if(letter[deq[j]-'a']==1)return deq[j];
if(i==j) return 0;
}
int main(){
const unsigned int num;
unsigned int i;
char ch;
scanf("%d",&num);
char* str[num];
for(i=0;i<num;i++){
str[i] = (char*)malloc(MAX_LEN);
scanf("%s",str[i]);
fflush(stdin);
tolower(str[i]);
}
for(i=0;i<num;i++){
ch = oneChar(str[i]);
if(ch==0) printf("no\n",i+1);
else printf("%c\n",ch);
}
for(i=0;i<num;i++){
free(str[i]);
}
return 0;
}
|
37
|
18443
|
int main(){
int t,i=0,l,j,k,n;
char s[100000];
scanf("%d",&t);
for(i=0;i<t;i++){
scanf("%s",s);
l=strlen(s);
for(j=0;;j++){
n=0;
for(k=0;k<l;k++){
if(j==k) continue;
if(s[j]==s[k]) {
break;
}
if(k==l-1) {
printf("%c\n",s[j]);
n++;
break;
}
}
if(n==1) break;
if(n==0){
if(j+1==l) printf("no\n");
}
}
}
return 0;
}
|
37
|
18444
|
int main()
{
int N=0,i=0,j=0,k=0,sum=0,mark=0;
int flag[100000]={0};
char ch[100000];
cin>>N;
for(i=0;i<N;i++)
{
mark=0;
memset(flag,0,sizeof(flag));
cin>>ch;
for(j=0;ch[j]!='\0';j++)
{
sum=1;
if(flag[j]!=0) continue;
for(k=j+1;ch[k]!='\0';k++)
{
if(ch[k]==ch[j])flag[k]=1,sum++;
}
if(sum==1) {cout<<ch[j]<<endl,mark=1;break;}
}
if(mark==0) cout<<"no"<<endl;
}
return 0;
}
|
37
|
18445
|
int main()
{
char c[100000];
int n,m;
scanf("%d\n",&n);
for (int i=0;i<n;i++)
{
gets(c);
for (int j=0;c[j]!='\0';j++)
{
m=0;
for (int k=0;c[k]!='\0';k++)
{
if (k!=j)
{
if (c[k]==c[j])
{
m=1;
break;
}
}
}
if (m==0)
{
printf("%c\n",c[j]);
break;
}
}
if (m==1) printf("no\n");
}
return 0;
}
|
37
|
18446
|
main()
{
int t;
int i=1;
scanf("%d",&t);
while(i<=t){
char str[100000];
int a;
memset(str,0,sizeof(str));
scanf("%s",&str);
int j=0;
int k=0;
a=strlen(str);
while(j<a){
while(k<a){
if(str[j]!=str[k]&&j!=k)
k=k+1;
else if(j==k)
k=k+1;
else
break;
}
if(k==a)
break;
else{
j=j+1;
k=0;
}
}
if(j==a)
printf("no\n");
else{
if(k==a)
printf("%c\n",str[j]);
}
i=i+1;
}
}
|
37
|
18447
|
void main()
{
int n,i,j,l;
char c[100005];
scanf("%d",&n);
for(i=0;i<n;i++)
{
long int a[123]={0},p[123]={0};
long int pose=100005,targetchar=0;
scanf("%s",c);
l=strlen(c);
for(j=0;j<l;j++)
{
a[c[j]]++;
if(a[c[j]]==1)
p[c[j]]=j;
}
for(j=97;j<123;j++)
{
if(a[j]==1)
if(p[j]<pose)
{
pose=p[j];
targetchar=j;
}
}
if(targetchar)
{
printf("%c\n",targetchar);
}
else
{
printf("no\n");
}
}
}
|
37
|
18448
|
void main()
{
int t,time,flag=0,i,j;
char a[100000],first=0;
void yesorno(int Flag,char First);
scanf("%d",&t);
for(time=0;time<t;time++)
{
scanf("%s",&a);
if(a[1]=='\0'){
printf("%c\n",a[0]);
continue;
}
for(i=0;a[i]!='\0';i++){
for(j=0;a[j]!='\0';j++){
if(i==j) continue;
if(a[j]==a[i]) break;
if(a[j+1]=='\0'){
first=a[i];
flag=1;
goto print;
}
}
}
print:;
yesorno(flag,first);
first=flag=0;
}
}
void yesorno(int Flag,char First)
{
if(Flag==0) printf("no\n");
else printf("%c\n",First);
}
|
37
|
18449
|
main()
{
int m,j;
scanf("%d",&m);
for(j=0;j<m;j++)
{
int n=0;
char s[1000];
scanf("%s",s);
int l;
int i;
l=strlen(s);
int b[1000]={0};
for(i=0;i<l;i++)
{
b[s[i]]++;
}
for(i=0;i<l;i++)
{
if(b[s[i]]==1)
{
printf("%c\n",s[i]);
n=1;
break;
}
}
if(n==0)
printf("no\n");
}
}
|
37
|
18450
|
main ()
{
int n,i,j,k,a[100001];
char s[100001];
scanf("%d",&n);
for(i=0;i<n;i++)
{
int x=0;
for(j=0;j<100001;j++) {s[j]='\0';a[j]=1;}
scanf("%s",s);
for(j=0;j<100001;j++)
{
if(a[j]==1) for(k=j+1;k<100001;k++) if(s[j]==s[k]) {a[j]++;a[k]++;}
}
for(j=0;j<100001;j++) if(a[j]==1) {printf("%c\n",s[j]);x=1;break;}
if(x==0) printf("no\n");
}
}
|
37
|
18451
|
main()
{
int *a,*b;
int i,j,n,min,x;
char cc;
a=(int*)malloc(26*sizeof(int));
b=(int*)malloc(26*sizeof(int));
scanf("%d",&n);
scanf("%c",&cc);
for(i=0;i<n;i++)
{
for(j=0;j<26;j++)
{
*(a+j)=0;//a--????
*(b+j)=0;//??????
}
while((cc<'a')||(cc>'z'))
{
scanf("%c",&cc);
}
j=1;
while((cc>='a')&&(cc<='z'))
{
*(a+cc-'a')+=1;
if(*(a+cc-'a')==1)
*(b+cc-'a')=j;
scanf("%c",&cc);
j++;
}
min=100002;
x=-1;
for(j=0;j<26;j++)
{
if ((*(a+j)==1)&&(*(b+j)<min))//????j?????????????
{
min=*(b+j);
x=j;
}
}
if(x<0)
{
printf("no\n");
}
else
{
printf("%c\n",'a'+x);
}
}
}
|
37
|
18452
|
int main()
{
int t,i;
cin >> t;
char str[t][10000];
for (i=0;i<=t-1;i++)
{
cin >> str[i];
int len;
len=strlen(str[i]);
int k,j,s=0;
for (k=0;k<=len-1;k++)
{
for (j=k+1;j<=len-1;j++)
{
if (str[i][k]==str[i][j])
{
str[i][k]='\0';
str[i][j]='\0';
}
}
for (j=k-1;j>=0;j--)
{
if (str[i][k]==str[i][j])
{
str[i][k]='\0';
str[i][j]='\0';
}
}
}
for (k=0;k<=len-1;k++)
{
if (str[i][k]!='\0')
{
cout << str[i][k] << endl;
break;
}
}
if (k==len)
{
cout << "no" << endl;
}
}
return 0;
}
|
37
|
18453
|
char main()
{
int t,i,j,k,b=0,c;
char a[100000];
scanf("%d",&t);
for(i=0;i<t;i++)
{
scanf("%s",a);
for(j=0;j<100000;j++)
{
if(a[j]=='\0')
break;
}
for(k=0;k<j;k++)
{
b=0;
for(c=0;c<j;c++)
{
if((a[k]==a[c]) && (k!=c))
{
b=1;
break;
}
}
if(b==0)
{
printf("%c\n",a[k]);
break;
}
}
if(b==1)
printf("no\n");
}
return 0;
}
|
37
|
18454
|
int main(){
char zxc[99];
int sz[99];
int m,n,i,t,k;
scanf("%d",&n);
for(i=1;i<=n;i++){
for(m=0;m<98;m++){
sz[m]=0;
}
scanf("%s",zxc);
m=strlen(zxc);
for(t=0;t<m;t++){
for(k=t+1;k<m;k++){
if(zxc[t]==zxc[k]){
sz[t]++;
sz[k]++;
}
}
}
for(t=0;t<m;t++){
if(sz[t]==0){
printf("%c\n",zxc[t]);
break;
}else if(t==(m-1)){
printf("no\n");
}
}
}
return 0;
}
|
37
|
18455
|
int main ()
{
int t,i,j,b;
char c[10000];
cin>>t;
getchar();
for(i=0;i<t;i++)
{
int a[123]={0};
cin.getline(c,10000);
b=0;
for(j=0;c[j]!='\0';j++)
a[c[j]]++;
for(j=0;c[j]!='\0';j++)
if(a[c[j]]==1)
{
b=1;
cout<<c[j]<<endl;
break;
}
if(b==0)
cout<<"no"<<endl;
}
return 0;
}
|
37
|
18456
|
char line[1000000];
int ccount[26];
int main()
{
int n;
cin>>n;
while(n--)
{
cin>>line;
memset((char *)ccount,0,26*sizeof(int));
int len=strlen(line);
int i;
for(i=0;i<len;i++)
ccount[line[i]-'a']++;
for(i=0;i<len;i++)
if(ccount[line[i]-'a']==1)
{
cout<<line[i]<<endl;
break;
}
if(i==len)
cout<<"no"<<endl;
}
return 0;
}
|
37
|
18457
|
int main()
{
int n,i;
int a[26]={0};
int aptr[26];//aprt[0]???????????[1]???????????????
int ap=0,j;
char tmpch;
scanf("%d",&n);
scanf("%c",&tmpch);//????????
for (i=0;i<n;i++)
{
ap=0;
scanf("%c",&tmpch);
while(tmpch!='\n')
{
if(a[tmpch-'a']==0)//???????????aptr?
{
aptr[ap++]=tmpch-'a';
}
a[tmpch-'a']++;//tmpch??????
scanf("%c",&tmpch);
}
for(j=0;j<ap;j++)
{
if(a[aptr[j]]==1)
break;
}
if (j<ap)
{
printf("%c\n",aptr[j]+'a');
}
else
{
printf("no\n");
}
for (j=0;j<26;j++)
{
a[j]=0;
}
}
return 0;
}
|
37
|
18458
|
void main(){
int t,i,j,len,judge;
char string[10000];
scanf("%d",&t);
while(t--){
for(i=0;i<10000;i++){
string[i]='\0';
}
scanf("%s",&string);
len=strlen(string);
for(i=0;i<len;i++){
judge=0;
for(j=i+1;j<len;j++){
if(string[i]==string[j]){
string[j]='A';
judge=1;
}
}
if(judge){
string[i]='A';
}
}
for(i=0;i<len;i++){
if(string[i]!='A'){
printf("%c\n",string[i]);
break;
}else if(i==len-1){
printf("no\n");
break;
}
}
}
}
|
37
|
18459
|
int main()
{
char str[100000];
int i,j,t,flag,k,n;
scanf("%d",&t);
getchar();
for(k=0;k<t;k++)
{
gets(str);
flag=0;
for(i=0;str[i];i++)
{
for(n=1,j=0;str[j];j++)
{
if(i!=j&&str[i]==str[j])
n++;
if(n>1)
break;
}
if(n==1)
{
printf("%c\n",str[i]);
flag=1;
break;
}
}
if(!flag)
printf("no\n");
}
return 0;
}
|
37
|
18460
|
char sz[100000];
int zd(char *sz);
int main(){
int n,x;
scanf("%d",&n);
int i;
for(i=0;i<n;i++){
scanf("%s",sz);
x=zd(sz);
if(x==0){
printf("no\n");
}
}
return 0;
}
int zd(char *sz){
char *bz;
bz="abcdefghijklmnopqrstuvwxyz";
int js[26]={0};
int len=strlen(sz);
int i,j;
for(i=0;i<len;i++){
for(j=0;j<26;j++){
if(bz[j]==sz[i]){
js[j]++;
}
}
}
for(i=0;i<len;i++){
for(j=0;j<26;j++){
if(bz[j]==sz[i]){
if(js[j]==1){
printf("%c\n",sz[i]);
return 1;
}
}
}
}
return 0;
}
|
37
|
18461
|
main()
{
int n,i,j,t,c,l;
c=1;
scanf("%d",&n);
char a[100];
for(i=0;i<n;i++)
{
scanf("%s",&a);
l=strlen(a);
for(j=0;j<l;j++)
{
for(t=0;t<l;t++)
{
if(a[t]==a[j]&&t!=j)
break;
if(t==l-1)
{
printf("%c\n",a[j]);
c=0;
}
}
if(c==0)
{
c=1;
break;
}
if(j==l-1)
printf("no\n");
}
}
getchar();
getchar();
}
|
37
|
18462
|
/*
???????
??????
?????2010?11?
??????????????????
**/
int flag[100000]; //flag???????????????
char a[100000];
int main()
{
int t, i, j;
cin >> t;
cin.ignore();
while(t--)
{
memset(flag,0,100000); //flag???0
cin.getline(a,100000); //???????????a?
for(i = 0; a[i] != '\0'; i++) //?????????????
if(flag[i] != 1) //?????????????1????????
{
for(j = i + 1; a[j] != '\0'; j++) //?a[i]??????a[i]??
{
if(a[i] == a[j]) //??i????????a[i]???
{
flag[j] = 1; //???1
break; //??????????
}
}
if(a[j] == '\0') //??a[i]?????????
{
cout << a[i] << endl; //a[i]???????
break; //?????????
}
}
if(a[i] == '\0') //???????????????no
cout << "no" << endl;
}
return 0;
}
|
37
|
18463
|
char in[100000];
int main()
{
int t,k,i,j,m,num[26];
scanf("%d",&t);
for(k=1;k<=t;k++)
{
m=0;
for (i=0;i<=25;i++) num[i]=0;
scanf("%s",in);
for(i=0;in[i]!='\0';i++)
{
j=in[i]-97;
num[j]++;
}
for(i=0;in[i]!='\0';i++)
{
if(num[in[i]-97]==1)
{printf("%c\n",in[i]);m=1;break;}
}
if (m==0)printf("no\n");
}
}
|
37
|
18464
|
int main()
{
char a[10000], only[1000];
int i, j, count[26] = {0}, t, len, temp;
cin >> t;
cin.get();
for (i = 1; i <= t; i++)
{
for (j = 0; j < 26; j++)
count[j] = 0;
cin.getline(a,10000);
len = strlen(a);
for (j = 0; j < len; j++)
{
temp = a[j] - 'a';
count[temp]++;
}
for (j = 0; j < len; j++)
{
temp = a[j] - 'a';
if (count[temp] == 1)
{
only[i] = a[j];
break;
}
}
if (j == len)
only[i] = 'A';
}
for (i = 1; i <= t; i++)
{
if (only[i] == 'A')
cout << "no" <<endl;
else
cout << only[i] <<endl;
}
return 0;
}
|
37
|
18465
|
int main()
{
char str[10][100000],min;
int t,i,j,k,sign=0,num[26],time[26],temp;
cin>>t;
for (i=0;i<t;i++)
{
sign=0;
cin>>str[i];
for(k=0;k<26;k++)
{
num[k]=0;
time[k]=0;
}
for(j=0;;j++)
{
if(str[i][j]=='\0')
break;
for(k=0;k<26;k++)
{
if(str[i][j]==97+k)
{
num[k]++;
time[k]=j;
}
}
}
for(k=0;k<26;k++)
{
if(num[k]==1)
{
temp=time[k];
sign=1;
break;
}
}
if(sign==0)
cout<<"no"<<endl;
else
{
for(k=0;k<26;k++)
{
if(num[k]==1)
{
if(time[k]<=temp)
{
temp=time[k];
min=97+k;
}
}
}
cout<<min<<endl;
}
}
return 0;
}
|
37
|
18466
|
int main()
{
int t,k,i,j,n,p,flag=0;
char a[100];
scanf("%d",&t);
getchar();
for(k=1;k<=t;k++)
{
flag=0;
gets(a);
n=strlen(a);
for(i=0;i<n;i++)
{
if(i==0)
{
for(j=i+1;j<n;j++)
{
if(a[j]==a[i])
break;
}
if(j==n)
{
printf("%c\n",a[i]);
flag=1;
i=n;
}
}
if(i==n-1)
{
for(j=i-1;j>=0;j--)
{
if(a[j]==a[i]) break;
}
if(j==-1)
{
printf("%c\n",a[i]);
flag=1;
i=n;
}
}
if(i>0&&i<n-1)
{
for(j=i+1;j<n;j++)
{
if(a[j]==a[i])
break;
}
if(j==n)
{
for(p=i-1;p>=0;p--)
{
if(a[p]==a[i]) break;
}
if(p==-1)
{
printf("%c\n",a[i]);
flag=1;
i=n;
}
}
}
}
if(flag==0) printf("no\n");
}
return 0;
}
|
37
|
18467
|
int main()
{
int t;
cin>>t;
cin.get();
for(int i=0;i<t;i++)
{
int flag[26]={0},str_len;
char str[100000];
cin.getline(str,100000);
str_len=strlen(str);
for(int j=0;j<str_len;j++)
{
int c=str[j]-'a';
if(flag[c]==-1)
continue;
else
{
if(flag[c]==0)
flag[c]=j+1;
else
flag[c]=-1;
}
}
int min_pos=100000;
char c='@';
for(int j=0;j<26;j++)
{
if(flag[j]==-1||flag[j]==0)
continue;
else
{
if(flag[j]<min_pos)
{
min_pos=flag[j];
c=j+'a';
}
}
}
if(c=='@')
cout<<"no"<<endl;
else
cout<<c<<endl;
}
return 0;
}
|
37
|
18468
|
int main(){
int i,j,n;
char s[1001];
scanf("%d",&n);
for(j=0;j<n;j++){
int freq[27]={0};
int flag=0;
scanf("%s",s);
for(i=0;i<strlen(s);i++){
freq[s[i]-97]++;
}
for(i=0;i<strlen(s);i++){
if(freq[s[i]-97]==1){
printf("%c\n",s[i]);
flag=1;
break;
}
}
if(flag==0){
printf("no\n");
}
}
return 0;
}
|
37
|
18469
|
main()
{
int n,i,m=0,t,j,d=0,e=0;char a[100],b[100],c[100];
for(t=0;t<100;t++)b[t]=0;
scanf("%d",&n);
while(d!=n){scanf("%s",a);
for(t=0;t<100;t++)
{if(a[t]=='\0') {j=t;break;}}
for(t=0;t<j;t++)
{for(i=0;i<j;i++)
{if(a[t]==a[i]) {b[t]++;}}}
for(t=0;t<j;t++)
{ if(b[t]==1){m=t+1;break;}
}
if(m==0)printf("no\n");
else printf("%c\n",a[m-1]);
d++;for(t=0;t<100;t++)b[t]=0;e=0;m=0;}
getchar();getchar();getchar();getchar();
}
|
37
|
18470
|
int main(){
int number[26][2];
int n;
char s[100010];
cin>>n;
for(int i =0;i<n;i++){
cin>>s;
memset(number,0,sizeof(number));
for(int j = 0;j<strlen(s);j++){
number[s[j]-'a'][0]++;
if(number[s[j]-'a'][1]==0) number[s[j]-'a'][1]=j;
}
int min1=100010,out;
for(int j = 0;j<26;j++){
if(number[j][0]==1){
if(min1>number[j][1]){
min1 = number[j][1];
out = j;
}
}
}
if(min1==100010) cout<<"no"<<endl;
else cout<<(char)('a'+out)<<endl;
}
return 0;
}
|
37
|
18471
|
int main()
{
int t, i, count[27] = {0}, j, a[1000] = {0}, k;
char word[1000][1000], c[1000][2];
cin >> t;
for(i = 1;i <= t;i++)
{
cin >> word[i];
for(j = 0;j < strlen(word[i]);j++)
{
count[word[i][j] - 96] = count[word[i][j] - 96] + 1;
}
for(j = 0;j < strlen(word[i]);j++)
{
if(count[word[i][j] - 96] == 1)
{
c[i][0] = word[i][j];
a[i] = 1;
break;
}
}
if(a[i] == 0)
{
c[i][0] = 110;
c[i][1] = 111;
}
for(j = 0;j <= 26;j++)
{count[j] = 0;}
}
for(i = 1;i <= t;i++)
{
if(a[i] == 1)
{cout << c[i][0] << endl;}
if(a[i] == 0)
{cout << c[i] << endl;}
}
}
|
37
|
18472
|
int main()
{
int t;
char a[100][1000],s;
int i,j,l;
int b[100][200]={0};
cin >> t;
cin.get();
for(i=0;i<t;i++)
{
cin.getline(a[i],1000);
l=strlen(a[i]);
for(j=0;j<l;j++)
{
b[i][a[i][j]]=b[i][a[i][j]]+1;
}
for(j=0;j<l;j++)
{
if(b[i][a[i][j]]==1)
{
cout << a[i][j] << endl;
break;
}
}
if(j==l)
cout << "no" << endl;
}
return 0;
}
|
37
|
18473
|
int main()
{
int t;
char a[120000];
int i,j,k;
int c;
cin>>t;
cin.getline(a,110000);
memset(a,0,sizeof(a));
for(i=1;i<=t;i++)
{
cin.getline(a,110000);
c=strlen(a);
for(j=0;j<c;j++)
{
if(a[j]=='1') continue;
int x=0;
for(k=j+1;k<c;k++)
{
if(a[k]==a[j])
{
a[k]='1';
x++;
}
}
if(x==0)
{
cout<<a[j]<<endl;
break;
}
}
if(j==c)
cout<<"no"<<endl;
}
return 0;
}
|
37
|
18474
|
int main ()
{
int t,i;
cin >> t;//???????
cin.get();
while(t --)
{
int count[26]={0};//????count
char str[100000]={0};
cin.getline(str,10000);//????????
for(i = 0; str[i] != '\0'; i ++)//???????????count????
{
count[str[i]-'a'] ++;
}
for(i=0; str[i] !='\0';i ++)//???????????????????????????no?
{
if(count[str[i]-'a'] == 1)
{
cout << str[i]<<endl;
break;
}
}
if(i == strlen(str))
{ cout<<"no"<<endl;}
}
return 0;
}
|
37
|
18475
|
//***********************************
//**??????? **
//**?????? 1100012914 **
//**???2011? 11?3? **
//***********************************
int main()
{
int t,i,num[26] = {0},j,len,x,flag = 0, rank[26], r = 0,min = 26,z;
char a[100000],ch;
cin >> t;
for(i = 0;i < t;i++)
{
cin >> a;
len = strlen(a);
for(j = 0;j <= len;j++)
{
x = a[j] - 'a';
num[x]++;
if(num[x] == 1)
{
rank[x] = r++;
}
}
for(j = 0;j <=26;j++)
{
if(num[j] == 1)
{
if(rank[j] < min)
{
min = rank[j];
z = j;
flag = 1;
}
}
}
if(flag == 0)
cout << "no" << endl;
else
{
ch = (char)z;
ch = ch + 'a';
cout << ch << endl;
}
j = 0;
memset(a,' ',sizeof(a));
memset(num,0,sizeof(num));
memset(rank,0,sizeof(rank));
flag = 0;
min = 26;
r = 0;
}
return 0;
}
|
37
|
18476
|
void main()
{
int cases,sum[26],i,max,j;
char str[1001];
scanf("%d",&cases);
while(cases>0)
{
scanf("%s",str);for(i=0;i<26;i++) sum[i]=0;
for(i=0;i<strlen(str);i++)
sum[str[i]-'a']++;
max=0;
for(j=0;j<strlen(str)+1;j++)
{if(sum[str[j]-'a']==1)
{printf("%c\n",str[j]);
break;}
if(j==strlen(str))
printf("no");}cases--;
}}
|
37
|
18477
|
int main(int argc, char* argv[])
{ int n,i,j,len,sum,zm;
char zfc[100000],zm1;
char *p=zfc;
scanf("%d",&n);
for(j=0;j<n;j++){
sum=0;
scanf("%s",zfc);
len=strlen(zfc);
for(zm=0;zm<len;zm++){
for(i=0;i<len;i++){
if(*(p+i)==*(p+zm)){
sum++;
}
}
if(sum==1){
zm1=*(p+zm);
break;
}else{
sum=0;}
}
if(sum==1){
printf("%c\n",zm1);
}else{
printf("no\n");
}
}
return 0;
}
|
37
|
18478
|
main()
{
int i,j,k,t,x,u,count,a[100001];
char string[100001];
scanf("%d",&t);
for(i=1;i<=t;i++)
{
memset(string,0,sizeof(string));
scanf("%s",string);
count=strlen(string);
memset(a,0,sizeof(a));
for(j=0;j<=count-1;j++)
for(k=0;k<=count-1;k++)
if(string[j]==string[k])
a[j]++;
x=0;
for(u=0;u<=count-1;u++)
if(a[u]==1)
{
printf("%c\n",string[u]);
x++;
break;
}
if(x==0)
printf("no\n");
}
}
|
37
|
18479
|
int main(){
int t,i,j,k,n,m=0;
char str[101][100001];
scanf("%d",&t);
for(i=0;i<t;i++){
scanf("%s",str[i]);
m=0;
for(j=0;j<strlen(str[i]);j++){
n=0;
for(k=0;k<strlen(str[i]);k++){
if(str[i][j]==str[i][k]&&j!=k)
break;
if(str[i][j]!=str[i][k])
n++;
}
if(n==strlen(str[i])-1){
printf("%c\n",str[i][j]);
break;
}else
m++;
}
if(m==strlen(str[i]))
printf("no\n");
}
return 0;
}
|
37
|
18480
|
void main()
{
int i,j,k,l,t,n,p,a[26]={0},r;
char str[max]={0};
scanf("%d",&t);
getchar();
for(i=0;i<t;i++)
{
r=0;
gets(str);
n=strlen(str);
for(j=0;j<n;j++)
{
p=(int)(str[j]-97);
a[p]++;
}
for(k=0;k<n;k++)
{
if(a[(int)(str[k]-97)]==1)
{
r++;
printf("%c\n",str[k]);
break;
}
}
if(r==0)
printf("no\n");
for(l=0;l<26;l++)
a[l]=0;
}
}
|
37
|
18481
|
int main()
{
int t, i, j, k, flag, count[26];
char a[100000];
cin >> t;
cin.ignore();
for (i = 1; i <= t; i++)
{
for (k = 0; k < 26; k++)
count[k] = 0;
flag = 0;
for (j = 0; ; j++)
{
cin.get(a[j]);
if (a[j] == '\n')
break;
count[a[j] - 97]++;
}
for (k = 0; k < j ; k++)
{
if (count[a[k] - 97] == 1)
{
cout << a[k] << endl;
flag = 1;
break;
}
}
if (flag == 0)
cout << "no" << endl;
}
return 0;
}
|
37
|
18482
|
main()
{
int t,i,n,j,p,y;
char a[1000];
char s;
int b[1000];
scanf("%d",&p);
for(y=0;y<p;y++)
{
memset(a,0,1000*sizeof(char));
t=0;
scanf("%s",a);
n=strlen(a);
for(i=0;i<n;i++)
b[i]=0;
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(a[i]==a[j])
b[j]=b[j]+1;
}
}
for(i=0;i<n;i++)
{
if(b[i]==1)
{printf("%c\n",a[i]);
t=1;
break;}
}
if(t==0)
printf("no\n");
}
}
|
37
|
18483
|
main()
{
int a[26];
char c[26];
int n;
int i,j,k;
scanf("%d",&n);
for(i=1;i<=n;i++)
{
char b[100000];
scanf("%s",b);
for(j=0;j<=25;j++)
{
a[j]=0;
c[j]='0';
}
for(j=0;b[j]!='\0';j++)
{
for(k=0;k<=25;k++)
{
if(c[k]==b[j])
{
a[k]++;
break;
}
if(c[k]=='0')
{
c[k]=b[j];
a[k]++;
break;
}
}
}
for(j=0;j<=25;j++)
{
if(a[j]==1)
{
printf("%c\n",c[j]);
break;
}
}
if(j==26)
printf("no\n");
}
}
|
37
|
18484
|
int min(int x,int y)
{
if(x>=y) return y;
else return x;
}
int main()
{
int t,i;
scanf("%d",&t);
for(i=0;i<t;i++)
{
int b[100000]={0},a,j,k;
char s[100000];
scanf("%s",s);
a=strlen(s);
for(j=0;j<a;j++)
{
for(k=0;k<a;k++)
{
if(s[j]==s[k]) b[j]++;
}
}
for(j=0;j<a;j++)
{
if(b[j]==1)
{
printf("%c\n",s[j]);
break;
}
}
for(j=1;j<a;j++) b[0]=min(b[0],b[j]);
if(b[0]>1) printf("no\n");
}
}
|
37
|
18485
|
int main()
{
int a[26]={0};
char record[26];
char in[20000];
int num=0;
int t,flag;
cin>>t;
cin.get();
int len;
for (int i=0;i<t;i++)
{
memset(a,0,sizeof(a));
num=0;
cin.getline(in,20000);
len=strlen(in);
for (int i=0;i<len;i++)
{
if (a[in[i]-'a']==0)
{
record[num]=in[i],num++;
a[in[i]-'a']++;
}
else
{
a[in[i]-'a']++;
}
}
flag=0;
for (int i=0;i<num;i++)
{
if(a[record[i]-'a']==1)
{
cout<<record[i]<<endl;
flag=1;
break;
}
}
if (flag==0)
{
cout<<"no"<<endl;
}
}
return 0;}
|
37
|
18486
|
int main(){
int n,a[30],b[30];
char s[1000000];
cin>>n;
for(int i=0;i<n;i++){
cin>>s;
for(int i=0;i<26;i++){a[i]=0;b[i]=0;}
for(int i=0;s[i];i++){
int num=s[i]-'a';
if(!a[num]){
b[num]=i+1;
}
a[num]++;
}
int ans=-1,ansn=10000000;
for(int i=0;i<26;i++){
if(a[i]==1&&b[i]<ansn){
ans=i;
ansn=b[i];
}
}
if(a[ans]!=1)cout<<"no"<<endl;
else cout<<(char)(ans+'a')<<endl;
}
//cin>>n;
return 0;
}
|
37
|
18487
|
int main()
{
char s[100000];
int c[26]={0};
int i,l,t,j,b;
scanf("%d",&t);
getchar();
for(i=0;i<t;i++)
{
b=0;
gets(s);
l=strlen(s);
for(j=0;j<l;j++)
{
c[s[j]-'a']++;
}
for(j=0;j<l;j++)
{
if(c[s[j]-'a']==1)
{
printf("%c\n",s[j]);
b=1;
break;
}
}
memset(c,0,sizeof(c));
if(b!=1) printf("no\n");
}
return 0;
//????????
}
|
37
|
18488
|
char *s;
int main()
{
s = (char*)malloc(100000*sizeof(char));
long count[26],p[26];
int n;char cc;
char key='-';
int min=100001;
int i;
scanf("%d%c",&n,&cc);
while(n--){
gets(s);
for(i=0;i<26;i++){
count[i]=0;
p[i] = 100001;
}
for(i=0;i<strlen(s);i++){
count[*(s+i)-'a']++;
if(p[*(s+i)-'a']>i)
p[*(s+i)-'a']=i;
}
key='-';
min=100001;
for(i=0;i<26;i++){
if(count[i]==1 && p[i]<min){
key = 'a'+i;
min = p[i];
}
}
if(key=='-')
printf("no\n");
else
printf("%c\n",key);
}
return 0;
}
|
37
|
18489
|
//????????????
int main()
{
char a[100001]; // ??a?????
int count[26]; // ??count????
int i, j, t; // i,j??
cin >> t;
for (j = 1; j <= t; j++)
{
cin >> a;
memset(count, 0, sizeof(count)); // ????????
for (i = 0; a[i] != '\0'; i++)
count[a[i] - 'a']++; // ???????1
for (i = 0; a[i] != '\0'; i++)
if (count[a[i] - 'a'] == 1) // ??????????
{
cout << a[i] << endl;
break;
}
if (a[i] == '\0') // ???????????
cout << "no" << endl;
}
return 0;
}
|
37
|
18490
|
main()
{
int t,m,j,b[100001],k;
scanf("%d\n",&t);
for(j=0;j<100000;j++)
b[j]=1;
char str[100001];
for(int i=0;i<t;i++)
{
for(j=0;;j++)
{
scanf("%c",&str[j]);
if(str[j]=='\n')
break;
}
m=j;
for(j=0;j<m-1;j++)
{
for(k=j+1;k<m;k++)
{
if(str[j]==str[k])
{
b[j]=0;
b[k]=0;
}
}
}
for(j=0;j<m;j++)
{
if(b[j]==1)
{
printf("%c\n",str[j]);
break;
}
}
if(j==m)
printf("no\n");
for(j=0;j<100000;j++)
b[j]=1;
}
}
|
37
|
18491
|
//***********************************
//*???????????????? *
//*? ???? 1100062709 *
//*? ??2011.11.5 *
//***********************************
int main()
{
int t, i;
cin >> t;
for (i = 1; i <= t; i++)
{
int j, k, flag = 0, repeat = 0;
char str[100001];
cin >> str;
int length = strlen(str);
for (j = 0; j < length; j++)
{
for (k = 0; k < length; k++)
{
if (j == k)
continue;
else if (str[j] == str[k])
{
repeat = 1;
break;
}
}
if (!repeat)
{
cout << str[j] << endl;
flag = 1;
break;
}
repeat = 0;
}
if (!flag)
cout << "no" << endl;
}
return 0;
}
|
37
|
18492
|
int main()
{
int t,i,k,p,count=0,b=0;
char a[100][100000];
scanf("%d",&t);
for(i=0;i<t;i++)
{
gets(a[i]);
}
for(i=0;i<t+1;i++)
{
for(k=0;k<strlen(a[i]);k++)
{
for(p=0;p<strlen(a[i]);p++)
{
if(a[i][k]==a[i][p]&&k!=p)
{
count++;
}
}
if(count==0)
{
printf("%c\n",a[i][k]);
break;
}
else
{
b++;
}
count=0;
}
if(b==strlen(a[i])&&i!=0)
printf("no\n");
b=0;
}
return 0;
}
|
37
|
18493
|
int main()
{
int n;
cin>>n;
int i,j;
int count1=1,count2=0;
char thechar;
char str[100001];
while(n--){
memset(str,0,sizeof(str));
count1=1,count2=0;
cin>>str;
//cout<<str<<' '<<endl;
for(i=0;i<strlen(str);i++){
if(str[i]!='*'){
thechar=str[i];
//cout<<thechar<<endl;
for(j=i+1;j<strlen(str);j++)
if(str[j]==thechar){
count1++;
str[j]='*';
}
if(count1==1){
count2++;
cout<<thechar<<endl;
break;
}
}
count1=1;
}
if(count2==0)
cout<<"no"<<endl;
}
}
|
37
|
18494
|
int main()
{
int t, j, k, i, num[200]={0};
char a[1000], s[1000];
scanf("%d", &t);
for(i=0;i<t;i++)
{
scanf("%s", a);
int len=strlen(a);
for(j=0;j<len;j++)
{
num[a[j]]++;
}
for(j=0;j<len;j++)
{
if(num[a[j]]==1)
{
printf("%c", a[j]);
break;
}
}
if(j==len)
{
printf("no");
}
printf("\n");
memset(num,0,sizeof(num));
}
return 0;
}
|
37
|
18495
|
int main()
{
char str[100000];
int t, i, k, cnt = 0, flag1 = 0, flag2 = 0, a[100000];
cin >> t;
while(cnt < t)
{
memset(a, 0, sizeof(a));
cin >> str;
flag1 = 0, flag2 = 0;
int len = strlen(str);
a[0] = 1;
for(i = 1; i < len; i++)
{
for(k = 0; k < i; k++)
{
flag1 = 0;
if(str[i] == str[k])
{
a[k]++;
flag1 = 1;
break;
}
}
if(!flag1)
a[i]++;
}
for(i = 0; i < len; i++)
if(a[i] == 1)
{
cout << str[i] << endl;
flag2 = 1;
break;
}
if(!flag2)
cout << "no" << endl;
cnt++;
}
return 0;
}
|
37
|
18496
|
int main()
{
int t;
scanf("%d",&t);
char str[10][100000];
char (*p)[100000];
char *c;
char a[1];
gets(a);
int letter[26]={0};
int *count;
for (p=str;p<str+t;p++)
gets(*p);
for (p=str;p<str+t;p++)
{
for (c=*p;*c!=0;c++)
{
count=letter+*c-'a';
(*count)++;
}
for (c=*p;*c!=0;c++)
{
count=letter+*c-'a';
/*printf("%c %d\n",*c,*count);//for test*/
if (*count==1)
{
printf("%c\n",count-letter+'a');
break;
}
}
if (*c==0) printf("no\n");
for (count=letter;count<letter+26;count++)
*count=0;
}
return 0;
}
|
37
|
18497
|
int main()
{
char a[100001];
int t,n,i,j,k,p;
scanf("%d",&t);
for(i=0;i<t;i++)
{
int s[100001]={0};
scanf("%s",a);
n=strlen(a);
for(j=0;j<n;j++)
{
for(k=0;k<n;k++)
{
if(a[k]==a[j])
{
s[j]+=1;
}
}
}
for(p=0;p<n;p++)
{
if(s[p]==1)
{
printf("%c\n",a[p]);
break;
}
}
if(p==n)
{
printf("no\n");
}
}
return 0;
}
|
37
|
18498
|
void main()
{
int n,i,j,t,len,b[100][26]={0};
char a[100][10000];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",&a[i]);
}
for(i=0;i<n;i++)
{
t=0;
len=strlen(a[i]);
for(j=0;j<len;j++)
{
b[i][a[i][j]-48]++;
}
for(j=0;j<len;j++)
{
if(b[i][a[i][j]-48]==1)
{
printf("%c\n",a[i][j]);
t++;
break;
}
}
if(t==0)
{
printf("no\n");
}
}
}
|
37
|
18499
|
main()
{
int t,i,j,k;
char c[100000];
int a[26];
scanf("%d\n",&t);
for(i=0;i<t;i++)
{
int a[26]={0};
gets(c);
for(j=0;c[j]!='\0';j++)
{
switch(c[j])
{
case'a':a[0]++;break;
case'b':a[1]++;break;
case'c':a[2]++;break;
case'd':a[3]++;break;
case'e':a[4]++;break;
case'f':a[5]++;break;
case'g':a[6]++;break;
case'h':a[7]++;break;
case'i':a[8]++;break;
case'j':a[9]++;break;
case'k':a[10]++;break;
case'l':a[11]++;break;
case'm':a[12]++;break;
case'n':a[13]++;break;
case'o':a[14]++;break;
case'p':a[15]++;break;
case'q':a[16]++;break;
case'r':a[17]++;break;
case's':a[18]++;break;
case't':a[19]++;break;
case'u':a[20]++;break;
case'v':a[21]++;break;
case'w':a[22]++;break;
case'x':a[23]++;break;
case'y':a[24]++;break;
case'z':a[25]++;break;
}
}
for(j=0,k=0;c[j]!='\0';j++)
{
if(a[c[j]-97]==1)
{
printf("%c\n",c[j]);
k++;
break;
}
}
if(k==0)printf("no\n");
}
}
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.