Problem:
Score : 200 points

Problem Statement

You are given a string S consisting of lowercase English letters. Determine whether all the characters in S are different.

Constraints

2 ≤ |S| ≤ 26, where |S| denotes the length of S.

S consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

If all the characters in S are different, print yes (case-sensitive); otherwise, print no.

Sample Input 1

uncopyrightable

Sample Output 1

yes

Sample Input 2

different

Sample Output 2

no

Sample Input 3

no

Sample Output 3

yes

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

#include<iostream>
#include<algorithm>
#include<stdio.h>
using namespace std;
int main(){
    string str;
    cin>>str;
    int al[26]={};
    for(int i=0; i<sizeof(str); i++){
        if(str[i]=='a')al[0]++;
        if(str[i]=='b')al[1]++;
        if(str[i]=='c')al[2]++;
        if(str[i]=='d')al[3]++;
        if(str[i]=='e')al[4]++;
        if(str[i]=='f')al[5]++;
        if(str[i]=='g')al[6]++;
        if(str[i]=='h')al[7]++;
        if(str[i]=='i')al[16]++;
        if(str[i]=='j')al[17]++;
        if(str[i]=='k')al[18]++;
        if(str[i]=='l')al[19]++;
        if(str[i]=='m')al[20]++;
        if(str[i]=='n')al[21]++;
        if(str[i]=='o')al[22]++;
        if(str[i]=='p')al[23]++;
        if(str[i]=='q')al[24]++;
        if(str[i]=='r')al[25]++;
        if(str[i]=='s')al[8]++;
        if(str[i]=='t')al[9]++;
        if(str[i]=='u')al[10]++;
        if(str[i]=='w')al[11]++;
        if(str[i]=='w')al[12]++;
        if(str[i]=='x')al[13]++;
        if(str[i]=='y')al[14]++;
        if(str[i]=='z')al[15]++;
    }
    bool key=0;
    for(int i=0; i<26;i++){
        if(al[i]>1)key=1;
    }
    if(key)cout<<"no"<<endl;
    else cout<<"yes"<<endl;
           return 0;
}