3438 Look and Say
2010-08-08 10:37
441 查看
Look and Say
Description
The look and say sequence is defined as follows. Start with any string of digits as the first element in the sequence. Each subsequent element is defined from the previous one by "verbally" describing the previous element. For example, the string 122344111 can be described as "one 1, two 2's, one 3, two 4's, three 1's". Therefore, the element that comes after 122344111 in the sequence is 1122132431. Similarly, the string 101 comes after 1111111111. Notice that it is generally not possible to uniquely identify the previous element of a particular element. For example, a string of 112213243 1's also yields 1122132431 as the next element.
Input
The input consists of a number of cases. The first line gives the number of cases to follow. Each case consists of a line of up to 1000 digits.
Output
For each test case, print the string that follows the given string.
Sample Input
Sample Output
Time Limit: 5000MS | Memory Limit: 65536K | |
Total Submissions: 6174 | Accepted: 3731 |
The look and say sequence is defined as follows. Start with any string of digits as the first element in the sequence. Each subsequent element is defined from the previous one by "verbally" describing the previous element. For example, the string 122344111 can be described as "one 1, two 2's, one 3, two 4's, three 1's". Therefore, the element that comes after 122344111 in the sequence is 1122132431. Similarly, the string 101 comes after 1111111111. Notice that it is generally not possible to uniquely identify the previous element of a particular element. For example, a string of 112213243 1's also yields 1122132431 as the next element.
Input
The input consists of a number of cases. The first line gives the number of cases to follow. Each case consists of a line of up to 1000 digits.
Output
For each test case, print the string that follows the given string.
Sample Input
3 122344111 1111111111 12345
Sample Output
1122132431 101 1112131415
水题,秒杀之!
#include<iostream> using namespace std; char s[1008]; int main() { int T,i; cin>>T; while(T--) { cin>>s; int len=strlen(s),count=1; for(i=0;i<len;i++) { if(s[i]==s[i+1]) count++; else { cout<<count<<s[i]; count=1; } } cout<<endl; } return 0; }[/code]
相关文章推荐
- PKU 3438 look and say
- poj--3438--LOOK and SAY
- POJ 3438 Look and Say
- POJ 3438 Look and Say(我的水题之路——N个M的队列)
- POJ 3438 Look and Say(水题)
- Look and Say-3438
- POJ 3438 Look and Say (水题)
- POJ 3438 Look and Say G++
- POJ 3438 Look and Say(水~)
- poj 3438 Look and Say
- POJ 3438:Look and Say
- POJ 3438:Look and Say
- HDU 1020 Encoding POJ 3438 Look and Say
- poj3438_Look and Say_暴力水
- zoj 2886 Look and Say
- 1491. Look and Say
- Sicily 1491 Look and Say
- PHP look and say 序列
- Look and Say 序列的Java实现
- POJ3438-Look and Say