Osajono

#include <iostream>
#include <algorithm>
#include <string>

using namespace std;

int main() {
	int lkm = 0;
	string a;

	getline(cin, a);
	int koko = a.size();

	lkm += koko;

	for (int i = 2; i <= koko; i++) //osajoukon koko
	{
		for (int j = 0; j+i-1 < koko; j++) //osajoukon paikat
		{
			if (a.at(j) == a.at(j+i-1))
			lkm++;
		}
	}
	cout << lkm << '\n';
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 12

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED