Project Euler - problem 004
August 1st, 2007 by Daniel Høyer Iversen
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 * 99.
Find the largest palindrome made from the product of two 3-digit numbers.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 | #include <iostream> #include <vector> using namespace std; #define str 1000 bool isPalindromic(int num){ vector<int> numbers; while(num != 0){ numbers.push_back(num % 10); num = (num - num % 10) / 10; } for(int i = 0; i < numbers.size() / 2; i++){ if( numbers[i] != numbers[numbers.size() - 1 - i]){ return false; } } return true; } int main () { int res(1); for(int i= str; i > 0; i--){ for(int j = str; j > 0; j--){ if (isPalindromic(i * j) && i*j > res ){ res = i * j; } } } // cout << isPalindromic( 5435); cout << "resultatet er "; cout << res << "\n"; return 0; } |
0 Responses to “Project Euler - problem 004”
Leave a Response