if (i<BIGINT_LEN-1)
a.val[i+1]++;
else
- fprintf(stderr, "Overflow in bigint addition.");
+ fprintf(stderr, "Overflow in bigint addition.\n");
} else
c.val[i] = tmp;
}
int i;
for (i=0; i<BIGINT_LEN; i++) x.val[i] = 0L;
- x.val[0] = num;
- x.val[1] = 0;
+ if (num < BIGINT_MAX)
+ x.val[0] = num;
+ else {
+ x.val[0] = num-BIGINT_MAX;
+ x.val[1] = num/BIGINT_MAX;
+ }
+
return x;
}