Problem 001——Tex Quotes
2014-10-30 06:46
162 查看
Problem 001
TeX
Quotes
TeX is a typesetting language developed by Donald Knuth. It
takes source text together with a few typesetting instructions and
produces, one hopes, a beautiful document. Beautiful documents use
`` and " to delimit quotations, rather than the mundane "
which is what is provided by most keyboards. Keyboards typically do
not have an oriented double-quote, but they do have a
left-single-quote ` and a right-single-quote '.
Check your keyboard now to locate the left-single-quote key
` (sometimes called the ``backquote key") and the
right-single-quote key ' (sometimes called the
``apostrophe" or just ``quote"). Be careful not to confuse the
left-single-quote ` with the ``backslash" key
`` to create a left-double-quote `` and two
right-single-quotes '' to create a right-double-quote ''.
Most typists, however, are accustomed to delimiting their
quotations with the un-oriented double-quote ".
If the source contained
"To be or not to be," quoth the bard, "that is the
question."
then the typeset document produced by TeX would not contain the
desired form:
``To be or not to be," quoth the bard, ``that is the
question."
In order to produce the desired form, the source file must
contain the sequence:
``To be or not to be,'' quoth the bard, ``that is the
question.''
You are to write a program which converts text containing
double-quote (") characters into text that is identical
except that double-quotes have been replaced by the two-character
sequences required by TeX for delimiting quotations with oriented
double-quotes. The double-quote (") characters should be
replaced appropriately by either `` if the "
opens a quotation and by '' if the " closes a
quotation. Notice that the question of nested quotations does not
arise: The first " must be replaced by ``, the
next by '', the next by ``, the next by
'', the next by ``, the next by '', and
so on.
Input and
Input will consist of several lines of text containing an even
number of double-quote (") characters. Input is ended with
an end-of-file character. The text must be output exactly as it was
input except that:
the first " in each pair is replaced by two `
characters: `` and
the second " in each pair is replaced by two
' characters: ''.
Sample
TeX
Quotes
TeX is a typesetting language developed by Donald Knuth. It
takes source text together with a few typesetting instructions and
produces, one hopes, a beautiful document. Beautiful documents use
`` and " to delimit quotations, rather than the mundane "
which is what is provided by most keyboards. Keyboards typically do
not have an oriented double-quote, but they do have a
left-single-quote ` and a right-single-quote '.
Check your keyboard now to locate the left-single-quote key
` (sometimes called the ``backquote key") and the
right-single-quote key ' (sometimes called the
``apostrophe" or just ``quote"). Be careful not to confuse the
left-single-quote ` with the ``backslash" key
\. TeX lets the user type two left-single-quotes
`` to create a left-double-quote `` and two
right-single-quotes '' to create a right-double-quote ''.
Most typists, however, are accustomed to delimiting their
quotations with the un-oriented double-quote ".
If the source contained
"To be or not to be," quoth the bard, "that is the
question."
then the typeset document produced by TeX would not contain the
desired form:
``To be or not to be," quoth the bard, ``that is the
question."
In order to produce the desired form, the source file must
contain the sequence:
``To be or not to be,'' quoth the bard, ``that is the
question.''
You are to write a program which converts text containing
double-quote (") characters into text that is identical
except that double-quotes have been replaced by the two-character
sequences required by TeX for delimiting quotations with oriented
double-quotes. The double-quote (") characters should be
replaced appropriately by either `` if the "
opens a quotation and by '' if the " closes a
quotation. Notice that the question of nested quotations does not
arise: The first " must be replaced by ``, the
next by '', the next by ``, the next by
'', the next by ``, the next by '', and
so on.
Input and
Output
Input will consist of several lines of text containing an evennumber of double-quote (") characters. Input is ended with
an end-of-file character. The text must be output exactly as it was
input except that:
the first " in each pair is replaced by two `
characters: `` and
the second " in each pair is replaced by two
' characters: ''.
Sample
Input
"To be or not to be," quoth the Bard, "that is the question". The programming contestant replied: "I must disagree. To `C' or not to `C', that is The Question!"
Sample Output
``To be or not to be,'' quoth the Bard, ``that is the question''. The programming contestant replied: ``I must disagree. To `C' or not to `C', that is The Question!'' CODE #include int main() { char a; long int i=1; while((a=getchar())!=EOF) { if(a=='"'&&i%2==1) { printf("``"); i++; } else if(a=='"'&&i%2==0) { printf("''"); i++; } if(a!='"') printf("%c",a); } return 0; } MY WAY 这个是第一个题,首先应该做的是用EOF,这个比较简单。程序最开始的难处是我不明白如何让让电脑获得这些输入,经过查书自学得知getchar的用法。getchar可以输入单个字符,让计算机读取。在程序的中间部分则是用来判断输入是否是引号,并且判断出是第几个引号,然后对应的输出题目所要求的符号。最后一定要加上return返回值。这样,这个题目一遍就获得了AC,这真是件令人欢欣鼓舞的事! 后来听好多人说这个题超级水,但是我想说,没有水的题目,只有水平烂的人。只有总这样的简单的题目开始,一步一个脚印的去做,一步一步的深入program,总有一天会懂得编程的真谛。 I'm ACMer.I'm on my way.
相关文章推荐
- Problem 001——UVa 272 - TEX Quotes
- problem 001
- hdu4291 A Short problem
- Seft-backup-001-iscsi
- projecteuler---->problem=34----Digit factorials
- NOJ 题目216:A problem is easy
- HDU 5402(Travelling Salesman Problem-构造矩阵对角最长不相交路径)
- HDU 4403 A very hard Aoshu problem(DFS)
- uva 10025 The ? 1 ? 2 ? ... ? n = k problem(数学)
- hdu 5402 Travelling Salesman Problem(构造+模拟)
- web前端-HTML基础-001
- 2015 Pacific Northwest Region Programming Contest—Division 2 Problem P — Complexity(字符串、贪心)
- POJ 3985 Knight's Problem bfs + 剪枝
- hdu3666 THE MATRIX PROBLEM --- 差分约束
- Problem 2184 逆序数还原
- UVa1363 Joseph's Problem
- Android App开发学习笔记(001)——用Android Studio创建虚拟Android设备时的注意事项-01
- boj-1002-A-B Problem 大数加减法
- 1000 A + B Problem
- CSU 1506 Problem D: Double Shortest Paths(最小费用最大流)