0分求调

#include <bits/stdc++.h>
using namespace std;
long long tnt = 0;

string e(string a1) {
	for (int i = 0; i < a1.size(); i++) {
		if (a1[i] != a1[a1.size() - 1 - i]) {
			tnt = 1;
		}
	}
}

/*你已经入以及战备状态，加油亖伞兵*/
int main() {
	string a;
	cin >> a;
	string b[1000];
	long long c = 0;
	for (long long i = 1; i <= a.size(); i++) {
		for (long long j = 0; j < i; j++) {
			if (a.size() < i) {
				for (long long z = 0; z <= a.size(); z++) {
					b[c] += a[z];
				}
				c++;
				break;
			}
			b[c] += a[j];

		}
		a.erase(0, i);
		c++;
	}
//	for (int i = 0; i < c; i++) {
//		cout << b[i] << ' ';
//	}
	long long cnt = 0;
	for (long long i = 0; i < cnt; i++) {
		cout << e(b[i]) << endl << endl << endl;
		if (tnt == 0) {
			cnt++;
		}
	}
	tnt = 0;
	cout << cnt  << endl;

	return 0;
}