Ositus

input/code.cpp: In function 'std::vector<std::pair<int, int> > GetCutRanges(std::__cxx11::string)':
input/code.cpp:12:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<s.length();i++)
              ~^~~~~~~~~~~
input/code.cpp:17:9: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(;j<s.length();j++)
        ~^~~~~~~~~~~
input/code.cpp:16:8: warning: variable 'FoundMatchingLetters' set but not used [-Wunused-but-set-variable]
   bool FoundMatchingLetters = false;
        ^~~~~~~~~~~~~~~~~~~~
input/code.cpp: In function 'int calculate2(std::__cxx11::string)':
input/code.cpp:38:19: error: 'pow' was not declared in this scope
  int Multiplier = pow(2, s.length()-1-CutRanges.back().second);
                   ^~~
input/code.cpp:38:19: note: suggested alternative: 'putw'
  int Multiplier = pow(2, s.length()-1-CutRanges.back().second);
                   ^~~
                   putw
input/code...

#include <iostream>
#include <map>
#include <list>
#include <bitset>
#include <vector>

using namespace std;
vector<pair<int, int>> GetCutRanges(string s)
{
	bitset<256> Visited;
	vector<pair<int, int>> CutRanges;
	for(int i=0;i<s.length();i++)
	{
		int j=i+1;
		Visited[i]=true;
		bool FoundMatchingLetters = false;
		for(;j<s.length();j++)
		{
			if(Visited[s[j]])
			{
				FoundMatchingLetters = true;
				pair<int, int> RangeContainsCut = {i, j};
				CutRanges.push_back(RangeContainsCut);
				break;
			}
			Visited[s[i]] = true;
		}
		Visited.reset();
	}
	return CutRanges;
}
int calculate2(string s)
{
	string temp = s;
	vector<pair<int, int>> CutRanges = GetCutRanges(s);
	list<int> OverlapLengths;
	int answer=1;
	int Multiplier = pow(2, s.length()-1-CutRanges.back().second);

	for(int i=0;i<CutRanges.size();i++)
	{
		pair<int,int> CurrentPair = CutRanges[i];
		//cout<<answer<<endl<<CurrentPair.first<<" : "<<CurrentPair.second<<endl;
		answer*= pow(2, CurrentPair.second-CurrentPair.first-1);
		if(CurrentPair!=CutRanges.back() && CutRanges[i+1].first<CurrentPair.second)
		{
			const int OverlapLength = CurrentPair.second-CutRanges[i+1].first+1;
			OverlapLengths.push_back(OverlapLength);
		}
	}
	for(int i : OverlapLengths)
	{
		answer+=i+1;
	}
	if(OverlapLengths.size()==0)
	{
		answer++;
	}
	answer*=Multiplier;
	//cout<<endl<<answer;
	return answer;
}
int main()
{
	string s;
	cin>>s;
	cout<<calculate2(s);
	return 0;
}