View Single Post
Old 14 May 2017, 16:08   #8
Omnia fert aetas

ross's Avatar
Join Date: Mar 2017
Location: Crossing the Rubicon
Age: 47
Posts: 759
Originally Posted by a/b View Post
d0/d1: $00-$99 (in BCD)
X: 0|1
Z: 0|1
100*100*2*2=40000 combinations

If we're supposed to support invalid BCD as input, then it would be:
256*256*2*2=262144 combinations
Yes, i mean 2^16 D0, D1 input value (with illegal $A-$F).
And you take to my attention that my algo take into account only 2^17 combination (D0, D1, X/C in and out).
I've totally forgotten Z provision...

ross is offline  
Page generated in 0.06610 seconds with 10 queries