id
int32 0
32.5k
| code
stringlengths 95
8.4k
| label
stringclasses 65
values |
|---|---|---|
18,200 | void main()
{
int i,j,k,n,l,o;
char (*s)[100],m;
scanf("%d",&n);
scanf("%d",&n);
s=(char (*)[100])malloc(sizeof(char)*n);
for(i=0;i<n;i++) gets(*(s+i));
for(i=0;i<n;i++)
{
o=0;
for(j=0;*(*(s+i)+j)!='\0';j++)
{
l=0;
m=*(*(s+i)+j);
for(k=0;*(*(s+i)+k)!='\0';k++)
{
if(m!=*(*(s+i)+k)||k==j) l=0;
else {l=1;break;}
}
if(l==0) {printf("%c\n",m);o=1;break;}
}
if(o==0) printf("no\n");
}
}
| 37 |
18,201 | main()
{ int n,i,j,flag,t;
char s[10000],cc;
scanf("%d",&n);
scanf("%c",&cc);
for (t=0;t<n;t++)
{
gets(s);
for (i=0;s[i]!='\0';i++)
{ flag=0;
for (j=0;s[j]!='\0';j++)
if ((s[i]==s[j])&&(i!=j)) {flag=1; break;}
if (flag==0) {printf("%c\n",s[i]); break;}
}
if (s[i]=='\0') printf("no\n");
}
}
| 37 |
18,202 |
int main()
{
char a[100000];
int b[26] ;
int i,j,t,lenth;
int n ;
scanf("%d",&t);
for(j=0;j<t;j++)
{
n=1;
scanf("%s",a);
lenth = strlen(a);
for(i=0;i<26;i++)
b[i]=0;
for(i=0;i<lenth;i++)
{
b[a[i] - 'a'] = b[a[i] - 'a'] + 1;
}
for(i=0;i<lenth;i++)
{
if(b[a[i] - 'a'] == 1)
{
printf("%c\n",a[i]);
n = 0;
break;
}
}
if(n == 1)
printf("no\n");
for(i = 0;i <lenth;i++)
a[i] = 0;
for(i = 0;i < 26;i++)
b[i] = 0;
}
return 0;
}
| 37 |
18,203 | //****************************************
//*???????????? **
//*????? 1000012916 **
//*???2011. 11.4 **
//****************************************
int main()
{
int t = 0, i = 0, j = 0, k = 0, p = 0, len = 0, flag = 0;//???????flag?????????????
int b[26] = {0};//?????????????
char str[100000] = {0}, c[1000] = {0};
cin >> t;
for (i = 0; i < t;i++)
{
cin >> str;
len = strlen (str);//??????????????
for (j = 0; j < len; j++)
b[str[j] - 'a'] +=1;//?char???int??????????b???
for (j = 0; j < 26; j++)
{
if (b[j] == 1)
c[k++] = j + 'a';//??????????
}
if (k == 0)//????????
cout << "no" << endl;
else
{
for (j = 0; j < len; j++)//????????????
{
for (p = 0; p < k; p++)
{
if (c[p] == str[j])
{
cout << c[p] << endl;
flag = 1;//??????????
break;
}
if( flag == 1)
break;
}
if(flag == 1)
break;
}
}
memset(str, 0, sizeof(str));//????
memset(c, 0, sizeof(c));
memset(b, 0, sizeof(b));
j = 0;
k = 0;
p = 0;
flag = 0;
}
return 0;
}
| 37 |
18,204 | int test(char A,char B);
int main(){
int n,i,a,b,len,TEST,CHECK=1,SUM=0;
char input[NO];
char *pinput=input;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",input);
len=strlen(input);
CHECK=1;
for(a=0;a<len&&CHECK;a++){
SUM=0;
for(b=0;b<len;b++){
if(a!=b){
TEST=test(*(pinput+a),*(pinput+b));
SUM+=TEST;
}
}
if(SUM==0){
printf("%c\n",*(pinput+a));
CHECK=0;
}
}
if(CHECK==1){
printf("no\n");
}
}
return 0;
}
int test(char A,char B){
if(A==B)
return 1;
if(A!=B)
return 0;
} | 37 |
18,205 |
int main()
{
int n,i,j,k,s,len;
scanf("%d",&n);
for(i=0;i<n;i++)
{
s=0;
char a[100000];
scanf("%s",a);
len=strlen(a);
int b[26]={0};
for(j=0;j<len;j++)
{
for(k=97;k<123;k++)
{
if(a[j]==k)
{
b[k-97]++;
break;
}
}
}
for(j=0;j<len;j++)
{
if(b[a[j]-97]==1)
{
printf("%c\n",a[j]);
s=1;
break;
}
}
if(s==0)
{
printf("no\n");
}
}
return 0;
} | 37 |
18,206 | int main()
{
int n,i=0,j=0,k=0,t=1,num=0;
cin>>n;
for(t=1;t<=n;t++)
{
char a[100001],p;
cin>>a;
for(i=0;i<strlen(a);i++)
{
p=a[i];
for(j=0;j<strlen(a);j++)
{
if(p==a[j])
{
k++;
}
}
if(k==1)
{
cout<<p<<endl;
num++;
break;
}
k=0;
}
if(num==0)
{
cout<<"no"<<endl;
}
k=0;
num=0;
}
return 0;
} | 37 |
18,207 | int main()
{
//n??????
int n;
scanf("%d",&n);
int i1;
for(i1=0;i1<=n-1;i1++)
{
char str[100000];
scanf("%s",str);
int length;
length=strlen(str);
int counter;
int i3;
for(i3=0;i3<=length-1;i3++)
{
counter=0;
char tmp;
tmp=str[i3];
int i4;
for(i4=0;i4<=length-1;i4++)
{
if(str[i3]==str[i4])
{
counter++;
}
//????????????????
if(counter>1)
{
break;
}
}
if(counter==1)
{
printf("%c\n",str[i3]);
break;
}
}
if(i3==length)
{
printf("no\n");
}
}
return 0;
} | 37 |
18,208 | 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 |
18,209 | int main()
{
int n=0,i=0;
cin>>n;
cin.get();
for(i=0;i<n;i++)
{
int num[26]={0};
int j=0;int flag=0;
char shuru[100]={0};
cin.getline(shuru,100);
for(j=0;shuru[j]!='\0';j++)
num[(int)shuru[j]-97]=num[(int)shuru[j]-97]+1;
for (j=0;shuru[j]!='\0';j++)
{
if (num[(int)shuru[j]-97]==1)
{cout<<shuru[j]<<endl;flag=1;break;}
}
if (flag==0)
cout<<"no"<<endl;
} return 0;
} | 37 |
18,210 | int main()
{
int t;
scanf("%d",&t);
for (int c=1;c<=t;c++)
{
char a[100000];
scanf("%s",&a);
int l=strlen(a),sum=l;
int app=0;
for (int i=0;i<=l-1;i++)
{
for (int j=0;j<=l-1;j++)
{
if (a[i]==a[j])
app++;
}
if (app==1)
{
printf("%c\n",a[i]);
break;
}
app=0;
sum--;
}
if (sum==0)
printf("no\n");
}
} | 37 |
18,211 | 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;
} | 37 |
18,212 |
int main()
{
int t,i,m,n,l,count;
char a[100000];
char temp[100000];
scanf("%d",&t);
getchar();
for(i=1;i<=t;i++){
gets(a);
l=strlen(a);
count=0;
for(m=0;m<l;m++){
temp[m]=0;
for(n=0;n<l;n++){
if(*(a+m)==*(a+n)){
temp[m]++;
}
}
if(temp[m]==1){
printf("%c\n",*(a+m));
break;
}else{
count++;
}
}
if(count==l){
printf("no\n");
}
}
return 0;
}
| 37 |
18,213 | int main()
{
char a[100001];
int i,j,k,t,n;
int b,c;
gets(a);
t = atoi(a);
for(i=0;i<t;i++){
gets(a);
n=strlen(a);
c=0;
for(j=0;j<n;j++){
b=0;
for(k=0;k<n;k++){
if((j!=k)&&(a[j]==a[k])){
b++;
}
}
if(b==0){
printf("%c\n",a[j]);
c=1;
break;
}
}
if(c==0){
printf("no\n");
}
}
return 0;
} | 37 |
18,214 | 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 |
18,215 | int main()
{
int n,i=1,j=1,k=1,l,t;
char a[100000];
char x;
cin>>n;
for(;k<=n;k++)
{
cin>>a;
l=strlen(a);
for(i=0;i<l-1;i++)
{
t=a[i];
for(j=i+1;j<l;j++)
{
if(a[j]==1) continue;
if(a[j]==t)
{
a[i]=1;
a[j]=1;
}
}
}
for(i=0;i<=l;i++)
{
if(a[i]!=1)
{
cout<<a[i]<<endl;
break;
}
}
if(i==l) cout<<"no"<<endl;
}
return 0;
}
| 37 |
18,216 |
int main()
{
int t,length;
char a[100005];
int i,j,k,l;
scanf("%d",&t);
for(i=0;i<=t;i++)
{
gets(a);
length=strlen(a);
for(j=0;j<length;j++)
{
l=0;
for(k=0;k<length;k++)
{
if(a[j]==a[k])
{
l+=1;
}
if(l==2)
{
break;
}
}
if(l==1)
{
printf("%c\n",a[j]);
break;
}
if(j==length-1&&l==2)
{
printf("no\n");
}
}
}
return 0;
}
| 37 |
18,217 | 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 |
18,218 | int main()
{
int t, i, j, b[26], x, flag;
char a[100000];
cin >> t;
for(i = 0; i < t; i++)
{
flag = 0;
cin >> a;
for(j = 0; j < 26; j++)
b[j] = 0;
for(j = 0; j < strlen(a); j++)
{
x = a[j] - 'a';
b[x]++;
}
for(j = 0; j < strlen(a); j++)
{
if(b[a[j] - 'a'] == 1)
{
cout << a[j] << endl;
flag = 1;
break;
}
}
if(flag == 0)
cout << "no" << endl;
}
return 0;
} | 37 |
18,219 |
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 |
18,220 | 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");
}
}
| 37 |
18,221 | main()
{
int t,i=1,m;
scanf("%d",&t);
while(i<=t)
{char zifu[100000],q='0';
scanf("%s",&zifu);
m=strlen(zifu);
int k=0,j=0;
while(k<=m-2)
{j=0;
while(j<=m-1&&q=='0')
{if(zifu[k]==zifu[j]&&k!=j)
break;
else
j++;}
if(j==m)
{
q=zifu[k];
break;}
else
k++;
}
if(q=='0')
printf("no\n");
else
printf("%c\n",q);
i++;}}
| 37 |
18,222 |
int main()
{
char a[100001];
int b[300]={0};
int n,j,m,i,p;
scanf("%d",&m);
for (j=1;j<=m;j++)
{
for (i=1;i<=300;i++)
b[i]=0;
scanf("%s",a);
n=strlen(a);
for (i=0;i<n;i++)
{
p=a[i];
b[p]++;
}
i=0;
while ((b[a[i]]!=1) && (i<n))
i++;
if (i<n)
printf("%c\n",a[i]);
else
printf("no\n");
}
return 0;
} | 37 |
18,223 | void main()
{
int i,j,k,l,t,m;
scanf("%d",&t);
getchar();
int *p=(int*)malloc(26*sizeof(int));
char *s1=(char*)malloc(26*sizeof(char));
char (*s)[100000];
s=(char(*)[100000])calloc(t,100000*sizeof(char));
for(i=0;i<t;i++)
gets(*(s+i));
for(i=0;i<t;i++)
{
for(j=0;j<26;j++) *(p+j)=0;
k=0;
m=0;
for(j=0;*(*(s+i)+j)!='\0';j++)
(*(p+(int)(*(*(s+i)+j))-97))++;
for(j=0;j<26;j++)
if(*(p+j)==1)
{
*(s1+k)=(char)(j+97);
k++;
m=1;
}
if(m==0) printf("no\n");
else if(m==1)
{
for(j=0;*(*(s+i)+j)!='\0';j++)
{
for(l=0;l<k;l++)
if((int)(*(*(s+i)+j))==(int)(*(s1+l)))
{
printf("%c\n",*(s1+l));
m=0;
break;
}
if(m==0) break;
}
}
}
} | 37 |
18,224 | void main()
{
int n,i,pd=0,l,j,no=0;
char zf[100000],*ptr;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s",zf);
l=strlen(zf);
ptr=&zf[0];
for(;*ptr!='\0';ptr++)
{
for(j=0;j<l;j++)
{
if(*ptr==zf[j])
pd++;
}
if(pd==1)
{
printf("%c\n",*ptr);
no=1;
pd=0;
break;
}
pd=0;
}
if(no==0)
{
printf("no\n");
}
no=0;
}
} | 37 |
18,225 | void main()
{
int n,i,j,k,flag,*a;
char *s;
scanf("%d",&n);
a=(int *)malloc(200*sizeof(int));
s=(char *)malloc(1000*sizeof(char));
gets(s);
for(i=1;i<=n;i++)
{flag=0;
for(k='a';k<='z';k++)
*(a+k)=0;
gets(s);
for(j=0;*(s+j)!='\0';j++)
*(a+*(s+j))=*(a+*(s+j))+1;
for(j=0;*(s+j)!='\0';j++)
if(*(a+*(s+j))==1) {printf("%c\n",*(s+j));flag=1;break;}
if(flag==0) printf("no\n");
}
} | 37 |
18,226 | int main()
{
int t,i,j,k,h,s,n=0;
char m[100][10000],b[100];
scanf("%d",&t);
for(i=0;i<t;i++)
{
scanf("%s",m[i]);
n=0;
h=strlen(m[i]);
for(j=0;j<=h-1;j++)
{
n=0;
for(k=0;k<=h-1;k++)
{
if((m[i][j]==m[i][k])&&(j!=k))
{
n=1;break;
}
}
if(n==0)
{
b[i]=m[i][j];
break;
}
}
if(n==1)
{
b[i]=1;
}
}
for(s=0;s<=t-1;s++)
{
if(b[s]==1)
{
printf("no\n");
}
else
{
printf("%c\n",b[s]);
}
}
return 0;
}
| 37 |
18,227 | void main()
{
int t,i,j,s=0,sum=0,m,n;
char a[100]={0,0},b[100000]={0,0};
scanf("%d",&t);
for(i=0;i<t;i++)
{scanf("%s",b);
sum=0;
for (j=0;b[j]!='\0';j++)
{ s=0;
{for (m=0;(s!=2)&&(b[m]!='\0');m++)
if ((b[j])==(b[m])) s=s+1;}
if (s==1) {a[i]=b[j];sum=sum+1;break;}
}
if (sum==0) a[i]='$';
}
for (i=0;i<strlen(a);i++)
{if(a[i]=='$') printf("no\n");else printf("%c\n",a[i]);}
} | 37 |
18,228 | void main()
{
int a[26],flag1,flag2,len;
int t,i,j,k;
char s[100],c[26];
scanf("%d",&t);
while(t--){
for(i=0;i<26;i++){
a[i]=0;
}
k=0;
flag2=0;
scanf("%s",s);
len=strlen(s);
for(i=0;i<len;i++){
if(i==0){
c[k]=s[i];
k++;
}
else{
flag1=0;
for(j=0;j<i;j++){
if(c[j]==s[i]){
flag1=1;
a[j]=1;
}
}
if(flag1==0){
c[k]=s[i];
k++;
}
}
}
for(i=0;i<k;i++){
if(a[i]==0){
printf("%c\n",c[i]);
flag2=1;
break;
}
}
if(flag2==0)
printf("no\n");
}
} | 37 |
18,229 |
int main()
{
char zfc[100000];
int total;
scanf("%d",&total);
int i,j,k;
int alphabet[26];
for(i=1;i<=total;i++)
{
scanf("%s",zfc);
for(j=0;j<26;j++)
{
*(alphabet+j)=0;
}
for(j=0;*(zfc+j)!='\0';j++)
{
for(k=0;k<26;k++)
{
if(*(zfc+j)==97+k)
{
*(alphabet+k)=1+*(alphabet+k);
break;
}
}
}
int time=0;
for(j=0;*(zfc+j)!='\0';j++)
{
if(*(alphabet+(*(zfc+j)-97))==1)
{
printf("%c\n",*(zfc+j));
time++;
break;
}
}
if(time==0)
{
printf("no\n");
}
}
return 0;
} | 37 |
18,230 | int main()
{
int n;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
char a[100001]={0};
scanf("%s",a);
int len=strlen(a);
int q=0;
for(int j=0;j<len;j++)
{
int judge=1;
for(int k=0;k<len;k++)
{
if(j!=k)
{
if(a[j]==a[k])
{
judge=0;
break;
}
}
}
if(judge==1)
{
printf("%c\n",a[j]);
q=1;
break;
}
}
if(q==0)
printf("no\n");
}
} | 37 |
18,231 | int main()
{ char a[1000000];
int b[50000];
int t,i,j,k,n,l;
scanf("%d",&t);
for(i=0;i<t;i++)
{
for (j=0;j<50000;j++)
{b[j]=0;
a[j]=0;}
scanf("%s",a);
l=strlen(a);
for (k=0;k<l;k++)
{
for(n=0;n<l;n++)
{
if(a[k]==a[n])
b[k]++;
}
if(b[k]==1)
{printf("%c\n",a[k]);
break;}
if( k==l-1)
printf("no\n");
}
}
return 0;
} | 37 |
18,232 | //*****************************
//*??? : ???????????? *
//*?? : ??? *
//*?? : 2011?10? *
//*****************************
int main ()
{
int t, i, j, g = 0, k, m, count = 0;
char a[1000];
cin >> t;
cin.get();
for (k = 1; k <= t; k++)
{
cin.getline(a, 10000, '\n');
m = strlen(a);
for (i = 0; i < m; i++)
{
for (j = 0; j < m; j++)
{
if (a[i] == a[j])
{
count++;
}
}
if (count == 1)
{
cout << a[i] << endl;
g = 1;
count = 0;
break;
}
count = 0;
g = 0;
}
if (g ==0) cout << "no" <<endl;
}
return 0;
}
| 37 |
18,233 | 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 |
18,234 | char m[100002];
int main()
{
int n;
cin>>n;
getchar();
for(int i=0;i<n;i++)
{
int b[28]={0};
scanf("%s",m);
int len=strlen(m);
for(int j=0;j<len;j++)
b[m[j]-'a']++;
int f=0;
for(int j=0;j<len;j++)
{
if(b[m[j]-'a']==1)
{
f++;
cout<<m[j]<<endl;
break;
}
}
if(f<=0)
cout<<"no"<<endl;
}
return 0;
} | 37 |
18,235 | 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;
}
| 37 |
18,236 | 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");
}
} | 37 |
18,237 | 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");}
}
}
| 37 |
18,238 | 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 |
18,239 | int main()
{
int t,i,j,k;
int l,count;
char a[100000];
scanf("%d",&t);
for(i=1;i<=t;i++)
{
scanf("%s",a);
l=strlen(a);
for(j=0;j<l;j++)
{
count=0;
for(k=0;k<l;k++)
if(a[k]==a[j])
count++;
if(count==1)
{
printf("%c\n",a[j]);
break;
}
else if((j==l-1)&&(count!=1))
printf("no\n");
}
}
} | 37 |
18,240 |
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 |
18,241 | /**
* @file homework.cpp
* @author ???
* @date 2011-11-3
* @description
* ??????: ????????????
*/
int main()
{
int t, i, j, k, num, flag=1;
char ch;
cin>>t;
for (i=0;i<t;i++)
{
char a[100001];
cin>>a;
for (j=0;a[j]!='\0';j++)
{
if (a[j]==flag) continue;
num=1;
ch=a[j];
for (k=j+1;a[k]!='\0';k++)
{
if (a[k]==flag) continue;
if (a[k]==ch)
{
num++;
a[k]=flag;
}
}
if (num==1) break;
}
if (num==1) cout<<ch<<endl;
else cout<<"no"<<endl;
}
return 0;
} | 37 |
18,242 | 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;
}
| 37 |
18,243 | int main()
{
int t, p = 1;
cin >> t;
cin.get();
char ch[100000];
while(p <= t)
{
cin.getline(ch, 100000);
int i = 0, flag = 0;
while(ch[i] != '\0')
{
while(ch[i] == '0' ) i ++;
int count = 0;
for (int j = i + 1; ch[j] != '\0'; j ++)
{
if (ch[i] == ch[j])
{
ch[j] = '0';
count ++;
}
}
if (count == 0 && ch[i] >='a'&&ch[i]<='z')
{
cout << ch[i] << endl;
flag = 1;break;
}
i ++;
if (flag == 1) break;
}
if (flag == 0)
cout << "no" << endl;
p ++;
}
return 0;
}
| 37 |
18,244 |
int main ()
{
int n;
cin >>n;getchar();
for (int i=1;i<=n;i++)
{
int a[110000],l;
for (int i=1;i<=100000;i++)
{
a[i]=getchar();
if (a[i]==10)
{
l=i-1;
break;
}
}
int p=0;
for (int i=1;i<=l;i++)
{
int f=0;
for (int j=1;j<=l;j++)
{
if (a[j]==a[i])
{
f++;
}
}
if (f==1)
{
p=1;
putchar(a[i]);
break;
}
}
if (p==0)
cout <<"no";
cout <<endl;
}
return 0;
}
| 37 |
18,245 | 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 |
18,246 | int main()
{
int t,i,j,k;
int record[26]={0};
char s[100001]={'\0'};
cin>>t;
for(i=0;i<t;i++)
{
k=0;
cin>>s;
for(j=0;j<strlen(s);j++)
record[s[j]-'a']++;
for(j=0;j<strlen(s);j++)
if(record[s[j]-'a']==1)
{cout<<s[j]<<endl;k=1;break;}
if(k==0)
cout<<"no"<<endl;
for(j=0;j<strlen(s);j++)
s[j]=0;
for(j=0;j<26;j++)
record[j]=0;
}
return 0;
}
| 37 |
18,247 | main()
{
int i,j,t,x,k,m,h,a[26],b[100000];
char str[100000];
scanf("%d",&t);
for(i=0;i<t;i++)
{
for(j=0;j<26;j++)
a[j]=0;
h=0;
scanf("%s",str);
m=strlen(str);
for(k=0;k<m;k++)
{
b[k]=str[k]-'a';
a[b[k]]=a[b[k]]+1;
}
for(j=0;j<m;j++)
{
if(a[b[j]]==1&&h==0)
{
printf("%c\n",b[j]+'a');
h=1;
}
}
if(h==0)
printf("no");
}
}
| 37 |
18,248 | int main()
{
int t,l,m,n,j,no;
char i;
scanf("%d\n",&t);
for(l=0;l<t;l++)
{
no=0;
char a[100000];
int b[26]={0};
scanf("%s",&a);
n=strlen(a);
for(i='a';i<='z';i++)
{
for(j=0;a[j]!='\0';j++)
{
m=i-'a';
if(i==a[j])b[m]=b[m]+1;
}
}
for(j=0;j<26;j++)
{
if(b[j]==1)
{
i='a'+j;no=1;
for(m=0;a[m]!='\0';m++)
{
if(a[m]==i&&n>m)n=m;
}
}
}
if(no==1)printf("%c\n",a[n]);
else printf("no\n");
}
return 0;
} | 37 |
18,249 | main()
{ char *c,**s,**h,d;
int i=0,n,j=0,w=1,a=0,*b,t=0;
b=(int*)calloc(26,sizeof(int));
scanf("%d\n",&n);
h=s=(char**)calloc(n,sizeof(char*));
for(i=0;i<n;i++){
c=(char*)calloc(100,sizeof(char));
gets(c);
*(s+i)=c;
}
for(i=0;i<n;i++)
{ for(w=0;w<26;w++)*(b+w)=0;
for(j=0,d=*(*(s+i)+j);*(*(s+i)+j)!='\0';j++)
{ d=*(*(s+i)+j);
*(b+(d-97))=*(b+d-97)+1;
}
t=0;
for(j=0,d=*(*(s+i)+j);*(*(s+i)+j)!='\0';j++)
{ d=*(*(s+i)+j);
w=*(b+(d-97));
if(w==1){printf("%c",d);t=1;break;}
}
if(t==0)printf("no");
if(i!=n-1)printf("\n");
}
} | 37 |
18,250 | 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 |
18,251 | 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 |
18,252 | int main()
{
int n , m , i , j , k , ct[ 150 ] = { 0 } , t[ 27 ] = { 0 } , len , a , f = 0 ;
char str[ 100001 ] ;
cin >> n ;
for( m = 1 ; m <= n ; m ++ )
{
cin >> str ;
len = strlen( str ) ;
//????
for( i = 97 ; i <= 122 ; i ++ )
ct[ i ] = 0 ;
//????
for( i = 0 ; i <= 26 ; i ++ )
t[ i ] = 0 ;
for( i = 0 ; i < len ; i ++ )
{
a = str[ i ] ;
//?ct[]??
ct[ a ] ++ ;
}
for( i = 97 , j = 0 ; i <= 122 ; i ++ )
if( ct[ i ] == 1 )
{
t[ j ++ ] = i ; //t[]?????????ascll
//cout << i ;
}
//????
f = 0 ;
for( i = 0 ; i < len ; i ++ )
for( k = 0 ; k < j ; k ++ )
if( t[ k ] == str[ i ] && f == 0 )
{
a = i ;
f = 1 ;
}
if( f == 0 )
cout << "no" << endl ;
else
cout << str[ a ] << endl ;
}
return 0 ;
} | 37 |
18,253 | int main()
{
int a,j,b,c,i,n;
char x[10000];
scanf("%d",&n);
for(i=1;i<=n;i++)
{ scanf("%s",x);
a=strlen(x);
for(j=0;j<a;j++)
{
for(b=0;b<a;b++)
{if(b==j) continue; else if(x[b]==x[j]) break;}
if(b==a) break;}
if(j==a) printf("no\n");
else printf("%c\n",x[j]);
}
return 0;
}
| 37 |
18,254 | 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 |
18,255 |
int main()
{
int n;
int i,j,k,mid=0;
scanf("%d",&n);
char z[100010];
int len=0;
int ref=0;
for(i=0;i<n;i++)
{
ref=0;
scanf("%s",z);
len=strlen(z);
for(j=0;j<len;j++)
{
mid=0;
for(k=0;k<len;k++)
{
if(z[j]==z[k])
{
mid=mid+1;
}
}
if(mid==1)
{
printf("%c\n",z[j]);
ref=1;
break;
}
}
if(ref==0)
{
printf("no\n");
}
}
return 0;
}
| 37 |
18,256 |
int main()
{
int a[26] , i , n , k , j , l ;
char s[100001] ;
cin >> n ;
for (i = 1 ; i <= n ; i ++ )
{
cin >> s ;
l = strlen(s) - 1 ;
for (j = 0 ; j <= 25 ; j ++ )
a[j] = 0 ;
for (j = 0 ; j <= l ; j ++ )
a[s[j] - 'a'] ++ ;
for (j = 0 ; j <= 25 ; j ++ )
{
if (a[j] == 1)
for (k = 0 ; k <= l ; k ++ )
{
if (s[k] - 'a' == j)
a[j] = k ;
}
else
a[j] = -1 ;
}
for (j = 0 , k = 110000 ; j <= 25 ; j ++ )
if ((a[j] != -1) && (a[j] < k))
k = a[j] ;
if (k == 110000)
cout << "no" << endl ;
else
cout << s[k] << endl ;
}
return 0 ;
}
| 37 |
18,257 | int a[30];
char s[100100];
void main()
{
int g;
int n;
scanf("%d\n",&g);
while(g--)
{
char *p;
int *q;
gets(s);
if(s[0]=='\0')
{
g++;
continue;
}
p=s;
for(q=a;q<a+30;q++)
{
*q=0;
}
n= strlen(s);
for(p=s;p<s+n;p++)
{
a[*p-'a']++;
}
int flag=0;
q=a;
for(p=s;p<s+n;p++)
{
if(*(q+(*p-'a'))==1)
{
// for (q=a;q<a+30;q++)
// {
// if(*q==1)
// {
printf("%c\n",*p);
flag=1;
break;
}
}
if(!flag)
{
printf("no\n");
}
}
}
| 37 |
18,258 | //*************************************************************
//* ?????????????? *
//* ?????1000010573 *
//* ?????2010?11? *
//*************************************************************
int main( )
{
int t = 0 ;
cin>>t;
cin.get();
for(int r = 0 ; r<t+1 ;r++)
{
char str[111] ;//??????
int count[30] = {0};//?????????????
int L , c ;
char z ;
cin.getline(str,111);//??????
//?????????????count??
L = strlen(str);//????????????
for(int i = 0 ; i<L ; i++)
{
c = str[i] - 'a' ;
count[c]++;
}
for(int j = 0 ; j < L ; j++)
{
if(count[str[j]-'a']==1)
{
z = str[j] ;
cout<<z<<endl;
break;
}
if(j==L-1)
{
cout<<"no"<<endl;
break;
}
}
}
return 0;
}
| 37 |
18,259 | //********************************
//*???? ????????????
//********************************
int main()
{
char a[100100];
int i,j,k,t,n,c;
int num[26];
int No[26];
cin >> t;
cin.get();
for (i = 1; i <= t; i++)
{
memset(num,0,26*4);
k = 0;
cin.getline(a,100100);
n = strlen(a);
for(j = 0; j < n; j++)
{
c = (int)a[j] - 'a';
if (!num[c])
{
No[k] = c;
k++;
}
num[c]++;
}
for(j = 0; j < k; j++)
{
if(num[No[j]] == 1)
{
cout << (char)(No[j] + 'a') << endl;
break;
}
}
if(j == k)
cout << "no" << endl;
}
cin.get();
cin.get(); //????
return 0;
}
| 37 |
18,260 | int main()
{
int t,i,k,length,a[26]={0};
char c[100005]={0};
cin>>t;
for(k=0;k<t;k++)
{
cin>>c;
length=strlen(c);
for(i=0;i<26;i++)
a[i]=0;
for(i=0;i<length;i++)
{
a[c[i]-'a']++;
}
for(i=0;i<length;i++)
{
if(a[c[i]-'a']==1)
break;
}
if(i<length&&a[c[i]-'a']==1)
cout<<c[i]<<endl;
else
cout<<"no"<<endl;
}
return 0;
} | 37 |
18,261 | int main ()
{
int t,i,j;
long l,n;
scanf ("%d",&t);
for (i=0;i<t;i++)
{
int zimu[26]={0};
char string[100000];
char m;
scanf ("%s",string);
l=strlen(string);
for (j=97;j<=122;j++)
{
for (n=0;n<l;n++)
{
if (j==string[n])
{
zimu[j-97]++;
}
}
}
for (j=0,n=0;j<l;j++)
{
if (zimu[string[j]-97]==1)
{
printf ("%c\n",string[j]) ;
n=1;
break;
}
}
if (n==0)
printf ("no\n") ;
}
getchar ();
getchar ();
}
| 37 |
18,262 | main()
{
char a[100000];
int i,j,n,sum;
sum=0;
scanf("%d",&n);
for(;n>0;n--)
{
scanf("%s",a);
for(i=0;a[i]!='\0';i++)
{
for(j=0;a[j]!='\0';j++)
{
if(a[j]==a[i]&&j!=i)
{
sum=sum+1;
break;
}
}
if(sum==0)
{
sum=2;
break;
}
sum=0;
}
if(sum==2) printf("%c",a[i]);
else printf("no");
printf("\n");
sum=0;
}
} | 37 |
18,263 |
int main() {
int n,i,k,m,t,l,q,p;
char a[100001],c[27];
char zm[]={'0','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'};
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",a);
int b[27]={0};
t=0;
l=0;
p=0;
for(k=0;a[k];k++){
for(m=1;m<=26;m++){
if(a[k]==zm[m]) {b[m]++;}
}
}
for(m=1;m<=26;m++){
if(b[m]!=1) {t++;}
else {c[l]=zm[m];l++;}
}
if(t==26) {printf("no\n");}
else{
for(k=0;a[k];k++){
for(q=0;q<l;q++){
if(a[k]==c[q]) {printf("%c\n",a[k]);p++;break;}
}
if(p==1) {break;}
}
}
}
return 0;
}
| 37 |
18,264 | 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 |
18,265 | int main()
{
int n;
cin>>n;
char x;
x=getchar();
for(int i = 0 ; i < n ; i++)
{
char a[100010]={0},c[100010]={0};
int b[30]={0};
cin.getline(a,100010);
int len=strlen(a);
for(int j = 0 ; j < len ; j++)
{
if(a[j]=='a')b[1]++;
if(a[j]=='b')b[2]++;
if(a[j]=='c')b[3]++;
if(a[j]=='d')b[4]++;
if(a[j]=='e')b[5]++;
if(a[j]=='f')b[6]++;
if(a[j]=='g')b[7]++;
if(a[j]=='h')b[8]++;
if(a[j]=='i')b[9]++;
if(a[j]=='j')b[10]++;
if(a[j]=='k')b[11]++;
if(a[j]=='l')b[12]++;
if(a[j]=='m')b[13]++;
if(a[j]=='n')b[14]++;
if(a[j]=='o')b[15]++;
if(a[j]=='p')b[16]++;
if(a[j]=='q')b[17]++;
if(a[j]=='r')b[18]++;
if(a[j]=='s')b[19]++;
if(a[j]=='t')b[20]++;
if(a[j]=='u')b[21]++;
if(a[j]=='v')b[22]++;
if(a[j]=='w')b[23]++;
if(a[j]=='x')b[24]++;
if(a[j]=='y')b[25]++;
if(a[j]=='z')b[26]++;
}
int flag=0;
int tag=0;
for(int j = 1 ; j <= 26 ; j++)
{
if(b[j]==1)
{
if(j==1)c[tag]='a';
if(j==2)c[tag]='b';
if(j==3)c[tag]='c';
if(j==4)c[tag]='d';
if(j==5)c[tag]='e';
if(j==6)c[tag]='f';
if(j==7)c[tag]='g';
if(j==8)c[tag]='h';
if(j==9)c[tag]='i';
if(j==10)c[tag]='j';
if(j==11)c[tag]='k';
if(j==12)c[tag]='l';
if(j==13)c[tag]='m';
if(j==14)c[tag]='n';
if(j==15)c[tag]='o';
if(j==16)c[tag]='p';
if(j==17)c[tag]='q';
if(j==18)c[tag]='r';
if(j==19)c[tag]='s';
if(j==20)c[tag]='t';
if(j==21)c[tag]='u';
if(j==22)c[tag]='v';
if(j==23)c[tag]='w';
if(j==24)c[tag]='x';
if(j==25)c[tag]='y';
if(j==26)c[tag]='z';
flag=1,tag++;
}
}
if(flag==1)
{
for(int j = 0 ; j < len ; j++)
{
for(int k = 0 ; k < tag ; k++)
{
if(a[j]==c[k])
{
cout<<a[j]<<endl;
k=tag,j=len;
}
}
}
}
else cout<<"no"<<endl;
}
return 0;
} | 37 |
18,266 | //******************************************
//*???????????????.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;
} //?????
| 37 |
18,267 | int main()
{
int t,k;
char s[M];
scanf("%d",&t);
for(k=0;k<t;k++)
{
int count[M]={0},flag=0;
int n,i,j;
scanf("%s",s);
n=strlen(s);
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(s[j]==s[i])
count[i]++;
}
}
for(i=0;i<n;i++)
{
if(count[i]==1)
{
printf("%c\n",s[i]);
flag=1;
break;
}
}
if(flag==0)
printf("no\n");
}
return 0;
} | 37 |
18,268 | 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 |
18,269 |
int main(int argc, char* argv[])
{
char s[LEN],*p1,*p2;
int n,i,ct,CT;
scanf("%d",&n);
for(i=0;i<n;i++){
CT=0;
scanf("%s",s);
p1=s;
while(*p1!=0){
ct=0;
p2=s;
while(*p2!=0){
if(*p2==*p1){
ct++;
}
p2++;
}
if(ct<2){
printf("%c\n",*p1);
CT++;
break;
}
p1++;
}
if(CT<1)
printf("no\n");
}
return 0;
} | 37 |
18,270 | int main()
{
int n;
char str[100010];
cin >> n;
cin.get();
for(int i = 1; i <= n; i++)
{
int j = 0;
while((str[j] = cin.get()) != '\n')
j++;
int k;
for(k = 0; k < j; k++)
{
int l;
for(l = 0; l < j; l++)
{
if(str[l] == str[k] && l != k)
{
l = -1;
break;
}
}
if(l != -1)
{
cout << str[k] << endl;
k = -1;
break;
}
}
if(k != -1)
cout << "no\n";
}
return 0;
} | 37 |
18,271 |
int main()
{
int n,i,j,k,len,time=0;
char str[100000],*p=str;
int cs[100000]={0};
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",str);
len=strlen(str);
for(j=0;j<len;j++){
for(k=0;k<len;k++){
if(*(p+k)==*(p+j))
cs[j]++;
}
}
for(j=0;j<len;j++){
if(cs[j]==1){
printf("%c\n",*(p+j));
break;
}
}
time=0;
for(j=0;j<len;j++){
if(cs[j]>1)
time++;
}
if(time==len)
printf("no\n");
for(j=0;j<len;j++)
cs[j]=0;
}
return 0;
}
| 37 |
18,272 | 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 |
18,273 | void main()
{
char a[1000];
int i,t,length,b[26],flag,count=0;
scanf("%d",&t);
while(t--)
{
scanf("%s",a);
length=strlen(a);
for(i=0;i<26;i++)
{
b[i]=0;
}
for(i=0;i<length;i++)
{
flag=a[i]-'a';
b[flag]++;
}
for(i=0;i<length;i++)
{
if(b[a[i]-'a']==1)
{
printf("%c\n",a[i]);
count=1;
break;
}
}
if(count==0)
printf("no\n");
count=0;
}
} | 37 |
18,274 | 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 |
18,275 | int search();
int main()
{
int t;
cin >> t;
while(t--)
{
search();
}
return 0;
}
int search()
{
int i, l, j;
char a[100000];
cin >> a;
l = strlen(a);
int b[27] = {0};
for (i = 0; i < l; i++)
b[a[i] - 'a']++;
int p = 0, mark = l - 1, k, kk;
for (i = 0; i < 26; i++)
if(b[i] == 1)
{
p = 1;
k = i;
for (j = 0; j < l; j++)
if (a[j] == 'a' + k)
{
if(j < mark)
{
mark = j;
kk = k;
}
}
}
if (p == 1)
cout << a[mark] << endl;
else
cout << "no" << endl;
return 0;
} | 37 |
18,276 | //*******************************
//???????????????
//?????
//???2011-11-7
//*******************************
int main()
{
char a[100000]; //???????
char b[27] = {"abcdefghijklmnopqrstuvwxyz"}; //???????????
int c[100000]; //???????????????
int i, j, x, y = 0, min, t, k, first = 1, count = 0; //??????
cin >> t; //??????
for(k = 1;k <= t;k++)
{
for(i = 0;i <= 99999;i++) //?c?????
c[i] = 100000;
y = 0; //?y???
if(first == 1) //????????????
{
cin.get();
first = 0;
}
cin.getline(a, 100000); //?????
for(i = 0;b[i] != '\0';i++)
{
count = 0; //?????????
for(j = 0;a[j] != '\0';j++)
{
if(b[i] == a[j]) //??????????26??????????????????
{
x = j; //?????????????
count++; //????????
}
}
if(count == 1) //???????????????c???
{
c[y] = x;
y++;
}
}
if(c[0] == 100000) //?c[0] = 100?????????????
{
cout << "no" << endl;
}
else
{
min = c[0]; //?c[0]????
for(i = 1;i <= 99999;i++) //?????
{
if(min > c[i])
{
min = c[i];
}
}
cout << a[min] << endl; //??????a????????
}
}
return 0;
} | 37 |
18,277 | int main()
{
char a[999999],b[26]={'\0'};
int t,i,j,k,sum[26]={0},pp=0,qq=0,num=0;
cin >>t;
cin.get();
for (k=1;k<=t;k++)
{
cin.getline(a,999999);
b[0]=a[0];
sum[0]=1;
for (i=1;a[i]!='\0';i++)
{
for (j=0;j<26;j++)
{
if (a[i]==b[j])
{
sum[j]++;
pp++;
}
}
if (pp==0)
{
num++;
b[num]=a[i];
sum[num]=1;
}
pp=0;
}
for (j=0;j<26;j++)
{
if (sum[j]==1&&qq==0)
{
cout <<b[j]<<endl;
qq++;
}
}
if (qq==0) cout <<"no"<<endl;
// cout <<num<<" "<<sum[0]<<sum[1]<<sum[2]<<" "<<b[0]<<b[1]<<b[2];
pp=0;qq=0;num=0;
for (j=0;j<26;j++) {sum[j]=0;b[j]='\0';}
for (j=0;j<=999990;j++) a[j]='\0';
}
return 0;
}
| 37 |
18,278 | 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 |
18,279 | 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 |
18,280 | int main()
{
int t,i,l,j,m=0;
char c[100000],a[26];
scanf("%d",&t);
for(i=0;i<t;i++)
{
m=0;
scanf("%s",c);
l=strlen(c);
for(j=0;j<26;j++)
a[j]=0;
for(j=0;j<l;j++)
{
a[c[j] - 'a'] = a[c[j] - 'a'] + 1;
}
for(j=0;j<l;j++)
{
if(a[(c[j]-'a')]==1)
{
printf("%c\n",c[j]);
m++;
break;
}
}
if(m==0)
printf("no\n");
}
} | 37 |
18,281 | int main()
{
int n,m,i,a,j,b[27],fl;
char s[1000001],c[27];
scanf("%d",&n);
while(n>0)
{
scanf("%s",s);
a=strlen(s);
for(i=0;i<27;i++)
b[i]=1;
for(i=0,j=0;i<a;i++){
if(s[i]=='0')
continue;
else
{
c[j]=s[i];
for(m=i+1;m<a;m++)
{
if(s[m]==s[i])
{
s[m]='0';
b[j]++;
}
}
j++;
}
}
for(i=0,fl=0;i<j;i++)
{
if(b[i]==1)
{
printf("%c\n",c[i]);
fl++;
break;
}
}
if(fl==0)
printf("no\n");
n--;
}
} | 37 |
18,282 | int main()
{
int n;
scanf("%d",&n);
int i;
for(i=0;i<n;i++)
{
char s[10002];
scanf("%s",s);
int len;
len=strlen(s);
int k;
int j;
for(k=0;k<len;k++)
{
int number=0;
for(j=0;j<len;j++)
{
if(s[k]==s[j])
{
number++;
}
}
if(number==1)
{
printf("%c\n",s[k]);
break;
}
if(k==len-1&&number!=1)
{
printf("no\n");
}
}
}
return 0;
} | 37 |
18,283 | void main()
{
int t,i,j,len,d;
char str[100000];
scanf("%d",&t);
for(d=0;d<t;d++)
{
scanf("%s",str);
len=strlen(str);
for(i=0;i<len;i++)
{
for(j=0;j<len;j++)
{
if(i==j)
{
continue;
}
else if(str[i]==str[j])
break;
}
if(j>=len)
{
printf("%c\n",str[i]);
break;
}
}
if(i>=len)
printf("no\n");
}
}
| 37 |
18,284 | /*
* 4.cpp
*
* Created on: 2011-12-30
* Author: Administrator
*/
int main()
{
int t, i, j, k, flag = 1;
cin >> t;
char a[100005];
for( i = 1; i <= t; i++ )
{
cin >> a;
for( j = 0; a[j]!= '\0'; j++ )
{
flag = 1;
for( k = 0; a[k]!= '\0'; k++ )
{
if( j == k )
continue;
if( a[j] == a[k] )
{
flag = 0;
break;
}
}
if( flag )
{
cout << a[j] << endl;
break;
}
}
if( flag == 0 )
cout << "no" << endl;
}
return 0;
}
| 37 |
18,285 | /***************************************
*
* ???????????????
* ???1100017637 ???
* ???2011.11.7
*
***************************************/
int main()
{
int t, i, j, k, s, l, flag = 0;
char a[100000];
// ???????????
cin >> t;
for (i = 0; i < t; i++)
{
// ?????
s = 0; k = 0; j = 0, l = 0; flag = 0;
// ????b[]?26????c[]???????????
int c[26] = {0};
char b[27] = {'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 >> a;
// ????????a[]???b[]??????
// ??c[]????????
for (k = 0; a[k] != '\0' ; k++)
{
for (s = 0; s < 27; s++)
{
if (a[k] == b[s])
c[s]++;
}
}
// ????c[],?c[]??1???0??b[]
for (j = 0; j < 27; j++)
{
if (c[j] != 1)
{
b[j] = 0;
}
}
// ???a[]?b[],?a[]b[]?????????a[]
for (l = 0; a[l] != '\0'; l++)
{
for (j = 0; j < 27; j++)
{
if (flag == 0)
{
if (a[l] == b[j])
{
cout << a[l] << endl;
flag = 1;
break;
}
}
}
}
// ?????????no
if (flag == 0)
cout << "no" << endl;
}
return 0;
} | 37 |
18,286 | int main()
{
int n,i,j,k,t,length;
char st[100000];
cin>>n;
for (i=0;i<=n;i++)
{
gets(st);
t=0;
length=strlen(st);
for (j=0;j<length;j++)
{
t=0;
for (k=0;k<length;k++)
{
if ((st[k]==st[j]) &&(k!=j))
{
t=1;
break;
}
}
if (t==0)
{
cout<<st[j]<<endl;
break;
}
}
if (t==1) cout<<"no"<<endl;
}
return 0;
}
| 37 |
18,287 | 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 |
18,288 | int main()
{
char ltr[100000];
int n;
int i;
char *p,*t;
int count=0;
int k=0;
scanf("%d",&n);
for(i=0;i<n;i++){
scanf("%s",ltr);
for(p=ltr;p<ltr+strlen(ltr);p++){
for(t=ltr;t<ltr+strlen(ltr);t++){
if(*t==*p){
count++;
}
}
if(count==1){
k++;
printf("%c\n",*p);
break;
}
count=0;
}
if(k==0){
printf("no\n");
}
count=0;
k=0;
}
return 0;
} | 37 |
18,289 | int main()
{
int t, flag = 1;
char z[10][100010] = {"0"};
cin >> t;
for (int i = 0; i < t; i++)
cin >> z[i];
for (int i = 0; i < t; i++)
{
flag = 1;
int j = 0;
for (; j < strlen(z[i]) && flag != 0; j++)
{
int s = 0;
for (int k = 0; k < strlen(z[i]); k++)
if ((z[i][j] - 'a') == (z[i][k] - 'a'))
s++;
if (s == 1)
{
cout << z[i][j] << endl;
flag = 0;
}
}
if (j == strlen(z[i]) && flag != 0)
cout << "no" << endl;
}
return 0;
} | 37 |
18,290 | 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 |
18,291 | int main()
{
char a[100000];
int i,t,len;
int j,k,cont;
int OK=0;
char x;
cin>>t;
cin.get();
for(i=0;i<t;i++)
{OK=0;
cin>>a;
cin.get();
len=strlen(a);
for(j=0;j<len;j++)
{if(a[j]!='0')
{x=a[j];
a[j]='0';
cont=1;
for(k=j;k<len;k++)
if(a[k]==x){a[k]='0';cont++;}
if(cont==1){cout<<x<<endl;OK=1;break;}}
else continue;}
if(OK==0)cout<<"no"<<endl;}
return 0;
} | 37 |
18,292 | 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 |
18,293 | int main()
{
int n,k;
scanf("%d",&n);
for(k=0;k<=n;k++)
{
char zifuchuan[10000];
gets(zifuchuan);
int len;
len=strlen(zifuchuan);
int i,j,m=0,p=0,a,b;
for(i=0;i<len;i++)
{
for(j=0;j<len;j++)
{
a=(int)zifuchuan[i];
b=(int)zifuchuan[j];
if(a==b)
m++;
}
if(m==1)
{
printf("%c\n",zifuchuan[i]);
break;
}
else if(m!=1)
p++;
m=0;
}
if(p==len&&p!=0)
{
printf("no\n");
}
}
return 0;
} | 37 |
18,294 | void main()
{int t,i,j,num[100][26]={0};
char a[100][10000];
scanf("%d\n",&t);
for(i=0;i<t;i++)
{for(j=0;;j++)
{scanf("%c",&a[i][j]);
if(a[i][j]=='\n')break;}}
for(i=0;i<t;i++)
{{for(j=0;;j++)
if(a[i][j]!='\n')
num[i][a[i][j]-'a']++;
else break;}
for(j=0;;j++)
if(a[i][j]!='\n')
{if(num[i][a[i][j]-'a']==1){printf("%c\n",a[i][j]);break;}}
else break;
if(a[i][j]=='\n')printf("no\n");}
}
| 37 |
18,295 | int main()
{
int k,len,b[100][1000]={0},i,j,t;
char sen[100][1000];
cin>>t;
for(i=1;i<=t;i++)
{
cin>>sen[i];
}
for(i=1;i<=t;i++)
{
len=strlen(sen[i]);
for(j=0;j<=len-1;j++)
{
b[i][sen[i][j]-'a']++;
}
for(j=0;j<=len-1;j++)
{
if(b[i][sen[i][j]-'a']==1)
{
cout<<sen[i][j]<<endl;break;
}
}
if(j==len)
{
cout<<"no"<<endl;
}
}
return 0;
}
| 37 |
18,296 | int main()
{
int n, i, j, k, len, flag, mark, judge;
cin >> n; // n???????
char str[100000], outcome;
for (i = 0; i < n; i++)
{
cin >> str;
len = strlen(str);
flag = 0;
for (j = 0; j < len - 1; j++)
{
if (str[j] != '\0')
{
for (k = j + 1; k < len; k++)
{
if (str[j] == str[k])
{
str[j] = '\0';
str[k] = '\0';
break;
} // end if
} // end for
} // end if
} // end for
for (k = 0; k < len; k++)
{
if (str[k] != '\0')
{
outcome = str[k];
break;
}
if (k == len - 1)
{
flag = 1;
}
}
if (flag == 0)
{
cout << outcome << endl;
}
else
{
cout << "no";
}
if (i != n - 1)
{
cout << endl;
}
}
return 0;
}
| 37 |
18,297 | int main()
{
int t,i,j,k,flag=1;
char a[100][10000];
int num[27]={0};
cin>>t;
for ( i=0 ; i<t ; i++ )
{
cin >> a[i];
for ( j = 0; a[i][j] != '\0'; j++ )
{
flag=1;
for ( k = 0 ; a[i][k] != '\0'; k++ )
{
if( k == j ) continue;
if( a[i][j]==a[i][k] )
{
flag=0;
break;
}
}
if ( flag )
break;
}
if ( flag )
cout << a[i][j] << endl;
else
cout << "no" << endl;
}
return 0;
}
| 37 |
18,298 | 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;
}
| 37 |
18,299 | int main()
{
int count[26] = {0}, t, i, j;
char str[100000] = {'\0'};
cin >> t;
cin.get();
for (i = 0; i < t; i++)
{
for (j = 0; j < 100000; j++)
str[j] = '\0';
for (j = 0; j < 26; j++)
count[j] = 0;
cin.getline(str,100000);
for (j = 0; str[j] != '\0'; j++)
{
count[str[j]-'a']++;
}
for (j = 0; j < strlen(str); j++)
{
if (count[str[j]-'a'] == 1)
{
cout << str[j] << endl;
break;
}
}
if (j == strlen(str))
cout << "no" << endl;
}
return 0;
} | 37 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.