zoukankan      html  css  js  c++  java
  • Codeforces Round #303 (Div. 2)——B——Equidistant String

    Little Susie loves strings. Today she calculates distances between them. As Susie is a small girl after all, her strings contain only digits zero and one. She uses the definition of Hamming distance:

    We will define the distance between two strings s and t of the same length consisting of digits zero and one as the number of positions i, such that si isn't equal to ti.

    As besides everything else Susie loves symmetry, she wants to find for two strings s and t of length n such string p of length n, that the distance from p to s was equal to the distance from p to t.

    It's time for Susie to go to bed, help her find such string p or state that it is impossible.

    Input

    The first line contains string s of length n.

    The second line contains string t of length n.

    The length of string n is within range from 1 to 105. It is guaranteed that both strings contain only digits zero and one.

    Output

    Print a string of length n, consisting of digits zero and one, that meets the problem statement. If no such string exist, print on a single line "impossible" (without the quotes).

    If there are multiple possible answers, print any of them.

    Sample test(s)
    input
    0001
    1011
    output
    0011
    input
    000
    111
    output
    impossible
    Note

    In the first sample different answers are possible, namely — 0010, 0011, 0110, 0111, 1000, 1001, 1100, 1101.

    巨坑。。。。不要用MSC++交

    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    const int maxn = 100100;
    char s1[maxn],s2[maxn],s3[maxn];
    int b[maxn];
    int main()
    {
        while(~scanf("%s%s",s1,s2)){
        int len = strlen(s1);
        int cout = 0;
        for(int i = 0; i <= maxn ; i++)
            b[i] = 2;
        for(int i = 0; i <= len - 1; i++){
            if(s1[i] != s2[i]){
                cout++;
                b[i] = s2[i];
            }
        }
        if(cout%2 == 1){
            printf("impossible
    ");
            continue;
        }
        int flag = 0;
        for(int i = 0 ; i <= len - 1; i++){
                if(b[i] == 2 || flag >= cout/2)
                printf("%c",s2[i]);
                else if(b[i]!=2 && flag < cout/2){ 
                    printf("%c",s1[i]);
                    flag++;
                }
        }
        printf("
    ");
        }
        return 0;
    }
    

      

  • 相关阅读:
    mysql 学习
    redis 学习
    redis 学习
    [爬虫学习笔记]MemoryCache缓存的用法学习
    [爬虫学习笔记]C#基于ARSoft.Tools.Net的DNS解析模块(半成品)
    [爬虫学习笔记]C# 使用 ScrapySharp 并行下载天涯图片
    一木禾网盘下载分析及批量获取下载地址的实现(下)
    一木禾网盘下载分析及批量获取下载地址的实现(上)
    C# TextBox Ctrl+A全选
    C#激爽特性——扩展方法
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4517297.html
Copyright © 2011-2022 走看看