hdu 2700 Parity

Parity

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

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

题目解析:

这个题目的意思就是构建题目中1的数量,如果为e,1的数量为偶数,为o时,1的数量为奇数,很水的题目,1A

代码:

#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e6;
char c[maxn];
int main()
{
    //freopen("in.txt","r",stdin);
    while(gets(c))
    {
        if(c[0]=='#') break;
        int cnt = 0;
        int len = strlen(c);
        for(int i=0;i<len;i++)
            if(c[i]=='1')
            cnt++;
        for(int i=0;i<len-1;i++)
            cout<<c[i];
        if(c[len-1]=='e'&&cnt&1)
            cout<<"1"<<endl;
        else if(c[len-1]=='e'&&cnt%2==0)
            cout<<"0"<<endl;
        else if(c[len-1]=='o'&&cnt%2==0)
            cout<<"1"<<endl;
        else cout<<"0"<<endl;
    }
    return 0;
}