12545

来源：互联网发布：淘宝有ego女装官网吗? 编辑：程序博客网时间：2024/06/06 15:39

自己写的不太对，抄个别人的，感觉自己好失败：

#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<algorithm>using namespace std;const int MAXN = 111;char s[MAXN], t[MAXN];int main(){    int k; scanf("%d", &k);    for( int kase = 1; kase <= k; ++kase )    {        printf("Case %d: ", kase);        scanf("%s%s", s, t);        int s1 = 0, t1 = 0, len = strlen(s), diff0 = 0, diff1 = 0, que = 0;        for(int i = 0; i < len; ++i)  //统计s串、t串中1、0出现的次数等        {            if(s[i] == '1') ++s1;            if(t[i] == '1') ++t1;            if(s[i] == '?') ++que;            if(s[i] != t[i] && s[i] == '0') ++diff0;            if(s[i] != t[i] && s[i] == '1') ++diff1;        }        if(s1 > t1)            printf("-1\n");        else //根据上文，不管是全剩1还是全剩0最终都是要进行每个两次操作。 最后的que-(diff0 - diff1)代表剩余的问号要进行的操作        {            if(diff0 < diff1) swap(diff0, diff1);            printf("%d\n", diff1 + (diff0 - diff1) * 2 + que - (diff0 - diff1));        }    }    return 0;}

0 0