0 Members and 1 Guest are viewing this topic.
Data(0,1,1,1,1,0,0,0,1,1,0,0,1,1,1,1,1,0,0,0,0,0,0,1,1,0,3,3,1,2,0,1,1,1,1,0,0,2,0,1,0,0,1,1,1,0,0,1,0,0,0,0,1,1,1,1)->GBD1
If L=1 Data(...)->GBD1EndIf L=2 Data(...)->GBD1Endetc ...
Data(...)->GDB1.Data for map 1Data(...).Data for map 2Data(...).Data for map 3.And so on
L-1*56+GDB1->M
Copy(L-1*56+GDB1,L1,56
Data(0,2,2,2,3,1,4,1,..)->L1
Data([map 1],[map 2],[map 3] ...) ->GBD1
Copy(L-1*128+GDB1,L1,128)
Data([map 1, 56],[map 2, 42] ...)->GDB1Data(56,42 ...)->GDB2
0->AFor(I,0,L) A+{I+GDB2}->AEndCopy(A+GDB1,L1,{L+GDB2})
If {D+L1}=3 2->{D+L1}End
Copy(GDB1+{L+GDB2-1},L1,{L+GDB2}-{L+GDB2-1})
0->AFor(I,1,L A+{I+GDB2-1}->AEndCopy(A+GDB1,L1,{L+GDB2-1})
Data(7,8 |size of the first map| ...) ->GDB2
.Size of the map in X {L+BDG2-1 }->U .Size of the map in Y {L+BDG2 }->V 0->A For(I,1,L A+{I+GDB2-1}*{I+GDB2}->A .To add 2 on each loop I+1->I End Copy(A+GDB1,L1,U*V)
0->AL*2+(GDB2->I)->E.E is the end of the size data which we're scanningRepeat I=E {I}*{I-1}+A->A .No order of operations, so we have to make the multiplication come first. I+2->I .Add 2EndCopy(A+GDB1,L1,{E-1}*{E-2}).I would work too instead of E
[b]Edit:[/b] Annoying code tag bug. Try to ignore x.xOkay :)So, one line at a time:[code]0->A
L*2+(GDB2->I)->E
Repeat I=E
{I}*{I+1}+A->A
I+2->I
End/code]Finish our loop
0->AL*2+(GDB2->I)->E.E is the end of the size data which we're scanningRepeat I=E {I}*{I-1}+A->A .No order of operations, so we have to make the multiplication come first. I+2->I .Add 2EndCopy(A+GDB1,L1,{E-1}*{E-2}).I would work too instead of E.Size of the map in X{E-2}->U.Size of the map in Y{E-1}->VFixe 50->OFor(A,0,U*V-1) If {A+L1}=3 O+1->O End Text(45,40 Text AåDec,{A+L1}åDec DispGraph Pause 500End
Data(0,1,1,1,1,0,0,0,1,1,0,0,1,1,1,1,1,0,0,0,0,0,0,1,1,0,3,3,1,2,0,1,1,1,1,0,0,2,1,1,0,0,1,1,1,0,0,1,0,0,0,0,1,1,1,1)->GDB1Data(8,7)->GDB2