搜索资源列表
Numbers
- 检测数字是不是Lazy Caterer s Sequence Palindromic Numbers Harmonic Numbers Prime Numbers-Detection of the number if it s Lazy Caterer s Sequence Palindromic Numbers Harmonic Numbers Prime Numbers
018
- 用于判断正整数n的d进制数表示形式是否是回文数-tell the positive integers n is a Palindromic Number
Number
- 编写一个java应用程序。用户从键盘输入一个1-9999之间的数，程序将判断这个数是几位数，并判断这个数是否回文数。回文数是指将数含有的数字逆序排列后得到的数和原数相同，例如12121,4224,6778776等都是回文数。-Write a java application. The user from the keyboard to enter a number between 1-9999, the program will det
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 algorith
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
alogo001.tar
- C++ algorithm: 1) 10001th prime number 2) Number that divisible fro, 1 to 20 3) Biggest palindromic number for two 3-digit number s product
palindromo
- palindromic for visual c++, reads the same forwards and backwards, can also be read from end to beginning
huiwen2
- 用java现实判断是不是回文，如果是的话就输出是的信息，不是的话，输出不是。-Reality check with java is not palindromic, and if so the output is information, not the case, the output is not.
2
- 回文素数的算法源码，支持在C++环境下编程-Palindromic primes algorithm source code, support for C++ programming environment
palindromic
- Made in TC, C++ that computes for palindrome
ProblemAPalindrome
- 解决一道简单的判断回文结构的题目，对C++的栈结构有更好的了解-Solve a simple palindromic structure to determine the subject of C++, a better understanding of the stack structure
project3
- 这是我在大学本科汇编课程的一个小程序，MIPS语言，功能也很简单，程序会要求用户输入一个20个character长度的字符串，然后用了三种不同的算法来判断此字符串是否是回文序列，然后给予用户feedback-This is my compilation of courses at the undergraduate a small program, MIPS language functions are very simple, the
java1
- 1、编写一个Java应用程序。用户从键盘输入一个1～99999之间的整数，程序将判断这个数是几位数，并判断这个数是否是回文数。回文数是指将该数含有的数字逆序排列后得到的数和原数相同，如12121和3223都是回文数。 2、编写一个Java应用程序，该程序中有一个Rational(有理数)类，具体要求如下： ?Rational类有两个int型的成员变量，名字分别为numerator(分子)和denominator(分母)。 ?
montgomery
- Just a simple dynamic programming project for a CS class. Finds longest palindromic subsequence of an input string-Just a simple dynamic programming project for a CS class. Finds longest palindromic subsequence of an in
hiwenzichuan
- 回文串的源代码，大一学生可以看看啊，最基本的-Palindromic string of source code
Palindromic-or-not
- A Program to check enterd number is palindromic or not
Palindromic-or-not
- A Program to check enterd number is palindromic or not
palindromic-numbers
- Program to find palindromic-numbers
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.