forked from johannesgerer/jburkardt-cpp
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcombination_lock.html
241 lines (207 loc) · 6.17 KB
/
combination_lock.html
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
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
<html>
<head>
<title>
COMBINATION_LOCK - The Combination Lock Problem
</title>
</head>
<body bgcolor="#eeeeee" link="#cc0000" alink="#ff3300" vlink="#000055">
<h1 align = "center">
COMBINATION_LOCK <br> The Combination Lock Problem
</h1>
<hr>
<p>
<b>COMBINATION_LOCK</b>
is a C++ program which
simulates the process of determining the combination of a lock.
</p>
<p>
This program demonstrates the method of exhaustive search, that is,
it searches for an answer by trying every possibility. This requires
a way of logically ordering the possibilities.
</p>
<h3 align = "center">
Licensing:
</h3>
<p>
The computer code and data files described and made available on this web page
are distributed under
<a href = "../../txt/gnu_lgpl.txt">the GNU LGPL license.</a>
</p>
<h3 align = "center">
Languages:
</h3>
<p>
<b>COMBINATION_LOCK</b> is available in
<a href = "../../c_src/combination_lock/combination_lock.html">a C version</a> and
<a href = "../../cpp_src/combination_lock/combination_lock.html">a C++ version</a> and
<a href = "../../f77_src/combination_lock/combination_lock.html">a FORTRAN77 version</a> and
<a href = "../../f_src/combination_lock/combination_lock.html">a FORTRAN90 version</a> and
<a href = "../../m_src/combination_lock/combination_lock.html">a MATLAB version</a>.
</p>
<h3 align = "center">
Related Data and Programs:
</h3>
<p>
<a href = "../../cpp_src/change_making/change_making.html">
CHANGE_MAKING</a>,
a C++ library which
considers the change making problem,
in which a given sum is to be formed using coins of various denominations.
</p>
<p>
<a href = "../../cpp_src/combo/combo.html">
COMBO</a>,
a C++ library which
includes many combinatorial routines.
</p>
<p>
<a href = "../../cpp_src/knapsack_01/knapsack_01.html">
KNAPSACK_01</a>,
a C++ library which
uses brute force to solve small versions of the 0/1 knapsack problem;
</p>
<p>
<a href = "../../cpp_src/partition_problem/partition_problem.html">
PARTITION_PROBLEM</a>,
a C++ library which
seeks solutions of the partition problem, splitting a set of integers into
two subsets with equal sum.
</p>
<p>
<a href = "../../cpp_src/satisfy/satisfy.html">
SATISFY</a>,
a C++ program which
demonstrates, for a particular circuit, an exhaustive search
for solutions of the circuit satisfiability problem.
</p>
<p>
<a href = "../../cpp_src/subset/subset.html">
SUBSET</a>,
a C++ library which
enumerates combinations, partitions, subsets, index sets,
and other combinatorial objects.
</p>
<p>
<a href = "../../cpp_src/subset_sum/subset_sum.html">
SUBSET_SUM</a>,
a C++ library which
seeks solutions of the subset sum problem.
</p>
<p>
<a href = "../../cpp_src/tsp_brute/tsp_brute.html">
TSP_BRUTE</a>,
a C++ program which
reads a file of city-to-city distances and solves the
traveling salesperson problem, using brute force.
</p>
<h3 align = "center">
Reference:
</h3>
<p>
<ol>
<li>
Donald Kreher, Douglas Simpson,<br>
Combinatorial Algorithms,<br>
CRC Press, 1998,<br>
ISBN: 0-8493-3988-X,<br>
LC: QA164.K73.
</li>
<li>
Silvano Martello, Paolo Toth,<br>
Knapsack Problems: Algorithms and Computer Implementations,<br>
Wiley, 1990,<br>
ISBN: 0-471-92420-2,<br>
LC: QA267.7.M37.
</li>
</ol>
</p>
<h3 align = "center">
Source Code:
</h3>
<p>
<ul>
<li>
<a href = "combination_lock.cpp">combination_lock.cpp</a>, the source code.
</li>
<li>
<a href = "combination_lock.hpp">combination_lock.hpp</a>, the include file.
</li>
<li>
<a href = "combination_lock.sh">combination_lock.sh</a>,
BASH commands to compile the source code.
</li>
</ul>
</p>
<h3 align = "center">
Examples and Tests:
</h3>
<p>
<ul>
<li>
<a href = "combination_lock_prb.cpp">combination_lock_prb.cpp</a>,
a sample calling program.
</li>
<li>
<a href = "combination_lock_prb.sh">combination_lock_prb.sh</a>,
BASH commands to compile and run the sample program.
</li>
<li>
<a href = "combination_lock_prb_output.txt">combination_lock_prb_output.txt</a>,
the output file.
</li>
</ul>
</p>
<h3 align = "center">
List of Routines:
</h3>
<p>
<ul>
<li>
<b>BICYCLE_LOCK</b> finds the combination on a typical bicycle lock.
</li>
<li>
<b>COMBINATION_LOCK</b> determines the combination of a lock.
</li>
<li>
<b>COMBINATION_NEXT</b> generates lock combinations in lex order.
</li>
<li>
<b>GET_SEED</b> returns a random seed for the random number generator.
</li>
<li>
<b>I4_MAX</b> returns the maximum of two I4's.
</li>
<li>
<b>I4_MIN</b> returns the smaller of two I4's.
</li>
<li>
<b>I4_UNIFORM</b> returns a scaled pseudorandom I4.
</li>
<li>
<b>I4VEC_EQ</b> is true if two I4VEC's are equal.
</li>
<li>
<b>I4VEC_PRINT</b> prints an I4VEC.
</li>
<li>
<b>R4_ABS</b> returns the absolute value of an R4.
</li>
<li>
<b>R4_NINT</b> returns the nearest integer to an R4.
</li>
<li>
<b>TIMESTAMP</b> prints the current YMDHMS date as a time stamp.
</li>
</ul>
</p>
<p>
You can go up one level to <a href = "../cpp_src.html">
the C++ source codes</a>.
</p>
<hr>
<i>
Last modified on 13 May 2012.
</i>
<!-- John Burkardt -->
</body>
</html>