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.

Sample Input

2
CGAGTCAGCT
CTCC

Sample Output

AGCTCGAGTC
CCCT

长度为n的环状串有n种表示法，分别为从某个位置开始顺时针得到。例如，图3-4的环状串有10种表示：

CGAGTCAGCT，GAGTCAGCTC，AGTCAGCTCG等。在这些表示法中，字典序最小的称为”最小表示”。

输入一个长度为n（n≤100）的环状DNA串（只包含A、C、G、T这4种字符）的一种表示法，你的任务是输出该环状串的最小表示。例如，CTCC的最小表示是CCCT，CGAGTCAGCT的最小表示为AGCTCGAGTC。

#include <stdio.h>
#include <string.h>
#define maxNum 105// 判断以位置p开头的小还是以位置q开头有的小
int comp(const char* s, int p, int q) {int n = strlen(s);for(int i = 0; i < n; i++) {if(s[(p + i) % n] != s[(q + i) % n]) {// 位置q小于位置p返回true// 大于返回falsereturn s[(p + i) % n] < s[(q + i) % n];}}// 相等情况return 0;
}int main() {int T,N;scanf("%d", &T);while(T--) {char s[maxNum];scanf("%s", s);int n = strlen(s);// 记录最小字典序开始位置int pos = 0;for(int i = 0; i < n; i++) {if(comp(s, i, pos)) {pos = i;}}for(int i = 0; i < n; i++) {putchar(s[(pos + i) % n]);}putchar('\n');}return 0;
}

1584 - Circular Sequence相关推荐

【UVA/Codeforces】1584 Circular Sequence / 792B Counting-out Rhyme（就是一个圈儿...）
https://vjudge.net/problem/UVA-1584 1584 Circular Sequence 输入一个字符串,可以以字符串中任意一个字母作为起始,输出字典序最小的那个字符串两 ...
Circular Sequence UVA - 1584
原题及翻译 Some DNA sequences exist in circular forms as in the following figure, which shows a circular ...
UVA1584 Circular Sequence【字符串】
Circular Sequence UVA - 1584 题目传送门题目大意:输入一个环形字符串,需输出其最小字典序的形式的字符串. AC代码: #include <cstdio> #i ...
UVA1584 UVALive3225 Circular Sequence【水题】
Some DNA sequences exist in circular forms as in the following figure, which shows a circular sequ ...
UVa1584 - Circular Sequence
//UVa1584 - Circular Sequence //题目:给你一个环状串,输出它以某一位置为起点时得到最小字典序的串. //分析:从初位置到末位置每次更新字典序较小的起始位置 #inclu ...
例题3-6 环状序列（Circular Sequence）
我的代码(vjudge AC): //Circular Sequence #include <stdio.h> #include <string.h> bool less(co ...
（艾迪茉莉转圈圈~~找最小环）Circular Sequence UVA - 1584
#include<iostream> #include<string.h> #include<stdio.h> using namespace std; char ...
例题3-6 环状序列（Circular Sequence, ACM/ICPC Seoul 2004, UVa1584）
长度为n的环状串有n种表示法,分别为从某个位置开始顺时针得到.例如,图3-4的环状串有10种表示: CGAGTCAGCT,GAGTCAGCTC,AGTCAGCTCG等.在这些表示法中,字典序最小的 ...
算法竞赛入门经典(第二版) | 程序3-10 生成元 (UVa1584,Circular Sequence)
题目概述: 长度为n的环状串有n种表示法, 字典序最小的称为最小表示.输入一个长度为n(n<100)的环状字符串的一种表示方法,输出最小表示 . 如:CTCC 为环状字符串的一种表示方法,它的所 ...

1584 - Circular Sequence

Circular Sequence

1584 - Circular Sequence相关推荐

最新文章

热门文章