Question 10000: output the prime number of all input files.

[Plain]
/* 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: output the prime number of all input files within 10000
* Problem source:
* Completion date: January 1, April 17, 2013
* Version No.: V1.0
*/
 
# Include <stdio. h>
 
Int isPrimer (int n); // It is a prime number.
Int isPalindrome (int m); // It is the number of input files.
 
Int main ()
{
Int I;
 
For (I = 2; I <10000; I ++)
{
If (isPrimer (I) & isPalindrome (isPrimer (I )))
{
Printf ("The return prime numbers include: % d \ n", I );
}
}

Return 0;
}
 
 
Int isPrimer (int n)
{
Int I;
Int flag;
 
For (I = 2; I <= n/2; I ++)
{
Flag = 1;
If (n % I = 0) // check whether it is a prime number
{
Flag = 0; // not a prime number, flag = 0
}
}

If (flag)
{
Return n;
}
Else
{
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: output the prime number of all input files within 10000
* Problem source:
* Completion date: January 1, April 17, 2013
* Version No.: V1.0
*/

# Include <stdio. h>

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

Int main ()
{
Int I;

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

Return 0;
}

Int isPrimer (int n)
{
Int I;
Int flag;

For (I = 2; I <= n/2; I ++)
{
Flag = 1;
If (n % I = 0) // check whether it is a prime number
{
Flag = 0; // not a prime number, flag = 0
}
}
 
If (flag)
{
Return n;
}
Else
{
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