For this Question: You are given strings S and T consisting of lowercase English letters. Determine whether T is a (contiguous) substring of S.

A string Y is said to be a (contiguous) substring of X if and only if Y can be obtained by performing the operation below on X zero or more times.

Do one of the following.
i) Delete the first character in X.
ii) Delete the last character in X.
For instance, the tag is a (contiguous) substring of voltage, while ace is not a (contiguous) substring of atcoder.The input is given from Standard Input in the following format:
S
T

<b>Constraints</b>
S and T consist of lowercase English letters.
1&le;∣S∣, ∣T∣&le;100 (∣X∣ denotes the length of a string X. )If T is a (contiguous) substring of S, print Yes; otherwise, print No.<b>Sample Input 1</b> 
voltage
tag
<b>Sample Output 1</b> 
Yes

<b>Sample Input 2</b> 
gorilla
gorillagorillagorilla
<b>Sample Output 2</b>
No, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
using pii = pair<int, int>;

// <<<

int32_t main()
{
    string s, t;
    cin >> s >> t;

    for (int i = 0; i < s.size(); i++)
        if (s.substr(i, t.size()) == t)
        {
            cout << "Yes" << endl;
            return 0;
        }

    cout << "No" << endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?