Fix includes

cplusplus/src/p0000_template.cpp

@@ -11,7 +11,7 @@ This paragraph should be replaced by the problem description, excluding images.
 #define EULER_P0000
 #include <stdint.h>
 #include <iostream>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 uint64_t EMSCRIPTEN_KEEPALIVE p0000() {
     return 0;

cplusplus/src/p0001.cpp

@@ -16,7 +16,7 @@
 #define EULER_P0001
 #include <stdint.h>
 #include <iostream>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 uint64_t EMSCRIPTEN_KEEPALIVE p0001() {
     uint64_t answer = 0;

cplusplus/src/p0002.cpp

@@ -18,7 +18,7 @@ four million, find the sum of the even-valued terms.
 #define EULER_P0002
 #include <stdint.h>
 #include <iostream>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 uint64_t EMSCRIPTEN_KEEPALIVE p0002() {
     uint64_t answer = 0,

cplusplus/src/p0004.cpp

@@ -16,7 +16,7 @@ Find the largest palindrome made from the product of two 3-digit numbers.
 #include <algorithm>
 #include <cstdio>
 #include <iostream>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 uint32_t EMSCRIPTEN_KEEPALIVE p0004() {
     uint32_t answer = 0, i, j, prod;

cplusplus/src/p0006.cpp

@@ -23,7 +23,7 @@ natural numbers and the square of the sum.
 #define EULER_P0006
 #include <stdint.h>
 #include <iostream>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 uint64_t EMSCRIPTEN_KEEPALIVE p0006() {
     uint64_t sum = 100 * 101 / 2, sum_of_squares = 0;

cplusplus/src/p0008.cpp

@@ -34,7 +34,7 @@ Find the thirteen adjacent digits in the 1000-digit number that have the greates
 #define EULER_P0008
 #include <stdint.h>
 #include <iostream>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 uint64_t EMSCRIPTEN_KEEPALIVE p0008() {
     size_t i, j;

cplusplus/src/p0009.cpp

@@ -17,7 +17,7 @@ Find the product abc.
 #define EULER_P0009
 #include <stdint.h>
 #include <iostream>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 uint64_t EMSCRIPTEN_KEEPALIVE p0009() {
     uint64_t answer = 0;

cplusplus/src/p0011.cpp

@@ -35,7 +35,7 @@ the 20×20 grid?
 #define EULER_P0011
 #include <stdint.h>
 #include <iostream>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 static const uint8_t grid[20][20] = {
     { 8,  2, 22, 97, 38, 15,  0, 40,  0, 75,  4,  5,  7, 78, 52, 12, 50, 77, 91,  8},

cplusplus/src/p0013.cpp

@@ -109,7 +109,7 @@ Work out the first ten digits of the sum of the following one-hundred 50-digit n
 #define EULER_P0013
 #include <stdint.h>
 #include <iostream>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 static const uint64_t numbers[100][3] = {
     { 37107287533902, 102798797998220837, 590246510135740250 },

cplusplus/src/p0014.cpp

@@ -24,7 +24,7 @@ NOTE: Once the chain starts the terms are allowed to go above one million.
 #define EULER_P0014
 #include <stdint.h>
 #include <iostream>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 #define CACHE_SIZE 1000000
 static uint32_t collatz_len_cache[CACHE_SIZE] = {0, 1, 0};

cplusplus/src/p0015.cpp

@@ -18,7 +18,7 @@ How many such routes are there through a 20×20 grid?
 #define EULER_P0015
 #include <stdint.h>
 #include <iostream>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 #include "include/math.hpp"
 
 #define lattice_paths(height, width) (n_choose_r(height + width, height))

cplusplus/src/p0016.cpp

@@ -12,7 +12,7 @@ What is the sum of the digits of the number 2**1000?
 #include <stdint.h>
 #include <iostream>
 #include <vector>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 
 uint64_t EMSCRIPTEN_KEEPALIVE p0016() {

cplusplus/src/p0017.cpp

@@ -23,7 +23,7 @@ British usage.
 #include <iostream>
 #include <stdexcept>
 #include <string>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 std::string ToString(uint64_t n);
 std::string ToString(uint64_t n) {

cplusplus/src/p0019.cpp

@@ -26,7 +26,7 @@ How many Sundays fell on the first of the month during the twentieth century
 #include <iostream>
 #include <stdexcept>
 #include <stdint.h>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 #ifdef _WIN32
 #include <cstring>

cplusplus/src/p0020.cpp

@@ -15,7 +15,7 @@ Find the sum of the digits in the number 100!
 #include <stdint.h>
 #include <iostream>
 #include <vector>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 
 uint64_t EMSCRIPTEN_KEEPALIVE p0020() {

cplusplus/src/p0022.cpp

@@ -18,7 +18,7 @@
 #include <iostream>
 #include <vector>
 #include <algorithm>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 #include "include/utils.hpp"
 
 uint64_t EMSCRIPTEN_KEEPALIVE p0022() {

cplusplus/src/p0034.cpp

@@ -15,7 +15,7 @@ Note: as 1! = 1 and 2! = 2 are not sums they are not included.
 #include <stdint.h>
 #include <iostream>
 #include <cstdio>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 #include "include/math.hpp"
 
 uint64_t EMSCRIPTEN_KEEPALIVE p0034() {

cplusplus/src/p0836.cpp

@@ -17,7 +17,7 @@ Find f(20230401, 57). Give as your answer the concatenation of the first letters
 #ifndef EULER_P0836
 #define EULER_P0836
 #include <iostream>
-#include "../macros.hpp"
+#include "include/macros.hpp"
 
 std::string EMSCRIPTEN_KEEPALIVE p0836() {
     return "aprilfoolsjoke";