B - Equidistant String

B - Equidistant String

Time Limit:1000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I64u

 

Description

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 s_i isn't equal to t_i.

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 10⁵. 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 Input

Input

0001
1011

Output

0011

Input

000
111

Output

impossible

Hint

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

 

题意：

给定两条长度相等的字符串s和t，字符串之间的距离为两串相同位置不相等元素的个数，问能否得到一个长度与两串相同的字符串p使得p的距离离s，t相等，若有遍输出p。

 

水啊！s和t的距离ans为偶数就可以，否则就没有。输出的话只要将s的前ans/2个不同的元素转换为与t相同即可得字符串p。

 

附AC代码：

#include<iostream>
#include<cstring>
using namespace std;

string s,t,p;

int main(){
    cin>>s;
    cin>>t;
    int ans=0;
    p=s;
    int len=s.size();
    for(int i=0;i<len;i++){
        if(s[i]!=t[i]){
            ans++;
            t[i]=' ';    
        }
    }
    int temp=ans/2;
    if(ans%2==0){
        for(int i=0;i<len;i++){
            if(t[i]==' '&&temp){
                if(p[i]=='1')
                p[i]='0';
                else
                p[i]='1';
                temp--;
            }
        }
        for(int i=0;i<len;i++){
            cout<<p[i];
        }
    }
    else{
        cout<<"impossible";
    }
    return 0;
}