For this Question: You are given two strings S and T consisting of lowercase English letters. Determine if S is a prefix of T.The input contains two strings separated by a new line.
S
T

<b>Constraints</b>
S and T are strings of lengths between 1 and 100 (inclusive) consisting of lowercase English letters.Print "Yes" if S is a prefix of T, "No" otherwise. 

Note: that the judge is case-sensitive.<b>Sample Input 1</b> 
new
newton
<b>Sample Output 1</b> 
Yes

<b>Sample Input 2</b> 
ewt
newton
<b>Sample Output 2</b> 
No

<b>Sample Input 3</b> 
aaaa
aa
<b>Sample Output 3</b> 
No, I have written this Solution Code: #include <iostream>
using namespace std;
int main(void)
{
  string s, t;
  cin >> s >> t;
  
  if(s.size() > t.size()){
    cout << "No" << endl;
    return 0;
  }
  
  for(int i = 0; i < (int)s.size(); i++){
    if(s[i] != t[i]){
      cout << "No" << endl;
      return 0;
    }
  }
  cout << "Yes" << endl;
  
  return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?