[Go to site: main page, start]
Scribd
Upload
33 views8 pages

Python Patterns: Star and Number Shapes

The document contains various Python code snippets for generating different patterns using asterisks and numbers, including right-angled triangles, inverted triangles, pyramids, diamonds, squares, and hollow shapes. Each pattern is illustrated with its corresponding output. The code demonstrates nested loops and print statements to achieve the desired visual results.

Uploaded by

bidoc90038
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
33 views8 pages

Python Patterns: Star and Number Shapes

The document contains various Python code snippets for generating different patterns using asterisks and numbers, including right-angled triangles, inverted triangles, pyramids, diamonds, squares, and hollow shapes. Each pattern is illustrated with its corresponding output. The code demonstrates nested loops and print statements to achieve the desired visual results.

Uploaded by

bidoc90038
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

9/27/25, 5:46 PM task6

patterns
In [5]: #Right angled trangle

for i in range(1,7):
print('* '*i)

*
* *
* * *
* * * *
* * * * *
* * * * * *

In [12]: #inverted right angled trangle


for i in range(7,0,-1):
print( '* ' *i)

* * * * * * *
* * * * * *
* * * * *
* * * *
* * *
* *
*

In [ ]: #pyramid pattern
for i in range(1,11,2):
print('* ' *i)

*
* * *
* * * * *
* * * * * * *
* * * * * * * * *

In [16]: #inverted pyramid pattern


for i in range(10,0,-2):
print('* ' *i)

* * * * * * * * * *
* * * * * * * *
* * * * * *
* * * *
* *

In [ ]: #Diamond pattern
for i in range(1,7):
print('* ' *i)

for j in range(5,0,-1):
print('* '*j)

localhost:8888/doc/tree/Desktop/FDFS FOLDER/[Link]/[Link] 9/18


9/27/25, 5:46 PM task6

*
* *
* * *
* * * *
* * * * *
* * * * * *
* * * * *
* * * *
* * *
* *
*

In [ ]: #square pattern
for i in range(5):
for j in range(5):
if i==0 or i==4 or j==0 or j==4:
print('*',end=' ')

else:
print(' ', end=' ')
print()

* * * * *
* *
* *
* *
* * * * *

In [33]: #full square pattern


for i in range(5):
print('* * * * * ' )

* * * * *
* * * * *
* * * * *
* * * * *
* * * * *

In [ ]: #right angle trangle by using numbers


for i in range(0,7):
print(' '.join(str(x) for x in range(1, i+1)))

1
1 2
1 2 3
1 2 3 4
1 2 3 4 5
1 2 3 4 5 6

In [ ]: #inverse right angle trangle by numbers


for i in range(7,0,-1):
print(' '.join (str(x) for x in range(1, i+1)))

1 2 3 4 5 6 7
1 2 3 4 5 6
1 2 3 4 5
1 2 3 4
1 2 3
1 2
1

localhost:8888/doc/tree/Desktop/FDFS FOLDER/[Link]/[Link] 10/18


9/27/25, 5:46 PM task6

In [45]: #floyd'd trangle


num=1
for i in range(5):
for j in range(1,i+1):
print(num, end=' ')
num+=1
print()

1
2 3
4 5 6
7 8 9 10

In [ ]: #hallo right angle trangle


for i in range(1,7):
for j in range(1,i+1):
if j==1 or j==i or i==6:
print('*', end=' ')

else:
print(' ', end=' ')
print()

*
* *
* *
* *
* *
* * * * * *

In [79]: #hallow pyramid pattern


for i in range(1,6):
for j in range(5 - i):
print(' ', end=' ')

for j in range(2 * i - 1):


if j==0 or j==2 * i - 2 or i ==5:
print('*', end=' ')
else:
print(' ',end=' ')
print()

*
* *
* *
* *
* * * * * * * * *

In [75]: #hallow diamond pattern


n=5
for i in range(1,n+1):
for j in range(5 - i):
print(' ', end=' ')

for j in range(2 * i - 1):


if j==0 or j==2 * i - 2:
print('*', end=' ')
else:
print(' ',end=' ')
print()

localhost:8888/doc/tree/Desktop/FDFS FOLDER/[Link]/[Link] 11/18


9/27/25, 5:46 PM task6

for i in range(n-1,0,-1):
for j in range(5 - i):
print(' ', end=' ')

for j in range(2 * i - 1):


if j==0 or j==2 * i - 2 or i ==5:
print('*', end=' ')
else:
print(' ',end=' ')
print()

*
* *
* *
* *
* *
* *
* *
* *
*

In [82]: #hallow daimaond


n=5
for i in range(1,n+1):
for j in range(n-i):
print(' ',end=' ')
for j in range(2*i-1):
if j == 0 or j==2*i-2 or i ==5:
print(i,end=' ')

else:
print(' ', end=' ')
print()

1
2 2
3 3
4 4
5 5 5 5 5 5 5 5 5

In [ ]: n=5
for i in range(1, n + 1):
for j in range(n - i):
print(' ', end=' ')

for j in range(2 * i - 1):


if j==0 or j== 2 * i - 2:
print(i, end=' ')
else:
print(' ',end=' ')
print()

for i in range(n - 1, 0, -1):


for j in range(n - i):
print(' ',end=' ')

localhost:8888/doc/tree/Desktop/FDFS FOLDER/[Link]/[Link] 12/18


9/27/25, 5:46 PM task6

for j in range(2 * i - 1):


if j == 0 or j == 2 * i - 2:
print(i,end=' ')

else:
print(' ', end=' ')
print()

1
4 4
3 3
2 2
1
2 2
4 4
3 3
2 2
1
3 3
4 4
3 3
2 2
1
4 4
4 4
3 3
2 2
1
5 5
4 4
3 3
2 2
1

In [ ]: #hallow daimond numbers

n=5
for i in range(1,n+1):
for j in range(n-i):
print(' ',end=' ')
for j in range(2*i-1):
if j == 0 or j==2*i-2:
print(i,end=' ')

else:
print(' ', end=' ')
print()

for i in range(n-1,0,-1):
for j in range(n-i):
print(' ',end=' ')
for j in range(2*i-1):
if j == 0 or j==2*i-2:
print(i,end=' ')

else:
print(' ', end=' ')
print()

localhost:8888/doc/tree/Desktop/FDFS FOLDER/[Link]/[Link] 13/18


9/27/25, 5:46 PM task6

1
2 2
3 3
4 4
5 5
4 4
3 3
2 2
1

In [88]: n=5
for i in range(1,n+1):
for j in range(1,i+1):
print(j,end=' ')
for j in range(2*(n-i)):
print(' ', end=' ')
for j in range(1,i+1):
print(j,end=' ')
print()

1 1
1 2 1 2
1 2 3 1 2 3
1 2 3 4 1 2 3 4
1 2 3 4 5 1 2 3 4 5

In [ ]: #butterfly

n=5
for i in range(1,n+1):
for j in range(1,i+1):
print(j,end=' ')
for j in range(2*(n-i)):
print(' ', end=' ')
for j in range(1,i+1):
print(j,end=' ')
print()

for i in range(n-1,0,-1):
for j in range(1,i+1):
print(j,end=' ')
for j in range(2*(n-i)):
print(' ', end=' ')
for j in range(1,i+1):
print(j,end=' ')
print()

1 1
1 2 1 2
1 2 3 1 2 3
1 2 3 4 1 2 3 4
1 2 3 4 5 1 2 3 4 5
1 2 3 4 1 2 3 4
1 2 3 1 2 3
1 2 1 2
1 1

In [93]: n=5
for i in range(1,n+1):
for j in range(1,i+1):

localhost:8888/doc/tree/Desktop/FDFS FOLDER/[Link]/[Link] 14/18


9/27/25, 5:46 PM task6

print(j,end=' ')
for j in range(2*(n-i)):
print(' ', end=' ')
for j in range(1,i+1):
print(j,end=' ')
print()

for i in range(n,0,-1):
for j in range(1,i+1):
print(j,end=' ')
for j in range(2*(n-i)):
print(' ', end=' ')
for j in range(1,i+1):
print(j,end=' ')
print()

1 1
1 2 1 2
1 2 3 1 2 3
1 2 3 4 1 2 3 4
1 2 3 4 5 1 2 3 4 5
1 2 3 4 5 1 2 3 4 5
1 2 3 4 1 2 3 4
1 2 3 1 2 3
1 2 1 2
1 1

In [98]: n=5
for i in range(1,n+1):
for j in range(1,i+1):
print('*',end=' ')
for j in range(2*(n-i)):
print(' ', end=' ')
for j in range(1,i+1):
print('*',end=' ')
print()

for i in range(n-1,0,-1):
for j in range(1,i+1):
print('*',end=' ')
for j in range(2*(n-i)):
print(' ', end=' ')
for j in range(1,i+1):
print('*',end=' ')
print()

* *
* * * *
* * * * * *
* * * * * * * *
* * * * * * * * * *
* * * * * * * *
* * * * * *
* * * *
* *

In [99]: n=5
for i in range(1,n+1):
for j in range(1,i+1):

localhost:8888/doc/tree/Desktop/FDFS FOLDER/[Link]/[Link] 15/18


9/27/25, 5:46 PM task6

print('*',end=' ')
for j in range(2*(n-i)):
print(' ', end=' ')
for j in range(1,i+1):
print('*',end=' ')
print()

for i in range(n,0,-1):
for j in range(1,i+1):
print('*',end=' ')
for j in range(2*(n-i)):
print(' ', end=' ')
for j in range(1,i+1):
print('*',end=' ')
print()

* *
* * * *
* * * * * *
* * * * * * * *
* * * * * * * * * *
* * * * * * * * * *
* * * * * * * *
* * * * * *
* * * *
* *

In [ ]: n=5
for i in range(1,n+1):

for j in range(n-i):
print(' ', end=' ')

for j in range(2*i-1):
print('*', end=' ')

print()

*
* * *
* * * * *
* * * * * * *
* * * * * * * * *

In [102… n=5
for i in range(n,0,-1):

for j in range(n-i):
print(' ', end=' ')

for j in range(2*i-1):
print('*', end=' ')

print()

* * * * * * * * *
* * * * * * *
* * * * *
* * *
*

localhost:8888/doc/tree/Desktop/FDFS FOLDER/[Link]/[Link] 16/18

You might also like