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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
|
/*
Copyright 2015-2022 Ian Jauslin
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
#include "tools.h"
#include <stdio.h>
#include <stdlib.h>
int factorial(int n){
int i;
int res=1;
for(i=2;i<=n;i++){
res*=i;
}
return(res);
}
int ipower(int n, int p){
int i;
int res=1;
for(i=1;i<=p;i++){
res*=n;
}
return(res);
}
// power of a double
long double dpower(long double x, int p){
int i;
long double res=1.;
if(p>=0){
for(i=1;i<=p;i++){
res*=x;
}
}
else{
for(i=1;i<=-p;i++){
res/=x;
}
}
return(res);
}
// find an element in a list whose first element is its size
int list_find(int* list, int x){
int i;
for(i=1;i<=*list;i++){
if(list[i]==x){return(i);}
}
return(0);
}
// find an element in a list whose first element is not its number of elements (skips first element)
int unlist_find(int* list, int size, int x){
int i;
for(i=1;i<size;i++){
if(list[i]==x){return(i);}
}
fprintf(stderr,"error: element %d not found\n",x);
exit(-1);
}
// find an element in a list whose first element is not its number of elements (skips first element)
// no error reporting
int unlist_find_noerr(int* list, int size, int x){
int i;
for(i=1;i<size;i++){
if(list[i]==x){return(i);}
}
return(-1);
}
// find an element in a list (checks first element)
int intlist_find(int* list, int size, int x){
int i;
for(i=0;i<size;i++){
if(list[i]==x){return(i);}
}
return(-1);
}
// with error
int intlist_find_err(int* list, int size, int x){
int i;
for(i=0;i<size;i++){
if(list[i]==x){return(i);}
}
fprintf(stderr,"error: element %d not found\n",x);
exit(-1);
}
// compare two lists
int list_cmp(int* list1, int* list2){
if(*list1!=*list2){
return(0);
}
int* ptr1=list1+1;
int* ptr2=list2+1;
int i;
for(i=1;i<=*list1;i++){
if(*ptr1!=*ptr2){
return(0);
}
ptr1++;
ptr2++;
}
return(1);
}
// max and min
int max(int x1, int x2){
if(x1>=x2){
return(x1);
}
else{
return(x2);
}
}
int min(int x1, int x2){
if(x1<=x2){
return(x1);
}
else{
return(x2);
}
}
// check whether a divides b
int is_factor(int a, int b){
if(b-a*(b/a)==0){
return(1);
}
else{
return(0);
}
}
|
