And the final product. It works completely. Almost positive there's no bugs but if you find any, let me know.

Code:
Lbl 0
ClrHome
Menu("OPTIONS","ROW#",A,"BIONOMIAL THEOREM",B,"QUIT",C
Lbl A
Output(10,1,"ROW#≤69
Input "ROW:",C
If C≥70:Then
Output(10,15,"ERROR
Goto A
End
Pause seq(C nCr X,X,0,C
Ans→⌊ROW
Goto 0
Lbl B
ClrHome
0→D:1→K:1→Z:1→Y
"+→Str0
"X^→Str9
Output(4,1,"D(X+A)^B
Output(5,1,"B≤69
Input "A=",A
Input "B=",B
Input "D=",D
If B≥70:Then
Output(10,1,"ERROR
Goto B
End
If D=0:Then
Output(4,1,"EQUALS ZERO
Pause
Goto B
End
ClrHome
Fix 3
For(Q,0,B
(B!)/(Q!((B-Q)!))→N
B-K→J
DN(A^Q)→G
D(A^B→H
B:Asm(prgmTOSTR:Ans→Str1
J:Asm(prgmTOSTR:Ans→Str2
H:Asm(prgmTOSTR:Ans→Str3
D:Asm(prgmTOSTR:Ans→Str5
"X→Str6
If G≠1:Then
G:Asm(prgmTOSTR:Ans→Str4
End
If D=1:Then
If B:Then
If not(Q):Then
Output(1,1,Str9+Str1
Y+length(Str9+Str1→Y
End
If Q=B:Output(Z,Y,Str0+Str3
If Q and Q≠B:Then
If A^Q:Then
If J≠1:Then
Output(Z,Y,Str0+Str4+Str9+Str2
K+1→K:Y+length(Str0+Str4+Str9+Str2→Y
End
If J=1:Then
Output(Z,Y,Str0+Str4+Str6
K+1→K:Y+length(Str0+Str4+Str6→Y
End:End
If not(A^Q):Goto E
End:End:End
If D≠1:Then
If B:Then
If not(Q):Then
Output(1,1,Str5+Str9+Str1
Y+length(Str5+Str9+Str1→Y
End
If Q=B:Output(Z,Y,Str0+Str3
If Q and Q≠B:Then
If A^Q:Then
If J≠1:Then
Output(Z,Y,Str0+Str4+Str9+Str2
K+1→K:Y+length(Str0+Str4+Str9+Str2→Y
End
If J=1:Then
Output(Z,Y,Str0+Str4+Str6
K+1→K:Y+length(Str0+Str4+Str6→Y
End:End
If not(A^Q):Goto E
End:End:End
If fPart(Z/10)=.9:Then
9:Asm(prgmSHFTUP
1→Z
End
If Y>26:Then
Y-26→Y:Z+1→Z
End:End
Lbl E
Output(Z+1,1,"DONE
Pause
Float
Goto 0
Lbl C

908 bytes. Plus the List Row which has a max of 644 bytes depending on which row you need. You will need ToString CE by MateoConLechuga to run this.

Edit: Already found an error. Asm(prgmSHFTUP. I don't know enough asm to be able to write this. Let me try.
If anyone would like to help me write the program SHFTUP, that'd be great. I'll try to figure it out.
Let me try to optimize the biggest part:


Code:
" ->Str1
For(Q,0,B
   DA^QB nCr Q->N
   Asm(prgmTOSTR
   Ans->Str2
   If N!=1 or Q=B
   Str1+Str2->Str1
   If Q!=B
   Str1+"X->Str1
   If Q<B-1
   Then
      B-Q:Asm(prgmTOSTR
      Str1+"^"+Ans->Str1
   End
   If Q!=B
   Str1+"+->Str1
End
sub(Str1,2,length(Str1)-1

Maybe there are some errors, and also no error checking, but you can fix it yourself, I'm sure Smile
There were a lot of errors in that code however, most were just syntax errors that were easy to change. That makes the code a lot shorter thanks. 479 bytes right now with a 644 max byte list. Of course, binomial theorem only works if string 1's length is less than or equal to 260 because I need to create the Shiftup assembly program still.
How would I know if this program was accepted into archives? And if it was not, how would I found out why?
seanlego23 wrote:
How would I know if this program was accepted into archives? And if it was not, how would I found out why?

You would get a PM despite it's accepted or not. If not, the admins added a reason, if I'm right.
How long does this usually take?
seanlego23 wrote:
How long does this usually take?

That depends how busy the admins are. The range is almost from 2 minutes to a week or so. Smile
yep, you will get a pm with an automated reply (or copy/pasted, idk how they do it) once your archive request is processed by an admin. Sometimes, they will add a comment such as: «you should add screenshots», usually they will do so when it is refused explaining why exactly it was refused.
So I have a second version, that's hopefully going to get uploaded to archives soon, and I wanted to know something. For the Binomial theorem, I have the setup looking like this D(X+A)^B. Should I:
1. Change it to (DX+A)^B?
or
2. Change it to D(CX+A)^B?
  
Register to Join the Conversation
Have your own thoughts to add to this or any other topic? Want to ask a question, offer a suggestion, share your own programs and projects, upload a file to the file archives, get help with calculator and computer programming, or simply chat with like-minded coders and tech and calculator enthusiasts via the site-wide AJAX SAX widget? Registration for a free Cemetech account only takes a minute.

» Go to Registration page
Page 2 of 2
» All times are UTC - 5 Hours
 
You cannot post new topics in this forum
You cannot reply to topics in this forum
You cannot edit your posts in this forum
You cannot delete your posts in this forum
You cannot vote in polls in this forum

 

Advertisement