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
|
#ifndef EULER_UTILS_H
#define EULER_UTILS_H
typedef struct list
{
struct list *next;
void *value;
} list_t;
typedef void (*list_free_cb)(void *value);
typedef int (*list_compare_cb)(void *a, void *b);
list_t *list_append(list_t *list, void *value);
list_t *list_append_int(list_t *list, int i);
list_t *list_append_long(list_t *list, long l);
int list_len(list_t *list);
void *list_get_n(list_t *list, int n);
void list_sort(list_t **list, list_compare_cb);
void list_free_int(void *value);
void list_free_long(void *value);
void list_free(list_t *list, list_free_cb cb);
long int fib(unsigned long int n);
long int fac(unsigned long int n);
list_t *prime_factors_naive(const long *prime_table, long prime_table_size,
long number);
long int gcd(long int a, long int b);
long int lcm(long int a, long int b);
int is_coprime(long int a, long int b);
int pythagorean_triplet(int p, int q, int *a, int *b, int *c);
long modpow(long b, long e, long m);
int is_prime_rabmil(long int n, long int k);
#endif // EULER_UTILS_H
|
