Question 10000: output the number of all replies

Source: Internet
Author: User

Print? /* Start the comments in the program header (to avoid any problems encountered during the submission of blog posts, the slash used to indicate that the comments have been deleted)
* Copyright and version Declaration of the program
* All rights reserved.
* File name: txt. c
* Author: liuyongshui
* Question: the number of all replies within 10000 is output.
* Problem source:
* Completion date: January 1, April 17, 2013
* Version No.: V1.0
*/
 
# Include <stdio. h>
 
Int isPalindrome (int m); // It is the number of input files.
 
Int main ()
{
Int I;
 
For (I = 2; I <10000; I ++)
{
If (isPalindrome (I ))
{
Printf ("The return prime numbers include: % d \ n", I );
}
}

Return 0;
}
 
Int isPalindrome (int m)
{
Int I = 0;
Int j;
Int num;
Int a [5];


If (m> = 10) // checks the number of replies greater than 10.
{
Num = m;
While (m) // m = 0. Every bit of m in the next loop is saved to the array.
{
A [I ++] = m % 10;
M = m/10;
}
 
For (j = I-1; j> = 0; j --) // checks whether the response is
{
If (a [j]! = Num % 10)
{
Return 0; // if there are different return 0
}
Num = num/10;
}

Return 1;
}

Else // less than 10, certainly not the number of replies
{
Return 0;
}
}

/* Start the comments in the program header (to avoid any problems encountered during the submission of blog posts, the slash used to indicate that the comments have been deleted)
* Copyright and version Declaration of the program
* All rights reserved.
* File name: txt. c
* Author: liuyongshui
* Question: the number of all replies within 10000 is output.
* Problem source:
* Completion date: January 1, April 17, 2013
* Version No.: V1.0
*/

# Include <stdio. h>

Int isPalindrome (int m); // It is the number of input files.

Int main ()
{
Int I;

For (I = 2; I <10000; I ++)
{
If (isPalindrome (I ))
{
Printf ("The return prime numbers include: % d \ n", I );
}
}

Return 0;
}

Int isPalindrome (int m)
{
Int I = 0;
Int j;
Int num;
Int a [5];

 
If (m> = 10) // checks the number of replies greater than 10.
{
Num = m;
While (m) // m = 0. Every bit of m in the next loop is saved to the array.
{
A [I ++] = m % 10;
M = m/10;
}

For (j = I-1; j> = 0; j --) // checks whether the response is
{
If (a [j]! = Num % 10)
{
Return 0; // if there are different return 0
}
Num = num/10;
}

Return 1;
}
 
Else // less than 10, certainly not the number of replies
{
Return 0;
}
} Local Graph

 
 


 

Related Article

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.