搜索资源列表
palindrome
- 输入一个字符串并判断其是否为回文并返回结果-Enter a string and determine whether the palindrome and return the result
huiwen
- 数据结构的回文判断,队列和栈实现,大家参考一下-Data structure to determine palindrome, queue and stack implementation, we refer to
pan
- 这软件可寻找回文数,如果有错误请帮忙修改.-This software can find palindrome if there is an error, please help.
pquest
- 这软件能把 196 到反过来(691),然后再相加(196+691),此软件会不断反复进行以上步骤,直到答案为数到1百万位.(寻找196的回文数)-This software is able to turn 196 (691), and then sum it (196+691), the software will continue to be repeated the steps above until the answer to number 1 million digit. (Looki
4_14huiwen
- 求出100--500内的所有满足下述条件的"回文数"(正读与反读大小相同的数为 "回文数"):该数的3位数字之和大于等于10-Find 100- 500 all meet the following conditions within the " palindrome" (read anti-right reading and the number of the same size as the " palindrome" ): This 3-digit n
hw
- 输入一串字符串,程序判断该字符串是否为回文的-Enter a string, the program to determine whether the string is palindrome
C-class
- 找出所有满足以下特性的六位整数: (1) 它是一个完全平方数(完全平方数是指该数是某个整数的平方); (2)该数同时也是回文数(回文数是指该数等于它的反序数)。 -Find all six of the following characteristics of an integer: (1) it is a perfect square (perfect square is the square of the number is an integer) (2) The num
java
- 求1+2!+3!+...+20!的和 利用递归方法求5!。 有5个人坐在一起,问第五个人多少岁?他说比第4个人大2岁。问第4个人岁数,他说比第3个人大2岁。问第三个人,又说比第2人大两岁。问第2个人,说比第一个人大两岁。最后问第一个人,他说是10岁。请问第五个人多大? 给一个不多于5位的正整数,要求:一、求它是几位数,二、逆序打印出各位数字。:一个5位数,判断它是不是回文数。即12321是回文数,个位与万位相同,十位与千位相同。 请输入星期几的第一个字母来判断一下是星期几,如果第
isprim
- 判断一个随意输入的字符串是否为回文字符串-An arbitrary string to determine whether the input string palindrome
he
- 回文判断,具体回文是什么我也忘了,不过此程序绝对是正确的啊-Palindrome determine the specific palindrome is what I have forgotten, but this program is absolutely correct ah
1
- 判断回文数的算法,代码简洁易懂,注释清晰明了-Algorithm to determine palindrome, code easy to read, comment clarity
HWEN
- 回文数猜想算法C语言经典实现,运行看看,猜想数字里的其他奥妙吧-Palindrome conjecture algorithm to achieve the classic C language, run to see, guess it figures in the other wonders
huiwen
- 输入一个字符串,判断是否为回文串或回文数-failed to translate
hiwenzichuan
- 回文串的源代码,大一学生可以看看啊,最基本的-Palindromic string of source code
find_huiwen
- 随机输入一个数,判断它是不是对称数(回文数)(如3,121,12321,45254)。不能用字符串库函数-Enter a random number to determine the number it is not symmetrical (palindromic) (as 3,121,12321,45254).Can not use the string library functions
41
- 请编写函fun,函数的功能是:判断字符串是否为回文?或是,函数返回1,主函数中输出:YES,否则返回0,主函数中输出NO。回文诗指顺读和倒读都一样的字符串。 例如,字符串LEVEL是回文,而字符串123312就不是回文。 注意:部分源程序在文件PROG1.C中。 请勿改动主函数main和其它函数中的任何内容,仅在函数fun的花括号中填入你编写的若干语句。 -Write a letter of fun, function is to: determine whether a s
Number
- 输入一个1至99999之间的数,再求在1至99999之间的回文数-Enter a number between 1-99999, and then seek from 1 to 99999 of palindromic
chengxu
- 几个简单的小程序,判断是否是素数、回文,以及其他算法的实现-A few simple little program to determine whether it is prime, palindromes, and other algorithms to achieve
dfdfdsd
- 判断回文数,很不错的易语言源码,易爱好者可以下载使用-Determine palindrome, a very good source of easy language, easy to use fans can download
huiwenpanduan
- 对于键盘输入的任意一个字符串,将每一个字符分别进行如栈和入队操作,字符串输入完后,分别从队列和堆栈中取出字符进行比较,一旦发现不同则输入字符串不是回文,如果将所有字符比较结束后没有发现一对字符不同,则输入字符串为回文。-For keyboard input an arbitrary string, each character separately, such as stack and into the team operation, after the input string, res