Codeforces Round #568 Div.2

#include <bits/stdc++.h>
using namespace std;
 
int num[5];
int d;
 
int main() {
    for(int i = 0; i < 3; i ++)
        scanf("%d", &num[i]);
    scanf("%d", &d);
    
    sort(num, num + 3);
    int ans = 0;
    
    if(num[1] - num[0] < d)
        ans += d - num[1] + num[0];
    if(num[2] - num[1] < d)
        ans += d - num[2] + num[1];
    
    printf("%d\n", ans);
    
    return 0;
}

#include <bits/stdc++.h>
using namespace std;
int T;
string s, t;

bool isSubsequence(string s, string t) {
    int ls = s.length(), lt = t.length();
    if(!ls) return true;
    if(!lt && ls) return false;
     
    int pos = 0, temp = 0;
    char c = s[pos];
    while(pos <= ls && temp <= lt) {
        if(s[pos] == t[temp]) {
            c = s[pos];
            pos ++;
        } else {
            if(t[temp] != c) return false;
        }
        temp ++;
    }
    return pos == ls + 1;
}

int main() {
    scanf("%d", &T);
    while(T --) {
        cin >> s >> t;
        if(isSubsequence(s, t)) printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}