Fix C code with astyle

C/p001.c

@@ -2,6 +2,8 @@
  *
  * Find the sum of all the multiples of 3 or 5 below 1000.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p002.c

@@ -4,6 +4,8 @@
  *
  * By considering the terms in the Fibonacci sequence whose values do not exceed four million, find the sum of the even-valued terms.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p003.c

@@ -2,6 +2,8 @@
  *
  * What is the largest prime factor of the number 600851475143?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p004.c

@@ -2,6 +2,8 @@
  *
  * Find the largest palindrome made from the product of two 3-digit numbers.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p005.c

@@ -2,6 +2,8 @@
  *
  * What is the smallest positive number that is evenly divisible by all of the numbers from 1 to 20?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p006.c

@@ -10,6 +10,8 @@
  *
  * Find the difference between the sum of the squares of the first one hundred natural numbers and the square of the sum.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p007.c

@@ -2,6 +2,8 @@
  *
  * What is the 10 001st prime number?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p008.c

@@ -23,6 +23,8 @@
  *
  * Find the thirteen adjacent digits in the 1000-digit number that have the greatest product. What is the value of this product?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p009.c

@@ -8,6 +8,8 @@
  *
  * Find the product abc.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>
@@ -57,7 +59,7 @@ int main(int argc, char **argv)
                     }
 
                     i++;
-            }while(tmpa + tmpb + tmpc < 1000);
+                } while(tmpa + tmpb + tmpc < 1000);
             }
         }
     }

C/p010.c

@@ -2,6 +2,8 @@
  *
  * Find the sum of all the primes below two million.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p011.c

@@ -25,6 +25,8 @@
  *
  * What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20×20 grid?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>
@@ -50,7 +52,8 @@ int main(int argc, char **argv)
         {4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36},
         {20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 4, 36, 16},
         {20, 73, 35, 29, 78, 31, 90, 1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 5, 54},
-                    {1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48}};
+        {1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 1, 89, 19, 67, 48}
+    };
     int i, j, k, w, max = 0, prod;
     double elapsed;
     struct timespec start, end;

C/p012.c

@@ -17,6 +17,8 @@
  *
  * What is the value of the first triangle number to have over five hundred divisors?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p013.c

@@ -101,6 +101,8 @@
  * 20849603980134001723930671666823555245252804609722
  * 53503534226472524250874054075591789781264330331690*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>
@@ -157,7 +159,8 @@ int main(int argc, char **argv)
                        "41503128880339536053299340368006977710650566631954", "81234880673210146739058568557934581403627822703280",
                        "82616570773948327592232845941706525094512325230608", "22918802058777319719839450180888072429661980811197",
                        "77158542502016545090413245809786882778948721859617", "72107838435069186155435662884062257473692284509516",
-      "20849603980134001723930671666823555245252804609722", "53503534226472524250874054075591789781264330331690"};
+                       "20849603980134001723930671666823555245252804609722", "53503534226472524250874054075591789781264330331690"
+                      };
     char result[100];
     int i;
     double elapsed;

C/p014.c

@@ -14,6 +14,8 @@
  *
  * NOTE: Once the chain starts the terms are allowed to go above one million.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p015.c

@@ -1,6 +1,8 @@
 /* Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner
  * How many such routes are there through a 20×20 grid?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p016.c

@@ -2,6 +2,8 @@
  *
  * What is the sum of the digits of the number 2^1000?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p017.c

@@ -5,6 +5,8 @@
  * NOTE: Do not count spaces or hyphens. For example, 342 (three hundred and forty-two) contains 23 letters and 115 (one hundred and fifteen)
  * contains 20 letters. The use of "and" when writing out numbers is in compliance with British usage.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p018.c

@@ -28,6 +28,8 @@
  * NOTE: As there are only 16384 routes, it is possible to solve this problem by trying every route. However, Problem 67, is the same challenge
  * with a triangle containing one-hundred rows; it cannot be solved by brute force, and requires a clever method! ;o)*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p019.c

@@ -11,6 +11,8 @@
  *
  * How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p020.c

@@ -5,6 +5,8 @@
  *
  * Find the sum of the digits in the number 100!*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p021.c

@@ -6,6 +6,8 @@
  *
  * Evaluate the sum of all the amicable numbers under 10000.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p022.c

@@ -6,6 +6,8 @@
  *
  * What is the total of all the name scores in the file?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>

C/p023.c

@@ -10,6 +10,8 @@
  *
  * Find the sum of all the positive integers which cannot be written as the sum of two abundant numbers.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p024.c

@@ -5,6 +5,8 @@
  *
  * What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p025.c

@@ -19,6 +19,8 @@
  *
  * What is the index of the first term in the Fibonacci sequence to contain 1000 digits?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>

C/p026.c

@@ -14,6 +14,8 @@
  *
  * Find the value of d < 1000 for which 1/d contains the longest recurring cycle in its decimal fraction part.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p027.c

@@ -17,6 +17,8 @@
  *
  * Find the product of the coefficients, a and b, for the quadratic expression that produces the maximum number of primes for consecutive values of n, starting with n=0.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p028.c

@@ -10,6 +10,8 @@
  *
  * What is the sum of the numbers on the diagonals in a 1001 by 1001 spiral formed in the same way?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p029.c

@@ -11,6 +11,8 @@
  *
  * How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p030.c

@@ -10,6 +10,8 @@
  *
  * Find the sum of all the numbers that can be written as the sum of fifth powers of their digits.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p031.c

@@ -8,6 +8,8 @@
  *
  * How many different ways can £2 be made using any number of coins?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p032.c

@@ -7,6 +7,8 @@
  *
  * HINT: Some products can be obtained in more than one way so be sure to only include it once in your sum.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>

C/p033.c

@@ -8,6 +8,8 @@
  *
  * If the product of these four fractions is given in its lowest common terms, find the value of the denominator.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p034.c

@@ -4,6 +4,8 @@
  *
  * Note: as 1! = 1 and 2! = 2 are not sums they are not included.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p035.c

@@ -4,6 +4,8 @@
  *
  * How many circular primes are there below one million?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p036.c

@@ -4,6 +4,8 @@
  *
  * (Please note that the palindromic number, in either base, may not include leading zeros.)*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p037.c

@@ -5,6 +5,8 @@
  *
  * NOTE: 2, 3, 5, and 7 are not considered to be truncatable primes.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p038.c

@@ -11,6 +11,8 @@
  *
  * What is the largest 1 to 9 pandigital 9-digit number that can be formed as the concatenated product of an integer with (1,2, ... , n) where n > 1?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>
@@ -65,7 +67,7 @@ int main(int argc, char **argv)
             {
                 n *= 100000;
             }
-      }while(n <= 987654321);
+        } while(n <= 987654321);
     }
 
     clock_gettime(CLOCK_MONOTONIC, &end);

C/p039.c

@@ -4,6 +4,8 @@
  *
  * For which value of p ≤ 1000, is the number of solutions maximised?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p040.c

@@ -8,6 +8,8 @@
  *
  * d_1 × d_10 × d_100 × d_1000 × d_10000 × d_100000 × d_1000000*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p041.c

@@ -3,6 +3,8 @@
  *
  * What is the largest n-digit pandigital prime that exists?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p042.c

@@ -8,6 +8,8 @@
  * Using words.txt (right click and 'Save Link/Target As...'), a 16K text file containing nearly two-thousand common English words,
  * how many are triangle words?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>

C/p043.c

@@ -13,6 +13,8 @@
  *
  * Find the sum of all 0 to 9 pandigital numbers with this property.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p044.c

@@ -7,6 +7,8 @@
  * Find the pair of pentagonal numbers, Pj and Pk, for which their sum and difference are pentagonal and D = |Pk − Pj| is minimised;
  * what is the value of D?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p045.c

@@ -8,6 +8,8 @@
  *
  * Find the next triangle number that is also pentagonal and hexagonal.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p046.c

@@ -11,6 +11,8 @@
  *
  * What is the smallest odd composite that cannot be written as the sum of a prime and twice a square?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>
@@ -88,7 +90,7 @@ int goldbach(int n)
                 }
 
                 j++;
-         }while(tmp < n);
+            } while(tmp < n);
         }
     }
 

C/p047.c

@@ -11,6 +11,8 @@
  *
  * Find the first four consecutive integers to have four distinct prime factors each. What is the first of these numbers?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p048.c

@@ -8,6 +8,8 @@
 #include <time.h>
 #include <gmp.h>
 
+#define _POSIX_C_SOURCE 199309L
+
 int main(int argc, char **argv)
 {
     int i;

C/p049.c

@@ -6,6 +6,8 @@
  *
  * What 12-digit number do you form by concatenating the three terms in this sequence?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p050.c

@@ -8,6 +8,8 @@
  *
  * Which prime, below one-million, can be written as the sum of the most consecutive primes?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p051.c

@@ -7,6 +7,8 @@
  * Find the smallest prime which, by replacing part of the number (not necessarily adjacent digits) with the same digit, is part of an eight prime
  * value family.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>

C/p052.c

@@ -2,6 +2,8 @@
  *
  * Find the smallest positive integer, x, such that 2x, 3x, 4x, 5x, and 6x, contain the same digits.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p053.c

@@ -10,6 +10,8 @@
  *
  * How many, not necessarily distinct, values of (n r) for 1≤n≤100, are greater than one-million?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p054.c

@@ -44,6 +44,8 @@
  *
  *      How many hands does Player 1 win?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
@@ -51,14 +53,14 @@
 #include "projecteuler.h"
 
 /* Define the values of the cards.*/
-typedef enum{two, three, four, five, six, seven, eight, nine, ten, jack, queen, king, ace} values;
+typedef enum {two, three, four, five, six, seven, eight, nine, ten, jack, queen, king, ace} values;
 
 /* Define a structure for a card, with value and suit.*/
 typedef struct card
 {
     values value;
     char suit;
-}Card;
+} Card;
 
 int eval(char *hands);
 

C/p055.c

@@ -21,6 +21,8 @@
  *
  * NOTE: Wording was modified slightly on 24 April 2007 to emphasise the theoretical nature of Lychrel numbers.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p056.c

@@ -3,6 +3,8 @@
  *
  * Considering natural numbers of the form, a^b, where a, b < 100, what is the maximum digital sum?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p057.c

@@ -14,6 +14,8 @@
  *
  * In the first one-thousand expansions, how many fractions contain a numerator with more digits than the denominator?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p058.c

@@ -14,6 +14,8 @@
  * If one complete new layer is wrapped around the spiral above, a square spiral with side length 9 will be formed. If this process is continued,
  * what is the side length of the square spiral for which the ratio of primes along both diagonals first falls below 10%?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>
@@ -63,7 +65,7 @@ int main(int argc, char **argv)
         diag += 4;
         l += 2;
 
-   }while(ratio >= 0.1);
+    } while(ratio >= 0.1);
 
     clock_gettime(CLOCK_MONOTONIC, &end);
 

C/p059.c

@@ -16,6 +16,8 @@
  * encrypted ASCII codes, and the knowledge that the plain text must contain common English words, decrypt the message and find the sum of the
  * ASCII values in the original text.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>

C/p060.c

@@ -4,6 +4,8 @@
  *
  * Find the lowest sum for a set of five primes for which any two primes concatenate to produce another prime.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p061.c

@@ -17,6 +17,8 @@
  * Find the sum of the only ordered set of six cyclic 4-digit numbers for which each polygonal type: triangle, square, pentagonal,
  * hexagonal, heptagonal, and octagonal, is represented by a different number in the set.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>
@@ -43,7 +45,7 @@ int main(int argc, char **argv)
         polygonal[0][n] = 1;
         i++;
         n = i * (i + 1) / 2;
-   }while(n < 10000);
+    } while(n < 10000);
 
     i = 1;
     n = 1;
@@ -54,7 +56,7 @@ int main(int argc, char **argv)
         polygonal[1][n] = 1;
         i++;
         n = i * i;
-   }while(n < 10000);
+    } while(n < 10000);
 
     i = 1;
     n = 1;
@@ -65,7 +67,7 @@ int main(int argc, char **argv)
         polygonal[2][n] = 1;
         i++;
         n = i * (3 * i - 1) / 2;
-   }while(n < 10000);
+    } while(n < 10000);
 
     i = 1;
     n = 1;
@@ -76,7 +78,7 @@ int main(int argc, char **argv)
         polygonal[3][n] = 1;
         i++;
         n = i * (2 * i - 1);
-   }while(n < 10000);
+    } while(n < 10000);
 
     i = 1;
     n = 1;
@@ -87,7 +89,7 @@ int main(int argc, char **argv)
         polygonal[4][n] = 1;
         i++;
         n = i * (5 * i - 3) / 2;
-   }while(n < 10000);
+    } while(n < 10000);
 
     i = 1;
     n = 1;
@@ -98,7 +100,7 @@ int main(int argc, char **argv)
         polygonal[5][n] = 1;
         i++;
         n = i * (3 * i - 2);
-   }while(n < 10000);
+    } while(n < 10000);
 
     /* Find the requested set of numbers.*/
     if(find_set(0, &sum) == 0)

C/p062.c

@@ -3,6 +3,8 @@
  *
  * Find the smallest cube for which exactly five permutations of its digits are cube.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p063.c

@@ -2,6 +2,8 @@
  *
  * How many n-digit positive integers exist which are also an nth power?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p064.c

@@ -40,6 +40,8 @@
  *
  * How many continued fractions for N≤10000 have an odd period?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p065.c

@@ -27,6 +27,8 @@
  *
  * Find the sum of digits in the numerator of the 100th convergent of the continued fraction for e.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p066.c

@@ -18,6 +18,8 @@
  *
  * Find the value of D ≤ 1000 in minimal solutions of x for which the largest value of x is obtained.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>
@@ -89,4 +91,3 @@ int is_square(int n)
         return 0;
     }
 }
-

C/p067.c

@@ -13,6 +13,8 @@
  * If you could check one trillion (1012) routes every second it would take over twenty billion years to check them all.
  * There is an efficient algorithm to solve it. ;o)*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p068.c

@@ -43,6 +43,8 @@
  *               O
  */
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>

C/p069.c

@@ -16,6 +16,8 @@
  *
  * Find the value of n ≤ 1,000,000 for which n/φ(n) is a maximum.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p070.c

@@ -7,6 +7,8 @@
  *
  * Find the value of n, 1 < n < 10^7, for which φ(n) is a permutation of n and the ratio n/φ(n) produces a minimum.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p071.c

@@ -9,6 +9,8 @@
  * By listing the set of reduced proper fractions for d ≤ 1,000,000 in ascending order of size, find the numerator
  * of the fraction immediately to the left of 3/7.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p072.c

@@ -8,6 +8,8 @@
  *
  * How many elements would be contained in the set of reduced proper fractions for d ≤ 1,000,000?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p073.c

@@ -8,6 +8,8 @@
  *
  * How many fractions lie between 1/3 and 1/2 in the sorted set of reduced proper fractions for d ≤ 12,000?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p074.c

@@ -20,6 +20,8 @@
  *
  * How many chains, with a starting number below one million, contain exactly sixty non-repeating terms?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p075.c

@@ -15,6 +15,8 @@
  *
  * Given that L is the length of the wire, for how many values of L ≤ 1,500,000 can exactly one integer sided right angle triangle be formed?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p076.c

@@ -9,6 +9,8 @@
  *
  * How many different ways can one hundred be written as a sum of at least two positive integers?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p077.c

@@ -8,6 +8,8 @@
  *
  * What is the first value which can be written as the sum of primes in over five thousand different ways?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p078.c

@@ -11,6 +11,8 @@
  *
  * Find the least value of n for which p(n) is divisible by one million.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p079.c

@@ -6,6 +6,8 @@
  * Given that the three characters are always asked for in order, analyse the file so as to determine the shortest possible
  * secret passcode of unknown length.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p080.c

@@ -6,6 +6,8 @@
  * For the first one hundred natural numbers, find the total of the digital sums of the first one hundred decimal digits
  * for all the irrational square roots*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p081.c

@@ -10,6 +10,8 @@
  * Find the minimal path sum, in matrix.txt, a 31K text file containing a 80 by 80 matrix, from the top left to the bottom right
  * by only moving right and down.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p082.c

@@ -11,6 +11,8 @@
  *
  * Find the minimal path sum, in matrix.txt, a 31K text file containing a 80 by 80 matrix, from the left column to the right column.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p083.c

@@ -12,6 +12,8 @@
  * Find the minimal path sum, in matrix.txt, a 31K text file containing a 80 by 80 matrix,
  * from the top left to the bottom right by moving left, right, up, and down.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p084.c

@@ -66,6 +66,8 @@
  *
  * If, instead of using two 6-sided dice, two 4-sided dice are used, find the six-digit modal string.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>
@@ -76,7 +78,8 @@
 /* Define the squares, the type of Community Chest cards and the type of Chance cards.*/
 typedef enum {GO, A1, CC1, A2, T1, R1, B1, CH1, B2, B3, JAIL,
               C1, U1, C2, C3, R2, D1, CC2, D2, D3, FP, E1, CH2, E2, E3, R3, F1,
-   F2, U2, F3, G2J, G1, G2, CC3, G3, R4, CH3, H1, T2, H2} squares;
+              F2, U2, F3, G2J, G1, G2, CC3, G3, R4, CH3, H1, T2, H2
+             } squares;
 typedef enum {GO_cc, JAIL_cc, NOP_cc} cc_card;
 typedef enum {GO_ch, JAIL_ch, C1_ch, E3_ch, H2_ch, R1_ch, R_ch1, R_ch2, U_ch, M3, NOP_ch} ch_card;
 
@@ -165,11 +168,11 @@ void shuffle_cc(cc_card cc[])
         do
         {
             i = rand() % 16;
-      }while(cc[i] != NOP_cc);
+        } while(cc[i] != NOP_cc);
 
         cc[i] = c;
         c++;
-   }while(c < NOP_cc);
+    } while(c < NOP_cc);
 }
 
 /* Shuffle the Chance cards.*/
@@ -190,11 +193,11 @@ void shuffle_ch(ch_card ch[])
         do
         {
             i = rand() % 16;
-      }while(ch[i] != NOP_ch);
+        } while(ch[i] != NOP_ch);
 
         ch[i] = h;
         h++;
-   }while(h < NOP_ch);
+    } while(h < NOP_ch);
 }
 
 /* Function to play Monopoly, rolling the dice N times.*/
@@ -305,7 +308,7 @@ void play(long int *count_squares)
                     do
                     {
                         current = (current + 1) % 40;
-               }while(current != R1 && current != R2 && current != R3 && current != R4);
+                    } while(current != R1 && current != R2 && current != R3 && current != R4);
                 }
                 /* Go to the next Utility company.*/
                 else if(ch[ch_i] == U_ch)
@@ -313,7 +316,7 @@ void play(long int *count_squares)
                     do
                     {
                         current = (current + 1) % 40;
-               }while(current != U1 && current != U2);
+                    } while(current != U1 && current != U2);
                 }
                 /* Go back three squares.*/
                 else if(ch[ch_i] == M3)

C/p085.c

@@ -2,6 +2,8 @@
  *
  * Although there exists no rectangular grid that contains exactly two million rectangles, find the area of the grid with the nearest solution.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p086.c

@@ -9,6 +9,8 @@
  *
  * Find the least value of M such that the number of solutions first exceeds one million.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p087.c

@@ -8,6 +8,8 @@
  *
  * How many numbers below fifty million can be expressed as the sum of a prime square, prime cube, and prime fourth power?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p089.c

@@ -19,6 +19,8 @@
  *
  * Note: You can assume that all the Roman numerals in the file contain no more than four consecutive identical units.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>

C/p092.c

@@ -10,6 +10,8 @@
  *
  * How many starting numbers below ten million will arrive at 89?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p095.c

@@ -12,6 +12,8 @@
  *
  * Find the smallest member of the longest amicable chain with no element exceeding one million.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p096.c

@@ -25,6 +25,8 @@
  *    By solving all fifty puzzles find the sum of the 3-digit numbers found in the top left corner of each solution grid;
  *    for example, 483 is the 3-digit number found in the top left corner of the solution grid above.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p097.c

@@ -5,6 +5,8 @@
  *
  * Find the last ten digits of this prime number.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p099.c

@@ -8,6 +8,8 @@
  *
  * NOTE: The first two lines in the file represent the numbers in the example given above.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>

C/p102.c

@@ -12,6 +12,8 @@
  *
  * NOTE: The first two examples in the file represent the triangles in the example given above.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>
@@ -21,7 +23,7 @@ typedef struct point
 {
     int x;
     int y;
-}point;
+} point;
 
 int main(int argc, char **argv)
 {

C/p104.c

@@ -7,6 +7,8 @@
 *
 * Given that F_k is the first Fibonacci number for which the first nine digits AND the last nine digits are 1-9 pandigital, find k.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p112.c

@@ -11,6 +11,8 @@
  *
  * Find the least number for which the proportion of bouncy numbers is exactly 99%.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <string.h>

C/p124.c

@@ -19,6 +19,8 @@
  *
  * If rad(n) is sorted for 1 ≤ n ≤ 100000, find E(10000).*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>
@@ -31,7 +33,7 @@ typedef struct n_rad
 {
     int n;
     int radn;
-}n_radn;
+} n_radn;
 
 int compare(void *a, void *b);
 

C/p145.c

@@ -6,6 +6,8 @@
  *
  * How many reversible numbers are there below one-billion (109)?*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p206.c

@@ -1,6 +1,8 @@
 /* Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0,
  * where each “_” is a single digit.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>

C/p357.c

@@ -4,6 +4,8 @@
  * Find the sum of all positive integers n not exceeding 100 000 000
  * such that for every divisor d of n, d+n/d is prime.*/
 
+#define _POSIX_C_SOURCE 199309L
+
 #include <stdio.h>
 #include <stdlib.h>
 #include <math.h>