broken keyboards
来源:互联网 发布:微信炸金花源码 编辑:程序博客网 时间:2024/06/05 15:30
You're typing a long text with a broken keyboard. Well it's not so badly broken. The only problem
with the keyboard is that sometimes the \home" key or the \end" key gets automatically pressed
(internally).
You're not aware of this issue, since you're focusing on the text and did not even turn on the
monitor! After you nished typing, you can see a text on the screen (if you turn on the monitor).
In Chinese, we can call it Beiju. Your task is to nd the Beiju text.
Input
There are several test cases. Each test case is a single line containing at least one and at most 100,000
letters, underscores and two special characters `[' and `]'. `[' means the \Home" key is pressed
internally, and `]' means the \End" key is pressed internally. The input is terminated by end-of- le
(EOF).
Output
For each case, print the Beiju text on the screen.
Sample Input
This_is_a_[Beiju]_text
[[]][][]Happy_Birthday_to_Tsinghua_University
Sample Output
BeijuThis_is_a__text
with the keyboard is that sometimes the \home" key or the \end" key gets automatically pressed
(internally).
You're not aware of this issue, since you're focusing on the text and did not even turn on the
monitor! After you nished typing, you can see a text on the screen (if you turn on the monitor).
In Chinese, we can call it Beiju. Your task is to nd the Beiju text.
Input
There are several test cases. Each test case is a single line containing at least one and at most 100,000
letters, underscores and two special characters `[' and `]'. `[' means the \Home" key is pressed
internally, and `]' means the \End" key is pressed internally. The input is terminated by end-of- le
(EOF).
Output
For each case, print the Beiju text on the screen.
Sample Input
This_is_a_[Beiju]_text
[[]][][]Happy_Birthday_to_Tsinghua_University
Sample Output
BeijuThis_is_a__text
Happy_Birthday_to_Tsinghua_University
代码如下:
#include<iostream>
#include<string.h>
using namespace std;
char s[1000007];
int c,l,next[1000007];
int main()
{
int i;
while(cin>>s+1)
{
int n=strlen(s+1);
c=l=0;
next[0]=0;
for(i=1;i<=n;i++)
{
if(s[i]=='[')
c=0;
else if(s[i]==']')
c=l;
else
{
next[i]=next[c];
next[c]=i;
if(c==l)
l=i;
c=i;
}
}
for(i=next[0];i!=0;i=next[i])
{
cout<<s[i];
}
cout<<endl;
}
}
0 0
- broken keyboards
- 【Algorithm】Keyboards
- Virtual Keyboards on iPhone and Android
- 《iOS Human Interface Guidelines》——Keyboards and Input Views
- Broken Necklace
- broken pipe
- Broken Necklace
- Broken Necklace
- Broken Necklace
- Broken Necklace
- Broken Necklace
- broken pipe
- broken necklace
- Broken Necklace
- Broken Necklace
- Broken Necklace
- Broken Necklace
- Heart-broken
- 数据结构与算法,每日一道
- Centos/Ubuntu环境下安装mysql
- 应用数据存储方式(XML属性列表-plist)
- TypeScript 入门11
- java写库读库相关
- broken keyboards
- TypeScript学习1
- Python eval函数
- 程序员到底是一个什么职业?
- [从头学数学] 第79节 多边形的面积
- 6.UIScrollView与UIPageControl的认识
- tomcat项目加载报错
- web storage简述
- 292. Nim Game LeetCode