Powerful digit sum | Project Euler | Problem #56
URL to the problem page: https://projecteuler.net/problem=56 A googol (10¹⁰⁰) is a massive number: one followed by one-hundred zeros; 100¹⁰⁰ is almost unimaginably large: one followed by two-hundred zeros. Despite their size, the sum of the digits in each number is only 1. Considering natural numbers of the form, a b , where a, b < 100, what is the maximum digital sum? #include <iostream> using namespace std ; int main () { const int k = 1000 ; int result [ 2 ][k], carry [ 2 ], number2 [ 2 ] = { 0 , 0 }, i, j, a, b, c, tmp, carry_4, number [k], biggest = 0 ; for (a = 0 ; a < 99 ; a++) { for (j = 1 ; j >=...
