Parity
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2646 Accepted Submission(s): 2043
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.
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
Source
Recommend
题目的难点在!英文!
如果看不懂题,多水都ac不了!囧!
题目的大概意思很简单.前length-1位照常输出.最后一位如果是'e'就是要你把它凑成even(偶数)形式,如果是'o'就是要你把它凑成odd(奇数)形式.
您可能还是觉得莫明其妙......那就是你英文不好了.再看一遍题目的吧.查查字典.相信你马上会豁然开朗!
import java.io.*;
import java.util.*;
public class Main
{
public static void main(String[] args)
{
// TODO Auto-generated method stub
Scanner input = new Scanner(System.in);
while(input.hasNext())
{
String str=input.nextLine();
if(str.equals("#")) break;
char a[]=str.toCharArray();
int sum=0;
for(int i=0;i<a.length-1;i++)
{
sum+=a[i]-'0';
System.out.print(a[i]);
}
if(a[a.length-1]=='o'&&sum%2==0)
System.out.println("1");
if(a[a.length-1]=='o'&&sum%2==1)
System.out.println("0");
if(a[a.length-1]=='e'&&sum%2==0)
System.out.println("0");
if(a[a.length-1]=='e'&&sum%2==1)
System.out.println("1");
}
}
}