AtCoder342-A

A - Yay!

Problem Statement

You are given a string S consisting of lowercase English letters. The length of S is between 33 and 100100, inclusive.

All characters but one of S are the same.

Find x such that the x-th character of S differs from all other characters.

Constraints

• S is a string of length between 33 and 100, inclusive, consisting of two different lowercase English letters.
• All characters but one of S are the same.

  Input

  The input is given from Standard Input in the following format:

  S
  

  Output

  Print the answer.

  Sample Input 1Copy

  Copy

  yay
  

  Sample Output 1Copy

  Copy

  2
  

  The second character of yay differs from the first and third characters.

  Sample Input 2Copy

  Copy

  egg
  

  Sample Output 2Copy

  Copy

  1

  Sample Input 3Copy

  Copy

  zzzzzwz
  

  Sample Output 3Copy

  Copy

  6
  

  #include <iostream>
  #include <bits/stdc++.h>
  using namespace std;
  int main(){
  	string s;
  	cin>>s;
  	int ch[27]={0};
  	int first[27]={0};
  	s="#"+s;
  	int len=s.length();
  	for(int i=1;i<=len;i++){
  		if(s[i]>='a'&&s[i]<='z'){
  			ch[s[i]-'a'+1]++;
  			if(ch[s[i]-'a'+1]==1&&first[s[i]-'a'+1]==0){
  				first[s[i]-'a'+1]=i;
  			}
  		}
  	}
  	for(int i=1;i<=26;i++){
  		if(ch[i]==1){
  			cout<<first[i];
  			break;
  		}
  	}
  	return 0;
  }