# Prompt user for a decimal number
decimal = int(input("Enter a decimal number: "))

# Convert decimal to binary
binary = bin(decimal)

# Convert decimal to hexadecimal
hexadecimal = hex(decimal)

# Display the results
print("Binary:", binary)
print("Hexadecimal:", hexadecimal)

def byte_size(s):
  return len(s.encode('utf-8'))
  
byte_size('😀') # 4
byte_size('Hello World') # 11

# Python program for implementation of Bubble Sort

def bubbleSort(arr):
	n = len(arr)

	# Traverse through all array elements
	for i in range(n-1):
	# range(n) also work but outer loop will repeat one time more than needed.

		# Last i elements are already in place
		for j in range(0, n-i-1):

			# traverse the array from 0 to n-i-1
			# Swap if the element found is greater
			# than the next element
			if arr[j] > arr[j+1] :
				arr[j], arr[j+1] = arr[j+1], arr[j]

# Driver code to test above
arr = [64, 34, 25, 12, 22, 11, 90]

bubbleSort(arr)

print ("Sorted array is:")
for i in range(len(arr)):
	print ("%d" %arr[i]),

import calendar
from datetime import datetime

# Get the UTC timestamp
a = calendar.timegm(datetime.utcnow().utctimetuple())

print(a)

# Given a number n, print all primes smaller than or equal to n. It is also given that n is a small number.
# For example, if n is 10, the output should be “2, 3, 5, 7”. If n is 20, the output should be “2, 3, 5, 7, 11, 13, 17, 19”.


# Python program to print all primes smaller than or equal to
# n using Sieve of Eratosthenes

def SieveOfEratosthenes(n):
	
	# Create a boolean array "prime[0..n]" and initialize
	# all entries it as true. A value in prime[i] will
	# finally be false if i is Not a prime, else true.
	prime = [True for i in range(n + 1)]
	p = 2
	while (p * p <= n):
		
		# If prime[p] is not changed, then it is a prime
		if (prime[p] == True):
			
			# Update all multiples of p
			for i in range(p * 2, n + 1, p):
				prime[i] = False
		p += 1
	prime[0]= False
	prime[1]= False
	# Print all prime numbers
	for p in range(n + 1):
		if prime[p]:
			print (p)

# driver program
if __name__=='__main__':
    n = 30
    print("Following are the prime numbers smaller")
    print("than or equal to ", n)
    print("than or equal to ", n)
    SieveOfEratosthenes(n)

def generate_floyds_triangle(num_rows):
    triangle = []
    number = 1
    for row in range(num_rows):
        current_row = []
        for _ in range(row + 1):
            current_row.append(number)
            number += 1
        triangle.append(current_row)
    return triangle


def display_floyds_triangle(triangle):
    for row in triangle:
        for number in row:
            print(number, end=" ")
        print()


# Prompt the user for the number of rows
num_rows = int(input("Enter the number of rows for Floyd's Triangle: "))

# Generate Floyd's Triangle
floyds_triangle = generate_floyds_triangle(num_rows)

# Display Floyd's Triangle
display_floyds_triangle(floyds_triangle)