搜索资源列表
test2
- 老师让我们写个回文数的小程序，* 题目分析与算法设计 对于要判断的数n，计算出其平方后(存于a)，将a的每一位进行分解，再按a的从低到高的顺序将其恢复成一个数 k(如n=13，则a=169且k=961)，若a等于k则可判定n为回文数。-Let the teacher write a palindromic number of small programs,* the subject analysis and algorithm design is to determine the n
huiwenshu
- 输入一个字符串，如果这个字符串时对称的，则说明这个数十回文数，否则不是-Enter a string, if the string symmetry, then the dozens of palindromic number, otherwise not
huiwen
- VB环境做的回文数判断，初级的简单东西，自己做的-VB-palindromic done to determine the number of primary simple things, doing their own
palindromo
- palindromic for visual c++, reads the same forwards and backwards, can also be read from end to beginning
ProblemAPalindrome
- 解决一道简单的判断回文结构的题目，对C++的栈结构有更好的了解-Solve a simple palindromic structure to determine the subject of C++, a better understanding of the stack structure
hiwenzichuan
- 回文串的源代码，大一学生可以看看啊，最基本的-Palindromic string of source code
huiwenshu
- 回文数 回文数 回文数 回文数 回文数 回文数-Palindromic function Palindromic functionPalindromic functionPalindromic functionPalindromic functionPalindromic functionPalindromic function
1-1000000000_huiwen
- 能够实现从1到10000000000的回文素数列举。效率较高，值得学习。-Can be achieved from 1-10000000000 palindromic primes enumerated. Higher efficiency, it is worth learning.
401-(2)
- UVA 401 这题回文题还是比较经典的。最近面试总有这类题。希望代码中的思路对你有帮助。-UVA 401 palindromic title this question is quite classic. Recent interviews always have such practice. I hope the idea of code to help you.
Judge-palindromic-sequence
- 制作简易的菜单，运用递归调用，实现判断回文数的功能-Create a simple menu using a recursive call to realize the function of judge palindrome
PrimeAndPalindrome
- 判断5到20亿之间的回文质数（也称回文素数）。采用构建奇数长度回文数的方法，将计算量级缩小。-Palindromic primes judge (also called palindromic primes) 5-2000000000 between. The method of constructing odd length palindrome, and will calculate the magnitude smaller.
math_test
- 计算任意1~L自然数中回文数字（形如：101,121,232,353的个数）的个数，输出结果存在文件Datafile中。 -CALCULATING 1 ~ L is a natural number of palindromic numbers (like this: the number of 101,121,232,353) number, the output of file Datafile in.
LongPlind_Remove
- 寻找回文子串是一道经典的面试题，本代码旨在解决字符可删情况下的寻找最长回文子串问题。-Finding the longest palindromic substring is one of the most typical face questions, the source code uploaded is aimed to finding the longest palindromic substring while the characters are removable.
Longest-Palindromic-Substring
- Given a string s, find the longest palindromic substring in s. You may assume that the maximum length of s is 1000.