Problem:
Score : 200 points

Problem Statement

Let w be a string consisting of lowercase letters.
We will call w beautiful if the following condition is satisfied:

Each lowercase letter of the English alphabet occurs even number of times in w.

You are given the string w. Determine if w is beautiful.

Constraints

1 \leq |w| \leq 100

w consists of lowercase letters (a-z).

Input

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

w

Output

Print Yes if w is beautiful. Print No otherwise.

Sample Input 1

abaccaba

Sample Output 1

Yes

a occurs four times, b occurs twice, c occurs twice and the other letters occur zero times.

Sample Input 2

hthth

Sample Output 2

No

Solution in C (Clang 3.8.0) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<string.h>
int main()
{
	char w[200],c;
	int count[30]={0},len,i,num,flag;
//	char num[100][20]={"twice","four","six","eight","ten","twelve","fourteen","sixteen","eighteen","twenty","twenty-two"} 
    scanf("%s",w);
	len=strlen(w);
	for(i=0;i<len;i++)
	{
		num=w[i]-96;
		count[num]++;
		}	
		
	for(i=1;i<=26;i++)
	{
		if(count[i]%2==1)
		{
			printf("No\n");
			return 0;
		}
		
	}
	printf("Yes\n\n");

	
	flag=0;
	for(i=1;i<=26;i++)
	{
		if(count[i]!=0)      // count[i]对应到字符串 
		{
			c=i+96;
			if(flag!=0)
			printf(", ");     //如果为两次需要额外注意 
			printf("%c occurs %d times",c,count[i]);//times需要有字符串对应 
			flag++;
		}
	}
	printf(" and the other letters occur zero times.");
	
	
	return 0;
}