Osajono

#include <iostream>
#include <list>
#include <algorithm>
#include <string>
using namespace std;
 
int main() {
	cin.sync_with_stdio(false);
 
	string Merkkijono;
	list<string> l;
 
	getline(cin, Merkkijono);
 
	int count = Merkkijono.length();
	int letters = count;
	if(Merkkijono[0] == Merkkijono[letters-1]) count++;
 
	for(int i = 0; i<letters-1; i++){
		for(int w = 2; w<letters; w++){
			string temp = Merkkijono.substr(i,w);
			if(temp[0] == temp[temp.length()-1]){
				if(!(find(l.begin(), l.end(), temp) != l.end())){
					l.push_back(temp);
				}
			}
		}
	}
	int Total = count + l.size();
	cout << Total;
	return 0;
}

Test 1

Group: 1

Verdict: WRONG ANSWER

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: WRONG ANSWER

Test 4

Group: 1

Verdict: WRONG ANSWER

Test 5

Group: 1

Verdict: WRONG ANSWER

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: RUNTIME ERROR

Test 12

Group: 3

Verdict: RUNTIME ERROR

Test 13

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 14

Group: 3

Verdict: TIME LIMIT EXCEEDED

Test 15

Group: 3

Verdict: TIME LIMIT EXCEEDED