dig
dig();
void dig(void);
return ((occupation == dig) ? (250 - dig_effort) / 20 : -1);
occupation = dig;
occupation = dig;
static int dig(void);
dig(ny, nx);
int bbits, b2, b5, be, dig, i, ieps, ilim0,
dig = quorem(b,S) + '0';
if (dig == '9')
dig++;
*s++ = dig;
if ((jj1 > 0 || (jj1 == 0 && dig & 1))
&& dig++ == '9')
*s++ = dig;
if (dig == '9') { /* possible if i == 1 */
*s++ = dig + 1;
*s++ = dig;
*s++ = dig = quorem(b,S) + '0';
if (j > 0 || (j == 0 && dig & 1))
int bbits, b2, b5, be0, dig, i, ieps, ilim = 0, ilim0, ilim1 = 0, inex;
dig = quorem(b,S) + '0';
if (dig == '9')
dig++;
*s++ = dig;
*s++ = dig;
dig = quorem(b,S) + '0';
if (dig++ == '9')
if ((jj1 > 0 || (jj1 == 0 && dig & 1))
&& dig++ == '9')
*s++ = dig;
if (dig == '9') { /* possible if i == 1 */
*s++ = dig + 1;
*s++ = dig;
*s++ = dig = quorem(b,S) + '0';
if (j > 0 || (j == 0 && dig & 1))
int dig = 0;
dig = 0;
if (++dig == 3) {
int dig;
dig = n = code = 0;
dig++;
((verbose > -1 && n == '5' && dig > 4) &&
(dig == 1 || (dig == 5 && verbose == 0)))
if (dig < 4 && isdigit(c))
if (dig > 4 && pflag == 1 && isdigit(c))
if (dig == 4 && c == '-') {