int main() { long difference; difference = squareOfSum(LIMIT) - sumOfSquares(LIMIT); printf("The difference is: %ld\n", difference); return 0; }
int main(int argc, char *argv[]) { unsigned int difference = squareOfSum(MAX_CHECK) - sumOfSquared(MAX_CHECK); printf("difference is %u",difference); return 0; }
int main(void) { int result = squareOfSum(100) - sumOfSquares(100); printf("%d\n", result); return result; // Answer: 25164150 }
int main(int argc, char **argv) { printf("Algorithm start, please wait...\n"); // With scalability in mind, we don't want our algorithm to be fixed int size = 100, difference = 0; // By using this two useful functions we don't have much to do difference = squareOfSum(size) - sumOfSquare(size); printf("Algorithm end.\n"); }
int main() { printf("%lu\n", squareOfSum(NUM) - sumOfSquares(NUM)); return 0; }
int64_t squaresDiff(int64_t n){return squareOfSum(n)-sumOfSquares(n);}
int projectEuler_006() { return squareOfSum(100) - sumOfSquare(100); }