CF825D.Suitable Replacement

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given two strings $s$ and $t$ consisting of small Latin letters, string $s$ can also contain '?' characters.

Suitability of string $s$ is calculated by following metric:

Any two letters can be swapped positions, these operations can be performed arbitrary number of times over any pair of positions. Among all resulting strings $s$ , you choose the one with the largest number of non-intersecting occurrences of string $t$ . Suitability is this number of occurrences.

You should replace all '?' characters with small Latin letters in such a way that the suitability of string $s$ is maximal.

输入格式

The first line contains string $s$ ( $1<=|s|<=10^{6}$ ).

The second line contains string $t$ ( $1<=|t|<=10^{6}$ ).

输出格式

Print string $s$ with '?' replaced with small Latin letters in such a way that suitability of that string is maximal.

If there are multiple strings with maximal suitability then print any of them.

输入输出样例

输入#1
```
?aa?
ab
```
输出#1
```
baab
```
输入#2
```
??b?
za
```
输出#2
```
azbz
```
输入#3
```
abcd
abacaba
```
输出#3
```
abcd
```

说明/提示

In the first example string "baab" can be transformed to "abab" with swaps, this one has suitability of 2. That means that string "baab" also has suitability of 2.

In the second example maximal suitability you can achieve is 1 and there are several dozens of such strings, "azbz" is just one of them.

In the third example there are no '?' characters and the suitability of the string is 0.

首页