AtCoderBeginnerContest167

#include 
#define ll long long
using namespace std;
char s[15], t[15];
int main() {
    scanf("%s%s", s, t);
    bool flag = true;
    for(int i = 0 ; s[i]; i++) {
        if(s[i] != t[i]) flag = false;
    }
    printf("%s\n", flag ? "Yes" : "No");
    return 0;
}

#include 
#define ll long long
using namespace std;
int main() {
    int a, b, c, k;
    scanf("%d%d%d%d", &a, &b, &c, &k);
    int ans = 0;
    if(a > k) ans += k;
    else ans += a, k -= a;
    k = max(0, k - b);
    ans -= k;
    printf("%d\n", ans);
    return 0;
}

#include 
#define ll long long
using namespace std;
int c[15], a[15][15], n, m, x;
int main() {
    scanf("%d%d%d", &n, &m, &x);
    for(int i = 0; i ) {
        scanf("%d", &c[i]);
        for(int j = 0; j ) {
            scanf("%d", &a[i][j]);
        }
    }
    int ans = 1e9;
    for(int s = 1; s <1 <) {
        vector<int> t(m, 0);
        int sum = 0;
        for(int i = 0; i ) {
            if((1 < s) {
                sum += c[i];
                for(int j = 0; j ) {
                    t[j] += a[i][j];
                }
            }
        }
        bool flag = true;
        for(int i = 0; i ) {
            if(t[i] false;
        }
        if(flag) ans = min(ans, sum);
    }
    if(ans == 1e9) ans = -1;
    printf("%d\n", ans);
    return 0;
}

#include 
#define ll long long
using namespace std;
const int N = 2e5 + 5;
int a[N], n;
bool vis[N];
ll k;
int main() {
    scanf("%d%lld", &n, &k), k++;
    for(int i = 1; i <= n; i++) {
        scanf("%d", &a[i]);
    }
    int pos = 1;
    vector<int> vec;
    while(!vis[pos]) {
        vec.push_back(pos);
        vis[pos] = true;
        pos = a[pos];
    }
    if(k <= vec.size()) {
        printf("%d\n", vec[k - 1]);
    }else {
        int t = a[vec[vec.size() - 1]], x;
        for(int i = 0; i ) {
            if(vec[i] == t) {
                x = vec.size() - i;
                break;
            }
            k--;
        }
        k %= x;
        t = vec[vec.size() - 1];
        while(k--) {
            t = a[t];
        }
        printf("%d\n", t);
    }
    return 0;
}

#include 
#define ll long long
using namespace std;
const int N = 2e5 + 5;
const int MD = 998244353;
int f[N], fac[N], inv[N];
int quick_pow(int x, int y) {
    int ans = 1;
    while(y) {
        if(y & 1) ans = 1LL * ans * x % MD;
        y >>= 1;
        x = 1LL * x * x % MD;
    }
    return ans;
}
void init() {
    fac[0] = 1;
    for(int i = 1; i 1] * i % MD;
    inv[N - 1] = quick_pow(fac[N - 1], MD - 2);
    for(int i = N - 2; i >= 0; i--) inv[i] = 1LL * inv[i + 1] * (i + 1) % MD;
}
int C(int n, int m) {
    return 1LL * fac[n] * inv[m] % MD * inv[n - m] % MD;
}
int main() {
    init();
    int n, m, k;
    scanf("%d%d%d", &n, &m ,&k);
    f[0] = 1;
    for(int i = 1; i <= n; i++) {
        f[i] = 1LL * f[i - 1] * (m - 1) % MD;
    }
    int ans = 0;
    for(int i = 0; i <= k; i++) {
        ans = (ans + 1LL * C(n - 1, i) * f[n - i - 1] % MD) % MD;
    }
    ans = 1LL * ans * m % MD;
    printf("%d\n", ans);
    return 0;
}

#include 
#define ll long long
using namespace std;
const int N = 1e6 + 5;
char s[N];
vectorint, int>> pa, pb;
int main() {
    int n;
    scanf("%d", &n);
    for(int i = 0; i ) {
        scanf("%s", s);
        int a = 0, b = 0;
        for(int j = 0; s[j]; j++) {
            if(s[j] == ‘(‘) a++;
            else if(a) a--;
            else b++;
        }
        if(a <= b) pa.push_back({a, b});
        else pb.push_back({a, b}); 
    }
    sort(pa.begin(), pa.end());
    sort(pb.begin(), pb.end(), [](pair<int, int> a, pair<int, int> b) {
        return a.second > b.second;
    });
    int sum = 0;
    bool flag = true;
    for(int i = 0; i ) {
        sum -= pa[i].first;
        if(sum <0) flag = false;
        sum += pa[i].second;
    }
    for(int i = 0; i ) {
        sum -= pb[i].first;
        if(sum <0) flag = false;
        sum += pb[i].second;
    }
    if(sum) flag = false;
    printf("%s\n", flag ? "Yes" : "No");
    return 0;
}