Competitive-programming-codes/1099C.cpp at main · vishal1724/Competitive-programming-codes · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
#include <bits/stdc++.h>

#define ll long long
#define ull unsigned long long
#define ld long double
#define vl vector<ll>
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define mp make_pair
#define endl '\n';
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define setbits(x) __builtin_popcountll(x)
#define pqb priority_queue<int>                            // maxheap
#define pqs priority_queue<int, vector<int>, greater<int>> // minheap
#define uniquev(v) sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define pw(x) (1LL << (x))
#define cyes cout << "YES" << '\n'
#define cno cout << "NO" << '\n'
#define fo(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define foo(i, n) for (int(i) = 1; (i) <= (n); (i)++)
#define minv(a) *min_element(all(a))
#define maxv(a) *max_element(all(a))

const ll Mod = 998244353;
const ll mod = 1e9 + 7;
const ll inf = 1e18;

using namespace std;

void solve()
{
    string s;
    cin >> s;

    ll n;
    cin >> n;

    ll des = 0;
    for (int i = 0; i < s.size(); i++)
    {
        if (s[i] == '*' || s[i] == '?')
            des++;
    }

    ll alpha = s.size() - des;

    if (alpha >= n)
    {
        ll toremove = alpha - n;
        string ans = "";
        for (int i = 0; i < s.size(); i++)
        {
            if ((s[i] == '*' || s[i] == '?') && toremove)
            {
                ans.pop_back();
                toremove--;
            }
            else if (s[i] != '*' && s[i] != '?')
            {
                ans += s[i];
            }
        }
        if (ans.size() == n)
        {
            cout << ans << endl;
        }
        else
        {
            cout << "Impossible" << endl;
        }
    }
    else if (alpha < n)
    {
        ll toadd = n - alpha;
        string ans = "";
        for (int i = 0; i < s.size(); i++)
        {
            if ((s[i] == '*') && toadd)
            {
                while (toadd) {
                    ans += s[i - 1];
                    toadd--;
                }
            }
            else if (s[i] != '*' && s[i] != '?')
            {
                ans += s[i];
            }
        }
        if (ans.size() == n)
        {
            cout << ans << endl;
        }
        else
        {
            cout << "Impossible" << endl;
        }
    }
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    solve();

    return 0;
}