[2700]:Parity

本文提供了一个使用C语言解决位数为奇数或偶数问题的代码实例,包括输入字符串的读取、遍历计算1的数量,并根据最后的字母决定是否调整末尾位数以实现奇偶位数的目标。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

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’).[even:偶数的, odd:奇数的]

Sample Input
101e
010010o
1e
000e
110100101o
#

Sample Output
1010
0100101
11
0000
1101001010

简单题目,看懂上面标黑部分即可

#include<stdio.h>
#include<string.h>
#define N 100

int main()
{
    char str[N];
    while(scanf("%s", str)!=EOF){
        if(str[0] == '#'){
            break;
        }
        int len = strlen(str);
        int i = 0, count = 0;
        for(; i<len - 1; i++){
            if(str[i] == '1'){
                count++;
            }
        }
        if(str[len-1] == 'e' && count%2 == 0){
            str[len-1] = '0';
        }
        if(str[len-1] == 'e' && count%2 == 1){
            str[len-1] = '1';
        }
        if(str[len-1] == 'o' && count%2 == 1){
            str[len-1] = '0';
        }
        if(str[len-1] == 'o' && count%2 == 0){
            str[len-1] = '1';
        }
        printf("%s\n", str);
    }
    return 0;
}

这里写图片描述

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值