using namespace std;
if(str[i]=='a' || str[i]=='b')
if(str[i-1]=='a' || str[i+1]=='a')
- Problem Description
Little robot CJ-17 is exploring ancient ruins. He found a piece of paper with a word written on it. Fortunately, people who used to live at this location several thousand years ago used only two letters of modern English alphabet: ‘a’ and ‘b’.
It’s also known, that no ancient word contains two letters ‘a’ in a row. CJ-17 has already recognised some of the word letters, the others are still unknown.
CJ-17 wants to look up all valid words that could be written on this paper in an ancient dictionary. He needs your help. Find him the word, which is the first in alphabetical order and could be written on the paper.
The first line contains non-empty string s consisting of ‘a’, ‘b’ and ‘?’ characters. Character ‘?’ corresponds to unrecognized letter.
It’s guaranteed, that there exists at least one ancient word, that could be written on the paper.
Length of s is at most 50.
Output the first in alphabetical order word, that could be written on the paper, found by CJ-17.
- Test Case 1
- Test Case 2