Osajono

#include <iostream>
#include <list>
#include <algorithm>
#include <string>
using namespace std;

int GetCombination(int width, int letters, string Merkkijono){
	int c = 0;
	for(int i=0; i<letters-width+1; i++){
		int w = width;
		string temp = Merkkijono.substr(i,w);
		if(temp[0] == temp[temp.length()-1]){
			c++;
		}
	}

	return c;
}

int main() {
	cin.sync_with_stdio(false);

	string Merkkijono;

	getline(cin, Merkkijono);

	int count = 0;
	int letters = Merkkijono.length();
	if(Merkkijono[0] == Merkkijono[letters-1]) count++;

	for(int x = 1; x<letters;x++){
		count += GetCombination(x,letters,Merkkijono);
	}

	cout << count;
	return 0;
}

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: TIME LIMIT EXCEEDED

Test 7

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 8

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 9

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2

Verdict: TIME LIMIT EXCEEDED

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