1.实现将输入的string字符串反序输出。
2.一个数如果恰好等于它的因子之和，这个数就称为"完数"。例如6 = 1+2+3找出10000以内的所有完数。
3.下面程序的功能是将一个4×4的数组进行逆时针旋转90度后输出，要求原始数组的数据随机输入，新数组以4行4列的方式输出
4.编程打印杨辉三角。
5.实现将输入的字符串反序输出
6.实现字符串拷贝函数strcopy(char*src,char* dest)
7.求近似Pi值。可以用公式（如：pi/2 = 1+1/3+1/3*2/5 + 1/3*2/5*3/7 + 1/3*2/5*3/7*4/9+.....）
8.输入一个字符串，判断其是否为回文。回文字符串是指从左到右读和从右到左读完全相同的字符串。
1 to achieve the reverse order of the input string string output.
2 If a number is exactly equal to the sum of its factors, this number is called a "complete count." For example, 6 = 1+2+3 identify all End counts less than 10,000.
3 The following procedure is the function of a 4 × 4 array rotated 90 degrees counter-clockwise output, requiring random input data in the original array, the new array with 4 rows 4 way output
4 Programming printing Pascal s Triangle.
5 to achieve the output of the input string in reverse order
6. Achieve string copy function strcopy (char* src, char* dest)
7 Find the approximate value of Pi. Can use the formula (eg: pi/2 = 1+1/3+1/3* 2/5+ 1/3* 2/5* 3/7+ 1/3* 2/5* 3/7* 4/9+ .....)
8 Enter a string to determine whether it is a palindrome. Palindrome string is read from left to right and right to left reading the same string. (2013-10-22, Visual C++, 460KB, 下载5次)