1 /* $NetBSD: arithmetic.c,v 1.18 2002/03/31 04:07:22 hubertf Exp $ */ 2 3 /* 4 * Copyright (c) 1989, 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Eamonn McManus of Trinity College Dublin. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 */ 38 39 #include <sys/cdefs.h> 40 #ifndef lint 41 __COPYRIGHT("@(#) Copyright (c) 1989, 1993\n\ 42 The Regents of the University of California. All rights reserved.\n"); 43 #endif /* not lint */ 44 45 #ifndef lint 46 #if 0 47 static char sccsid[] = "@(#)arithmetic.c 8.1 (Berkeley) 5/31/93"; 48 #else 49 __RCSID("$NetBSD: arithmetic.c,v 1.18 2002/03/31 04:07:22 hubertf Exp $"); 50 #endif 51 #endif /* not lint */ 52 53 /* 54 * By Eamonn McManus, Trinity College Dublin <emcmanus@cs.tcd.ie>. 55 * 56 * The operation of this program mimics that of the standard Unix game 57 * `arithmetic'. I've made it as close as I could manage without examining 58 * the source code. The principal differences are: 59 * 60 * The method of biasing towards numbers that had wrong answers in the past 61 * is different; original `arithmetic' seems to retain the bias forever, 62 * whereas this program lets the bias gradually decay as it is used. 63 * 64 * Original `arithmetic' delays for some period (3 seconds?) after printing 65 * the score. I saw no reason for this delay, so I scrapped it. 66 * 67 * There is no longer a limitation on the maximum range that can be supplied 68 * to the program. The original program required it to be less than 100. 69 * Anomalous results may occur with this program if ranges big enough to 70 * allow overflow are given. 71 * 72 * I have obviously not attempted to duplicate bugs in the original. It 73 * would go into an infinite loop if invoked as `arithmetic / 0'. It also 74 * did not recognise an EOF in its input, and would continue trying to read 75 * after it. It did not check that the input was a valid number, treating any 76 * garbage as 0. Finally, it did not flush stdout after printing its prompt, 77 * so in the unlikely event that stdout was not a terminal, it would not work 78 * properly. 79 */ 80 81 #include <sys/types.h> 82 #include <err.h> 83 #include <ctype.h> 84 #include <signal.h> 85 #include <stdio.h> 86 #include <stdlib.h> 87 #include <string.h> 88 #include <time.h> 89 #include <unistd.h> 90 91 int getrandom __P((int, int, int)); 92 void intr __P((int)) __attribute__((__noreturn__)); 93 int main __P((int, char *[])); 94 int opnum __P((int)); 95 void penalise __P((int, int, int)); 96 int problem __P((void)); 97 void showstats __P((int)); 98 void usage __P((void)) __attribute__((__noreturn__)); 99 100 const char keylist[] = "+-x/"; 101 const char defaultkeys[] = "+-"; 102 const char *keys = defaultkeys; 103 int nkeys = sizeof(defaultkeys) - 1; 104 int rangemax = 10; 105 int nright, nwrong; 106 time_t qtime; 107 #define NQUESTS 20 108 109 /* 110 * Select keys from +-x/ to be asked addition, subtraction, multiplication, 111 * and division problems. More than one key may be given. The default is 112 * +-. Specify a range to confine the operands to 0 - range. Default upper 113 * bound is 10. After every NQUESTS questions, statistics on the performance 114 * so far are printed. 115 */ 116 int 117 main(argc, argv) 118 int argc; 119 char **argv; 120 { 121 int ch, cnt; 122 123 /* Revoke setgid privileges */ 124 setgid(getgid()); 125 126 while ((ch = getopt(argc, argv, "r:o:")) != -1) 127 switch(ch) { 128 case 'o': { 129 const char *p; 130 131 for (p = keys = optarg; *p; ++p) 132 if (!strchr(keylist, *p)) 133 errx(1, "arithmetic: unknown key."); 134 nkeys = p - optarg; 135 break; 136 } 137 case 'r': 138 if ((rangemax = atoi(optarg)) <= 0) 139 errx(1, "arithmetic: invalid range."); 140 break; 141 case '?': 142 default: 143 usage(); 144 } 145 if (argc -= optind) 146 usage(); 147 148 /* Seed the random-number generator. */ 149 srandom((int)time((time_t *)NULL)); 150 151 (void)signal(SIGINT, intr); 152 153 /* Now ask the questions. */ 154 for (;;) { 155 for (cnt = NQUESTS; cnt--;) 156 if (problem() == EOF) 157 exit(0); 158 showstats(0); 159 } 160 /* NOTREACHED */ 161 } 162 163 /* Handle interrupt character. Print score and exit. */ 164 void 165 intr(dummy) 166 int dummy __attribute__((__unused__)); 167 { 168 showstats(1); 169 exit(0); 170 } 171 172 /* Print score. Original `arithmetic' had a delay after printing it. */ 173 void 174 showstats(bool_sigint) 175 int bool_sigint; 176 { 177 if (nright + nwrong > 0) { 178 (void)printf("\n\nRights %d; Wrongs %d; Score %d%%", 179 nright, nwrong, (int)(100L * nright / (nright + nwrong))); 180 if (nright > 0) 181 (void)printf("\nTotal time %ld seconds; %.1f seconds per problem\n\n", 182 (long)qtime, (float)qtime / nright); 183 } 184 if(!bool_sigint) { 185 (void)printf("Press RETURN to continue...\n"); 186 while(!getchar()) ; 187 } 188 (void)printf("\n"); 189 } 190 191 /* 192 * Pick a problem and ask it. Keeps asking the same problem until supplied 193 * with the correct answer, or until EOF or interrupt is typed. Problems are 194 * selected such that the right operand and either the left operand (for +, x) 195 * or the correct result (for -, /) are in the range 0 to rangemax. Each wrong 196 * answer causes the numbers in the problem to be penalised, so that they are 197 * more likely to appear in subsequent problems. 198 */ 199 int 200 problem() 201 { 202 char *p; 203 time_t start, finish; 204 int left, op, right, result; 205 char line[80]; 206 207 right = left = result = 0; 208 op = keys[random() % nkeys]; 209 if (op != '/') 210 right = getrandom(rangemax + 1, op, 1); 211 retry: 212 /* Get the operands. */ 213 switch (op) { 214 case '+': 215 left = getrandom(rangemax + 1, op, 0); 216 result = left + right; 217 break; 218 case '-': 219 result = getrandom(rangemax + 1, op, 0); 220 left = right + result; 221 break; 222 case 'x': 223 left = getrandom(rangemax + 1, op, 0); 224 result = left * right; 225 break; 226 case '/': 227 right = getrandom(rangemax, op, 1) + 1; 228 result = getrandom(rangemax + 1, op, 0); 229 left = right * result + random() % right; 230 break; 231 } 232 233 /* 234 * A very big maxrange could cause negative values to pop 235 * up, owing to overflow. 236 */ 237 if (result < 0 || left < 0) 238 goto retry; 239 240 (void)printf("%d %c %d = ", left, op, right); 241 (void)fflush(stdout); 242 (void)time(&start); 243 244 /* 245 * Keep looping until the correct answer is given, or until EOF or 246 * interrupt is typed. 247 */ 248 for (;;) { 249 if (!fgets(line, sizeof(line), stdin)) { 250 (void)printf("\n"); 251 return(EOF); 252 } 253 for (p = line; *p && isspace(*p); ++p); 254 if (!isdigit(*p)) { 255 (void)printf("Please type a number.\n"); 256 continue; 257 } 258 if (atoi(p) == result) { 259 (void)printf("Right!\n"); 260 ++nright; 261 break; 262 } 263 /* Wrong answer; penalise and ask again. */ 264 (void)printf("What?\n"); 265 ++nwrong; 266 penalise(right, op, 1); 267 if (op == 'x' || op == '+') 268 penalise(left, op, 0); 269 else 270 penalise(result, op, 0); 271 } 272 273 /* 274 * Accumulate the time taken. Obviously rounding errors happen here; 275 * however they should cancel out, because some of the time you are 276 * charged for a partially elapsed second at the start, and some of 277 * the time you are not charged for a partially elapsed second at the 278 * end. 279 */ 280 (void)time(&finish); 281 qtime += finish - start; 282 return(0); 283 } 284 285 /* 286 * Here is the code for accumulating penalties against the numbers for which 287 * a wrong answer was given. The right operand and either the left operand 288 * (for +, x) or the result (for -, /) are stored in a list for the particular 289 * operation, and each becomes more likely to appear again in that operation. 290 * Initially, each number is charged a penalty of WRONGPENALTY, giving it that 291 * many extra chances of appearing. Each time it is selected because of this, 292 * its penalty is decreased by one; it is removed when it reaches 0. 293 * 294 * The penalty[] array gives the sum of all penalties in the list for 295 * each operation and each operand. The penlist[] array has the lists of 296 * penalties themselves. 297 */ 298 299 int penalty[sizeof(keylist) - 1][2]; 300 struct penalty { 301 int value, penalty; /* Penalised value and its penalty. */ 302 struct penalty *next; 303 } *penlist[sizeof(keylist) - 1][2]; 304 305 #define WRONGPENALTY 5 /* Perhaps this should depend on maxrange. */ 306 307 /* 308 * Add a penalty for the number `value' to the list for operation `op', 309 * operand number `operand' (0 or 1). If we run out of memory, we just 310 * forget about the penalty (how likely is this, anyway?). 311 */ 312 void 313 penalise(value, op, operand) 314 int value, op, operand; 315 { 316 struct penalty *p; 317 318 op = opnum(op); 319 if ((p = (struct penalty *)malloc((u_int)sizeof(*p))) == NULL) 320 return; 321 p->next = penlist[op][operand]; 322 penlist[op][operand] = p; 323 penalty[op][operand] += p->penalty = WRONGPENALTY; 324 p->value = value; 325 } 326 327 /* 328 * Select a random value from 0 to maxval - 1 for operand `operand' (0 or 1) 329 * of operation `op'. The random number we generate is either used directly 330 * as a value, or represents a position in the penalty list. If the latter, 331 * we find the corresponding value and return that, decreasing its penalty. 332 */ 333 int 334 getrandom(maxval, op, operand) 335 int maxval, op, operand; 336 { 337 int value; 338 struct penalty **pp, *p; 339 340 op = opnum(op); 341 value = random() % (maxval + penalty[op][operand]); 342 343 /* 344 * 0 to maxval - 1 is a number to be used directly; bigger values 345 * are positions to be located in the penalty list. 346 */ 347 if (value < maxval) 348 return(value); 349 value -= maxval; 350 351 /* 352 * Find the penalty at position `value'; decrement its penalty and 353 * delete it if it reaches 0; return the corresponding value. 354 */ 355 for (pp = &penlist[op][operand]; (p = *pp) != NULL; pp = &p->next) { 356 if (p->penalty > value) { 357 value = p->value; 358 penalty[op][operand]--; 359 if (--(p->penalty) <= 0) { 360 p = p->next; 361 (void)free((char *)*pp); 362 *pp = p; 363 } 364 return(value); 365 } 366 value -= p->penalty; 367 } 368 /* 369 * We can only get here if the value from the penalty[] array doesn't 370 * correspond to the actual sum of penalties in the list. Provide an 371 * obscure message. 372 */ 373 errx(1, "arithmetic: bug: inconsistent penalties."); 374 /* NOTREACHED */ 375 } 376 377 /* Return an index for the character op, which is one of [+-x/]. */ 378 int 379 opnum(op) 380 int op; 381 { 382 char *p; 383 384 if (op == 0 || (p = strchr(keylist, op)) == NULL) 385 errx(1, "arithmetic: bug: op %c not in keylist %s", 386 op, keylist); 387 return(p - keylist); 388 } 389 390 /* Print usage message and quit. */ 391 void 392 usage() 393 { 394 (void)fprintf(stderr, "Usage: %s [-o +-x/] [-r range]\n", 395 getprogname()); 396 exit(1); 397 } 398