题目描述：

输入字符串s和字符c，要求去掉s中所有的c字符，并输出结果。

题目描述：

给定三角形的三条边，a,b,c。判断该三角形类型。

题目描述：

给定一个数n，要求判断其是否为素数（0,1，负数都是非素数）。

题目描述：

输入10个数，要求输出其中的最大值。

模拟类型

这类题常考，看似不难，但是对于初学者来说，用代码完整地写出题意描述中的意思还是需要多加练习

题目描述：

用小于等于n元去买100只鸡，大鸡5元/只，小鸡3元/只,还有1/3元每只的一种小鸡，分别记为x只,y只,z只。编程求解x,y,z所有可能解。

题目描述：

We are all familiar with pre-order, in-order and post-order traversals of binary trees. A common problem in data structure classes is to find the pre-order traversal of a binary tree when given the in-order and post-order traversals. Alternatively, you can find the post-order traversal when given the in-order and pre-order. However, in general you cannot determine the in-order traversal of a tree when given its pre-order and post-order traversals. Consider the four binary trees below:

All of these trees have the same pre-order and post-order traversals. This phenomenon is not restricted to binary trees, but holds for general m-ary trees as well.

题目描述：

We now use the Gregorian style of dating in Russia. The leap years are years with number divisible by 4 but not divisible by 100, or divisible by 400.
For example, years 2004, 2180 and 2400 are leap. Years 2004, 2181 and 2300 are not leap.
Your task is to write a program which will compute the day of week corresponding to a given date in the nearest past or in the future using today’s agreement about dating.

最好的位置

最好的位置是html的最后，</body>之前，这样可以更快的加载页面。

题目描述：

Find a longest common subsequence of two strings.