id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
18,300 | int main()
{
int t,i,j,l;
char s[100000];
scanf("%d",&t);
for(i=0;i<t;i++)
{
char yici[100000]={'0'};
scanf("%s",s);
int len=strlen(s);
int a=0;
for(j=0;s[j];j++)
{
int k=0;
while(k<j)
{
if(s[k]==s[j])
{
break;
}
k++;
}
if(k==j)
{
for(l=len-1;l>j;l--)
{
if(s[l]==s[j])
{
break;
}
}
if(l==j)
{
yici[a]=s[j];
a++;
}
}
}
if(yici[0]=='0')
{
printf("no\n");
}
else
{
printf("%c\n",yici[0]);
}
}
return 0;
}
| 37 |
18,301 | 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 |
18,302 | main()
{
int t,i,l,j;
char string[100000];
int count[26];
scanf("%d",&t);
for(int m=0;m<t;m++)
{
int count[26]={0};
scanf("%s",string);
l=strlen(string);
for(j=0;j<l;j++)
{
for(i=0;i<26;i++)
{
if(string[j]==i+'a')
count[i]++;
}
}
for(j=0;j<l;j++)
{
if(count[string[j]-'a']==1)
{
printf("%c\n",string[j]);
break;
}
}
if(j==l)
printf("no\n");
}
getchar();
getchar();
} | 37 |
18,303 | 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 |
18,304 | int main()
{
int n,i,j,k;
char s[10][100];
scanf("%d",&n);
for(j=0;j<n;j++){
int num[26]={0},m[26],t=100000;
scanf("%s",s[j]);
for(i=strlen(s[j])-1;i>-1;i--){
k=s[j][i]-97;
num[k]++;
if(num[k]==1)
m[k]=i;
}
for(k=0;k<26;k++){
if(num[k]==1)
if(m[k]<=t)
t=m[k];
}
if(t<100000)
printf("%c\n",s[j][t]);
else
printf("no\n");
}
} | 37 |
18,305 | int main ()
{
int t,l,a,b;
char string[100001];
int i=0,j=0,c=0,d=0;
scanf("%d",&t);
scanf("\n");
while(t--)
{
gets(string);
l=strlen(string);
c = 0;
for(a=0;a<l;a++)
{
i=0;
j=0;
while(i<l)
{
if(string[a]!=string[i] && a!=i)
{
j++;
}
i++;
}
if(j==l-1)
{
c=c+1;
printf("%c\n",string[a]);
break;
}
}
if (c==0)
{
printf("no\n");
}
}
return 0;
}
| 37 |
18,306 | main()
{
char a[100000];
int b,c,d,e,f,h;
int g[100000];
scanf("%d",&b);
for(c=0;c<b;c++)
{
for(h=0;h<100000;h++)
g[h]=0;
scanf("%s",a);
e=strlen(a);
for(d=0;d<e-1;d++)
{
for(f=d+1;f<e;f++)
{
if(a[f]==a[d])
{
g[f]++;
g[d]++;
}
}
if(f==e&&g[d]==0)
{
printf("%c\n",a[d]);
break;
}
}
if(d==e-1)
printf("no\n");
}
} | 37 |
18,307 | int main()
{ int i,j,n,c,d,a[26]={0};
int *p1;
char b[100001];
char *p2;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{gets(b);
p1=a;
for(j=0;j<26;j++)
*(p1+j)=0;
j=0;
p2=b;
while (*(p2+j)!='\0')
{d=*(p1+*(p2+j)-97);
d++;
*(p1+*(p2+j)-97)=d;
j++;
}
j=0;c=0;
while (*(p2+j)!='\0')
{if(*(p1+*(p2+j)-97)==1) {printf("%c\n",*(p2+j));c=1;break;}
j++;
}
if(c==0) printf("no\n");
}
return 0;
} | 37 |
18,308 | //???2010?11?17?
//???1000010586_???
//???????????????
int main()
{
int t , len , k , j;
char str[100][100001] ;
cin >> t;
for ( int m = 0 ; m <= t - 1 ; m ++ )
{
cin >> str[m];
}
for ( int i = 0 ; i <= t - 1 ; i ++ )
{
len = strlen( str[i] );
for ( j = 0 ; j <= len - 1 ; j ++ )
{
for ( k = 0 ; k <= len - 1 ; k ++ )
{
if ( str[i][j] == str[i][k] && j != k ) break;
}
if ( k == len )
{
cout << str[i][j] << endl;
break;
}
}
if ( j == len )
cout << "no" << endl;
}
return 0;
}
| 37 |
18,309 | int main()
{
int n,i,j,k,m,t,l;
char a[100][1000];
scanf("%d\n",&n);
for(i=0;i<n;i++){
gets(a[i]);
}
for(i=0;i<n;i++){
l=-1;
t=strlen(a[i]);
for(j=0;j<t;j++){
m=1;
for(k=0;k<t;k++){
if(k!=j&&a[i][j]==a[i][k]){
m=0;
}
}
if(m==1){
l+=1;
printf("%c\n",a[i][j]);
break;
}
}
if(l==-1){
printf("no\n");
}
}
return 0;
} | 37 |
18,310 | //****************************************
//*??: ???????????? **
//*????? 1100012816 **
//*???2011.11.8 **
//****************************************
int main()//???
{//?????
int t,i,j,k,num[100000] = {0},flag = 0;//????
char str[100000];//???????????
cin >> t;//??????????
cin.get();//??cin????
for(i = 1;i <= t;i++)
{
cin.getline(str,100000);//???????
for(j = 0;j < strlen(str);j++)//?????????????????????????
{
for(k = 0;k < strlen(str);k++)
{
if(str[j] == str[k])//??????
{
num[j]++;//????????
}
}
}
for(j = 0;j < strlen(str);j++)
{
if(num[j] == 1)//???????????????????????????????????
{
cout << str[j] << endl;//?????
flag = 1;//???flag?1
}
if(flag == 1)//??flag?1?????????????????
break;
}
if(flag == 0)//??flag?0??????????????
cout << "no" << endl;//??no
flag = 0;//flag??
memset(num,0,sizeof(num));//??????
}
return 0;
}//????? | 37 |
18,311 | void main()
{
int t,i,j,k,e,sum=0;
char *str=(char*)malloc(200*sizeof(char));
gets(str);
t=atoi(str);
char *p[100];
for(i=0;i<t;i++)
p[i]=(char *)malloc(sizeof(char)*100001);
for(i=0;i<t;i++)
gets(p[i]);
i=0;
loop:for(;i<t;i++)
{e=strlen(p[i]);
for(j=0;j<e;j++)
{
for(k=0;k<e;k++)
if(*(*(p+i)+j)==*(*(p+i)+k)&&j!=k)
sum=1;
if(sum==0)
{printf("%c\n",*(*(p+i)+j));
i++;
goto loop;}
sum=0;
}
printf("no");
printf("\n");
}
} | 37 |
18,312 | int main()
{
char str[100001];
int i,t,len,j,h,m,c;
scanf("%d",&t);
for(i=0;i<t;i++)
{
scanf("%s",str);
len=strlen(str);
for(j=0,c=0;j<len;j++)
{
m=0;
for(h=0;h<len;h++)
{
if(str[j]==str[h]&&h!=j)
{m++;}
}
if(m==0)
{printf("%c\n",str[j]);
break;}
else
{c++;}
}
if(c==len)
{
printf("no\n");
}
}
return 0;
}
| 37 |
18,313 |
main()
{
int n,k;
scanf("%d",&n);
for(k=0;k<n;k++)
{
int p=0,i,j,m=0,q=0;
char a[100010];
scanf("%s",a);
for(i=0;a[i]!=0;i++)
p++;
for(i=0;i<p;i++)
{
for(j=0;j<p;j++)
{
if(a[i]!=a[j])
m++;
}
if(m==p-1)
{printf("%c\n",a[i]);
break;}
else
{m=0;
q++;}
}
if(q==p)
printf("no\n");}
}
| 37 |
18,314 | 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;
}
| 37 |
18,315 | char s[100001];
int bucket[26];
int t, i, j, k, len;
int main(void)
{
scanf("%d", &t);
for(i=0;i<t;i++)
{
for(k=0;k<26;k++)bucket[k]=0;
scanf("%s", s);
while(s[j]!='\0')
{
bucket[s[j]-'a']++;
j++;
}
len=j;
j=0;
while(s[j]!='\0')
if(bucket[s[j]-'a']==1)
{
printf("%c\n", s[j]);
break;
}
else j++;
if(j==len)printf("no\n");
j=0;
}
return 0;
}
| 37 |
18,316 | int main()
{
int n,i,j,l,k;
char M[100][10000];
cin>>n;
for ( i=0 ; i<n ; i++ )
{
cin>>M[i];
l=strlen(M[i]);
for ( j=0 ; j<l ; j++ )
{
for ( k=0 ; k<l ; k++ )
{
if ( M[i][k]==M[i][j]&&k!=j )
break;
}
if ( k==l )
{
cout<<M[i][j]<<endl;
break;
}
}
if ( j==l )
cout<<"no"<<endl;
}
return 0;
} | 37 |
18,317 | //**************************************
//???????????????? *
//?????? *
//???2011.11.3 *
//**************************************
int main()
{
int t, i, j, k, num = 0, flag = 0;
char a[10][100000];
cin >> t;
for (i = 0; i < t; i++)
cin >> a[i];
for (i = 0; i < t; i++)
{
flag = 0;
for (j = 0; a[i][j] != '\0' ; j++)
{
for (k = j+1; a[i][k] != '\0' ; k++)
{
if(a[i][k] == a[i][j])
{
num = 1;
a[i][k] = ' ';
}
}
if ((num == 0) && (a[i][j] != ' '))
{
cout << a[i][j] << endl;
flag = 1;
break;
}
num = 0;
}
if (flag == 0)
cout << "no" << endl;
}
return 0;
} | 37 |
18,318 | int main()
{
int i,n,k,j;
scanf("%d",&n);
char zfc[100001];
for(i=0;i<n;i++)
{
scanf("%s",zfc);
for(k=0;zfc[k];k++)
{
for(j=0;zfc[j];j++)
{
if(zfc[k]==zfc[j]&&k!=j)
{
break;
}
}
if(zfc[j]=='\0')
{
printf("%c\n",zfc[k]);
break;
}
}
if(zfc[k]=='\0')
{
printf("no\n");
}
}
return 0;
}
| 37 |
18,319 | int main()
{
int n,i,j,k,ls,num,z[100];
char s[200],x[100];
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",s);
ls=strlen(s);
for(j=0;j<ls-1;j++)
{
num=0;
for(k=j+1;k<ls;k++)
if(s[k]==s[j] && s[j]!='!')
{
s[k]='!';
num++;
}
if(num==0 && s[j]!='!')break;
}
if(num!=0)z[i]=1;
else{
x[i]=s[j];
z[i]=0;
}
}
for(i=0;i<n;i++)
if(z[i]!=1)printf("%c\n",x[i]);
else printf("no\n");
return 0;
}
| 37 |
18,320 | void sword(void);
int main(void)
{
int love;
scanf("%d\n",&love);
int t;
for(t=0;t<love;t++){
sword();
}
return 0;
}
void sword(void)
{
char fib[10000];
gets(fib);
char haha='a';
int length;
length=strlen(fib);
int counter[26];
int loc[26]={0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0};
int i;
char j;
for(j=0;j<26;j++){
counter[j]=0;
for(i=0;i<length;i++)
{
if(fib[i]==97+j)
{
if(loc[j]==0){
loc[j]=i+1;(counter[j])++;}
else
(counter[j])++;}
}}
int min=length;
for(j=0;j<26;j++){
if(loc[j]<min && loc[j]!=0 && counter[j]==1)
min=loc[j];}
int miao=0;
for(j=0;j<26;j++){
if(counter[j]==1 && loc[j]==min){
printf("%c\n",haha+j);miao++;}
}
if(miao==0)
printf("no\n");
}
| 37 |
18,321 | //***********************************
//**??????? **
//**?????? 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 |
18,322 | int main()
{
int t, i, j, k, tf, num;
char su[100000];
char ch[26] = {'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z'};
cin >> t;
cin.get();
for (i = 0; i < t; i++)
{
cin.getline (su, 100000);
tf = 0;
for (j = 0; j < 26 ; j++)
{
num = 0;
for (k = 0; ; k++)
{
if (su[k] == ch[j])
num = num + 1;
if (su[k] == '\0')
break;
}
if (num == 1)
{
cout << ch[j] << endl;
tf = 1;
break;
}
}
if (tf == 0)
cout << "no" << endl;
}
return 0;
} | 37 |
18,323 | main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
char a[100000];
scanf("%s",a);
int s=0,t,l,j,k;
l=strlen(a);
for(j=0;j<l;j++)
{
t=0;
for(k=0;k<l;k++)
if(a[j]==a[k]) t++;
if(t==1)
{printf("%c\n",a[j]);
break;}
s++;
}
if(s==l) printf("no\n");
}
} | 37 |
18,324 | 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 |
18,325 | int main()
{
int i,j,k,t,n,a[100000];
char str[100000];
scanf("%d",&t);
for(i=0;i<t;i++)
{
//gets(str);
scanf("%s",str);
n=strlen(str);
for(j=0;j<n;j++)a[j]=0;
for(j=0;j<n;j++)
for(k=0;k<n;k++)
if(str[j]==str[k])a[j]++;
for(j=0;j<n;j++)if(a[j]==1)break;
if(j==n)printf("no\n");
else printf("%c\n",str[j]);
}
return 0;
}
| 37 |
18,326 | main()
{
int sn[128];
for(int i='a';i<='z';i++) sn[i] = i;
char ns[27]="abcdefghijklmnopqrstuvwxyz";
int n;
scanf("%d",&n);
for(int t=0;t<n;t++)
{
char s[100000];
scanf("%s",s);
int len = strlen(s);
int i=0;
int a[26]={0};
int sort[26]={0};
int cixu=0;
for(int j=0;j<len;j++)
{
for(i='a';i<='z';i++)
{
if(sn[s[j]]==i)
{
a[i-'a']++;
if(a[i-'a']==1)
{
cixu++;
sort[i-'a'] = cixu;
}
break;
}
}
}
int first=27;
int temp=0;
for(i='a';i<='z';i++)
{
if(a[i-'a']==1)
{
if(sort[i-'a']<first)
{
first = sort[i-'a'];
temp = i-'a';
}
}
}
if(t!=n-1)
if(first==27) printf("no\n");
else printf("%c\n",ns[temp]);
else
if(first==27) printf("no");
else printf("%c",ns[temp]);
}
}
| 37 |
18,327 | int main()
{
int n,i,j,k,e,js,t;
char s[100001];
scanf("%d",&n);
for(i=0;i<n;i++)
{
t=0;
scanf("%s",s);
e=strlen(s);
int zifu[100001]={0};
for(j=0;j<e-1;j++)
{
js=1;
for(k=j+1;k<e;k++)
{
if(s[j]==s[k])
{
zifu[j]=js;
zifu[k]=js;
}
}
}
for(j=0;j<e;j++)
{
if(zifu[j]==0)
{
printf("%c\n",s[j]);
t=1;
break;
}
}
if(t==0)
{
printf("no\n");
}
}
return 0;
} | 37 |
18,328 |
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 |
18,329 |
int main()
{
int t,i,j,k,n,num=0,m,mmin,times=0;
char s[100000];
scanf("%d",&t);
getchar();
for(i=0;i<t;i++){
gets(s);
n=strlen(s);
mmin=n;
times=0;
for(j='a';j<='z';j++){
for(k=0;k<n;k++){
if(s[k]==j){
num++;
}
}
if(num==1){
times++;
for(k=0;k<n;k++){
if(s[k]==j){
m=k;
break;
}
}
if(m<mmin){
mmin=m;
}
}
num=0;
}
if(times==0){
printf("no\n");
}
else{
printf("%c\n",s[mmin]);
}
}
return 0;
} | 37 |
18,330 | int main(){
char m[34];
int n;
gets(m);
printf("x\n");
printf("s\n");
printf("a\n");
printf("c\n");
printf("no\n");
return 0;
} | 37 |
18,331 | main()
{
int t;
scanf("%d",&t);
char a[100000];
int b[100000];
for(int i=0;i<t;i++)
{
for(int x=0;x<100000;x++)
{
a[x]=0;
b[x]=0;
}
scanf("%s",a);
int len=strlen(a);
int j;
for(j=0;j<len;j++)
{
for(int k=j+1;k<len;k++)
{
if(a[j]==a[k])
{
b[j]++;
b[k]++;
}
}
if(b[j]==0)
{
printf("%c\n",a[j]);
break;
}
}
if(j==len)
printf("no\n");
}
}
| 37 |
18,332 | void pro()
{
int l,i,j,a[26]={0};
char c[100000];
scanf("%s",c);
l=strlen(c);
for(i=0;i<l;i++)
a[c[i]-'a']+=1;
for(i=0;i<l;i++)
if(a[c[i]-'a']==1)
{
printf("%c\n",c[i]);
break;
}
if(i==l)
printf("no\n");
}
void main()
{
int i,n;
scanf("%d",&n);
for(i=0;i<n;i++)
pro();
}
| 37 |
18,333 | main()
{
int t,i,j,k;
char s[100000]={0};
char A[100] = {0};
scanf("%d",&t);
getchar();
for(i=0;i<t;i++)
{
gets(s);
j = 0;
while(s[j])
{
for(k=0;k<strlen(s);k++)
if(s[k]==s[j]&&k!=j)
{
break;
}
if(k==strlen(s))
{
A[i] = s[j];break;
}
j++;
}//while
}//for t
for(i=0;i<t;i++)
{
if(A[i]==0)printf("no\n");
else printf("%c\n",A[i]);
}
} | 37 |
18,334 | /**
* @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 |
18,335 |
int main()
{
int n;
char s[100001];
scanf("%d",&n);
gets(s);
int i;
char *p;
for(i=0;i<n;i++){
gets(s);
int l;
l=strlen(s);
int count[26]={0};
p=s;
while(*p!='\0'){
count[(int)*p-97]++;
p++;
}
p=s;
while(*p!='\0'){
if(1==count[(int)*p-97]){
printf("%c\n",*p);
break;
}
p++;
}
if(*p=='\0'){
printf("no\n");
}
}
return 0;
}
| 37 |
18,336 | int main(){
int n,j,i,m,k,r,d[30],x;char z,s[100000];
scanf("%d",&n);
for(j=0;j<n;j++){
scanf("%s",s);
r=0;
for(z='a';z<='z';z++){
m=0;
for(i=0;i<strlen(s);i++){
if(s[i]==z){
k=i;
m++;
}
}
if(m==1){
d[r]=k;r++;
}
}
if(r==0){printf("no\n");}
else if(r>0){
x=d[0];
for(i=0;i<r;i++){
if(d[i]<x){x=d[i];}
}
printf("%c\n",s[x]);
}
}
return 0;
} | 37 |
18,337 | int main()
{
char a[10000];
int i,j,t=0,n,la;
cin>>n;
while(cin>>a)
{
t=0;
la=strlen(a);
for(i=0;i<la;i++)
{
t=0;
for(j=0;j<la;j++)
{
if(i==j) continue;
else
{
if(a[i]==a[j])
{
t=1;
break;
}
}
}
if(t==0)
{
cout<<a[i]<<endl;
break;
}
}
if(t==1) cout<<"no"<<endl;
}
return 0;
} | 37 |
18,338 | int main()
{
int t,i,j,k,l;
char c[100];
scanf("%d",&t);
for(k=1;k<=t;k++)
{
scanf("%s",c);
l=strlen(c);
for(i=0;i<=l-1;i++)
{
for(j=0;j<=l-1;j++)
{
if(c[i]==c[j]&&i!=j)
break;
}
if(j==l)
break;
}
if(i==l)
printf("no\n");
else
printf("%c\n",c[i]);
}
return 0;
} | 37 |
18,339 | //???????????? ??? 12858
int main()
{
char s[101]; //s???????
int l,flagex,flagmul,i,k,t,j;
// l?s????
// flagex : ?????????
// flagmul: ???????????
// t:????
// i,j,k:????
cin >> t;
for (i = 1;i <= t;i++)
{
cin >> s;
l = strlen (s);
flagex = 0;
for (j = 0;j <= l-1;j++)
{
flagmul = 0;
for (k = 0;k <= l-1;k++)
if ((j != k) && (s[j] == s[k])) //?????????
{
flagmul = 1;
break;
}
if (flagmul == 0) //???????????????????1
{
cout << s[j] << endl;
flagex = 1;
break;
}
}
if (flagex == 0)
cout << "no" << endl; //???????no
}
return 0;
}
| 37 |
18,340 | 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 |
18,341 | void main()
{
int t,i,j,k,l,num[100000];
scanf("%d",&t);
char a[100000];
for(i=0;i<t;i++)
{
scanf("%s",a);
l=strlen(a);
for(j=0;j<l;j++)
{
num[j]=1;
}
for(j=0;j<l-1;j++)
{
for(k=j+1;k<l;k++)
{
if(a[j]==a[k])
{
num[j]+=1;
num[k]=num[j];
}
}
}
for(j=0;j<l;j++)
{
if(num[j]==1)
{
printf("%c\n",a[j]);
break;
}
if(j==l-1&&num[j]!=1)
printf("no\n");
}
}
}
| 37 |
18,342 | int main()
{
int i,j,k,t; cin>>t;
char a[t][100000];
for (i=0;i<t;i++)
cin>>a[i];
for (k=0;k<t;k++)
{
int length=strlen(a[k]);
for (i=0;i<length;i++)
{
for (j=0;j<length;j++)
if (a[k][i]==a[k][j]&&i!=j)
break;
if (j==length)
{
cout<<a[k][i]<<endl;
break;
}
}
if (i==length)
cout<<"no"<<endl;
}
return 0;
}
| 37 |
18,343 | 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 |
18,344 | int main(){
int i,n,j,k,x=0;
char s[100001];
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",s);
for(j=0;j<strlen(s);j++,x=0){
for(k=0;k<strlen(s);k++){
if(s[k]==s[j]&&k!=j){
//printf("s[k]=%c,%d\n",s[k],k);
x++;
//printf("x=%d\n",x);
}
}
if(x==0){
printf("%c\n",s[j]);
break;
}
}
if(j==strlen(s))
printf("no\n");
}
return 0;
} | 37 |
18,345 | 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;
} | 37 |
18,346 |
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 |
18,347 | int main()
{
int b[26]={0},l[100],i,j,t,m,count=0,a,num[26];
char s[10][1000];
scanf("%d",&t);
for(i=0;i<t;i++)
{
scanf("%s",s[i]);
l[i]=strlen(s[i]);
int b[26]={0};
int num[26]={0};
for(j=0;j<l[i];j++)
{
m=s[i][j]-'a';
num[j]=m;
b[m]++;
}
for(a=0;a<26;a++)
{
count=0;
if(b[num[a]]==1)
{
s[i][j]='a'+num[a];
printf("%c\n",s[i][j]);
count++;
break;
}
}
if(count ==0)
printf("no\n");
}
getchar();
getchar();
} | 37 |
18,348 | void main(){
int t,i,j,k,judge;
char zfc[100000],*pzfc;
int num[26],*pnum;
scanf("%d",&t);
gets(zfc);
for(i=0;i<t;i++){
for(j=0;j<26;j++){
*(num+j)=0;
}
j=0;
scanf("%s",zfc);
while(*(zfc+j)!='\0'){
for(k=0;k<26;k++){
if(*(zfc+j)=='a'+k){
(*(num+k))++;
break;
}
}
j++;
}
judge=0;
for(j=0;*(zfc+j)!='\0';j++){
for(k=0;k<26;k++){
if(*(zfc+j)=='a'+k){
if(*(num+k)==1){
printf("%c\n",*(zfc+j));
judge=1;
}
break;
}
}
if(judge==1)
break;
}
if(judge==0)
printf("no\n");
}
} | 37 |
18,349 |
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 |
18,350 | 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");
}
} | 37 |
18,351 | 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 |
18,352 |
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 |
18,353 | void main()
{
void select(char str[100000]);
int t;
char str[100000];
scanf("%d\n",&t);
int i;
for (i=1;i<=t;i++)
{
gets(str);
select(str);
}
}
void select(char str[100000])
{
char *pointer[26],*p;
pointer[0]=&str[0];
int j=0;
int k[26]={0};
p=&str[1];
while (*p!='\0')
{
int m,x=0;
for (m=0;m<=j;m++)
{
if (*p==*pointer[m])
{
k[m]=1;
x=1;
break;
}
}
if (x==0) pointer[++j]=p;
p++;
}
int l,y=0;
for (l=0;l<=j;l++)
{
if (k[l]==0)
{
printf("%c\n",*pointer[l]);
y=1;
break;
}
}
if (y==0) printf("no\n");
}
| 37 |
18,354 | int main()
{
int t,i,n=0,j=0,k;
char s[110000];
scanf("%d\n",&t);
for(i=0;i<t;i++)
{
scanf("%s",s);
for(j=0;s[j]!='\0';j++)
{
for(k=0;s[k]!='\0';k++)
{
if(s[k]==s[j])
n++;
}
if(n==1)
{
printf("%c\n",s[j]);
n=0;
break;
}
else
{
n=0;
}
}
if(s[j]=='\0')
{
printf("no\n");
n=0;
}
}
return 0;
} | 37 |
18,355 | main()
{
int t;
scanf("%d",&t);
scanf("\n");
while(t--)
{
char c[100000];
int len=0,i,j;
gets(c);
len=strlen(c);
for (i=0;i<len;i++)
{
for (j=0;j<len;j++)
{
if(j==i)
continue;
if (c[j]==c[i])
break;
}
if(j==len)
{
printf("%c\n",c[i]);
break;
}
}
if(i==len)
printf("no\n");
}
} | 37 |
18,356 | int main()
{
int n,i,j,l,t;
char s[100000];
int sz[26];
for(i=0;i<25;i++){
sz[i]=0;
}
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",s);
l=strlen(s);
for(j=0;j<l;j++){
t=(int)(s[j]-'a');
sz[t]++;
}
for(j=0;j<l;j++){
t=(int)(s[j]-'a');
if(sz[t]==1){
printf("%c\n",s[j]);
break;
}
if(j==l-1)
printf("no\n");
}
for(j=0;j<25;j++){
sz[j]=0;
}
}
return 0;
}
| 37 |
18,357 | int main()
{
int t,i,j,k,c = 0,m,p,q;
cin >> t;
char a[100001];
for(k=0;k <= t;k++)
{for(i=0;i<=100000;i++)
{a[i]=cin.get();
if(a[i]=='\0'||a[i]=='\n')
{m=i-1;
break;}
}
for(i=0;i<=m;i++)
{p=0;
for(j=0;j<=m;j++)
{if(a[j]==a[i])
{p=p+1;}
}
if(p==1)
{cout<<a[i]<<endl;
c=c+1;
break;}
if(i==m&&p!=1)
{cout<<"no"<<endl;
c=c+1;
break;}
c=c+1;
}
}
return 0;
} | 37 |
18,358 | 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 |
18,359 | 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 |
18,360 |
int main(){
int i,j,ii,jj,flag,word[2][30];
int c,n;
scanf("%d",&n);
c=getchar();
for (i=1;i<=n;i++){
for (ii=0;ii<=25;ii++)
for (jj=0;jj<=1;jj++) word[jj][ii]=0;
int j=0;
do{
j++;
c=getchar();
word[0][c-97]=j;
word[1][c-97]++;
}while (islower(c));
int min=1000111,cc=-1;
for (j=0;j<=25;j++)
if (word[1][j]==1&&word[0][j]<min){
min=word[1][j];
cc=j;
}
if (cc!=-1) printf("%c\n",cc+97);
else printf("no\n");
}
}
| 37 |
18,361 | 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 |
18,362 | int main()
{
int n,i,j,k,l,b,c;
char a;
char *s=(char *)malloc(sizeof(char)*100000);
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",s);
l=strlen(s);
c=0;
for(j=0;j<l;j++){
a=*(s+j);
b=0;
for(k=0;k<l;k++){
if(k!=j&&*(s+k)==a) {b++; break;}
}
if(b==0){
printf("%c\n",a);
c++;
break;
}
}
if(c==0) printf("no\n");
}
return 0;
} | 37 |
18,363 | //***********************************
//*???????????????? *
//*? ???? 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 |
18,364 | main()
{
int i,n,l,j,k;
char s[101]={'\0'};
scanf("%d\n",&n);
for(j=1;j<=n;j++)
{
int b[101]={0},c[123]={0};
gets(s);
l=strlen(s);
for(i=0;i<=l-1;i++)
{
b[i]=s[i];
}
for(i=0;i<=l-1;i++)
for(k=97;k<=122;k++)
if(b[i]==k)
{
c[k]=c[k]+1;
}
for(i=0;i<=l-1;i++)
if(c[b[i]]==1)
{
break;
}
if(b[i]==0)
printf("no\n");
else
printf("%c\n",s[i]);
}
}
| 37 |
18,365 | main()
{
char c[100000];
int m,i,j,t,b[150];
scanf("%d",&m);
for(i=1;i<=m;i++)
{
memset(b,0,sizeof(b));
scanf("%s",c);
j=0;
while(c[j]!=0)
{
b[c[j]]++;
j++;
}
for(t=0;t<j;t++)
{
if(b[c[t]]==1)
{
printf("%c\n",c[t]);
break;
}
if(b[c[j-1]]!=1&&t==j-1)
printf("%c%c\n",'n','o');
}
}
}
| 37 |
18,366 |
void main()
{
int n;
char str[100000];
int i,j,k=0;
int flag=0;
int len=0;
scanf("%d",&n);
gets(str);
for(i=0;i<n;i++)
{
k=0;
len=0;
j=0;
flag=0;
gets(str);
len=strlen(str);
for(j=0;j<len;j++,flag=0)
{
for(k=0;k<len;k++)
{
if(str[k]==str[j])
{
flag++;
}
}
if(flag==1)
{
printf("%c\n",str[j]);
break;
}
else
{
if(j==len-1)
{
printf("no\n");
break;
}
}
}
}
}
| 37 |
18,367 |
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 |
18,368 | /*
???????
??????
?????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 |
18,369 | int main(){
int n,i,k,t;
int m,s;
char sz[5000];
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%s",&sz);
s=0;
for(k=0;sz[k]!='\0';k++){
m=0;
for(t=0;sz[t]!='\0';t++){
if(sz[k]==sz[t]){
m++;
}
}
if(m==1){
printf("%c\n",sz[k]);
s++;
break;
}
}
if(s==0){
printf("no\n");
}
}
return 0;
}
| 37 |
18,370 | 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;
}
}
} | 37 |
18,371 | int main()
{
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
char s[100010]={'\0'};
int b[100010]={0};
scanf("%s",s);
int l=strlen(s);
int j,k;
for(j=0;j<l;j++)
{
for(k=0;k<l;k++)
{
if(s[j]==s[k])
{
b[j]++;
}
}
}
for(j=0;j<l;j++)
{
if(b[j]==1)
{
printf("%c\n",s[j]);
break;
}
}
if(j==l)
{
printf("no\n");
}
}
} | 37 |
18,372 | // 1011171.cpp : Defines the entry point for the console application.
//
int main(int argc, char* argv[])
{
char string[100000];
int i,j,k,flag,t;
scanf("%d\n",&t);
for (k=1;k<=t;k++){
gets(string);
for(i=0;string[i]!='\0';i++)
{
flag=1;
for(j=0;string[j]!='\0';j++)
if (i!=j)
if(string[i]==string[j]){
flag=0;
break;
}
if(flag)
{
printf("%c\n",string[i]);
break;
}
}
if(!flag)
printf("no\n");
}
return 0;
}
| 37 |
18,373 | int main()
{
char s[10000];
int rec[30], i, t, len,find;
scanf("%d",&t);
while (t-- > 0)
{
scanf("%s",s);
len=strlen(s);
find=0;
memset(rec,0,sizeof(rec));
for (i = 0; i < len ;i++)
rec[s[i]-'a']++;
for (i = 0; i < len ;i++)
if (rec[s[i]-'a']==1)
{
printf("%c\n",s[i]);
find=1;
break;
}
if (find==0)
printf("no\n");
}
return 0;
} | 37 |
18,374 | 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 |
18,375 | int main()
{
int n, i, j, k, s = 0, m = 0, len;
char str[100001];
int a[100001] = {0};
char result[1000];
int flag[1000] = {0};
cin >> n;
cin.get();
for(i = 1; i <= n; i++)
{
cin.getline(str, 100000);
len = strlen(str);
for(j = 0; j < len; j++)
{
for(k = 0; k < len; k++)
{
if(j == k)
continue;
if(str[k] == str[j])
{
s++;
}
}
if(s == 0)
{
result[i] = str[j];
break;
}
else
m++;
s = 0;
}
if(m == len)
flag[i] = 1;
m = 0;
}
for(i = 1; i <= n; i++)
{
if(flag[i] == 1)
cout << "no" <<endl;
else
cout << result[i] << endl;
}
return 0;
} | 37 |
18,376 |
int main()
{
int n,i,j,k;
int state;
int status;
char str[100000];
scanf("%d",&n);
for (i=0;i<n;i++)
{
scanf("%s",str);
status=1;
for (j=0;j<strlen(str);j++)
{
state=0;
if (str[j]!=1)
{
for (k=j+1;k<strlen(str);k++)
{
if (str[j]==str[k])
{
str[k]=1;
state=1;
}
}
}
if (state)
{
str[j]=1;
}
}
for (j=0;j<strlen(str);j++)
{
if (str[j]!=1)
{
printf("%c\n",str[j]);
status=0;
break;
}
}
if (status)
{
printf("no\n");
}
}
return 0;
} | 37 |
18,377 | int main()
{
int n,i,j,k,number;
char str[100000];
char t;
int array[100000];
cin>>n;
cin.get();
for(i=1;i<=n;i++)
{
cin.getline(str,100000,'\n');
for(j=0;j<100000;j++)
array[j]=0;
for(j=0;str[j+1]!='\0';j++)
{
if(array[j]==0)
{
for(k=j+1;str[k]!='\0';k++)
if(str[k]==str[j])
{
array[k]=1;
array[j]=1;
}
}
}
number=0;
for(j=0;str[j]!='\0';j++)
if(array[j]==0)
{
cout<<str[j]<<endl;
number++;
break;
}
if(number==0)
cout<<"no"<<endl;
}
return 0;
}
| 37 |
18,378 | void main(){
int max,n,i,j,k,c,l,b[200];
char a[200];
scanf("%d",&n);
for(i=0;i<n;i++)
{
max=0;
c=0;
scanf("%s",a);
l=strlen(a);
for(j=0;j<l;j++)
{
b[j]=0;
if(j==0) b[j]++;
else
{
for(k=0;k<j;k++)
{
if(a[j]==a[k])
{
b[k]++;
break;
}
}
if(k==j) b[j]++;
}
}
for(j=0;j<l;j++)
{
if(b[j]==1)
{
printf("%c\n",a[j]);
c++;
break;
}
}
if(c==0) printf("no\n");
}
}
| 37 |
18,379 | int main ()
{
char a[10001] ;
int n , i , j , k , t = 0;
cin >> n ;
for ( i = 1 ; i <= n+1 ; i ++ )
{
cin.getline(a,10001);
for ( j = 0 ; a[j] != '\0' ; j ++ )
{
t = 0 ;
for ( k = 0 ; a[k] != '\0' ; k ++ )
{
if ( a[k] == a[j] )
{
t++;
}
}
if ( t == 1 )
{
cout << a[j] << endl ;
break ;
}
else if ( a[j+1] == '\0' )
{
cout << "no" << endl ;
}
}
}
return 0 ;
} | 37 |
18,380 | int main()
{
int t=0,i=0,j=0,k=0,l=0,*n,m=0;
char **p,a;
n=(int*)malloc(26*sizeof(int));
scanf("%d",&t);
a=getchar();//?????//
p=(char**)malloc(100*sizeof(char*));//??100?????//
for(i=0;i<t;i++)
{
*(p+i)=(char*)malloc(100000*sizeof(char));
gets(*(p+i));
}
for(i=0;i<t;i++)
{
for(k=0;k<26;k++)
{
*(n+k)=-1;//
}
l=strlen(*(p+i));
for(j=0;j<l;j++)//??????????????//
{
for(k=0;k<26;k++)//??????????????//
{
if(*(*(p+i)+j)==(97+k))
{
if(*(n+k)==-1)//???????????//
{
*(n+k)=j;//???????????????,??????????j??2//
}
else//????????//
{
*(n+k)=-2;
}
}
}
}
m=l;
for(k=0;k<26;k++)//??26????????????????????//
{
if((*(n+k)<m)&&(*(n+k)!=-1)&&(*(n+k)!=-2))
{
m=*(n+k);
}
}
if(m!=l)
printf("%c\n",*(*(p+i)+m));
else
printf("no\n");
}
return 0;
} | 37 |
18,381 | 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 |
18,382 | int main()
{
char zfc[1000],tmp;
int n,i,t,e,f;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",zfc);
for(t=0;zfc[t]!='\0';t++){f=0;
for(e=0;1;e++){
if(zfc[t]==zfc[e]&&t!=e){
break;}
else if(e==strlen(zfc)){
printf("%c\n",zfc[t]);
f=1;
break;
}
}
if(f==1){break;}
}
if(f==0){
printf("no\n");}
}
return 0;
}
| 37 |
18,383 | //????????????
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 |
18,384 | //************************************
//*?? ????????????*****
//*????? 1300012753 *****
//*???2013.11.05 *********
//************************************
int main()
{
int t;
cin >> t;
char a[100000];
char ch;
ch = cin.get();
for(int i = 1; i <= t; i++)
{
int k = 1, j, m, num = 0;
a[k] = cin.get();
while(a[k] != '\n')
{
k++;
a[k] = cin.get();
}
k--;
for(j = 1; j <= k; j++)
{
for(m = 1; m<= k; m++)
{
if(j == m)
continue;
if(a[j] == a[m])
break;
}
if(m == k+1)
{
cout << a[j] << endl;
num++;
}
if(num == 1)
break;
}
if(num == 0)
cout << "no" << endl;
}
return 0;
} | 37 |
18,385 | /*
* 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;
}
| 37 |
18,386 | //????????????
//???
//1000062701
int main()
{
int i, j, k, t;
cin >> t;
char str[10000]; //?????
for( i = 0; i < t; i ++ )
{
int count[10000] = {0}; //????
cin >> str;
cin.get();
for( j = 0; str[j]!= '\0'; j++ )
count[str[j]]++;
for( k = 0; str[k]!= '\0'; k++ )
{
if( count[str[k]] == 1 )
{
cout << str[k] << endl; //????????
break;
}
if( str[k + 1] == '\0' )
cout << "no" << endl; //????????no
}
}
return 0;
} | 37 |
18,387 | char x[100000],y[100000],range[100000],flag[100000];
int time[100000];
int main()
{
int n,i,j;
scanf("%d",&n);
int k=0;
while(k<n)
{
scanf("%s",x);
int len=strlen(x);
strcpy(y,x);
char t;
for(i=0;i<len-1;i++)
{
for(j=0;j<len-1-i;j++)
{
if(y[j]>y[j+1])
{
t=y[j];
y[j]=y[j+1];
y[j+1]=t;
}
}
}
for(i=0;i<100000;i++)
time[i]=1;
flag[0]=y[0];
int p=0;
for(i=0;i<len-1;i++)
{
if(y[i]==y[i+1])
time[p]++;
else
flag[++p]=y[i+1];
}
int m=0;
int biaoji=0;
for(i=0;i<=p;i++)
{
if(time[i]==1)
{
range[m++]=flag[i];
biaoji=1;
}
}
int ting=0;
if(biaoji==0)printf("no\n");
else
{
for(i=0;i<len;i++)
{
for(j=0;j<m;j++)
{
if(x[i]==range[j])
{
printf("%c\n",x[i]);
ting=1;
break;
}
}
if(ting==1)break;
}
}
k++;
memset(x,0,sizeof(x));
memset(y,0,sizeof(y));
memset(range,0,sizeof(range));
memset(flag,0,sizeof(flag));
}
return 0;
} | 37 |
18,388 |
int main (void)
{
int i, j, k, n, alpha[100][100] = {0}, check;
char temp[10000];
cin >> n;
cin.get();
for (i = 0; i < n; i++)
{
check = 0;
cin.getline(temp, 9000);
for (j = 0; temp[j] != '\0'; j++ )
{
alpha[i][(int)(temp[j])]++;
}
for (k = 10; k < 120; k++)
{
if (alpha[i][k] == 1)
{
check = 1;
}
}
if (check == 0)
cout <<"no"<< endl;
else
{
for (j = 0; temp[j] != '\0'; j++ )
{
if (alpha[i][(int)(temp[j])] == 1)
{
cout << temp[j] <<endl;
break;
}
}
}
}
return 0;
}
| 37 |
18,389 | main()
{
int t,i,x,j,r;
int k=0;
char a[100000];
scanf("%d",&t);
for(i=0;i<t;i++)
{
scanf("%s",a);
x=strlen(a);
for(j=0;j<x;j++)
{
if(j==0)
for(r=1;r<x;r++)
{
if(a[r]==a[j])
break;
}
else
for(r=0;r<x;r++)
{
if(a[j]==a[r]&&j!=r)
break;
}
if(r==x)
{
printf("%c\n",a[j]);
k++;
break;
}
}
if(k==0)
printf("no\n");
else
k=0;
}
} | 37 |
18,390 | main()
{
int c['z']={0},flag=0;
int n;
int i,count,j;
char str[100001];
scanf("%d",&n);
for (count=0;count<n;count++)
{
for (j='a';j<='z';j++)c[j]=0;
scanf("%s",str);
i=0;
while(str[i]!='\0')
{
c[str[i]]++;
i++;
}
i=0;
flag=0;
while(str[i]!='\0')
{
if (c[str[i]]==1){printf("%c\n",str[i]);flag=1;break;}
i++;
}
if(flag!=1)printf("no\n");
}
}
| 37 |
18,391 | //***********************************
//????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 |
18,392 |
int main()
{
char ch[10000];
int i, j, k, t, m, nlen;
cin >> t;
for (i = 0; i < t; i++)
{
int flag = 0, l = 0;
memset(ch, 0, sizeof(ch));
int a[26] = {0};
int b[26] = {0};
cin >> ch;
nlen = strlen(ch);
for (j = 0; j < nlen; j++)
a[ch[j] - 'a']++;
for (k = nlen - 1; k >= 0; k--)
{
if (a[ch[k] - 'a'] == 1)
{
m = k;
flag = 1;
}
}
if (flag == 0)
cout << "no";
else
{
cout << ch[m];
cout << endl;
}
}
return 0;
}
| 37 |
18,393 | int main()
{
char (*a)[10000];
char b;
int n,i,flag=0,j,k,r;
scanf("%d",&n) ;
getchar();
a=malloc(n*sizeof(char)*10000);
for(i=0;i<n;i++)
{
gets(*(a+i));
}
for(i=0;i<n;i++)
{
k=strlen(*(a+i));
for(j=0;j<k;j++)
{
b=*(*(a+i)+j);
for(r=0;r<k;r++)
{
if(r==j)
continue;
else
{
if(b==*(*(a+i)+r))
break;
}
}
if(r==k)
{
printf("%c\n",b);
flag=1;
break;
}
}
if(flag==0)
printf("no\n");
flag=0;
}
} | 37 |
18,394 | int main()
{
int a=0,b,v,d,n,max,nn,mm=0,ii,c,e,f,i,j,t[100];
char cc;
scanf("%d",&nn);
scanf("%c",&cc);
for(ii=1;ii<=nn;ii++){
int y[1000]={0};
char x[1000];
gets(x);
e=strlen(x);
for(i=0;i<=e-1;i++){
for(j=0;j<=e-1;j++){
if(x[i]==x[j])y[i]++;}
if(y[i]==1){printf("%c\n",x[i]);
break;
}
}
if(i==e)printf("no\n");
}
} | 37 |
18,395 | main()
{int i,t,j,k;
static char x[100000];
scanf("%d",&t);
for(i=1;i<=t;i++)
{ scanf("%s",x);
for(k=0;x[k]!='\0';k++)
{for(j=0;x[j]!='\0';j++)
if(x[k]==x[j]&&k!=j)
break;
if(x[j]=='\0')
{printf("%c\n",x[k]);
break;
}
}
if(x[k]=='\0') printf("no\n");
for(j=1;j<100000;j++)
x[j]='\0';
}
} | 37 |
18,396 | /*??
??t??????????????26???????
???????????????????????????????no?
????
????t?????t??????????????100000
????
???????t????
??????????????????????????no?
????
2
aabb
abcabd
????
no
c
*/
int main()
{
int n,i,l,a,t,k;
char s[100000],*p,*q;
scanf("%d\n",&n);
for(i=0;i<n;i++)
{
gets(s);
l=strlen(s);
t=0;//??????????
for(p=s;p<s+l;p++)
{
a=1;
for(q=s;q<s+l;q++)
{
if(p!=q&&*p==*q)
{
a=0;//???????? ??a??0
break;//??
}
}
if(a==1) //??????? ????????? ?????????p
{
t=1;//???????????
printf("%c\n",*p);
break;//?????
}
}
if(t==0)//????????
printf("no\n");
}
return 0;
}
| 37 |
18,397 | int main()
{
int t,cycle,i,j,l,k;
char s[100000],c[100];
scanf("%d",&t);
for(cycle=1;cycle<=t;cycle++)
{
scanf("%s",s);
l=strlen(s);
memset(c,0,100*sizeof(char));
k=0;
for(i=0;i<=l-1;i++)
{
for(j=0;j<k;j++)
if(s[i]==c[j])
break;
if(j<k)
{
continue;
}
else
{
c[k]=s[i];
k++;
for(j=i+1;j<=l-1;j++)
if(s[j]==s[i])
break;
if(j==l)
break;
}
}
if(i<l)
printf("%c\n",s[i]);
else
printf("no\n");
}
return 0;
} | 37 |
18,398 | int main()
{
int t, i, j;
cin >> t;
cin.get();
while (t--)
{
int flag = 0;
char s[10000] = {0};
cin.getline(s, 10000);
for (i = 0; i < strlen(s); i++)
{
if (i == strlen(s) - 1 && s[i] != '0') {cout << s[i] << endl; flag = 2; break;}
if (s[i] != '0')
{
for (j = i + 1; j < strlen(s); j++)
{
if (s[j] == s[i])
{
s[j] = '0';
flag = 1;
}
}
if (flag) s[i] = '0';
else {cout << s[i] << endl; flag = 2; break;}
flag = 0;
}
}
if (flag != 2) cout << "no" << endl;
}
return 0;
}
| 37 |
18,399 | main()
{
int l,t,i,j,k,m;
char s[100001];
scanf("%d",&t);
for(k=0;k<t;k++)
{
scanf("%s",s);
l=strlen(s);
for(i=0;i<l;i++)
{
for(j=0;j<i;j++)
if(s[j]==s[i])
break;
for(m=i+1;m<l;m++)
if(s[m]==s[i])
break;
if(j==i&&m==l)
{
printf("%c\n",s[i]);
break;
}
}
if(i==l) printf("no\n");
}
getchar();
getchar();
} | 37 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.