Codeforces Round #545 (Div. 2) 1138- D. Camp Schedule

D. Camp Schedule

time limit per test

1 second

memory limit per test

512 megabytes

input

standard input

output

standard output

The new camp by widely-known over the country Spring Programming Camp is going to start soon. Hence, all the team of friendly curators and teachers started composing the camp's schedule. After some continuous discussion, they came up with a schedule ss, which can be represented as a binary string, in which the ii-th symbol is '1' if students will write the contest in the ii-th day and '0' if they will have a day off.

At the last moment Gleb said that the camp will be the most productive if it runs with the schedule tt (which can be described in the same format as schedule ss). Since the number of days in the current may be different from number of days in schedule tt, Gleb required that the camp's schedule must be altered so that the number of occurrences of tt in it as a substring is maximum possible. At the same time, the number of contest days and days off shouldn't change, only their order may change.

Could you rearrange the schedule in the best possible way?

Input

The first line contains string ss (1⩽|s|⩽5000001⩽|s|⩽500000), denoting the current project of the camp's schedule.

The second line contains string tt (1⩽|t|⩽5000001⩽|t|⩽500000), denoting the optimal schedule according to Gleb.

Strings ss and tt contain characters '0' and '1' only.

Output

In the only line print the schedule having the largest number of substrings equal to tt. Printed schedule should consist of characters '0' and '1' only and the number of zeros should be equal to the number of zeros in ss and the number of ones should be equal to the number of ones in ss.

In case there multiple optimal schedules, print any of them.

Examples

input

Copy

101101
110

output

Copy

110110

input

Copy

10010110
100011

output

Copy

01100011

input

Copy

10
11100

output

Copy

01

Note

In the first example there are two occurrences, one starting from first position and one starting from fourth position.

In the second example there is only one occurrence, which starts from third position. Note, that the answer is not unique. For example, if we move the first day (which is a day off) to the last position, the number of occurrences of tt wouldn't change.

In the third example it's impossible to make even a single occurrence.

 

题意：给两个字符串s，t。可以任意改变s的顺序，使t在s中出现次数最多。

分析：t可以重叠，例如：s=ababab，t=abab，那么t出现了2次。

直接求一个next数组，将s中1的个数和0的个数求出来，然后按照t的结构组合，当遍历到t的末尾，就跳转到next[end]，直到0或1的个数为0，然后将剩余的全部放进去即可。

 

 

#include<bits/stdc++.h>
using namespace std;
#include "bits/stdc++.h"
using namespace std;
int nex[500004];
char s[500004],t[500004];
void getnext(char ptr[])
{
    int i=0,j=-1,len=strlen(ptr);
    nex[0]=-1;
    while(i<len)
    {
        if(j==-1||ptr[i]==ptr[j])nex[++i]=++j;
        else j=nex[j];
    }
}
int main()
{
    scanf("%s%s",s,t);
    getnext(t);
    int zero=0,one=0;
    int len=strlen(s);
    for (int i = 0; i < len; ++i) {
        if(s[i]=='0')zero++;
        else one++;
    }
    string ans="";
    int cnt=0;
    len=strlen(t);
    while(zero>0&&one>0)
    {
        if(t[cnt]=='0')
        {
            if(zero>0)
            {
                zero--;
                ans+='0';
            }
            else break;
        }
        else
        {
            if(one>0)
            {
                one--;
                ans+='1';
            }
            else break;
        }
        cnt++;
        if(cnt==len)
        {
            cnt=nex[cnt];
        }
    }
    while(zero--)ans+='0';
    while(one--)ans+='1';
    cout<<ans<<endl;
}