No Pain No Gain

AleiChan（陈福元）,互联网爱好者。

UVA-1584 - Circular Sequence

/***************************************/

/***************************************/

Some DNA sequences exist in circular forms as in the following figure, which shows a circular sequence CGAGTCAGCT", that is, the last symbol T" in CGAGTCAGCT" is connected to the first symbol C". We always read a circular sequence in the clockwise direction.

Since it is not easy to store a circular sequence in a computer as it is, we decided to store it as a linear sequence. However, there can be many linear sequences that are obtained from a circular sequence by cutting any place of the circular sequence. Hence, we also decided to store the linear sequence that is lexicographically smallest among all linear sequences that can be obtained from a circular sequence.

Your task is to find the lexicographically smallest sequence from a given circular sequence. For the example in the figure, the lexicographically smallest sequence is AGCTCGAGTC". If there are two or more linear sequences that are lexicographically smallest, you are to find any one of them (in fact, they are the same).

Input

The input consists of T test cases. The number of test cases T is given on the first line of the input file. Each test case takes one line containing a circular sequence that is written as an arbitrary linear sequence. Since the circular sequences are DNA sequences, only four symbols, A, C, G and T, are allowed. Each sequence has length at least 2 and at most 100.

Output

Print exactly one line for each test case. The line is to contain the lexicographically smallest sequence for the test case.

The following shows sample input and output for two test cases.

//题解

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

int T;
string s;

int main()
{
scanf("%d", &T);
while(T--)
{
cin>> s;
int s_length = s.length();
vector<string> v(s_length);//存储所有可能的序列
for(int i = 0; i < s_length; ++i)
{
v[i] = s.substr(i) + s;
v[i].erase(s_length);
}
sort(v.begin(), v.end());
cout<<v[0]<<endl;
}
return 0;
}

UVa-1584 Circular Sequence

2015-02-14 03:17:14

UVA-1584 Circular Sequence

2017-02-26 15:13:53

环状序列（Circular Sequence, ACM/ICPC Seoul 2004, UVa1584）

2016-02-02 21:11:32

Linux核心数据结构

2006-11-01 14:34:00

环形字符串比较-环状序列3.6circular sequence

2017-01-07 14:00:41

Circular Sequence

2014-05-07 15:20:00

数据结构_费布拉契数列

2013年10月25日 2KB 下载

157.Examine the commands executed in the following sequence: 1: SQL> CREATE ROLE mgrrole; 2: SQL> G

2016-08-07 13:23:55

几种基本数据结构

2014年05月13日 6KB 下载

F - Circular Sequence

2017-04-03 20:30:49