HDU-2700 Parity

http://acm.hdu.edu.cn/showproblem.php?pid=2700

题目意思很重要;  //e:是要使字符串中1的个数变成偶数。o:是要使字符串中1的个数变成奇数

Parity

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

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
 
Source
 
Recommend
zty
 //e:是要使字符串中1的个数变成偶数。o:是要使字符串中1的个数变成奇数。
#include<stdio.h>
#include<string.h>
int main()
{
int i,l,r;
char str[];
while(~scanf("%s",str)&&str[]!='#')
{
r=;
l=strlen(str);
for(i=;str[i]!=;i++)
{
if(str[i]=='')
r++;
}
for(i=;i<l-;i++)
printf("%c",str[i]);
if(str[l-]=='e')
{
if(r%==)
printf("");
else
printf("");
}
if(str[l-]=='o')
if(r%!=)
printf("");
else
printf("");
printf("\n");
}
return ;
}
上一篇:LeetCode OJ 80. Remove Duplicates from Sorted Array II


下一篇:Educational Codeforces Round 63 (Rated for Div. 2) B. Game with Telephone Numbers 博弈思维+模拟+贪心思维