Language: C++

//int a = stoi(c); 文字列をintへ
//小文字から大文字
//transform(a.begin(), a.end(), a.begin(), ::toupper);
//数値計算 個数以外はdouble
//map<キー,値> p は辞書。p[キー] = 値
//map 全探索
//auto begin = p.begin(), end = p.end();
//for (auto it = begin; it != end; it++) {}
//mapのキー：it->first mapのバリュー：it->second
//大文字判定 isupper(文字) 小文字判定 islower(文字)
//do{}while(next_permutation(ALL(配列)))
//while(N)で回すとき、Nはコピーを作っておく
//小文字に対応する文字コード：S[i] - 'a'
//文字コード→小文字：(char)(数字+'a')
//グラフの距離:隣接行列で扱う
//等価なものに変換する思考
//bool型　初期値はTrue
//島渡りの問題：中間ノードに着目
//配列はvector<>を使う：意味わからないエラーがなくなる。
//背反な事象にちゃんとわける
//チェックリストはマップを使う
//数が大きい時の比較はstring型で行う
//またはかかつか
//例外処理は最初にする
//x = p^m + q^n...の約数の個数:(n+1)*(m+1)....
//N!のどの素因数で何回割れるか
//⇔1~Nまでの数がそれぞれどの素因数で何回割り切れるかの和
//パズルの問題->一般化して全探索
//数が大きい時のせぐふぉはコードテストで試してみる
//stack<ll> s;
//s.push(要素);s.top();s.pop();
//queue<ll> q;
//q.push(要素);q.front();q.pop();
#include <bits/stdc++.h>
#define rep(i,N) for(int i = 0; i < N;i++)
#define ALL(a) (a).begin(),(a).end()
#define ll long long int
#define MAX_E 10
#define MAX_V 10
#define INF 1e+10
using namespace std;

//円周率
const double PI = 3.14159265358979323846;
//割るやつ
const ll M = (pow(10, 9) + 7);

// K進数でのNの桁数
ll dig(ll N, ll K) {
	ll dig = 0;
	while (N) {
		dig++;
		N /= K;
	}
	return dig;
}
// a,bの最大公約数
ll gcd(ll a, ll b) {
	if (b == 0) return a;
	return gcd(b, a%b);
}

ll lcm(ll a, ll b) {
	ll g = gcd(a, b);
	return a / g * b;
}

//nC2の計算
ll C(ll N) {
	return N * (N - 1) / 2;
}

//階乗計算
ll f(ll n) {
	if (n == 0 || n == 1) return 1;
	else return (n%M) * (f(n - 1) % M);
}

//Nをdで何回割れるか
ll divcnt(ll N, ll d) {
	ll ans = 0;
	while (1) {
		if (N%d == 0) {
			ans++;
			N /= d;
		}
		else break;
	}

	return ans;
}

//素数判定
bool prime(ll num) {
	if (num < 2) return false;
	else if (num == 2) return true;
	else if (num % 2 == 0) return false;
	double sqrtNum = sqrt(num);
	for (int i = 3; i <= sqrtNum; i += 2) {
		if (num % i == 0) return false;
	}
	return true;
}

//フィボナッチ数列
vector<ll> memo(pow(10, 6) + 1);
ll fibo(ll n) {
	if (n == 1) return 1;
	else if (n == 2) return 1;
	else if (memo[n] != 0) return memo[n];
	else return memo[n] = fibo(n - 1) + f(n - 2);
}

int cost[MAX_V][MAX_E];
rep(i, MAX_V)rep(j, MAX_E)cost[i][j] = 1e10;
bool used[MAX_V];
int V;
int prev[MAX_V];

void dijkstra(int s) {
	fill(d, d + V, INF);
	fill(used, used + V.false);
	fill(prev, prev + V.-1);
	d[s] = 0;

	while (true) {
		int v = -1;
		for (int u = 0; u < V; u++) {
			if (!used[u] && (v == -1 || d[u] < d[v])) v = u;
		}

		if (v == -1)break;
		used[v] = true;

		for (int u = 0; u < V; u++) {
			if (d[u] > d[v] + cost[v][u]) {
				d[u] = d[v] + cost[v][u];
				prev[u] = v;
			}
		}
	}
}

vector<int> get_path(int t) {
	vector<int> path;
	for (; t != -1; t = prev[t]) path.push_back(t);
	reverse(path.begin(), path.end());
	return path;
}

int main() {
	string S, T; cin >> S >> T;
	
	rep(i, S.size()) {
		if (S[i] != T[i]) {
			cout << "No" << endl;
			return 0;
		}
	}

	cout << "Yes" << endl;
}

Compiler output:
a.cc:35:18: error: expected unqualified-id before 'for'
   35 | #define rep(i,N) for(int i = 0; i < N;i++)
      |                  ^~~
a.cc:115:1: note: in expansion of macro 'rep'
  115 | rep(i, MAX_V)rep(j, MAX_E)cost[i][j] = 1e10;
      | ^~~
a.cc:115:5: error: 'i' does not name a type
  115 | rep(i, MAX_V)rep(j, MAX_E)cost[i][j] = 1e10;
      |     ^
a.cc:35:33: note: in definition of macro 'rep'
   35 | #define rep(i,N) for(int i = 0; i < N;i++)
      |                                 ^
a.cc:115:5: error: 'i' does not name a type
  115 | rep(i, MAX_V)rep(j, MAX_E)cost[i][j] = 1e10;
      |     ^
a.cc:35:39: note: in definition of macro 'rep'
   35 | #define rep(i,N) for(int i = 0; i < N;i++)
      |                                       ^
a.cc:115:18: error: 'j' does not name a type
  115 | rep(i, MAX_V)rep(j, MAX_E)cost[i][j] = 1e10;
      |                  ^
a.cc:35:33: note: in definition of macro 'rep'
   35 | #define rep(i,N) for(int i = 0; i < N;i++)
      |                                 ^
a.cc:115:18: error: 'j' does not name a type
  115 | rep(i, MAX_V)rep(j, MAX_E)cost[i][j] = 1e10;
      |                  ^
a.cc:35:39: note: in definition of macro 'rep'
   35 | #define rep(i,N) for(int i = 0; i < N;i++)
      |                                       ^
a.cc: In function 'void dijkstra(int)':
a.cc:121:14: error: 'd' was not declared in this scope
  121 |         fill(d, d + V, INF);
      |              ^
a.cc:122:29: error: expected unqualified-id before 'false'
  122 |         fill(used, used + V.false);
      |                             ^~~~~
a.cc:123:14: error: reference to 'prev' is ambiguous
  123 |         fill(prev, prev + V.-1);
      |              ^~~~
In file included from /usr/include/c++/14/bits/stl_algobase.h:66,
                 from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:34:
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:244:5: note: candidates are: 'template<class _BidirectionalIterator> constexpr _BidirectionalIterator std::prev(_BidirectionalIterator, typename iterator_traits<_Iter>::difference_type)'
  244 |     prev(_BidirectionalIterator __x, typename
      |     ^~~~
a.cc:118:5: note:                 'int prev [10]'
  118 | int prev[MAX_V];
      |     ^~~~
a.cc:123:20: error: reference to 'prev' is ambiguous
  123 |         fill(prev, prev + V.-1);
      |                    ^~~~
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:244:5: note: candidates are: 'template<class _BidirectionalIterator> constexpr _BidirectionalIterator std::prev(_BidirectionalIterator, typename iterator_traits<_Iter>::difference_type)'
  244 |     prev(_BidirectionalIterator __x, typename
      |     ^~~~
a.cc:118:5: note:                 'int prev [10]'
  118 | int prev[MAX_V];
      |     ^~~~
a.cc:123:29: error: expected unqualified-id before '-' token
  123 |         fill(prev, prev + V.-1);
      |                             ^
a.cc:138:33: error: reference to 'prev' is ambiguous
  138 |                                 prev[u] = v;
      |                                 ^~~~
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:244:5: note: candidates are: 'template<class _BidirectionalIterator> constexpr _BidirectionalIterator std::prev(_BidirectionalIterator, typename iterator_traits<_Iter>::difference_type)'
  244 |     prev(_BidirectionalIterator __x, typename
      |     ^~~~
a.cc:118:5: note:                 'int prev [10]'
  118 | int prev[MAX_V];
      |     ^~~~
a.cc: In function 'std::vector<int> get_path(int)':
a.cc:146:29: error: reference to 'prev' is ambiguous
  146 |         for (; t != -1; t = prev[t]) path.push_back(t);
      |                             ^~~~
/usr/include/c++/14/bits/stl_iterator_base_funcs.h:244:5: note: candidates are: 'template<class _BidirectionalIterator> constexpr _BidirectionalIterator std::prev(_BidirectionalIterator, typename iterator_traits<_Iter>::difference_type)'
  244 |     prev(_BidirectionalIterator __x, typename
      |     ^~~~
a.cc:118:5: note:                 'int prev [10]'
  118 | int prev[MAX_V];
      |     ^~~~