Problem:
Score : 100 points

Problem Statement

You are given a string S of length 3 consisting of a, b and c. Determine if S can be obtained by permuting abc.

Constraints

|S|=3

S consists of a, b and c.

Input

Input is given from Standard Input in the following format:

S

Output

If S can be obtained by permuting abc, print Yes; otherwise, print No.

Sample Input 1

bac

Sample Output 1

Yes

Swapping the first and second characters in bac results in abc.

Sample Input 2

bab

Sample Output 2

No

Sample Input 3

abc

Sample Output 3

Yes

Sample Input 4

aaa

Sample Output 4

No

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

#include<iostream>
#include<algorithm>
#include<string>
#include<cstdlib>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;

int main()
{
    string s;
    int a[3] = {0};
    int i;
    
    cin >> s;

    a[int(s[0])-97]++;
    a[int(s[1])-97]++;
    a[int(s[2])-97]++;
    
    if((a[0]  == 1) && (a[1] == 1) && (a[2] == 1)) {
        cout << "Yes\n";
    } else {
        cout << "No\n";
    }
    
    return 0;
}