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 (GCC 5.4.1) (judge verdict: Wrong Answer)


#include <stdio.h>

int main()
{
   long long int a,b,c,x,y[10000]={0},flag=0,i,j,count,sum,max;
   
   scanf("%lld%lld%lld",&a,&b,&x);
  max=(a>b)?(a-b):(b-a);
  if(max>x)
  {
   for(i=a;i<a+x;i++)
   {
       y[i]=1;
   }
   for(i=b-x+1;i<=b;i++)
   {
       y[i]=1;
   }
   for(i=a;i<=b;i++)
   {
       if(y[i]==1)
       {
           printf("%lld\n",i);
       }
   }
  }else{
      for(i=a;i<=b;i++)
      {
          printf("%lld\n",i);
      }
  }
     return 0;
}