Finding the greatest common denominator(GCD) of 2 integers.

Euclidean algorithm is use to find the greatest common denominator(GCD) of 2 integers. The larger integer is divided by the smaller integer and if the

Load, clean and explore data with Python Pandas

In machine learning, we need to be able to manipulate our data. And pandas is a good library for this task. To manipulate is to

Guess the number(integer) game

import random gameOver = Falsenum = random.randint(1,101) while gameOver== False: inputNum = input(‘Guess and enter the integer from 1 to 100…’) yourGuess= int(inputNum) if yourGuess

Get Premier League fixtures using Python

from urllib.request import urlopen from bs4 import BeautifulSoup from selenium import webdriver from selenium.webdriver.support.ui import Select from urllib.error import HTTPError import time address = ‘https://www.premierleague.com/fixtures&#8217; try:     url = urlopen(address) except HTTPError as ex:     print(‘Url address is not right.’)     print(ex) else:     print(‘ok’)     bs = BeautifulSoup(url, ‘html.parser’) driver = webdriver.Firefox() driver.get(address) time.sleep(3) cookies_btn = driver.find_elements_by_xpath(‘/html/body/section/div/div’)[0] cookies_btn.click() close_btn = driver.find_elements_by_xpath(‘//*[@id=”advertClose”]’)[0] close_btn.click() #select =  text1 = driver.find_elements_by_class_name(‘matchList’)