# Swap function
def swapList(newList):
size = len(newList)
# Swapping
temp = newList[0]
newList[0] = newList[size - 1]
newList[size - 1] = temp
return newList
# Driver code
newList = []
newList = [int(item) for item in input("Enter the list items : ").split()]
print(swapList(newList))
#clcoding.com
Enter the list items : 4 5 2 3 8 6 [6, 5, 2, 3, 8, 4]
# Function to find permutations of a given string
from itertools import permutations
def allPermutations(str):
permList = permutations(str)
# print all permutations
for perm in list(permList):
print (''.join(perm))
# Driver program
if __name__ == "__main__":
str = input("Enter your string : ")
allPermutations(str)
#clcoding.com
Enter your string : CAT CAT CTA ACT ATC TCA TAC
# Python program to find compound interest
def compound_interest(principle, rate, time):
# Calculates compound interest
Amount = principle * (pow((1 + rate / 100), time))
CI = Amount - principle
print("Compound interest is", CI)
P=float(input("Enter Principle Value : "))
R=float(input("Enter Rate Value : "))
T=float(input("Enter Time Value : "))
compound_interest(P,R,T)
#clcoding.com
Enter Principle Value : 1000 Enter Rate Value : 11 Enter Time Value : 3 Compound interest is 367.6310000000003
# Python program to add two numbers
number1 = input("First number: ")
number2 = input("Second number: ")
# Adding two numbers
# User might also enter float numbers
sum = float(number1) + float(number2)
# Display the sum
# will print value in float
print("The sum of {0} and {1} is {2}" .format(number1, number2, sum))
#clcoding.com
First number: 21
Second number: 31
The sum of 21 and 31 is 52.0
print("Enter the Number of Rows: ", end="")
row = int(input())
num = 1
for i in range(row):
for j in range(i+1):
print(num, end=" ")
num = num+1
print()
#clcoding.com
Enter the Number of Rows: 6 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
# To take input from the user
num = int(input("Enter a number : "))
factorial = 1
# check if the number is negative, positive or zero
if num < 0:
print("Sorry, factorial does not exist for negative numbers")
elif num == 0:
print("The factorial of 0 is 1")
else:
for i in range(1,num + 1):
factorial = factorial*i
print("The factorial of",num,"is",factorial)
#clcoding.com
Enter a number : 6 The factorial of 6 is 720
import time
def countdown(time_sec):
while time_sec:
mins, secs = divmod(time_sec, 60)
timeformat = '{:02d}:{:02d}'.format(mins, secs)
print(timeformat, end='\r')
time.sleep(1)
time_sec -= 1
print("stop")
num=int(input("Set Your Timer in Sec : "))
countdown(num)
#clcoding.com
Set Your Timer in Sec : 10 stop1
# define punctuation
punctuations = '''!()-[]{};:'"\,<>./?@#$%^&*_~'''
# To take input from the user
my_str = input("Enter Your String : ")
# remove punctuation from the string
no_punct = ""
for char in my_str:
if char not in punctuations:
no_punct = no_punct + char
#clcoding.com
# display the unpunctuated string
print(no_punct)
Enter Your String : " I love Python"! I love Python
# Python Program to find the factors of a number
# This function computes the factor of the argument passed
def print_factors(x):
print("The factors of",x,"are:")
for i in range(1, x + 1):
if x % i == 0:
print(i)
num=int(input("Enter a Number to find the Fators : "))
print_factors(num)
#clcoding.com
Enter a Number to find the Fators : 26 The factors of 26 are: 1 2 13 26
# Program to display the Fibonacci sequence up to n-th term
nterms = int(input("How many terms? "))
# first two terms
n1, n2 = 0, 1
count = 0
# check if the number of terms is valid
if nterms <= 0:
print("Please enter a positive integer")
# if there is only one term, return n1
elif nterms == 1:
print("Fibonacci sequence upto",nterms,":")
print(n1)
# generate fibonacci sequence
else:
print("Fibonacci sequence:")
while count < nterms:
print(n1)
nth = n1 + n2
# update values
n1 = n2
n2 = nth
count += 1 #clcoding.com
How many terms? 7 Fibonacci sequence: 0 1 1 2 3 5 8
# take input from the user
num = int(input("Enter a number: "))
# initialize sum
sum = 0
# find the sum of the cube of each digit
temp = num
while temp > 0:
digit = temp % 10
sum += digit ** 3
temp //= 10
# display the result
if num == sum:
print(num,"is an Armstrong number")
else:
print(num,"is not an Armstrong number")
#clcoding.com
Enter a number: 477 477 is not an Armstrong number
#pip install PyPDF2
from PyPDF2 import PdfFileWriter, PdfFileReader
import getpass
pdfwriter=PdfFileWriter()
pdf=PdfFileReader('E:\\clcoding.pdf')
for page_num in range(pdf.numPages):
pdfwriter.addPage(pdf.getPage(page_num))
password=getpass.getpass(prompt='Enter Password: ')
pdfwriter.encrypt(password)
with open('E:\\clcoding.pdf','wb') as f:
pdfwriter.write(f)
print("Now File is password protected")
#clcoding.com
Enter Password: ········ Now File is password protected
import matplotlib.pyplot as pyplot
# Create data
riding = ((17, 18, 21, 22, 19, 21, 25, 22, 25, 24),(3, 6, 3.5, 4, 5, 6.3, 4.5, 5, 4.5, 4))
swimming = ((17, 18, 20, 19, 22, 21, 23, 19, 21, 24),(8, 9, 7, 10, 7.5, 9, 8, 7, 8.5, 9))
sailing = ((31, 28, 29, 36, 27, 32, 34, 35, 33, 39),(4, 6.3, 6, 3, 5, 7.5, 2, 5, 7, 4))
# Plot the data
pyplot.scatter(x=riding[0], y=riding[1], c='red', marker='s',label='riding')
pyplot.scatter(x=swimming[0], y=swimming[1], c='green',marker='o', label='swimming')
pyplot.scatter(x=sailing[0], y=sailing[1], c='blue',marker='*', label='sailing')
# Configure graph
pyplot.xlabel('Age')
pyplot.ylabel('Hours')
pyplot.title('Activities Scatter Graph')
pyplot.legend()
pyplot.show()
#clcoding.com
import random
import math
lower = int(input("Enter Lower bound:- "))
upper = int(input("Enter Upper bound:- "))
# generating random number between the lower and upper
x = random.randint(lower, upper)
print("\n\tYou've only ",round(math.log(upper - lower + 1, 2)),
" chances to guess the integer!\n")
# Initializing the number of guesses.
count = 0 #clcoding.com
# for calculation of minimum number of guesses depends upon range
while count < math.log(upper - lower + 1, 2):
count += 1
# taking guessing number as input
guess = int(input("Guess a number:- "))
# Condition testing
if x == guess:
print("Congratulations you did it in ",count, " try")
break
elif x > guess:
print("You guessed too small!")
elif x < guess:
print("You Guessed too high!")
# shows this output.
if count >= math.log(upper - lower + 1, 2):
print("\nThe number is %d" % x)
print("\tBetter Luck Next time!")
Enter Lower bound:- 1 Enter Upper bound:- 10 You've only 3 chances to guess the integer! Guess a number:- 6 Congratulations you did it in 1 try
#pip install pyautogui
import pyautogui
myScreenshot=pyautogui.screenshot()
myScreenshot.save(r'E:\online.png')
#clcoding.com
d={'a':1,'b':2,'c':4}
# d is a dictionary
d['c']=3
#to modify the existing vlaue
d['d']=4
#to create a key value pair in the dictionary
print(d)
#clcoding.com
{'a': 1, 'b': 2, 'c': 3, 'd': 4}
import hashlib
BLOCKSIZE = 65536
# Block read size if file is big enough
fileToOpen = 'E:\\new_python\\new_doc2.txt'
hasher = hashlib.md5()
with open(fileToOpen, 'rb') as afile:
buf = afile.read(BLOCKSIZE)
while len(buf) > 0:
hasher.update(buf)
buf = afile.read(BLOCKSIZE)
print(hasher.hexdigest())
#clcoding.com
d41d8cd98f00b204e9800998ecf8427e
import os
# Path IN which we have to count files and directories
PATH = 'E:\elements' # Give your path here
fileCount = 0
dirCount = 0
for root, dirs, files in os.walk(PATH):
print('Looking in:',root)
for directories in dirs:
dirCount += 1
for Files in files:
fileCount += 1
#clcoding.com
print('Number of files',fileCount)
print('Number of Directories',dirCount)
print('Total:',(dirCount + fileCount))
Looking in: E:\elements Looking in: E:\elements\New folder Number of files 8 Number of Directories 1 Total: 9
def SieveOfEratosthenes(n):
primes = [True] * (n + 1)
p = 2 # because p is the smallest prime
while(p * p <= n):
# if p is not marked as False, this it is a prime
if(primes[p]) == True:
# mark all the multiples of number as False
for i in range(p * 2, n + 1, p):
primes[i] = False
p += 1
# printing all primes
for i in range(2, n):
if primes[i]:
print(i)
if __name__ == '__main__':
n=int(input("Enter a no to check all smaller prime numbers :"))
SieveOfEratosthenes(n)
#clcoding.com
Enter a no to check all smaller prime numbers :20 2 3 5 7 11 13 17 19
def perfectNumber(number):
sum = 0
for x in range(1, number):
if number % x == 0:
sum += x
return sum == number
if __name__ == '__main__':
n=int(input("Enter a number to check : "))
print(perfectNumber(n))
#clcoding.com
Enter a number to check : 6 True
.png)
s.PNG)
.png)
%20in%20Finance).jpg)
Posts
All Comments
