For this Question: A string is called beautiful if it can be represented by two or more consecutive numbers. Given a string S check if it is beautiful or not.

Note:- The numbers should not contain leading zeroes in it i. e string "10203" ("1" + "02" + "03") will not be treated as a beautiful stringInput contains a single string containing the string S.

Constraints:-
1 <= |S| <= 32Print "YES" if the given string is beautiful and print the first number of the sequence else print "NO".Sample Input:-
101112

Sample Output:-
YES 10

Explanation:-
Given string can be broken as "10" + "11" + "12"

Sample Input:-
101111

Sample Output:-
NO, I have written this Solution Code: #include <sstream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <string>
#include <cassert>
#include <ctime>
#include <map>
#include <math.h>
#include <cstdio>
#include <set>
#include <deque>
#include <memory.h>
#include <queue>

#pragma comment(linker, "/STACK:64000000")
typedef long long ll;

using namespace std;

const int MAXK = -1;
const int MAXN = -1;
const int MOD = 0; // 1000 * 1000 * 1000 + 7;



int main() {
#ifdef _MSC_VER
	freopen("input.txt", "r", stdin);
#endif

	int T;
	T=1;
	while (T--) {
		string s;
		cin >> s;
		int n = s.length();

		ll ans = -1;
		for (int len = 1; len * 2 <= n; len++) {
			ll x = 0;
			for (int i = 0; i < len; i++) x = 10 * x + (s[i] - '0');
			string t = "";
			ll x0 = x;
			while (t.length() < s.length()) t += to_string(x++);
			if (s == t) {
				ans = x0;
				break;
			}
		}
		if (ans == -1) cout << "NO" << endl;
		else cout << "YES " << ans << endl;
	}

	return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?