houses.c revision 1.2 1 1.1 cgd /*
2 1.1 cgd * Copyright (c) 1980 Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * Redistribution and use in source and binary forms, with or without
6 1.1 cgd * modification, are permitted provided that the following conditions
7 1.1 cgd * are met:
8 1.1 cgd * 1. Redistributions of source code must retain the above copyright
9 1.1 cgd * notice, this list of conditions and the following disclaimer.
10 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer in the
12 1.1 cgd * documentation and/or other materials provided with the distribution.
13 1.1 cgd * 3. All advertising materials mentioning features or use of this software
14 1.1 cgd * must display the following acknowledgement:
15 1.1 cgd * This product includes software developed by the University of
16 1.1 cgd * California, Berkeley and its contributors.
17 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
18 1.1 cgd * may be used to endorse or promote products derived from this software
19 1.1 cgd * without specific prior written permission.
20 1.1 cgd *
21 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 1.1 cgd * SUCH DAMAGE.
32 1.1 cgd */
33 1.1 cgd
34 1.1 cgd #ifndef lint
35 1.2 mycroft /*static char sccsid[] = "from: @(#)houses.c 5.5 (Berkeley) 6/1/90";*/
36 1.2 mycroft static char rcsid[] = "$Id: houses.c,v 1.2 1993/08/01 18:53:40 mycroft Exp $";
37 1.1 cgd #endif /* not lint */
38 1.1 cgd
39 1.1 cgd # include "monop.ext"
40 1.1 cgd
41 1.1 cgd static char *names[N_MON+2],
42 1.1 cgd cur_prop[80];
43 1.1 cgd
44 1.1 cgd static MON *monops[N_MON];
45 1.1 cgd
46 1.1 cgd /*
47 1.1 cgd * These routines deal with buying and selling houses
48 1.1 cgd */
49 1.1 cgd buy_houses() {
50 1.1 cgd
51 1.1 cgd reg int num_mon;
52 1.1 cgd reg MON *mp;
53 1.1 cgd reg OWN *op;
54 1.1 cgd bool good,got_morg;
55 1.1 cgd int i,p;
56 1.1 cgd
57 1.1 cgd over:
58 1.1 cgd num_mon = 0;
59 1.1 cgd good = TRUE;
60 1.1 cgd got_morg = FALSE;
61 1.1 cgd for (op = cur_p->own_list; op && op->sqr->type != PRPTY; op = op->next)
62 1.1 cgd continue;
63 1.1 cgd while (op)
64 1.1 cgd if (op->sqr->desc->monop) {
65 1.1 cgd mp = op->sqr->desc->mon_desc;
66 1.1 cgd names[num_mon] = (monops[num_mon]=mp)->name;
67 1.1 cgd num_mon++;
68 1.1 cgd got_morg = good = FALSE;
69 1.1 cgd for (i = 0; i < mp->num_in; i++) {
70 1.1 cgd if (op->sqr->desc->morg)
71 1.1 cgd got_morg++;
72 1.1 cgd if (op->sqr->desc->houses != 5)
73 1.1 cgd good++;
74 1.1 cgd op = op->next;
75 1.1 cgd }
76 1.1 cgd if (!good || got_morg)
77 1.1 cgd --num_mon;
78 1.1 cgd }
79 1.1 cgd else
80 1.1 cgd op = op->next;
81 1.1 cgd if (num_mon == 0) {
82 1.1 cgd if (got_morg)
83 1.1 cgd printf("You can't build on mortgaged monopolies.\n");
84 1.1 cgd else if (!good)
85 1.1 cgd printf("You can't build any more.\n");
86 1.1 cgd else
87 1.1 cgd printf("But you don't have any monopolies!!\n");
88 1.1 cgd return;
89 1.1 cgd }
90 1.1 cgd if (num_mon == 1)
91 1.1 cgd buy_h(monops[0]);
92 1.1 cgd else {
93 1.1 cgd names[num_mon++] = "done";
94 1.1 cgd names[num_mon--] = 0;
95 1.1 cgd if ((p=getinp("Which property do you wish to buy houses for? ", names)) == num_mon)
96 1.1 cgd return;
97 1.1 cgd buy_h(monops[p]);
98 1.1 cgd goto over;
99 1.1 cgd }
100 1.1 cgd }
101 1.1 cgd
102 1.1 cgd buy_h(mnp)
103 1.1 cgd MON *mnp; {
104 1.1 cgd
105 1.1 cgd reg int i;
106 1.1 cgd reg MON *mp;
107 1.1 cgd reg int price;
108 1.1 cgd shrt input[3],temp[3];
109 1.1 cgd int tot;
110 1.1 cgd PROP *pp;
111 1.1 cgd
112 1.1 cgd mp = mnp;
113 1.1 cgd price = mp->h_cost * 50;
114 1.1 cgd blew_it:
115 1.1 cgd list_cur(mp);
116 1.1 cgd printf("Houses will cost $%d\n", price);
117 1.1 cgd printf("How many houses do you wish to buy for\n");
118 1.1 cgd for (i = 0; i < mp->num_in; i++) {
119 1.1 cgd pp = mp->sq[i]->desc;
120 1.1 cgd over:
121 1.1 cgd if (pp->houses == 5) {
122 1.1 cgd printf("%s (H):\n", mp->sq[i]->name);
123 1.1 cgd input[i] = 0;
124 1.1 cgd temp[i] = 5;
125 1.1 cgd continue;
126 1.1 cgd }
127 1.1 cgd (void)sprintf(cur_prop, "%s (%d): ",
128 1.1 cgd mp->sq[i]->name, pp->houses);
129 1.1 cgd input[i] = get_int(cur_prop);
130 1.1 cgd temp[i] = input[i] + pp->houses;
131 1.1 cgd if (temp[i] > 5) {
132 1.1 cgd printf("That's too many. The most you can buy is %d\n",
133 1.1 cgd 5 - pp->houses);
134 1.1 cgd goto over;
135 1.1 cgd }
136 1.1 cgd }
137 1.1 cgd if (mp->num_in == 3 && (abs(temp[0] - temp[1]) > 1 ||
138 1.1 cgd abs(temp[0] - temp[2]) > 1 || abs(temp[1] - temp[2]) > 1)) {
139 1.1 cgd err: printf("That makes the spread too wide. Try again\n");
140 1.1 cgd goto blew_it;
141 1.1 cgd }
142 1.1 cgd else if (mp->num_in == 2 && abs(temp[0] - temp[1]) > 1)
143 1.1 cgd goto err;
144 1.1 cgd for (tot = i = 0; i < mp->num_in; i++)
145 1.1 cgd tot += input[i];
146 1.1 cgd if (tot) {
147 1.1 cgd printf("You asked for %d houses for $%d\n", tot, tot * price);
148 1.1 cgd if (getyn("Is that ok? ", yn) == 0) {
149 1.1 cgd cur_p->money -= tot * price;
150 1.1 cgd for (tot = i = 0; i < mp->num_in; i++)
151 1.1 cgd mp->sq[i]->desc->houses = temp[i];
152 1.1 cgd }
153 1.1 cgd }
154 1.1 cgd }
155 1.1 cgd
156 1.1 cgd /*
157 1.1 cgd * This routine sells houses.
158 1.1 cgd */
159 1.1 cgd sell_houses() {
160 1.1 cgd
161 1.1 cgd reg int num_mon;
162 1.1 cgd reg MON *mp;
163 1.1 cgd reg OWN *op;
164 1.1 cgd bool good;
165 1.1 cgd int p;
166 1.1 cgd
167 1.1 cgd over:
168 1.1 cgd num_mon = 0;
169 1.1 cgd good = TRUE;
170 1.1 cgd for (op = cur_p->own_list; op; op = op->next)
171 1.1 cgd if (op->sqr->type == PRPTY && op->sqr->desc->monop) {
172 1.1 cgd mp = op->sqr->desc->mon_desc;
173 1.1 cgd names[num_mon] = (monops[num_mon]=mp)->name;
174 1.1 cgd num_mon++;
175 1.1 cgd good = 0;
176 1.1 cgd do
177 1.1 cgd if (!good && op->sqr->desc->houses != 0)
178 1.1 cgd good++;
179 1.1 cgd while (op->next && op->sqr->desc->mon_desc == mp
180 1.1 cgd && (op=op->next));
181 1.1 cgd if (!good)
182 1.1 cgd --num_mon;
183 1.1 cgd }
184 1.1 cgd if (num_mon == 0) {
185 1.1 cgd printf("You don't have any houses to sell!!\n");
186 1.1 cgd return;
187 1.1 cgd }
188 1.1 cgd if (num_mon == 1)
189 1.1 cgd sell_h(monops[0]);
190 1.1 cgd else {
191 1.1 cgd names[num_mon++] = "done";
192 1.1 cgd names[num_mon--] = 0;
193 1.1 cgd if ((p=getinp("Which property do you wish to sell houses from? ", names)) == num_mon)
194 1.1 cgd return;
195 1.1 cgd sell_h(monops[p]);
196 1.1 cgd notify();
197 1.1 cgd goto over;
198 1.1 cgd }
199 1.1 cgd }
200 1.1 cgd
201 1.1 cgd sell_h(mnp)
202 1.1 cgd MON *mnp; {
203 1.1 cgd
204 1.1 cgd reg int i;
205 1.1 cgd reg MON *mp;
206 1.1 cgd reg int price;
207 1.1 cgd shrt input[3],temp[3];
208 1.1 cgd int tot;
209 1.1 cgd PROP *pp;
210 1.1 cgd
211 1.1 cgd mp = mnp;
212 1.1 cgd price = mp->h_cost * 25;
213 1.1 cgd blew_it:
214 1.1 cgd printf("Houses will get you $%d apiece\n", price);
215 1.1 cgd list_cur(mp);
216 1.1 cgd printf("How many houses do you wish to sell from\n");
217 1.1 cgd for (i = 0; i < mp->num_in; i++) {
218 1.1 cgd pp = mp->sq[i]->desc;
219 1.1 cgd over:
220 1.1 cgd if (pp->houses == 0) {
221 1.1 cgd printf("%s (0):\n", mp->sq[i]->name);
222 1.1 cgd input[i] = temp[i] = 0;
223 1.1 cgd continue;
224 1.1 cgd }
225 1.1 cgd if (pp->houses < 5)
226 1.1 cgd (void)sprintf(cur_prop,"%s (%d): ",
227 1.1 cgd mp->sq[i]->name,pp->houses);
228 1.1 cgd else
229 1.1 cgd (void)sprintf(cur_prop,"%s (H): ",mp->sq[i]->name);
230 1.1 cgd input[i] = get_int(cur_prop);
231 1.1 cgd temp[i] = pp->houses - input[i];
232 1.1 cgd if (temp[i] < 0) {
233 1.1 cgd printf("That's too many. The most you can sell is %d\n", pp->houses);
234 1.1 cgd goto over;
235 1.1 cgd }
236 1.1 cgd }
237 1.1 cgd if (mp->num_in == 3 && (abs(temp[0] - temp[1]) > 1 ||
238 1.1 cgd abs(temp[0] - temp[2]) > 1 || abs(temp[1] - temp[2]) > 1)) {
239 1.1 cgd err: printf("That makes the spread too wide. Try again\n");
240 1.1 cgd goto blew_it;
241 1.1 cgd }
242 1.1 cgd else if (mp->num_in == 2 && abs(temp[0] - temp[1]) > 1)
243 1.1 cgd goto err;
244 1.1 cgd for (tot = i = 0; i < mp->num_in; i++)
245 1.1 cgd tot += input[i];
246 1.1 cgd if (tot) {
247 1.1 cgd printf("You asked to sell %d houses for $%d\n",tot,tot * price);
248 1.1 cgd if (getyn("Is that ok? ", yn) == 0) {
249 1.1 cgd cur_p->money += tot * price;
250 1.1 cgd for (tot = i = 0; i < mp->num_in; i++)
251 1.1 cgd mp->sq[i]->desc->houses = temp[i];
252 1.1 cgd }
253 1.1 cgd }
254 1.1 cgd }
255 1.1 cgd
256 1.1 cgd list_cur(mp)
257 1.1 cgd reg MON *mp; {
258 1.1 cgd
259 1.1 cgd reg int i;
260 1.1 cgd reg SQUARE *sqp;
261 1.1 cgd
262 1.1 cgd for (i = 0; i < mp->num_in; i++) {
263 1.1 cgd sqp = mp->sq[i];
264 1.1 cgd if (sqp->desc->houses == 5)
265 1.1 cgd printf("%s (H) ", sqp->name);
266 1.1 cgd else
267 1.1 cgd printf("%s (%d) ", sqp->name, sqp->desc->houses);
268 1.1 cgd }
269 1.1 cgd putchar('\n');
270 1.1 cgd }
271