Project Euler Problem 4 is a problem related to palindromic numbers. The goal is to find out the largest palindromic number (in base 10) that is the product of two 3-digit numbers.
- This article is a stub, which means that it is not detailed enough and needs to be expanded. Please help us by .
This program uses a palindrome detector that would theoretically work for all positive whole numbers below 1 billion. The palindrome detector also contains a code snippet for integer logarithm (designed for determining how many digits there are in a number). This program costs approximately half an hour to run at full speed on AheuiChem. It may still need reduction.
바싿밟밣밝반따따따밟타빠싹빠삭빠싸사따빠바쌀뿌서더너벌벌 삭다사박발따나살발발나타뿌소쎡버너벗뻐설뻐머차박발따나솔 쏙뚜번벌석러떠번벌뻐서야쳐오마빠박루쀼서뻐섣차사마빠삭뿌 소떠삭발발나타발ㅇㅇㅇ초저박뱔셔땨쳐나사싹삭토초어쏟수써 아아초삭무밝북따붍싹샥샫오망희ㅇㅇㅇ싿삳자아야먀오소타아 발냐별토밟봃따또탸뽀뺘셛샤뗘뺘셕썩