2013ACM/ICPC湘潭多省程序设计竞赛暨湘潭市第五届大学生程序设计竞赛

Hurry Up

// File Name:  Jack’s sequence 1177.cpp
// Author: sheng
// Created Time: 2013年05月12日 星期日 21时58分06秒

#include <stdio.h>
#include <iostream>
#include <string.h>
using namespace std;

const int max_n = 10010;
char bg[max_n];
int sign[max_n];

int main ()
{
int n, tag;
int cnt;
int cun;
scanf ("%d", &n);
getchar();
while (n--)
{
cnt = cun = 0;
scanf ("%s", bg);
memset (sign, 0, sizeof (sign));
int len = strlen (bg);
for (int i = 0; i < len; i ++)
{
if (bg[i] == '(')
{
cnt ++;
tag = 0;
}
else
{
cnt --;
if (cnt > 0 && !tag)
sign[cun++] = tag = i - 1;
}
}
tag = 0;
cnt = 0;
for (int i = cun - 1; i >= 0; i --)
{
if ( sign[i])
{
tag = sign[i];
break;
}
}
if (!tag)
{
cout << "No solution\n";
continue;
}
for (int i = 0; i < tag; i ++)
{
cout << bg[i];
if (bg[i] == '(')
cnt ++;
else cnt --;
}
cnt --;
cout << ")";
for (int i = 0; i < (len - cnt - tag)/2; i ++)
cout << "(";
for (int i = 0; i < (len - tag + cnt)/2; i ++)
cout << ")";
cout << endl;
}
return 0;
}