aboutsummaryrefslogtreecommitdiff
path: root/challenge-173/deadmarshal/c/ch-2.c
blob: a41ef664df03fc678302563ca9ca987ce6c81755 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
#include<gmp.h>

// Sylvester’s sequence
#define N 10

void array_init(mpz_t *arr, size_t size)
{
  for(int i = 0; i < size; ++i)
    mpz_init(arr[i]);
}

void array_set(mpz_t *arr, size_t size)
{
  mpz_set_ui(arr[0], 2);
  mpz_set_ui(arr[1], 3);
  for(int i = 2; i < N; ++i)
    mpz_set_ui(arr[i], 1);
}

void array_mul(mpz_t *arr, size_t size)
{
  int k = 2;
  for(int i = 2; i < N; ++i)
  {
    for(int j = 0; j < k; ++j)
      mpz_mul(arr[k], arr[k], arr[j]);
    mpz_add_ui(arr[k], arr[k], 1);
    k++;
  }
}

void array_print(mpz_t *arr, size_t size)
{
  for(int i = 0; i < N; ++i)
    gmp_printf("%Zd\n", arr[i]); 
}

void array_free(mpz_t *arr, size_t size)
{
  for(int i = 0; i < N; ++i)
    mpz_clear(arr[i]);  
}

int main(void)
{
  mpz_t arr[N];
  array_init(arr, N);
  array_set(arr, N); 
  array_mul(arr, N);
  array_print(arr, N);
  array_free(arr, N);
  return 0;
}