# Solution to Problem 16 on ProjectEuler.net

Here’s the problem: —– 2^15 = 32768 and the sum of its digits is 3 + 2 + 7 + 6 + 8 = 26. What is the sum of the digits of the number 2^1000? —– My Solution Here’s the solution implementing the large number as an array of digits: #include <stdio.h> #define MAX […]