| # | Problem | Pass Rate (passed user / total user) |
|---|---|---|
| 11183 | The Longest Palindrome - partial |
|
| 11462 | cppreference |
|
| 11929 | Reorder (absolute value) |
|
| 11931 | Least Common Multiple |
|
Description
A palindrome is a string that is identical to its reverse, like "level" or "aba". In this problem, some strings are given, and the longest palindrome in each string should be computed.
This problem involves three files:
1. 11183.c: the source file containing the main function and calls ispal().
2. 11183.h: the header file that gives the prototype of function ispal().
3. your answer as a C source file, in which you should implement the ispal() function to determine whether a given string is a palindrome or not.
Please check the provided files for details.
Input
The input consists of multiple lines, and each of them is a string that contains alphabets and numbers.
The length of each string is less than 1000 and larger or equal to 1.
The number of lines is less than or equal to 100.
Output
The longest palindrome in each string should be outputted.
If there are many palindromes of the same length, output the first one in the string.
Sample Input Download
Sample Output Download
Partial Judge Code
11183.cPartial Judge Header
11183.hTags
Discuss
Description
Given four integer numbers, please rearrange the value of them in increasing order according to their absolute value.
Input
The input has four integer numbers num1, num2, num3, and num4.
Output
Print num1, num2, num3, num4 sequentially, and the output should be in increasing order according to their absolute value.
If the absolute value of numbers are the same, put the negative number in front.
Sample Input Download
Sample Output Download
Partial Judge Code
11929.cPartial Judge Header
11929.hTags
Discuss
Description
In this problem, you are required to calculate the Least Common Multiple (最小公倍數).
Input
The input contains 2 positive integers in a line which are not greater than 1000000.
Output
The Least Common Multiple of the input numbers. The answer is smaller than 2147483647.
Note that you do not need to print ‘\n’ at the end of the output.