mirror of https://github.com/TheAlgorithms/C
42 lines
782 B
C
42 lines
782 B
C
/**
|
|
* \file
|
|
* \brief [Problem 4](https://projecteuler.net/problem=4) solution
|
|
*/
|
|
#include <stdio.h>
|
|
|
|
/** Check if number is palindromic
|
|
* \param[in] n number to check
|
|
* \returns 1 if palindromic
|
|
* \returns 0 if not palindromic
|
|
*/
|
|
int is_palindromic(unsigned int n)
|
|
{
|
|
unsigned int reversed = 0, t = n;
|
|
|
|
while (t > 0)
|
|
{
|
|
reversed = 10 * reversed + (t % 10);
|
|
t /= 10;
|
|
}
|
|
return reversed == n;
|
|
}
|
|
|
|
/** Main function */
|
|
int main(void)
|
|
{
|
|
unsigned int i, j, max = 0;
|
|
for (i = 100; i <= 999; i++)
|
|
{
|
|
for (j = 100; j <= 999; j++)
|
|
{
|
|
unsigned int p = i * j;
|
|
if (is_palindromic(p) && p > max)
|
|
{
|
|
max = p;
|
|
}
|
|
}
|
|
}
|
|
printf("%u\n", max);
|
|
return 0;
|
|
}
|