Project Euler: http://projecteuler.net/
This commit is contained in:
24
ProjectEuler/p004_LargestPalindromeProduct.cpp
Normal file
24
ProjectEuler/p004_LargestPalindromeProduct.cpp
Normal file
@@ -0,0 +1,24 @@
|
||||
/* Check cf5-opt.vim defs.
|
||||
VIM: let g:lcppflags="-std=c++11 -O2 -pthread"
|
||||
VIM: let g:wcppflags="/O2 /EHsc /DWIN32"
|
||||
*/
|
||||
#include <iostream>
|
||||
|
||||
/*
|
||||
Largest palindrome product
|
||||
Problem 4
|
||||
|
||||
A palindromic number reads the same both ways. The largest palindrome made
|
||||
from the product of two 2-digit numbers is 9009 = 91 x 99.
|
||||
|
||||
Find the largest palindrome made from the product of two 3-digit numbers.
|
||||
|
||||
Solution:
|
||||
*/
|
||||
|
||||
int main ( void )
|
||||
{
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user