Ok so, I'm working on a program that counts in binary up to 3 bytes. I did this to find out the total number of combinations for 3 bytes, just for personal knowledge. Currently, I have
def test(): #nested forloop binary counter;
input1 = 2
counter = 1
for a in range(input1):
for b in range(input1):
for c in range(input1):
for d in range(input1):
for e in range(input1):
for f in range(input1):
for g in range(input1):
for h in range(input1): #H = 8, 1 Byte
for i in range(input1):
for j in range(input1):
for k in range(input1):
for l in range(input1):
for m in range(input1):
for n in range(input1):
for o in range(input1):
for p in range(input1): #P = 16, 2 Bytes
for q in range(input1):
for r in range(input1):
for s in range(input1):
for t in range(input1):
for u in range(input1):
for v in range(input1):
for w in range(input1):
for x in range(input1): #X = 24, 3 Bytes
print(a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,' ',counter)
counter = counter + 1
When I try to run this, it gives me an error: "too many statically nested blocks". So is there any way to get around this with the same effect, but without all the nested for-loops?