September Morn Update
This commit is contained in:
parent
4e2d22a71d
commit
aac6731f2c
6856 changed files with 141342 additions and 21127 deletions
|
|
@ -1,13 +1,9 @@
|
|||
10 LET A$="abcdefghijklmnopqrstuvwxyz"
|
||||
15 LET n=10: LET m=7
|
||||
20 PRINT A$(n TO n+m-1)
|
||||
30 PRINT A$(n TO )
|
||||
40 PRINT A$( TO LEN (A$)-1)
|
||||
50 FOR i=1 TO LEN (A$)
|
||||
60 IF A$(i)="g" THEN PRINT A$(i TO i+m-1): LET i=LEN (A$): GO TO 70
|
||||
70 NEXT i
|
||||
80 LET B$="ijk"
|
||||
90 FOR i=1 TO LEN (A$)-LEN (B$)+1
|
||||
100 IF A$(i TO i+LEN (B$)-1)=B$ THEN PRINT A$(i TO i+m-1): LET i=LEN (A$)-LEN (B$)+1: GO TO 110
|
||||
110 NEXT i
|
||||
120 STOP
|
||||
100 LET A$="abcdefghijklmnopqrstuvwxyz"
|
||||
110 LET N=10:LET M=7
|
||||
120 PRINT A$(N:N+M-1)
|
||||
130 PRINT A$(N:)
|
||||
140 PRINT A$(:LEN(A$)-1)
|
||||
150 LET I=POS(A$,"g")
|
||||
160 PRINT A$(I:I+M-1)
|
||||
170 LET I=POS(A$,"ijk")
|
||||
180 PRINT A$(I:I+M-1)
|
||||
|
|
|
|||
|
|
@ -1,12 +1,13 @@
|
|||
10 LET A$="abcdefghijklmnopqrstuvwxyz": LET la=LEN A$
|
||||
20 LET n=10: LET m=7
|
||||
30 PRINT A$(n TO n+m-1)
|
||||
40 PRINT A$(n TO )
|
||||
50 PRINT A$( TO la-1)
|
||||
60 FOR i=1 TO la
|
||||
70 IF A$(i)="g" THEN PRINT A$(i TO i+m-1): LET i=la
|
||||
80 NEXT i
|
||||
90 LET B$="ijk": LET lb=LEN b$
|
||||
100 FOR i=1 TO la-lb+1
|
||||
110 IF A$(i TO i+lb-1)=B$ THEN PRINT A$(i TO i+m-1): LET i=la-lb+1
|
||||
120 NEXT i
|
||||
10 LET A$="abcdefghijklmnopqrstuvwxyz"
|
||||
15 LET n=10: LET m=7
|
||||
20 PRINT A$(n TO n+m-1)
|
||||
30 PRINT A$(n TO )
|
||||
40 PRINT A$( TO LEN (A$)-1)
|
||||
50 FOR i=1 TO LEN (A$)
|
||||
60 IF A$(i)="g" THEN PRINT A$(i TO i+m-1): LET i=LEN (A$): GO TO 70
|
||||
70 NEXT i
|
||||
80 LET B$="ijk"
|
||||
90 FOR i=1 TO LEN (A$)-LEN (B$)+1
|
||||
100 IF A$(i TO i+LEN (B$)-1)=B$ THEN PRINT A$(i TO i+m-1): LET i=LEN (A$)-LEN (B$)+1: GO TO 110
|
||||
110 NEXT i
|
||||
120 STOP
|
||||
|
|
|
|||
12
Task/Substring/BASIC/substring-5.basic
Normal file
12
Task/Substring/BASIC/substring-5.basic
Normal file
|
|
@ -0,0 +1,12 @@
|
|||
10 LET A$="abcdefghijklmnopqrstuvwxyz": LET la=LEN A$
|
||||
20 LET n=10: LET m=7
|
||||
30 PRINT A$(n TO n+m-1)
|
||||
40 PRINT A$(n TO )
|
||||
50 PRINT A$( TO la-1)
|
||||
60 FOR i=1 TO la
|
||||
70 IF A$(i)="g" THEN PRINT A$(i TO i+m-1): LET i=la
|
||||
80 NEXT i
|
||||
90 LET B$="ijk": LET lb=LEN b$
|
||||
100 FOR i=1 TO la-lb+1
|
||||
110 IF A$(i TO i+lb-1)=B$ THEN PRINT A$(i TO i+m-1): LET i=la-lb+1
|
||||
120 NEXT i
|
||||
25
Task/Substring/BASIC/substring-6.basic
Normal file
25
Task/Substring/BASIC/substring-6.basic
Normal file
|
|
@ -0,0 +1,25 @@
|
|||
basestring$ = "The five boxing wizards jump quickly"
|
||||
n% = 10
|
||||
m% = 5
|
||||
|
||||
REM starting from n characters in and of m length:
|
||||
substring$ = MID$(basestring$, n%, m%)
|
||||
PRINT substring$
|
||||
|
||||
REM starting from n characters in, up to the end of the string:
|
||||
substring$ = MID$(basestring$, n%)
|
||||
PRINT substring$
|
||||
|
||||
REM whole string minus last character:
|
||||
substring$ = LEFT$(basestring$)
|
||||
PRINT substring$
|
||||
|
||||
REM starting from a known character within the string and of m length:
|
||||
char$ = "w"
|
||||
substring$ = MID$(basestring$, INSTR(basestring$, char$), m%)
|
||||
PRINT substring$
|
||||
|
||||
REM starting from a known substring within the string and of m length:
|
||||
find$ = "iz"
|
||||
substring$ = MID$(basestring$, INSTR(basestring$, find$), m%)
|
||||
PRINT substring$
|
||||
Loading…
Add table
Add a link
Reference in a new issue