Language: C++

//#include<iostream>
//#include<algorithm>
//#include<string>
//#include<cstring>
//#include<queue>
//#include<stack>
//#include<cmath>
//#include<set>
//#include<vector>
//#include<map>
//#include<unordered_map>
//
//#define ll long long
//using namespace  std;
//int gcd(int a, int b) {
//	return b == 0 ? a : gcd(b, a%b);
//}
//ll qpow(ll a, ll b) {
//	ll ans = 1, base = a;
//	while (b) {
//		if (b & 1) {
//			ans *= base;
//		}
//		base *= base;
//		b >>= 1;
//	}
//	return ans;
//}
///*A*/
//int y1[100], y2[100];
//set<int> s1[20010] , s2[20010];
//int vis[20010];
//map<int,int> mp;
//int main() {
//	ios::sync_with_stdio(0);
//	int n, m; cin >> n >> m;
// 
//	for (int i = 1; i <= n; ++i) {
//		cin >> y1[i];  
//	}
//	for (int i = 1; i <= m; ++i) {
//		cin >> y2[i];  
//	}
//	 
//	for (int i = 1; i <= n; ++i) {
//		for (int j = 1; j <= m; ++j) {
//			s1[y1[i] + y2[j]].insert(y1[i]);
//			s2[y1[i] + y2[j]].insert(y2[j]);
//			if (!vis[y1[i] + y2[j]])
//			{
//				vis[y1[i] + y2[j]] = 1;
//				mp[y1[i] + y2[j]] ++;
//			}
//			else {
//				mp[y1[i] + y2[j]] ++;
//			}
//		}
//		
//	}
//	for (int i = ) {
//		for (int j =  ) {
//			
//		}
//	}
//
//}
///*B*/
////const int N = 2e5 + 5;
////int a[N];
////
////int main() {
////	ios::sync_with_stdio(0);
////	int n, x; cin >> n >> x;
////	for (int i = 1; i <= n; ++i) {
////		cin >> a[i];
////	}
////
////}
///*C*/
////multiset<ll> s;
////int main() {
////	ios::sync_with_stdio(0);
////	int t; cin >> t;
////	char opt;
////	while (t--) {
////		cin >> opt;
////		if (opt == '+') {
////			ll a; cin >> a; s.insert(a);
////		}
////		else if (opt == '-') {
////			ll a; cin >> a; 
////			s.erase(s.find(a));
////		}
////		else if (opt == '?') {
////			string str; cin >> str;
////			int cnt = 0, len = str.length();
////			int flag = 0, fir1=0,cnt1=0;
////			for (int i = 0; i < len; ++i) {
////				if (str[i] == '1') {
////					cnt1++; fir1 = len - i; break;
////				}
////			}
////			
////			for (ll m : s) {
////				flag = 0;
////				int len1 = len;
////				if (fir1 > 1 && m / qpow(10, fir1 - 1) == 0) {
////					continue;
////				}
////				while (m / qpow(10, len1 - 1) == 0) {
////					len1--;
////				}
////				string str1 = str.substr(len - len1, len1);
////				//if (cnt1 > 0&& m / qpow(10, len1 - 1) == 0)
////				//{
////				//	/*for (int i = 0; i < len; ++i) {
////				//		if (str[i] == '1') {
////				//			fir1 = len - i; break;
////				//		}
////				//		else if (str[i] == '0') {
////				//			while (str[i] == '0') {
////				//				++i;
////				//			}
////				//			str = str.substr(i, len - i);
////				//			len = str.length();
////				//			i = -1;
////				//		}
////				//	}*/
////				//}
////				
////				for (int i = 0; i <= len1-1; ++i) {
////					if (str1[i] == '0') {
////						ll temp = qpow(10, len1 - i - 1);;
////						ll m1 = m / temp;
////						m -= m1 * temp;
////						if (m1 % 2ll == 0) {
////							continue;
////						}
////						else {
////							flag = 1; break;
////						}
////					}
////					else if (str1[i] == '1') {
////						ll temp = qpow(10, len1 - i - 1);;
////						ll m1 = m / temp;
////						m -= m1 * temp;
////						if (m1 % 2ll) {
////							continue;
////						}
////						else {
////							flag = 1; break;
////						}
////					}
////				}
////				if (flag) {
////					continue;
////				}
////				else {
////					cnt++;
////				}
////			}
////			cout << cnt << '\n';
////		}
////	}
////
////}
////const int N = 1e6 + 5;
////map<ll,ll> sum;
////
////ll get(const string& str) {
////	int len = str.length();ll res = 0;
////	for (int i = 0; i < len; ++i) {
////		int tmp = str[i] - '0';
////		if (tmp % 2) {
////			res++;
////		}
////		res <<= 1;
////	}
////	return res;
////}
////int main() {
////	ios::sync_with_stdio(0);
////	int t; cin >> t;
////	char opt; string str;
////	while (t--) {
////		cin >> opt>>str;
////		ll ans = get(str);
////		if (opt == '+') {
////			sum[ans] ++;
////		}
////		else if (opt == '-') {
////			sum[ans] --;
////		}
////		else if (opt == '?') {
////			cout << sum[ans] << '\n';
////		}
////	}
////
////}
///*D*/
//
////int main() {
////	ios::sync_with_stdio(0);
////
////
////}
///*E*/
////const int N = 3005;
////int a[N];
////int n,ans= 0x1f3f3f3f,sum;
//// 
////int main() {
////	ios::sync_with_stdio(0);
////	cin >> n;
////	for (int i = 1; i <= n; ++i) {
////		cin >> a[i];
////	}
////	for (int i = 1; i <= n; ++i) {
////		 
////		for (int j = 1; j <= n; ++j) {
////			if (j!=i) {
////				if (i > j&&a[j] > a[i] - (i - j)) {
////					sum += a[j] - (a[i] - (i - j));
////				}
////				
////				if (j > i&&a[j] < a[i] + (j - i)) {
////					sum += a[i] + (j - i)- a[j]  ;
////				}
////	 
////			}
////		}
////		ans = min(ans, sum);
////		sum = 0;
////	}
////	cout << ans << '\n';
////}
///*F*/
////const int N = 1e5 + 5;
////int n, m, len= 0x3f3f3f3f;
////int main() {
////	ios::sync_with_stdio(0);
////	cin >> n >> m;
////
////	for (int i = 1; i <= m; ++i) {
////		int l, r;
////		cin >> l >> r;
////		len = min(len, r - l + 1);
////	}
////	cout << len << '\n';
////	int num = 0;
////	for (int i = 1; i <= n; ++i) {
////		cout << num << ' ';
////		num = (num + 1) % len;
////	}
////	
////
////}
///*G*/
//
////int main() {
////	ios::sync_with_stdio(0);
////
////
////}

Compiler output:
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/14/../../../x86_64-linux-gnu/Scrt1.o: in function `_start':
(.text+0x17): undefined reference to `main'
collect2: error: ld returned 1 exit status