本文共 1287 字，大约阅读时间需要 4 分钟。

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

英文题~看懂题意就ok了。

e代表的是偶数奇偶性校验。 o代表的是奇数奇偶性校验。 0代表是。1代表否~ 其实就是判断1的个数~

import java.util.Scanner;/** * @author 陈浩翔 */public class Main{
       public static void main(String[] args) {        Scanner sc= new Scanner(System.in);        while(sc.hasNext()){            String str = sc.next();            if(str.equals("#")){                return ;            }            int num=0;            for(int i=0;i

转载地址：https://chenhx.blog.csdn.net/article/details/51449299 如侵犯您的版权，请留言回复原文章的地址，我们会给您删除此文章，给您带来不便请您谅解！