Automatic Song Maker

[SierraKen]

Hopefully nobody has made this one recently. LOL
I just tossed this together tonight. It doesn't display the notes, but it does countdown the time left.
It randomly generates quick notes through the speakers, like the old fashioned science fiction movies.

Code: QB64: [Select]

1. start:
2. CLS
3. PRINT "Automatic Song Maker"
4. PRINT
5. PRINT "By SierraKen"
6. PRINT: PRINT: PRINT
7. INPUT "Press Enter to listen to a random song.", a$
8. CLS
9. RANDOMIZE TIMER
10. amount = INT(RND * 300) + 51
11. changes = INT(RND * 30) + 10
12. FOR note = 1 TO amount
13.     RANDOMIZE TIMER
14.     n = INT(RND * 13) + 35
15.     n2 = INT(RND * changes) + 35
16.     PLAY "L16N" + STR$(n)
17.     PLAY "L16N" + STR$(n2)
18.     am = amount - note
19.     LOCATE 2, 1: PRINT am
20.     _DELAY .25
21. NEXT note
22. LOCATE 10, 1
23. PRINT "Again? (Y/N)"
24. again:
25. ag$ = INKEY$
26. IF ag$ = "y" OR ag$ = "Y" THEN GOTO start:
27. IF ag$ <> "" THEN END
28. GOTO again:
29.  

[bplus]

Hey Ken,

Neat!

I did one for the first prime factor of numbers  2 and up....

Code: QB64: [Select]

1. ' Audio presentation of numbers.bas for QB64 fork (B+=MGA) 2017-09-20
2. ' Using Owens 2X Deluxe Mod
3. _TITLE "Audio Presentation of Numbers as Primes = 0 or First Factor"
4. _DEFINE A-Z AS _INTEGER64
5. OPTION BASE 1
6. COMMON SHARED ff(), topN
7. topN = 1000000
8. testlimitN = SQR(topN)
9. DIM ff(topN + 30)
10. FOR i = 0 TO topN STEP 30
11.     ff(i + 2) = 2: ff(i + 3) = 3: ff(i + 4) = 2: ff(i + 5) = 5: ff(i + 6) = 2: ff(i + 8) = 2: ff(i + 9) = 3
12.     ff(i + 10) = 2: ff(i + 12) = 2: ff(i + 14) = 2: ff(i + 15) = 3: ff(i + 16) = 2: ff(i + 18) = 2
13.     ff(i + 20) = 2: ff(i + 21) = 3: ff(i + 22) = 2: ff(i + 24) = 2: ff(i + 25) = 5
14.     ff(i + 26) = 2: ff(i + 27) = 3: ff(i + 28) = 2: ff(i + 30) = 2
15. NEXT
16. ff(2) = 0: ff(3) = 0: ff(5) = 0
17. pattern(1) = 4: pattern(2) = 2: pattern(3) = 4: pattern(4) = 2
18. pattern(5) = 4: pattern(6) = 6: pattern(7) = 2: pattern(8) = 6
19. pcand = 7: patternI = 0
20. WHILE pcand < testlimitN
21.     IF ff(pcand) = 0 THEN
22.         i = pcand * pcand
23.         patternI2 = patternI
24.         DO
25.             IF ff(i) = 0 THEN ff(i) = pcand
26.             patternI2 = patternI2 + 1
27.             IF patternI2 = 9 THEN patternI2 = 1
28.             i = i + pattern(patternI2) * pcand
29.             IF i > topN THEN EXIT DO
30.         LOOP
31.  
32.     END IF
33.     patternI = patternI + 1
34.     IF patternI = 9 THEN patternI = 1
35.     pcand = pcand + pattern(patternI)
36. WEND
37. FOR i = 2 TO topN
38.     CLS
39.     PRINT i, ff(i)
40.     IF ff(i) = 0 THEN SOUND 137, 2 ELSE SOUND 137 + (ff(i) MOD 30) * 10, 2 - ff(i) * .001
41.     _LIMIT 60
42. NEXT
43.  

[SierraKen]

Thanks B+! That's a really awesome one you got!