void simpleEuler20::calculateFactorial() { InfInt sum = "1"; for (int i = max; i > 0; i--) { sum = sum * i; } sumOfNumbers(sum.toString()); }
int main() { printf("Enter a number :"); int n; scanf ("%d",&n); printf("%d",n); int sum = sumOfNumbers(n); printf("\nSum is %d",sum); return 0; }
int main(void) { // sum the diagonals of a 1001x1001 spiral // excluding the first 1 each level has a box with 4 corners // c4 => (2x + 1)^2 - 0x // c3 => (2x + 1)^2 - 2x // c2 => (2x + 1)^2 - 4x // c1 => (2x + 1)^2 - 6x // avg => (2x +1)^2 - 3x // => 4x^2 + x + 1 // each level sum is 4(4x^2 + x + 1) // There are 500 levels plus the first 1 uint64_t result = 1; result += 4 * 500; result += 4 * sumOfNumbers(500); result += 16 * sumOfSquares(500); std::cout << result << std::endl; }
int sumOfNumbers(int n) { if(n==0) return 0; return n + sumOfNumbers(n-1); }