




'''simple docstring'''


import requests
from bsa import BeautifulSoup
def 						snake_case_       (UpperCamelCase			:    str = "AAPL" ):





							'''simple docstring'''


							_a      	=							f'https://in.finance.yahoo.com/quote/{symbol}?s={symbol}'
							_a      	=							BeautifulSoup(requests.get(UpperCamelCase ).text					,		'''html.parser''' )
							_a      	=							'''My(6px) Pos(r) smartphone_Mt(6px)'''
							return soup.find('''div'''					,		class_=class_ ).find('''span''' ).text


if __name__ == "__main__":
				for symbol in "AAPL AMZN IBM GOOG MSFT ORCL".split():
								print(F'''Current {symbol:<4} stock price is {stock_price(symbol):>8}''')







from __future__ import annotations

import math
from collections import Counter
from string import ascii_lowercase







def      lowerCamelCase_						(			UpperCamelCase__							: str )	->			None:





				"""simple docstring"""


				__lowerCamelCase			,		__lowerCamelCase									=       analyze_text(UpperCamelCase__ )
				__lowerCamelCase									=       list(' ' + ascii_lowercase )
				# what is our total sum of probabilities.
				__lowerCamelCase									=       sum(single_char_strings.values() )

				# one length string
				__lowerCamelCase									=       0
				# for each alpha we go in our dict and if it is in it we calculate entropy
				for ch in my_alphas:
								if ch in single_char_strings:
												__lowerCamelCase									=       single_char_strings[ch]
												__lowerCamelCase									=       my_str / all_sum
												my_fir_sum += prob * math.loga(UpperCamelCase__ )  # entropy formula.

    # print entropy
				print(F"""{round(-1 * my_fir_sum ):.1f}""" )

				# two len string
				__lowerCamelCase									=       sum(two_char_strings.values() )
				__lowerCamelCase									=       0
				# for each alpha (two in size) calculate entropy.
				for cha in my_alphas:
								for cha in my_alphas:
												__lowerCamelCase									=       cha + cha
												if sequence in two_char_strings:
																__lowerCamelCase									=       two_char_strings[sequence]
																__lowerCamelCase									=       int(UpperCamelCase__ ) / all_sum
																my_sec_sum += prob * math.loga(UpperCamelCase__ )

    # print second entropy
				print(F"""{round(-1 * my_sec_sum ):.1f}""" )

				# print the difference between them
				print(F"""{round((-1 * my_sec_sum) - (-1 * my_fir_sum) ):.1f}""" )







def      lowerCamelCase_						(			UpperCamelCase__							: str )	->			tuple[dict, dict]:





				"""simple docstring"""


				__lowerCamelCase									=       Counter()  # type: ignore
				__lowerCamelCase									=       Counter()  # type: ignore
				single_char_strings[text[-1]] += 1

				# first case when we have space at start.
				two_char_strings[" " + text[0]] += 1
				for i in range(0					,	len(UpperCamelCase__ ) - 1 ):
								single_char_strings[text[i]] += 1
								two_char_strings[text[i : i + 2]] += 1
				return single_char_strings, two_char_strings







def      lowerCamelCase_						(			)	->			Dict:





				"""simple docstring"""


				import doctest

				doctest.testmod()
				# text = (
				#     "Had repulsive dashwoods suspicion sincerity but advantage now him. Remark "
				#     "easily garret nor nay. Civil those mrs enjoy shy fat merry. You greatest "
				#     "jointure saw horrible. He private he on be imagine suppose. Fertile "
				#     "beloved evident through no service elderly is. Blind there if every no so "
				#     "at. Own neglected you preferred way sincerity delivered his attempted. To "
				#     "of message cottage windows do besides against uncivil.  Delightful "
				#     "unreserved impossible few estimating men favourable see entreaties. She "
				#     "propriety immediate was improving. He or entrance humoured likewise "
				#     "moderate. Much nor game son say feel. Fat make met can must form into "
				#     "gate. Me we offending prevailed discovery. "
				# )

				# calculate_prob(text)


if __name__ == "__main__":
					main()


