[字符串]Codeforces Round #307 (Div. 2) B.ZgukistringZ

G - ZgukistringZ

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

Submit  Status  Practice  CodeForces 551B

Description

Professor GukiZ doesn't accept string as they are. He likes to swap some letters in string to obtain a new one.

GukiZ has strings a, b, and c. He wants to obtain string k by swapping some letters in a, so that k should contain as many non-overlapping substrings equal either to b or c as possible. Substring of string x is a string formed by consecutive segment of characters from x. Two substrings of string x overlap if there is position i in string x occupied by both of them.

GukiZ was disappointed because none of his students managed to solve the problem. Can you help them and find one of possible stringsk?

Input

The first line contains string a, the second line contains string b, and the third line contains string c (1 ≤ |a|, |b|, |c| ≤ 10⁵, where |s|denotes the length of string s).

All three strings consist only of lowercase English letters.

It is possible that b and c coincide.

Output

Find one of possible strings k, as described in the problem statement. If there are multiple possible answers, print any of them.

Sample Input

Input

aaa
a
b

Output

aaa

Input

pozdravstaklenidodiri
niste
dobri

Output

nisteaadddiiklooprrvz

Input

abbbaaccca
ab
aca

Output

ababacabcc

Hint

In the third sample, this optimal solutions has three non-overlaping substrings equal to either b or c on positions 1 – 2 (ab), 3 – 4 (ab),5 – 7 (aca). In this sample, there exist many other optimal solutions, one of them would be acaababbcc.

题目意思：给定A,B,C串，其中A串(可能)包含B或C串，现在可以任意变换A串的位置，使A串中包含B串，C串的总个数最大。

解法：（1）先匹配B串，枚举A串中出现B串的最多次数，然后从剩余的串中匹配C串，最后按字母序输出剩下的串。

（2）反过来，匹配C串，然后再从剩余的串中匹配B串。比较两个能匹配的最大次数。

输出最大次数的那个串。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
#define N 100005


char s1[N],s2[N],s3[N];
int len1,len2,len3;
int h1[26],h2[26],h3[26];
int cnt2,cnt3,cnt;
int main()
{
    int i,j;
    while(scanf("%s%s%s",s1,s2,s3)!= EOF)
    {
        len1 = strlen(s1);
        len2 = strlen(s2);
        len3 = strlen(s3);
        memset(h1,0,sizeof(h1));
        memset(h2,0,sizeof(h2));
        memset(h3,0,sizeof(h3));
        for(i = 0; i<len1; i++)
            h1[s1[i]-'a']++;
        for(i = 0; i<len2; i++)
            h2[s2[i]-'a']++;
        for(i = 0; i<len3; i++)
            h3[s3[i]-'a']++;
        cnt = 0;
        for(i=1;; i++)
        {
            int p = N;
            for(j = 0; j<26; j++)
            {
                if(h1[j]-h2[j]*i<0)
                {
                    p=0;
                    break;
                }
            }
            if(!p) break;
            int p2 = N;
            for(j = 0; j<26; j++)
            {
                if(h3[j])
                    p2 = min(p2,(h1[j]-h2[j]*i)/h3[j]);
            }
            if(i+p2>cnt)
            {
                cnt = i+p2;
                cnt2 = i;
                cnt3 = p2;
            }
        }
        for(i=1;; i++)
        {
            int p = N;
            for(j = 0; j<26; j++)
            {
                if(h1[j]-h3[j]*i<0)
                {
                    p=0;
                    break;
                }
            }
            if(!p) break;
            int p2 = N;
            for(j = 0; j<26; j++)
            {
                if(h2[j])
                {
                    p2 = min(p2,(h1[j]-h3[j]*i)/h2[j]);
                }
            }
            if(i+p2>cnt)
            {
                cnt = i+p2;
                cnt3 = i;
                cnt2 = p2;
            }
        }
        for(i = 0; i<cnt2; i++)
            cout<<s2;
        for(i = 0; i<cnt3; i++)
            cout<<s3;
        for(i = 0; i<26; i++)
        {
            for(j = 0; j<h1[i]-cnt2*h2[i]-cnt3*h3[i]; j++)
                printf("%c",i+'a');
        }
        printf("\n");
    }
    return 0;
}