CodeForces 363C - Fixing Typos

Many modern text editors automatically check the spelling of the user'stext. Some editors even suggest how to correct typos.

In this problem your task to implement a small functionality to correcttwo types of typos in a word. We will assume that three identical letterstogether is a typo (for example, word "helllo" contains a typo). Besides, a couple of identical lettersimmediately followed by another couple of identical letters is a typo too (forexample, words "helloo" and "wwaatt" contain typos).

Write a code that deletes the minimum number of letters from a word,correcting described typos in the word. You are allowed to delete letters fromboth ends and from the middle of the word.

Input

The single line of the input contains word s, its length is from 1 to 200000 characters. The given word s consists of lowercase English letters.

Output

Print such word t that it doesn't contain any typos described in the problem statement andis obtained from s by deleting the least number of letters.

If there are multiple solutions, print any of them.

Sample test(s)

input

helloo

output

hello

input

woooooow

output

woow

Note

The second valid answer to the test from the statement is "heloo".

 

思路：

有两种输入错误：

1、 同一个字符连续出现3次

2、 两对字符相连

代码：#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;int main(){int len;char temp[200005];while (scanf("%s", temp) != EOF){char c;string st;int l = strlen(temp);int i;bool flag = false;st = temp[0];for (i = 1; i<l; i++){c = temp[i];len = st.length();if (c == st[len - 1]){if (!flag){st += c;flag = true;}}elsest += c;len = st.length();if (len>3 && st[len - 1] != st[len - 2] && st[len - 2] != st[len - 3])flag = false;}cout << st << endl;}return 0;}