UVa1584 - Circular Sequence
来源:互联网 发布:js 小数点后保留两位 编辑:程序博客网 时间:2024/04/29 22:11
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
#include <iostream>#include <string>#include <fstream>#include <vector>#include <algorithm>using namespace std;void solve(string s);int main(){#ifndef ONLINE_JUDGEifstream fin("d:\\OJ\\uva_in.txt");streambuf *old = cin.rdbuf(fin.rdbuf());#endifint t;cin >> t;while (t--) {string s;cin >> s;solve(s);}#ifndef ONLINE_JUDGEcin.rdbuf(old);#endifreturn 0;}void solve(string s){vector<string> vStr;vStr.push_back(s);for (size_t i = 1, len = s.length(); i < len; i++) {string tmp;tmp.append(s, i, len - i);tmp.append(s, 0, i);vStr.push_back(tmp);}sort(vStr.begin(), vStr.end());cout << vStr.front() << endl;}
- UVa1584 - Circular Sequence
- UVA1584 - Circular Sequence
- uva1584 - Circular Sequence
- uva1584 Circular Sequence
- UVA1584 UVALive3225 Circular Sequence
- UVa1584 Circular Sequence
- UVa1584 - Circular Sequence
- UVa1584-Circular Sequence
- UVa1584——Circular Sequence
- UVa1584 环状序列 (Circular Sequence)
- Uva1584-环状序列-Circular Sequence-字典序
- 环状序列(Circular Sequence, ACM/ICPC Seoul 2004, UVa1584)
- uva1583 Digit Generator && uva1584 Circular Sequence(水)
- UVa1584 Circular Sequence(环状序列) (java版本)
- UVA1584 - Circular Sequence 循环字符串比较的技巧
- 环装序列 (Circular Sequence, ACM/ICPC Seoul 2004, UVa1584)
- 环状序列(Circular Sequence, ACM/ICPC Seoul 2004, UVa1584)
- 《算法竞赛入门经典2ndEdition 》例题3-6 环状序列(Circular Sequence, Uva1584)
- Animation
- Oracle递归查询
- 【Nginx】HTTP配置模型
- Jsp内置对象
- CloudFoundry 中的GoRouter性能测试
- UVa1584 - Circular Sequence
- [Cocos2d-x]Mac下cocos2d-x连接pomelo服务器
- iOS开发 日常错误积累
- 单元测试、集成测试、确认测试、系统测试、验收测试
- IIS 维护 app_offline
- XML解析之SAX
- jQuery 的各种选择器
- UI笔记_UIAlertView
- C+中继承和部分泛型编程