Problem:
Score : 200 points

Problem Statement

You are given a string S consisting of lowercase English letters.
Find the lexicographically (alphabetically) smallest lowercase English letter that does not occur in S.
If every lowercase English letter occurs in S, print None instead.

Constraints

1 \leq |S| \leq 10^5 (|S| is the length of string S.)

S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

Print the lexicographically smallest lowercase English letter that does not occur in S.
If every lowercase English letter occurs in S, print None instead.

Sample Input 1

atcoderregularcontest

Sample Output 1

b

The string atcoderregularcontest contains a, but does not contain b.

Sample Input 2

abcdefghijklmnopqrstuvwxyz

Sample Output 2

None

This string contains every lowercase English letter.

Sample Input 3

fajsonlslfepbjtsaayxbymeskptcumtwrmkkinjxnnucagfrg

Sample Output 3

d

Solution in C (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <stdio.h>
int main(void){
char s[100005];
  int count;
  int flag[26];
  scanf("%s",s);
  for(count=0;;count++){
    if(s[count]=='\0'){break;}
  if(s[count]=='a'){flag[0]++;continue;}
    if(s[count]=='b'){flag[1]++;continue;}
    if(s[count]=='c'){flag[2]++;continue;}
    if(s[count]=='d'){flag[3]++;continue;}
    if(s[count]=='e'){flag[4]++;continue;}
    if(s[count]=='f'){flag[5]++;continue;}
    if(s[count]=='g'){flag[6]++;continue;}
    if(s[count]=='h'){flag[7]++;continue;}
    if(s[count]=='i'){flag[8]++;continue;}
    if(s[count]=='j'){flag[9]++;continue;}
    if(s[count]=='k'){flag[10]++;continue;}
    if(s[count]=='l'){flag[11]++;continue;}
    if(s[count]=='m'){flag[12]++;continue;}
    if(s[count]=='n'){flag[13]++;continue;}
    if(s[count]=='o'){flag[14]++;continue;}
    if(s[count]=='p'){flag[15]++;continue;}
    if(s[count]=='q'){flag[16]++;continue;}
    if(s[count]=='r'){flag[17]++;continue;}
    if(s[count]=='s'){flag[18]++;continue;}
    if(s[count]=='t'){flag[19]++;continue;}
    if(s[count]=='u'){flag[20]++;continue;}
    if(s[count]=='v'){flag[21]++;continue;}
    if(s[count]=='w'){flag[22]++;continue;}
    if(s[count]=='x'){flag[23]++;continue;}
    if(s[count]=='y'){flag[24]++;continue;}
    if(s[count]=='z'){flag[25]++;continue;}
  }
  if(flag[0]==0){printf("a");return 0;}
  if(flag[1]==0){printf("b");return 0;}
  if(flag[2]==0){printf("c");return 0;}
  if(flag[3]==0){printf("d");return 0;}
  if(flag[4]==0){printf("e");return 0;}
  if(flag[5]==0){printf("f");return 0;}
  if(flag[6]==0){printf("g");return 0;}
  if(flag[7]==0){printf("h");return 0;}
  if(flag[8]==0){printf("i");return 0;}
  if(flag[9]==0){printf("j");return 0;}
  if(flag[10]==0){printf("k");return 0;}
  if(flag[11]==0){printf("l");return 0;}
  if(flag[12]==0){printf("m");return 0;}
  if(flag[13]==0){printf("n");return 0;}
  if(flag[14]==0){printf("o");return 0;}
  if(flag[15]==0){printf("p");return 0;}
  if(flag[16]==0){printf("q");return 0;}
  if(flag[17]==0){printf("r");return 0;}
  if(flag[18]==0){printf("s");return 0;}
  if(flag[19]==0){printf("t");return 0;}
  if(flag[20]==0){printf("u");return 0;}
  if(flag[21]==0){printf("v");return 0;}
  if(flag[22]==0){printf("w");return 0;}
  if(flag[23]==0){printf("x");return 0;}
  if(flag[24]==0){printf("y");return 0;}
  if(flag[25]==0){printf("z");return 0;}
  printf("None");
  
  
  
  
return 0;
}