Pseudocode SolutionsPseudocode Solutions
🎆
Happy New Year
Week 1, 2026
All SolutionsPseudocode - Increment & Decrement Spaces | program52 | Pseudocode Solutions
CALL drawFireworks(99)
PROCEDURE drawFireworks(size : INTEGER)
DECLARE midpoint, row, leadingSpaces, middleSpaces : INTEGER
midpoint ← (size DIV 2) + 1
leadingSpaces ← 0
middleSpaces ← (size - 3) / 2
FOR row ← 1 TO size
IF row < midpoint THEN
OUTPUT strRepeat(" ", leadingSpaces), "\\", strRepeat(" ", middleSpaces), "|", strRepeat(" ", middleSpaces), "/", strRepeat(" ", leadingSpaces)
middleSpaces ← middleSpaces - 1
leadingSpaces ← leadingSpaces + 1
ELSE
IF row = midpoint THEN
OUTPUT strRepeat("-", size)
middleSpaces ← 0
leadingSpaces ← leadingSpaces - 1
ELSE
OUTPUT strRepeat(" ", leadingSpaces), "/", strRepeat(" ", middleSpaces), "|", strRepeat(" ", middleSpaces), "\\", strRepeat(" ", leadingSpaces)
middleSpaces ← middleSpaces + 1
leadingSpaces ← leadingSpaces - 1
ENDIF
ENDIF
NEXT row
ENDPROCEDURE
FUNCTION strRepeat(str : STRING, count : INTEGER) RETURNS STRING
DECLARE index : INTEGER
DECLARE out : STRING
out ← ""
FOR index ← 1 TO count
out ← out & str
NEXT index
RETURN out
ENDFUNCTION
Pseudocode approach to Happy New Year problem | MarsKing | Pseudocode Solutions
PROCEDURE fireworks(NumberOfFireWorks:INTEGER)
DECLARE MidPositon: INTEGER
DECLARE Top: BOOLEAN
DECLARE dash,spaces,remaningspaces: STRING
MidPositon ← INT((NumberOfFireWorks + 1)/2)
Top ← TRUE
spaces ← ""
dash ← ""
remaningspaces ← ""
FOR Count ← 1 TO (MidPositon-2)
spaces ← spaces & " "
NEXT Count
FOR Count ← 1 TO (NumberOfFireWorks-1)
IF Count = MidPositon THEN
FOR I ← 1 TO NumberOfFireWorks
dash ← dash & "-"
NEXT I
OUTPUT dash
Top ← FALSE
ENDIF
IF Top = TRUE THEN
OUTPUT remaningspaces,'\\',spaces,"|",spaces,"/"
IF LENGTH(spaces) >= 1 THEN
spaces ← MID(spaces, 1, (LENGTH(spaces)-1))
remaningspaces ← remaningspaces & " "
ENDIF
ELSE
OUTPUT remaningspaces,"/",spaces,"|",spaces,'\\'
spaces ← spaces & " "
remaningspaces ← MID(remaningspaces,1, (LENGTH(remaningspaces)-1))
ENDIF
NEXT Count
ENDPROCEDURE