The Staircase

Difficulty: 800 2000 ms 128 MB

implementation

Print an N-step staircase of # characters, right-aligned: row i (1-based) has i hashes preceded by N−i spaces.

Input: one integer N.

Output: the figure, one row per line.

Constraints:

• 1 ≤ N ≤ 100

Sample Tests

3

  #
 ##
###

1

#

Read the Editorial