杭电2700 Parity（睡前一水）

Parity

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 2323    Accepted Submission(s): 1810

Problem Description

A bit string has odd parity if the number of 1's is odd. A bit string has even parity if the number of 1's is even.Zero is considered to be an even number, so a bit string with no 1's has even parity. Note that the number of
0's does not affect the parity of a bit string.

 

Input

The input consists of one or more strings, each on a line by itself, followed by a line containing only "#" that signals the end of the input. Each string contains 1–31 bits followed by either a lowercase letter 'e' or a lowercase letter 'o'.

 

Output

Each line of output must look just like the corresponding line of input, except that the letter at the end is replaced by the correct bit so that the entire bit string has even parity (if the letter was 'e') or odd parity (if the letter was 'o').

 

Sample Input

  
  

   
   101e
010010o
1e
000e
110100101o
#
  
  

 

Sample Output

  
  

   
   1010
0100101
11
0000
1101001010
   
   
/*
水题
题目是给定一个字符串，如果最后一个字母是e，把e变化成0或者1使得整个字符串中1个个数为偶数；最后一位为o时，使其变成奇数个
Time:2014-8-24
*/
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
int main(){
	char s[100];
	int i;
	while(scanf("%s",s)!=EOF){
		if(s[0]=='#')break;
		int cnt=0;
		for(i=0;s[i];i++)
		if(s[i]=='1')
			cnt++;
		if((cnt&1)){
			if(s[i-1]=='e')
			   s[i-1]='1';
			else
			   s[i-1]='0';
		}else {
			if(s[i-1]=='e')
				s[i-1]='0';
			else
				s[i-1]='1';
		}
		puts(s);
	}
return 0;
}