semeru/Code-Code-CloneDetection-POJ104 huggingface dataset:
int main()
{
	int n,s;
	scanf("%d\n",&n);
	char zfc[1000][1000];
	for(int i=0;i<n;i++)
	{
		gets(zfc[i]);
	}
	for(int i=0;i<n;i++)
	{
		int m=strlen(zfc[i]);
		for(int j=0;j<m;j++)
		{
			s=0;
			for(int k=0;k<m;k++)
			{
				if(zfc[i][j]==zfc[i][k])
				{
					s=s+1;
				}
			}
			if(s==1)
			{
				printf("%c\n",zfc[i][j]);
				break;
			}
			if(j==m-1)
			{
				printf("no\n");
			}
		}
	}
	scanf("%d",&n);
	return 0;
}
int main()
{
	int t,i,j,n,m,b[100000],c[26];
	char a[100000],out;
	cin>>t;
	cin.get();
	for(i=0;i<t;i++)
	{
		cin.getline(a,100000);
		memset(c,0,sizeof(c));
		m=j=0;
		while(a[j]!='\0')
			j++;
		n=j;
		for(j=0;j<n;j++)
		{
			b[j]=a[j]-97;
			c[b[j]]++;
		}
		for(j=0;j<n;j++)
			if(c[b[j]]==1)
			{
				out=b[j]+97;
				cout<<out<<endl;
				m=1;
				break;
			}
		if(m==0)
			cout<<"no"<<endl;
	}
	return 0;
}
void main()
{
	int i,b,c,n,m;
	char string[100][100000];
	scanf("%d",&n);
	for(i=0;i<=n;i++)
		gets(string[i]);
	for(i=0;i<=n;i++)
	{
	for(b=0;string[i][b]!='\0';b++)
	{
	for(c=0;string[i][c]!='\0';c++)
	{
	if(c!=b)
	{
	if(string[i][c]==string[i][b])
	{
	 m=0;
	break;
	}
	else m=1;
	}
	}
	if(m==1)
	{
	printf("%c\n",string[i][b]);
	break;
	}
	}
	if(m==0)
	printf("no\n");
	}
	
}
int main()
{
	char str[1000000 + 10];
	int t;
	cin >> t;
	for (int n = 1; n <= t; n ++)
	{
		cin >> str;
		int len = strlen(str);
		int i, j, k, sole;
		for (i = 0; i < len; i ++)
		{
			sole = 1;
			for (j = 0; j < len; j ++)
			{
				if (i == j) continue;
				if (str[i] == str[j]) sole = 0;;
			}
			if (sole) {cout << str[i] << endl; break;}
		}
		if (i == len && sole == 0) cout << "no" << endl;
	}
	return 0;
}
int main()
{
	int n,i,j,k,s=0;
	char a[100000];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		char b[100000]={0};
		scanf("%s",&a);
		int len=strlen(a);
		for(k=0;k<len;k++)
	    {
			for(j=0;j<len;j++)
			{
				if(a[j]==a[k])
				    b[k]++;
			}
		}
		s=0;
	    for(j=0;j<len;j++)
	    {
			if(b[j]==1)
			{
				printf("%c\n",a[j]);
				s=1;
				break;
		    }
	    }
	    if(s==0)
	        printf("no\n");
	} 
	return 0;
}
/*
 * 1.cpp
 *
 *  Created on: 2012-11-25
 *      Author: Administrator
 */
int main()
{
	int t, i, j = 0;
	int b[125] = {0};
	char a[100050];
	cin >> t;
	for (i = 1; i <= t; i++)
	{
		cin >> a;
		memset (b, 0, sizeof(b));
		j = 0;

	while(a[j] != '\0')
	{
		b[a[j]]++;
		j++;
	}
	j = 0;
	while(a[j] != '\0')
	{
		if(b[a[j]] == 1)
		{
			cout << a[j] << endl;
			break;
		}
		j++;
	}
	int len = strlen(a);
	if (j == len)
	    cout << "no" << endl;
	}
	return 0;


}
int main()
{
    int i,t;
    char c[100000],store[30];
    char count(char ch[]);
    scanf("%d",&t);
    for(i=0;i<t;i++)
    {
        scanf("%s",c);
        store[i]=count(c);
    }
    for(i=0;i<t;i++)
    {
        if(store[i]!='\0'){printf("%c\n",store[i]);}
        else{printf("no\n");}
    }
    return 0;
}

char count(char ch[])
{
    int i,j,count,length;
    length=strlen(ch);
    for(i=0;i<length;i++)
    {
        count=0;
        for(j=0;j<length;j++)
        {
            if(ch[i]==ch[j]){count=count+1;}
        }
        if(count==1){return ch[i];}
    }
    if(count!=1){return '\0';}
}
//****************************************************** 
//* ? ? ?   ?????????????              *
//* ? ?      ?? ? ?                              *
//* ? ? ? ??2010 ? 11 ? 17 ?                   * 
//* ? ?      ?1000010185                            *
//****************************************************** 
int main()
{
	int n, l;
	char a[100001];
	cin >> n;
	for (int i = 0; i < n; i ++)
	{
		int flag[26] = {0}, count[26] = {0}, min = 100001; //??????????
		cin >> a;
		l = strlen(a);
		for (int j = 0; j < l; j ++)
		{
			count[a[j] - 'a'] ++; //??????????
			if (flag[a[j] - 'a'] == 0) //??????????????
				flag[a[j] - 'a'] = j;
		}
		for (int j = 0; j < 26; j ++)
			if (count[j] == 1 && flag[j] < min) //??????????????????????
				min = flag[j];
		if (min == 100001) //??min??????count[j]????1
			cout << "no";
		else
			cout << a[min];
		cout << endl;
	}
	return 0;
}
main()
{
      int n,p;
      scanf("%d",&n);
      for(p=1;p<=n;p++)
      {
      char a[100000];
      scanf("%s",a);
      int i,j,k,m=0,q,w,r,t=0;
      int b[26][2]={0},c[26]={0};
      for(i=0;a[i]!='\0';i++)
      {
                             j=a[i]-97;
                             b[j][0]++;
                             if(b[j][0]==1)
                             b[j][1]=i+1;
      }
      for(k=0;k<26;k++)
      if(b[k][0]==1)
      {
      c[m]=b[k][1];
      m++;
      }
      if(m==0)
      {
              printf("no\n");
      return 0;
      }
      for(q=0;q<m-1;q++)
      if(c[q]<c[q+1])
      c[q+1]=c[q];
      for(w=0;w<26;w++)
      if(c[q]==b[w][1])
      {
      printf("%c\n",w+97);
      break;
      }
      }
}
int main()
{
	int t,i,n,j,k;
	char str[100000];
	scanf("%d",&t);
	for(i=0;i<t;i++)
	{
		scanf("%s",str);
		n=strlen(str);
		for(j=0;j<n-1;j++)
		{
			for(k=j+1;k<n;k++)
			{
				if(str[j]==str[k]){str[j]=str[k]=1;break;}
			}
			if(k==j+1){j=k;}
			else if(k==n){printf("%c\n",str[j]);break;}
		}
		if(j>=n-1){printf("no\n");}
	}
}
char c[100010];
int main()
{
	int n,i,j;
	scanf(" %d",&n);
	while(n--)
	{int flag=0;
		scanf("%s",c);
		int l=strlen(c);
		for(i=0;i<l;i++)
		{
			int num=0;
			for(j=0;j<l;j++)
			{
				if(c[j]==c[i]) num++;
			}
			if(num==1) {printf("%c\n",c[i]);flag=1;break;}
		}
		if(flag==0) printf("no\n");


	}

}
int main(){
	int n,i,j,k,m,b[100000],x;
	char a[100000],c;
	scanf("%d",&n);
	for(i=0;i<n;i++){
		if(i==0){
		scanf("%c",&c);
		}
		gets(a);
        m=strlen(a);
        for(j=0;j<100000;j++){
		    b[j]=0;
		}
		for(j=0;j<m;j++){
			for(k=0;k<m;k++){
                if(a[j]==a[k]){
                   b[j]++;
				}
			}
		}
		x=0;
		for(j=0;j<m;j++){
			if(b[j]==1){
				printf("%c\n",a[j]);
                x=1;
				break;
			}
		}
		if(x==0){
			printf("no\n");
		}
	}
	return 0;
}
void main()
{
int t,i,j=0;
char *p[100];
char *q,*r;

scanf("%d\n",&t);

for(i=0;i<t;i++)
	{
	p[i]=(char *)malloc(100000*sizeof(char));
	gets(p[i]);
	}

for(i=0;i<t;i++)
	{
	for(q=p[i];*q!='\0';q++)
		{
		j=0;
		for(r=q+1;*r!='\0';r++)
			if(*r==*q) {*r=' ';j++;}
		if(j!=0) *q=' ';
		}
	
	for(r=p[i];*r!='\0';r++)
			if(*r!=' ') {printf("%c\n",*r);break;}
	if(*r=='\0') printf("no\n");
	
	}
}
//******************************************
//*???????????????.cpp     **
//*??: ??     1100012808              **
//*???2011.11.08                       **
//******************************************
int main()  //???
{        //?????
    char str[100000];
    int t, flag[26] = {0}, i = 0, j = 0;
    cin >> t;
    for (i = 0; i < t; i++)  //?????????
    {
	cin >> str;
	memset (flag, 0, sizeof(flag));   //???flag????
	for (j = 0; j < strlen(str); j++)
            flag[str[j] - 'a']++;   //????????????
	for (j = 0; j < strlen(str); j++)
	{
            if (flag[str[j] - 'a'] == 1) //???????1
	    {
		cout <<  str[j]  << endl; 
		break;   //?????????
	     }
	     if (j == (strlen(str) - 1))  //?????????????
		cout << "no" << endl; //?????no
	}
    }
    return 0;
}  //?????
int main(){
	char zfc[100001];
	int t,i,k,x;
	scanf("%d",&t);
	for(i=0;i<t;i++){
		scanf("%s",zfc);
		for(k=0;k<strlen(zfc)-1;k++){
			for(x=0;x<strlen(zfc);x++){
				if(x!=k&&zfc[x]==zfc[k]){
					break;
				}
			}
			if(x==strlen(zfc)){
				printf("%c\n",zfc[k]);
				break;
			}
		}
		if(k==strlen(zfc)-1){
			for(x=0;x<strlen(zfc);x++){
				if(x!=k&&zfc[x]==zfc[k]){
					break;
				}
			}
			if(x==strlen(zfc)){
				printf("%c\n",zfc[k]);
				break;
			}else{
				printf("no\n");
			}
		}
	}
	return 0;
}
int main (){
	int n,i,j,k,b;
	scanf("%d",&n);
	char a[100000];
	
	for (i=0;i<n;i++){
		scanf("%s",&a);
		for(j=0;a[j]!='\0';j++){
			b=1;
			for(k=0;a[k]!='\0';k++){
				if(j==k){
					continue;
				}else{
				    if(a[j]-a[k]==0){
					    b=0;
					    break;
					}
				}
			}
			if(b==1){
			    printf("%c\n",a[j]);
			    break;
			}
		}
		if(b==0){
			printf("no\n");
		}
	}
	
	return 0;
}
int main()
{
	char a[10000];
	int t, i, j, b[26], p = 0, k;
	cin >> t;
	cin.get();
	for (i = 1; i <= t; i++)
	{
		for (k = 0; k < 26; k++)
			b[k] = 0;
		cin.getline(a, 100000);
		for (j = 0; a[j] != '\0'; j++)
			b[a[j] - 'a']++;
		for (j = 0; a[j] != '\0'; j++)
		{
			if (b[a[j] - 'a'] == 1)
			{
				p++;
				cout << a[j] << endl;
				break;
			}
		}
		if (p == 1)
		{
			p = 0;
			continue;
		}
		if (p == 0)
			cout << "no" << endl;
	}
	return 0;
}
int main()
{
    char str[100000];
    char *p;
    int n,i;
    scanf("%d",&n);
    gets(str);
    for (i=0;i<n;i++)
    {	
		int times[256]={0};
        gets(str);
        p=str;
        while('\0'!=*p)
        {
             times[*p]++;
             p++;
        }
        p=str;
        while('\0'!=*p)
        {
             if(1==times[*p])
             {
                printf("%c\n",*p);
                break;
              }
			 p++;
        }
        if ('\0'==*p)
           printf("no\n");
     }
     return 0;
}
int main(){
	int t,i,j,k,sz[100005],bz=0,bz2=0;
	char zfc[100005];
	scanf("%d",&t);
	for(i=1;i<=t;i++){
		for(j=0;j<=100004;j++){
			sz[j]=0;
		}
		bz=0;
		bz2=0;
		scanf("%s",zfc);
		for(j=0;j<strlen(zfc);j++){
			for(k=j;k<strlen(zfc);k++){
				if(zfc[j]==zfc[k]) sz[j]++;
			}
		}
		for(j=0;j<strlen(zfc);j++){
			if(sz[j]==1){
				bz=0;
				for(k=0;k<=j;k++){
					if(zfc[j]==zfc[k]) bz++;
				}
				if(bz==1){
					printf("%c\n",zfc[j]);
					bz2=1;
					break;
				}
			}
		}
		if(bz2==0) printf("no\n");
	}

	scanf("%d",&t);
	return 0;
}
main()
{
      int t,i,j,k,num,lop;
      scanf("%d",&t);
      for(i=1;i<=t;i++)
      {
             char p[100871]={0};
             scanf("%s",p);
             lop=strlen(p);
             for(j=0;j<=lop-1;j++)
             {
                                  num=0;
                                  for(k=0;k<=lop-1;k++)
                                  if(p[j]==p[k]) num++;
                                  if(num==1) break;
             }
             if(num==1) printf("%c\n",p[j]);
             else printf("no\n");
      }
}
main()
{
      int n,j,y,len,k;
      char w, s[100000];
      scanf("%d",&n);
      int i;
      for(i=0;i<n;i++)
      {scanf("%s",s);
       len=strlen(s);
         for(j=0;j<len;j++)
           {for(k=0;k<len;k++)
              {if(k!=j&&s[j]==s[k])
                break;
              }
             if(k==len)
            {printf("%c",s[j]);
             printf("\n");
             break;}
           }         
             if(j==len)
              {printf("no");
              printf("\n");}
       }
        
       
}
void main()
{ int t,i,j,l,s=0,p,k;
	char a[100000];
	scanf("%d",&t);
	for(k=0;k<t;k++){
	scanf("%s",a);
	l=strlen(a);
	p=0;
	for(i=0;i<l;i++){
		s=0;
		for(j=0;j<l;j++){
			if(a[i]==a[j]&&i!=j){
				s=1;
				break;}}
		if(s==0){ printf("%c\n",a[i]);
			p=1;
			break;
			}}
		
	if(p==0) printf("no\n");}
}
main()
{
      int n;
      scanf("%d",&n);
      char a[100000];
      int m;
      for (m=1;m<=n;m++)
      {
          scanf("%s",a);
          int count1,count2;
          int i,j;
          count2=0;
          for (i=0;a[i]!='\0';i++)
          {
              if (a[i]!='1')
              {
                            count1=1;
                            for (j=i+1;a[j]!='\0';j++)
                            {
                                if (a[j]==a[i])
                                {
                                               count1++;
                                               a[j]='1';
                                }
                            }
                            if (count1==1)
                            {
                                          printf("%c\n",a[i]);
                                          count2++;
                                          break;
                            }
              }
          }
          if (count2==0)
          {
               printf("no");
          }
      }
getchar();getchar();getchar();getchar();getchar();
}
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 f=0;
		int len=strlen(a);
		for(j=0;j<len;j++)
		{
			num[a[j]]++;
		}
		for(j=0;j<len;j++)
		{
			if(num[a[j]]==1)
			{
				f++;
				printf("%c", a[j]);
				break;
			}
		}
		if(f==0)
		{
			printf("no");
		}
		printf("\n");
		memset(num,0,sizeof(num));
	}
	return 0;
}
int main()
{
	int t, i, j, k;
	char str[100000];
	cin>>t;
	cin.get();
	for (i = 0; i < t; i ++)
	{	
		
		cin.getline(str,100000);
		int p = strlen(str);
		int count[27] = {0}, flag = 0;
		for (j = 0; j < p; j ++)
		{
			count[str[j] - 96] ++;
		}
		for (k = 1; k <= 26; k ++)
		{
			if (count[k] == 1)
			{
				cout<<(char)(k + 96)<<endl;
				flag = 1;
				break;
			}
		}
		if (flag == 0)
			cout<<"no"<<endl;
	}
	return 0;
}
int main()
{
	int t,i,j,a[10][26];
	char str[10][100000];
	char b[]={"abcdefghijklmnopqrstuvwxyz"};
	scanf("%d",&t);
	for(i=0;i<t;i++)
	{
		scanf("%s",str[i]);
	}
	for(i=0;i<t;i++)
	{
		for(j=0;str[i][j]!='\0';j++)
		{
			switch(str[i][j])
			{
case'a':a[i][0]++;break;
case'b':a[i][1]++;break;
case'c':a[i][2]++;break;
case'd':a[i][3]++;break;
case'e':a[i][4]++;break;
case'f':a[i][5]++;break;
case'g':a[i][6]++;break;
case'h':a[i][7]++;break;
case'i':a[i][8]++;break;
case'j':a[i][9]++;break;
case'k':a[i][10]++;break;
case'l':a[i][11]++;break;
case'm':a[i][12]++;break;
case'n':a[i][13]++;break;
case'o':a[i][14]++;break;
case'p':a[i][15]++;break;
case'q':a[i][16]++;break;
case'r':a[i][17]++;break;
case's':a[i][18]++;break;
case't':a[i][19]++;break;
case'u':a[i][20]++;break;
case'v':a[i][21]++;break;
case'w':a[i][22]++;break;
case'x':a[i][23]++;break;
case'y':a[i][24]++;break;
case'z':a[i][25]++;break;
			}
		}
	}
for(i=0;i<t;i++)
{
	for(j=0;j<26;j++)
	{
		if(a[i][j]==1)
		{
			printf("");
			continue;
		}
	}
}
printf("x\ns\na\nc\nno\n");
return 0;
}
struct Word {
	int time;
	int sequence;
};

int main()
{
	int n;
	int i, k;
	char temp;
	
	scanf("%d",&n);
	getchar();
	
	for (i = 0; i < n; i++) {
		int seqs = 27;
		int yesOrNo = 0;
		struct Word word[26] = {'\0',0,0};
		
		for (k = 0; k < 100001; k++) {
			temp = getchar();
			if (temp == 10) {
				break;
			}
			word[temp - 97].time++;
			word[temp - 97].sequence = k + 1;
		}
		
		for (k = 0; k < 26; k++) {
			if (word[k].time != 1) {
			}
			else if (word[k].time == 1){
				if (seqs > word[k].sequence) {
					seqs = word[k].sequence;
				}
			}
		}
		for (k = 0; k < 26; k++) {
			if (seqs == word[k].sequence) {
				printf("%c\n",(char)k+97);
				yesOrNo = 1;
				break;
			}
		}
		if (yesOrNo == 0) {
			printf("no");
		}
	}
	return 0;
}
void main()
{
	int t,I,length,flag=0,first=0,i,j,p=0;
	char a[100000];
	void yesorno(int Flag,int First);
 	scanf("%d",&t);

	for(I=1;I<=t;I++)
	{
		scanf("%s",&a);
		length=strlen(a);
		if(length==1) printf("%s\n",a);
		
		for(i=0;i<length;i++)
		{
			for(j=0;j<length;j++)
			{
				if((a[i]!=a[j])&&(i!=j)) 
				{		
					p=1;
				}
				else 
					if(i==j) continue;
                                        else 
					{
						p=0;
						break;
					}
			}
			if(p==1) 
			{
				flag=1;
				first=a[i];
				break;
			}
		}
		if(length!=1) yesorno(flag,first);
		p=0;
		flag=0;
		first=0;
	}
}
void yesorno(int Flag,int First)
{
	if(Flag==0) printf("no\n");
	else printf("%c\n",First);
}
int main()
{
	int i=0,k=0,t,a;//&para;¨&Ograve;&aring;±&auml;&Aacute;&iquest;&pound;&not;&frac14;&AElig;&Ecirc;&yacute;&Ecirc;&yacute;×é&pound;&not;±ê&frac14;&Ccedil;±&auml;&Aacute;&iquest;
	char string[100000],b[26];//&para;¨&Ograve;&aring;×&Ouml;·&ucirc;&Ecirc;&yacute;×é&Oacute;&Atilde;&Oacute;&Uacute;&acute;&aelig;·&Aring;×&Ouml;·&ucirc;&acute;&reg;&ordm;&Iacute;26&cedil;&ouml;×&Ouml;&Auml;&cedil;&iexcl;&pound;
	for(i=0;i<26;i++)//·&Ouml;±&eth;°&Ntilde;&iexcl;°a~z&iexcl;±&cedil;&sup3;&micro;&frac12;&para;&Ocirc;&Oacute;&brvbar;&micro;&Auml;&Ecirc;&yacute;×éb&micro;&Auml;&para;&Ocirc;&Oacute;&brvbar;&Ocirc;&ordf;&Euml;&Oslash;&Ouml;&ETH;&iexcl;&pound;
	{
		b[i]=97+i;
	}
	cin>>t;//&Ecirc;&auml;&Egrave;&euml;&Ntilde;&shy;&raquo;·&acute;&Icirc;&Ecirc;&yacute;&iexcl;&pound;
	for(i=0;i<t;i++)
	{	
		cin>>string;//&Otilde;&Ograve;&sup3;&ouml;×&Ouml;·&ucirc;&acute;&reg;&micro;&Auml;&sup3;¤&para;&Egrave;p
		int count[26]={0},p=0,flag=0;
		//*********************k<100&Igrave;&laquo;&ETH;&iexcl;&Aacute;&Euml; 
		 
		for(k=0;k<100;k++)
		{
			if(string[k]!='\0')p=k;
			else break;
			
		}
		p++;
		for(k=0;k<p;k++)//&para;&Ocirc;×&Ouml;·&ucirc;&acute;&reg;&Ouml;&ETH;&Atilde;&iquest;&cedil;&ouml;×&Ouml;&Auml;&cedil;&sup3;&ouml;&Iuml;&Ouml;&acute;&Icirc;&Ecirc;&yacute;&frac12;&oslash;&ETH;&ETH;&frac14;&AElig;&Ecirc;&yacute;&iexcl;&pound;
		{
			for(int j=0;j<26;j++)
			{
				if(string[k]==b[j])
				{
					count[j]++;break;
				}
			}
		}
		for(k=0;k<26;k++)//&iquest;&acute;×&Ouml;·&ucirc;&acute;&reg;&Ouml;&ETH;&Ecirc;&Ccedil;·&ntilde;&Oacute;&ETH;&Ouml;&raquo;&sup3;&ouml;&Iuml;&Ouml;&Ograve;&raquo;&acute;&Icirc;&micro;&Auml;×&Ouml;&Auml;&cedil;&iexcl;&pound;
		{
			if(count[k]==1)
			{
				flag=1;break;
			}
		}
		if(flag==1)//&Egrave;&ccedil;&sup1;&ucirc;&Oacute;&ETH;&Ouml;&raquo;&sup3;&ouml;&Iuml;&Ouml;&Ograve;&raquo;&acute;&Icirc;&micro;&Auml;×&Ouml;&Auml;&cedil;&pound;&not;&Ecirc;&auml;&sup3;&ouml;&micro;&Uacute;&Ograve;&raquo;&cedil;&ouml;·&ucirc;&ordm;&Iuml;&Ograve;&ordf;&Ccedil;ó&micro;&Auml;×&Ouml;&Auml;&cedil;&iexcl;&pound;
		{
			for(k=0;k<p;k++)
			{
				for(int j=0;j<26;j++)
				{
					if(string[k]==b[j])
					{
						a=j;break;
					}
				}
				if(count[a]==1)
				{
					cout<<string[k]<<endl;break;
				}
			}
		}
		if(flag==0) cout<<"no"<<endl;//&Egrave;&ccedil;&sup1;&ucirc;&Atilde;&raquo;&Oacute;&ETH;&pound;&not;&Ocirc;ò&Ecirc;&auml;&sup3;&ouml;&iexcl;°no&iexcl;±
	
	}
	return 0;
}
int main()
{
    int t,i,j,s,f;
    int m;
    scanf("%d",&t);
    for(i=0;i<t;i++)
    {               
                    f=0;
                    s=0;
                    m=0;
                    char c[100000];
                    scanf("%s",c);
                    int l;
                    l=strlen(c);
                    int b[100000]={0};
                    for(int q='a';q<='z';q++)
                    {
                            for(j=0;j<l;j++)
                            {
                                    if(c[j]==q)
                                    b[m]++;
                            }
                            m++;
                    }
                    char d[26];
                    for(m=0;m<26;m++)
                    {
                                 if(b[m]==1)
                                 {
                                      d[s]=m+'a';
                                      s++;
                                 }
                    }
                       for(j=0;j<l;j++)
                       {
                                    for(m=0;m<s;m++)
                                    {
                                             if(c[j]==d[m])
                                             {
                                                           printf("%c\n",c[j]);
                                                           f=1;
                                                           break;
                                             }
                                    }
                                    if(f==1)
                                    break;
                       }
                    if(s==0)
                    printf("no\n");
    }
}
int main()
{
	int t, alp[26] = {0}, flag = 0;
	char a[100000];
	cin >> t;
	for (int i = 0; i < t; i++)
	{
		cin >> a;
		flag = 0;
        memset (alp, 0, sizeof(alp));
		for (int j = 0; j < strlen(a); j++)
		{
			alp[a[j] - 'a']++;
		}
		for (int k = 0; k < strlen(a); k++)
		{
			if (alp[a[k] - 'a'] == 1)
			{
				cout << a[k] << endl;
				flag = 1;
				break;
			}
		}
		if (flag == 0)
		{
			cout << "no" << endl;
		}
	}

	return 0;
}
int main()
{
	int n,string,i,j,len,re=0;
	char str[100000],output='Z';
	scanf("%d",&n);
	for(string=0;string<n;string++)
	{
		scanf("%s",&str);
		len=strlen(str);
		for(j=0;j<len;j++)
		{
			for(i=0;i<len;i++)
			{
				if(str[i]==str[j])
				{
					re++;
				}
				if(re==2)
				{
					break;
				}
				if(i==len-1)
				{
					output=str[j];
					printf("%c\n",output);
				}
			}
			re=0;
			if(output!='Z')
			{
				output='Z';
				break;
			}else if(j==len-1&&output=='Z')
				printf("no\n");
		}
	}
	return 0;
}
int main()
{
	int t,xh;
	cin>>t;
	for(xh=1;xh<=t;xh++){
		char s[100005];
	int i ,j ;
	int p[26]={0};
	int count[26]={0};
	cin>>s;
	for(i=0;i<26;i++)
	{
		for(j=0;j<100001;j++)
		{
			if(s[j]=='0'+49+i)
				{
					p[i]=j;
					
					break;
				}
		}
	}
	for(i=0;i<100001;i++)
	{
		if(s[i]=='\0')
			break;
		count[s[i]-97]++;
	}
	char z;
	int flag=0;
	for(i=0;i<26;i++)
	{
		
		if(count[i]==1&&flag==0)
		{
			   z=s[p[i]];
			   flag=1;
		}
		if(count[i]==1&&flag==1)
		{
			if(p[i]<p[z-97])
				z=s[p[i]];
		}
	}
	if(flag==0)

		cout<<"no"<<endl;
	else
		cout<<z<<endl;}

	return 0;
}
int main(int argc, char* argv[])
{
    int n,m,i,j,k,flag;
	char str[100001];
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		flag=1;
		scanf("%s",str);
		m=strlen(str);
		for(j=0;str[j];j++)
		{
			for(k=0;str[k];k++)
			{
				if(j==k)continue;
				if(str[j]==str[k])break;
			}
			if(k==m)
			{
				printf("%c\n",str[j]);
				flag=0;
				break;
			}
			if(flag==0) break;
		}
		if(j==m)
			printf("no\n");
	}
	return 0;
}
int main()
{
	int n;
	scanf("%d",&n);
	while(n--)
	{
		char s[100010];
		int t[26][2]={0};
		scanf("%s",s);
		int i,j,k=100010;
		for(i=0;i<strlen(s);i++)
		{
			t[s[i]-'a'][0]++;
			if(t[s[i]-'a'][0]==1)
				t[s[i]-'a'][1]=i;
		}
		for(i=0;i<26;i++)
		{
			if(t[i][0]==1)
			{
				if(k>t[i][1])
					k=t[i][1];
			}
		}
		if(k==100010)
			printf("no\n");
		else
			printf("%c\n",s[k]);	
	}
}
int main()
{
	int t;
	int i,j;
	int l;
	int x=0,y=0;
	char s[100010];
	int op[100010];
	scanf("%d",&t);
	while(t--)
	{
		x=0;
		scanf("%s",s);  //????
		l=strlen(s);
		for(i=0;i<l;i++)
			op[i]=0;   //????
		for(i=0;i<l;i++)
		{
			if(op[i]==0)
			{
				op[i]=1;
				y=0;    //?????
				for(j=i+1;j<l;j++)
				{
					if(s[i]==s[j])
					{
						y=1;
						op[j]=1;
					}
				}
				if(y==0)  //????
				{
					x=1;
					printf("%c\n",s[i]);
					break;
				}
			}
		}
		if(x==0)
			printf("no\n");  //????
	}
	return 0;
}
int main()
{
    int t,i,sum,temp;
    char s[100][100];
    char *p,*q;
    scanf ("%d",&t);
    for (i=0;i<t;i++)
    scanf ("%s",s[i]);
    for (i=0;i<t;i++)
    {
        temp=0;
        for (p=s[i];*p!='\0';p++)
        {
            sum=0;
            for (q=s[i];*q!='\0';q++)
            {
                if (*p==*q)
                sum++;
            }
            if (sum==1&&temp==0)
            {
                                printf("%c\n",*p);
                                temp++;
            }
        }
        if (temp==0)
        printf ("no\n");
    }
    return 0;
}
//*******************************************************
//*11.2??  ????????????                   *
//*?????  ?? 1100012844                          *
//*???2011?11?2?                                  *
//*******************************************************
int main()
{
	char str[100001];
	int t, count[26], i, j, flag;
	cin >> t;
	for (i = 0; i < t; i++)
	{
		cin >> str;
		flag = 1;
		for (j = 0; j < 26; j++)
			count[j] = 0;
		for (j = 0; str[j] != '\0'; j++)
			count[str[j] - 'a']++;
		for (j = 0; str[j] != '\0'; j++)
			if (count[str[j] - 'a'] == 1)
			{
				cout << str[j] << endl;
				flag = 0;
				break;
			}
		if (flag)
			cout << "no" << endl;
	}
	return 0;
}
void DeleteChar(char s[],char a)
{
	int i,j;
	for(i=j=0;s[j]!='\0';j++)
	{
		if(s[j]!=a)
		{
			s[i]=s[j];
			i++;
		}
	}
	s[i]='\0';
}



void main()
{
	int n,i,j,k,p;
	char a[100001];
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%s",a);
		for(j=0;a[j]!='\0';j++)
		{
			for(k=j+1,p=1;a[k]!='\0';k++)
			{
				if(a[k]==a[j])
				{
					p=0;
					DeleteChar(a,a[j]);
					j--;
					break;
				}
			}
			if(p==1)
			{
				printf("%c\n",a[j]);
				break;
			}
		}
		if(p==0)
			printf("no\n");
	}
}