repo_name
stringclasses 1
value | pr_number
int64 4.12k
11.2k
| pr_title
stringlengths 9
107
| pr_description
stringlengths 107
5.48k
| author
stringlengths 4
18
| date_created
unknown | date_merged
unknown | previous_commit
stringlengths 40
40
| pr_commit
stringlengths 40
40
| query
stringlengths 118
5.52k
| before_content
stringlengths 0
7.93M
| after_content
stringlengths 0
7.93M
| label
int64 -1
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
This is pure Python implementation of counting sort algorithm
For doctests run following command:
python -m doctest -v counting_sort.py
or
python3 -m doctest -v counting_sort.py
For manual testing run:
python counting_sort.py
"""
def counting_sort(collection):
"""Pure implementation of counting sort algorithm in Python
:param collection: some mutable ordered collection with heterogeneous
comparable items inside
:return: the same collection ordered by ascending
Examples:
>>> counting_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> counting_sort([])
[]
>>> counting_sort([-2, -5, -45])
[-45, -5, -2]
"""
# if the collection is empty, returns empty
if collection == []:
return []
# get some information about the collection
coll_len = len(collection)
coll_max = max(collection)
coll_min = min(collection)
# create the counting array
counting_arr_length = coll_max + 1 - coll_min
counting_arr = [0] * counting_arr_length
# count how much a number appears in the collection
for number in collection:
counting_arr[number - coll_min] += 1
# sum each position with it's predecessors. now, counting_arr[i] tells
# us how many elements <= i has in the collection
for i in range(1, counting_arr_length):
counting_arr[i] = counting_arr[i] + counting_arr[i - 1]
# create the output collection
ordered = [0] * coll_len
# place the elements in the output, respecting the original order (stable
# sort) from end to begin, updating counting_arr
for i in reversed(range(0, coll_len)):
ordered[counting_arr[collection[i] - coll_min] - 1] = collection[i]
counting_arr[collection[i] - coll_min] -= 1
return ordered
def counting_sort_string(string):
"""
>>> counting_sort_string("thisisthestring")
'eghhiiinrsssttt'
"""
return "".join([chr(i) for i in counting_sort([ord(c) for c in string])])
if __name__ == "__main__":
# Test string sort
assert "eghhiiinrsssttt" == counting_sort_string("thisisthestring")
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(counting_sort(unsorted))
| """
This is pure Python implementation of counting sort algorithm
For doctests run following command:
python -m doctest -v counting_sort.py
or
python3 -m doctest -v counting_sort.py
For manual testing run:
python counting_sort.py
"""
def counting_sort(collection):
"""Pure implementation of counting sort algorithm in Python
:param collection: some mutable ordered collection with heterogeneous
comparable items inside
:return: the same collection ordered by ascending
Examples:
>>> counting_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> counting_sort([])
[]
>>> counting_sort([-2, -5, -45])
[-45, -5, -2]
"""
# if the collection is empty, returns empty
if collection == []:
return []
# get some information about the collection
coll_len = len(collection)
coll_max = max(collection)
coll_min = min(collection)
# create the counting array
counting_arr_length = coll_max + 1 - coll_min
counting_arr = [0] * counting_arr_length
# count how much a number appears in the collection
for number in collection:
counting_arr[number - coll_min] += 1
# sum each position with it's predecessors. now, counting_arr[i] tells
# us how many elements <= i has in the collection
for i in range(1, counting_arr_length):
counting_arr[i] = counting_arr[i] + counting_arr[i - 1]
# create the output collection
ordered = [0] * coll_len
# place the elements in the output, respecting the original order (stable
# sort) from end to begin, updating counting_arr
for i in reversed(range(0, coll_len)):
ordered[counting_arr[collection[i] - coll_min] - 1] = collection[i]
counting_arr[collection[i] - coll_min] -= 1
return ordered
def counting_sort_string(string):
"""
>>> counting_sort_string("thisisthestring")
'eghhiiinrsssttt'
"""
return "".join([chr(i) for i in counting_sort([ord(c) for c in string])])
if __name__ == "__main__":
# Test string sort
assert "eghhiiinrsssttt" == counting_sort_string("thisisthestring")
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(counting_sort(unsorted))
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Get CO2 emission data from the UK CarbonIntensity API
"""
from datetime import date
import requests
BASE_URL = "https://api.carbonintensity.org.uk/intensity"
# Emission in the last half hour
def fetch_last_half_hour() -> str:
last_half_hour = requests.get(BASE_URL).json()["data"][0]
return last_half_hour["intensity"]["actual"]
# Emissions in a specific date range
def fetch_from_to(start, end) -> list:
return requests.get(f"{BASE_URL}/{start}/{end}").json()["data"]
if __name__ == "__main__":
for entry in fetch_from_to(start=date(2020, 10, 1), end=date(2020, 10, 3)):
print("from {from} to {to}: {intensity[actual]}".format(**entry))
print(f"{fetch_last_half_hour() = }")
| """
Get CO2 emission data from the UK CarbonIntensity API
"""
from datetime import date
import requests
BASE_URL = "https://api.carbonintensity.org.uk/intensity"
# Emission in the last half hour
def fetch_last_half_hour() -> str:
last_half_hour = requests.get(BASE_URL).json()["data"][0]
return last_half_hour["intensity"]["actual"]
# Emissions in a specific date range
def fetch_from_to(start, end) -> list:
return requests.get(f"{BASE_URL}/{start}/{end}").json()["data"]
if __name__ == "__main__":
for entry in fetch_from_to(start=date(2020, 10, 1), end=date(2020, 10, 3)):
print("from {from} to {to}: {intensity[actual]}".format(**entry))
print(f"{fetch_last_half_hour() = }")
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Totient maximum
Problem 69: https://projecteuler.net/problem=69
Euler's Totient function, φ(n) [sometimes called the phi function],
is used to determine the number of numbers less than n which are relatively prime to n.
For example, as 1, 2, 4, 5, 7, and 8,
are all less than nine and relatively prime to nine, φ(9)=6.
n Relatively Prime φ(n) n/φ(n)
2 1 1 2
3 1,2 2 1.5
4 1,3 2 2
5 1,2,3,4 4 1.25
6 1,5 2 3
7 1,2,3,4,5,6 6 1.1666...
8 1,3,5,7 4 2
9 1,2,4,5,7,8 6 1.5
10 1,3,7,9 4 2.5
It can be seen that n=6 produces a maximum n/φ(n) for n ≤ 10.
Find the value of n ≤ 1,000,000 for which n/φ(n) is a maximum.
"""
def solution(n: int = 10 ** 6) -> int:
"""
Returns solution to problem.
Algorithm:
1. Precompute φ(k) for all natural k, k <= n using product formula (wikilink below)
https://en.wikipedia.org/wiki/Euler%27s_totient_function#Euler's_product_formula
2. Find k/φ(k) for all k ≤ n and return the k that attains maximum
>>> solution(10)
6
>>> solution(100)
30
>>> solution(9973)
2310
"""
if n <= 0:
raise ValueError("Please enter an integer greater than 0")
phi = list(range(n + 1))
for number in range(2, n + 1):
if phi[number] == number:
phi[number] -= 1
for multiple in range(number * 2, n + 1, number):
phi[multiple] = (phi[multiple] // number) * (number - 1)
answer = 1
for number in range(1, n + 1):
if (answer / phi[answer]) < (number / phi[number]):
answer = number
return answer
if __name__ == "__main__":
print(solution())
| """
Totient maximum
Problem 69: https://projecteuler.net/problem=69
Euler's Totient function, φ(n) [sometimes called the phi function],
is used to determine the number of numbers less than n which are relatively prime to n.
For example, as 1, 2, 4, 5, 7, and 8,
are all less than nine and relatively prime to nine, φ(9)=6.
n Relatively Prime φ(n) n/φ(n)
2 1 1 2
3 1,2 2 1.5
4 1,3 2 2
5 1,2,3,4 4 1.25
6 1,5 2 3
7 1,2,3,4,5,6 6 1.1666...
8 1,3,5,7 4 2
9 1,2,4,5,7,8 6 1.5
10 1,3,7,9 4 2.5
It can be seen that n=6 produces a maximum n/φ(n) for n ≤ 10.
Find the value of n ≤ 1,000,000 for which n/φ(n) is a maximum.
"""
def solution(n: int = 10 ** 6) -> int:
"""
Returns solution to problem.
Algorithm:
1. Precompute φ(k) for all natural k, k <= n using product formula (wikilink below)
https://en.wikipedia.org/wiki/Euler%27s_totient_function#Euler's_product_formula
2. Find k/φ(k) for all k ≤ n and return the k that attains maximum
>>> solution(10)
6
>>> solution(100)
30
>>> solution(9973)
2310
"""
if n <= 0:
raise ValueError("Please enter an integer greater than 0")
phi = list(range(n + 1))
for number in range(2, n + 1):
if phi[number] == number:
phi[number] -= 1
for multiple in range(number * 2, n + 1, number):
phi[multiple] = (phi[multiple] // number) * (number - 1)
answer = 1
for number in range(1, n + 1):
if (answer / phi[answer]) < (number / phi[number]):
answer = number
return answer
if __name__ == "__main__":
print(solution())
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
One of the several implementations of Lempel–Ziv–Welch decompression algorithm
https://en.wikipedia.org/wiki/Lempel%E2%80%93Ziv%E2%80%93Welch
"""
import math
import sys
def read_file_binary(file_path: str) -> str:
"""
Reads given file as bytes and returns them as a long string
"""
result = ""
try:
with open(file_path, "rb") as binary_file:
data = binary_file.read()
for dat in data:
curr_byte = f"{dat:08b}"
result += curr_byte
return result
except OSError:
print("File not accessible")
sys.exit()
def decompress_data(data_bits: str) -> str:
"""
Decompresses given data_bits using Lempel–Ziv–Welch compression algorithm
and returns the result as a string
"""
lexicon = {"0": "0", "1": "1"}
result, curr_string = "", ""
index = len(lexicon)
for i in range(len(data_bits)):
curr_string += data_bits[i]
if curr_string not in lexicon:
continue
last_match_id = lexicon[curr_string]
result += last_match_id
lexicon[curr_string] = last_match_id + "0"
if math.log2(index).is_integer():
newLex = {}
for curr_key in list(lexicon):
newLex["0" + curr_key] = lexicon.pop(curr_key)
lexicon = newLex
lexicon[bin(index)[2:]] = last_match_id + "1"
index += 1
curr_string = ""
return result
def write_file_binary(file_path: str, to_write: str) -> None:
"""
Writes given to_write string (should only consist of 0's and 1's) as bytes in the
file
"""
byte_length = 8
try:
with open(file_path, "wb") as opened_file:
result_byte_array = [
to_write[i : i + byte_length]
for i in range(0, len(to_write), byte_length)
]
if len(result_byte_array[-1]) % byte_length == 0:
result_byte_array.append("10000000")
else:
result_byte_array[-1] += "1" + "0" * (
byte_length - len(result_byte_array[-1]) - 1
)
for elem in result_byte_array[:-1]:
opened_file.write(int(elem, 2).to_bytes(1, byteorder="big"))
except OSError:
print("File not accessible")
sys.exit()
def remove_prefix(data_bits: str) -> str:
"""
Removes size prefix, that compressed file should have
Returns the result
"""
counter = 0
for letter in data_bits:
if letter == "1":
break
counter += 1
data_bits = data_bits[counter:]
data_bits = data_bits[counter + 1 :]
return data_bits
def compress(source_path: str, destination_path: str) -> None:
"""
Reads source file, decompresses it and writes the result in destination file
"""
data_bits = read_file_binary(source_path)
data_bits = remove_prefix(data_bits)
decompressed = decompress_data(data_bits)
write_file_binary(destination_path, decompressed)
if __name__ == "__main__":
compress(sys.argv[1], sys.argv[2])
| """
One of the several implementations of Lempel–Ziv–Welch decompression algorithm
https://en.wikipedia.org/wiki/Lempel%E2%80%93Ziv%E2%80%93Welch
"""
import math
import sys
def read_file_binary(file_path: str) -> str:
"""
Reads given file as bytes and returns them as a long string
"""
result = ""
try:
with open(file_path, "rb") as binary_file:
data = binary_file.read()
for dat in data:
curr_byte = f"{dat:08b}"
result += curr_byte
return result
except OSError:
print("File not accessible")
sys.exit()
def decompress_data(data_bits: str) -> str:
"""
Decompresses given data_bits using Lempel–Ziv–Welch compression algorithm
and returns the result as a string
"""
lexicon = {"0": "0", "1": "1"}
result, curr_string = "", ""
index = len(lexicon)
for i in range(len(data_bits)):
curr_string += data_bits[i]
if curr_string not in lexicon:
continue
last_match_id = lexicon[curr_string]
result += last_match_id
lexicon[curr_string] = last_match_id + "0"
if math.log2(index).is_integer():
newLex = {}
for curr_key in list(lexicon):
newLex["0" + curr_key] = lexicon.pop(curr_key)
lexicon = newLex
lexicon[bin(index)[2:]] = last_match_id + "1"
index += 1
curr_string = ""
return result
def write_file_binary(file_path: str, to_write: str) -> None:
"""
Writes given to_write string (should only consist of 0's and 1's) as bytes in the
file
"""
byte_length = 8
try:
with open(file_path, "wb") as opened_file:
result_byte_array = [
to_write[i : i + byte_length]
for i in range(0, len(to_write), byte_length)
]
if len(result_byte_array[-1]) % byte_length == 0:
result_byte_array.append("10000000")
else:
result_byte_array[-1] += "1" + "0" * (
byte_length - len(result_byte_array[-1]) - 1
)
for elem in result_byte_array[:-1]:
opened_file.write(int(elem, 2).to_bytes(1, byteorder="big"))
except OSError:
print("File not accessible")
sys.exit()
def remove_prefix(data_bits: str) -> str:
"""
Removes size prefix, that compressed file should have
Returns the result
"""
counter = 0
for letter in data_bits:
if letter == "1":
break
counter += 1
data_bits = data_bits[counter:]
data_bits = data_bits[counter + 1 :]
return data_bits
def compress(source_path: str, destination_path: str) -> None:
"""
Reads source file, decompresses it and writes the result in destination file
"""
data_bits = read_file_binary(source_path)
data_bits = remove_prefix(data_bits)
decompressed = decompress_data(data_bits)
write_file_binary(destination_path, decompressed)
if __name__ == "__main__":
compress(sys.argv[1], sys.argv[2])
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Calculates the nth number in Sylvester's sequence
Source:
https://en.wikipedia.org/wiki/Sylvester%27s_sequence
"""
def sylvester(number: int) -> int:
"""
:param number: nth number to calculate in the sequence
:return: the nth number in Sylvester's sequence
>>> sylvester(8)
113423713055421844361000443
>>> sylvester(-1)
Traceback (most recent call last):
...
ValueError: The input value of [n=-1] has to be > 0
>>> sylvester(8.0)
Traceback (most recent call last):
...
AssertionError: The input value of [n=8.0] is not an integer
"""
assert isinstance(number, int), f"The input value of [n={number}] is not an integer"
if number == 1:
return 2
elif number < 1:
raise ValueError(f"The input value of [n={number}] has to be > 0")
else:
num = sylvester(number - 1)
lower = num - 1
upper = num
return lower * upper + 1
if __name__ == "__main__":
print(f"The 8th number in Sylvester's sequence: {sylvester(8)}")
| """
Calculates the nth number in Sylvester's sequence
Source:
https://en.wikipedia.org/wiki/Sylvester%27s_sequence
"""
def sylvester(number: int) -> int:
"""
:param number: nth number to calculate in the sequence
:return: the nth number in Sylvester's sequence
>>> sylvester(8)
113423713055421844361000443
>>> sylvester(-1)
Traceback (most recent call last):
...
ValueError: The input value of [n=-1] has to be > 0
>>> sylvester(8.0)
Traceback (most recent call last):
...
AssertionError: The input value of [n=8.0] is not an integer
"""
assert isinstance(number, int), f"The input value of [n={number}] is not an integer"
if number == 1:
return 2
elif number < 1:
raise ValueError(f"The input value of [n={number}] has to be > 0")
else:
num = sylvester(number - 1)
lower = num - 1
upper = num
return lower * upper + 1
if __name__ == "__main__":
print(f"The 8th number in Sylvester's sequence: {sylvester(8)}")
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| # https://en.wikipedia.org/wiki/Hill_climbing
import math
class SearchProblem:
"""
An interface to define search problems.
The interface will be illustrated using the example of mathematical function.
"""
def __init__(self, x: int, y: int, step_size: int, function_to_optimize):
"""
The constructor of the search problem.
x: the x coordinate of the current search state.
y: the y coordinate of the current search state.
step_size: size of the step to take when looking for neighbors.
function_to_optimize: a function to optimize having the signature f(x, y).
"""
self.x = x
self.y = y
self.step_size = step_size
self.function = function_to_optimize
def score(self) -> int:
"""
Returns the output of the function called with current x and y coordinates.
>>> def test_function(x, y):
... return x + y
>>> SearchProblem(0, 0, 1, test_function).score() # 0 + 0 = 0
0
>>> SearchProblem(5, 7, 1, test_function).score() # 5 + 7 = 12
12
"""
return self.function(self.x, self.y)
def get_neighbors(self):
"""
Returns a list of coordinates of neighbors adjacent to the current coordinates.
Neighbors:
| 0 | 1 | 2 |
| 3 | _ | 4 |
| 5 | 6 | 7 |
"""
step_size = self.step_size
return [
SearchProblem(x, y, step_size, self.function)
for x, y in (
(self.x - step_size, self.y - step_size),
(self.x - step_size, self.y),
(self.x - step_size, self.y + step_size),
(self.x, self.y - step_size),
(self.x, self.y + step_size),
(self.x + step_size, self.y - step_size),
(self.x + step_size, self.y),
(self.x + step_size, self.y + step_size),
)
]
def __hash__(self):
"""
hash the string representation of the current search state.
"""
return hash(str(self))
def __eq__(self, obj):
"""
Check if the 2 objects are equal.
"""
if isinstance(obj, SearchProblem):
return hash(str(self)) == hash(str(obj))
return False
def __str__(self):
"""
string representation of the current search state.
>>> str(SearchProblem(0, 0, 1, None))
'x: 0 y: 0'
>>> str(SearchProblem(2, 5, 1, None))
'x: 2 y: 5'
"""
return f"x: {self.x} y: {self.y}"
def hill_climbing(
search_prob,
find_max: bool = True,
max_x: float = math.inf,
min_x: float = -math.inf,
max_y: float = math.inf,
min_y: float = -math.inf,
visualization: bool = False,
max_iter: int = 10000,
) -> SearchProblem:
"""
Implementation of the hill climbling algorithm.
We start with a given state, find all its neighbors,
move towards the neighbor which provides the maximum (or minimum) change.
We keep doing this until we are at a state where we do not have any
neighbors which can improve the solution.
Args:
search_prob: The search state at the start.
find_max: If True, the algorithm should find the maximum else the minimum.
max_x, min_x, max_y, min_y: the maximum and minimum bounds of x and y.
visualization: If True, a matplotlib graph is displayed.
max_iter: number of times to run the iteration.
Returns a search state having the maximum (or minimum) score.
"""
current_state = search_prob
scores = [] # list to store the current score at each iteration
iterations = 0
solution_found = False
visited = set()
while not solution_found and iterations < max_iter:
visited.add(current_state)
iterations += 1
current_score = current_state.score()
scores.append(current_score)
neighbors = current_state.get_neighbors()
max_change = -math.inf
min_change = math.inf
next_state = None # to hold the next best neighbor
for neighbor in neighbors:
if neighbor in visited:
continue # do not want to visit the same state again
if (
neighbor.x > max_x
or neighbor.x < min_x
or neighbor.y > max_y
or neighbor.y < min_y
):
continue # neighbor outside our bounds
change = neighbor.score() - current_score
if find_max: # finding max
# going to direction with greatest ascent
if change > max_change and change > 0:
max_change = change
next_state = neighbor
else: # finding min
# to direction with greatest descent
if change < min_change and change < 0:
min_change = change
next_state = neighbor
if next_state is not None:
# we found at least one neighbor which improved the current state
current_state = next_state
else:
# since we have no neighbor that improves the solution we stop the search
solution_found = True
if visualization:
from matplotlib import pyplot as plt
plt.plot(range(iterations), scores)
plt.xlabel("Iterations")
plt.ylabel("Function values")
plt.show()
return current_state
if __name__ == "__main__":
import doctest
doctest.testmod()
def test_f1(x, y):
return (x ** 2) + (y ** 2)
# starting the problem with initial coordinates (3, 4)
prob = SearchProblem(x=3, y=4, step_size=1, function_to_optimize=test_f1)
local_min = hill_climbing(prob, find_max=False)
print(
"The minimum score for f(x, y) = x^2 + y^2 found via hill climbing: "
f"{local_min.score()}"
)
# starting the problem with initial coordinates (12, 47)
prob = SearchProblem(x=12, y=47, step_size=1, function_to_optimize=test_f1)
local_min = hill_climbing(
prob, find_max=False, max_x=100, min_x=5, max_y=50, min_y=-5, visualization=True
)
print(
"The minimum score for f(x, y) = x^2 + y^2 with the domain 100 > x > 5 "
f"and 50 > y > - 5 found via hill climbing: {local_min.score()}"
)
def test_f2(x, y):
return (3 * x ** 2) - (6 * y)
prob = SearchProblem(x=3, y=4, step_size=1, function_to_optimize=test_f1)
local_min = hill_climbing(prob, find_max=True)
print(
"The maximum score for f(x, y) = x^2 + y^2 found via hill climbing: "
f"{local_min.score()}"
)
| # https://en.wikipedia.org/wiki/Hill_climbing
import math
class SearchProblem:
"""
An interface to define search problems.
The interface will be illustrated using the example of mathematical function.
"""
def __init__(self, x: int, y: int, step_size: int, function_to_optimize):
"""
The constructor of the search problem.
x: the x coordinate of the current search state.
y: the y coordinate of the current search state.
step_size: size of the step to take when looking for neighbors.
function_to_optimize: a function to optimize having the signature f(x, y).
"""
self.x = x
self.y = y
self.step_size = step_size
self.function = function_to_optimize
def score(self) -> int:
"""
Returns the output of the function called with current x and y coordinates.
>>> def test_function(x, y):
... return x + y
>>> SearchProblem(0, 0, 1, test_function).score() # 0 + 0 = 0
0
>>> SearchProblem(5, 7, 1, test_function).score() # 5 + 7 = 12
12
"""
return self.function(self.x, self.y)
def get_neighbors(self):
"""
Returns a list of coordinates of neighbors adjacent to the current coordinates.
Neighbors:
| 0 | 1 | 2 |
| 3 | _ | 4 |
| 5 | 6 | 7 |
"""
step_size = self.step_size
return [
SearchProblem(x, y, step_size, self.function)
for x, y in (
(self.x - step_size, self.y - step_size),
(self.x - step_size, self.y),
(self.x - step_size, self.y + step_size),
(self.x, self.y - step_size),
(self.x, self.y + step_size),
(self.x + step_size, self.y - step_size),
(self.x + step_size, self.y),
(self.x + step_size, self.y + step_size),
)
]
def __hash__(self):
"""
hash the string representation of the current search state.
"""
return hash(str(self))
def __eq__(self, obj):
"""
Check if the 2 objects are equal.
"""
if isinstance(obj, SearchProblem):
return hash(str(self)) == hash(str(obj))
return False
def __str__(self):
"""
string representation of the current search state.
>>> str(SearchProblem(0, 0, 1, None))
'x: 0 y: 0'
>>> str(SearchProblem(2, 5, 1, None))
'x: 2 y: 5'
"""
return f"x: {self.x} y: {self.y}"
def hill_climbing(
search_prob,
find_max: bool = True,
max_x: float = math.inf,
min_x: float = -math.inf,
max_y: float = math.inf,
min_y: float = -math.inf,
visualization: bool = False,
max_iter: int = 10000,
) -> SearchProblem:
"""
Implementation of the hill climbling algorithm.
We start with a given state, find all its neighbors,
move towards the neighbor which provides the maximum (or minimum) change.
We keep doing this until we are at a state where we do not have any
neighbors which can improve the solution.
Args:
search_prob: The search state at the start.
find_max: If True, the algorithm should find the maximum else the minimum.
max_x, min_x, max_y, min_y: the maximum and minimum bounds of x and y.
visualization: If True, a matplotlib graph is displayed.
max_iter: number of times to run the iteration.
Returns a search state having the maximum (or minimum) score.
"""
current_state = search_prob
scores = [] # list to store the current score at each iteration
iterations = 0
solution_found = False
visited = set()
while not solution_found and iterations < max_iter:
visited.add(current_state)
iterations += 1
current_score = current_state.score()
scores.append(current_score)
neighbors = current_state.get_neighbors()
max_change = -math.inf
min_change = math.inf
next_state = None # to hold the next best neighbor
for neighbor in neighbors:
if neighbor in visited:
continue # do not want to visit the same state again
if (
neighbor.x > max_x
or neighbor.x < min_x
or neighbor.y > max_y
or neighbor.y < min_y
):
continue # neighbor outside our bounds
change = neighbor.score() - current_score
if find_max: # finding max
# going to direction with greatest ascent
if change > max_change and change > 0:
max_change = change
next_state = neighbor
else: # finding min
# to direction with greatest descent
if change < min_change and change < 0:
min_change = change
next_state = neighbor
if next_state is not None:
# we found at least one neighbor which improved the current state
current_state = next_state
else:
# since we have no neighbor that improves the solution we stop the search
solution_found = True
if visualization:
from matplotlib import pyplot as plt
plt.plot(range(iterations), scores)
plt.xlabel("Iterations")
plt.ylabel("Function values")
plt.show()
return current_state
if __name__ == "__main__":
import doctest
doctest.testmod()
def test_f1(x, y):
return (x ** 2) + (y ** 2)
# starting the problem with initial coordinates (3, 4)
prob = SearchProblem(x=3, y=4, step_size=1, function_to_optimize=test_f1)
local_min = hill_climbing(prob, find_max=False)
print(
"The minimum score for f(x, y) = x^2 + y^2 found via hill climbing: "
f"{local_min.score()}"
)
# starting the problem with initial coordinates (12, 47)
prob = SearchProblem(x=12, y=47, step_size=1, function_to_optimize=test_f1)
local_min = hill_climbing(
prob, find_max=False, max_x=100, min_x=5, max_y=50, min_y=-5, visualization=True
)
print(
"The minimum score for f(x, y) = x^2 + y^2 with the domain 100 > x > 5 "
f"and 50 > y > - 5 found via hill climbing: {local_min.score()}"
)
def test_f2(x, y):
return (3 * x ** 2) - (6 * y)
prob = SearchProblem(x=3, y=4, step_size=1, function_to_optimize=test_f1)
local_min = hill_climbing(prob, find_max=True)
print(
"The maximum score for f(x, y) = x^2 + y^2 found via hill climbing: "
f"{local_min.score()}"
)
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
python/black : true
flake8 : passed
"""
from __future__ import annotations
from typing import Iterator
class RedBlackTree:
"""
A Red-Black tree, which is a self-balancing BST (binary search
tree).
This tree has similar performance to AVL trees, but the balancing is
less strict, so it will perform faster for writing/deleting nodes
and slower for reading in the average case, though, because they're
both balanced binary search trees, both will get the same asymptotic
performance.
To read more about them, https://en.wikipedia.org/wiki/Red–black_tree
Unless otherwise specified, all asymptotic runtimes are specified in
terms of the size of the tree.
"""
def __init__(
self,
label: int | None = None,
color: int = 0,
parent: RedBlackTree | None = None,
left: RedBlackTree | None = None,
right: RedBlackTree | None = None,
) -> None:
"""Initialize a new Red-Black Tree node with the given values:
label: The value associated with this node
color: 0 if black, 1 if red
parent: The parent to this node
left: This node's left child
right: This node's right child
"""
self.label = label
self.parent = parent
self.left = left
self.right = right
self.color = color
# Here are functions which are specific to red-black trees
def rotate_left(self) -> RedBlackTree:
"""Rotate the subtree rooted at this node to the left and
returns the new root to this subtree.
Performing one rotation can be done in O(1).
"""
parent = self.parent
right = self.right
self.right = right.left
if self.right:
self.right.parent = self
self.parent = right
right.left = self
if parent is not None:
if parent.left == self:
parent.left = right
else:
parent.right = right
right.parent = parent
return right
def rotate_right(self) -> RedBlackTree:
"""Rotate the subtree rooted at this node to the right and
returns the new root to this subtree.
Performing one rotation can be done in O(1).
"""
parent = self.parent
left = self.left
self.left = left.right
if self.left:
self.left.parent = self
self.parent = left
left.right = self
if parent is not None:
if parent.right is self:
parent.right = left
else:
parent.left = left
left.parent = parent
return left
def insert(self, label: int) -> RedBlackTree:
"""Inserts label into the subtree rooted at self, performs any
rotations necessary to maintain balance, and then returns the
new root to this subtree (likely self).
This is guaranteed to run in O(log(n)) time.
"""
if self.label is None:
# Only possible with an empty tree
self.label = label
return self
if self.label == label:
return self
elif self.label > label:
if self.left:
self.left.insert(label)
else:
self.left = RedBlackTree(label, 1, self)
self.left._insert_repair()
else:
if self.right:
self.right.insert(label)
else:
self.right = RedBlackTree(label, 1, self)
self.right._insert_repair()
return self.parent or self
def _insert_repair(self) -> None:
"""Repair the coloring from inserting into a tree."""
if self.parent is None:
# This node is the root, so it just needs to be black
self.color = 0
elif color(self.parent) == 0:
# If the parent is black, then it just needs to be red
self.color = 1
else:
uncle = self.parent.sibling
if color(uncle) == 0:
if self.is_left() and self.parent.is_right():
self.parent.rotate_right()
self.right._insert_repair()
elif self.is_right() and self.parent.is_left():
self.parent.rotate_left()
self.left._insert_repair()
elif self.is_left():
self.grandparent.rotate_right()
self.parent.color = 0
self.parent.right.color = 1
else:
self.grandparent.rotate_left()
self.parent.color = 0
self.parent.left.color = 1
else:
self.parent.color = 0
uncle.color = 0
self.grandparent.color = 1
self.grandparent._insert_repair()
def remove(self, label: int) -> RedBlackTree:
"""Remove label from this tree."""
if self.label == label:
if self.left and self.right:
# It's easier to balance a node with at most one child,
# so we replace this node with the greatest one less than
# it and remove that.
value = self.left.get_max()
self.label = value
self.left.remove(value)
else:
# This node has at most one non-None child, so we don't
# need to replace
child = self.left or self.right
if self.color == 1:
# This node is red, and its child is black
# The only way this happens to a node with one child
# is if both children are None leaves.
# We can just remove this node and call it a day.
if self.is_left():
self.parent.left = None
else:
self.parent.right = None
else:
# The node is black
if child is None:
# This node and its child are black
if self.parent is None:
# The tree is now empty
return RedBlackTree(None)
else:
self._remove_repair()
if self.is_left():
self.parent.left = None
else:
self.parent.right = None
self.parent = None
else:
# This node is black and its child is red
# Move the child node here and make it black
self.label = child.label
self.left = child.left
self.right = child.right
if self.left:
self.left.parent = self
if self.right:
self.right.parent = self
elif self.label > label:
if self.left:
self.left.remove(label)
else:
if self.right:
self.right.remove(label)
return self.parent or self
def _remove_repair(self) -> None:
"""Repair the coloring of the tree that may have been messed up."""
if color(self.sibling) == 1:
self.sibling.color = 0
self.parent.color = 1
if self.is_left():
self.parent.rotate_left()
else:
self.parent.rotate_right()
if (
color(self.parent) == 0
and color(self.sibling) == 0
and color(self.sibling.left) == 0
and color(self.sibling.right) == 0
):
self.sibling.color = 1
self.parent._remove_repair()
return
if (
color(self.parent) == 1
and color(self.sibling) == 0
and color(self.sibling.left) == 0
and color(self.sibling.right) == 0
):
self.sibling.color = 1
self.parent.color = 0
return
if (
self.is_left()
and color(self.sibling) == 0
and color(self.sibling.right) == 0
and color(self.sibling.left) == 1
):
self.sibling.rotate_right()
self.sibling.color = 0
self.sibling.right.color = 1
if (
self.is_right()
and color(self.sibling) == 0
and color(self.sibling.right) == 1
and color(self.sibling.left) == 0
):
self.sibling.rotate_left()
self.sibling.color = 0
self.sibling.left.color = 1
if (
self.is_left()
and color(self.sibling) == 0
and color(self.sibling.right) == 1
):
self.parent.rotate_left()
self.grandparent.color = self.parent.color
self.parent.color = 0
self.parent.sibling.color = 0
if (
self.is_right()
and color(self.sibling) == 0
and color(self.sibling.left) == 1
):
self.parent.rotate_right()
self.grandparent.color = self.parent.color
self.parent.color = 0
self.parent.sibling.color = 0
def check_color_properties(self) -> bool:
"""Check the coloring of the tree, and return True iff the tree
is colored in a way which matches these five properties:
(wording stolen from wikipedia article)
1. Each node is either red or black.
2. The root node is black.
3. All leaves are black.
4. If a node is red, then both its children are black.
5. Every path from any node to all of its descendent NIL nodes
has the same number of black nodes.
This function runs in O(n) time, because properties 4 and 5 take
that long to check.
"""
# I assume property 1 to hold because there is nothing that can
# make the color be anything other than 0 or 1.
# Property 2
if self.color:
# The root was red
print("Property 2")
return False
# Property 3 does not need to be checked, because None is assumed
# to be black and is all the leaves.
# Property 4
if not self.check_coloring():
print("Property 4")
return False
# Property 5
if self.black_height() is None:
print("Property 5")
return False
# All properties were met
return True
def check_coloring(self) -> None:
"""A helper function to recursively check Property 4 of a
Red-Black Tree. See check_color_properties for more info.
"""
if self.color == 1:
if color(self.left) == 1 or color(self.right) == 1:
return False
if self.left and not self.left.check_coloring():
return False
if self.right and not self.right.check_coloring():
return False
return True
def black_height(self) -> int:
"""Returns the number of black nodes from this node to the
leaves of the tree, or None if there isn't one such value (the
tree is color incorrectly).
"""
if self is None:
# If we're already at a leaf, there is no path
return 1
left = RedBlackTree.black_height(self.left)
right = RedBlackTree.black_height(self.right)
if left is None or right is None:
# There are issues with coloring below children nodes
return None
if left != right:
# The two children have unequal depths
return None
# Return the black depth of children, plus one if this node is
# black
return left + (1 - self.color)
# Here are functions which are general to all binary search trees
def __contains__(self, label) -> bool:
"""Search through the tree for label, returning True iff it is
found somewhere in the tree.
Guaranteed to run in O(log(n)) time.
"""
return self.search(label) is not None
def search(self, label: int) -> RedBlackTree:
"""Search through the tree for label, returning its node if
it's found, and None otherwise.
This method is guaranteed to run in O(log(n)) time.
"""
if self.label == label:
return self
elif label > self.label:
if self.right is None:
return None
else:
return self.right.search(label)
else:
if self.left is None:
return None
else:
return self.left.search(label)
def floor(self, label: int) -> int:
"""Returns the largest element in this tree which is at most label.
This method is guaranteed to run in O(log(n)) time."""
if self.label == label:
return self.label
elif self.label > label:
if self.left:
return self.left.floor(label)
else:
return None
else:
if self.right:
attempt = self.right.floor(label)
if attempt is not None:
return attempt
return self.label
def ceil(self, label: int) -> int:
"""Returns the smallest element in this tree which is at least label.
This method is guaranteed to run in O(log(n)) time.
"""
if self.label == label:
return self.label
elif self.label < label:
if self.right:
return self.right.ceil(label)
else:
return None
else:
if self.left:
attempt = self.left.ceil(label)
if attempt is not None:
return attempt
return self.label
def get_max(self) -> int:
"""Returns the largest element in this tree.
This method is guaranteed to run in O(log(n)) time.
"""
if self.right:
# Go as far right as possible
return self.right.get_max()
else:
return self.label
def get_min(self) -> int:
"""Returns the smallest element in this tree.
This method is guaranteed to run in O(log(n)) time.
"""
if self.left:
# Go as far left as possible
return self.left.get_min()
else:
return self.label
@property
def grandparent(self) -> RedBlackTree:
"""Get the current node's grandparent, or None if it doesn't exist."""
if self.parent is None:
return None
else:
return self.parent.parent
@property
def sibling(self) -> RedBlackTree:
"""Get the current node's sibling, or None if it doesn't exist."""
if self.parent is None:
return None
elif self.parent.left is self:
return self.parent.right
else:
return self.parent.left
def is_left(self) -> bool:
"""Returns true iff this node is the left child of its parent."""
return self.parent and self.parent.left is self
def is_right(self) -> bool:
"""Returns true iff this node is the right child of its parent."""
return self.parent and self.parent.right is self
def __bool__(self) -> bool:
return True
def __len__(self) -> int:
"""
Return the number of nodes in this tree.
"""
ln = 1
if self.left:
ln += len(self.left)
if self.right:
ln += len(self.right)
return ln
def preorder_traverse(self) -> Iterator[int]:
yield self.label
if self.left:
yield from self.left.preorder_traverse()
if self.right:
yield from self.right.preorder_traverse()
def inorder_traverse(self) -> Iterator[int]:
if self.left:
yield from self.left.inorder_traverse()
yield self.label
if self.right:
yield from self.right.inorder_traverse()
def postorder_traverse(self) -> Iterator[int]:
if self.left:
yield from self.left.postorder_traverse()
if self.right:
yield from self.right.postorder_traverse()
yield self.label
def __repr__(self) -> str:
from pprint import pformat
if self.left is None and self.right is None:
return f"'{self.label} {(self.color and 'red') or 'blk'}'"
return pformat(
{
f"{self.label} {(self.color and 'red') or 'blk'}": (
self.left,
self.right,
)
},
indent=1,
)
def __eq__(self, other) -> bool:
"""Test if two trees are equal."""
if self.label == other.label:
return self.left == other.left and self.right == other.right
else:
return False
def color(node) -> int:
"""Returns the color of a node, allowing for None leaves."""
if node is None:
return 0
else:
return node.color
"""
Code for testing the various
functions of the red-black tree.
"""
def test_rotations() -> bool:
"""Test that the rotate_left and rotate_right functions work."""
# Make a tree to test on
tree = RedBlackTree(0)
tree.left = RedBlackTree(-10, parent=tree)
tree.right = RedBlackTree(10, parent=tree)
tree.left.left = RedBlackTree(-20, parent=tree.left)
tree.left.right = RedBlackTree(-5, parent=tree.left)
tree.right.left = RedBlackTree(5, parent=tree.right)
tree.right.right = RedBlackTree(20, parent=tree.right)
# Make the right rotation
left_rot = RedBlackTree(10)
left_rot.left = RedBlackTree(0, parent=left_rot)
left_rot.left.left = RedBlackTree(-10, parent=left_rot.left)
left_rot.left.right = RedBlackTree(5, parent=left_rot.left)
left_rot.left.left.left = RedBlackTree(-20, parent=left_rot.left.left)
left_rot.left.left.right = RedBlackTree(-5, parent=left_rot.left.left)
left_rot.right = RedBlackTree(20, parent=left_rot)
tree = tree.rotate_left()
if tree != left_rot:
return False
tree = tree.rotate_right()
tree = tree.rotate_right()
# Make the left rotation
right_rot = RedBlackTree(-10)
right_rot.left = RedBlackTree(-20, parent=right_rot)
right_rot.right = RedBlackTree(0, parent=right_rot)
right_rot.right.left = RedBlackTree(-5, parent=right_rot.right)
right_rot.right.right = RedBlackTree(10, parent=right_rot.right)
right_rot.right.right.left = RedBlackTree(5, parent=right_rot.right.right)
right_rot.right.right.right = RedBlackTree(20, parent=right_rot.right.right)
if tree != right_rot:
return False
return True
def test_insertion_speed() -> bool:
"""Test that the tree balances inserts to O(log(n)) by doing a lot
of them.
"""
tree = RedBlackTree(-1)
for i in range(300000):
tree = tree.insert(i)
return True
def test_insert() -> bool:
"""Test the insert() method of the tree correctly balances, colors,
and inserts.
"""
tree = RedBlackTree(0)
tree.insert(8)
tree.insert(-8)
tree.insert(4)
tree.insert(12)
tree.insert(10)
tree.insert(11)
ans = RedBlackTree(0, 0)
ans.left = RedBlackTree(-8, 0, ans)
ans.right = RedBlackTree(8, 1, ans)
ans.right.left = RedBlackTree(4, 0, ans.right)
ans.right.right = RedBlackTree(11, 0, ans.right)
ans.right.right.left = RedBlackTree(10, 1, ans.right.right)
ans.right.right.right = RedBlackTree(12, 1, ans.right.right)
return tree == ans
def test_insert_and_search() -> bool:
"""Tests searching through the tree for values."""
tree = RedBlackTree(0)
tree.insert(8)
tree.insert(-8)
tree.insert(4)
tree.insert(12)
tree.insert(10)
tree.insert(11)
if 5 in tree or -6 in tree or -10 in tree or 13 in tree:
# Found something not in there
return False
if not (11 in tree and 12 in tree and -8 in tree and 0 in tree):
# Didn't find something in there
return False
return True
def test_insert_delete() -> bool:
"""Test the insert() and delete() method of the tree, verifying the
insertion and removal of elements, and the balancing of the tree.
"""
tree = RedBlackTree(0)
tree = tree.insert(-12)
tree = tree.insert(8)
tree = tree.insert(-8)
tree = tree.insert(15)
tree = tree.insert(4)
tree = tree.insert(12)
tree = tree.insert(10)
tree = tree.insert(9)
tree = tree.insert(11)
tree = tree.remove(15)
tree = tree.remove(-12)
tree = tree.remove(9)
if not tree.check_color_properties():
return False
if list(tree.inorder_traverse()) != [-8, 0, 4, 8, 10, 11, 12]:
return False
return True
def test_floor_ceil() -> bool:
"""Tests the floor and ceiling functions in the tree."""
tree = RedBlackTree(0)
tree.insert(-16)
tree.insert(16)
tree.insert(8)
tree.insert(24)
tree.insert(20)
tree.insert(22)
tuples = [(-20, None, -16), (-10, -16, 0), (8, 8, 8), (50, 24, None)]
for val, floor, ceil in tuples:
if tree.floor(val) != floor or tree.ceil(val) != ceil:
return False
return True
def test_min_max() -> bool:
"""Tests the min and max functions in the tree."""
tree = RedBlackTree(0)
tree.insert(-16)
tree.insert(16)
tree.insert(8)
tree.insert(24)
tree.insert(20)
tree.insert(22)
if tree.get_max() != 22 or tree.get_min() != -16:
return False
return True
def test_tree_traversal() -> bool:
"""Tests the three different tree traversal functions."""
tree = RedBlackTree(0)
tree = tree.insert(-16)
tree.insert(16)
tree.insert(8)
tree.insert(24)
tree.insert(20)
tree.insert(22)
if list(tree.inorder_traverse()) != [-16, 0, 8, 16, 20, 22, 24]:
return False
if list(tree.preorder_traverse()) != [0, -16, 16, 8, 22, 20, 24]:
return False
if list(tree.postorder_traverse()) != [-16, 8, 20, 24, 22, 16, 0]:
return False
return True
def test_tree_chaining() -> bool:
"""Tests the three different tree chaining functions."""
tree = RedBlackTree(0)
tree = tree.insert(-16).insert(16).insert(8).insert(24).insert(20).insert(22)
if list(tree.inorder_traverse()) != [-16, 0, 8, 16, 20, 22, 24]:
return False
if list(tree.preorder_traverse()) != [0, -16, 16, 8, 22, 20, 24]:
return False
if list(tree.postorder_traverse()) != [-16, 8, 20, 24, 22, 16, 0]:
return False
return True
def print_results(msg: str, passes: bool) -> None:
print(str(msg), "works!" if passes else "doesn't work :(")
def pytests() -> None:
assert test_rotations()
assert test_insert()
assert test_insert_and_search()
assert test_insert_delete()
assert test_floor_ceil()
assert test_tree_traversal()
assert test_tree_chaining()
def main() -> None:
"""
>>> pytests()
"""
print_results("Rotating right and left", test_rotations())
print_results("Inserting", test_insert())
print_results("Searching", test_insert_and_search())
print_results("Deleting", test_insert_delete())
print_results("Floor and ceil", test_floor_ceil())
print_results("Tree traversal", test_tree_traversal())
print_results("Tree traversal", test_tree_chaining())
print("Testing tree balancing...")
print("This should only be a few seconds.")
test_insertion_speed()
print("Done!")
if __name__ == "__main__":
main()
| """
python/black : true
flake8 : passed
"""
from __future__ import annotations
from typing import Iterator
class RedBlackTree:
"""
A Red-Black tree, which is a self-balancing BST (binary search
tree).
This tree has similar performance to AVL trees, but the balancing is
less strict, so it will perform faster for writing/deleting nodes
and slower for reading in the average case, though, because they're
both balanced binary search trees, both will get the same asymptotic
performance.
To read more about them, https://en.wikipedia.org/wiki/Red–black_tree
Unless otherwise specified, all asymptotic runtimes are specified in
terms of the size of the tree.
"""
def __init__(
self,
label: int | None = None,
color: int = 0,
parent: RedBlackTree | None = None,
left: RedBlackTree | None = None,
right: RedBlackTree | None = None,
) -> None:
"""Initialize a new Red-Black Tree node with the given values:
label: The value associated with this node
color: 0 if black, 1 if red
parent: The parent to this node
left: This node's left child
right: This node's right child
"""
self.label = label
self.parent = parent
self.left = left
self.right = right
self.color = color
# Here are functions which are specific to red-black trees
def rotate_left(self) -> RedBlackTree:
"""Rotate the subtree rooted at this node to the left and
returns the new root to this subtree.
Performing one rotation can be done in O(1).
"""
parent = self.parent
right = self.right
self.right = right.left
if self.right:
self.right.parent = self
self.parent = right
right.left = self
if parent is not None:
if parent.left == self:
parent.left = right
else:
parent.right = right
right.parent = parent
return right
def rotate_right(self) -> RedBlackTree:
"""Rotate the subtree rooted at this node to the right and
returns the new root to this subtree.
Performing one rotation can be done in O(1).
"""
parent = self.parent
left = self.left
self.left = left.right
if self.left:
self.left.parent = self
self.parent = left
left.right = self
if parent is not None:
if parent.right is self:
parent.right = left
else:
parent.left = left
left.parent = parent
return left
def insert(self, label: int) -> RedBlackTree:
"""Inserts label into the subtree rooted at self, performs any
rotations necessary to maintain balance, and then returns the
new root to this subtree (likely self).
This is guaranteed to run in O(log(n)) time.
"""
if self.label is None:
# Only possible with an empty tree
self.label = label
return self
if self.label == label:
return self
elif self.label > label:
if self.left:
self.left.insert(label)
else:
self.left = RedBlackTree(label, 1, self)
self.left._insert_repair()
else:
if self.right:
self.right.insert(label)
else:
self.right = RedBlackTree(label, 1, self)
self.right._insert_repair()
return self.parent or self
def _insert_repair(self) -> None:
"""Repair the coloring from inserting into a tree."""
if self.parent is None:
# This node is the root, so it just needs to be black
self.color = 0
elif color(self.parent) == 0:
# If the parent is black, then it just needs to be red
self.color = 1
else:
uncle = self.parent.sibling
if color(uncle) == 0:
if self.is_left() and self.parent.is_right():
self.parent.rotate_right()
self.right._insert_repair()
elif self.is_right() and self.parent.is_left():
self.parent.rotate_left()
self.left._insert_repair()
elif self.is_left():
self.grandparent.rotate_right()
self.parent.color = 0
self.parent.right.color = 1
else:
self.grandparent.rotate_left()
self.parent.color = 0
self.parent.left.color = 1
else:
self.parent.color = 0
uncle.color = 0
self.grandparent.color = 1
self.grandparent._insert_repair()
def remove(self, label: int) -> RedBlackTree:
"""Remove label from this tree."""
if self.label == label:
if self.left and self.right:
# It's easier to balance a node with at most one child,
# so we replace this node with the greatest one less than
# it and remove that.
value = self.left.get_max()
self.label = value
self.left.remove(value)
else:
# This node has at most one non-None child, so we don't
# need to replace
child = self.left or self.right
if self.color == 1:
# This node is red, and its child is black
# The only way this happens to a node with one child
# is if both children are None leaves.
# We can just remove this node and call it a day.
if self.is_left():
self.parent.left = None
else:
self.parent.right = None
else:
# The node is black
if child is None:
# This node and its child are black
if self.parent is None:
# The tree is now empty
return RedBlackTree(None)
else:
self._remove_repair()
if self.is_left():
self.parent.left = None
else:
self.parent.right = None
self.parent = None
else:
# This node is black and its child is red
# Move the child node here and make it black
self.label = child.label
self.left = child.left
self.right = child.right
if self.left:
self.left.parent = self
if self.right:
self.right.parent = self
elif self.label > label:
if self.left:
self.left.remove(label)
else:
if self.right:
self.right.remove(label)
return self.parent or self
def _remove_repair(self) -> None:
"""Repair the coloring of the tree that may have been messed up."""
if color(self.sibling) == 1:
self.sibling.color = 0
self.parent.color = 1
if self.is_left():
self.parent.rotate_left()
else:
self.parent.rotate_right()
if (
color(self.parent) == 0
and color(self.sibling) == 0
and color(self.sibling.left) == 0
and color(self.sibling.right) == 0
):
self.sibling.color = 1
self.parent._remove_repair()
return
if (
color(self.parent) == 1
and color(self.sibling) == 0
and color(self.sibling.left) == 0
and color(self.sibling.right) == 0
):
self.sibling.color = 1
self.parent.color = 0
return
if (
self.is_left()
and color(self.sibling) == 0
and color(self.sibling.right) == 0
and color(self.sibling.left) == 1
):
self.sibling.rotate_right()
self.sibling.color = 0
self.sibling.right.color = 1
if (
self.is_right()
and color(self.sibling) == 0
and color(self.sibling.right) == 1
and color(self.sibling.left) == 0
):
self.sibling.rotate_left()
self.sibling.color = 0
self.sibling.left.color = 1
if (
self.is_left()
and color(self.sibling) == 0
and color(self.sibling.right) == 1
):
self.parent.rotate_left()
self.grandparent.color = self.parent.color
self.parent.color = 0
self.parent.sibling.color = 0
if (
self.is_right()
and color(self.sibling) == 0
and color(self.sibling.left) == 1
):
self.parent.rotate_right()
self.grandparent.color = self.parent.color
self.parent.color = 0
self.parent.sibling.color = 0
def check_color_properties(self) -> bool:
"""Check the coloring of the tree, and return True iff the tree
is colored in a way which matches these five properties:
(wording stolen from wikipedia article)
1. Each node is either red or black.
2. The root node is black.
3. All leaves are black.
4. If a node is red, then both its children are black.
5. Every path from any node to all of its descendent NIL nodes
has the same number of black nodes.
This function runs in O(n) time, because properties 4 and 5 take
that long to check.
"""
# I assume property 1 to hold because there is nothing that can
# make the color be anything other than 0 or 1.
# Property 2
if self.color:
# The root was red
print("Property 2")
return False
# Property 3 does not need to be checked, because None is assumed
# to be black and is all the leaves.
# Property 4
if not self.check_coloring():
print("Property 4")
return False
# Property 5
if self.black_height() is None:
print("Property 5")
return False
# All properties were met
return True
def check_coloring(self) -> None:
"""A helper function to recursively check Property 4 of a
Red-Black Tree. See check_color_properties for more info.
"""
if self.color == 1:
if color(self.left) == 1 or color(self.right) == 1:
return False
if self.left and not self.left.check_coloring():
return False
if self.right and not self.right.check_coloring():
return False
return True
def black_height(self) -> int:
"""Returns the number of black nodes from this node to the
leaves of the tree, or None if there isn't one such value (the
tree is color incorrectly).
"""
if self is None:
# If we're already at a leaf, there is no path
return 1
left = RedBlackTree.black_height(self.left)
right = RedBlackTree.black_height(self.right)
if left is None or right is None:
# There are issues with coloring below children nodes
return None
if left != right:
# The two children have unequal depths
return None
# Return the black depth of children, plus one if this node is
# black
return left + (1 - self.color)
# Here are functions which are general to all binary search trees
def __contains__(self, label) -> bool:
"""Search through the tree for label, returning True iff it is
found somewhere in the tree.
Guaranteed to run in O(log(n)) time.
"""
return self.search(label) is not None
def search(self, label: int) -> RedBlackTree:
"""Search through the tree for label, returning its node if
it's found, and None otherwise.
This method is guaranteed to run in O(log(n)) time.
"""
if self.label == label:
return self
elif label > self.label:
if self.right is None:
return None
else:
return self.right.search(label)
else:
if self.left is None:
return None
else:
return self.left.search(label)
def floor(self, label: int) -> int:
"""Returns the largest element in this tree which is at most label.
This method is guaranteed to run in O(log(n)) time."""
if self.label == label:
return self.label
elif self.label > label:
if self.left:
return self.left.floor(label)
else:
return None
else:
if self.right:
attempt = self.right.floor(label)
if attempt is not None:
return attempt
return self.label
def ceil(self, label: int) -> int:
"""Returns the smallest element in this tree which is at least label.
This method is guaranteed to run in O(log(n)) time.
"""
if self.label == label:
return self.label
elif self.label < label:
if self.right:
return self.right.ceil(label)
else:
return None
else:
if self.left:
attempt = self.left.ceil(label)
if attempt is not None:
return attempt
return self.label
def get_max(self) -> int:
"""Returns the largest element in this tree.
This method is guaranteed to run in O(log(n)) time.
"""
if self.right:
# Go as far right as possible
return self.right.get_max()
else:
return self.label
def get_min(self) -> int:
"""Returns the smallest element in this tree.
This method is guaranteed to run in O(log(n)) time.
"""
if self.left:
# Go as far left as possible
return self.left.get_min()
else:
return self.label
@property
def grandparent(self) -> RedBlackTree:
"""Get the current node's grandparent, or None if it doesn't exist."""
if self.parent is None:
return None
else:
return self.parent.parent
@property
def sibling(self) -> RedBlackTree:
"""Get the current node's sibling, or None if it doesn't exist."""
if self.parent is None:
return None
elif self.parent.left is self:
return self.parent.right
else:
return self.parent.left
def is_left(self) -> bool:
"""Returns true iff this node is the left child of its parent."""
return self.parent and self.parent.left is self
def is_right(self) -> bool:
"""Returns true iff this node is the right child of its parent."""
return self.parent and self.parent.right is self
def __bool__(self) -> bool:
return True
def __len__(self) -> int:
"""
Return the number of nodes in this tree.
"""
ln = 1
if self.left:
ln += len(self.left)
if self.right:
ln += len(self.right)
return ln
def preorder_traverse(self) -> Iterator[int]:
yield self.label
if self.left:
yield from self.left.preorder_traverse()
if self.right:
yield from self.right.preorder_traverse()
def inorder_traverse(self) -> Iterator[int]:
if self.left:
yield from self.left.inorder_traverse()
yield self.label
if self.right:
yield from self.right.inorder_traverse()
def postorder_traverse(self) -> Iterator[int]:
if self.left:
yield from self.left.postorder_traverse()
if self.right:
yield from self.right.postorder_traverse()
yield self.label
def __repr__(self) -> str:
from pprint import pformat
if self.left is None and self.right is None:
return f"'{self.label} {(self.color and 'red') or 'blk'}'"
return pformat(
{
f"{self.label} {(self.color and 'red') or 'blk'}": (
self.left,
self.right,
)
},
indent=1,
)
def __eq__(self, other) -> bool:
"""Test if two trees are equal."""
if self.label == other.label:
return self.left == other.left and self.right == other.right
else:
return False
def color(node) -> int:
"""Returns the color of a node, allowing for None leaves."""
if node is None:
return 0
else:
return node.color
"""
Code for testing the various
functions of the red-black tree.
"""
def test_rotations() -> bool:
"""Test that the rotate_left and rotate_right functions work."""
# Make a tree to test on
tree = RedBlackTree(0)
tree.left = RedBlackTree(-10, parent=tree)
tree.right = RedBlackTree(10, parent=tree)
tree.left.left = RedBlackTree(-20, parent=tree.left)
tree.left.right = RedBlackTree(-5, parent=tree.left)
tree.right.left = RedBlackTree(5, parent=tree.right)
tree.right.right = RedBlackTree(20, parent=tree.right)
# Make the right rotation
left_rot = RedBlackTree(10)
left_rot.left = RedBlackTree(0, parent=left_rot)
left_rot.left.left = RedBlackTree(-10, parent=left_rot.left)
left_rot.left.right = RedBlackTree(5, parent=left_rot.left)
left_rot.left.left.left = RedBlackTree(-20, parent=left_rot.left.left)
left_rot.left.left.right = RedBlackTree(-5, parent=left_rot.left.left)
left_rot.right = RedBlackTree(20, parent=left_rot)
tree = tree.rotate_left()
if tree != left_rot:
return False
tree = tree.rotate_right()
tree = tree.rotate_right()
# Make the left rotation
right_rot = RedBlackTree(-10)
right_rot.left = RedBlackTree(-20, parent=right_rot)
right_rot.right = RedBlackTree(0, parent=right_rot)
right_rot.right.left = RedBlackTree(-5, parent=right_rot.right)
right_rot.right.right = RedBlackTree(10, parent=right_rot.right)
right_rot.right.right.left = RedBlackTree(5, parent=right_rot.right.right)
right_rot.right.right.right = RedBlackTree(20, parent=right_rot.right.right)
if tree != right_rot:
return False
return True
def test_insertion_speed() -> bool:
"""Test that the tree balances inserts to O(log(n)) by doing a lot
of them.
"""
tree = RedBlackTree(-1)
for i in range(300000):
tree = tree.insert(i)
return True
def test_insert() -> bool:
"""Test the insert() method of the tree correctly balances, colors,
and inserts.
"""
tree = RedBlackTree(0)
tree.insert(8)
tree.insert(-8)
tree.insert(4)
tree.insert(12)
tree.insert(10)
tree.insert(11)
ans = RedBlackTree(0, 0)
ans.left = RedBlackTree(-8, 0, ans)
ans.right = RedBlackTree(8, 1, ans)
ans.right.left = RedBlackTree(4, 0, ans.right)
ans.right.right = RedBlackTree(11, 0, ans.right)
ans.right.right.left = RedBlackTree(10, 1, ans.right.right)
ans.right.right.right = RedBlackTree(12, 1, ans.right.right)
return tree == ans
def test_insert_and_search() -> bool:
"""Tests searching through the tree for values."""
tree = RedBlackTree(0)
tree.insert(8)
tree.insert(-8)
tree.insert(4)
tree.insert(12)
tree.insert(10)
tree.insert(11)
if 5 in tree or -6 in tree or -10 in tree or 13 in tree:
# Found something not in there
return False
if not (11 in tree and 12 in tree and -8 in tree and 0 in tree):
# Didn't find something in there
return False
return True
def test_insert_delete() -> bool:
"""Test the insert() and delete() method of the tree, verifying the
insertion and removal of elements, and the balancing of the tree.
"""
tree = RedBlackTree(0)
tree = tree.insert(-12)
tree = tree.insert(8)
tree = tree.insert(-8)
tree = tree.insert(15)
tree = tree.insert(4)
tree = tree.insert(12)
tree = tree.insert(10)
tree = tree.insert(9)
tree = tree.insert(11)
tree = tree.remove(15)
tree = tree.remove(-12)
tree = tree.remove(9)
if not tree.check_color_properties():
return False
if list(tree.inorder_traverse()) != [-8, 0, 4, 8, 10, 11, 12]:
return False
return True
def test_floor_ceil() -> bool:
"""Tests the floor and ceiling functions in the tree."""
tree = RedBlackTree(0)
tree.insert(-16)
tree.insert(16)
tree.insert(8)
tree.insert(24)
tree.insert(20)
tree.insert(22)
tuples = [(-20, None, -16), (-10, -16, 0), (8, 8, 8), (50, 24, None)]
for val, floor, ceil in tuples:
if tree.floor(val) != floor or tree.ceil(val) != ceil:
return False
return True
def test_min_max() -> bool:
"""Tests the min and max functions in the tree."""
tree = RedBlackTree(0)
tree.insert(-16)
tree.insert(16)
tree.insert(8)
tree.insert(24)
tree.insert(20)
tree.insert(22)
if tree.get_max() != 22 or tree.get_min() != -16:
return False
return True
def test_tree_traversal() -> bool:
"""Tests the three different tree traversal functions."""
tree = RedBlackTree(0)
tree = tree.insert(-16)
tree.insert(16)
tree.insert(8)
tree.insert(24)
tree.insert(20)
tree.insert(22)
if list(tree.inorder_traverse()) != [-16, 0, 8, 16, 20, 22, 24]:
return False
if list(tree.preorder_traverse()) != [0, -16, 16, 8, 22, 20, 24]:
return False
if list(tree.postorder_traverse()) != [-16, 8, 20, 24, 22, 16, 0]:
return False
return True
def test_tree_chaining() -> bool:
"""Tests the three different tree chaining functions."""
tree = RedBlackTree(0)
tree = tree.insert(-16).insert(16).insert(8).insert(24).insert(20).insert(22)
if list(tree.inorder_traverse()) != [-16, 0, 8, 16, 20, 22, 24]:
return False
if list(tree.preorder_traverse()) != [0, -16, 16, 8, 22, 20, 24]:
return False
if list(tree.postorder_traverse()) != [-16, 8, 20, 24, 22, 16, 0]:
return False
return True
def print_results(msg: str, passes: bool) -> None:
print(str(msg), "works!" if passes else "doesn't work :(")
def pytests() -> None:
assert test_rotations()
assert test_insert()
assert test_insert_and_search()
assert test_insert_delete()
assert test_floor_ceil()
assert test_tree_traversal()
assert test_tree_chaining()
def main() -> None:
"""
>>> pytests()
"""
print_results("Rotating right and left", test_rotations())
print_results("Inserting", test_insert())
print_results("Searching", test_insert_and_search())
print_results("Deleting", test_insert_delete())
print_results("Floor and ceil", test_floor_ceil())
print_results("Tree traversal", test_tree_traversal())
print_results("Tree traversal", test_tree_chaining())
print("Testing tree balancing...")
print("This should only be a few seconds.")
test_insertion_speed()
print("Done!")
if __name__ == "__main__":
main()
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| def lower(word: str) -> str:
"""
Will convert the entire string to lowercase letters
>>> lower("wow")
'wow'
>>> lower("HellZo")
'hellzo'
>>> lower("WHAT")
'what'
>>> lower("wh[]32")
'wh[]32'
>>> lower("whAT")
'what'
"""
# converting to ascii value int value and checking to see if char is a capital
# letter if it is a capital letter it is getting shift by 32 which makes it a lower
# case letter
return "".join(chr(ord(char) + 32) if "A" <= char <= "Z" else char for char in word)
if __name__ == "__main__":
from doctest import testmod
testmod()
| def lower(word: str) -> str:
"""
Will convert the entire string to lowercase letters
>>> lower("wow")
'wow'
>>> lower("HellZo")
'hellzo'
>>> lower("WHAT")
'what'
>>> lower("wh[]32")
'wh[]32'
>>> lower("whAT")
'what'
"""
# converting to ascii value int value and checking to see if char is a capital
# letter if it is a capital letter it is getting shift by 32 which makes it a lower
# case letter
return "".join(chr(ord(char) + 32) if "A" <= char <= "Z" else char for char in word)
if __name__ == "__main__":
from doctest import testmod
testmod()
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| from decimal import Decimal, getcontext
from math import ceil, factorial
def pi(precision: int) -> str:
"""
The Chudnovsky algorithm is a fast method for calculating the digits of PI,
based on Ramanujan’s PI formulae.
https://en.wikipedia.org/wiki/Chudnovsky_algorithm
PI = constant_term / ((multinomial_term * linear_term) / exponential_term)
where constant_term = 426880 * sqrt(10005)
The linear_term and the exponential_term can be defined iteratively as follows:
L_k+1 = L_k + 545140134 where L_0 = 13591409
X_k+1 = X_k * -262537412640768000 where X_0 = 1
The multinomial_term is defined as follows:
6k! / ((3k)! * (k!) ^ 3)
where k is the k_th iteration.
This algorithm correctly calculates around 14 digits of PI per iteration
>>> pi(10)
'3.14159265'
>>> pi(100)
'3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534211706'
>>> pi('hello')
Traceback (most recent call last):
...
TypeError: Undefined for non-integers
>>> pi(-1)
Traceback (most recent call last):
...
ValueError: Undefined for non-natural numbers
"""
if not isinstance(precision, int):
raise TypeError("Undefined for non-integers")
elif precision < 1:
raise ValueError("Undefined for non-natural numbers")
getcontext().prec = precision
num_iterations = ceil(precision / 14)
constant_term = 426880 * Decimal(10005).sqrt()
exponential_term = 1
linear_term = 13591409
partial_sum = Decimal(linear_term)
for k in range(1, num_iterations):
multinomial_term = factorial(6 * k) // (factorial(3 * k) * factorial(k) ** 3)
linear_term += 545140134
exponential_term *= -262537412640768000
partial_sum += Decimal(multinomial_term * linear_term) / exponential_term
return str(constant_term / partial_sum)[:-1]
if __name__ == "__main__":
n = 50
print(f"The first {n} digits of pi is: {pi(n)}")
| from decimal import Decimal, getcontext
from math import ceil, factorial
def pi(precision: int) -> str:
"""
The Chudnovsky algorithm is a fast method for calculating the digits of PI,
based on Ramanujan’s PI formulae.
https://en.wikipedia.org/wiki/Chudnovsky_algorithm
PI = constant_term / ((multinomial_term * linear_term) / exponential_term)
where constant_term = 426880 * sqrt(10005)
The linear_term and the exponential_term can be defined iteratively as follows:
L_k+1 = L_k + 545140134 where L_0 = 13591409
X_k+1 = X_k * -262537412640768000 where X_0 = 1
The multinomial_term is defined as follows:
6k! / ((3k)! * (k!) ^ 3)
where k is the k_th iteration.
This algorithm correctly calculates around 14 digits of PI per iteration
>>> pi(10)
'3.14159265'
>>> pi(100)
'3.14159265358979323846264338327950288419716939937510582097494459230781640628620899862803482534211706'
>>> pi('hello')
Traceback (most recent call last):
...
TypeError: Undefined for non-integers
>>> pi(-1)
Traceback (most recent call last):
...
ValueError: Undefined for non-natural numbers
"""
if not isinstance(precision, int):
raise TypeError("Undefined for non-integers")
elif precision < 1:
raise ValueError("Undefined for non-natural numbers")
getcontext().prec = precision
num_iterations = ceil(precision / 14)
constant_term = 426880 * Decimal(10005).sqrt()
exponential_term = 1
linear_term = 13591409
partial_sum = Decimal(linear_term)
for k in range(1, num_iterations):
multinomial_term = factorial(6 * k) // (factorial(3 * k) * factorial(k) ** 3)
linear_term += 545140134
exponential_term *= -262537412640768000
partial_sum += Decimal(multinomial_term * linear_term) / exponential_term
return str(constant_term / partial_sum)[:-1]
if __name__ == "__main__":
n = 50
print(f"The first {n} digits of pi is: {pi(n)}")
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Project Euler Problem 75: https://projecteuler.net/problem=75
It turns out that 12 cm is the smallest length of wire that can be bent to form an
integer sided right angle triangle in exactly one way, but there are many more examples.
12 cm: (3,4,5)
24 cm: (6,8,10)
30 cm: (5,12,13)
36 cm: (9,12,15)
40 cm: (8,15,17)
48 cm: (12,16,20)
In contrast, some lengths of wire, like 20 cm, cannot be bent to form an integer sided
right angle triangle, and other lengths allow more than one solution to be found; for
example, using 120 cm it is possible to form exactly three different integer sided
right angle triangles.
120 cm: (30,40,50), (20,48,52), (24,45,51)
Given that L is the length of the wire, for how many values of L ≤ 1,500,000 can
exactly one integer sided right angle triangle be formed?
Solution: we generate all pythagorean triples using Euclid's formula and
keep track of the frequencies of the perimeters.
Reference: https://en.wikipedia.org/wiki/Pythagorean_triple#Generating_a_triple
"""
from collections import defaultdict
from math import gcd
from typing import DefaultDict
def solution(limit: int = 1500000) -> int:
"""
Return the number of values of L <= limit such that a wire of length L can be
formmed into an integer sided right angle triangle in exactly one way.
>>> solution(50)
6
>>> solution(1000)
112
>>> solution(50000)
5502
"""
frequencies: DefaultDict = defaultdict(int)
euclid_m = 2
while 2 * euclid_m * (euclid_m + 1) <= limit:
for euclid_n in range((euclid_m % 2) + 1, euclid_m, 2):
if gcd(euclid_m, euclid_n) > 1:
continue
primitive_perimeter = 2 * euclid_m * (euclid_m + euclid_n)
for perimeter in range(primitive_perimeter, limit + 1, primitive_perimeter):
frequencies[perimeter] += 1
euclid_m += 1
return sum(1 for frequency in frequencies.values() if frequency == 1)
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler Problem 75: https://projecteuler.net/problem=75
It turns out that 12 cm is the smallest length of wire that can be bent to form an
integer sided right angle triangle in exactly one way, but there are many more examples.
12 cm: (3,4,5)
24 cm: (6,8,10)
30 cm: (5,12,13)
36 cm: (9,12,15)
40 cm: (8,15,17)
48 cm: (12,16,20)
In contrast, some lengths of wire, like 20 cm, cannot be bent to form an integer sided
right angle triangle, and other lengths allow more than one solution to be found; for
example, using 120 cm it is possible to form exactly three different integer sided
right angle triangles.
120 cm: (30,40,50), (20,48,52), (24,45,51)
Given that L is the length of the wire, for how many values of L ≤ 1,500,000 can
exactly one integer sided right angle triangle be formed?
Solution: we generate all pythagorean triples using Euclid's formula and
keep track of the frequencies of the perimeters.
Reference: https://en.wikipedia.org/wiki/Pythagorean_triple#Generating_a_triple
"""
from collections import defaultdict
from math import gcd
from typing import DefaultDict
def solution(limit: int = 1500000) -> int:
"""
Return the number of values of L <= limit such that a wire of length L can be
formmed into an integer sided right angle triangle in exactly one way.
>>> solution(50)
6
>>> solution(1000)
112
>>> solution(50000)
5502
"""
frequencies: DefaultDict = defaultdict(int)
euclid_m = 2
while 2 * euclid_m * (euclid_m + 1) <= limit:
for euclid_n in range((euclid_m % 2) + 1, euclid_m, 2):
if gcd(euclid_m, euclid_n) > 1:
continue
primitive_perimeter = 2 * euclid_m * (euclid_m + euclid_n)
for perimeter in range(primitive_perimeter, limit + 1, primitive_perimeter):
frequencies[perimeter] += 1
euclid_m += 1
return sum(1 for frequency in frequencies.values() if frequency == 1)
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| import base64
def encode_to_b16(inp: str) -> bytes:
"""
Encodes a given utf-8 string into base-16.
>>> encode_to_b16('Hello World!')
b'48656C6C6F20576F726C6421'
>>> encode_to_b16('HELLO WORLD!')
b'48454C4C4F20574F524C4421'
>>> encode_to_b16('')
b''
"""
# encode the input into a bytes-like object and then encode b16encode that
return base64.b16encode(inp.encode("utf-8"))
def decode_from_b16(b16encoded: bytes) -> str:
"""
Decodes from base-16 to a utf-8 string.
>>> decode_from_b16(b'48656C6C6F20576F726C6421')
'Hello World!'
>>> decode_from_b16(b'48454C4C4F20574F524C4421')
'HELLO WORLD!'
>>> decode_from_b16(b'')
''
"""
# b16decode the input into bytes and decode that into a human readable string
return base64.b16decode(b16encoded).decode("utf-8")
if __name__ == "__main__":
import doctest
doctest.testmod()
| import base64
def encode_to_b16(inp: str) -> bytes:
"""
Encodes a given utf-8 string into base-16.
>>> encode_to_b16('Hello World!')
b'48656C6C6F20576F726C6421'
>>> encode_to_b16('HELLO WORLD!')
b'48454C4C4F20574F524C4421'
>>> encode_to_b16('')
b''
"""
# encode the input into a bytes-like object and then encode b16encode that
return base64.b16encode(inp.encode("utf-8"))
def decode_from_b16(b16encoded: bytes) -> str:
"""
Decodes from base-16 to a utf-8 string.
>>> decode_from_b16(b'48656C6C6F20576F726C6421')
'Hello World!'
>>> decode_from_b16(b'48454C4C4F20574F524C4421')
'HELLO WORLD!'
>>> decode_from_b16(b'')
''
"""
# b16decode the input into bytes and decode that into a human readable string
return base64.b16decode(b16encoded).decode("utf-8")
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| def printDist(dist, V):
print("\nVertex Distance")
for i in range(V):
if dist[i] != float("inf"):
print(i, "\t", int(dist[i]), end="\t")
else:
print(i, "\t", "INF", end="\t")
print()
def minDist(mdist, vset, V):
minVal = float("inf")
minInd = -1
for i in range(V):
if (not vset[i]) and mdist[i] < minVal:
minInd = i
minVal = mdist[i]
return minInd
def Dijkstra(graph, V, src):
mdist = [float("inf") for i in range(V)]
vset = [False for i in range(V)]
mdist[src] = 0.0
for i in range(V - 1):
u = minDist(mdist, vset, V)
vset[u] = True
for v in range(V):
if (
(not vset[v])
and graph[u][v] != float("inf")
and mdist[u] + graph[u][v] < mdist[v]
):
mdist[v] = mdist[u] + graph[u][v]
printDist(mdist, V)
if __name__ == "__main__":
V = int(input("Enter number of vertices: ").strip())
E = int(input("Enter number of edges: ").strip())
graph = [[float("inf") for i in range(V)] for j in range(V)]
for i in range(V):
graph[i][i] = 0.0
for i in range(E):
print("\nEdge ", i + 1)
src = int(input("Enter source:").strip())
dst = int(input("Enter destination:").strip())
weight = float(input("Enter weight:").strip())
graph[src][dst] = weight
gsrc = int(input("\nEnter shortest path source:").strip())
Dijkstra(graph, V, gsrc)
| def printDist(dist, V):
print("\nVertex Distance")
for i in range(V):
if dist[i] != float("inf"):
print(i, "\t", int(dist[i]), end="\t")
else:
print(i, "\t", "INF", end="\t")
print()
def minDist(mdist, vset, V):
minVal = float("inf")
minInd = -1
for i in range(V):
if (not vset[i]) and mdist[i] < minVal:
minInd = i
minVal = mdist[i]
return minInd
def Dijkstra(graph, V, src):
mdist = [float("inf") for i in range(V)]
vset = [False for i in range(V)]
mdist[src] = 0.0
for i in range(V - 1):
u = minDist(mdist, vset, V)
vset[u] = True
for v in range(V):
if (
(not vset[v])
and graph[u][v] != float("inf")
and mdist[u] + graph[u][v] < mdist[v]
):
mdist[v] = mdist[u] + graph[u][v]
printDist(mdist, V)
if __name__ == "__main__":
V = int(input("Enter number of vertices: ").strip())
E = int(input("Enter number of edges: ").strip())
graph = [[float("inf") for i in range(V)] for j in range(V)]
for i in range(V):
graph[i][i] = 0.0
for i in range(E):
print("\nEdge ", i + 1)
src = int(input("Enter source:").strip())
dst = int(input("Enter destination:").strip())
weight = float(input("Enter weight:").strip())
graph[src][dst] = weight
gsrc = int(input("\nEnter shortest path source:").strip())
Dijkstra(graph, V, gsrc)
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| #!/usr/bin/env python3
def climb_stairs(n: int) -> int:
"""
LeetCdoe No.70: Climbing Stairs
Distinct ways to climb a n step staircase where
each time you can either climb 1 or 2 steps.
Args:
n: number of steps of staircase
Returns:
Distinct ways to climb a n step staircase
Raises:
AssertionError: n not positive integer
>>> climb_stairs(3)
3
>>> climb_stairs(1)
1
>>> climb_stairs(-7) # doctest: +ELLIPSIS
Traceback (most recent call last):
...
AssertionError: n needs to be positive integer, your input -7
"""
assert (
isinstance(n, int) and n > 0
), f"n needs to be positive integer, your input {n}"
if n == 1:
return 1
dp = [0] * (n + 1)
dp[0], dp[1] = (1, 1)
for i in range(2, n + 1):
dp[i] = dp[i - 1] + dp[i - 2]
return dp[n]
if __name__ == "__main__":
import doctest
doctest.testmod()
| #!/usr/bin/env python3
def climb_stairs(n: int) -> int:
"""
LeetCdoe No.70: Climbing Stairs
Distinct ways to climb a n step staircase where
each time you can either climb 1 or 2 steps.
Args:
n: number of steps of staircase
Returns:
Distinct ways to climb a n step staircase
Raises:
AssertionError: n not positive integer
>>> climb_stairs(3)
3
>>> climb_stairs(1)
1
>>> climb_stairs(-7) # doctest: +ELLIPSIS
Traceback (most recent call last):
...
AssertionError: n needs to be positive integer, your input -7
"""
assert (
isinstance(n, int) and n > 0
), f"n needs to be positive integer, your input {n}"
if n == 1:
return 1
dp = [0] * (n + 1)
dp[0], dp[1] = (1, 1)
for i in range(2, n + 1):
dp[i] = dp[i - 1] + dp[i - 2]
return dp[n]
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| #!/bin/python3
# Doomsday algorithm info: https://en.wikipedia.org/wiki/Doomsday_rule
DOOMSDAY_LEAP = [4, 1, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
DOOMSDAY_NOT_LEAP = [3, 7, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
WEEK_DAY_NAMES = {
0: "Sunday",
1: "Monday",
2: "Tuesday",
3: "Wednesday",
4: "Thursday",
5: "Friday",
6: "Saturday",
}
def get_week_day(year: int, month: int, day: int) -> str:
"""Returns the week-day name out of a given date.
>>> get_week_day(2020, 10, 24)
'Saturday'
>>> get_week_day(2017, 10, 24)
'Tuesday'
>>> get_week_day(2019, 5, 3)
'Friday'
>>> get_week_day(1970, 9, 16)
'Wednesday'
>>> get_week_day(1870, 8, 13)
'Saturday'
>>> get_week_day(2040, 3, 14)
'Wednesday'
"""
# minimal input check:
assert len(str(year)) > 2, "year should be in YYYY format"
assert 1 <= month <= 12, "month should be between 1 to 12"
assert 1 <= day <= 31, "day should be between 1 to 31"
# Doomsday algorithm:
century = year // 100
century_anchor = (5 * (century % 4) + 2) % 7
centurian = year % 100
centurian_m = centurian % 12
dooms_day = (
(centurian // 12) + centurian_m + (centurian_m // 4) + century_anchor
) % 7
day_anchor = (
DOOMSDAY_NOT_LEAP[month - 1]
if (year % 4 != 0) or (centurian == 0 and (year % 400) == 0)
else DOOMSDAY_LEAP[month - 1]
)
week_day = (dooms_day + day - day_anchor) % 7
return WEEK_DAY_NAMES[week_day]
if __name__ == "__main__":
import doctest
doctest.testmod()
| #!/bin/python3
# Doomsday algorithm info: https://en.wikipedia.org/wiki/Doomsday_rule
DOOMSDAY_LEAP = [4, 1, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
DOOMSDAY_NOT_LEAP = [3, 7, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
WEEK_DAY_NAMES = {
0: "Sunday",
1: "Monday",
2: "Tuesday",
3: "Wednesday",
4: "Thursday",
5: "Friday",
6: "Saturday",
}
def get_week_day(year: int, month: int, day: int) -> str:
"""Returns the week-day name out of a given date.
>>> get_week_day(2020, 10, 24)
'Saturday'
>>> get_week_day(2017, 10, 24)
'Tuesday'
>>> get_week_day(2019, 5, 3)
'Friday'
>>> get_week_day(1970, 9, 16)
'Wednesday'
>>> get_week_day(1870, 8, 13)
'Saturday'
>>> get_week_day(2040, 3, 14)
'Wednesday'
"""
# minimal input check:
assert len(str(year)) > 2, "year should be in YYYY format"
assert 1 <= month <= 12, "month should be between 1 to 12"
assert 1 <= day <= 31, "day should be between 1 to 31"
# Doomsday algorithm:
century = year // 100
century_anchor = (5 * (century % 4) + 2) % 7
centurian = year % 100
centurian_m = centurian % 12
dooms_day = (
(centurian // 12) + centurian_m + (centurian_m // 4) + century_anchor
) % 7
day_anchor = (
DOOMSDAY_NOT_LEAP[month - 1]
if (year % 4 != 0) or (centurian == 0 and (year % 400) == 0)
else DOOMSDAY_LEAP[month - 1]
)
week_day = (dooms_day + day - day_anchor) % 7
return WEEK_DAY_NAMES[week_day]
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| # Video Explanation: https://www.youtube.com/watch?v=6w60Zi1NtL8&feature=emb_logo
from __future__ import annotations
def maximum_non_adjacent_sum(nums: list[int]) -> int:
"""
Find the maximum non-adjacent sum of the integers in the nums input list
>>> print(maximum_non_adjacent_sum([1, 2, 3]))
4
>>> maximum_non_adjacent_sum([1, 5, 3, 7, 2, 2, 6])
18
>>> maximum_non_adjacent_sum([-1, -5, -3, -7, -2, -2, -6])
0
>>> maximum_non_adjacent_sum([499, 500, -3, -7, -2, -2, -6])
500
"""
if not nums:
return 0
max_including = nums[0]
max_excluding = 0
for num in nums[1:]:
max_including, max_excluding = (
max_excluding + num,
max(max_including, max_excluding),
)
return max(max_excluding, max_including)
if __name__ == "__main__":
import doctest
doctest.testmod()
| # Video Explanation: https://www.youtube.com/watch?v=6w60Zi1NtL8&feature=emb_logo
from __future__ import annotations
def maximum_non_adjacent_sum(nums: list[int]) -> int:
"""
Find the maximum non-adjacent sum of the integers in the nums input list
>>> print(maximum_non_adjacent_sum([1, 2, 3]))
4
>>> maximum_non_adjacent_sum([1, 5, 3, 7, 2, 2, 6])
18
>>> maximum_non_adjacent_sum([-1, -5, -3, -7, -2, -2, -6])
0
>>> maximum_non_adjacent_sum([499, 500, -3, -7, -2, -2, -6])
500
"""
if not nums:
return 0
max_including = nums[0]
max_excluding = 0
for num in nums[1:]:
max_including, max_excluding = (
max_excluding + num,
max(max_including, max_excluding),
)
return max(max_excluding, max_including)
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
The first known prime found to exceed one million digits was discovered in 1999,
and is a Mersenne prime of the form 2**6972593 − 1; it contains exactly 2,098,960
digits. Subsequently other Mersenne primes, of the form 2**p − 1, have been found
which contain more digits.
However, in 2004 there was found a massive non-Mersenne prime which contains
2,357,207 digits: (28433 * (2 ** 7830457 + 1)).
Find the last ten digits of this prime number.
"""
def solution(n: int = 10) -> str:
"""
Returns the last n digits of NUMBER.
>>> solution()
'8739992577'
>>> solution(8)
'39992577'
>>> solution(1)
'7'
>>> solution(-1)
Traceback (most recent call last):
...
ValueError: Invalid input
>>> solution(8.3)
Traceback (most recent call last):
...
ValueError: Invalid input
>>> solution("a")
Traceback (most recent call last):
...
ValueError: Invalid input
"""
if not isinstance(n, int) or n < 0:
raise ValueError("Invalid input")
MODULUS = 10 ** n
NUMBER = 28433 * (pow(2, 7830457, MODULUS)) + 1
return str(NUMBER % MODULUS)
if __name__ == "__main__":
from doctest import testmod
testmod()
print(f"{solution(10) = }")
| """
The first known prime found to exceed one million digits was discovered in 1999,
and is a Mersenne prime of the form 2**6972593 − 1; it contains exactly 2,098,960
digits. Subsequently other Mersenne primes, of the form 2**p − 1, have been found
which contain more digits.
However, in 2004 there was found a massive non-Mersenne prime which contains
2,357,207 digits: (28433 * (2 ** 7830457 + 1)).
Find the last ten digits of this prime number.
"""
def solution(n: int = 10) -> str:
"""
Returns the last n digits of NUMBER.
>>> solution()
'8739992577'
>>> solution(8)
'39992577'
>>> solution(1)
'7'
>>> solution(-1)
Traceback (most recent call last):
...
ValueError: Invalid input
>>> solution(8.3)
Traceback (most recent call last):
...
ValueError: Invalid input
>>> solution("a")
Traceback (most recent call last):
...
ValueError: Invalid input
"""
if not isinstance(n, int) or n < 0:
raise ValueError("Invalid input")
MODULUS = 10 ** n
NUMBER = 28433 * (pow(2, 7830457, MODULUS)) + 1
return str(NUMBER % MODULUS)
if __name__ == "__main__":
from doctest import testmod
testmod()
print(f"{solution(10) = }")
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
author : Mayank Kumar Jha (mk9440)
"""
from __future__ import annotations
def find_max_sub_array(A, low, high):
if low == high:
return low, high, A[low]
else:
mid = (low + high) // 2
left_low, left_high, left_sum = find_max_sub_array(A, low, mid)
right_low, right_high, right_sum = find_max_sub_array(A, mid + 1, high)
cross_left, cross_right, cross_sum = find_max_cross_sum(A, low, mid, high)
if left_sum >= right_sum and left_sum >= cross_sum:
return left_low, left_high, left_sum
elif right_sum >= left_sum and right_sum >= cross_sum:
return right_low, right_high, right_sum
else:
return cross_left, cross_right, cross_sum
def find_max_cross_sum(A, low, mid, high):
left_sum, max_left = -999999999, -1
right_sum, max_right = -999999999, -1
summ = 0
for i in range(mid, low - 1, -1):
summ += A[i]
if summ > left_sum:
left_sum = summ
max_left = i
summ = 0
for i in range(mid + 1, high + 1):
summ += A[i]
if summ > right_sum:
right_sum = summ
max_right = i
return max_left, max_right, (left_sum + right_sum)
def max_sub_array(nums: list[int]) -> int:
"""
Finds the contiguous subarray which has the largest sum and return its sum.
>>> max_sub_array([-2, 1, -3, 4, -1, 2, 1, -5, 4])
6
An empty (sub)array has sum 0.
>>> max_sub_array([])
0
If all elements are negative, the largest subarray would be the empty array,
having the sum 0.
>>> max_sub_array([-1, -2, -3])
0
>>> max_sub_array([5, -2, -3])
5
>>> max_sub_array([31, -41, 59, 26, -53, 58, 97, -93, -23, 84])
187
"""
best = 0
current = 0
for i in nums:
current += i
if current < 0:
current = 0
best = max(best, current)
return best
if __name__ == "__main__":
"""
A random simulation of this algorithm.
"""
import time
from random import randint
from matplotlib import pyplot as plt
inputs = [10, 100, 1000, 10000, 50000, 100000, 200000, 300000, 400000, 500000]
tim = []
for i in inputs:
li = [randint(1, i) for j in range(i)]
strt = time.time()
(find_max_sub_array(li, 0, len(li) - 1))
end = time.time()
tim.append(end - strt)
print("No of Inputs Time Taken")
for i in range(len(inputs)):
print(inputs[i], "\t\t", tim[i])
plt.plot(inputs, tim)
plt.xlabel("Number of Inputs")
plt.ylabel("Time taken in seconds ")
plt.show()
| """
author : Mayank Kumar Jha (mk9440)
"""
from __future__ import annotations
def find_max_sub_array(A, low, high):
if low == high:
return low, high, A[low]
else:
mid = (low + high) // 2
left_low, left_high, left_sum = find_max_sub_array(A, low, mid)
right_low, right_high, right_sum = find_max_sub_array(A, mid + 1, high)
cross_left, cross_right, cross_sum = find_max_cross_sum(A, low, mid, high)
if left_sum >= right_sum and left_sum >= cross_sum:
return left_low, left_high, left_sum
elif right_sum >= left_sum and right_sum >= cross_sum:
return right_low, right_high, right_sum
else:
return cross_left, cross_right, cross_sum
def find_max_cross_sum(A, low, mid, high):
left_sum, max_left = -999999999, -1
right_sum, max_right = -999999999, -1
summ = 0
for i in range(mid, low - 1, -1):
summ += A[i]
if summ > left_sum:
left_sum = summ
max_left = i
summ = 0
for i in range(mid + 1, high + 1):
summ += A[i]
if summ > right_sum:
right_sum = summ
max_right = i
return max_left, max_right, (left_sum + right_sum)
def max_sub_array(nums: list[int]) -> int:
"""
Finds the contiguous subarray which has the largest sum and return its sum.
>>> max_sub_array([-2, 1, -3, 4, -1, 2, 1, -5, 4])
6
An empty (sub)array has sum 0.
>>> max_sub_array([])
0
If all elements are negative, the largest subarray would be the empty array,
having the sum 0.
>>> max_sub_array([-1, -2, -3])
0
>>> max_sub_array([5, -2, -3])
5
>>> max_sub_array([31, -41, 59, 26, -53, 58, 97, -93, -23, 84])
187
"""
best = 0
current = 0
for i in nums:
current += i
if current < 0:
current = 0
best = max(best, current)
return best
if __name__ == "__main__":
"""
A random simulation of this algorithm.
"""
import time
from random import randint
from matplotlib import pyplot as plt
inputs = [10, 100, 1000, 10000, 50000, 100000, 200000, 300000, 400000, 500000]
tim = []
for i in inputs:
li = [randint(1, i) for j in range(i)]
strt = time.time()
(find_max_sub_array(li, 0, len(li) - 1))
end = time.time()
tim.append(end - strt)
print("No of Inputs Time Taken")
for i in range(len(inputs)):
print(inputs[i], "\t\t", tim[i])
plt.plot(inputs, tim)
plt.xlabel("Number of Inputs")
plt.ylabel("Time taken in seconds ")
plt.show()
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| def exchange_sort(numbers: list[int]) -> list[int]:
"""
Uses exchange sort to sort a list of numbers.
Source: https://en.wikipedia.org/wiki/Sorting_algorithm#Exchange_sort
>>> exchange_sort([5, 4, 3, 2, 1])
[1, 2, 3, 4, 5]
>>> exchange_sort([-1, -2, -3])
[-3, -2, -1]
>>> exchange_sort([1, 2, 3, 4, 5])
[1, 2, 3, 4, 5]
>>> exchange_sort([0, 10, -2, 5, 3])
[-2, 0, 3, 5, 10]
>>> exchange_sort([])
[]
"""
numbers_length = len(numbers)
for i in range(numbers_length):
for j in range(i + 1, numbers_length):
if numbers[j] < numbers[i]:
numbers[i], numbers[j] = numbers[j], numbers[i]
return numbers
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(exchange_sort(unsorted))
| def exchange_sort(numbers: list[int]) -> list[int]:
"""
Uses exchange sort to sort a list of numbers.
Source: https://en.wikipedia.org/wiki/Sorting_algorithm#Exchange_sort
>>> exchange_sort([5, 4, 3, 2, 1])
[1, 2, 3, 4, 5]
>>> exchange_sort([-1, -2, -3])
[-3, -2, -1]
>>> exchange_sort([1, 2, 3, 4, 5])
[1, 2, 3, 4, 5]
>>> exchange_sort([0, 10, -2, 5, 3])
[-2, 0, 3, 5, 10]
>>> exchange_sort([])
[]
"""
numbers_length = len(numbers)
for i in range(numbers_length):
for j in range(i + 1, numbers_length):
if numbers[j] < numbers[i]:
numbers[i], numbers[j] = numbers[j], numbers[i]
return numbers
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(exchange_sort(unsorted))
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """Breadth-first search shortest path implementations.
doctest:
python -m doctest -v bfs_shortest_path.py
Manual test:
python bfs_shortest_path.py
"""
demo_graph = {
"A": ["B", "C", "E"],
"B": ["A", "D", "E"],
"C": ["A", "F", "G"],
"D": ["B"],
"E": ["A", "B", "D"],
"F": ["C"],
"G": ["C"],
}
def bfs_shortest_path(graph: dict, start, goal) -> list[str]:
"""Find shortest path between `start` and `goal` nodes.
Args:
graph (dict): node/list of neighboring nodes key/value pairs.
start: start node.
goal: target node.
Returns:
Shortest path between `start` and `goal` nodes as a string of nodes.
'Not found' string if no path found.
Example:
>>> bfs_shortest_path(demo_graph, "G", "D")
['G', 'C', 'A', 'B', 'D']
>>> bfs_shortest_path(demo_graph, "G", "G")
['G']
>>> bfs_shortest_path(demo_graph, "G", "Unknown")
[]
"""
# keep track of explored nodes
explored = set()
# keep track of all the paths to be checked
queue = [[start]]
# return path if start is goal
if start == goal:
return [start]
# keeps looping until all possible paths have been checked
while queue:
# pop the first path from the queue
path = queue.pop(0)
# get the last node from the path
node = path[-1]
if node not in explored:
neighbours = graph[node]
# go through all neighbour nodes, construct a new path and
# push it into the queue
for neighbour in neighbours:
new_path = list(path)
new_path.append(neighbour)
queue.append(new_path)
# return path if neighbour is goal
if neighbour == goal:
return new_path
# mark node as explored
explored.add(node)
# in case there's no path between the 2 nodes
return []
def bfs_shortest_path_distance(graph: dict, start, target) -> int:
"""Find shortest path distance between `start` and `target` nodes.
Args:
graph: node/list of neighboring nodes key/value pairs.
start: node to start search from.
target: node to search for.
Returns:
Number of edges in shortest path between `start` and `target` nodes.
-1 if no path exists.
Example:
>>> bfs_shortest_path_distance(demo_graph, "G", "D")
4
>>> bfs_shortest_path_distance(demo_graph, "A", "A")
0
>>> bfs_shortest_path_distance(demo_graph, "A", "Unknown")
-1
"""
if not graph or start not in graph or target not in graph:
return -1
if start == target:
return 0
queue = [start]
visited = set(start)
# Keep tab on distances from `start` node.
dist = {start: 0, target: -1}
while queue:
node = queue.pop(0)
if node == target:
dist[target] = (
dist[node] if dist[target] == -1 else min(dist[target], dist[node])
)
for adjacent in graph[node]:
if adjacent not in visited:
visited.add(adjacent)
queue.append(adjacent)
dist[adjacent] = dist[node] + 1
return dist[target]
if __name__ == "__main__":
print(bfs_shortest_path(demo_graph, "G", "D")) # returns ['G', 'C', 'A', 'B', 'D']
print(bfs_shortest_path_distance(demo_graph, "G", "D")) # returns 4
| """Breadth-first search shortest path implementations.
doctest:
python -m doctest -v bfs_shortest_path.py
Manual test:
python bfs_shortest_path.py
"""
demo_graph = {
"A": ["B", "C", "E"],
"B": ["A", "D", "E"],
"C": ["A", "F", "G"],
"D": ["B"],
"E": ["A", "B", "D"],
"F": ["C"],
"G": ["C"],
}
def bfs_shortest_path(graph: dict, start, goal) -> list[str]:
"""Find shortest path between `start` and `goal` nodes.
Args:
graph (dict): node/list of neighboring nodes key/value pairs.
start: start node.
goal: target node.
Returns:
Shortest path between `start` and `goal` nodes as a string of nodes.
'Not found' string if no path found.
Example:
>>> bfs_shortest_path(demo_graph, "G", "D")
['G', 'C', 'A', 'B', 'D']
>>> bfs_shortest_path(demo_graph, "G", "G")
['G']
>>> bfs_shortest_path(demo_graph, "G", "Unknown")
[]
"""
# keep track of explored nodes
explored = set()
# keep track of all the paths to be checked
queue = [[start]]
# return path if start is goal
if start == goal:
return [start]
# keeps looping until all possible paths have been checked
while queue:
# pop the first path from the queue
path = queue.pop(0)
# get the last node from the path
node = path[-1]
if node not in explored:
neighbours = graph[node]
# go through all neighbour nodes, construct a new path and
# push it into the queue
for neighbour in neighbours:
new_path = list(path)
new_path.append(neighbour)
queue.append(new_path)
# return path if neighbour is goal
if neighbour == goal:
return new_path
# mark node as explored
explored.add(node)
# in case there's no path between the 2 nodes
return []
def bfs_shortest_path_distance(graph: dict, start, target) -> int:
"""Find shortest path distance between `start` and `target` nodes.
Args:
graph: node/list of neighboring nodes key/value pairs.
start: node to start search from.
target: node to search for.
Returns:
Number of edges in shortest path between `start` and `target` nodes.
-1 if no path exists.
Example:
>>> bfs_shortest_path_distance(demo_graph, "G", "D")
4
>>> bfs_shortest_path_distance(demo_graph, "A", "A")
0
>>> bfs_shortest_path_distance(demo_graph, "A", "Unknown")
-1
"""
if not graph or start not in graph or target not in graph:
return -1
if start == target:
return 0
queue = [start]
visited = set(start)
# Keep tab on distances from `start` node.
dist = {start: 0, target: -1}
while queue:
node = queue.pop(0)
if node == target:
dist[target] = (
dist[node] if dist[target] == -1 else min(dist[target], dist[node])
)
for adjacent in graph[node]:
if adjacent not in visited:
visited.add(adjacent)
queue.append(adjacent)
dist[adjacent] = dist[node] + 1
return dist[target]
if __name__ == "__main__":
print(bfs_shortest_path(demo_graph, "G", "D")) # returns ['G', 'C', 'A', 'B', 'D']
print(bfs_shortest_path_distance(demo_graph, "G", "D")) # returns 4
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| 04/24/2020, 1279.31, 1640394, 1261.17, 1280.4, 1249.45
04/23/2020, 1276.31, 1566203, 1271.55, 1293.31, 1265.67
04/22/2020, 1263.21, 2093140, 1245.54, 1285.6133, 1242
04/21/2020, 1216.34, 2153003, 1247, 1254.27, 1209.71
04/20/2020, 1266.61, 1695488, 1271, 1281.6, 1261.37
04/17/2020, 1283.25, 1949042, 1284.85, 1294.43, 1271.23
04/16/2020, 1263.47, 2518099, 1274.1, 1279, 1242.62
04/15/2020, 1262.47, 1671703, 1245.61, 1280.46, 1240.4
04/14/2020, 1269.23, 2470353, 1245.09, 1282.07, 1236.93
04/13/2020, 1217.56, 1739828, 1209.18, 1220.51, 1187.5984
04/09/2020, 1211.45, 2175421, 1224.08, 1225.57, 1196.7351
04/08/2020, 1210.28, 1975135, 1206.5, 1219.07, 1188.16
04/07/2020, 1186.51, 2387329, 1221, 1225, 1182.23
04/06/2020, 1186.92, 2664723, 1138, 1194.66, 1130.94
04/03/2020, 1097.88, 2313400, 1119.015, 1123.54, 1079.81
04/02/2020, 1120.84, 1964881, 1098.26, 1126.86, 1096.4
04/01/2020, 1105.62, 2344173, 1122, 1129.69, 1097.45
03/31/2020, 1162.81, 2487983, 1147.3, 1175.31, 1138.14
03/30/2020, 1146.82, 2574061, 1125.04, 1151.63, 1096.48
03/27/2020, 1110.71, 3208495, 1125.67, 1150.6702, 1105.91
03/26/2020, 1161.75, 3573755, 1111.8, 1169.97, 1093.53
03/25/2020, 1102.49, 4081528, 1126.47, 1148.9, 1086.01
03/24/2020, 1134.46, 3344450, 1103.77, 1135, 1090.62
03/23/2020, 1056.62, 4044137, 1061.32, 1071.32, 1013.5361
03/20/2020, 1072.32, 3601750, 1135.72, 1143.99, 1065.49
03/19/2020, 1115.29, 3651106, 1093.05, 1157.9699, 1060.1075
03/18/2020, 1096.8, 4233435, 1056.51, 1106.5, 1037.28
03/17/2020, 1119.8, 3861489, 1093.11, 1130.86, 1056.01
03/16/2020, 1084.33, 4252365, 1096, 1152.2665, 1074.44
03/13/2020, 1219.73, 3700125, 1179, 1219.76, 1117.1432
03/12/2020, 1114.91, 4226748, 1126, 1193.87, 1113.3
03/11/2020, 1215.41, 2611229, 1249.7, 1260.96, 1196.07
03/10/2020, 1280.39, 2611373, 1260, 1281.15, 1218.77
03/09/2020, 1215.56, 3365365, 1205.3, 1254.7599, 1200
03/06/2020, 1298.41, 2660628, 1277.06, 1306.22, 1261.05
03/05/2020, 1319.04, 2561288, 1350.2, 1358.91, 1305.1
03/04/2020, 1386.52, 1913315, 1359.23, 1388.09, 1343.11
03/03/2020, 1341.39, 2402326, 1399.42, 1410.15, 1332
03/02/2020, 1389.11, 2431468, 1351.61, 1390.87, 1326.815
02/28/2020, 1339.33, 3790618, 1277.5, 1341.14, 1271
02/27/2020, 1318.09, 2978300, 1362.06, 1371.7037, 1317.17
02/26/2020, 1393.18, 2204037, 1396.14, 1415.7, 1379
02/25/2020, 1388.45, 2478278, 1433, 1438.14, 1382.4
02/24/2020, 1421.59, 2867053, 1426.11, 1436.97, 1411.39
02/21/2020, 1485.11, 1732273, 1508.03, 1512.215, 1480.44
02/20/2020, 1518.15, 1096552, 1522, 1529.64, 1506.82
02/19/2020, 1526.69, 949268, 1525.07, 1532.1063, 1521.4
02/18/2020, 1519.67, 1121140, 1515, 1531.63, 1512.59
02/14/2020, 1520.74, 1197836, 1515.6, 1520.74, 1507.34
02/13/2020, 1514.66, 929730, 1512.69, 1527.18, 1504.6
02/12/2020, 1518.27, 1167565, 1514.48, 1520.695, 1508.11
02/11/2020, 1508.79, 1344633, 1511.81, 1529.63, 1505.6378
02/10/2020, 1508.68, 1419876, 1474.32, 1509.5, 1474.32
02/07/2020, 1479.23, 1172270, 1467.3, 1485.84, 1466.35
02/06/2020, 1476.23, 1679384, 1450.33, 1481.9997, 1449.57
02/05/2020, 1448.23, 1986157, 1462.42, 1463.84, 1430.56
02/04/2020, 1447.07, 3932954, 1457.07, 1469.5, 1426.3
02/03/2020, 1485.94, 3055216, 1462, 1490, 1458.99
01/31/2020, 1434.23, 2417214, 1468.9, 1470.13, 1428.53
01/30/2020, 1455.84, 1339421, 1439.96, 1457.28, 1436.4
01/29/2020, 1458.63, 1078667, 1458.8, 1465.43, 1446.74
01/28/2020, 1452.56, 1577422, 1443, 1456, 1432.47
01/27/2020, 1433.9, 1755201, 1431, 1438.07, 1421.2
01/24/2020, 1466.71, 1784644, 1493.59, 1495.495, 1465.25
01/23/2020, 1486.65, 1351354, 1487.64, 1495.52, 1482.1
01/22/2020, 1485.95, 1610846, 1491, 1503.2143, 1484.93
01/21/2020, 1484.4, 2036780, 1479.12, 1491.85, 1471.2
01/17/2020, 1480.39, 2396215, 1462.91, 1481.2954, 1458.22
01/16/2020, 1451.7, 1173688, 1447.44, 1451.99, 1440.92
01/15/2020, 1439.2, 1282685, 1430.21, 1441.395, 1430.21
01/14/2020, 1430.88, 1560453, 1439.01, 1441.8, 1428.37
01/13/2020, 1439.23, 1653482, 1436.13, 1440.52, 1426.02
01/10/2020, 1429.73, 1821566, 1427.56, 1434.9292, 1418.35
01/09/2020, 1419.83, 1502664, 1420.57, 1427.33, 1410.27
01/08/2020, 1404.32, 1529177, 1392.08, 1411.58, 1390.84
01/07/2020, 1393.34, 1511693, 1397.94, 1402.99, 1390.38
01/06/2020, 1394.21, 1733149, 1350, 1396.5, 1350
01/03/2020, 1360.66, 1187006, 1347.86, 1372.5, 1345.5436
01/02/2020, 1367.37, 1406731, 1341.55, 1368.14, 1341.55
12/31/2019, 1337.02, 962468, 1330.11, 1338, 1329.085
12/30/2019, 1336.14, 1051323, 1350, 1353, 1334.02
12/27/2019, 1351.89, 1038718, 1362.99, 1364.53, 1349.31
12/26/2019, 1360.4, 667754, 1346.17, 1361.3269, 1344.47
12/24/2019, 1343.56, 347518, 1348.5, 1350.26, 1342.78
12/23/2019, 1348.84, 883200, 1355.87, 1359.7999, 1346.51
12/20/2019, 1349.59, 3316905, 1363.35, 1363.64, 1349
12/19/2019, 1356.04, 1470112, 1351.82, 1358.1, 1348.985
12/18/2019, 1352.62, 1657069, 1356.6, 1360.47, 1351
12/17/2019, 1355.12, 1855259, 1362.89, 1365, 1351.3231
12/16/2019, 1361.17, 1397451, 1356.5, 1364.68, 1352.67
12/13/2019, 1347.83, 1550028, 1347.95, 1353.0931, 1343.87
12/12/2019, 1350.27, 1281722, 1345.94, 1355.775, 1340.5
12/11/2019, 1345.02, 850796, 1350.84, 1351.2, 1342.67
12/10/2019, 1344.66, 1094653, 1341.5, 1349.975, 1336.04
12/09/2019, 1343.56, 1355795, 1338.04, 1359.45, 1337.84
12/06/2019, 1340.62, 1315510, 1333.44, 1344, 1333.44
12/05/2019, 1328.13, 1212818, 1328, 1329.3579, 1316.44
12/04/2019, 1320.54, 1538110, 1307.01, 1325.8, 1304.87
12/03/2019, 1295.28, 1268647, 1279.57, 1298.461, 1279
12/02/2019, 1289.92, 1511851, 1301, 1305.83, 1281
11/29/2019, 1304.96, 586981, 1307.12, 1310.205, 1303.97
11/27/2019, 1312.99, 996329, 1315, 1318.36, 1309.63
11/26/2019, 1313.55, 1069795, 1309.86, 1314.8, 1305.09
11/25/2019, 1306.69, 1036487, 1299.18, 1311.31, 1298.13
11/22/2019, 1295.34, 1386506, 1305.62, 1308.73, 1291.41
11/21/2019, 1301.35, 995499, 1301.48, 1312.59, 1293
11/20/2019, 1303.05, 1309835, 1311.74, 1315, 1291.15
11/19/2019, 1315.46, 1269372, 1327.7, 1327.7, 1312.8
11/18/2019, 1320.7, 1488083, 1332.22, 1335.5288, 1317.5
11/15/2019, 1334.87, 1782955, 1318.94, 1334.88, 1314.2796
11/14/2019, 1311.46, 1194305, 1297.5, 1317, 1295.65
11/13/2019, 1298, 853861, 1294.07, 1304.3, 1293.51
11/12/2019, 1298.8, 1085859, 1300, 1310, 1295.77
11/11/2019, 1299.19, 1012429, 1303.18, 1306.425, 1297.41
11/08/2019, 1311.37, 1251916, 1305.28, 1318, 1304.365
11/07/2019, 1308.86, 2029970, 1294.28, 1323.74, 1294.245
11/06/2019, 1291.8, 1152977, 1289.46, 1293.73, 1282.5
11/05/2019, 1292.03, 1282711, 1292.89, 1298.93, 1291.2289
11/04/2019, 1291.37, 1500964, 1276.45, 1294.13, 1276.355
11/01/2019, 1273.74, 1670072, 1265, 1274.62, 1260.5
10/31/2019, 1260.11, 1455651, 1261.28, 1267.67, 1250.8428
10/30/2019, 1261.29, 1408851, 1252.97, 1269.36, 1252
10/29/2019, 1262.62, 1886380, 1276.23, 1281.59, 1257.2119
10/28/2019, 1290, 2613237, 1275.45, 1299.31, 1272.54
10/25/2019, 1265.13, 1213051, 1251.03, 1269.6, 1250.01
10/24/2019, 1260.99, 1039868, 1260.9, 1264, 1253.715
10/23/2019, 1259.13, 928595, 1242.36, 1259.89, 1242.36
10/22/2019, 1242.8, 1047851, 1247.85, 1250.6, 1241.38
10/21/2019, 1246.15, 1038042, 1252.26, 1254.6287, 1240.6
10/18/2019, 1245.49, 1352839, 1253.46, 1258.89, 1241.08
10/17/2019, 1253.07, 980510, 1250.93, 1263.325, 1249.94
10/16/2019, 1243.64, 1168174, 1241.17, 1254.74, 1238.45
10/15/2019, 1243.01, 1395259, 1220.4, 1247.33, 1220.4
10/14/2019, 1217.14, 882039, 1212.34, 1226.33, 1211.76
10/11/2019, 1215.45, 1277144, 1222.21, 1228.39, 1213.74
10/10/2019, 1208.67, 932531, 1198.58, 1215, 1197.34
10/09/2019, 1202.31, 876632, 1199.35, 1208.35, 1197.63
10/08/2019, 1189.13, 1141784, 1197.59, 1206.08, 1189.01
10/07/2019, 1207.68, 867149, 1204.4, 1218.2036, 1203.75
10/04/2019, 1209, 1183264, 1191.89, 1211.44, 1189.17
10/03/2019, 1187.83, 1663656, 1180, 1189.06, 1162.43
10/02/2019, 1176.63, 1639237, 1196.98, 1196.99, 1171.29
10/01/2019, 1205.1, 1358279, 1219, 1231.23, 1203.58
09/30/2019, 1219, 1419676, 1220.97, 1226, 1212.3
09/27/2019, 1225.09, 1354432, 1243.01, 1244.02, 1214.45
09/26/2019, 1241.39, 1561882, 1241.96, 1245, 1232.268
09/25/2019, 1246.52, 1593875, 1215.82, 1248.3, 1210.09
09/24/2019, 1218.76, 1591786, 1240, 1246.74, 1210.68
09/23/2019, 1234.03, 1075253, 1226, 1239.09, 1224.17
09/20/2019, 1229.93, 2337269, 1233.12, 1243.32, 1223.08
09/19/2019, 1238.71, 1000155, 1232.06, 1244.44, 1232.02
09/18/2019, 1232.41, 1144333, 1227.51, 1235.61, 1216.53
09/17/2019, 1229.15, 958112, 1230.4, 1235, 1223.69
09/16/2019, 1231.3, 1053299, 1229.52, 1239.56, 1225.61
09/13/2019, 1239.56, 1301350, 1231.35, 1240.88, 1227.01
09/12/2019, 1234.25, 1725908, 1224.3, 1241.86, 1223.02
09/11/2019, 1220.17, 1307033, 1203.41, 1222.6, 1202.2
09/10/2019, 1206, 1260115, 1195.15, 1210, 1194.58
09/09/2019, 1204.41, 1471880, 1204, 1220, 1192.62
09/06/2019, 1204.93, 1072143, 1208.13, 1212.015, 1202.5222
09/05/2019, 1211.38, 1408601, 1191.53, 1213.04, 1191.53
09/04/2019, 1181.41, 1068968, 1176.71, 1183.48, 1171
09/03/2019, 1168.39, 1480420, 1177.03, 1186.89, 1163.2
08/30/2019, 1188.1, 1129959, 1198.5, 1198.5, 1183.8026
08/29/2019, 1192.85, 1088858, 1181.12, 1196.06, 1181.12
08/28/2019, 1171.02, 802243, 1161.71, 1176.4199, 1157.3
08/27/2019, 1167.84, 1077452, 1180.53, 1182.4, 1161.45
08/26/2019, 1168.89, 1226441, 1157.26, 1169.47, 1152.96
08/23/2019, 1151.29, 1688271, 1181.99, 1194.08, 1147.75
08/22/2019, 1189.53, 947906, 1194.07, 1198.0115, 1178.58
08/21/2019, 1191.25, 741053, 1193.15, 1199, 1187.43
08/20/2019, 1182.69, 915605, 1195.25, 1196.06, 1182.11
08/19/2019, 1198.45, 1232517, 1190.09, 1206.99, 1190.09
08/16/2019, 1177.6, 1349436, 1179.55, 1182.72, 1171.81
08/15/2019, 1167.26, 1224739, 1163.5, 1175.84, 1162.11
08/14/2019, 1164.29, 1578668, 1176.31, 1182.3, 1160.54
08/13/2019, 1197.27, 1318009, 1171.46, 1204.78, 1171.46
08/12/2019, 1174.71, 1003187, 1179.21, 1184.96, 1167.6723
08/09/2019, 1188.01, 1065658, 1197.99, 1203.88, 1183.603
08/08/2019, 1204.8, 1467997, 1182.83, 1205.01, 1173.02
08/07/2019, 1173.99, 1444324, 1156, 1178.4451, 1149.6239
08/06/2019, 1169.95, 1709374, 1163.31, 1179.96, 1160
08/05/2019, 1152.32, 2597455, 1170.04, 1175.24, 1140.14
08/02/2019, 1193.99, 1645067, 1200.74, 1206.9, 1188.94
08/01/2019, 1209.01, 1698510, 1214.03, 1234.11, 1205.72
07/31/2019, 1216.68, 1725454, 1223, 1234, 1207.7635
07/30/2019, 1225.14, 1453263, 1225.41, 1234.87, 1223.3
07/29/2019, 1239.41, 2223731, 1241.05, 1247.37, 1228.23
07/26/2019, 1250.41, 4805752, 1224.04, 1265.5499, 1224
07/25/2019, 1132.12, 2209823, 1137.82, 1141.7, 1120.92
07/24/2019, 1137.81, 1590101, 1131.9, 1144, 1126.99
07/23/2019, 1146.21, 1093688, 1144, 1146.9, 1131.8
07/22/2019, 1138.07, 1301846, 1133.45, 1139.25, 1124.24
07/19/2019, 1130.1, 1647245, 1148.19, 1151.14, 1129.62
07/18/2019, 1146.33, 1291281, 1141.74, 1147.605, 1132.73
07/17/2019, 1146.35, 1170047, 1150.97, 1158.36, 1145.77
07/16/2019, 1153.58, 1238807, 1146, 1158.58, 1145
07/15/2019, 1150.34, 903780, 1146.86, 1150.82, 1139.4
07/12/2019, 1144.9, 863973, 1143.99, 1147.34, 1138.78
07/11/2019, 1144.21, 1195569, 1143.25, 1153.07, 1139.58
07/10/2019, 1140.48, 1209466, 1131.22, 1142.05, 1130.97
07/09/2019, 1124.83, 1330370, 1111.8, 1128.025, 1107.17
07/08/2019, 1116.35, 1236419, 1125.17, 1125.98, 1111.21
07/05/2019, 1131.59, 1264540, 1117.8, 1132.88, 1116.14
07/03/2019, 1121.58, 767011, 1117.41, 1126.76, 1113.86
07/02/2019, 1111.25, 991755, 1102.24, 1111.77, 1098.17
07/01/2019, 1097.95, 1438504, 1098, 1107.58, 1093.703
06/28/2019, 1080.91, 1693450, 1076.39, 1081, 1073.37
06/27/2019, 1076.01, 1004477, 1084, 1087.1, 1075.29
06/26/2019, 1079.8, 1810869, 1086.5, 1092.97, 1072.24
06/25/2019, 1086.35, 1546913, 1112.66, 1114.35, 1083.8
06/24/2019, 1115.52, 1395696, 1119.61, 1122, 1111.01
06/21/2019, 1121.88, 1947591, 1109.24, 1124.11, 1108.08
06/20/2019, 1111.42, 1262011, 1119.99, 1120.12, 1104.74
06/19/2019, 1102.33, 1339218, 1105.6, 1107, 1093.48
06/18/2019, 1103.6, 1386684, 1109.69, 1116.39, 1098.99
06/17/2019, 1092.5, 941602, 1086.28, 1099.18, 1086.28
06/14/2019, 1085.35, 1111643, 1086.42, 1092.69, 1080.1721
06/13/2019, 1088.77, 1058000, 1083.64, 1094.17, 1080.15
06/12/2019, 1077.03, 1061255, 1078, 1080.93, 1067.54
06/11/2019, 1078.72, 1437063, 1093.98, 1101.99, 1077.6025
06/10/2019, 1080.38, 1464248, 1072.98, 1092.66, 1072.3216
06/07/2019, 1066.04, 1802370, 1050.63, 1070.92, 1048.4
06/06/2019, 1044.34, 1703244, 1044.99, 1047.49, 1033.7
06/05/2019, 1042.22, 2168439, 1051.54, 1053.55, 1030.49
06/04/2019, 1053.05, 2833483, 1042.9, 1056.05, 1033.69
06/03/2019, 1036.23, 5130576, 1065.5, 1065.5, 1025
05/31/2019, 1103.63, 1508203, 1101.29, 1109.6, 1100.18
05/30/2019, 1117.95, 951873, 1115.54, 1123.13, 1112.12
05/29/2019, 1116.46, 1538212, 1127.52, 1129.1, 1108.2201
05/28/2019, 1134.15, 1365166, 1134, 1151.5871, 1133.12
05/24/2019, 1133.47, 1112341, 1147.36, 1149.765, 1131.66
05/23/2019, 1140.77, 1199300, 1140.5, 1145.9725, 1129.224
05/22/2019, 1151.42, 914839, 1146.75, 1158.52, 1145.89
05/21/2019, 1149.63, 1160158, 1148.49, 1152.7077, 1137.94
05/20/2019, 1138.85, 1353292, 1144.5, 1146.7967, 1131.4425
05/17/2019, 1162.3, 1208623, 1168.47, 1180.15, 1160.01
05/16/2019, 1178.98, 1531404, 1164.51, 1188.16, 1162.84
05/15/2019, 1164.21, 2289302, 1117.87, 1171.33, 1116.6657
05/14/2019, 1120.44, 1836604, 1137.21, 1140.42, 1119.55
05/13/2019, 1132.03, 1860648, 1141.96, 1147.94, 1122.11
05/10/2019, 1164.27, 1314546, 1163.59, 1172.6, 1142.5
05/09/2019, 1162.38, 1185973, 1159.03, 1169.66, 1150.85
05/08/2019, 1166.27, 1309514, 1172.01, 1180.4243, 1165.74
05/07/2019, 1174.1, 1551368, 1180.47, 1190.44, 1161.04
05/06/2019, 1189.39, 1563943, 1166.26, 1190.85, 1166.26
05/03/2019, 1185.4, 1980653, 1173.65, 1186.8, 1169
05/02/2019, 1162.61, 1944817, 1167.76, 1174.1895, 1155.0018
05/01/2019, 1168.08, 2642983, 1188.05, 1188.05, 1167.18
04/30/2019, 1188.48, 6194691, 1185, 1192.81, 1175
04/29/2019, 1287.58, 2412788, 1274, 1289.27, 1266.2949
04/26/2019, 1272.18, 1228276, 1269, 1273.07, 1260.32
04/25/2019, 1263.45, 1099614, 1264.77, 1267.4083, 1252.03
04/24/2019, 1256, 1015006, 1264.12, 1268.01, 1255
04/23/2019, 1264.55, 1271195, 1250.69, 1269, 1246.38
04/22/2019, 1248.84, 806577, 1235.99, 1249.09, 1228.31
04/18/2019, 1236.37, 1315676, 1239.18, 1242, 1234.61
04/17/2019, 1236.34, 1211866, 1233, 1240.56, 1227.82
04/16/2019, 1227.13, 855258, 1225, 1230.82, 1220.12
04/15/2019, 1221.1, 1187353, 1218, 1224.2, 1209.1101
04/12/2019, 1217.87, 926799, 1210, 1218.35, 1208.11
04/11/2019, 1204.62, 709417, 1203.96, 1207.96, 1200.13
04/10/2019, 1202.16, 724524, 1200.68, 1203.785, 1196.435
04/09/2019, 1197.25, 865416, 1196, 1202.29, 1193.08
04/08/2019, 1203.84, 859969, 1207.89, 1208.69, 1199.86
04/05/2019, 1207.15, 900950, 1214.99, 1216.22, 1205.03
04/04/2019, 1215, 949962, 1205.94, 1215.67, 1204.13
04/03/2019, 1205.92, 1014195, 1207.48, 1216.3, 1200.5
04/02/2019, 1200.49, 800820, 1195.32, 1201.35, 1185.71
04/01/2019, 1194.43, 1188235, 1184.1, 1196.66, 1182
03/29/2019, 1173.31, 1269573, 1174.9, 1178.99, 1162.88
03/28/2019, 1168.49, 966843, 1171.54, 1171.565, 1159.4312
03/27/2019, 1173.02, 1362217, 1185.5, 1187.559, 1159.37
03/26/2019, 1184.62, 1894639, 1198.53, 1202.83, 1176.72
03/25/2019, 1193, 1493841, 1196.93, 1206.3975, 1187.04
03/22/2019, 1205.5, 1668910, 1226.32, 1230, 1202.825
03/21/2019, 1231.54, 1195899, 1216, 1231.79, 1213.15
03/20/2019, 1223.97, 2089367, 1197.35, 1227.14, 1196.17
03/19/2019, 1198.85, 1404863, 1188.81, 1200, 1185.87
03/18/2019, 1184.26, 1212506, 1183.3, 1190, 1177.4211
03/15/2019, 1184.46, 2457597, 1193.38, 1196.57, 1182.61
03/14/2019, 1185.55, 1150950, 1194.51, 1197.88, 1184.48
03/13/2019, 1193.32, 1434816, 1200.645, 1200.93, 1191.94
03/12/2019, 1193.2, 2012306, 1178.26, 1200, 1178.26
03/11/2019, 1175.76, 1569332, 1144.45, 1176.19, 1144.45
03/08/2019, 1142.32, 1212271, 1126.73, 1147.08, 1123.3
03/07/2019, 1143.3, 1166076, 1155.72, 1156.755, 1134.91
03/06/2019, 1157.86, 1094100, 1162.49, 1167.5658, 1155.49
03/05/2019, 1162.03, 1422357, 1150.06, 1169.61, 1146.195
03/04/2019, 1147.8, 1444774, 1146.99, 1158.2804, 1130.69
03/01/2019, 1140.99, 1447454, 1124.9, 1142.97, 1124.75
02/28/2019, 1119.92, 1541068, 1111.3, 1127.65, 1111.01
02/27/2019, 1116.05, 968362, 1106.95, 1117.98, 1101
02/26/2019, 1115.13, 1469761, 1105.75, 1119.51, 1099.92
02/25/2019, 1109.4, 1395281, 1116, 1118.54, 1107.27
02/22/2019, 1110.37, 1048361, 1100.9, 1111.24, 1095.6
02/21/2019, 1096.97, 1414744, 1110.84, 1111.94, 1092.52
02/20/2019, 1113.8, 1080144, 1119.99, 1123.41, 1105.28
02/19/2019, 1118.56, 1046315, 1110, 1121.89, 1110
02/15/2019, 1113.65, 1442461, 1130.08, 1131.67, 1110.65
02/14/2019, 1121.67, 941678, 1118.05, 1128.23, 1110.445
02/13/2019, 1120.16, 1048630, 1124.99, 1134.73, 1118.5
02/12/2019, 1121.37, 1608658, 1106.8, 1125.295, 1105.85
02/11/2019, 1095.01, 1063825, 1096.95, 1105.945, 1092.86
02/08/2019, 1095.06, 1072031, 1087, 1098.91, 1086.55
02/07/2019, 1098.71, 2040615, 1104.16, 1104.84, 1086
02/06/2019, 1115.23, 2101674, 1139.57, 1147, 1112.77
02/05/2019, 1145.99, 3529974, 1124.84, 1146.85, 1117.248
02/04/2019, 1132.8, 2518184, 1112.66, 1132.8, 1109.02
02/01/2019, 1110.75, 1455609, 1112.4, 1125, 1104.89
01/31/2019, 1116.37, 1531463, 1103, 1117.33, 1095.41
01/30/2019, 1089.06, 1241760, 1068.43, 1091, 1066.85
01/29/2019, 1060.62, 1006731, 1072.68, 1075.15, 1055.8647
01/28/2019, 1070.08, 1277745, 1080.11, 1083, 1063.8
01/25/2019, 1090.99, 1114785, 1085, 1094, 1081.82
01/24/2019, 1073.9, 1317718, 1076.48, 1079.475, 1060.7
01/23/2019, 1075.57, 956526, 1077.35, 1084.93, 1059.75
01/22/2019, 1070.52, 1607398, 1088, 1091.51, 1063.47
01/18/2019, 1098.26, 1933754, 1100, 1108.352, 1090.9
01/17/2019, 1089.9, 1223674, 1079.47, 1091.8, 1073.5
01/16/2019, 1080.97, 1320530, 1080, 1092.375, 1079.34
01/15/2019, 1077.15, 1452238, 1050.17, 1080.05, 1047.34
01/14/2019, 1044.69, 1127417, 1046.92, 1051.53, 1041.255
01/11/2019, 1057.19, 1512651, 1063.18, 1063.775, 1048.48
01/10/2019, 1070.33, 1444976, 1067.66, 1071.15, 1057.71
01/09/2019, 1074.66, 1198369, 1081.65, 1082.63, 1066.4
01/08/2019, 1076.28, 1748371, 1076.11, 1084.56, 1060.53
01/07/2019, 1068.39, 1978077, 1071.5, 1073.9999, 1054.76
01/04/2019, 1070.71, 2080144, 1032.59, 1070.84, 1027.4179
01/03/2019, 1016.06, 1829379, 1041, 1056.98, 1014.07
01/02/2019, 1045.85, 1516681, 1016.57, 1052.32, 1015.71
12/31/2018, 1035.61, 1492541, 1050.96, 1052.7, 1023.59
12/28/2018, 1037.08, 1399218, 1049.62, 1055.56, 1033.1
12/27/2018, 1043.88, 2102069, 1017.15, 1043.89, 997
12/26/2018, 1039.46, 2337212, 989.01, 1040, 983
12/24/2018, 976.22, 1590328, 973.9, 1003.54, 970.11
12/21/2018, 979.54, 4560424, 1015.3, 1024.02, 973.69
12/20/2018, 1009.41, 2659047, 1018.13, 1034.22, 996.36
12/19/2018, 1023.01, 2419322, 1033.99, 1062, 1008.05
12/18/2018, 1028.71, 2101854, 1026.09, 1049.48, 1021.44
12/17/2018, 1016.53, 2337631, 1037.51, 1053.15, 1007.9
12/14/2018, 1042.1, 1685802, 1049.98, 1062.6, 1040.79
12/13/2018, 1061.9, 1329198, 1068.07, 1079.7597, 1053.93
12/12/2018, 1063.68, 1523276, 1068, 1081.65, 1062.79
12/11/2018, 1051.75, 1354751, 1056.49, 1060.6, 1039.84
12/10/2018, 1039.55, 1793465, 1035.05, 1048.45, 1023.29
12/07/2018, 1036.58, 2098526, 1060.01, 1075.26, 1028.5
12/06/2018, 1068.73, 2758098, 1034.26, 1071.2, 1030.7701
12/04/2018, 1050.82, 2278200, 1103.12, 1104.42, 1049.98
12/03/2018, 1106.43, 1900355, 1123.14, 1124.65, 1103.6645
11/30/2018, 1094.43, 2554416, 1089.07, 1095.57, 1077.88
11/29/2018, 1088.3, 1403540, 1076.08, 1094.245, 1076
11/28/2018, 1086.23, 2399374, 1048.76, 1086.84, 1035.76
11/27/2018, 1044.41, 1801334, 1041, 1057.58, 1038.49
11/26/2018, 1048.62, 1846430, 1038.35, 1049.31, 1033.91
11/23/2018, 1023.88, 691462, 1030, 1037.59, 1022.3992
11/21/2018, 1037.61, 1531676, 1036.76, 1048.56, 1033.47
11/20/2018, 1025.76, 2447254, 1000, 1031.74, 996.02
11/19/2018, 1020, 1837207, 1057.2, 1060.79, 1016.2601
11/16/2018, 1061.49, 1641232, 1059.41, 1067, 1048.98
11/15/2018, 1064.71, 1819132, 1044.71, 1071.85, 1031.78
11/14/2018, 1043.66, 1561656, 1050, 1054.5643, 1031
11/13/2018, 1036.05, 1496534, 1043.29, 1056.605, 1031.15
11/12/2018, 1038.63, 1429319, 1061.39, 1062.12, 1031
11/09/2018, 1066.15, 1343154, 1073.99, 1075.56, 1053.11
11/08/2018, 1082.4, 1463022, 1091.38, 1093.27, 1072.2048
11/07/2018, 1093.39, 2057155, 1069, 1095.46, 1065.9
11/06/2018, 1055.81, 1225197, 1039.48, 1064.345, 1038.07
11/05/2018, 1040.09, 2436742, 1055, 1058.47, 1021.24
11/02/2018, 1057.79, 1829295, 1073.73, 1082.975, 1054.61
11/01/2018, 1070, 1456222, 1075.8, 1083.975, 1062.46
10/31/2018, 1076.77, 2528584, 1059.81, 1091.94, 1057
10/30/2018, 1036.21, 3209126, 1008.46, 1037.49, 1000.75
10/29/2018, 1020.08, 3873644, 1082.47, 1097.04, 995.83
10/26/2018, 1071.47, 4185201, 1037.03, 1106.53, 1034.09
10/25/2018, 1095.57, 2511884, 1071.79, 1110.98, 1069.55
10/24/2018, 1050.71, 1910060, 1104.25, 1106.12, 1048.74
10/23/2018, 1103.69, 1847798, 1080.89, 1107.89, 1070
10/22/2018, 1101.16, 1494285, 1103.06, 1112.23, 1091
10/19/2018, 1096.46, 1264605, 1093.37, 1110.36, 1087.75
10/18/2018, 1087.97, 2056606, 1121.84, 1121.84, 1077.09
10/17/2018, 1115.69, 1397613, 1126.46, 1128.99, 1102.19
10/16/2018, 1121.28, 1845491, 1104.59, 1124.22, 1102.5
10/15/2018, 1092.25, 1343231, 1108.91, 1113.4464, 1089
10/12/2018, 1110.08, 2029872, 1108, 1115, 1086.402
10/11/2018, 1079.32, 2939514, 1072.94, 1106.4, 1068.27
10/10/2018, 1081.22, 2574985, 1131.08, 1132.17, 1081.13
10/09/2018, 1138.82, 1308706, 1146.15, 1154.35, 1137.572
10/08/2018, 1148.97, 1877142, 1150.11, 1168, 1127.3636
10/05/2018, 1157.35, 1184245, 1167.5, 1173.4999, 1145.12
10/04/2018, 1168.19, 2151762, 1195.33, 1197.51, 1155.576
10/03/2018, 1202.95, 1207280, 1205, 1206.41, 1193.83
10/02/2018, 1200.11, 1655602, 1190.96, 1209.96, 1186.63
10/01/2018, 1195.31, 1345250, 1199.89, 1209.9, 1190.3
09/28/2018, 1193.47, 1306822, 1191.87, 1195.41, 1184.5
09/27/2018, 1194.64, 1244278, 1186.73, 1202.1, 1183.63
09/26/2018, 1180.49, 1346434, 1185.15, 1194.23, 1174.765
09/25/2018, 1184.65, 937577, 1176.15, 1186.88, 1168
09/24/2018, 1173.37, 1218532, 1157.17, 1178, 1146.91
09/21/2018, 1166.09, 4363929, 1192, 1192.21, 1166.04
09/20/2018, 1186.87, 1209855, 1179.99, 1189.89, 1173.36
09/19/2018, 1171.09, 1185321, 1164.98, 1173.21, 1154.58
09/18/2018, 1161.22, 1184407, 1157.09, 1176.08, 1157.09
09/17/2018, 1156.05, 1279147, 1170.14, 1177.24, 1154.03
09/14/2018, 1172.53, 934300, 1179.1, 1180.425, 1168.3295
09/13/2018, 1175.33, 1402005, 1170.74, 1178.61, 1162.85
09/12/2018, 1162.82, 1291304, 1172.72, 1178.61, 1158.36
09/11/2018, 1177.36, 1209171, 1161.63, 1178.68, 1156.24
09/10/2018, 1164.64, 1115259, 1172.19, 1174.54, 1160.11
09/07/2018, 1164.83, 1401034, 1158.67, 1175.26, 1157.215
09/06/2018, 1171.44, 1886690, 1186.3, 1186.3, 1152
09/05/2018, 1186.48, 2043732, 1193.8, 1199.0096, 1162
09/04/2018, 1197, 1800509, 1204.27, 1212.99, 1192.5
08/31/2018, 1218.19, 1812366, 1234.98, 1238.66, 1211.2854
08/30/2018, 1239.12, 1320261, 1244.23, 1253.635, 1232.59
08/29/2018, 1249.3, 1295939, 1237.45, 1250.66, 1236.3588
08/28/2018, 1231.15, 1296532, 1241.29, 1242.545, 1228.69
08/27/2018, 1241.82, 1154962, 1227.6, 1243.09, 1225.716
08/24/2018, 1220.65, 946529, 1208.82, 1221.65, 1206.3588
08/23/2018, 1205.38, 988509, 1207.14, 1221.28, 1204.24
08/22/2018, 1207.33, 881463, 1200, 1211.84, 1199
08/21/2018, 1201.62, 1187884, 1208, 1217.26, 1200.3537
08/20/2018, 1207.77, 864462, 1205.02, 1211, 1194.6264
08/17/2018, 1200.96, 1381724, 1202.03, 1209.02, 1188.24
08/16/2018, 1206.49, 1319985, 1224.73, 1225.9999, 1202.55
08/15/2018, 1214.38, 1815642, 1229.26, 1235.24, 1209.51
08/14/2018, 1242.1, 1342534, 1235.19, 1245.8695, 1225.11
08/13/2018, 1235.01, 957153, 1236.98, 1249.2728, 1233.6405
08/10/2018, 1237.61, 1107323, 1243, 1245.695, 1232
08/09/2018, 1249.1, 805227, 1249.9, 1255.542, 1246.01
08/08/2018, 1245.61, 1369650, 1240.47, 1256.5, 1238.0083
08/07/2018, 1242.22, 1493073, 1237, 1251.17, 1236.17
08/06/2018, 1224.77, 1080923, 1225, 1226.0876, 1215.7965
08/03/2018, 1223.71, 1072524, 1229.62, 1230, 1215.06
08/02/2018, 1226.15, 1520488, 1205.9, 1229.88, 1204.79
08/01/2018, 1220.01, 1567142, 1228, 1233.47, 1210.21
07/31/2018, 1217.26, 1632823, 1220.01, 1227.5877, 1205.6
07/30/2018, 1219.74, 1822782, 1228.01, 1234.916, 1211.47
07/27/2018, 1238.5, 2115802, 1271, 1273.89, 1231
07/26/2018, 1268.33, 2334881, 1251, 1269.7707, 1249.02
07/25/2018, 1263.7, 2115890, 1239.13, 1265.86, 1239.13
07/24/2018, 1248.08, 3303268, 1262.59, 1266, 1235.56
07/23/2018, 1205.5, 2584034, 1181.01, 1206.49, 1181
07/20/2018, 1184.91, 1246898, 1186.96, 1196.86, 1184.22
07/19/2018, 1186.96, 1256113, 1191, 1200, 1183.32
07/18/2018, 1195.88, 1391232, 1196.56, 1204.5, 1190.34
07/17/2018, 1198.8, 1585091, 1172.22, 1203.04, 1170.6
07/16/2018, 1183.86, 1049560, 1189.39, 1191, 1179.28
07/13/2018, 1188.82, 1221687, 1185, 1195.4173, 1180
07/12/2018, 1183.48, 1251083, 1159.89, 1184.41, 1155.935
07/11/2018, 1153.9, 1094301, 1144.59, 1164.29, 1141.0003
07/10/2018, 1152.84, 789249, 1156.98, 1159.59, 1149.59
07/09/2018, 1154.05, 906073, 1148.48, 1154.67, 1143.42
07/06/2018, 1140.17, 966155, 1123.58, 1140.93, 1120.7371
07/05/2018, 1124.27, 1060752, 1110.53, 1127.5, 1108.48
07/03/2018, 1102.89, 679034, 1135.82, 1135.82, 1100.02
07/02/2018, 1127.46, 1188616, 1099, 1128, 1093.8
06/29/2018, 1115.65, 1275979, 1120, 1128.2265, 1115
06/28/2018, 1114.22, 1072438, 1102.09, 1122.31, 1096.01
06/27/2018, 1103.98, 1287698, 1121.34, 1131.8362, 1103.62
06/26/2018, 1118.46, 1559791, 1128, 1133.21, 1116.6589
06/25/2018, 1124.81, 2155276, 1143.6, 1143.91, 1112.78
06/22/2018, 1155.48, 1310164, 1159.14, 1162.4965, 1147.26
06/21/2018, 1157.66, 1232352, 1174.85, 1177.295, 1152.232
06/20/2018, 1169.84, 1648248, 1175.31, 1186.2856, 1169.16
06/19/2018, 1168.06, 1616125, 1158.5, 1171.27, 1154.01
06/18/2018, 1173.46, 1400641, 1143.65, 1174.31, 1143.59
06/15/2018, 1152.26, 2119134, 1148.86, 1153.42, 1143.485
06/14/2018, 1152.12, 1350085, 1143.85, 1155.47, 1140.64
06/13/2018, 1134.79, 1490017, 1141.12, 1146.5, 1133.38
06/12/2018, 1139.32, 899231, 1131.07, 1139.79, 1130.735
06/11/2018, 1129.99, 1071114, 1118.6, 1137.26, 1118.6
06/08/2018, 1120.87, 1289859, 1118.18, 1126.67, 1112.15
06/07/2018, 1123.86, 1519860, 1131.32, 1135.82, 1116.52
06/06/2018, 1136.88, 1697489, 1142.17, 1143, 1125.7429
06/05/2018, 1139.66, 1538169, 1140.99, 1145.738, 1133.19
06/04/2018, 1139.29, 1881046, 1122.33, 1141.89, 1122.005
06/01/2018, 1119.5, 2416755, 1099.35, 1120, 1098.5
05/31/2018, 1084.99, 3085325, 1067.56, 1097.19, 1067.56
05/30/2018, 1067.8, 1129958, 1063.03, 1069.21, 1056.83
05/29/2018, 1060.32, 1858676, 1064.89, 1073.37, 1055.22
05/25/2018, 1075.66, 878903, 1079.02, 1082.56, 1073.775
05/24/2018, 1079.24, 757752, 1079, 1080.47, 1066.15
05/23/2018, 1079.69, 1057712, 1065.13, 1080.78, 1061.71
05/22/2018, 1069.73, 1088700, 1083.56, 1086.59, 1066.69
05/21/2018, 1079.58, 1012258, 1074.06, 1088, 1073.65
05/18/2018, 1066.36, 1496448, 1061.86, 1069.94, 1060.68
05/17/2018, 1078.59, 1031190, 1079.89, 1086.87, 1073.5
05/16/2018, 1081.77, 989819, 1077.31, 1089.27, 1076.26
05/15/2018, 1079.23, 1494306, 1090, 1090.05, 1073.47
05/14/2018, 1100.2, 1450140, 1100, 1110.75, 1099.11
05/11/2018, 1098.26, 1253205, 1093.6, 1101.3295, 1090.91
05/10/2018, 1097.57, 1441456, 1086.03, 1100.44, 1085.64
05/09/2018, 1082.76, 2032319, 1058.1, 1085.44, 1056.365
05/08/2018, 1053.91, 1217260, 1058.54, 1060.55, 1047.145
05/07/2018, 1054.79, 1464008, 1049.23, 1061.68, 1047.1
05/04/2018, 1048.21, 1936797, 1016.9, 1048.51, 1016.9
05/03/2018, 1023.72, 1813623, 1019, 1029.675, 1006.29
05/02/2018, 1024.38, 1534094, 1028.1, 1040.389, 1022.87
05/01/2018, 1037.31, 1427171, 1013.66, 1038.47, 1008.21
04/30/2018, 1017.33, 1664084, 1030.01, 1037, 1016.85
04/27/2018, 1030.05, 1617452, 1046, 1049.5, 1025.59
04/26/2018, 1040.04, 1984448, 1029.51, 1047.98, 1018.19
04/25/2018, 1021.18, 2225495, 1025.52, 1032.49, 1015.31
04/24/2018, 1019.98, 4750851, 1052, 1057, 1010.59
04/23/2018, 1067.45, 2278846, 1077.86, 1082.72, 1060.7
04/20/2018, 1072.96, 1887698, 1082, 1092.35, 1069.57
04/19/2018, 1087.7, 1741907, 1069.4, 1094.165, 1068.18
04/18/2018, 1072.08, 1336678, 1077.43, 1077.43, 1066.225
04/17/2018, 1074.16, 2311903, 1051.37, 1077.88, 1048.26
04/16/2018, 1037.98, 1194144, 1037, 1043.24, 1026.74
04/13/2018, 1029.27, 1175754, 1040.88, 1046.42, 1022.98
04/12/2018, 1032.51, 1357599, 1025.04, 1040.69, 1021.4347
04/11/2018, 1019.97, 1476133, 1027.99, 1031.3641, 1015.87
04/10/2018, 1031.64, 1983510, 1026.44, 1036.28, 1011.34
04/09/2018, 1015.45, 1738682, 1016.8, 1039.6, 1014.08
04/06/2018, 1007.04, 1740896, 1020, 1031.42, 1003.03
04/05/2018, 1027.81, 1345681, 1041.33, 1042.79, 1020.1311
04/04/2018, 1025.14, 2464418, 993.41, 1028.7175, 993
04/03/2018, 1013.41, 2271858, 1013.91, 1020.99, 994.07
04/02/2018, 1006.47, 2679214, 1022.82, 1034.8, 990.37
03/29/2018, 1031.79, 2714402, 1011.63, 1043, 1002.9
03/28/2018, 1004.56, 3345046, 998, 1024.23, 980.64
03/27/2018, 1005.1, 3081612, 1063, 1064.8393, 996.92
03/26/2018, 1053.21, 2593808, 1046, 1055.63, 1008.4
03/23/2018, 1021.57, 2147097, 1047.03, 1063.36, 1021.22
03/22/2018, 1049.08, 2584639, 1081.88, 1082.9, 1045.91
03/21/2018, 1090.88, 1878294, 1092.74, 1106.2999, 1085.15
03/20/2018, 1097.71, 1802209, 1099, 1105.2, 1083.46
03/19/2018, 1099.82, 2355186, 1120.01, 1121.99, 1089.01
03/16/2018, 1135.73, 2614871, 1154.14, 1155.88, 1131.96
03/15/2018, 1149.58, 1397767, 1149.96, 1161.08, 1134.54
03/14/2018, 1149.49, 1290638, 1145.21, 1158.59, 1141.44
03/13/2018, 1138.17, 1874176, 1170, 1176.76, 1133.33
03/12/2018, 1164.5, 2106548, 1163.85, 1177.05, 1157.42
03/09/2018, 1160.04, 2121425, 1136, 1160.8, 1132.4606
03/08/2018, 1126, 1393529, 1115.32, 1127.6, 1112.8
03/07/2018, 1109.64, 1277439, 1089.19, 1112.22, 1085.4823
03/06/2018, 1095.06, 1497087, 1099.22, 1101.85, 1089.775
03/05/2018, 1090.93, 1141932, 1075.14, 1097.1, 1069.0001
03/02/2018, 1078.92, 2271394, 1053.08, 1081.9986, 1048.115
03/01/2018, 1069.52, 2511872, 1107.87, 1110.12, 1067.001
02/28/2018, 1104.73, 1873737, 1123.03, 1127.53, 1103.24
02/27/2018, 1118.29, 1772866, 1141.24, 1144.04, 1118
02/26/2018, 1143.75, 1514920, 1127.8, 1143.96, 1126.695
02/23/2018, 1126.79, 1190432, 1112.64, 1127.28, 1104.7135
02/22/2018, 1106.63, 1309536, 1116.19, 1122.82, 1102.59
02/21/2018, 1111.34, 1507152, 1106.47, 1133.97, 1106.33
02/20/2018, 1102.46, 1389491, 1090.57, 1113.95, 1088.52
02/16/2018, 1094.8, 1680283, 1088.41, 1104.67, 1088.3134
02/15/2018, 1089.52, 1785552, 1079.07, 1091.4794, 1064.34
02/14/2018, 1069.7, 1547665, 1048.95, 1071.72, 1046.75
02/13/2018, 1052.1, 1213800, 1045, 1058.37, 1044.0872
02/12/2018, 1051.94, 2054002, 1048, 1061.5, 1040.928
02/09/2018, 1037.78, 3503970, 1017.25, 1043.97, 992.56
02/08/2018, 1001.52, 2809890, 1055.41, 1058.62, 1000.66
02/07/2018, 1048.58, 2353003, 1081.54, 1081.78, 1048.26
02/06/2018, 1080.6, 3432313, 1027.18, 1081.71, 1023.1367
02/05/2018, 1055.8, 3769453, 1090.6, 1110, 1052.03
02/02/2018, 1111.9, 4837979, 1122, 1123.07, 1107.2779
02/01/2018, 1167.7, 2380221, 1162.61, 1174, 1157.52
01/31/2018, 1169.94, 1523820, 1170.57, 1173, 1159.13
01/30/2018, 1163.69, 1541771, 1167.83, 1176.52, 1163.52
01/29/2018, 1175.58, 1337324, 1176.48, 1186.89, 1171.98
01/26/2018, 1175.84, 1981173, 1175.08, 1175.84, 1158.11
01/25/2018, 1170.37, 1461518, 1172.53, 1175.94, 1162.76
01/24/2018, 1164.24, 1382904, 1177.33, 1179.86, 1161.05
01/23/2018, 1169.97, 1309862, 1159.85, 1171.6266, 1158.75
01/22/2018, 1155.81, 1616120, 1137.49, 1159.88, 1135.1101
01/19/2018, 1137.51, 1390118, 1131.83, 1137.86, 1128.3
01/18/2018, 1129.79, 1194943, 1131.41, 1132.51, 1117.5
01/17/2018, 1131.98, 1200476, 1126.22, 1132.6, 1117.01
01/16/2018, 1121.76, 1566662, 1132.51, 1139.91, 1117.8316
01/12/2018, 1122.26, 1718491, 1102.41, 1124.29, 1101.15
01/11/2018, 1105.52, 977727, 1106.3, 1106.525, 1099.59
01/10/2018, 1102.61, 1042273, 1097.1, 1104.6, 1096.11
01/09/2018, 1106.26, 900089, 1109.4, 1110.57, 1101.2307
01/08/2018, 1106.94, 1046767, 1102.23, 1111.27, 1101.62
01/05/2018, 1102.23, 1279990, 1094, 1104.25, 1092
01/04/2018, 1086.4, 1002945, 1088, 1093.5699, 1084.0017
01/03/2018, 1082.48, 1429757, 1064.31, 1086.29, 1063.21
01/02/2018, 1065, 1236401, 1048.34, 1066.94, 1045.23
12/29/2017, 1046.4, 886845, 1046.72, 1049.7, 1044.9
12/28/2017, 1048.14, 833011, 1051.6, 1054.75, 1044.77
12/27/2017, 1049.37, 1271780, 1057.39, 1058.37, 1048.05
12/26/2017, 1056.74, 761097, 1058.07, 1060.12, 1050.2
12/22/2017, 1060.12, 755089, 1061.11, 1064.2, 1059.44
12/21/2017, 1063.63, 986548, 1064.95, 1069.33, 1061.7938
12/20/2017, 1064.95, 1268285, 1071.78, 1073.38, 1061.52
12/19/2017, 1070.68, 1307894, 1075.2, 1076.84, 1063.55
12/18/2017, 1077.14, 1552016, 1066.08, 1078.49, 1062
12/15/2017, 1064.19, 3275091, 1054.61, 1067.62, 1049.5
12/14/2017, 1049.15, 1558684, 1045, 1058.5, 1043.11
12/13/2017, 1040.61, 1220364, 1046.12, 1046.665, 1038.38
12/12/2017, 1040.48, 1279511, 1039.63, 1050.31, 1033.6897
12/11/2017, 1041.1, 1190527, 1035.5, 1043.8, 1032.0504
12/08/2017, 1037.05, 1288419, 1037.49, 1042.05, 1032.5222
12/07/2017, 1030.93, 1458145, 1020.43, 1034.24, 1018.071
12/06/2017, 1018.38, 1258496, 1001.5, 1024.97, 1001.14
12/05/2017, 1005.15, 2066247, 995.94, 1020.61, 988.28
12/04/2017, 998.68, 1906058, 1012.66, 1016.1, 995.57
12/01/2017, 1010.17, 1908962, 1015.8, 1022.4897, 1002.02
11/30/2017, 1021.41, 1723003, 1022.37, 1028.4899, 1015
11/29/2017, 1021.66, 2442974, 1042.68, 1044.08, 1015.65
11/28/2017, 1047.41, 1421027, 1055.09, 1062.375, 1040
11/27/2017, 1054.21, 1307471, 1040, 1055.46, 1038.44
11/24/2017, 1040.61, 536996, 1035.87, 1043.178, 1035
11/22/2017, 1035.96, 746351, 1035, 1039.706, 1031.43
11/21/2017, 1034.49, 1096161, 1023.31, 1035.11, 1022.655
11/20/2017, 1018.38, 898389, 1020.26, 1022.61, 1017.5
11/17/2017, 1019.09, 1366936, 1034.01, 1034.42, 1017.75
11/16/2017, 1032.5, 1129424, 1022.52, 1035.92, 1022.52
11/15/2017, 1020.91, 847932, 1019.21, 1024.09, 1015.42
11/14/2017, 1026, 958708, 1022.59, 1026.81, 1014.15
11/13/2017, 1025.75, 885565, 1023.42, 1031.58, 1022.57
11/10/2017, 1028.07, 720674, 1026.46, 1030.76, 1025.28
11/09/2017, 1031.26, 1244701, 1033.99, 1033.99, 1019.6656
11/08/2017, 1039.85, 1088395, 1030.52, 1043.522, 1028.45
11/07/2017, 1033.33, 1112123, 1027.27, 1033.97, 1025.13
11/06/2017, 1025.9, 1124757, 1028.99, 1034.87, 1025
11/03/2017, 1032.48, 1075134, 1022.11, 1032.65, 1020.31
11/02/2017, 1025.58, 1048584, 1021.76, 1028.09, 1013.01
11/01/2017, 1025.5, 1371619, 1017.21, 1029.67, 1016.95
10/31/2017, 1016.64, 1331265, 1015.22, 1024, 1010.42
10/30/2017, 1017.11, 2083490, 1014, 1024.97, 1007.5
10/27/2017, 1019.27, 5165922, 1009.19, 1048.39, 1008.2
10/26/2017, 972.56, 2027218, 980, 987.6, 972.2
10/25/2017, 973.33, 1210368, 968.37, 976.09, 960.5201
10/24/2017, 970.54, 1206074, 970, 972.23, 961
10/23/2017, 968.45, 1471544, 989.52, 989.52, 966.12
10/20/2017, 988.2, 1176177, 989.44, 991, 984.58
10/19/2017, 984.45, 1312706, 986, 988.88, 978.39
10/18/2017, 992.81, 1057285, 991.77, 996.72, 986.9747
10/17/2017, 992.18, 1290152, 990.29, 996.44, 988.59
10/16/2017, 992, 910246, 992.1, 993.9065, 984
10/13/2017, 989.68, 1169584, 992, 997.21, 989
10/12/2017, 987.83, 1278357, 987.45, 994.12, 985
10/11/2017, 989.25, 1692843, 973.72, 990.71, 972.25
10/10/2017, 972.6, 968113, 980, 981.57, 966.0801
10/09/2017, 977, 890620, 980, 985.425, 976.11
10/06/2017, 978.89, 1146207, 966.7, 979.46, 963.36
10/05/2017, 969.96, 1210427, 955.49, 970.91, 955.18
10/04/2017, 951.68, 951766, 957, 960.39, 950.69
10/03/2017, 957.79, 888303, 954, 958, 949.14
10/02/2017, 953.27, 1282850, 959.98, 962.54, 947.84
09/29/2017, 959.11, 1576365, 952, 959.7864, 951.51
09/28/2017, 949.5, 997036, 941.36, 950.69, 940.55
09/27/2017, 944.49, 2237538, 927.74, 949.9, 927.74
09/26/2017, 924.86, 1666749, 923.72, 930.82, 921.14
09/25/2017, 920.97, 1855742, 925.45, 926.4, 909.7
09/22/2017, 928.53, 1052170, 927.75, 934.73, 926.48
09/21/2017, 932.45, 1227059, 933, 936.53, 923.83
09/20/2017, 931.58, 1535626, 922.98, 933.88, 922
09/19/2017, 921.81, 912967, 917.42, 922.4199, 912.55
09/18/2017, 915, 1300759, 920.01, 922.08, 910.6
09/15/2017, 920.29, 2499466, 924.66, 926.49, 916.36
09/14/2017, 925.11, 1395497, 931.25, 932.77, 924
09/13/2017, 935.09, 1101145, 930.66, 937.25, 929.86
09/12/2017, 932.07, 1133638, 932.59, 933.48, 923.861
09/11/2017, 929.08, 1266020, 934.25, 938.38, 926.92
09/08/2017, 926.5, 997699, 936.49, 936.99, 924.88
09/07/2017, 935.95, 1211472, 931.73, 936.41, 923.62
09/06/2017, 927.81, 1526209, 930.15, 930.915, 919.27
09/05/2017, 928.45, 1346791, 933.08, 937, 921.96
09/01/2017, 937.34, 943657, 941.13, 942.48, 935.15
08/31/2017, 939.33, 1566888, 931.76, 941.98, 931.76
08/30/2017, 929.57, 1300616, 920.05, 930.819, 919.65
08/29/2017, 921.29, 1181391, 905.1, 923.33, 905
08/28/2017, 913.81, 1085014, 916, 919.245, 911.87
08/25/2017, 915.89, 1052764, 923.49, 925.555, 915.5
08/24/2017, 921.28, 1266191, 928.66, 930.84, 915.5
08/23/2017, 927, 1088575, 921.93, 929.93, 919.36
08/22/2017, 924.69, 1166320, 912.72, 925.86, 911.4751
08/21/2017, 906.66, 942328, 910, 913, 903.4
08/18/2017, 910.67, 1341990, 910.31, 915.275, 907.1543
08/17/2017, 910.98, 1241782, 925.78, 926.86, 910.98
08/16/2017, 926.96, 1005261, 925.29, 932.7, 923.445
08/15/2017, 922.22, 882479, 924.23, 926.5499, 919.82
08/14/2017, 922.67, 1063404, 922.53, 924.668, 918.19
08/11/2017, 914.39, 1205652, 907.97, 917.78, 905.58
08/10/2017, 907.24, 1755521, 917.55, 919.26, 906.13
08/09/2017, 922.9, 1191332, 920.61, 925.98, 917.2501
08/08/2017, 926.79, 1057351, 927.09, 935.814, 925.6095
08/07/2017, 929.36, 1031710, 929.06, 931.7, 926.5
08/04/2017, 927.96, 1081814, 926.75, 930.3068, 923.03
08/03/2017, 923.65, 1201519, 930.34, 932.24, 922.24
08/02/2017, 930.39, 1822272, 928.61, 932.6, 916.68
08/01/2017, 930.83, 1234612, 932.38, 937.447, 929.26
07/31/2017, 930.5, 1964748, 941.89, 943.59, 926.04
07/28/2017, 941.53, 1802343, 929.4, 943.83, 927.5
07/27/2017, 934.09, 3128819, 951.78, 951.78, 920
07/26/2017, 947.8, 2069349, 954.68, 955, 942.2788
07/25/2017, 950.7, 4656609, 953.81, 959.7, 945.4
07/24/2017, 980.34, 3205374, 972.22, 986.2, 970.77
07/21/2017, 972.92, 1697190, 962.25, 973.23, 960.15
07/20/2017, 968.15, 1620636, 975, 975.9, 961.51
07/19/2017, 970.89, 1221155, 967.84, 973.04, 964.03
07/18/2017, 965.4, 1152741, 953, 968.04, 950.6
07/17/2017, 953.42, 1164141, 957, 960.74, 949.2407
07/14/2017, 955.99, 1052855, 952, 956.91, 948.005
07/13/2017, 947.16, 1294674, 946.29, 954.45, 943.01
07/12/2017, 943.83, 1517168, 938.68, 946.3, 934.47
07/11/2017, 930.09, 1112417, 929.54, 931.43, 922
07/10/2017, 928.8, 1190237, 921.77, 930.38, 919.59
07/07/2017, 918.59, 1590456, 908.85, 921.54, 908.85
07/06/2017, 906.69, 1424290, 904.12, 914.9444, 899.7
07/05/2017, 911.71, 1813309, 901.76, 914.51, 898.5
07/03/2017, 898.7, 1710373, 912.18, 913.94, 894.79
06/30/2017, 908.73, 2086340, 926.05, 926.05, 908.31
06/29/2017, 917.79, 3287991, 929.92, 931.26, 910.62
06/28/2017, 940.49, 2719213, 929, 942.75, 916
06/27/2017, 927.33, 2566047, 942.46, 948.29, 926.85
06/26/2017, 952.27, 1596664, 969.9, 973.31, 950.79
06/23/2017, 965.59, 1527513, 956.83, 966, 954.2
06/22/2017, 957.09, 941639, 958.7, 960.72, 954.55
06/21/2017, 959.45, 1201971, 953.64, 960.1, 950.76
06/20/2017, 950.63, 1125520, 957.52, 961.62, 950.01
06/19/2017, 957.37, 1520715, 949.96, 959.99, 949.05
06/16/2017, 939.78, 3061794, 940, 942.04, 931.595
06/15/2017, 942.31, 2065271, 933.97, 943.339, 924.44
06/14/2017, 950.76, 1487378, 959.92, 961.15, 942.25
06/13/2017, 953.4, 2012980, 951.91, 959.98, 944.09
06/12/2017, 942.9, 3762434, 939.56, 949.355, 915.2328
06/09/2017, 949.83, 3305545, 984.5, 984.5, 935.63
06/08/2017, 983.41, 1477151, 982.35, 984.57, 977.2
06/07/2017, 981.08, 1447172, 979.65, 984.15, 975.77
06/06/2017, 976.57, 1814323, 983.16, 988.25, 975.14
06/05/2017, 983.68, 1251903, 976.55, 986.91, 975.1
06/02/2017, 975.6, 1750723, 969.46, 975.88, 966
06/01/2017, 966.95, 1408958, 968.95, 971.5, 960.01
05/31/2017, 964.86, 2447176, 975.02, 979.27, 960.18
05/30/2017, 975.88, 1466288, 970.31, 976.2, 969.49
05/26/2017, 971.47, 1251425, 969.7, 974.98, 965.03
05/25/2017, 969.54, 1659422, 957.33, 972.629, 955.47
05/24/2017, 954.96, 1031408, 952.98, 955.09, 949.5
05/23/2017, 948.82, 1269438, 947.92, 951.4666, 942.575
05/22/2017, 941.86, 1118456, 935, 941.8828, 935
05/19/2017, 934.01, 1389848, 931.47, 937.755, 931
05/18/2017, 930.24, 1596058, 921, 933.17, 918.75
05/17/2017, 919.62, 2357922, 935.67, 939.3325, 918.14
05/16/2017, 943, 968288, 940, 943.11, 937.58
05/15/2017, 937.08, 1104595, 932.95, 938.25, 929.34
05/12/2017, 932.22, 1050377, 931.53, 933.44, 927.85
05/11/2017, 930.6, 834997, 925.32, 932.53, 923.0301
05/10/2017, 928.78, 1173887, 931.98, 932, 925.16
05/09/2017, 932.17, 1581236, 936.95, 937.5, 929.53
05/08/2017, 934.3, 1328885, 926.12, 936.925, 925.26
05/05/2017, 927.13, 1910317, 933.54, 934.9, 925.2
05/04/2017, 931.66, 1421938, 926.07, 935.93, 924.59
05/03/2017, 927.04, 1497565, 914.86, 928.1, 912.5426
05/02/2017, 916.44, 1543696, 909.62, 920.77, 909.4526
05/01/2017, 912.57, 2114629, 901.94, 915.68, 901.45
04/28/2017, 905.96, 3223850, 910.66, 916.85, 905.77
04/27/2017, 874.25, 2009509, 873.6, 875.4, 870.38
04/26/2017, 871.73, 1233724, 874.23, 876.05, 867.7481
04/25/2017, 872.3, 1670095, 865, 875, 862.81
04/24/2017, 862.76, 1371722, 851.2, 863.45, 849.86
04/21/2017, 843.19, 1323364, 842.88, 843.88, 840.6
04/20/2017, 841.65, 957994, 841.44, 845.2, 839.32
04/19/2017, 838.21, 954324, 839.79, 842.22, 836.29
04/18/2017, 836.82, 835433, 834.22, 838.93, 832.71
04/17/2017, 837.17, 894540, 825.01, 837.75, 824.47
04/13/2017, 823.56, 1118221, 822.14, 826.38, 821.44
04/12/2017, 824.32, 900059, 821.93, 826.66, 821.02
04/11/2017, 823.35, 1078951, 824.71, 827.4267, 817.0201
04/10/2017, 824.73, 978825, 825.39, 829.35, 823.77
04/07/2017, 824.67, 1056692, 827.96, 828.485, 820.5127
04/06/2017, 827.88, 1254235, 832.4, 836.39, 826.46
04/05/2017, 831.41, 1553163, 835.51, 842.45, 830.72
04/04/2017, 834.57, 1044455, 831.36, 835.18, 829.0363
04/03/2017, 838.55, 1670349, 829.22, 840.85, 829.22
03/31/2017, 829.56, 1401756, 828.97, 831.64, 827.39
03/30/2017, 831.5, 1055263, 833.5, 833.68, 829
03/29/2017, 831.41, 1785006, 825, 832.765, 822.3801
03/28/2017, 820.92, 1620532, 820.41, 825.99, 814.027
03/27/2017, 819.51, 1894735, 806.95, 821.63, 803.37
03/24/2017, 814.43, 1980415, 820.08, 821.93, 808.89
03/23/2017, 817.58, 3485390, 821, 822.57, 812.257
03/22/2017, 829.59, 1399409, 831.91, 835.55, 827.1801
03/21/2017, 830.46, 2461375, 851.4, 853.5, 829.02
03/20/2017, 848.4, 1217560, 850.01, 850.22, 845.15
03/17/2017, 852.12, 1712397, 851.61, 853.4, 847.11
03/16/2017, 848.78, 977384, 849.03, 850.85, 846.13
03/15/2017, 847.2, 1381328, 847.59, 848.63, 840.77
03/14/2017, 845.62, 779920, 843.64, 847.24, 840.8
03/13/2017, 845.54, 1149928, 844, 848.685, 843.25
03/10/2017, 843.25, 1702731, 843.28, 844.91, 839.5
03/09/2017, 838.68, 1261393, 836, 842, 834.21
03/08/2017, 835.37, 988900, 833.51, 838.15, 831.79
03/07/2017, 831.91, 1037573, 827.4, 833.41, 826.52
03/06/2017, 827.78, 1108799, 826.95, 828.88, 822.4
03/03/2017, 829.08, 890640, 830.56, 831.36, 825.751
03/02/2017, 830.63, 937824, 833.85, 834.51, 829.64
03/01/2017, 835.24, 1495934, 828.85, 836.255, 827.26
02/28/2017, 823.21, 2258695, 825.61, 828.54, 820.2
02/27/2017, 829.28, 1101120, 824.55, 830.5, 824
02/24/2017, 828.64, 1392039, 827.73, 829, 824.2
02/23/2017, 831.33, 1471342, 830.12, 832.46, 822.88
02/22/2017, 830.76, 983058, 828.66, 833.25, 828.64
02/21/2017, 831.66, 1259841, 828.66, 833.45, 828.35
02/17/2017, 828.07, 1602549, 823.02, 828.07, 821.655
02/16/2017, 824.16, 1285919, 819.93, 824.4, 818.98
02/15/2017, 818.98, 1311316, 819.36, 823, 818.47
02/14/2017, 820.45, 1054472, 819, 823, 816
02/13/2017, 819.24, 1205835, 816, 820.959, 815.49
02/10/2017, 813.67, 1134701, 811.7, 815.25, 809.78
02/09/2017, 809.56, 990260, 809.51, 810.66, 804.54
02/08/2017, 808.38, 1155892, 807, 811.84, 803.1903
02/07/2017, 806.97, 1240257, 803.99, 810.5, 801.78
02/06/2017, 801.34, 1182882, 799.7, 801.67, 795.2501
02/03/2017, 801.49, 1461217, 802.99, 806, 800.37
02/02/2017, 798.53, 1530827, 793.8, 802.7, 792
02/01/2017, 795.695, 2027708, 799.68, 801.19, 791.19
01/31/2017, 796.79, 2153957, 796.86, 801.25, 790.52
01/30/2017, 802.32, 3243568, 814.66, 815.84, 799.8
01/27/2017, 823.31, 2964989, 834.71, 841.95, 820.44
01/26/2017, 832.15, 2944642, 837.81, 838, 827.01
01/25/2017, 835.67, 1612854, 829.62, 835.77, 825.06
01/24/2017, 823.87, 1472228, 822.3, 825.9, 817.821
01/23/2017, 819.31, 1962506, 807.25, 820.87, 803.74
01/20/2017, 805.02, 1668638, 806.91, 806.91, 801.69
01/19/2017, 802.175, 917085, 805.12, 809.48, 801.8
01/18/2017, 806.07, 1293893, 805.81, 806.205, 800.99
01/17/2017, 804.61, 1361935, 807.08, 807.14, 800.37
01/13/2017, 807.88, 1098154, 807.48, 811.2244, 806.69
01/12/2017, 806.36, 1352872, 807.14, 807.39, 799.17
01/11/2017, 807.91, 1065360, 805, 808.15, 801.37
01/10/2017, 804.79, 1176637, 807.86, 809.1299, 803.51
01/09/2017, 806.65, 1274318, 806.4, 809.9664, 802.83
01/06/2017, 806.15, 1639246, 795.26, 807.9, 792.2041
01/05/2017, 794.02, 1334028, 786.08, 794.48, 785.02
01/04/2017, 786.9, 1071198, 788.36, 791.34, 783.16
01/03/2017, 786.14, 1657291, 778.81, 789.63, 775.8
12/30/2016, 771.82, 1769809, 782.75, 782.78, 770.41
12/29/2016, 782.79, 743808, 783.33, 785.93, 778.92
12/28/2016, 785.05, 1142148, 793.7, 794.23, 783.2
12/27/2016, 791.55, 789151, 790.68, 797.86, 787.657
12/23/2016, 789.91, 623682, 790.9, 792.74, 787.28
12/22/2016, 791.26, 972147, 792.36, 793.32, 788.58
12/21/2016, 794.56, 1208770, 795.84, 796.6757, 787.1
12/20/2016, 796.42, 950345, 796.76, 798.65, 793.27
12/19/2016, 794.2, 1231966, 790.22, 797.66, 786.27
12/16/2016, 790.8, 2435100, 800.4, 800.8558, 790.29
12/15/2016, 797.85, 1623709, 797.34, 803, 792.92
12/14/2016, 797.07, 1700875, 797.4, 804, 794.01
12/13/2016, 796.1, 2122735, 793.9, 804.3799, 793.34
12/12/2016, 789.27, 2102288, 785.04, 791.25, 784.3554
12/09/2016, 789.29, 1821146, 780, 789.43, 779.021
12/08/2016, 776.42, 1487517, 772.48, 778.18, 767.23
12/07/2016, 771.19, 1757710, 761, 771.36, 755.8
12/06/2016, 759.11, 1690365, 764.73, 768.83, 757.34
12/05/2016, 762.52, 1393566, 757.71, 763.9, 752.9
12/02/2016, 750.5, 1452181, 744.59, 754, 743.1
12/01/2016, 747.92, 3017001, 757.44, 759.85, 737.0245
11/30/2016, 758.04, 2386628, 770.07, 772.99, 754.83
11/29/2016, 770.84, 1616427, 771.53, 778.5, 768.24
11/28/2016, 768.24, 2177039, 760, 779.53, 759.8
11/25/2016, 761.68, 587421, 764.26, 765, 760.52
11/23/2016, 760.99, 1477501, 767.73, 768.2825, 755.25
11/22/2016, 768.27, 1592372, 772.63, 776.96, 767
11/21/2016, 769.2, 1324431, 762.61, 769.7, 760.6
11/18/2016, 760.54, 1528555, 771.37, 775, 760
11/17/2016, 771.23, 1298484, 766.92, 772.7, 764.23
11/16/2016, 764.48, 1468196, 755.2, 766.36, 750.51
11/15/2016, 758.49, 2375056, 746.97, 764.4162, 746.97
11/14/2016, 736.08, 3644965, 755.6, 757.85, 727.54
11/11/2016, 754.02, 2421889, 756.54, 760.78, 750.38
11/10/2016, 762.56, 4733916, 791.17, 791.17, 752.18
11/09/2016, 785.31, 2603860, 779.94, 791.2265, 771.67
11/08/2016, 790.51, 1361472, 783.4, 795.633, 780.19
11/07/2016, 782.52, 1574426, 774.5, 785.19, 772.55
11/04/2016, 762.02, 2131948, 750.66, 770.36, 750.5611
11/03/2016, 762.13, 1933937, 767.25, 769.95, 759.03
11/02/2016, 768.7, 1905814, 778.2, 781.65, 763.4496
11/01/2016, 783.61, 2404898, 782.89, 789.49, 775.54
10/31/2016, 784.54, 2420892, 795.47, 796.86, 784
10/28/2016, 795.37, 4261912, 808.35, 815.49, 793.59
10/27/2016, 795.35, 2723097, 801, 803.49, 791.5
10/26/2016, 799.07, 1645403, 806.34, 806.98, 796.32
10/25/2016, 807.67, 1575020, 816.68, 816.68, 805.14
10/24/2016, 813.11, 1693162, 804.9, 815.18, 804.82
10/21/2016, 799.37, 1262042, 795, 799.5, 794
10/20/2016, 796.97, 1755546, 803.3, 803.97, 796.03
10/19/2016, 801.56, 1762990, 798.86, 804.63, 797.635
10/18/2016, 795.26, 2046338, 787.85, 801.61, 785.565
10/17/2016, 779.96, 1091524, 779.8, 785.85, 777.5
10/14/2016, 778.53, 851512, 781.65, 783.95, 776
10/13/2016, 778.19, 1360619, 781.22, 781.22, 773
10/12/2016, 786.14, 935138, 783.76, 788.13, 782.06
10/11/2016, 783.07, 1371461, 786.66, 792.28, 780.58
10/10/2016, 785.94, 1161410, 777.71, 789.38, 775.87
10/07/2016, 775.08, 932444, 779.66, 779.66, 770.75
10/06/2016, 776.86, 1066910, 779, 780.48, 775.54
10/05/2016, 776.47, 1457661, 779.31, 782.07, 775.65
10/04/2016, 776.43, 1198361, 776.03, 778.71, 772.89
10/03/2016, 772.56, 1276614, 774.25, 776.065, 769.5
09/30/2016, 777.29, 1583293, 776.33, 780.94, 774.09
09/29/2016, 775.01, 1310252, 781.44, 785.8, 774.232
09/28/2016, 781.56, 1108249, 777.85, 781.81, 774.97
09/27/2016, 783.01, 1152760, 775.5, 785.9899, 774.308
09/26/2016, 774.21, 1531788, 782.74, 782.74, 773.07
09/23/2016, 786.9, 1411439, 786.59, 788.93, 784.15
09/22/2016, 787.21, 1483899, 780, 789.85, 778.44
09/21/2016, 776.22, 1166290, 772.66, 777.16, 768.301
09/20/2016, 771.41, 975434, 769, 773.33, 768.53
09/19/2016, 765.7, 1171969, 772.42, 774, 764.4406
09/16/2016, 768.88, 2047036, 769.75, 769.75, 764.66
09/15/2016, 771.76, 1344945, 762.89, 773.8, 759.96
09/14/2016, 762.49, 1093723, 759.61, 767.68, 759.11
09/13/2016, 759.69, 1394158, 764.48, 766.2195, 755.8
09/12/2016, 769.02, 1310493, 755.13, 770.29, 754.0001
09/09/2016, 759.66, 1879903, 770.1, 773.245, 759.66
09/08/2016, 775.32, 1268663, 778.59, 780.35, 773.58
09/07/2016, 780.35, 893874, 780, 782.73, 776.2
09/06/2016, 780.08, 1441864, 773.45, 782, 771
09/02/2016, 771.46, 1070725, 773.01, 773.9199, 768.41
09/01/2016, 768.78, 925019, 769.25, 771.02, 764.3
08/31/2016, 767.05, 1247937, 767.01, 769.09, 765.38
08/30/2016, 769.09, 1129932, 769.33, 774.466, 766.84
08/29/2016, 772.15, 847537, 768.74, 774.99, 766.615
08/26/2016, 769.54, 1164713, 769, 776.0799, 765.85
08/25/2016, 769.41, 926856, 767, 771.89, 763.1846
08/24/2016, 769.64, 1071569, 770.58, 774.5, 767.07
08/23/2016, 772.08, 925356, 775.48, 776.44, 771.785
08/22/2016, 772.15, 950417, 773.27, 774.54, 770.0502
08/19/2016, 775.42, 860899, 775, 777.1, 773.13
08/18/2016, 777.5, 718882, 780.01, 782.86, 777
08/17/2016, 779.91, 921666, 777.32, 780.81, 773.53
08/16/2016, 777.14, 1027836, 780.3, 780.98, 773.444
08/15/2016, 782.44, 938183, 783.75, 787.49, 780.11
08/12/2016, 783.22, 739761, 781.5, 783.395, 780.4
08/11/2016, 784.85, 971742, 785, 789.75, 782.97
08/10/2016, 784.68, 784559, 783.75, 786.8123, 782.778
08/09/2016, 784.26, 1318457, 781.1, 788.94, 780.57
08/08/2016, 781.76, 1106693, 782, 782.63, 778.091
08/05/2016, 782.22, 1799478, 773.78, 783.04, 772.34
08/04/2016, 771.61, 1139972, 772.22, 774.07, 768.795
08/03/2016, 773.18, 1283186, 767.18, 773.21, 766.82
08/02/2016, 771.07, 1782822, 768.69, 775.84, 767.85
08/01/2016, 772.88, 2697699, 761.09, 780.43, 761.09
07/29/2016, 768.79, 3830103, 772.71, 778.55, 766.77
07/28/2016, 745.91, 3473040, 747.04, 748.65, 739.3
07/27/2016, 741.77, 1509133, 738.28, 744.46, 737
07/26/2016, 738.42, 1182993, 739.04, 741.69, 734.27
07/25/2016, 739.77, 1031643, 740.67, 742.61, 737.5
07/22/2016, 742.74, 1256741, 741.86, 743.24, 736.56
07/21/2016, 738.63, 1022229, 740.36, 741.69, 735.831
07/20/2016, 741.19, 1283931, 737.33, 742.13, 737.1
07/19/2016, 736.96, 1225467, 729.89, 736.99, 729
07/18/2016, 733.78, 1284740, 722.71, 736.13, 721.19
07/15/2016, 719.85, 1277514, 725.73, 725.74, 719.055
07/14/2016, 720.95, 949456, 721.58, 722.21, 718.03
07/13/2016, 716.98, 933352, 723.62, 724, 716.85
07/12/2016, 720.64, 1336112, 719.12, 722.94, 715.91
07/11/2016, 715.09, 1107039, 708.05, 716.51, 707.24
07/08/2016, 705.63, 1573909, 699.5, 705.71, 696.435
07/07/2016, 695.36, 1303661, 698.08, 698.2, 688.215
07/06/2016, 697.77, 1411080, 689.98, 701.68, 689.09
07/05/2016, 694.49, 1462879, 696.06, 696.94, 688.88
07/01/2016, 699.21, 1344387, 692.2, 700.65, 692.1301
06/30/2016, 692.1, 1597298, 685.47, 692.32, 683.65
06/29/2016, 684.11, 1931436, 683, 687.4292, 681.41
06/28/2016, 680.04, 2169704, 678.97, 680.33, 673
06/27/2016, 668.26, 2632011, 671, 672.3, 663.284
06/24/2016, 675.22, 4442943, 675.17, 689.4, 673.45
06/23/2016, 701.87, 2166183, 697.45, 701.95, 687
06/22/2016, 697.46, 1182161, 699.06, 700.86, 693.0819
06/21/2016, 695.94, 1464836, 698.4, 702.77, 692.01
06/20/2016, 693.71, 2080645, 698.77, 702.48, 693.41
06/17/2016, 691.72, 3397720, 708.65, 708.82, 688.4515
06/16/2016, 710.36, 1981657, 714.91, 716.65, 703.26
06/15/2016, 718.92, 1213386, 719, 722.98, 717.31
06/14/2016, 718.27, 1303808, 716.48, 722.47, 713.12
06/13/2016, 718.36, 1255199, 716.51, 725.44, 716.51
06/10/2016, 719.41, 1213989, 719.47, 725.89, 716.43
06/09/2016, 728.58, 987635, 722.87, 729.54, 722.3361
06/08/2016, 728.28, 1583325, 723.96, 728.57, 720.58
06/07/2016, 716.65, 1336348, 719.84, 721.98, 716.55
06/06/2016, 716.55, 1565955, 724.91, 724.91, 714.61
06/03/2016, 722.34, 1225924, 729.27, 729.49, 720.56
06/02/2016, 730.4, 1340664, 732.5, 733.02, 724.17
06/01/2016, 734.15, 1251468, 734.53, 737.21, 730.66
05/31/2016, 735.72, 2128358, 731.74, 739.73, 731.26
05/27/2016, 732.66, 1974425, 724.01, 733.936, 724
05/26/2016, 724.12, 1573635, 722.87, 728.33, 720.28
05/25/2016, 725.27, 1629790, 720.76, 727.51, 719.7047
05/24/2016, 720.09, 1926828, 706.86, 720.97, 706.86
05/23/2016, 704.24, 1326386, 706.53, 711.4781, 704.18
05/20/2016, 709.74, 1825830, 701.62, 714.58, 700.52
05/19/2016, 700.32, 1668887, 702.36, 706, 696.8
05/18/2016, 706.63, 1765632, 703.67, 711.6, 700.63
05/17/2016, 706.23, 1999883, 715.99, 721.52, 704.11
05/16/2016, 716.49, 1316719, 709.13, 718.48, 705.65
05/13/2016, 710.83, 1307559, 711.93, 716.6619, 709.26
05/12/2016, 713.31, 1361170, 717.06, 719.25, 709
05/11/2016, 715.29, 1690862, 723.41, 724.48, 712.8
05/10/2016, 723.18, 1568621, 716.75, 723.5, 715.72
05/09/2016, 712.9, 1509892, 712, 718.71, 710
05/06/2016, 711.12, 1828508, 698.38, 711.86, 698.1067
05/05/2016, 701.43, 1680220, 697.7, 702.3199, 695.72
05/04/2016, 695.7, 1692757, 690.49, 699.75, 689.01
05/03/2016, 692.36, 1541297, 696.87, 697.84, 692
05/02/2016, 698.21, 1645013, 697.63, 700.64, 691
04/29/2016, 693.01, 2486584, 690.7, 697.62, 689
04/28/2016, 691.02, 2859790, 708.26, 714.17, 689.55
04/27/2016, 705.84, 3094905, 707.29, 708.98, 692.3651
04/26/2016, 708.14, 2739133, 725.42, 725.766, 703.0264
04/25/2016, 723.15, 1956956, 716.1, 723.93, 715.59
04/22/2016, 718.77, 5949699, 726.3, 736.12, 713.61
04/21/2016, 759.14, 2995094, 755.38, 760.45, 749.55
04/20/2016, 752.67, 1526776, 758, 758.1315, 750.01
04/19/2016, 753.93, 2027962, 769.51, 769.9, 749.33
04/18/2016, 766.61, 1557199, 760.46, 768.05, 757.3
04/15/2016, 759, 1807062, 753.98, 761, 752.6938
04/14/2016, 753.2, 1134056, 754.01, 757.31, 752.705
04/13/2016, 751.72, 1707397, 749.16, 754.38, 744.261
04/12/2016, 743.09, 1349780, 738, 743.83, 731.01
04/11/2016, 736.1, 1218789, 743.02, 745, 736.05
04/08/2016, 739.15, 1289869, 743.97, 745.45, 735.55
04/07/2016, 740.28, 1452369, 745.37, 746.9999, 736.28
04/06/2016, 745.69, 1052171, 735.77, 746.24, 735.56
04/05/2016, 737.8, 1130817, 738, 742.8, 735.37
04/04/2016, 745.29, 1134214, 750.06, 752.8, 742.43
04/01/2016, 749.91, 1576240, 738.6, 750.34, 737
03/31/2016, 744.95, 1718638, 749.25, 750.85, 740.94
03/30/2016, 750.53, 1782278, 750.1, 757.88, 748.74
03/29/2016, 744.77, 1902254, 734.59, 747.25, 728.76
03/28/2016, 733.53, 1300817, 736.79, 738.99, 732.5
03/24/2016, 735.3, 1570474, 732.01, 737.747, 731
03/23/2016, 738.06, 1431130, 742.36, 745.7199, 736.15
03/22/2016, 740.75, 1269263, 737.46, 745, 737.46
03/21/2016, 742.09, 1835963, 736.5, 742.5, 733.5157
03/18/2016, 737.6, 2982194, 741.86, 742, 731.83
03/17/2016, 737.78, 1859562, 736.45, 743.07, 736
03/16/2016, 736.09, 1621412, 726.37, 737.47, 724.51
03/15/2016, 728.33, 1720790, 726.92, 732.29, 724.77
03/14/2016, 730.49, 1717002, 726.81, 735.5, 725.15
03/11/2016, 726.82, 1968164, 720, 726.92, 717.125
03/10/2016, 712.82, 2830630, 708.12, 716.44, 703.36
03/09/2016, 705.24, 1419661, 698.47, 705.68, 694
03/08/2016, 693.97, 2075305, 688.59, 703.79, 685.34
03/07/2016, 695.16, 2986064, 706.9, 708.0912, 686.9
03/04/2016, 710.89, 1971379, 714.99, 716.49, 706.02
03/03/2016, 712.42, 1956958, 718.68, 719.45, 706.02
03/02/2016, 718.85, 1629501, 719, 720, 712
03/01/2016, 718.81, 2148608, 703.62, 718.81, 699.77
02/29/2016, 697.77, 2478214, 700.32, 710.89, 697.68
02/26/2016, 705.07, 2241785, 708.58, 713.43, 700.86
02/25/2016, 705.75, 1640430, 700.01, 705.98, 690.585
02/24/2016, 699.56, 1961258, 688.92, 700, 680.78
02/23/2016, 695.85, 2006572, 701.45, 708.4, 693.58
02/22/2016, 706.46, 1949046, 707.45, 713.24, 702.51
02/19/2016, 700.91, 1585152, 695.03, 703.0805, 694.05
02/18/2016, 697.35, 1880306, 710, 712.35, 696.03
02/17/2016, 708.4, 2490021, 699, 709.75, 691.38
02/16/2016, 691, 2517324, 692.98, 698, 685.05
02/12/2016, 682.4, 2138937, 690.26, 693.75, 678.6
02/11/2016, 683.11, 3021587, 675, 689.35, 668.8675
02/10/2016, 684.12, 2629130, 686.86, 701.31, 682.13
02/09/2016, 678.11, 3605792, 672.32, 699.9, 668.77
02/08/2016, 682.74, 4241416, 667.85, 684.03, 663.06
02/05/2016, 683.57, 5098357, 703.87, 703.99, 680.15
02/04/2016, 708.01, 5157988, 722.81, 727, 701.86
02/03/2016, 726.95, 6166731, 770.22, 774.5, 720.5
02/02/2016, 764.65, 6340548, 784.5, 789.8699, 764.65
02/01/2016, 752, 5065235, 750.46, 757.86, 743.27
01/29/2016, 742.95, 3464432, 731.53, 744.9899, 726.8
01/28/2016, 730.96, 2664956, 722.22, 733.69, 712.35
01/27/2016, 699.99, 2175913, 713.67, 718.235, 694.39
01/26/2016, 713.04, 1329141, 713.85, 718.28, 706.48
01/25/2016, 711.67, 1709777, 723.58, 729.68, 710.01
01/22/2016, 725.25, 2009951, 723.6, 728.13, 720.121
01/21/2016, 706.59, 2411079, 702.18, 719.19, 694.46
01/20/2016, 698.45, 3441642, 688.61, 706.85, 673.26
01/19/2016, 701.79, 2264747, 703.3, 709.98, 693.4101
01/15/2016, 694.45, 3604137, 692.29, 706.74, 685.37
01/14/2016, 714.72, 2225495, 705.38, 721.925, 689.1
01/13/2016, 700.56, 2497086, 730.85, 734.74, 698.61
01/12/2016, 726.07, 2010026, 721.68, 728.75, 717.3165
01/11/2016, 716.03, 2089495, 716.61, 718.855, 703.54
01/08/2016, 714.47, 2449420, 731.45, 733.23, 713
01/07/2016, 726.39, 2960578, 730.31, 738.5, 719.06
01/06/2016, 743.62, 1943685, 730, 747.18, 728.92
01/05/2016, 742.58, 1949386, 746.45, 752, 738.64
01/04/2016, 741.84, 3271348, 743, 744.06, 731.2577
12/31/2015, 758.88, 1500129, 769.5, 769.5, 758.34
12/30/2015, 771, 1293514, 776.6, 777.6, 766.9
12/29/2015, 776.6, 1764044, 766.69, 779.98, 766.43
12/28/2015, 762.51, 1515574, 752.92, 762.99, 749.52
12/24/2015, 748.4, 527223, 749.55, 751.35, 746.62
12/23/2015, 750.31, 1566723, 753.47, 754.21, 744
12/22/2015, 750, 1365420, 751.65, 754.85, 745.53
12/21/2015, 747.77, 1524535, 746.13, 750, 740
12/18/2015, 739.31, 3140906, 746.51, 754.13, 738.15
12/17/2015, 749.43, 1551087, 762.42, 762.68, 749
12/16/2015, 758.09, 1986319, 750, 760.59, 739.435
12/15/2015, 743.4, 2661199, 753, 758.08, 743.01
12/14/2015, 747.77, 2417778, 741.79, 748.73, 724.17
12/11/2015, 738.87, 2223284, 741.16, 745.71, 736.75
12/10/2015, 749.46, 1988035, 752.85, 755.85, 743.83
12/09/2015, 751.61, 2697978, 759.17, 764.23, 737.001
12/08/2015, 762.37, 1829004, 757.89, 764.8, 754.2
12/07/2015, 763.25, 1811336, 767.77, 768.73, 755.09
12/04/2015, 766.81, 2756194, 753.1, 768.49, 750
12/03/2015, 752.54, 2589641, 766.01, 768.995, 745.63
12/02/2015, 762.38, 2196721, 768.9, 775.955, 758.96
12/01/2015, 767.04, 2131827, 747.11, 768.95, 746.7
11/30/2015, 742.6, 2045584, 748.81, 754.93, 741.27
11/27/2015, 750.26, 838528, 748.46, 753.41, 747.49
11/25/2015, 748.15, 1122224, 748.14, 752, 746.06
11/24/2015, 748.28, 2333700, 752, 755.279, 737.63
11/23/2015, 755.98, 1414640, 757.45, 762.7075, 751.82
11/20/2015, 756.6, 2212934, 746.53, 757.92, 743
11/19/2015, 738.41, 1327265, 738.74, 742, 737.43
11/18/2015, 740, 1683978, 727.58, 741.41, 727
11/17/2015, 725.3, 1507449, 729.29, 731.845, 723.027
11/16/2015, 728.96, 1904395, 715.6, 729.49, 711.33
11/13/2015, 717, 2072392, 729.17, 731.15, 716.73
11/12/2015, 731.23, 1836567, 731, 737.8, 728.645
11/11/2015, 735.4, 1366611, 732.46, 741, 730.23
11/10/2015, 728.32, 1606499, 724.4, 730.59, 718.5001
11/09/2015, 724.89, 2068920, 730.2, 734.71, 719.43
11/06/2015, 733.76, 1510586, 731.5, 735.41, 727.01
11/05/2015, 731.25, 1861100, 729.47, 739.48, 729.47
11/04/2015, 728.11, 1705745, 722, 733.1, 721.9
11/03/2015, 722.16, 1565355, 718.86, 724.65, 714.72
11/02/2015, 721.11, 1885155, 711.06, 721.62, 705.85
10/30/2015, 710.81, 1907732, 715.73, 718, 710.05
10/29/2015, 716.92, 1455508, 710.5, 718.26, 710.01
10/28/2015, 712.95, 2178841, 707.33, 712.98, 703.08
10/27/2015, 708.49, 2232183, 707.38, 713.62, 704.55
10/26/2015, 712.78, 2709292, 701.55, 719.15, 701.26
10/23/2015, 702, 6651909, 727.5, 730, 701.5
10/22/2015, 651.79, 3994360, 646.7, 657.8, 644.01
10/21/2015, 642.61, 1792869, 654.15, 655.87, 641.73
10/20/2015, 650.28, 2498077, 664.04, 664.7197, 644.195
10/19/2015, 666.1, 1465691, 661.18, 666.82, 659.58
10/16/2015, 662.2, 1610712, 664.11, 664.97, 657.2
10/15/2015, 661.74, 1832832, 654.66, 663.13, 654.46
10/14/2015, 651.16, 1413798, 653.21, 659.39, 648.85
10/13/2015, 652.3, 1806003, 643.15, 657.8125, 643.15
10/12/2015, 646.67, 1275565, 642.09, 648.5, 639.01
10/09/2015, 643.61, 1648656, 640, 645.99, 635.318
10/08/2015, 639.16, 2181990, 641.36, 644.45, 625.56
10/07/2015, 642.36, 2092536, 649.24, 650.609, 632.15
10/06/2015, 645.44, 2235078, 638.84, 649.25, 636.5295
10/05/2015, 641.47, 1802263, 632, 643.01, 627
10/02/2015, 626.91, 2681241, 607.2, 627.34, 603.13
10/01/2015, 611.29, 1866223, 608.37, 612.09, 599.85
09/30/2015, 608.42, 2412754, 603.28, 608.76, 600.73
09/29/2015, 594.97, 2310065, 597.28, 605, 590.22
09/28/2015, 594.89, 3118693, 610.34, 614.605, 589.38
09/25/2015, 611.97, 2173134, 629.77, 629.77, 611
09/24/2015, 625.8, 2238097, 616.64, 627.32, 612.4
09/23/2015, 622.36, 1470633, 622.05, 628.93, 620
09/22/2015, 622.69, 2561551, 627, 627.55, 615.43
09/21/2015, 635.44, 1786543, 634.4, 636.49, 625.94
09/18/2015, 629.25, 5123314, 636.79, 640, 627.02
09/17/2015, 642.9, 2259404, 637.79, 650.9, 635.02
09/16/2015, 635.98, 1276250, 635.47, 637.95, 632.32
09/15/2015, 635.14, 2082426, 626.7, 638.7, 623.78
09/14/2015, 623.24, 1701618, 625.7, 625.86, 619.43
09/11/2015, 625.77, 1372803, 619.75, 625.78, 617.42
09/10/2015, 621.35, 1903334, 613.1, 624.16, 611.43
09/09/2015, 612.72, 1699686, 621.22, 626.52, 609.6
09/08/2015, 614.66, 2277487, 612.49, 616.31, 604.12
09/04/2015, 600.7, 2087028, 600, 603.47, 595.25
09/03/2015, 606.25, 1757851, 617, 619.71, 602.8213
09/02/2015, 614.34, 2573982, 605.59, 614.34, 599.71
09/01/2015, 597.79, 3699844, 602.36, 612.86, 594.1
08/31/2015, 618.25, 2172168, 627.54, 635.8, 617.68
08/28/2015, 630.38, 1975818, 632.82, 636.88, 624.56
08/27/2015, 637.61, 3485906, 639.4, 643.59, 622
08/26/2015, 628.62, 4187276, 610.35, 631.71, 599.05
08/25/2015, 582.06, 3521916, 614.91, 617.45, 581.11
08/24/2015, 589.61, 5727282, 573, 614, 565.05
08/21/2015, 612.48, 4261666, 639.78, 640.05, 612.33
08/20/2015, 646.83, 2854028, 655.46, 662.99, 642.9
08/19/2015, 660.9, 2132265, 656.6, 667, 654.19
08/18/2015, 656.13, 1455664, 661.9, 664, 653.46
08/17/2015, 660.87, 1050553, 656.8, 661.38, 651.24
08/14/2015, 657.12, 1071333, 655.01, 659.855, 652.66
08/13/2015, 656.45, 1807182, 659.323, 664.5, 651.661
08/12/2015, 659.56, 2938651, 663.08, 665, 652.29
08/11/2015, 660.78, 5016425, 669.2, 674.9, 654.27
08/10/2015, 633.73, 1653836, 639.48, 643.44, 631.249
08/07/2015, 635.3, 1403441, 640.23, 642.68, 629.71
08/06/2015, 642.68, 1572150, 645, 645.379, 632.25
08/05/2015, 643.78, 2331720, 634.33, 647.86, 633.16
08/04/2015, 629.25, 1486858, 628.42, 634.81, 627.16
08/03/2015, 631.21, 1301439, 625.34, 633.0556, 625.34
07/31/2015, 625.61, 1705286, 631.38, 632.91, 625.5
07/30/2015, 632.59, 1472286, 630, 635.22, 622.05
07/29/2015, 631.93, 1573146, 628.8, 633.36, 622.65
07/28/2015, 628, 1713684, 632.83, 632.83, 623.31
07/27/2015, 627.26, 2673801, 621, 634.3, 620.5
07/24/2015, 623.56, 3622089, 647, 648.17, 622.52
07/23/2015, 644.28, 3014035, 661.27, 663.63, 641
07/22/2015, 662.1, 3707818, 660.89, 678.64, 659
07/21/2015, 662.3, 3363342, 655.21, 673, 654.3
07/20/2015, 663.02, 5857092, 659.24, 668.88, 653.01
07/17/2015, 672.93, 11153500, 649, 674.468, 645
07/16/2015, 579.85, 4559712, 565.12, 580.68, 565
07/15/2015, 560.22, 1782264, 560.13, 566.5029, 556.79
07/14/2015, 561.1, 3231284, 546.76, 565.8487, 546.71
07/13/2015, 546.55, 2204610, 532.88, 547.11, 532.4001
07/10/2015, 530.13, 1954951, 526.29, 532.56, 525.55
07/09/2015, 520.68, 1840155, 523.12, 523.77, 520.35
07/08/2015, 516.83, 1293372, 521.05, 522.734, 516.11
07/07/2015, 525.02, 1595672, 523.13, 526.18, 515.18
07/06/2015, 522.86, 1278587, 519.5, 525.25, 519
07/02/2015, 523.4, 1235773, 521.08, 524.65, 521.08
07/01/2015, 521.84, 1961197, 524.73, 525.69, 518.2305
06/30/2015, 520.51, 2234284, 526.02, 526.25, 520.5
06/29/2015, 521.52, 1935361, 525.01, 528.61, 520.54
06/26/2015, 531.69, 2108629, 537.26, 537.76, 531.35
06/25/2015, 535.23, 1332412, 538.87, 540.9, 535.23
06/24/2015, 537.84, 1286576, 540, 540, 535.66
06/23/2015, 540.48, 1196115, 539.64, 541.499, 535.25
06/22/2015, 538.19, 1243535, 539.59, 543.74, 537.53
06/19/2015, 536.69, 1890916, 537.21, 538.25, 533.01
06/18/2015, 536.73, 1832450, 531, 538.15, 530.79
06/17/2015, 529.26, 1269113, 529.37, 530.98, 525.1
06/16/2015, 528.15, 1071728, 528.4, 529.6399, 525.56
06/15/2015, 527.2, 1632675, 528, 528.3, 524
06/12/2015, 532.33, 955489, 531.6, 533.12, 530.16
06/11/2015, 534.61, 1208632, 538.425, 538.98, 533.02
06/10/2015, 536.69, 1813775, 529.36, 538.36, 529.35
06/09/2015, 526.69, 1454172, 527.56, 529.2, 523.01
06/08/2015, 526.83, 1523960, 533.31, 534.12, 526.24
06/05/2015, 533.33, 1375008, 536.35, 537.2, 532.52
06/04/2015, 536.7, 1346044, 537.76, 540.59, 534.32
06/03/2015, 540.31, 1716836, 539.91, 543.5, 537.11
06/02/2015, 539.18, 1936721, 532.93, 543, 531.33
06/01/2015, 533.99, 1900257, 536.79, 536.79, 529.76
05/29/2015, 532.11, 2590445, 537.37, 538.63, 531.45
05/28/2015, 539.78, 1029764, 538.01, 540.61, 536.25
05/27/2015, 539.79, 1524783, 532.8, 540.55, 531.71
05/26/2015, 532.32, 2404462, 538.12, 539, 529.88
05/22/2015, 540.11, 1175065, 540.15, 544.19, 539.51
05/21/2015, 542.51, 1461431, 537.95, 543.8399, 535.98
05/20/2015, 539.27, 1430565, 538.49, 542.92, 532.972
05/19/2015, 537.36, 1964037, 533.98, 540.66, 533.04
05/18/2015, 532.3, 2001117, 532.01, 534.82, 528.85
05/15/2015, 533.85, 1965088, 539.18, 539.2743, 530.38
05/14/2015, 538.4, 1401005, 533.77, 539, 532.41
05/13/2015, 529.62, 1253005, 530.56, 534.3215, 528.655
05/12/2015, 529.04, 1633180, 531.6, 533.2089, 525.26
05/11/2015, 535.7, 904465, 538.37, 541.98, 535.4
05/08/2015, 538.22, 1527181, 536.65, 541.15, 536
05/07/2015, 530.7, 1543986, 523.99, 533.46, 521.75
05/06/2015, 524.22, 1566865, 531.24, 532.38, 521.085
05/05/2015, 530.8, 1380519, 538.21, 539.74, 530.3906
05/04/2015, 540.78, 1303830, 538.53, 544.07, 535.06
05/01/2015, 537.9, 1758085, 538.43, 539.54, 532.1
04/30/2015, 537.34, 2080834, 547.87, 548.59, 535.05
04/29/2015, 549.08, 1696886, 550.47, 553.68, 546.905
04/28/2015, 553.68, 1490735, 554.64, 556.02, 550.366
04/27/2015, 555.37, 2390696, 563.39, 565.95, 553.2001
| 04/24/2020, 1279.31, 1640394, 1261.17, 1280.4, 1249.45
04/23/2020, 1276.31, 1566203, 1271.55, 1293.31, 1265.67
04/22/2020, 1263.21, 2093140, 1245.54, 1285.6133, 1242
04/21/2020, 1216.34, 2153003, 1247, 1254.27, 1209.71
04/20/2020, 1266.61, 1695488, 1271, 1281.6, 1261.37
04/17/2020, 1283.25, 1949042, 1284.85, 1294.43, 1271.23
04/16/2020, 1263.47, 2518099, 1274.1, 1279, 1242.62
04/15/2020, 1262.47, 1671703, 1245.61, 1280.46, 1240.4
04/14/2020, 1269.23, 2470353, 1245.09, 1282.07, 1236.93
04/13/2020, 1217.56, 1739828, 1209.18, 1220.51, 1187.5984
04/09/2020, 1211.45, 2175421, 1224.08, 1225.57, 1196.7351
04/08/2020, 1210.28, 1975135, 1206.5, 1219.07, 1188.16
04/07/2020, 1186.51, 2387329, 1221, 1225, 1182.23
04/06/2020, 1186.92, 2664723, 1138, 1194.66, 1130.94
04/03/2020, 1097.88, 2313400, 1119.015, 1123.54, 1079.81
04/02/2020, 1120.84, 1964881, 1098.26, 1126.86, 1096.4
04/01/2020, 1105.62, 2344173, 1122, 1129.69, 1097.45
03/31/2020, 1162.81, 2487983, 1147.3, 1175.31, 1138.14
03/30/2020, 1146.82, 2574061, 1125.04, 1151.63, 1096.48
03/27/2020, 1110.71, 3208495, 1125.67, 1150.6702, 1105.91
03/26/2020, 1161.75, 3573755, 1111.8, 1169.97, 1093.53
03/25/2020, 1102.49, 4081528, 1126.47, 1148.9, 1086.01
03/24/2020, 1134.46, 3344450, 1103.77, 1135, 1090.62
03/23/2020, 1056.62, 4044137, 1061.32, 1071.32, 1013.5361
03/20/2020, 1072.32, 3601750, 1135.72, 1143.99, 1065.49
03/19/2020, 1115.29, 3651106, 1093.05, 1157.9699, 1060.1075
03/18/2020, 1096.8, 4233435, 1056.51, 1106.5, 1037.28
03/17/2020, 1119.8, 3861489, 1093.11, 1130.86, 1056.01
03/16/2020, 1084.33, 4252365, 1096, 1152.2665, 1074.44
03/13/2020, 1219.73, 3700125, 1179, 1219.76, 1117.1432
03/12/2020, 1114.91, 4226748, 1126, 1193.87, 1113.3
03/11/2020, 1215.41, 2611229, 1249.7, 1260.96, 1196.07
03/10/2020, 1280.39, 2611373, 1260, 1281.15, 1218.77
03/09/2020, 1215.56, 3365365, 1205.3, 1254.7599, 1200
03/06/2020, 1298.41, 2660628, 1277.06, 1306.22, 1261.05
03/05/2020, 1319.04, 2561288, 1350.2, 1358.91, 1305.1
03/04/2020, 1386.52, 1913315, 1359.23, 1388.09, 1343.11
03/03/2020, 1341.39, 2402326, 1399.42, 1410.15, 1332
03/02/2020, 1389.11, 2431468, 1351.61, 1390.87, 1326.815
02/28/2020, 1339.33, 3790618, 1277.5, 1341.14, 1271
02/27/2020, 1318.09, 2978300, 1362.06, 1371.7037, 1317.17
02/26/2020, 1393.18, 2204037, 1396.14, 1415.7, 1379
02/25/2020, 1388.45, 2478278, 1433, 1438.14, 1382.4
02/24/2020, 1421.59, 2867053, 1426.11, 1436.97, 1411.39
02/21/2020, 1485.11, 1732273, 1508.03, 1512.215, 1480.44
02/20/2020, 1518.15, 1096552, 1522, 1529.64, 1506.82
02/19/2020, 1526.69, 949268, 1525.07, 1532.1063, 1521.4
02/18/2020, 1519.67, 1121140, 1515, 1531.63, 1512.59
02/14/2020, 1520.74, 1197836, 1515.6, 1520.74, 1507.34
02/13/2020, 1514.66, 929730, 1512.69, 1527.18, 1504.6
02/12/2020, 1518.27, 1167565, 1514.48, 1520.695, 1508.11
02/11/2020, 1508.79, 1344633, 1511.81, 1529.63, 1505.6378
02/10/2020, 1508.68, 1419876, 1474.32, 1509.5, 1474.32
02/07/2020, 1479.23, 1172270, 1467.3, 1485.84, 1466.35
02/06/2020, 1476.23, 1679384, 1450.33, 1481.9997, 1449.57
02/05/2020, 1448.23, 1986157, 1462.42, 1463.84, 1430.56
02/04/2020, 1447.07, 3932954, 1457.07, 1469.5, 1426.3
02/03/2020, 1485.94, 3055216, 1462, 1490, 1458.99
01/31/2020, 1434.23, 2417214, 1468.9, 1470.13, 1428.53
01/30/2020, 1455.84, 1339421, 1439.96, 1457.28, 1436.4
01/29/2020, 1458.63, 1078667, 1458.8, 1465.43, 1446.74
01/28/2020, 1452.56, 1577422, 1443, 1456, 1432.47
01/27/2020, 1433.9, 1755201, 1431, 1438.07, 1421.2
01/24/2020, 1466.71, 1784644, 1493.59, 1495.495, 1465.25
01/23/2020, 1486.65, 1351354, 1487.64, 1495.52, 1482.1
01/22/2020, 1485.95, 1610846, 1491, 1503.2143, 1484.93
01/21/2020, 1484.4, 2036780, 1479.12, 1491.85, 1471.2
01/17/2020, 1480.39, 2396215, 1462.91, 1481.2954, 1458.22
01/16/2020, 1451.7, 1173688, 1447.44, 1451.99, 1440.92
01/15/2020, 1439.2, 1282685, 1430.21, 1441.395, 1430.21
01/14/2020, 1430.88, 1560453, 1439.01, 1441.8, 1428.37
01/13/2020, 1439.23, 1653482, 1436.13, 1440.52, 1426.02
01/10/2020, 1429.73, 1821566, 1427.56, 1434.9292, 1418.35
01/09/2020, 1419.83, 1502664, 1420.57, 1427.33, 1410.27
01/08/2020, 1404.32, 1529177, 1392.08, 1411.58, 1390.84
01/07/2020, 1393.34, 1511693, 1397.94, 1402.99, 1390.38
01/06/2020, 1394.21, 1733149, 1350, 1396.5, 1350
01/03/2020, 1360.66, 1187006, 1347.86, 1372.5, 1345.5436
01/02/2020, 1367.37, 1406731, 1341.55, 1368.14, 1341.55
12/31/2019, 1337.02, 962468, 1330.11, 1338, 1329.085
12/30/2019, 1336.14, 1051323, 1350, 1353, 1334.02
12/27/2019, 1351.89, 1038718, 1362.99, 1364.53, 1349.31
12/26/2019, 1360.4, 667754, 1346.17, 1361.3269, 1344.47
12/24/2019, 1343.56, 347518, 1348.5, 1350.26, 1342.78
12/23/2019, 1348.84, 883200, 1355.87, 1359.7999, 1346.51
12/20/2019, 1349.59, 3316905, 1363.35, 1363.64, 1349
12/19/2019, 1356.04, 1470112, 1351.82, 1358.1, 1348.985
12/18/2019, 1352.62, 1657069, 1356.6, 1360.47, 1351
12/17/2019, 1355.12, 1855259, 1362.89, 1365, 1351.3231
12/16/2019, 1361.17, 1397451, 1356.5, 1364.68, 1352.67
12/13/2019, 1347.83, 1550028, 1347.95, 1353.0931, 1343.87
12/12/2019, 1350.27, 1281722, 1345.94, 1355.775, 1340.5
12/11/2019, 1345.02, 850796, 1350.84, 1351.2, 1342.67
12/10/2019, 1344.66, 1094653, 1341.5, 1349.975, 1336.04
12/09/2019, 1343.56, 1355795, 1338.04, 1359.45, 1337.84
12/06/2019, 1340.62, 1315510, 1333.44, 1344, 1333.44
12/05/2019, 1328.13, 1212818, 1328, 1329.3579, 1316.44
12/04/2019, 1320.54, 1538110, 1307.01, 1325.8, 1304.87
12/03/2019, 1295.28, 1268647, 1279.57, 1298.461, 1279
12/02/2019, 1289.92, 1511851, 1301, 1305.83, 1281
11/29/2019, 1304.96, 586981, 1307.12, 1310.205, 1303.97
11/27/2019, 1312.99, 996329, 1315, 1318.36, 1309.63
11/26/2019, 1313.55, 1069795, 1309.86, 1314.8, 1305.09
11/25/2019, 1306.69, 1036487, 1299.18, 1311.31, 1298.13
11/22/2019, 1295.34, 1386506, 1305.62, 1308.73, 1291.41
11/21/2019, 1301.35, 995499, 1301.48, 1312.59, 1293
11/20/2019, 1303.05, 1309835, 1311.74, 1315, 1291.15
11/19/2019, 1315.46, 1269372, 1327.7, 1327.7, 1312.8
11/18/2019, 1320.7, 1488083, 1332.22, 1335.5288, 1317.5
11/15/2019, 1334.87, 1782955, 1318.94, 1334.88, 1314.2796
11/14/2019, 1311.46, 1194305, 1297.5, 1317, 1295.65
11/13/2019, 1298, 853861, 1294.07, 1304.3, 1293.51
11/12/2019, 1298.8, 1085859, 1300, 1310, 1295.77
11/11/2019, 1299.19, 1012429, 1303.18, 1306.425, 1297.41
11/08/2019, 1311.37, 1251916, 1305.28, 1318, 1304.365
11/07/2019, 1308.86, 2029970, 1294.28, 1323.74, 1294.245
11/06/2019, 1291.8, 1152977, 1289.46, 1293.73, 1282.5
11/05/2019, 1292.03, 1282711, 1292.89, 1298.93, 1291.2289
11/04/2019, 1291.37, 1500964, 1276.45, 1294.13, 1276.355
11/01/2019, 1273.74, 1670072, 1265, 1274.62, 1260.5
10/31/2019, 1260.11, 1455651, 1261.28, 1267.67, 1250.8428
10/30/2019, 1261.29, 1408851, 1252.97, 1269.36, 1252
10/29/2019, 1262.62, 1886380, 1276.23, 1281.59, 1257.2119
10/28/2019, 1290, 2613237, 1275.45, 1299.31, 1272.54
10/25/2019, 1265.13, 1213051, 1251.03, 1269.6, 1250.01
10/24/2019, 1260.99, 1039868, 1260.9, 1264, 1253.715
10/23/2019, 1259.13, 928595, 1242.36, 1259.89, 1242.36
10/22/2019, 1242.8, 1047851, 1247.85, 1250.6, 1241.38
10/21/2019, 1246.15, 1038042, 1252.26, 1254.6287, 1240.6
10/18/2019, 1245.49, 1352839, 1253.46, 1258.89, 1241.08
10/17/2019, 1253.07, 980510, 1250.93, 1263.325, 1249.94
10/16/2019, 1243.64, 1168174, 1241.17, 1254.74, 1238.45
10/15/2019, 1243.01, 1395259, 1220.4, 1247.33, 1220.4
10/14/2019, 1217.14, 882039, 1212.34, 1226.33, 1211.76
10/11/2019, 1215.45, 1277144, 1222.21, 1228.39, 1213.74
10/10/2019, 1208.67, 932531, 1198.58, 1215, 1197.34
10/09/2019, 1202.31, 876632, 1199.35, 1208.35, 1197.63
10/08/2019, 1189.13, 1141784, 1197.59, 1206.08, 1189.01
10/07/2019, 1207.68, 867149, 1204.4, 1218.2036, 1203.75
10/04/2019, 1209, 1183264, 1191.89, 1211.44, 1189.17
10/03/2019, 1187.83, 1663656, 1180, 1189.06, 1162.43
10/02/2019, 1176.63, 1639237, 1196.98, 1196.99, 1171.29
10/01/2019, 1205.1, 1358279, 1219, 1231.23, 1203.58
09/30/2019, 1219, 1419676, 1220.97, 1226, 1212.3
09/27/2019, 1225.09, 1354432, 1243.01, 1244.02, 1214.45
09/26/2019, 1241.39, 1561882, 1241.96, 1245, 1232.268
09/25/2019, 1246.52, 1593875, 1215.82, 1248.3, 1210.09
09/24/2019, 1218.76, 1591786, 1240, 1246.74, 1210.68
09/23/2019, 1234.03, 1075253, 1226, 1239.09, 1224.17
09/20/2019, 1229.93, 2337269, 1233.12, 1243.32, 1223.08
09/19/2019, 1238.71, 1000155, 1232.06, 1244.44, 1232.02
09/18/2019, 1232.41, 1144333, 1227.51, 1235.61, 1216.53
09/17/2019, 1229.15, 958112, 1230.4, 1235, 1223.69
09/16/2019, 1231.3, 1053299, 1229.52, 1239.56, 1225.61
09/13/2019, 1239.56, 1301350, 1231.35, 1240.88, 1227.01
09/12/2019, 1234.25, 1725908, 1224.3, 1241.86, 1223.02
09/11/2019, 1220.17, 1307033, 1203.41, 1222.6, 1202.2
09/10/2019, 1206, 1260115, 1195.15, 1210, 1194.58
09/09/2019, 1204.41, 1471880, 1204, 1220, 1192.62
09/06/2019, 1204.93, 1072143, 1208.13, 1212.015, 1202.5222
09/05/2019, 1211.38, 1408601, 1191.53, 1213.04, 1191.53
09/04/2019, 1181.41, 1068968, 1176.71, 1183.48, 1171
09/03/2019, 1168.39, 1480420, 1177.03, 1186.89, 1163.2
08/30/2019, 1188.1, 1129959, 1198.5, 1198.5, 1183.8026
08/29/2019, 1192.85, 1088858, 1181.12, 1196.06, 1181.12
08/28/2019, 1171.02, 802243, 1161.71, 1176.4199, 1157.3
08/27/2019, 1167.84, 1077452, 1180.53, 1182.4, 1161.45
08/26/2019, 1168.89, 1226441, 1157.26, 1169.47, 1152.96
08/23/2019, 1151.29, 1688271, 1181.99, 1194.08, 1147.75
08/22/2019, 1189.53, 947906, 1194.07, 1198.0115, 1178.58
08/21/2019, 1191.25, 741053, 1193.15, 1199, 1187.43
08/20/2019, 1182.69, 915605, 1195.25, 1196.06, 1182.11
08/19/2019, 1198.45, 1232517, 1190.09, 1206.99, 1190.09
08/16/2019, 1177.6, 1349436, 1179.55, 1182.72, 1171.81
08/15/2019, 1167.26, 1224739, 1163.5, 1175.84, 1162.11
08/14/2019, 1164.29, 1578668, 1176.31, 1182.3, 1160.54
08/13/2019, 1197.27, 1318009, 1171.46, 1204.78, 1171.46
08/12/2019, 1174.71, 1003187, 1179.21, 1184.96, 1167.6723
08/09/2019, 1188.01, 1065658, 1197.99, 1203.88, 1183.603
08/08/2019, 1204.8, 1467997, 1182.83, 1205.01, 1173.02
08/07/2019, 1173.99, 1444324, 1156, 1178.4451, 1149.6239
08/06/2019, 1169.95, 1709374, 1163.31, 1179.96, 1160
08/05/2019, 1152.32, 2597455, 1170.04, 1175.24, 1140.14
08/02/2019, 1193.99, 1645067, 1200.74, 1206.9, 1188.94
08/01/2019, 1209.01, 1698510, 1214.03, 1234.11, 1205.72
07/31/2019, 1216.68, 1725454, 1223, 1234, 1207.7635
07/30/2019, 1225.14, 1453263, 1225.41, 1234.87, 1223.3
07/29/2019, 1239.41, 2223731, 1241.05, 1247.37, 1228.23
07/26/2019, 1250.41, 4805752, 1224.04, 1265.5499, 1224
07/25/2019, 1132.12, 2209823, 1137.82, 1141.7, 1120.92
07/24/2019, 1137.81, 1590101, 1131.9, 1144, 1126.99
07/23/2019, 1146.21, 1093688, 1144, 1146.9, 1131.8
07/22/2019, 1138.07, 1301846, 1133.45, 1139.25, 1124.24
07/19/2019, 1130.1, 1647245, 1148.19, 1151.14, 1129.62
07/18/2019, 1146.33, 1291281, 1141.74, 1147.605, 1132.73
07/17/2019, 1146.35, 1170047, 1150.97, 1158.36, 1145.77
07/16/2019, 1153.58, 1238807, 1146, 1158.58, 1145
07/15/2019, 1150.34, 903780, 1146.86, 1150.82, 1139.4
07/12/2019, 1144.9, 863973, 1143.99, 1147.34, 1138.78
07/11/2019, 1144.21, 1195569, 1143.25, 1153.07, 1139.58
07/10/2019, 1140.48, 1209466, 1131.22, 1142.05, 1130.97
07/09/2019, 1124.83, 1330370, 1111.8, 1128.025, 1107.17
07/08/2019, 1116.35, 1236419, 1125.17, 1125.98, 1111.21
07/05/2019, 1131.59, 1264540, 1117.8, 1132.88, 1116.14
07/03/2019, 1121.58, 767011, 1117.41, 1126.76, 1113.86
07/02/2019, 1111.25, 991755, 1102.24, 1111.77, 1098.17
07/01/2019, 1097.95, 1438504, 1098, 1107.58, 1093.703
06/28/2019, 1080.91, 1693450, 1076.39, 1081, 1073.37
06/27/2019, 1076.01, 1004477, 1084, 1087.1, 1075.29
06/26/2019, 1079.8, 1810869, 1086.5, 1092.97, 1072.24
06/25/2019, 1086.35, 1546913, 1112.66, 1114.35, 1083.8
06/24/2019, 1115.52, 1395696, 1119.61, 1122, 1111.01
06/21/2019, 1121.88, 1947591, 1109.24, 1124.11, 1108.08
06/20/2019, 1111.42, 1262011, 1119.99, 1120.12, 1104.74
06/19/2019, 1102.33, 1339218, 1105.6, 1107, 1093.48
06/18/2019, 1103.6, 1386684, 1109.69, 1116.39, 1098.99
06/17/2019, 1092.5, 941602, 1086.28, 1099.18, 1086.28
06/14/2019, 1085.35, 1111643, 1086.42, 1092.69, 1080.1721
06/13/2019, 1088.77, 1058000, 1083.64, 1094.17, 1080.15
06/12/2019, 1077.03, 1061255, 1078, 1080.93, 1067.54
06/11/2019, 1078.72, 1437063, 1093.98, 1101.99, 1077.6025
06/10/2019, 1080.38, 1464248, 1072.98, 1092.66, 1072.3216
06/07/2019, 1066.04, 1802370, 1050.63, 1070.92, 1048.4
06/06/2019, 1044.34, 1703244, 1044.99, 1047.49, 1033.7
06/05/2019, 1042.22, 2168439, 1051.54, 1053.55, 1030.49
06/04/2019, 1053.05, 2833483, 1042.9, 1056.05, 1033.69
06/03/2019, 1036.23, 5130576, 1065.5, 1065.5, 1025
05/31/2019, 1103.63, 1508203, 1101.29, 1109.6, 1100.18
05/30/2019, 1117.95, 951873, 1115.54, 1123.13, 1112.12
05/29/2019, 1116.46, 1538212, 1127.52, 1129.1, 1108.2201
05/28/2019, 1134.15, 1365166, 1134, 1151.5871, 1133.12
05/24/2019, 1133.47, 1112341, 1147.36, 1149.765, 1131.66
05/23/2019, 1140.77, 1199300, 1140.5, 1145.9725, 1129.224
05/22/2019, 1151.42, 914839, 1146.75, 1158.52, 1145.89
05/21/2019, 1149.63, 1160158, 1148.49, 1152.7077, 1137.94
05/20/2019, 1138.85, 1353292, 1144.5, 1146.7967, 1131.4425
05/17/2019, 1162.3, 1208623, 1168.47, 1180.15, 1160.01
05/16/2019, 1178.98, 1531404, 1164.51, 1188.16, 1162.84
05/15/2019, 1164.21, 2289302, 1117.87, 1171.33, 1116.6657
05/14/2019, 1120.44, 1836604, 1137.21, 1140.42, 1119.55
05/13/2019, 1132.03, 1860648, 1141.96, 1147.94, 1122.11
05/10/2019, 1164.27, 1314546, 1163.59, 1172.6, 1142.5
05/09/2019, 1162.38, 1185973, 1159.03, 1169.66, 1150.85
05/08/2019, 1166.27, 1309514, 1172.01, 1180.4243, 1165.74
05/07/2019, 1174.1, 1551368, 1180.47, 1190.44, 1161.04
05/06/2019, 1189.39, 1563943, 1166.26, 1190.85, 1166.26
05/03/2019, 1185.4, 1980653, 1173.65, 1186.8, 1169
05/02/2019, 1162.61, 1944817, 1167.76, 1174.1895, 1155.0018
05/01/2019, 1168.08, 2642983, 1188.05, 1188.05, 1167.18
04/30/2019, 1188.48, 6194691, 1185, 1192.81, 1175
04/29/2019, 1287.58, 2412788, 1274, 1289.27, 1266.2949
04/26/2019, 1272.18, 1228276, 1269, 1273.07, 1260.32
04/25/2019, 1263.45, 1099614, 1264.77, 1267.4083, 1252.03
04/24/2019, 1256, 1015006, 1264.12, 1268.01, 1255
04/23/2019, 1264.55, 1271195, 1250.69, 1269, 1246.38
04/22/2019, 1248.84, 806577, 1235.99, 1249.09, 1228.31
04/18/2019, 1236.37, 1315676, 1239.18, 1242, 1234.61
04/17/2019, 1236.34, 1211866, 1233, 1240.56, 1227.82
04/16/2019, 1227.13, 855258, 1225, 1230.82, 1220.12
04/15/2019, 1221.1, 1187353, 1218, 1224.2, 1209.1101
04/12/2019, 1217.87, 926799, 1210, 1218.35, 1208.11
04/11/2019, 1204.62, 709417, 1203.96, 1207.96, 1200.13
04/10/2019, 1202.16, 724524, 1200.68, 1203.785, 1196.435
04/09/2019, 1197.25, 865416, 1196, 1202.29, 1193.08
04/08/2019, 1203.84, 859969, 1207.89, 1208.69, 1199.86
04/05/2019, 1207.15, 900950, 1214.99, 1216.22, 1205.03
04/04/2019, 1215, 949962, 1205.94, 1215.67, 1204.13
04/03/2019, 1205.92, 1014195, 1207.48, 1216.3, 1200.5
04/02/2019, 1200.49, 800820, 1195.32, 1201.35, 1185.71
04/01/2019, 1194.43, 1188235, 1184.1, 1196.66, 1182
03/29/2019, 1173.31, 1269573, 1174.9, 1178.99, 1162.88
03/28/2019, 1168.49, 966843, 1171.54, 1171.565, 1159.4312
03/27/2019, 1173.02, 1362217, 1185.5, 1187.559, 1159.37
03/26/2019, 1184.62, 1894639, 1198.53, 1202.83, 1176.72
03/25/2019, 1193, 1493841, 1196.93, 1206.3975, 1187.04
03/22/2019, 1205.5, 1668910, 1226.32, 1230, 1202.825
03/21/2019, 1231.54, 1195899, 1216, 1231.79, 1213.15
03/20/2019, 1223.97, 2089367, 1197.35, 1227.14, 1196.17
03/19/2019, 1198.85, 1404863, 1188.81, 1200, 1185.87
03/18/2019, 1184.26, 1212506, 1183.3, 1190, 1177.4211
03/15/2019, 1184.46, 2457597, 1193.38, 1196.57, 1182.61
03/14/2019, 1185.55, 1150950, 1194.51, 1197.88, 1184.48
03/13/2019, 1193.32, 1434816, 1200.645, 1200.93, 1191.94
03/12/2019, 1193.2, 2012306, 1178.26, 1200, 1178.26
03/11/2019, 1175.76, 1569332, 1144.45, 1176.19, 1144.45
03/08/2019, 1142.32, 1212271, 1126.73, 1147.08, 1123.3
03/07/2019, 1143.3, 1166076, 1155.72, 1156.755, 1134.91
03/06/2019, 1157.86, 1094100, 1162.49, 1167.5658, 1155.49
03/05/2019, 1162.03, 1422357, 1150.06, 1169.61, 1146.195
03/04/2019, 1147.8, 1444774, 1146.99, 1158.2804, 1130.69
03/01/2019, 1140.99, 1447454, 1124.9, 1142.97, 1124.75
02/28/2019, 1119.92, 1541068, 1111.3, 1127.65, 1111.01
02/27/2019, 1116.05, 968362, 1106.95, 1117.98, 1101
02/26/2019, 1115.13, 1469761, 1105.75, 1119.51, 1099.92
02/25/2019, 1109.4, 1395281, 1116, 1118.54, 1107.27
02/22/2019, 1110.37, 1048361, 1100.9, 1111.24, 1095.6
02/21/2019, 1096.97, 1414744, 1110.84, 1111.94, 1092.52
02/20/2019, 1113.8, 1080144, 1119.99, 1123.41, 1105.28
02/19/2019, 1118.56, 1046315, 1110, 1121.89, 1110
02/15/2019, 1113.65, 1442461, 1130.08, 1131.67, 1110.65
02/14/2019, 1121.67, 941678, 1118.05, 1128.23, 1110.445
02/13/2019, 1120.16, 1048630, 1124.99, 1134.73, 1118.5
02/12/2019, 1121.37, 1608658, 1106.8, 1125.295, 1105.85
02/11/2019, 1095.01, 1063825, 1096.95, 1105.945, 1092.86
02/08/2019, 1095.06, 1072031, 1087, 1098.91, 1086.55
02/07/2019, 1098.71, 2040615, 1104.16, 1104.84, 1086
02/06/2019, 1115.23, 2101674, 1139.57, 1147, 1112.77
02/05/2019, 1145.99, 3529974, 1124.84, 1146.85, 1117.248
02/04/2019, 1132.8, 2518184, 1112.66, 1132.8, 1109.02
02/01/2019, 1110.75, 1455609, 1112.4, 1125, 1104.89
01/31/2019, 1116.37, 1531463, 1103, 1117.33, 1095.41
01/30/2019, 1089.06, 1241760, 1068.43, 1091, 1066.85
01/29/2019, 1060.62, 1006731, 1072.68, 1075.15, 1055.8647
01/28/2019, 1070.08, 1277745, 1080.11, 1083, 1063.8
01/25/2019, 1090.99, 1114785, 1085, 1094, 1081.82
01/24/2019, 1073.9, 1317718, 1076.48, 1079.475, 1060.7
01/23/2019, 1075.57, 956526, 1077.35, 1084.93, 1059.75
01/22/2019, 1070.52, 1607398, 1088, 1091.51, 1063.47
01/18/2019, 1098.26, 1933754, 1100, 1108.352, 1090.9
01/17/2019, 1089.9, 1223674, 1079.47, 1091.8, 1073.5
01/16/2019, 1080.97, 1320530, 1080, 1092.375, 1079.34
01/15/2019, 1077.15, 1452238, 1050.17, 1080.05, 1047.34
01/14/2019, 1044.69, 1127417, 1046.92, 1051.53, 1041.255
01/11/2019, 1057.19, 1512651, 1063.18, 1063.775, 1048.48
01/10/2019, 1070.33, 1444976, 1067.66, 1071.15, 1057.71
01/09/2019, 1074.66, 1198369, 1081.65, 1082.63, 1066.4
01/08/2019, 1076.28, 1748371, 1076.11, 1084.56, 1060.53
01/07/2019, 1068.39, 1978077, 1071.5, 1073.9999, 1054.76
01/04/2019, 1070.71, 2080144, 1032.59, 1070.84, 1027.4179
01/03/2019, 1016.06, 1829379, 1041, 1056.98, 1014.07
01/02/2019, 1045.85, 1516681, 1016.57, 1052.32, 1015.71
12/31/2018, 1035.61, 1492541, 1050.96, 1052.7, 1023.59
12/28/2018, 1037.08, 1399218, 1049.62, 1055.56, 1033.1
12/27/2018, 1043.88, 2102069, 1017.15, 1043.89, 997
12/26/2018, 1039.46, 2337212, 989.01, 1040, 983
12/24/2018, 976.22, 1590328, 973.9, 1003.54, 970.11
12/21/2018, 979.54, 4560424, 1015.3, 1024.02, 973.69
12/20/2018, 1009.41, 2659047, 1018.13, 1034.22, 996.36
12/19/2018, 1023.01, 2419322, 1033.99, 1062, 1008.05
12/18/2018, 1028.71, 2101854, 1026.09, 1049.48, 1021.44
12/17/2018, 1016.53, 2337631, 1037.51, 1053.15, 1007.9
12/14/2018, 1042.1, 1685802, 1049.98, 1062.6, 1040.79
12/13/2018, 1061.9, 1329198, 1068.07, 1079.7597, 1053.93
12/12/2018, 1063.68, 1523276, 1068, 1081.65, 1062.79
12/11/2018, 1051.75, 1354751, 1056.49, 1060.6, 1039.84
12/10/2018, 1039.55, 1793465, 1035.05, 1048.45, 1023.29
12/07/2018, 1036.58, 2098526, 1060.01, 1075.26, 1028.5
12/06/2018, 1068.73, 2758098, 1034.26, 1071.2, 1030.7701
12/04/2018, 1050.82, 2278200, 1103.12, 1104.42, 1049.98
12/03/2018, 1106.43, 1900355, 1123.14, 1124.65, 1103.6645
11/30/2018, 1094.43, 2554416, 1089.07, 1095.57, 1077.88
11/29/2018, 1088.3, 1403540, 1076.08, 1094.245, 1076
11/28/2018, 1086.23, 2399374, 1048.76, 1086.84, 1035.76
11/27/2018, 1044.41, 1801334, 1041, 1057.58, 1038.49
11/26/2018, 1048.62, 1846430, 1038.35, 1049.31, 1033.91
11/23/2018, 1023.88, 691462, 1030, 1037.59, 1022.3992
11/21/2018, 1037.61, 1531676, 1036.76, 1048.56, 1033.47
11/20/2018, 1025.76, 2447254, 1000, 1031.74, 996.02
11/19/2018, 1020, 1837207, 1057.2, 1060.79, 1016.2601
11/16/2018, 1061.49, 1641232, 1059.41, 1067, 1048.98
11/15/2018, 1064.71, 1819132, 1044.71, 1071.85, 1031.78
11/14/2018, 1043.66, 1561656, 1050, 1054.5643, 1031
11/13/2018, 1036.05, 1496534, 1043.29, 1056.605, 1031.15
11/12/2018, 1038.63, 1429319, 1061.39, 1062.12, 1031
11/09/2018, 1066.15, 1343154, 1073.99, 1075.56, 1053.11
11/08/2018, 1082.4, 1463022, 1091.38, 1093.27, 1072.2048
11/07/2018, 1093.39, 2057155, 1069, 1095.46, 1065.9
11/06/2018, 1055.81, 1225197, 1039.48, 1064.345, 1038.07
11/05/2018, 1040.09, 2436742, 1055, 1058.47, 1021.24
11/02/2018, 1057.79, 1829295, 1073.73, 1082.975, 1054.61
11/01/2018, 1070, 1456222, 1075.8, 1083.975, 1062.46
10/31/2018, 1076.77, 2528584, 1059.81, 1091.94, 1057
10/30/2018, 1036.21, 3209126, 1008.46, 1037.49, 1000.75
10/29/2018, 1020.08, 3873644, 1082.47, 1097.04, 995.83
10/26/2018, 1071.47, 4185201, 1037.03, 1106.53, 1034.09
10/25/2018, 1095.57, 2511884, 1071.79, 1110.98, 1069.55
10/24/2018, 1050.71, 1910060, 1104.25, 1106.12, 1048.74
10/23/2018, 1103.69, 1847798, 1080.89, 1107.89, 1070
10/22/2018, 1101.16, 1494285, 1103.06, 1112.23, 1091
10/19/2018, 1096.46, 1264605, 1093.37, 1110.36, 1087.75
10/18/2018, 1087.97, 2056606, 1121.84, 1121.84, 1077.09
10/17/2018, 1115.69, 1397613, 1126.46, 1128.99, 1102.19
10/16/2018, 1121.28, 1845491, 1104.59, 1124.22, 1102.5
10/15/2018, 1092.25, 1343231, 1108.91, 1113.4464, 1089
10/12/2018, 1110.08, 2029872, 1108, 1115, 1086.402
10/11/2018, 1079.32, 2939514, 1072.94, 1106.4, 1068.27
10/10/2018, 1081.22, 2574985, 1131.08, 1132.17, 1081.13
10/09/2018, 1138.82, 1308706, 1146.15, 1154.35, 1137.572
10/08/2018, 1148.97, 1877142, 1150.11, 1168, 1127.3636
10/05/2018, 1157.35, 1184245, 1167.5, 1173.4999, 1145.12
10/04/2018, 1168.19, 2151762, 1195.33, 1197.51, 1155.576
10/03/2018, 1202.95, 1207280, 1205, 1206.41, 1193.83
10/02/2018, 1200.11, 1655602, 1190.96, 1209.96, 1186.63
10/01/2018, 1195.31, 1345250, 1199.89, 1209.9, 1190.3
09/28/2018, 1193.47, 1306822, 1191.87, 1195.41, 1184.5
09/27/2018, 1194.64, 1244278, 1186.73, 1202.1, 1183.63
09/26/2018, 1180.49, 1346434, 1185.15, 1194.23, 1174.765
09/25/2018, 1184.65, 937577, 1176.15, 1186.88, 1168
09/24/2018, 1173.37, 1218532, 1157.17, 1178, 1146.91
09/21/2018, 1166.09, 4363929, 1192, 1192.21, 1166.04
09/20/2018, 1186.87, 1209855, 1179.99, 1189.89, 1173.36
09/19/2018, 1171.09, 1185321, 1164.98, 1173.21, 1154.58
09/18/2018, 1161.22, 1184407, 1157.09, 1176.08, 1157.09
09/17/2018, 1156.05, 1279147, 1170.14, 1177.24, 1154.03
09/14/2018, 1172.53, 934300, 1179.1, 1180.425, 1168.3295
09/13/2018, 1175.33, 1402005, 1170.74, 1178.61, 1162.85
09/12/2018, 1162.82, 1291304, 1172.72, 1178.61, 1158.36
09/11/2018, 1177.36, 1209171, 1161.63, 1178.68, 1156.24
09/10/2018, 1164.64, 1115259, 1172.19, 1174.54, 1160.11
09/07/2018, 1164.83, 1401034, 1158.67, 1175.26, 1157.215
09/06/2018, 1171.44, 1886690, 1186.3, 1186.3, 1152
09/05/2018, 1186.48, 2043732, 1193.8, 1199.0096, 1162
09/04/2018, 1197, 1800509, 1204.27, 1212.99, 1192.5
08/31/2018, 1218.19, 1812366, 1234.98, 1238.66, 1211.2854
08/30/2018, 1239.12, 1320261, 1244.23, 1253.635, 1232.59
08/29/2018, 1249.3, 1295939, 1237.45, 1250.66, 1236.3588
08/28/2018, 1231.15, 1296532, 1241.29, 1242.545, 1228.69
08/27/2018, 1241.82, 1154962, 1227.6, 1243.09, 1225.716
08/24/2018, 1220.65, 946529, 1208.82, 1221.65, 1206.3588
08/23/2018, 1205.38, 988509, 1207.14, 1221.28, 1204.24
08/22/2018, 1207.33, 881463, 1200, 1211.84, 1199
08/21/2018, 1201.62, 1187884, 1208, 1217.26, 1200.3537
08/20/2018, 1207.77, 864462, 1205.02, 1211, 1194.6264
08/17/2018, 1200.96, 1381724, 1202.03, 1209.02, 1188.24
08/16/2018, 1206.49, 1319985, 1224.73, 1225.9999, 1202.55
08/15/2018, 1214.38, 1815642, 1229.26, 1235.24, 1209.51
08/14/2018, 1242.1, 1342534, 1235.19, 1245.8695, 1225.11
08/13/2018, 1235.01, 957153, 1236.98, 1249.2728, 1233.6405
08/10/2018, 1237.61, 1107323, 1243, 1245.695, 1232
08/09/2018, 1249.1, 805227, 1249.9, 1255.542, 1246.01
08/08/2018, 1245.61, 1369650, 1240.47, 1256.5, 1238.0083
08/07/2018, 1242.22, 1493073, 1237, 1251.17, 1236.17
08/06/2018, 1224.77, 1080923, 1225, 1226.0876, 1215.7965
08/03/2018, 1223.71, 1072524, 1229.62, 1230, 1215.06
08/02/2018, 1226.15, 1520488, 1205.9, 1229.88, 1204.79
08/01/2018, 1220.01, 1567142, 1228, 1233.47, 1210.21
07/31/2018, 1217.26, 1632823, 1220.01, 1227.5877, 1205.6
07/30/2018, 1219.74, 1822782, 1228.01, 1234.916, 1211.47
07/27/2018, 1238.5, 2115802, 1271, 1273.89, 1231
07/26/2018, 1268.33, 2334881, 1251, 1269.7707, 1249.02
07/25/2018, 1263.7, 2115890, 1239.13, 1265.86, 1239.13
07/24/2018, 1248.08, 3303268, 1262.59, 1266, 1235.56
07/23/2018, 1205.5, 2584034, 1181.01, 1206.49, 1181
07/20/2018, 1184.91, 1246898, 1186.96, 1196.86, 1184.22
07/19/2018, 1186.96, 1256113, 1191, 1200, 1183.32
07/18/2018, 1195.88, 1391232, 1196.56, 1204.5, 1190.34
07/17/2018, 1198.8, 1585091, 1172.22, 1203.04, 1170.6
07/16/2018, 1183.86, 1049560, 1189.39, 1191, 1179.28
07/13/2018, 1188.82, 1221687, 1185, 1195.4173, 1180
07/12/2018, 1183.48, 1251083, 1159.89, 1184.41, 1155.935
07/11/2018, 1153.9, 1094301, 1144.59, 1164.29, 1141.0003
07/10/2018, 1152.84, 789249, 1156.98, 1159.59, 1149.59
07/09/2018, 1154.05, 906073, 1148.48, 1154.67, 1143.42
07/06/2018, 1140.17, 966155, 1123.58, 1140.93, 1120.7371
07/05/2018, 1124.27, 1060752, 1110.53, 1127.5, 1108.48
07/03/2018, 1102.89, 679034, 1135.82, 1135.82, 1100.02
07/02/2018, 1127.46, 1188616, 1099, 1128, 1093.8
06/29/2018, 1115.65, 1275979, 1120, 1128.2265, 1115
06/28/2018, 1114.22, 1072438, 1102.09, 1122.31, 1096.01
06/27/2018, 1103.98, 1287698, 1121.34, 1131.8362, 1103.62
06/26/2018, 1118.46, 1559791, 1128, 1133.21, 1116.6589
06/25/2018, 1124.81, 2155276, 1143.6, 1143.91, 1112.78
06/22/2018, 1155.48, 1310164, 1159.14, 1162.4965, 1147.26
06/21/2018, 1157.66, 1232352, 1174.85, 1177.295, 1152.232
06/20/2018, 1169.84, 1648248, 1175.31, 1186.2856, 1169.16
06/19/2018, 1168.06, 1616125, 1158.5, 1171.27, 1154.01
06/18/2018, 1173.46, 1400641, 1143.65, 1174.31, 1143.59
06/15/2018, 1152.26, 2119134, 1148.86, 1153.42, 1143.485
06/14/2018, 1152.12, 1350085, 1143.85, 1155.47, 1140.64
06/13/2018, 1134.79, 1490017, 1141.12, 1146.5, 1133.38
06/12/2018, 1139.32, 899231, 1131.07, 1139.79, 1130.735
06/11/2018, 1129.99, 1071114, 1118.6, 1137.26, 1118.6
06/08/2018, 1120.87, 1289859, 1118.18, 1126.67, 1112.15
06/07/2018, 1123.86, 1519860, 1131.32, 1135.82, 1116.52
06/06/2018, 1136.88, 1697489, 1142.17, 1143, 1125.7429
06/05/2018, 1139.66, 1538169, 1140.99, 1145.738, 1133.19
06/04/2018, 1139.29, 1881046, 1122.33, 1141.89, 1122.005
06/01/2018, 1119.5, 2416755, 1099.35, 1120, 1098.5
05/31/2018, 1084.99, 3085325, 1067.56, 1097.19, 1067.56
05/30/2018, 1067.8, 1129958, 1063.03, 1069.21, 1056.83
05/29/2018, 1060.32, 1858676, 1064.89, 1073.37, 1055.22
05/25/2018, 1075.66, 878903, 1079.02, 1082.56, 1073.775
05/24/2018, 1079.24, 757752, 1079, 1080.47, 1066.15
05/23/2018, 1079.69, 1057712, 1065.13, 1080.78, 1061.71
05/22/2018, 1069.73, 1088700, 1083.56, 1086.59, 1066.69
05/21/2018, 1079.58, 1012258, 1074.06, 1088, 1073.65
05/18/2018, 1066.36, 1496448, 1061.86, 1069.94, 1060.68
05/17/2018, 1078.59, 1031190, 1079.89, 1086.87, 1073.5
05/16/2018, 1081.77, 989819, 1077.31, 1089.27, 1076.26
05/15/2018, 1079.23, 1494306, 1090, 1090.05, 1073.47
05/14/2018, 1100.2, 1450140, 1100, 1110.75, 1099.11
05/11/2018, 1098.26, 1253205, 1093.6, 1101.3295, 1090.91
05/10/2018, 1097.57, 1441456, 1086.03, 1100.44, 1085.64
05/09/2018, 1082.76, 2032319, 1058.1, 1085.44, 1056.365
05/08/2018, 1053.91, 1217260, 1058.54, 1060.55, 1047.145
05/07/2018, 1054.79, 1464008, 1049.23, 1061.68, 1047.1
05/04/2018, 1048.21, 1936797, 1016.9, 1048.51, 1016.9
05/03/2018, 1023.72, 1813623, 1019, 1029.675, 1006.29
05/02/2018, 1024.38, 1534094, 1028.1, 1040.389, 1022.87
05/01/2018, 1037.31, 1427171, 1013.66, 1038.47, 1008.21
04/30/2018, 1017.33, 1664084, 1030.01, 1037, 1016.85
04/27/2018, 1030.05, 1617452, 1046, 1049.5, 1025.59
04/26/2018, 1040.04, 1984448, 1029.51, 1047.98, 1018.19
04/25/2018, 1021.18, 2225495, 1025.52, 1032.49, 1015.31
04/24/2018, 1019.98, 4750851, 1052, 1057, 1010.59
04/23/2018, 1067.45, 2278846, 1077.86, 1082.72, 1060.7
04/20/2018, 1072.96, 1887698, 1082, 1092.35, 1069.57
04/19/2018, 1087.7, 1741907, 1069.4, 1094.165, 1068.18
04/18/2018, 1072.08, 1336678, 1077.43, 1077.43, 1066.225
04/17/2018, 1074.16, 2311903, 1051.37, 1077.88, 1048.26
04/16/2018, 1037.98, 1194144, 1037, 1043.24, 1026.74
04/13/2018, 1029.27, 1175754, 1040.88, 1046.42, 1022.98
04/12/2018, 1032.51, 1357599, 1025.04, 1040.69, 1021.4347
04/11/2018, 1019.97, 1476133, 1027.99, 1031.3641, 1015.87
04/10/2018, 1031.64, 1983510, 1026.44, 1036.28, 1011.34
04/09/2018, 1015.45, 1738682, 1016.8, 1039.6, 1014.08
04/06/2018, 1007.04, 1740896, 1020, 1031.42, 1003.03
04/05/2018, 1027.81, 1345681, 1041.33, 1042.79, 1020.1311
04/04/2018, 1025.14, 2464418, 993.41, 1028.7175, 993
04/03/2018, 1013.41, 2271858, 1013.91, 1020.99, 994.07
04/02/2018, 1006.47, 2679214, 1022.82, 1034.8, 990.37
03/29/2018, 1031.79, 2714402, 1011.63, 1043, 1002.9
03/28/2018, 1004.56, 3345046, 998, 1024.23, 980.64
03/27/2018, 1005.1, 3081612, 1063, 1064.8393, 996.92
03/26/2018, 1053.21, 2593808, 1046, 1055.63, 1008.4
03/23/2018, 1021.57, 2147097, 1047.03, 1063.36, 1021.22
03/22/2018, 1049.08, 2584639, 1081.88, 1082.9, 1045.91
03/21/2018, 1090.88, 1878294, 1092.74, 1106.2999, 1085.15
03/20/2018, 1097.71, 1802209, 1099, 1105.2, 1083.46
03/19/2018, 1099.82, 2355186, 1120.01, 1121.99, 1089.01
03/16/2018, 1135.73, 2614871, 1154.14, 1155.88, 1131.96
03/15/2018, 1149.58, 1397767, 1149.96, 1161.08, 1134.54
03/14/2018, 1149.49, 1290638, 1145.21, 1158.59, 1141.44
03/13/2018, 1138.17, 1874176, 1170, 1176.76, 1133.33
03/12/2018, 1164.5, 2106548, 1163.85, 1177.05, 1157.42
03/09/2018, 1160.04, 2121425, 1136, 1160.8, 1132.4606
03/08/2018, 1126, 1393529, 1115.32, 1127.6, 1112.8
03/07/2018, 1109.64, 1277439, 1089.19, 1112.22, 1085.4823
03/06/2018, 1095.06, 1497087, 1099.22, 1101.85, 1089.775
03/05/2018, 1090.93, 1141932, 1075.14, 1097.1, 1069.0001
03/02/2018, 1078.92, 2271394, 1053.08, 1081.9986, 1048.115
03/01/2018, 1069.52, 2511872, 1107.87, 1110.12, 1067.001
02/28/2018, 1104.73, 1873737, 1123.03, 1127.53, 1103.24
02/27/2018, 1118.29, 1772866, 1141.24, 1144.04, 1118
02/26/2018, 1143.75, 1514920, 1127.8, 1143.96, 1126.695
02/23/2018, 1126.79, 1190432, 1112.64, 1127.28, 1104.7135
02/22/2018, 1106.63, 1309536, 1116.19, 1122.82, 1102.59
02/21/2018, 1111.34, 1507152, 1106.47, 1133.97, 1106.33
02/20/2018, 1102.46, 1389491, 1090.57, 1113.95, 1088.52
02/16/2018, 1094.8, 1680283, 1088.41, 1104.67, 1088.3134
02/15/2018, 1089.52, 1785552, 1079.07, 1091.4794, 1064.34
02/14/2018, 1069.7, 1547665, 1048.95, 1071.72, 1046.75
02/13/2018, 1052.1, 1213800, 1045, 1058.37, 1044.0872
02/12/2018, 1051.94, 2054002, 1048, 1061.5, 1040.928
02/09/2018, 1037.78, 3503970, 1017.25, 1043.97, 992.56
02/08/2018, 1001.52, 2809890, 1055.41, 1058.62, 1000.66
02/07/2018, 1048.58, 2353003, 1081.54, 1081.78, 1048.26
02/06/2018, 1080.6, 3432313, 1027.18, 1081.71, 1023.1367
02/05/2018, 1055.8, 3769453, 1090.6, 1110, 1052.03
02/02/2018, 1111.9, 4837979, 1122, 1123.07, 1107.2779
02/01/2018, 1167.7, 2380221, 1162.61, 1174, 1157.52
01/31/2018, 1169.94, 1523820, 1170.57, 1173, 1159.13
01/30/2018, 1163.69, 1541771, 1167.83, 1176.52, 1163.52
01/29/2018, 1175.58, 1337324, 1176.48, 1186.89, 1171.98
01/26/2018, 1175.84, 1981173, 1175.08, 1175.84, 1158.11
01/25/2018, 1170.37, 1461518, 1172.53, 1175.94, 1162.76
01/24/2018, 1164.24, 1382904, 1177.33, 1179.86, 1161.05
01/23/2018, 1169.97, 1309862, 1159.85, 1171.6266, 1158.75
01/22/2018, 1155.81, 1616120, 1137.49, 1159.88, 1135.1101
01/19/2018, 1137.51, 1390118, 1131.83, 1137.86, 1128.3
01/18/2018, 1129.79, 1194943, 1131.41, 1132.51, 1117.5
01/17/2018, 1131.98, 1200476, 1126.22, 1132.6, 1117.01
01/16/2018, 1121.76, 1566662, 1132.51, 1139.91, 1117.8316
01/12/2018, 1122.26, 1718491, 1102.41, 1124.29, 1101.15
01/11/2018, 1105.52, 977727, 1106.3, 1106.525, 1099.59
01/10/2018, 1102.61, 1042273, 1097.1, 1104.6, 1096.11
01/09/2018, 1106.26, 900089, 1109.4, 1110.57, 1101.2307
01/08/2018, 1106.94, 1046767, 1102.23, 1111.27, 1101.62
01/05/2018, 1102.23, 1279990, 1094, 1104.25, 1092
01/04/2018, 1086.4, 1002945, 1088, 1093.5699, 1084.0017
01/03/2018, 1082.48, 1429757, 1064.31, 1086.29, 1063.21
01/02/2018, 1065, 1236401, 1048.34, 1066.94, 1045.23
12/29/2017, 1046.4, 886845, 1046.72, 1049.7, 1044.9
12/28/2017, 1048.14, 833011, 1051.6, 1054.75, 1044.77
12/27/2017, 1049.37, 1271780, 1057.39, 1058.37, 1048.05
12/26/2017, 1056.74, 761097, 1058.07, 1060.12, 1050.2
12/22/2017, 1060.12, 755089, 1061.11, 1064.2, 1059.44
12/21/2017, 1063.63, 986548, 1064.95, 1069.33, 1061.7938
12/20/2017, 1064.95, 1268285, 1071.78, 1073.38, 1061.52
12/19/2017, 1070.68, 1307894, 1075.2, 1076.84, 1063.55
12/18/2017, 1077.14, 1552016, 1066.08, 1078.49, 1062
12/15/2017, 1064.19, 3275091, 1054.61, 1067.62, 1049.5
12/14/2017, 1049.15, 1558684, 1045, 1058.5, 1043.11
12/13/2017, 1040.61, 1220364, 1046.12, 1046.665, 1038.38
12/12/2017, 1040.48, 1279511, 1039.63, 1050.31, 1033.6897
12/11/2017, 1041.1, 1190527, 1035.5, 1043.8, 1032.0504
12/08/2017, 1037.05, 1288419, 1037.49, 1042.05, 1032.5222
12/07/2017, 1030.93, 1458145, 1020.43, 1034.24, 1018.071
12/06/2017, 1018.38, 1258496, 1001.5, 1024.97, 1001.14
12/05/2017, 1005.15, 2066247, 995.94, 1020.61, 988.28
12/04/2017, 998.68, 1906058, 1012.66, 1016.1, 995.57
12/01/2017, 1010.17, 1908962, 1015.8, 1022.4897, 1002.02
11/30/2017, 1021.41, 1723003, 1022.37, 1028.4899, 1015
11/29/2017, 1021.66, 2442974, 1042.68, 1044.08, 1015.65
11/28/2017, 1047.41, 1421027, 1055.09, 1062.375, 1040
11/27/2017, 1054.21, 1307471, 1040, 1055.46, 1038.44
11/24/2017, 1040.61, 536996, 1035.87, 1043.178, 1035
11/22/2017, 1035.96, 746351, 1035, 1039.706, 1031.43
11/21/2017, 1034.49, 1096161, 1023.31, 1035.11, 1022.655
11/20/2017, 1018.38, 898389, 1020.26, 1022.61, 1017.5
11/17/2017, 1019.09, 1366936, 1034.01, 1034.42, 1017.75
11/16/2017, 1032.5, 1129424, 1022.52, 1035.92, 1022.52
11/15/2017, 1020.91, 847932, 1019.21, 1024.09, 1015.42
11/14/2017, 1026, 958708, 1022.59, 1026.81, 1014.15
11/13/2017, 1025.75, 885565, 1023.42, 1031.58, 1022.57
11/10/2017, 1028.07, 720674, 1026.46, 1030.76, 1025.28
11/09/2017, 1031.26, 1244701, 1033.99, 1033.99, 1019.6656
11/08/2017, 1039.85, 1088395, 1030.52, 1043.522, 1028.45
11/07/2017, 1033.33, 1112123, 1027.27, 1033.97, 1025.13
11/06/2017, 1025.9, 1124757, 1028.99, 1034.87, 1025
11/03/2017, 1032.48, 1075134, 1022.11, 1032.65, 1020.31
11/02/2017, 1025.58, 1048584, 1021.76, 1028.09, 1013.01
11/01/2017, 1025.5, 1371619, 1017.21, 1029.67, 1016.95
10/31/2017, 1016.64, 1331265, 1015.22, 1024, 1010.42
10/30/2017, 1017.11, 2083490, 1014, 1024.97, 1007.5
10/27/2017, 1019.27, 5165922, 1009.19, 1048.39, 1008.2
10/26/2017, 972.56, 2027218, 980, 987.6, 972.2
10/25/2017, 973.33, 1210368, 968.37, 976.09, 960.5201
10/24/2017, 970.54, 1206074, 970, 972.23, 961
10/23/2017, 968.45, 1471544, 989.52, 989.52, 966.12
10/20/2017, 988.2, 1176177, 989.44, 991, 984.58
10/19/2017, 984.45, 1312706, 986, 988.88, 978.39
10/18/2017, 992.81, 1057285, 991.77, 996.72, 986.9747
10/17/2017, 992.18, 1290152, 990.29, 996.44, 988.59
10/16/2017, 992, 910246, 992.1, 993.9065, 984
10/13/2017, 989.68, 1169584, 992, 997.21, 989
10/12/2017, 987.83, 1278357, 987.45, 994.12, 985
10/11/2017, 989.25, 1692843, 973.72, 990.71, 972.25
10/10/2017, 972.6, 968113, 980, 981.57, 966.0801
10/09/2017, 977, 890620, 980, 985.425, 976.11
10/06/2017, 978.89, 1146207, 966.7, 979.46, 963.36
10/05/2017, 969.96, 1210427, 955.49, 970.91, 955.18
10/04/2017, 951.68, 951766, 957, 960.39, 950.69
10/03/2017, 957.79, 888303, 954, 958, 949.14
10/02/2017, 953.27, 1282850, 959.98, 962.54, 947.84
09/29/2017, 959.11, 1576365, 952, 959.7864, 951.51
09/28/2017, 949.5, 997036, 941.36, 950.69, 940.55
09/27/2017, 944.49, 2237538, 927.74, 949.9, 927.74
09/26/2017, 924.86, 1666749, 923.72, 930.82, 921.14
09/25/2017, 920.97, 1855742, 925.45, 926.4, 909.7
09/22/2017, 928.53, 1052170, 927.75, 934.73, 926.48
09/21/2017, 932.45, 1227059, 933, 936.53, 923.83
09/20/2017, 931.58, 1535626, 922.98, 933.88, 922
09/19/2017, 921.81, 912967, 917.42, 922.4199, 912.55
09/18/2017, 915, 1300759, 920.01, 922.08, 910.6
09/15/2017, 920.29, 2499466, 924.66, 926.49, 916.36
09/14/2017, 925.11, 1395497, 931.25, 932.77, 924
09/13/2017, 935.09, 1101145, 930.66, 937.25, 929.86
09/12/2017, 932.07, 1133638, 932.59, 933.48, 923.861
09/11/2017, 929.08, 1266020, 934.25, 938.38, 926.92
09/08/2017, 926.5, 997699, 936.49, 936.99, 924.88
09/07/2017, 935.95, 1211472, 931.73, 936.41, 923.62
09/06/2017, 927.81, 1526209, 930.15, 930.915, 919.27
09/05/2017, 928.45, 1346791, 933.08, 937, 921.96
09/01/2017, 937.34, 943657, 941.13, 942.48, 935.15
08/31/2017, 939.33, 1566888, 931.76, 941.98, 931.76
08/30/2017, 929.57, 1300616, 920.05, 930.819, 919.65
08/29/2017, 921.29, 1181391, 905.1, 923.33, 905
08/28/2017, 913.81, 1085014, 916, 919.245, 911.87
08/25/2017, 915.89, 1052764, 923.49, 925.555, 915.5
08/24/2017, 921.28, 1266191, 928.66, 930.84, 915.5
08/23/2017, 927, 1088575, 921.93, 929.93, 919.36
08/22/2017, 924.69, 1166320, 912.72, 925.86, 911.4751
08/21/2017, 906.66, 942328, 910, 913, 903.4
08/18/2017, 910.67, 1341990, 910.31, 915.275, 907.1543
08/17/2017, 910.98, 1241782, 925.78, 926.86, 910.98
08/16/2017, 926.96, 1005261, 925.29, 932.7, 923.445
08/15/2017, 922.22, 882479, 924.23, 926.5499, 919.82
08/14/2017, 922.67, 1063404, 922.53, 924.668, 918.19
08/11/2017, 914.39, 1205652, 907.97, 917.78, 905.58
08/10/2017, 907.24, 1755521, 917.55, 919.26, 906.13
08/09/2017, 922.9, 1191332, 920.61, 925.98, 917.2501
08/08/2017, 926.79, 1057351, 927.09, 935.814, 925.6095
08/07/2017, 929.36, 1031710, 929.06, 931.7, 926.5
08/04/2017, 927.96, 1081814, 926.75, 930.3068, 923.03
08/03/2017, 923.65, 1201519, 930.34, 932.24, 922.24
08/02/2017, 930.39, 1822272, 928.61, 932.6, 916.68
08/01/2017, 930.83, 1234612, 932.38, 937.447, 929.26
07/31/2017, 930.5, 1964748, 941.89, 943.59, 926.04
07/28/2017, 941.53, 1802343, 929.4, 943.83, 927.5
07/27/2017, 934.09, 3128819, 951.78, 951.78, 920
07/26/2017, 947.8, 2069349, 954.68, 955, 942.2788
07/25/2017, 950.7, 4656609, 953.81, 959.7, 945.4
07/24/2017, 980.34, 3205374, 972.22, 986.2, 970.77
07/21/2017, 972.92, 1697190, 962.25, 973.23, 960.15
07/20/2017, 968.15, 1620636, 975, 975.9, 961.51
07/19/2017, 970.89, 1221155, 967.84, 973.04, 964.03
07/18/2017, 965.4, 1152741, 953, 968.04, 950.6
07/17/2017, 953.42, 1164141, 957, 960.74, 949.2407
07/14/2017, 955.99, 1052855, 952, 956.91, 948.005
07/13/2017, 947.16, 1294674, 946.29, 954.45, 943.01
07/12/2017, 943.83, 1517168, 938.68, 946.3, 934.47
07/11/2017, 930.09, 1112417, 929.54, 931.43, 922
07/10/2017, 928.8, 1190237, 921.77, 930.38, 919.59
07/07/2017, 918.59, 1590456, 908.85, 921.54, 908.85
07/06/2017, 906.69, 1424290, 904.12, 914.9444, 899.7
07/05/2017, 911.71, 1813309, 901.76, 914.51, 898.5
07/03/2017, 898.7, 1710373, 912.18, 913.94, 894.79
06/30/2017, 908.73, 2086340, 926.05, 926.05, 908.31
06/29/2017, 917.79, 3287991, 929.92, 931.26, 910.62
06/28/2017, 940.49, 2719213, 929, 942.75, 916
06/27/2017, 927.33, 2566047, 942.46, 948.29, 926.85
06/26/2017, 952.27, 1596664, 969.9, 973.31, 950.79
06/23/2017, 965.59, 1527513, 956.83, 966, 954.2
06/22/2017, 957.09, 941639, 958.7, 960.72, 954.55
06/21/2017, 959.45, 1201971, 953.64, 960.1, 950.76
06/20/2017, 950.63, 1125520, 957.52, 961.62, 950.01
06/19/2017, 957.37, 1520715, 949.96, 959.99, 949.05
06/16/2017, 939.78, 3061794, 940, 942.04, 931.595
06/15/2017, 942.31, 2065271, 933.97, 943.339, 924.44
06/14/2017, 950.76, 1487378, 959.92, 961.15, 942.25
06/13/2017, 953.4, 2012980, 951.91, 959.98, 944.09
06/12/2017, 942.9, 3762434, 939.56, 949.355, 915.2328
06/09/2017, 949.83, 3305545, 984.5, 984.5, 935.63
06/08/2017, 983.41, 1477151, 982.35, 984.57, 977.2
06/07/2017, 981.08, 1447172, 979.65, 984.15, 975.77
06/06/2017, 976.57, 1814323, 983.16, 988.25, 975.14
06/05/2017, 983.68, 1251903, 976.55, 986.91, 975.1
06/02/2017, 975.6, 1750723, 969.46, 975.88, 966
06/01/2017, 966.95, 1408958, 968.95, 971.5, 960.01
05/31/2017, 964.86, 2447176, 975.02, 979.27, 960.18
05/30/2017, 975.88, 1466288, 970.31, 976.2, 969.49
05/26/2017, 971.47, 1251425, 969.7, 974.98, 965.03
05/25/2017, 969.54, 1659422, 957.33, 972.629, 955.47
05/24/2017, 954.96, 1031408, 952.98, 955.09, 949.5
05/23/2017, 948.82, 1269438, 947.92, 951.4666, 942.575
05/22/2017, 941.86, 1118456, 935, 941.8828, 935
05/19/2017, 934.01, 1389848, 931.47, 937.755, 931
05/18/2017, 930.24, 1596058, 921, 933.17, 918.75
05/17/2017, 919.62, 2357922, 935.67, 939.3325, 918.14
05/16/2017, 943, 968288, 940, 943.11, 937.58
05/15/2017, 937.08, 1104595, 932.95, 938.25, 929.34
05/12/2017, 932.22, 1050377, 931.53, 933.44, 927.85
05/11/2017, 930.6, 834997, 925.32, 932.53, 923.0301
05/10/2017, 928.78, 1173887, 931.98, 932, 925.16
05/09/2017, 932.17, 1581236, 936.95, 937.5, 929.53
05/08/2017, 934.3, 1328885, 926.12, 936.925, 925.26
05/05/2017, 927.13, 1910317, 933.54, 934.9, 925.2
05/04/2017, 931.66, 1421938, 926.07, 935.93, 924.59
05/03/2017, 927.04, 1497565, 914.86, 928.1, 912.5426
05/02/2017, 916.44, 1543696, 909.62, 920.77, 909.4526
05/01/2017, 912.57, 2114629, 901.94, 915.68, 901.45
04/28/2017, 905.96, 3223850, 910.66, 916.85, 905.77
04/27/2017, 874.25, 2009509, 873.6, 875.4, 870.38
04/26/2017, 871.73, 1233724, 874.23, 876.05, 867.7481
04/25/2017, 872.3, 1670095, 865, 875, 862.81
04/24/2017, 862.76, 1371722, 851.2, 863.45, 849.86
04/21/2017, 843.19, 1323364, 842.88, 843.88, 840.6
04/20/2017, 841.65, 957994, 841.44, 845.2, 839.32
04/19/2017, 838.21, 954324, 839.79, 842.22, 836.29
04/18/2017, 836.82, 835433, 834.22, 838.93, 832.71
04/17/2017, 837.17, 894540, 825.01, 837.75, 824.47
04/13/2017, 823.56, 1118221, 822.14, 826.38, 821.44
04/12/2017, 824.32, 900059, 821.93, 826.66, 821.02
04/11/2017, 823.35, 1078951, 824.71, 827.4267, 817.0201
04/10/2017, 824.73, 978825, 825.39, 829.35, 823.77
04/07/2017, 824.67, 1056692, 827.96, 828.485, 820.5127
04/06/2017, 827.88, 1254235, 832.4, 836.39, 826.46
04/05/2017, 831.41, 1553163, 835.51, 842.45, 830.72
04/04/2017, 834.57, 1044455, 831.36, 835.18, 829.0363
04/03/2017, 838.55, 1670349, 829.22, 840.85, 829.22
03/31/2017, 829.56, 1401756, 828.97, 831.64, 827.39
03/30/2017, 831.5, 1055263, 833.5, 833.68, 829
03/29/2017, 831.41, 1785006, 825, 832.765, 822.3801
03/28/2017, 820.92, 1620532, 820.41, 825.99, 814.027
03/27/2017, 819.51, 1894735, 806.95, 821.63, 803.37
03/24/2017, 814.43, 1980415, 820.08, 821.93, 808.89
03/23/2017, 817.58, 3485390, 821, 822.57, 812.257
03/22/2017, 829.59, 1399409, 831.91, 835.55, 827.1801
03/21/2017, 830.46, 2461375, 851.4, 853.5, 829.02
03/20/2017, 848.4, 1217560, 850.01, 850.22, 845.15
03/17/2017, 852.12, 1712397, 851.61, 853.4, 847.11
03/16/2017, 848.78, 977384, 849.03, 850.85, 846.13
03/15/2017, 847.2, 1381328, 847.59, 848.63, 840.77
03/14/2017, 845.62, 779920, 843.64, 847.24, 840.8
03/13/2017, 845.54, 1149928, 844, 848.685, 843.25
03/10/2017, 843.25, 1702731, 843.28, 844.91, 839.5
03/09/2017, 838.68, 1261393, 836, 842, 834.21
03/08/2017, 835.37, 988900, 833.51, 838.15, 831.79
03/07/2017, 831.91, 1037573, 827.4, 833.41, 826.52
03/06/2017, 827.78, 1108799, 826.95, 828.88, 822.4
03/03/2017, 829.08, 890640, 830.56, 831.36, 825.751
03/02/2017, 830.63, 937824, 833.85, 834.51, 829.64
03/01/2017, 835.24, 1495934, 828.85, 836.255, 827.26
02/28/2017, 823.21, 2258695, 825.61, 828.54, 820.2
02/27/2017, 829.28, 1101120, 824.55, 830.5, 824
02/24/2017, 828.64, 1392039, 827.73, 829, 824.2
02/23/2017, 831.33, 1471342, 830.12, 832.46, 822.88
02/22/2017, 830.76, 983058, 828.66, 833.25, 828.64
02/21/2017, 831.66, 1259841, 828.66, 833.45, 828.35
02/17/2017, 828.07, 1602549, 823.02, 828.07, 821.655
02/16/2017, 824.16, 1285919, 819.93, 824.4, 818.98
02/15/2017, 818.98, 1311316, 819.36, 823, 818.47
02/14/2017, 820.45, 1054472, 819, 823, 816
02/13/2017, 819.24, 1205835, 816, 820.959, 815.49
02/10/2017, 813.67, 1134701, 811.7, 815.25, 809.78
02/09/2017, 809.56, 990260, 809.51, 810.66, 804.54
02/08/2017, 808.38, 1155892, 807, 811.84, 803.1903
02/07/2017, 806.97, 1240257, 803.99, 810.5, 801.78
02/06/2017, 801.34, 1182882, 799.7, 801.67, 795.2501
02/03/2017, 801.49, 1461217, 802.99, 806, 800.37
02/02/2017, 798.53, 1530827, 793.8, 802.7, 792
02/01/2017, 795.695, 2027708, 799.68, 801.19, 791.19
01/31/2017, 796.79, 2153957, 796.86, 801.25, 790.52
01/30/2017, 802.32, 3243568, 814.66, 815.84, 799.8
01/27/2017, 823.31, 2964989, 834.71, 841.95, 820.44
01/26/2017, 832.15, 2944642, 837.81, 838, 827.01
01/25/2017, 835.67, 1612854, 829.62, 835.77, 825.06
01/24/2017, 823.87, 1472228, 822.3, 825.9, 817.821
01/23/2017, 819.31, 1962506, 807.25, 820.87, 803.74
01/20/2017, 805.02, 1668638, 806.91, 806.91, 801.69
01/19/2017, 802.175, 917085, 805.12, 809.48, 801.8
01/18/2017, 806.07, 1293893, 805.81, 806.205, 800.99
01/17/2017, 804.61, 1361935, 807.08, 807.14, 800.37
01/13/2017, 807.88, 1098154, 807.48, 811.2244, 806.69
01/12/2017, 806.36, 1352872, 807.14, 807.39, 799.17
01/11/2017, 807.91, 1065360, 805, 808.15, 801.37
01/10/2017, 804.79, 1176637, 807.86, 809.1299, 803.51
01/09/2017, 806.65, 1274318, 806.4, 809.9664, 802.83
01/06/2017, 806.15, 1639246, 795.26, 807.9, 792.2041
01/05/2017, 794.02, 1334028, 786.08, 794.48, 785.02
01/04/2017, 786.9, 1071198, 788.36, 791.34, 783.16
01/03/2017, 786.14, 1657291, 778.81, 789.63, 775.8
12/30/2016, 771.82, 1769809, 782.75, 782.78, 770.41
12/29/2016, 782.79, 743808, 783.33, 785.93, 778.92
12/28/2016, 785.05, 1142148, 793.7, 794.23, 783.2
12/27/2016, 791.55, 789151, 790.68, 797.86, 787.657
12/23/2016, 789.91, 623682, 790.9, 792.74, 787.28
12/22/2016, 791.26, 972147, 792.36, 793.32, 788.58
12/21/2016, 794.56, 1208770, 795.84, 796.6757, 787.1
12/20/2016, 796.42, 950345, 796.76, 798.65, 793.27
12/19/2016, 794.2, 1231966, 790.22, 797.66, 786.27
12/16/2016, 790.8, 2435100, 800.4, 800.8558, 790.29
12/15/2016, 797.85, 1623709, 797.34, 803, 792.92
12/14/2016, 797.07, 1700875, 797.4, 804, 794.01
12/13/2016, 796.1, 2122735, 793.9, 804.3799, 793.34
12/12/2016, 789.27, 2102288, 785.04, 791.25, 784.3554
12/09/2016, 789.29, 1821146, 780, 789.43, 779.021
12/08/2016, 776.42, 1487517, 772.48, 778.18, 767.23
12/07/2016, 771.19, 1757710, 761, 771.36, 755.8
12/06/2016, 759.11, 1690365, 764.73, 768.83, 757.34
12/05/2016, 762.52, 1393566, 757.71, 763.9, 752.9
12/02/2016, 750.5, 1452181, 744.59, 754, 743.1
12/01/2016, 747.92, 3017001, 757.44, 759.85, 737.0245
11/30/2016, 758.04, 2386628, 770.07, 772.99, 754.83
11/29/2016, 770.84, 1616427, 771.53, 778.5, 768.24
11/28/2016, 768.24, 2177039, 760, 779.53, 759.8
11/25/2016, 761.68, 587421, 764.26, 765, 760.52
11/23/2016, 760.99, 1477501, 767.73, 768.2825, 755.25
11/22/2016, 768.27, 1592372, 772.63, 776.96, 767
11/21/2016, 769.2, 1324431, 762.61, 769.7, 760.6
11/18/2016, 760.54, 1528555, 771.37, 775, 760
11/17/2016, 771.23, 1298484, 766.92, 772.7, 764.23
11/16/2016, 764.48, 1468196, 755.2, 766.36, 750.51
11/15/2016, 758.49, 2375056, 746.97, 764.4162, 746.97
11/14/2016, 736.08, 3644965, 755.6, 757.85, 727.54
11/11/2016, 754.02, 2421889, 756.54, 760.78, 750.38
11/10/2016, 762.56, 4733916, 791.17, 791.17, 752.18
11/09/2016, 785.31, 2603860, 779.94, 791.2265, 771.67
11/08/2016, 790.51, 1361472, 783.4, 795.633, 780.19
11/07/2016, 782.52, 1574426, 774.5, 785.19, 772.55
11/04/2016, 762.02, 2131948, 750.66, 770.36, 750.5611
11/03/2016, 762.13, 1933937, 767.25, 769.95, 759.03
11/02/2016, 768.7, 1905814, 778.2, 781.65, 763.4496
11/01/2016, 783.61, 2404898, 782.89, 789.49, 775.54
10/31/2016, 784.54, 2420892, 795.47, 796.86, 784
10/28/2016, 795.37, 4261912, 808.35, 815.49, 793.59
10/27/2016, 795.35, 2723097, 801, 803.49, 791.5
10/26/2016, 799.07, 1645403, 806.34, 806.98, 796.32
10/25/2016, 807.67, 1575020, 816.68, 816.68, 805.14
10/24/2016, 813.11, 1693162, 804.9, 815.18, 804.82
10/21/2016, 799.37, 1262042, 795, 799.5, 794
10/20/2016, 796.97, 1755546, 803.3, 803.97, 796.03
10/19/2016, 801.56, 1762990, 798.86, 804.63, 797.635
10/18/2016, 795.26, 2046338, 787.85, 801.61, 785.565
10/17/2016, 779.96, 1091524, 779.8, 785.85, 777.5
10/14/2016, 778.53, 851512, 781.65, 783.95, 776
10/13/2016, 778.19, 1360619, 781.22, 781.22, 773
10/12/2016, 786.14, 935138, 783.76, 788.13, 782.06
10/11/2016, 783.07, 1371461, 786.66, 792.28, 780.58
10/10/2016, 785.94, 1161410, 777.71, 789.38, 775.87
10/07/2016, 775.08, 932444, 779.66, 779.66, 770.75
10/06/2016, 776.86, 1066910, 779, 780.48, 775.54
10/05/2016, 776.47, 1457661, 779.31, 782.07, 775.65
10/04/2016, 776.43, 1198361, 776.03, 778.71, 772.89
10/03/2016, 772.56, 1276614, 774.25, 776.065, 769.5
09/30/2016, 777.29, 1583293, 776.33, 780.94, 774.09
09/29/2016, 775.01, 1310252, 781.44, 785.8, 774.232
09/28/2016, 781.56, 1108249, 777.85, 781.81, 774.97
09/27/2016, 783.01, 1152760, 775.5, 785.9899, 774.308
09/26/2016, 774.21, 1531788, 782.74, 782.74, 773.07
09/23/2016, 786.9, 1411439, 786.59, 788.93, 784.15
09/22/2016, 787.21, 1483899, 780, 789.85, 778.44
09/21/2016, 776.22, 1166290, 772.66, 777.16, 768.301
09/20/2016, 771.41, 975434, 769, 773.33, 768.53
09/19/2016, 765.7, 1171969, 772.42, 774, 764.4406
09/16/2016, 768.88, 2047036, 769.75, 769.75, 764.66
09/15/2016, 771.76, 1344945, 762.89, 773.8, 759.96
09/14/2016, 762.49, 1093723, 759.61, 767.68, 759.11
09/13/2016, 759.69, 1394158, 764.48, 766.2195, 755.8
09/12/2016, 769.02, 1310493, 755.13, 770.29, 754.0001
09/09/2016, 759.66, 1879903, 770.1, 773.245, 759.66
09/08/2016, 775.32, 1268663, 778.59, 780.35, 773.58
09/07/2016, 780.35, 893874, 780, 782.73, 776.2
09/06/2016, 780.08, 1441864, 773.45, 782, 771
09/02/2016, 771.46, 1070725, 773.01, 773.9199, 768.41
09/01/2016, 768.78, 925019, 769.25, 771.02, 764.3
08/31/2016, 767.05, 1247937, 767.01, 769.09, 765.38
08/30/2016, 769.09, 1129932, 769.33, 774.466, 766.84
08/29/2016, 772.15, 847537, 768.74, 774.99, 766.615
08/26/2016, 769.54, 1164713, 769, 776.0799, 765.85
08/25/2016, 769.41, 926856, 767, 771.89, 763.1846
08/24/2016, 769.64, 1071569, 770.58, 774.5, 767.07
08/23/2016, 772.08, 925356, 775.48, 776.44, 771.785
08/22/2016, 772.15, 950417, 773.27, 774.54, 770.0502
08/19/2016, 775.42, 860899, 775, 777.1, 773.13
08/18/2016, 777.5, 718882, 780.01, 782.86, 777
08/17/2016, 779.91, 921666, 777.32, 780.81, 773.53
08/16/2016, 777.14, 1027836, 780.3, 780.98, 773.444
08/15/2016, 782.44, 938183, 783.75, 787.49, 780.11
08/12/2016, 783.22, 739761, 781.5, 783.395, 780.4
08/11/2016, 784.85, 971742, 785, 789.75, 782.97
08/10/2016, 784.68, 784559, 783.75, 786.8123, 782.778
08/09/2016, 784.26, 1318457, 781.1, 788.94, 780.57
08/08/2016, 781.76, 1106693, 782, 782.63, 778.091
08/05/2016, 782.22, 1799478, 773.78, 783.04, 772.34
08/04/2016, 771.61, 1139972, 772.22, 774.07, 768.795
08/03/2016, 773.18, 1283186, 767.18, 773.21, 766.82
08/02/2016, 771.07, 1782822, 768.69, 775.84, 767.85
08/01/2016, 772.88, 2697699, 761.09, 780.43, 761.09
07/29/2016, 768.79, 3830103, 772.71, 778.55, 766.77
07/28/2016, 745.91, 3473040, 747.04, 748.65, 739.3
07/27/2016, 741.77, 1509133, 738.28, 744.46, 737
07/26/2016, 738.42, 1182993, 739.04, 741.69, 734.27
07/25/2016, 739.77, 1031643, 740.67, 742.61, 737.5
07/22/2016, 742.74, 1256741, 741.86, 743.24, 736.56
07/21/2016, 738.63, 1022229, 740.36, 741.69, 735.831
07/20/2016, 741.19, 1283931, 737.33, 742.13, 737.1
07/19/2016, 736.96, 1225467, 729.89, 736.99, 729
07/18/2016, 733.78, 1284740, 722.71, 736.13, 721.19
07/15/2016, 719.85, 1277514, 725.73, 725.74, 719.055
07/14/2016, 720.95, 949456, 721.58, 722.21, 718.03
07/13/2016, 716.98, 933352, 723.62, 724, 716.85
07/12/2016, 720.64, 1336112, 719.12, 722.94, 715.91
07/11/2016, 715.09, 1107039, 708.05, 716.51, 707.24
07/08/2016, 705.63, 1573909, 699.5, 705.71, 696.435
07/07/2016, 695.36, 1303661, 698.08, 698.2, 688.215
07/06/2016, 697.77, 1411080, 689.98, 701.68, 689.09
07/05/2016, 694.49, 1462879, 696.06, 696.94, 688.88
07/01/2016, 699.21, 1344387, 692.2, 700.65, 692.1301
06/30/2016, 692.1, 1597298, 685.47, 692.32, 683.65
06/29/2016, 684.11, 1931436, 683, 687.4292, 681.41
06/28/2016, 680.04, 2169704, 678.97, 680.33, 673
06/27/2016, 668.26, 2632011, 671, 672.3, 663.284
06/24/2016, 675.22, 4442943, 675.17, 689.4, 673.45
06/23/2016, 701.87, 2166183, 697.45, 701.95, 687
06/22/2016, 697.46, 1182161, 699.06, 700.86, 693.0819
06/21/2016, 695.94, 1464836, 698.4, 702.77, 692.01
06/20/2016, 693.71, 2080645, 698.77, 702.48, 693.41
06/17/2016, 691.72, 3397720, 708.65, 708.82, 688.4515
06/16/2016, 710.36, 1981657, 714.91, 716.65, 703.26
06/15/2016, 718.92, 1213386, 719, 722.98, 717.31
06/14/2016, 718.27, 1303808, 716.48, 722.47, 713.12
06/13/2016, 718.36, 1255199, 716.51, 725.44, 716.51
06/10/2016, 719.41, 1213989, 719.47, 725.89, 716.43
06/09/2016, 728.58, 987635, 722.87, 729.54, 722.3361
06/08/2016, 728.28, 1583325, 723.96, 728.57, 720.58
06/07/2016, 716.65, 1336348, 719.84, 721.98, 716.55
06/06/2016, 716.55, 1565955, 724.91, 724.91, 714.61
06/03/2016, 722.34, 1225924, 729.27, 729.49, 720.56
06/02/2016, 730.4, 1340664, 732.5, 733.02, 724.17
06/01/2016, 734.15, 1251468, 734.53, 737.21, 730.66
05/31/2016, 735.72, 2128358, 731.74, 739.73, 731.26
05/27/2016, 732.66, 1974425, 724.01, 733.936, 724
05/26/2016, 724.12, 1573635, 722.87, 728.33, 720.28
05/25/2016, 725.27, 1629790, 720.76, 727.51, 719.7047
05/24/2016, 720.09, 1926828, 706.86, 720.97, 706.86
05/23/2016, 704.24, 1326386, 706.53, 711.4781, 704.18
05/20/2016, 709.74, 1825830, 701.62, 714.58, 700.52
05/19/2016, 700.32, 1668887, 702.36, 706, 696.8
05/18/2016, 706.63, 1765632, 703.67, 711.6, 700.63
05/17/2016, 706.23, 1999883, 715.99, 721.52, 704.11
05/16/2016, 716.49, 1316719, 709.13, 718.48, 705.65
05/13/2016, 710.83, 1307559, 711.93, 716.6619, 709.26
05/12/2016, 713.31, 1361170, 717.06, 719.25, 709
05/11/2016, 715.29, 1690862, 723.41, 724.48, 712.8
05/10/2016, 723.18, 1568621, 716.75, 723.5, 715.72
05/09/2016, 712.9, 1509892, 712, 718.71, 710
05/06/2016, 711.12, 1828508, 698.38, 711.86, 698.1067
05/05/2016, 701.43, 1680220, 697.7, 702.3199, 695.72
05/04/2016, 695.7, 1692757, 690.49, 699.75, 689.01
05/03/2016, 692.36, 1541297, 696.87, 697.84, 692
05/02/2016, 698.21, 1645013, 697.63, 700.64, 691
04/29/2016, 693.01, 2486584, 690.7, 697.62, 689
04/28/2016, 691.02, 2859790, 708.26, 714.17, 689.55
04/27/2016, 705.84, 3094905, 707.29, 708.98, 692.3651
04/26/2016, 708.14, 2739133, 725.42, 725.766, 703.0264
04/25/2016, 723.15, 1956956, 716.1, 723.93, 715.59
04/22/2016, 718.77, 5949699, 726.3, 736.12, 713.61
04/21/2016, 759.14, 2995094, 755.38, 760.45, 749.55
04/20/2016, 752.67, 1526776, 758, 758.1315, 750.01
04/19/2016, 753.93, 2027962, 769.51, 769.9, 749.33
04/18/2016, 766.61, 1557199, 760.46, 768.05, 757.3
04/15/2016, 759, 1807062, 753.98, 761, 752.6938
04/14/2016, 753.2, 1134056, 754.01, 757.31, 752.705
04/13/2016, 751.72, 1707397, 749.16, 754.38, 744.261
04/12/2016, 743.09, 1349780, 738, 743.83, 731.01
04/11/2016, 736.1, 1218789, 743.02, 745, 736.05
04/08/2016, 739.15, 1289869, 743.97, 745.45, 735.55
04/07/2016, 740.28, 1452369, 745.37, 746.9999, 736.28
04/06/2016, 745.69, 1052171, 735.77, 746.24, 735.56
04/05/2016, 737.8, 1130817, 738, 742.8, 735.37
04/04/2016, 745.29, 1134214, 750.06, 752.8, 742.43
04/01/2016, 749.91, 1576240, 738.6, 750.34, 737
03/31/2016, 744.95, 1718638, 749.25, 750.85, 740.94
03/30/2016, 750.53, 1782278, 750.1, 757.88, 748.74
03/29/2016, 744.77, 1902254, 734.59, 747.25, 728.76
03/28/2016, 733.53, 1300817, 736.79, 738.99, 732.5
03/24/2016, 735.3, 1570474, 732.01, 737.747, 731
03/23/2016, 738.06, 1431130, 742.36, 745.7199, 736.15
03/22/2016, 740.75, 1269263, 737.46, 745, 737.46
03/21/2016, 742.09, 1835963, 736.5, 742.5, 733.5157
03/18/2016, 737.6, 2982194, 741.86, 742, 731.83
03/17/2016, 737.78, 1859562, 736.45, 743.07, 736
03/16/2016, 736.09, 1621412, 726.37, 737.47, 724.51
03/15/2016, 728.33, 1720790, 726.92, 732.29, 724.77
03/14/2016, 730.49, 1717002, 726.81, 735.5, 725.15
03/11/2016, 726.82, 1968164, 720, 726.92, 717.125
03/10/2016, 712.82, 2830630, 708.12, 716.44, 703.36
03/09/2016, 705.24, 1419661, 698.47, 705.68, 694
03/08/2016, 693.97, 2075305, 688.59, 703.79, 685.34
03/07/2016, 695.16, 2986064, 706.9, 708.0912, 686.9
03/04/2016, 710.89, 1971379, 714.99, 716.49, 706.02
03/03/2016, 712.42, 1956958, 718.68, 719.45, 706.02
03/02/2016, 718.85, 1629501, 719, 720, 712
03/01/2016, 718.81, 2148608, 703.62, 718.81, 699.77
02/29/2016, 697.77, 2478214, 700.32, 710.89, 697.68
02/26/2016, 705.07, 2241785, 708.58, 713.43, 700.86
02/25/2016, 705.75, 1640430, 700.01, 705.98, 690.585
02/24/2016, 699.56, 1961258, 688.92, 700, 680.78
02/23/2016, 695.85, 2006572, 701.45, 708.4, 693.58
02/22/2016, 706.46, 1949046, 707.45, 713.24, 702.51
02/19/2016, 700.91, 1585152, 695.03, 703.0805, 694.05
02/18/2016, 697.35, 1880306, 710, 712.35, 696.03
02/17/2016, 708.4, 2490021, 699, 709.75, 691.38
02/16/2016, 691, 2517324, 692.98, 698, 685.05
02/12/2016, 682.4, 2138937, 690.26, 693.75, 678.6
02/11/2016, 683.11, 3021587, 675, 689.35, 668.8675
02/10/2016, 684.12, 2629130, 686.86, 701.31, 682.13
02/09/2016, 678.11, 3605792, 672.32, 699.9, 668.77
02/08/2016, 682.74, 4241416, 667.85, 684.03, 663.06
02/05/2016, 683.57, 5098357, 703.87, 703.99, 680.15
02/04/2016, 708.01, 5157988, 722.81, 727, 701.86
02/03/2016, 726.95, 6166731, 770.22, 774.5, 720.5
02/02/2016, 764.65, 6340548, 784.5, 789.8699, 764.65
02/01/2016, 752, 5065235, 750.46, 757.86, 743.27
01/29/2016, 742.95, 3464432, 731.53, 744.9899, 726.8
01/28/2016, 730.96, 2664956, 722.22, 733.69, 712.35
01/27/2016, 699.99, 2175913, 713.67, 718.235, 694.39
01/26/2016, 713.04, 1329141, 713.85, 718.28, 706.48
01/25/2016, 711.67, 1709777, 723.58, 729.68, 710.01
01/22/2016, 725.25, 2009951, 723.6, 728.13, 720.121
01/21/2016, 706.59, 2411079, 702.18, 719.19, 694.46
01/20/2016, 698.45, 3441642, 688.61, 706.85, 673.26
01/19/2016, 701.79, 2264747, 703.3, 709.98, 693.4101
01/15/2016, 694.45, 3604137, 692.29, 706.74, 685.37
01/14/2016, 714.72, 2225495, 705.38, 721.925, 689.1
01/13/2016, 700.56, 2497086, 730.85, 734.74, 698.61
01/12/2016, 726.07, 2010026, 721.68, 728.75, 717.3165
01/11/2016, 716.03, 2089495, 716.61, 718.855, 703.54
01/08/2016, 714.47, 2449420, 731.45, 733.23, 713
01/07/2016, 726.39, 2960578, 730.31, 738.5, 719.06
01/06/2016, 743.62, 1943685, 730, 747.18, 728.92
01/05/2016, 742.58, 1949386, 746.45, 752, 738.64
01/04/2016, 741.84, 3271348, 743, 744.06, 731.2577
12/31/2015, 758.88, 1500129, 769.5, 769.5, 758.34
12/30/2015, 771, 1293514, 776.6, 777.6, 766.9
12/29/2015, 776.6, 1764044, 766.69, 779.98, 766.43
12/28/2015, 762.51, 1515574, 752.92, 762.99, 749.52
12/24/2015, 748.4, 527223, 749.55, 751.35, 746.62
12/23/2015, 750.31, 1566723, 753.47, 754.21, 744
12/22/2015, 750, 1365420, 751.65, 754.85, 745.53
12/21/2015, 747.77, 1524535, 746.13, 750, 740
12/18/2015, 739.31, 3140906, 746.51, 754.13, 738.15
12/17/2015, 749.43, 1551087, 762.42, 762.68, 749
12/16/2015, 758.09, 1986319, 750, 760.59, 739.435
12/15/2015, 743.4, 2661199, 753, 758.08, 743.01
12/14/2015, 747.77, 2417778, 741.79, 748.73, 724.17
12/11/2015, 738.87, 2223284, 741.16, 745.71, 736.75
12/10/2015, 749.46, 1988035, 752.85, 755.85, 743.83
12/09/2015, 751.61, 2697978, 759.17, 764.23, 737.001
12/08/2015, 762.37, 1829004, 757.89, 764.8, 754.2
12/07/2015, 763.25, 1811336, 767.77, 768.73, 755.09
12/04/2015, 766.81, 2756194, 753.1, 768.49, 750
12/03/2015, 752.54, 2589641, 766.01, 768.995, 745.63
12/02/2015, 762.38, 2196721, 768.9, 775.955, 758.96
12/01/2015, 767.04, 2131827, 747.11, 768.95, 746.7
11/30/2015, 742.6, 2045584, 748.81, 754.93, 741.27
11/27/2015, 750.26, 838528, 748.46, 753.41, 747.49
11/25/2015, 748.15, 1122224, 748.14, 752, 746.06
11/24/2015, 748.28, 2333700, 752, 755.279, 737.63
11/23/2015, 755.98, 1414640, 757.45, 762.7075, 751.82
11/20/2015, 756.6, 2212934, 746.53, 757.92, 743
11/19/2015, 738.41, 1327265, 738.74, 742, 737.43
11/18/2015, 740, 1683978, 727.58, 741.41, 727
11/17/2015, 725.3, 1507449, 729.29, 731.845, 723.027
11/16/2015, 728.96, 1904395, 715.6, 729.49, 711.33
11/13/2015, 717, 2072392, 729.17, 731.15, 716.73
11/12/2015, 731.23, 1836567, 731, 737.8, 728.645
11/11/2015, 735.4, 1366611, 732.46, 741, 730.23
11/10/2015, 728.32, 1606499, 724.4, 730.59, 718.5001
11/09/2015, 724.89, 2068920, 730.2, 734.71, 719.43
11/06/2015, 733.76, 1510586, 731.5, 735.41, 727.01
11/05/2015, 731.25, 1861100, 729.47, 739.48, 729.47
11/04/2015, 728.11, 1705745, 722, 733.1, 721.9
11/03/2015, 722.16, 1565355, 718.86, 724.65, 714.72
11/02/2015, 721.11, 1885155, 711.06, 721.62, 705.85
10/30/2015, 710.81, 1907732, 715.73, 718, 710.05
10/29/2015, 716.92, 1455508, 710.5, 718.26, 710.01
10/28/2015, 712.95, 2178841, 707.33, 712.98, 703.08
10/27/2015, 708.49, 2232183, 707.38, 713.62, 704.55
10/26/2015, 712.78, 2709292, 701.55, 719.15, 701.26
10/23/2015, 702, 6651909, 727.5, 730, 701.5
10/22/2015, 651.79, 3994360, 646.7, 657.8, 644.01
10/21/2015, 642.61, 1792869, 654.15, 655.87, 641.73
10/20/2015, 650.28, 2498077, 664.04, 664.7197, 644.195
10/19/2015, 666.1, 1465691, 661.18, 666.82, 659.58
10/16/2015, 662.2, 1610712, 664.11, 664.97, 657.2
10/15/2015, 661.74, 1832832, 654.66, 663.13, 654.46
10/14/2015, 651.16, 1413798, 653.21, 659.39, 648.85
10/13/2015, 652.3, 1806003, 643.15, 657.8125, 643.15
10/12/2015, 646.67, 1275565, 642.09, 648.5, 639.01
10/09/2015, 643.61, 1648656, 640, 645.99, 635.318
10/08/2015, 639.16, 2181990, 641.36, 644.45, 625.56
10/07/2015, 642.36, 2092536, 649.24, 650.609, 632.15
10/06/2015, 645.44, 2235078, 638.84, 649.25, 636.5295
10/05/2015, 641.47, 1802263, 632, 643.01, 627
10/02/2015, 626.91, 2681241, 607.2, 627.34, 603.13
10/01/2015, 611.29, 1866223, 608.37, 612.09, 599.85
09/30/2015, 608.42, 2412754, 603.28, 608.76, 600.73
09/29/2015, 594.97, 2310065, 597.28, 605, 590.22
09/28/2015, 594.89, 3118693, 610.34, 614.605, 589.38
09/25/2015, 611.97, 2173134, 629.77, 629.77, 611
09/24/2015, 625.8, 2238097, 616.64, 627.32, 612.4
09/23/2015, 622.36, 1470633, 622.05, 628.93, 620
09/22/2015, 622.69, 2561551, 627, 627.55, 615.43
09/21/2015, 635.44, 1786543, 634.4, 636.49, 625.94
09/18/2015, 629.25, 5123314, 636.79, 640, 627.02
09/17/2015, 642.9, 2259404, 637.79, 650.9, 635.02
09/16/2015, 635.98, 1276250, 635.47, 637.95, 632.32
09/15/2015, 635.14, 2082426, 626.7, 638.7, 623.78
09/14/2015, 623.24, 1701618, 625.7, 625.86, 619.43
09/11/2015, 625.77, 1372803, 619.75, 625.78, 617.42
09/10/2015, 621.35, 1903334, 613.1, 624.16, 611.43
09/09/2015, 612.72, 1699686, 621.22, 626.52, 609.6
09/08/2015, 614.66, 2277487, 612.49, 616.31, 604.12
09/04/2015, 600.7, 2087028, 600, 603.47, 595.25
09/03/2015, 606.25, 1757851, 617, 619.71, 602.8213
09/02/2015, 614.34, 2573982, 605.59, 614.34, 599.71
09/01/2015, 597.79, 3699844, 602.36, 612.86, 594.1
08/31/2015, 618.25, 2172168, 627.54, 635.8, 617.68
08/28/2015, 630.38, 1975818, 632.82, 636.88, 624.56
08/27/2015, 637.61, 3485906, 639.4, 643.59, 622
08/26/2015, 628.62, 4187276, 610.35, 631.71, 599.05
08/25/2015, 582.06, 3521916, 614.91, 617.45, 581.11
08/24/2015, 589.61, 5727282, 573, 614, 565.05
08/21/2015, 612.48, 4261666, 639.78, 640.05, 612.33
08/20/2015, 646.83, 2854028, 655.46, 662.99, 642.9
08/19/2015, 660.9, 2132265, 656.6, 667, 654.19
08/18/2015, 656.13, 1455664, 661.9, 664, 653.46
08/17/2015, 660.87, 1050553, 656.8, 661.38, 651.24
08/14/2015, 657.12, 1071333, 655.01, 659.855, 652.66
08/13/2015, 656.45, 1807182, 659.323, 664.5, 651.661
08/12/2015, 659.56, 2938651, 663.08, 665, 652.29
08/11/2015, 660.78, 5016425, 669.2, 674.9, 654.27
08/10/2015, 633.73, 1653836, 639.48, 643.44, 631.249
08/07/2015, 635.3, 1403441, 640.23, 642.68, 629.71
08/06/2015, 642.68, 1572150, 645, 645.379, 632.25
08/05/2015, 643.78, 2331720, 634.33, 647.86, 633.16
08/04/2015, 629.25, 1486858, 628.42, 634.81, 627.16
08/03/2015, 631.21, 1301439, 625.34, 633.0556, 625.34
07/31/2015, 625.61, 1705286, 631.38, 632.91, 625.5
07/30/2015, 632.59, 1472286, 630, 635.22, 622.05
07/29/2015, 631.93, 1573146, 628.8, 633.36, 622.65
07/28/2015, 628, 1713684, 632.83, 632.83, 623.31
07/27/2015, 627.26, 2673801, 621, 634.3, 620.5
07/24/2015, 623.56, 3622089, 647, 648.17, 622.52
07/23/2015, 644.28, 3014035, 661.27, 663.63, 641
07/22/2015, 662.1, 3707818, 660.89, 678.64, 659
07/21/2015, 662.3, 3363342, 655.21, 673, 654.3
07/20/2015, 663.02, 5857092, 659.24, 668.88, 653.01
07/17/2015, 672.93, 11153500, 649, 674.468, 645
07/16/2015, 579.85, 4559712, 565.12, 580.68, 565
07/15/2015, 560.22, 1782264, 560.13, 566.5029, 556.79
07/14/2015, 561.1, 3231284, 546.76, 565.8487, 546.71
07/13/2015, 546.55, 2204610, 532.88, 547.11, 532.4001
07/10/2015, 530.13, 1954951, 526.29, 532.56, 525.55
07/09/2015, 520.68, 1840155, 523.12, 523.77, 520.35
07/08/2015, 516.83, 1293372, 521.05, 522.734, 516.11
07/07/2015, 525.02, 1595672, 523.13, 526.18, 515.18
07/06/2015, 522.86, 1278587, 519.5, 525.25, 519
07/02/2015, 523.4, 1235773, 521.08, 524.65, 521.08
07/01/2015, 521.84, 1961197, 524.73, 525.69, 518.2305
06/30/2015, 520.51, 2234284, 526.02, 526.25, 520.5
06/29/2015, 521.52, 1935361, 525.01, 528.61, 520.54
06/26/2015, 531.69, 2108629, 537.26, 537.76, 531.35
06/25/2015, 535.23, 1332412, 538.87, 540.9, 535.23
06/24/2015, 537.84, 1286576, 540, 540, 535.66
06/23/2015, 540.48, 1196115, 539.64, 541.499, 535.25
06/22/2015, 538.19, 1243535, 539.59, 543.74, 537.53
06/19/2015, 536.69, 1890916, 537.21, 538.25, 533.01
06/18/2015, 536.73, 1832450, 531, 538.15, 530.79
06/17/2015, 529.26, 1269113, 529.37, 530.98, 525.1
06/16/2015, 528.15, 1071728, 528.4, 529.6399, 525.56
06/15/2015, 527.2, 1632675, 528, 528.3, 524
06/12/2015, 532.33, 955489, 531.6, 533.12, 530.16
06/11/2015, 534.61, 1208632, 538.425, 538.98, 533.02
06/10/2015, 536.69, 1813775, 529.36, 538.36, 529.35
06/09/2015, 526.69, 1454172, 527.56, 529.2, 523.01
06/08/2015, 526.83, 1523960, 533.31, 534.12, 526.24
06/05/2015, 533.33, 1375008, 536.35, 537.2, 532.52
06/04/2015, 536.7, 1346044, 537.76, 540.59, 534.32
06/03/2015, 540.31, 1716836, 539.91, 543.5, 537.11
06/02/2015, 539.18, 1936721, 532.93, 543, 531.33
06/01/2015, 533.99, 1900257, 536.79, 536.79, 529.76
05/29/2015, 532.11, 2590445, 537.37, 538.63, 531.45
05/28/2015, 539.78, 1029764, 538.01, 540.61, 536.25
05/27/2015, 539.79, 1524783, 532.8, 540.55, 531.71
05/26/2015, 532.32, 2404462, 538.12, 539, 529.88
05/22/2015, 540.11, 1175065, 540.15, 544.19, 539.51
05/21/2015, 542.51, 1461431, 537.95, 543.8399, 535.98
05/20/2015, 539.27, 1430565, 538.49, 542.92, 532.972
05/19/2015, 537.36, 1964037, 533.98, 540.66, 533.04
05/18/2015, 532.3, 2001117, 532.01, 534.82, 528.85
05/15/2015, 533.85, 1965088, 539.18, 539.2743, 530.38
05/14/2015, 538.4, 1401005, 533.77, 539, 532.41
05/13/2015, 529.62, 1253005, 530.56, 534.3215, 528.655
05/12/2015, 529.04, 1633180, 531.6, 533.2089, 525.26
05/11/2015, 535.7, 904465, 538.37, 541.98, 535.4
05/08/2015, 538.22, 1527181, 536.65, 541.15, 536
05/07/2015, 530.7, 1543986, 523.99, 533.46, 521.75
05/06/2015, 524.22, 1566865, 531.24, 532.38, 521.085
05/05/2015, 530.8, 1380519, 538.21, 539.74, 530.3906
05/04/2015, 540.78, 1303830, 538.53, 544.07, 535.06
05/01/2015, 537.9, 1758085, 538.43, 539.54, 532.1
04/30/2015, 537.34, 2080834, 547.87, 548.59, 535.05
04/29/2015, 549.08, 1696886, 550.47, 553.68, 546.905
04/28/2015, 553.68, 1490735, 554.64, 556.02, 550.366
04/27/2015, 555.37, 2390696, 563.39, 565.95, 553.2001
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
This is a pure Python implementation of the bogosort algorithm,
also known as permutation sort, stupid sort, slowsort, shotgun sort, or monkey sort.
Bogosort generates random permutations until it guesses the correct one.
More info on: https://en.wikipedia.org/wiki/Bogosort
For doctests run following command:
python -m doctest -v bogo_sort.py
or
python3 -m doctest -v bogo_sort.py
For manual testing run:
python bogo_sort.py
"""
import random
def bogo_sort(collection):
"""Pure implementation of the bogosort algorithm in Python
:param collection: some mutable ordered collection with heterogeneous
comparable items inside
:return: the same collection ordered by ascending
Examples:
>>> bogo_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> bogo_sort([])
[]
>>> bogo_sort([-2, -5, -45])
[-45, -5, -2]
"""
def is_sorted(collection):
if len(collection) < 2:
return True
for i in range(len(collection) - 1):
if collection[i] > collection[i + 1]:
return False
return True
while not is_sorted(collection):
random.shuffle(collection)
return collection
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(bogo_sort(unsorted))
| """
This is a pure Python implementation of the bogosort algorithm,
also known as permutation sort, stupid sort, slowsort, shotgun sort, or monkey sort.
Bogosort generates random permutations until it guesses the correct one.
More info on: https://en.wikipedia.org/wiki/Bogosort
For doctests run following command:
python -m doctest -v bogo_sort.py
or
python3 -m doctest -v bogo_sort.py
For manual testing run:
python bogo_sort.py
"""
import random
def bogo_sort(collection):
"""Pure implementation of the bogosort algorithm in Python
:param collection: some mutable ordered collection with heterogeneous
comparable items inside
:return: the same collection ordered by ascending
Examples:
>>> bogo_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> bogo_sort([])
[]
>>> bogo_sort([-2, -5, -45])
[-45, -5, -2]
"""
def is_sorted(collection):
if len(collection) < 2:
return True
for i in range(len(collection) - 1):
if collection[i] > collection[i + 1]:
return False
return True
while not is_sorted(collection):
random.shuffle(collection)
return collection
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(bogo_sort(unsorted))
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Champernowne's constant
Problem 40
An irrational decimal fraction is created by concatenating the positive
integers:
0.123456789101112131415161718192021...
It can be seen that the 12th digit of the fractional part is 1.
If dn represents the nth digit of the fractional part, find the value of the
following expression.
d1 × d10 × d100 × d1000 × d10000 × d100000 × d1000000
"""
def solution():
"""Returns
>>> solution()
210
"""
constant = []
i = 1
while len(constant) < 1e6:
constant.append(str(i))
i += 1
constant = "".join(constant)
return (
int(constant[0])
* int(constant[9])
* int(constant[99])
* int(constant[999])
* int(constant[9999])
* int(constant[99999])
* int(constant[999999])
)
if __name__ == "__main__":
print(solution())
| """
Champernowne's constant
Problem 40
An irrational decimal fraction is created by concatenating the positive
integers:
0.123456789101112131415161718192021...
It can be seen that the 12th digit of the fractional part is 1.
If dn represents the nth digit of the fractional part, find the value of the
following expression.
d1 × d10 × d100 × d1000 × d10000 × d100000 × d1000000
"""
def solution():
"""Returns
>>> solution()
210
"""
constant = []
i = 1
while len(constant) < 1e6:
constant.append(str(i))
i += 1
constant = "".join(constant)
return (
int(constant[0])
* int(constant[9])
* int(constant[99])
* int(constant[999])
* int(constant[9999])
* int(constant[99999])
* int(constant[999999])
)
if __name__ == "__main__":
print(solution())
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| r"""
Problem:
The n queens problem is: placing N queens on a N * N chess board such that no queen
can attack any other queens placed on that chess board. This means that one queen
cannot have any other queen on its horizontal, vertical and diagonal lines.
Solution:
To solve this problem we will use simple math. First we know the queen can move in all
the possible ways, we can simplify it in this: vertical, horizontal, diagonal left and
diagonal right.
We can visualize it like this:
left diagonal = \
right diagonal = /
On a chessboard vertical movement could be the rows and horizontal movement could be
the columns.
In programming we can use an array, and in this array each index could be the rows and
each value in the array could be the column. For example:
. Q . . We have this chessboard with one queen in each column and each queen
. . . Q can't attack to each other.
Q . . . The array for this example would look like this: [1, 3, 0, 2]
. . Q .
So if we use an array and we verify that each value in the array is different to each
other we know that at least the queens can't attack each other in horizontal and
vertical.
At this point we have it halfway completed and we will treat the chessboard as a
Cartesian plane. Hereinafter we are going to remember basic math, so in the school we
learned this formula:
Slope of a line:
y2 - y1
m = ----------
x2 - x1
This formula allow us to get the slope. For the angles 45º (right diagonal) and 135º
(left diagonal) this formula gives us m = 1, and m = -1 respectively.
See::
https://www.enotes.com/homework-help/write-equation-line-that-hits-origin-45-degree-1474860
Then we have this other formula:
Slope intercept:
y = mx + b
b is where the line crosses the Y axis (to get more information see:
https://www.mathsisfun.com/y_intercept.html), if we change the formula to solve for b
we would have:
y - mx = b
And since we already have the m values for the angles 45º and 135º, this formula would
look like this:
45º: y - (1)x = b
45º: y - x = b
135º: y - (-1)x = b
135º: y + x = b
y = row
x = column
Applying these two formulas we can check if a queen in some position is being attacked
for another one or vice versa.
"""
from __future__ import annotations
def depth_first_search(
possible_board: list[int],
diagonal_right_collisions: list[int],
diagonal_left_collisions: list[int],
boards: list[list[str]],
n: int,
) -> None:
"""
>>> boards = []
>>> depth_first_search([], [], [], boards, 4)
>>> for board in boards:
... print(board)
['. Q . . ', '. . . Q ', 'Q . . . ', '. . Q . ']
['. . Q . ', 'Q . . . ', '. . . Q ', '. Q . . ']
"""
# Get next row in the current board (possible_board) to fill it with a queen
row = len(possible_board)
# If row is equal to the size of the board it means there are a queen in each row in
# the current board (possible_board)
if row == n:
# We convert the variable possible_board that looks like this: [1, 3, 0, 2] to
# this: ['. Q . . ', '. . . Q ', 'Q . . . ', '. . Q . ']
boards.append([". " * i + "Q " + ". " * (n - 1 - i) for i in possible_board])
return
# We iterate each column in the row to find all possible results in each row
for col in range(n):
# We apply that we learned previously. First we check that in the current board
# (possible_board) there are not other same value because if there is it means
# that there are a collision in vertical. Then we apply the two formulas we
# learned before:
#
# 45º: y - x = b or 45: row - col = b
# 135º: y + x = b or row + col = b.
#
# And we verify if the results of this two formulas not exist in their variables
# respectively. (diagonal_right_collisions, diagonal_left_collisions)
#
# If any or these are True it means there is a collision so we continue to the
# next value in the for loop.
if (
col in possible_board
or row - col in diagonal_right_collisions
or row + col in diagonal_left_collisions
):
continue
# If it is False we call dfs function again and we update the inputs
depth_first_search(
possible_board + [col],
diagonal_right_collisions + [row - col],
diagonal_left_collisions + [row + col],
boards,
n,
)
def n_queens_solution(n: int) -> None:
boards: list[list[str]] = []
depth_first_search([], [], [], boards, n)
# Print all the boards
for board in boards:
for column in board:
print(column)
print("")
print(len(boards), "solutions were found.")
if __name__ == "__main__":
import doctest
doctest.testmod()
n_queens_solution(4)
| r"""
Problem:
The n queens problem is: placing N queens on a N * N chess board such that no queen
can attack any other queens placed on that chess board. This means that one queen
cannot have any other queen on its horizontal, vertical and diagonal lines.
Solution:
To solve this problem we will use simple math. First we know the queen can move in all
the possible ways, we can simplify it in this: vertical, horizontal, diagonal left and
diagonal right.
We can visualize it like this:
left diagonal = \
right diagonal = /
On a chessboard vertical movement could be the rows and horizontal movement could be
the columns.
In programming we can use an array, and in this array each index could be the rows and
each value in the array could be the column. For example:
. Q . . We have this chessboard with one queen in each column and each queen
. . . Q can't attack to each other.
Q . . . The array for this example would look like this: [1, 3, 0, 2]
. . Q .
So if we use an array and we verify that each value in the array is different to each
other we know that at least the queens can't attack each other in horizontal and
vertical.
At this point we have it halfway completed and we will treat the chessboard as a
Cartesian plane. Hereinafter we are going to remember basic math, so in the school we
learned this formula:
Slope of a line:
y2 - y1
m = ----------
x2 - x1
This formula allow us to get the slope. For the angles 45º (right diagonal) and 135º
(left diagonal) this formula gives us m = 1, and m = -1 respectively.
See::
https://www.enotes.com/homework-help/write-equation-line-that-hits-origin-45-degree-1474860
Then we have this other formula:
Slope intercept:
y = mx + b
b is where the line crosses the Y axis (to get more information see:
https://www.mathsisfun.com/y_intercept.html), if we change the formula to solve for b
we would have:
y - mx = b
And since we already have the m values for the angles 45º and 135º, this formula would
look like this:
45º: y - (1)x = b
45º: y - x = b
135º: y - (-1)x = b
135º: y + x = b
y = row
x = column
Applying these two formulas we can check if a queen in some position is being attacked
for another one or vice versa.
"""
from __future__ import annotations
def depth_first_search(
possible_board: list[int],
diagonal_right_collisions: list[int],
diagonal_left_collisions: list[int],
boards: list[list[str]],
n: int,
) -> None:
"""
>>> boards = []
>>> depth_first_search([], [], [], boards, 4)
>>> for board in boards:
... print(board)
['. Q . . ', '. . . Q ', 'Q . . . ', '. . Q . ']
['. . Q . ', 'Q . . . ', '. . . Q ', '. Q . . ']
"""
# Get next row in the current board (possible_board) to fill it with a queen
row = len(possible_board)
# If row is equal to the size of the board it means there are a queen in each row in
# the current board (possible_board)
if row == n:
# We convert the variable possible_board that looks like this: [1, 3, 0, 2] to
# this: ['. Q . . ', '. . . Q ', 'Q . . . ', '. . Q . ']
boards.append([". " * i + "Q " + ". " * (n - 1 - i) for i in possible_board])
return
# We iterate each column in the row to find all possible results in each row
for col in range(n):
# We apply that we learned previously. First we check that in the current board
# (possible_board) there are not other same value because if there is it means
# that there are a collision in vertical. Then we apply the two formulas we
# learned before:
#
# 45º: y - x = b or 45: row - col = b
# 135º: y + x = b or row + col = b.
#
# And we verify if the results of this two formulas not exist in their variables
# respectively. (diagonal_right_collisions, diagonal_left_collisions)
#
# If any or these are True it means there is a collision so we continue to the
# next value in the for loop.
if (
col in possible_board
or row - col in diagonal_right_collisions
or row + col in diagonal_left_collisions
):
continue
# If it is False we call dfs function again and we update the inputs
depth_first_search(
possible_board + [col],
diagonal_right_collisions + [row - col],
diagonal_left_collisions + [row + col],
boards,
n,
)
def n_queens_solution(n: int) -> None:
boards: list[list[str]] = []
depth_first_search([], [], [], boards, n)
# Print all the boards
for board in boards:
for column in board:
print(column)
print("")
print(len(boards), "solutions were found.")
if __name__ == "__main__":
import doctest
doctest.testmod()
n_queens_solution(4)
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| JFIF C
C
"
L !1AQ"aq2 #BR$3bCr4DS
%&5cs < !1AQ"aq2#B3R$br4 ? N49 Ԑz?{!yV4J&9gPZs)o9D`'>vO.~l-yl6&vg*Z;R>UTD|~dZB>
sը);Iȍ b˭%4I`~ ֶMvNxNNa6Cָ!K4K;r kg=VtIB4ʂ]5&< Zŕ.ց9ԓ=3Í/u
Bܙ4-, \&T^#SNϣҐ<CRb>lKt2B,"B΅C9-ʅI$ӕ5Dh
ay 2j2Nץ5Zʛ%2|@7NR u K'Q(ZBBBwsnm_mP :Nn$,AܒOϺ4*9 3"<WXo9]В%|^zDGwB
&4jm%OPV6vAXUQH)IJs-KH$e^sKvZ%H$@
bu$D|c
:PiH
78g! ФƇk@>Gcu4TAK O+CAKpĥ<B,D sk~eD:T{Cϗם{/ n%!˩Iנ
AHXBe͐i _,)Ƴ8S 6q+rT-*Y1[~zR$ "H}U Y OC?K}R PgM<!6NKmLP 'Y*7I2O!d> L\@1oƲ
饦麁s^PA9_+Xb>?'JJJ\ԡ
IuuSJLV|[ n 9\yhԲ x\/!ne^CMm+w*RtN6J#0L> KV]{ Au *IHRڢ{K{M*
ꖣ07rYP KnF4X)XKn&EЍto-\e%CCoJSa.xAyoΊ^ ">iisEC hHML kt ^R oiF Ioa $,x`'Cî )GA
s?{$2][*[fS*Iͩ )T2J |:ya^ (j(n
g]'elғ*x<d:(jL
":u}2t ̥?bsR1ܢӀӤ)9Zu
6Kf ˖m-
}9|pD:ہ@
A>ZͻV}BID h:mjg+kD{I/
u0|ڋ,Hd O[g܆XK2mmp8R`9ءS.% Nwrp0 1VIJ@3ݑw:RN-@coo!>ebDq}K&D}ej
cA DM㍩PJO0ck+^7MM^.ռD[JN*(CJ'VRըTNv3ķ5=c/6 ,.c/
6A3v?dWx7C qJap
\z~eM<h#Q ^ݰZKrx-}xm2*!tI'sc#4vϒڦ[;Um+TUg)v!é9I;sm!=@ ( [mm>)A˷>{-Gw0d\m-ތ̋ymԤ&4H2v%hPs )*W(rz}OpxVF OCLy(}5U.b6
y
$APk*S%&R%Z֥u.6@$3VKU ʒA iem6ܪ}k "i]er4g+b5tHFPvոlc(v R+
ZFҵg >! {Jv0 8*lV{x[; |B/kޯWt-KI<a;IRKY۔!~FjiBe~&?ChTDr}-ޡf"'arSnc!&6RIrRcc{*_B'R E.BT
F}ֵTٶ)tL@Fa(}*FuY uOhG g2 aT2 $#NB3;lIZ*EP?F!ًn& ?kS~`R5Iצlu<i SK Ԙ'pʑpӴ"Ώ4پ<Y Oݭ: 4;~{h-R~!HvOxH4>(KJH:ӗQ6ZqNM<t+eu*qM+myH1;YqIM1[$c@: :h,XekeYc I<u@o17XH-4Z@Vzo8%ܶ@B[Ȳ@5KuDj& uiZLi%KQ.X8j^II)Ωg}֒i!A[
JIFr- LVh!* " MƤ ҩ sBLw$OnV>JѦA)뾞vU
C--9A k4YS' <OГeEBdOtoKUt
u =4.;24nːI
HeBR@k/wN`Y ͘e">[ovnQ $O;ӭ $(ײgCR c<5YVb::V;+DZrD+IJtBb5鵾
.:.! !@$z=&5 u
LOW 'ĐHO+BԼ 9QRοMن5}ԒRxWZP=_x\ZwOvvgЍ-( g^Ӻۣ:+ {I$_o C!4Tt IˑzgNs3; < nR[^K̰H[[xZvUD4 (%)N]t u7t)iC4'Q>bv̚5- $(|\l|HBJIPЍ /;X Eq_{ʂ I\(fԧM
x ZyV\R$'Ym '8R Ttߡ em,6
ԡ( $[ x0}mC`CI gy(%A$ z .VVkd- Z|[$[xCWx m,
GFPwHJVIu
ܾ)iBx :Z
i4V))x[54JҜs&A+ L-{JqT ị P.a
^% 4d46E-9;̦yڻʰnxAz ! ( nN_ ()ʣ+6WRb硓6 :h~̓}X-6TmȎ T@-5BHrkxt66O QdD"{)*k? ,|e_r
J/lڥ,aiL2Np:uDLa
Q! FUNs6;!6`A:`ݐTIHO_vod%YS1̉oQAIYe@G+pPv<Sr 1E^T]|)]TF~A&TJ1ftExz9zЏgZwCTS6;t2弑XV6sړweYSD Ċ<cP +$+kZ=7y I|셆FG73k/qSa; ⪼/z!=KTPp
7AiT I" [T~%ݚjhK.S
'DL"XBRᵐ
JծmnE^BKǏ8u[j鄌∩iʀi`ϧ캝l@-!5ЍdiX)
ӄHrLs>VQ!j3
tm41ilnbFauw5-MItg
HKAH!S}h%H!Y-5t]Ԟ^vr"9zy!n]W4x'RRSS*
4Jh5_aѶV klo%)'çnʟAxHv As ;eo:N($NR@;͵:$"is)65 +KuwOW^S$$g42*+Ҳ3oޖqYr/1mZh1 swi&[l ZJ8bv}2 $#_i Roޜ.xوLx@;VeOJ@')vXQ^J 5QJUaVi
.li;OD@4:M+ؠ|e5xեKI0Tg4Sy 9Ao. 5iNe7Ћoc+e7y`Q~.y XDG_A4J3 Ig?ѩ4/,4AtrX5ni!
f M케_JO3MH=BOפּjVt$x:ibۉ4eWKX;HNn0a )EU<PSI:;$꽣U@;y͔jkVpRIBI:ɄPRX$)!BNF`x\H}b H~+]~$"$n4u},9J a "9?[,ڋ*z"Jɝcکu+z̍IIהK=}qa!+>?m[4e*Sm"PHM6ti Ve@'i KKIVNv%&F|f_mֵBb?fJK
19ƻG_M,%IIG
y3Z+T6
RO(x6
*h$z,51qI}>[},L!E$'h>οh jž&orUO/ <ӥ:s# b&iiK
2(@='MuX|tAAeBDx+X2uC!E2T [moN2Z SRt/)@9L(fIۂ)zN ΐLm )uJu=Ak*΅ 37<>Fj!-Z\vmmKao%)$γ z[>ð BOx`gRs&G=t1xskffS/ r#S
Z]$y (V IJ@ח7Z\x!fR e yf.qISH ^( ^V{0q(*u4&P*ݞg'^ xǰbSo u=adIYN Β_HpJ(h'h˯WK8穣S% LHAJRi?G+sG1Mթ
I h*tY#x
DfIE[O[}Jp
$V),YIʐ7 q.wnNRkFXOzṭk#qn Ɂ.-
!TBUTQQe
RQH&D;|%&H)"sk-2`lN >ՒsH YMՔ(0u;i. m%0PI1b@(JTe)[B>J]HBLISkh
5l 6eVΠϟOp e`ul1zTwPGq:Z{>RTmo7US[pɅ^-d;~- h(+6[VDăa! weiP9 30L^[HH$ JD&zٍ%XZ}Lur>#! h#g`
J0P9uw4c _;55TzoN(4*|塽{)I Hēӝqg6uMӶ[j
@W^j뒔ȃߔs|2]%}},+2H9LL}w-{wu-ۇ0"$G?QoFcLu Qfu/:Vt)0k s)6=Qf" ^ U5i AqC4F.=Nw/
̅ml#mwmb.OMC !giJhR*2
t&ڬXi<~vk*E+ʢ i U]ߚGZ]Y$L<c MC#*[(~#0 ErQVФT@gbR!Fg5Oe&`
ī*]qE@j<䏱]iPU@P&)5,w3xQ4l }~) j*aZ"H {^Z5+v"zVi)iM\vK< La*<}M< ?[j4tZD²@1[&ֹ][Z* RyP 'fpm}LS='E}Jv}*^䨨nXQ. +R)KX'Քt 6ʑ)ԝdH<6?2\ :oԼԴ!J % T^}E9ZH'q:
^
a jH NsNv`^.<~ͨ
ػ;@@vRA3[ %>&\h}Jh :/oniP #~{Tu7[ܢGjǘ6
|GM ,OqD K
\RPsNsBs̭Md6Rbe8hA 4 gJRuO+a*t{DܵxQB#~+H-*J`4W_~<D^{*J@$Ln80%Dz7ziT9By;h)p$kFH4T0V]UO{}9}Lt?qb{I[P YR`wKyȉ)ԍ` +먤Ҳۨ@ZBHW]t v쀠㑍y hr[!( T:=`=5-yw2Vmz|&!]!|F51YsK#-XRJij3=$!]M7zpH ,5KRrpʑSNsi۵%
ͩL5#t$"X
!DGM0,?ԏ3 hUd\%iP3:ǦoR[FnJP@;yGc^K
Eġ.:@@-d&T_l8N-*> Ӹ[S#2U<`w_hVІ!Fsy4e@:6)e#BLh4?;)Lֱr2
Iimʞv=hT;N[q@ NlG-6ʻh7QϮ 5q^Ub T
ꒋʊ ((锁;? L;Ë.V>$-~`Ok+t~\r \P%eBOMw x/)4%Dnrf8WnwL0ٕ)jpO$ s7r.FYI ruIica3u_UT "hi<!|-e/Ku22ΚΣb猪Cf@SKVQq5H#Q")%)Rbtϙ
~QZޤ:E& (v##,ppERSW_Ǯ,=i[
C2AQ2tTuĪW*UOU mE!BD!"@T0Jjjh6N3g
6 f$'* Sv"j
Qj7xI\q ,іEmܘ[ #*`g.eɽ+\C3:A^S' $ _YBin7J(d) s0vLｦh
(TeI21j N]E.> jt믲KWM t3Z[Z\S
c4l; 7#]5*HBD H>Ǘm
`&3- uo*i
$:2)I-<RuW>#Btt뚌5UTg/k/0ewپn
U#rNkVTYmjRVC1on"?JO]NɹC~+eМԯ)<ž7y}x?8y (Rީ}!@ HyʶJ y}͙clx9x;qΪJ[yI*;[YuM&Oq4o 9tZ*BAi5R !)^ %WL= Y qH!p d)PɕAITߟaL`lkyu{ $}+D^O&
mrj7|b++S*P HdzZvMweD:;|m?quKNRR:ykaνԸhQr& cŸ^JKRR`
be9bCí%-%(mi֒H*ghfx|ZB "g ^@^3*gyHQ8 D<;I!
; vqEX>锨gTUedRU ߵ{_̳N0BITПMjX$$kC"AMϜmQXhBj2Mr(>Z T^*
IHlٚpT2m㖕 3 <ZS0mk
:x&4 vneυ $
9G.J)Jy ڽ h+ۥE
%]I? [[k+bwݽ:$|[4ӋAJ#m:Y:hJD'~_bսhUSho H$baD "ؓ
P⋑뾡AZcgC
WS.,xi5̔G6#&qjl*nr۶fWGbJ*0帕CBا_ida1E`i&$; |m? ݐGTދ@nmJ!nT+Dӭ+Uy ԲI"w1/n-j[H-LXܧ
a ~މY/ZַV㲵 g^}l(@ e,%V;] w1J!$F"}9θhBd@~=
%lsW:R PJBr : _/!%Ax^
Q t0 Dv7jR Os6g$H@vm N4iQu
]KCC̍ ?[yS(j"4e骪^ (RTƠf5S>IV<K$#d!#$ގi)9utaĬX!$$ ]TAPH$;u> ORJ)H &co(JGRӰv ^?9 .躝ZXJ7(3uS-ƕ
zͳ
[|yչ)ǁ NX:AБڋRryqu V:l9`ꯂgLZs
/ݨ( aGY >TV7sf4L$
DzשS.R}6:6 Y B7nH.n7N[;qT]j*Bb R[@ /l)7eB[9J I ,
ќ9dzCVt%Iϩ ii)i. rA<`fLԡ 'c|>hBRXP
uP IÝe3OvT 9,N쪐RV|YA* #oR iʵ)M(s
y|)md)h2J3 {}s':Ql-e( VR3)&>͠f
TH6zŦ:)
$ r<絅XЧT2KHR) ~#[%Ydftiy V $@$~Rm
R (]EԺZ.I2N^z2[i$/A |ͣ sw)
$,(2$>C[Rj4m' ZJUm#@H8ꏅ7UUR՛[XZ*^g(<vw%j^BuZ J4h0bz뢺 Jei)SG=Iᬙ'lF\~EV }5(<$MF5xOʓ9I_+K)>n6)yFB "H/fr"z
;iJZdа%c1Ik:t|Ei7KեST! & '_Kw&4C;`59'[A>[SirTT &QtyDW:,4CMvsf*:moi}=T4*y%Y`vSkJ=x&4:2R7 R~ZMݵZP)t6g$A9F`/kR5JC/8Y'z2<3yxL9EOݗz ]C'8C {:Ƒ lleqWL"պq-$3:ZibAMBB2 AMQ:@h XJ@.(ND@='_tfj즤q;JL T߃)m*v-9r׳v2ms%IIR-}MBOv&[[ ԂtpQJhh/R lTt@nz뗒UF'4.
oAA dlvvit>)ЧY%P&d
,ґ*lT-Y.[H%bIP[1){Ր ] .E-v3>YȲYSw KI!ʊJ3ʐ{Nk7ҊZB
Xdh 5s#ڣ.. #²5Sm]}GP\zq 秭mrԅҵ b +Pt5.SsF].ʫ-3e&C5ܝNkP螻jIP!C3cYX9 =x_x4u}[?-\gPmhWvI Eh?@AQmʦ<;]5qj
(x۞q&iK_vTw.+d GKJu|?&8In *!
H'L4zZ6MeQhdfeo%AZLbtk1fiRTXA Bg_/6evFdy^T25X2**p
%sM}uuZ])L[p)(.۪@o-)"TsLԭ@BU}rD+!M2[Aw8Sn$(l-77CI]3enGlw
%Ts @B
$fQ$k61,;Մ%Dk:ם- jꀧ'ƻo\:̤k 'զ
ǔuaTDA}#kJ^t"RR)> KSQ :1 G6Q̴7 jBR"f9筿6Pj++xdsPN5'pL 1VmXФI_@~P#EJLthJe)V[ZqP-#eC3D&&\71L'20Uvgt,<U$+]*i|"v1QݺˡRkK#\_5);ҕ+N]7$#7fqRilkYA#[ T.8cn:\to egʹ4 |oEZxrY)hdl8%#ݼ8&k"dhn#ٽ$s2PAHZA 'XZ`WTBI)%)
'[v*\&>ĝ|%QLR/,g<1IsS@rMUս]MNݭ`ƞ@g)hj Rm$&t`|ine_5U m4*tF甃oUv(RA*$AGy_V4mҷ @ԄA6Ij-epNs[d9yw =})J2tYւx/$a&sIs=,ik v](ZҨ3DiWb8ĺ<;F*O%
gUOFÙSK;Q ?5s'RL|[c'u\E;SZfLm'h(.) %: 0<S4kR
'M
anu !on ԶQ`@"d=<B_BAN& O(;[7U&8r f 1:i3CeIXX)ӟ=F6IUҀ | T猱kK;
ISˤZ >E*@YT'AA ;NIA*o6>
oM*Saa AٻʚGY!*mAkH|mqbK( :clrRf P]>ad_pe ](VG *
:O/}4R$ hO +T +]nv,iq҄ӡҔr=u>`r4% {DTmiBBHQ vt:k! 24~kJT% ZP7Ui,stfwDSRcOz@e* Fְ@xeR6X` v2W
ЧcVx+RS?a +.B Z)@lAzL}şк\H>Mu;kftHwyRr;vJgQYe=I'ŬuuE <COP*I OL≍ eӠdNYN]vtK}.h6Gvb,%uq*0,PGI cqMAPLDy5WB%PdǐA6uKL RbxrO; !je{wQ!uJVVtLDZZ@Q$TЧ٧@{ NvmH4ldh<O ̈5hͿRST܂9 6./R˩5(R+ ;Q y,]uZ#AȰqɘQt.HRĤk'xJXXE-+BHC3L {[=Y !+I[)yeī'?d
zYi^jųVR(B?ϮwR]aU-
\ڹPaEą!nj :CîK =uQB]h$|^Ѝy|pD,RA)6Ӊ>%* 1vu]L2kT
&DBy:Ꞽ-RΒ {|_}z1d3HuV^x488BIT0 *RR-ʩhU1K<3jEKRQ*u̦bt ,oyk ˦|QZ̺PW;)F`
m:ZO]udq
`e߮ڊOt]B_wGLa| :YF5/#u*uULIHlƃMWӟFd,R\;ql06X$ N <:T& z +3lyM g* -'3 aTMŃeڪvnEL },]t\-r/%kąu6[J]_x@SS0ifh≔<7X5[RY%cNCACRBr
c"~lL_Եw,?'Tu9[F)j w03tW '6rBtm . ɄO 8uF1-ȔV ?$|mڠeJvd9F>_;].P@`ϕeC Y{K]>Xژ.#_9vVʐ,AIH< 槛KNRA@\{Wpg(.TR"#I:
Llt֢ S ;X%wl/h<|w:F7HKkh:(I *Tud!S0wZ>݉QTt`me^}9HgVw)uFC F0Uwbu4OKm&| G8Sl%*t֟|%'(0<[
Pip7̊ |@y(ک.hAI1'[D0UT?kQ]ET:də _Mk{vC9:2p5v*MY2;bm8k]Bڛt Ʌ)#Bcˮ jnn(=) W2<_KlDzR*s$
ؑ妶cXl-B>=иZm+.S2*"<voV
&еFfFaÝ:ҩF an|rv@Stjq'1Lzk,.( ^D(. Q2|E!$Y F>rF3) F"y˟HT s/vY x`khkc wWݲ8 wKU#PZt?jflQ꼐 e
ς ֞p:2Es(#$
ڥ>!iKr`
<ϗ+Oc O|W_rp/[崶$ ̭4"b, \jFG'!="z'
}y+띉rFsݎu82S זn3 })iiX:r @ vRSF</KjKL([>]tT;6I*rJ[eAJA;sQpЦc|1h} jF÷:aDZ(CG*ԅ< $3yͤ2lDR6/\E\àaa+a% DJ
1`u#F-Q[Szf )]ۘx`.^tLfI628L ѵϓ*n6;gbgn7NIuy~.MOs]6XBP!0 h> uw2[)@Ƅ5sbDsjRh[QSbA ~#!k=6S81Ve{)(6
A9DR~mM4[K *BmxZṳ fvuʔ%FH#1L ]ufεݩLZKhRbRv6>wD tHip0fҞsexoFyG8?ZVIH$$BAۯ0BiZ Z2γ?ӊ[J9i +aCZ {lf'闕( 3lE<;jAmIB t#m#0]tNh:g M(I1B2#a? )i(^&>.KSu R=R O^Z~H:;s)2Ӟ7MT ]J3,+p69Fik[iq戒KB !Pr3'Uej=9dBlNX%: 諾*IZD5/]BD+ChJQ@5V@2&9smsJ@oi^m!$e$
YA
["qR!*Y>j>Vp}(VH S>cfTeeCC<hA|?K|ï 5 \DKrQ" %en@cyy=1 zv+ё:i:9p 2oOoJ&yþa&\,ems/N{g:4&u/3|yV ڪ7qFzuSedљ D! 6oqAuP{HYaTV3 Ā:ck/N}-@ Tl 4O; B )1xƱ z3IJVVـ%J9r#s"]SFjD=d|1GDH|\ g i5
Vj:;(KQ,|q-3wc)^
ZFrL: L6˦r0Z;ZX .O&<siiPn BTv8:q<2]xEe4g 9TAQFVvY[ fkVB:I@N\%е!QPPTNVXͶ{^<~g(r
9K # -\
uח-)(ZPIuʂFhl q#ZR<-5}[! 2>61Xo H$@0'1>P[|8=;}ބ"Rt|$;O;.-^Gy=y0>n ҽz_URp%;:Nw {:֗8FZ.̱@PuN_poa :B*Ng:S&ٜy'pTDt|7ZB >@p%ı *æ?ǀ)[4Ӗ=*V[ H2实QgW'+!c*j `d8SKCo&y
9[KaU Gj)iPt uq'C^^h3;SuE-T=ݗ
RPz4i8?1u/wCI!)1P平[QCWpydxR,ELjN;UmZˮؔ;fu*뻶M+m
Fm
$⥪HJ
#AqV5zޚUE"V=GO) <<d⊕dVLO]3R3]煴$KF?WB{PHq\֭ԄG
Н 婴y!J. .UqsR^\h-$ 6<_ē+9vwmTe;^53aE0 *G#n\ka!0VL}-;EAOyQAҐ<Ã2U: -6K4mM/ǏE[COU 6 8w ø;&tLFhʲKMɁT
Dm>5ݕx}q>M u,6hQ#T@M%v
%Dj bb-c3DZ] a`dCk Lc1Yӭ
sO
5Ry #"TO { 7I\akqIJ`~F5AR@Nt ]&-}UN+j';3!@Jgم|X;+FCξ@T(fNi P<:o6n҆ X,KfFÐNQ>/Q][^` _<:VD4h:Omם j,3_lUҁu;7*Yq*) J:yk=Shu[W
R_[
*̞GS=tmxUkqi.HSHʗ@r ܟ悤)[Ȫu?l\Rd&gH+H$oXcl6ȼ#]GJRJI:A1en*۬~a8BU籲b9^<ŕSO|o yi+|wv u7iZS ۯ[=H_ tuEM S+EPB@*P^v߉?jAMLx9% % SSl>NĺIR4%[F //d5?˟|G8 $aY #)Qcc&UMD#)2t܍`0~hU3.ԩ@-+J6tr<Nk#a˱24L8JJ%G__a% wJ|Ko^:m:%jP4Ԧvn oI{};N)
=}>C
5ׯNzZI IjIď.z54tUڗCiy
c@u %8Mo -lе!
`lq;']ʳx »ZwKm q Jd
h V|=7vv BBJ _{=pNa%Ow"eJs~$}u%Oz bfʚng6q5 ,^q2#X뢺Jk*S3+GዖHJT͘om)M R
qw9hdMBʚ
C-hmyT |;i <c2pDNsZV69U^ˤ'0( Q|;8VDdNU$$6ԕJJH%) jg#K]=LDA+09UaL epf%*"@p#iVR2βcKC`v! #qIk676)ͥ!C_Dq {g.=;N.(z?f7 HNa"'٫2W)h $<Y@<a i P;,Y^ۘ2%2<ӭnKmJSϘ>bUu:}O4wJ`,TD)H I#nQ #gCF\k;$*&#o,Wd'8Nqop u%AhFG筗4l紃 h'7U[[ié̤Z ^V J$F~Ve;( u ]-+Dõ :I;U,xSdEU-M\SNmBI#}&#[Mp?<eN ˉuĄ5q_h} @0dI3
Wq_:R"`)"v ;/aOI$ʜNQy~P/aYwl?L
%$ i#ܪRh#mi<}!8B<&w= 9g.̂Az0&a,'ssq2ת!+Jj q($g7l}ǺR@4#CS<o]{KE%kP BG-cMIʺЇZd%0"w>(M
R?6p)EQd
zX,DB'P2>g.Lch a
6@:[dd *$^x 2=Y֗Au抪5T<K9JD7n꺤\4y+:+y+"N KwB2V%7cKIȩ)(&v
3o:s鵼wK ǿ 6ï.BtvTUwafP27S٫T1AKNTA{ ǭ x8w]q28s@>=51;n|
@Ӊ~u [! 7H:ův l<y@WCD˓/χۘB캻N bRJ.(J@WȐ@1m5i.
(_aDehAHH l?W.3q*t3XD9'Fɼh*Yxi mR\}[% y$IȶuWౕj])![oFE;IRQ .3\j'].P(p?\
8-Z+ t9.=#\ g8apȣa Zu:( Ôk\4*&?/SOK*{/1U⊵BaW;Izغ({=/E=#^Ηy y F*fCBgQ6
dfanMyOn3CjVbj w=zY ̰% īB9=v We;~z+-Al(*.
oeUJq02mxn('f"YihuN*GNV^wڔƙrTOKGݞw3xjJe vqtTկ-hl _;[u^(GB|̓]FS&.&:g}jVP FRUNۅD yJFU7 |Dž4[u3LL뎇eIy^彑L]P
`hR z IL*\Amt,fΩD9M!^ۋ+p
}qg騒jQt, )Hoƈ$"U[UsXugu TĪ3 j>ˈ)xJ:Coē3]{IRqdSlCDjLrP$Hy>?{ {Qhҏ)'Xf
}RrBR$urMsFS!=jnޜUy >B4O 0ÐdAu״O4 R&cA6;vi[ely,89Gxrƻ|X&R*U$Hi|LK ×{iئc2%P@ ;ۨ w\}hNMiK8n~ ǞMy[ࢡl =Oؾ/-Cu7P-Ӹ@b
EK$Ci>tgN)\x2! ;RL5M݊o 6
T]vOSzASiRȈlSk/ 7۩4WU2s *q|ԢuRSlV!_-|qd++Oy}6H7/yDƴJ檤)K0/f|?8oUr7Nq7m]JO eb㯄A'I jWZShu$eﱌ4S[L,oA[{ܼ`cF:ʃ8N59YՏ5JQL&!Gi:rڗÏc=v2/JKmKAB2Kd V;˼FJG- rF, GqCS5kDjM
lkUJ۪m*dI?ռT ] n:A"5 VF
2R T3 k# ~K}ʴR=yNKRdKL2;!&
u 6qѲEMB%rAdc'-IP*熐(
gfծH+RP Q"yZv7ĪK B4)*3Yt eqmu JV'qj;_g'F*( U+J(*A1}9}N nK`FTG{ ą;?M/9ޙ_q7u }`%MsJFbONţp}`5if<t!(L T;6dzq)G@9QZS*$ k{uP FY3"U'A`hJcR4sǙiPX
%BrEQX[i)ˬ xSeJ@>!aI[7rJ:Ѕ H[<R
(3?X_RÈ$)hJƟZ3-GRL0c\IZ7 :P!Hb~,]>$/9
ƀG+N{@#Rv ,T J4P))+1
<=i,(7XnJZPR.v̝枞%Bt5[ԏ4u Xmw-?fgHV,dSB^Nc iaWWSܕKJ@ !@J'HۥJ\X0<c2R" ;Ni
Vrt 8ϕm҇;% ?K{3а$d,OO> <RNVr3$ijrdRDbFXvԇۅ Myi)Lp IQ0[%բNJڹRV<ACB'SQm`a!1,gV7} <e vؚ ̭I`BRg^ tw~n:EU}֗U>^.K'
BG;=`kR0o:䩪%COsFRbe:N%(n
ԝ~kjx⇉`u宇Y[RPqF)P M&'i6i6 @O\ N
8EzCGSϔ؞QxFW-ôd<Z)j\UEJԅjFBL _i˪ۺJ|NNxw"Jכ_! ȓ"~[)VJ1OgW`MZkJ O|ΐFZ| u
6*9R 1^/QJ>@پuwP{ZNgo^
qApuQVTiLu ĜJ( IeQWx@-Y|;/~ WỊidMEBr'@:y-Ê&ؠi)qp((顷,fp>4i Z\"54*};IO:XTc7> %GLz~µ8 qujśuߕQR\Vwl)k !\)I~ˆ#5"Lc4y-^7KIr ԬBA lKOC\TU]^Y䞉6,1jOwd:?}=y]%wzT:- ymîMj`5 dS-+ %?40
j19Β>ȝ=]x-MR<QmNJzduoi_ryy$:{ FX Yh߮~sBᣵï '*O-')sP GV'm}F @)҃_ Ȓ5Z
/,xÔGteAA''I($bbGܔ)ixVr4yiz~zRnp ?!i+EOCF;SXkB\ӷ
.R2@V%?µ="u$4t)뱲_T"*S5@Fż:}xuߊZwHI#j mk&NE»)ߘ)n"`6~S; 7Uh^sMB_PUK-Eż??AELZ݅ bbv_ \0.}4{qג#o ]{5HB)K cT#e NCjX"=7:b!ii*6ȍ t<q22 -/ ?>jE|^\m
"w~"dk(FhZ{_t6PB=N
ebKNT<Q6"%yO~U
:NI}x9]#
\Hҹ-'Jjx
|oK7ŏR)hxҤd-5ٛ ͜R]&]]]&GĘ Q4T9N I:mxzJ.Hl4'O;f1J.7w :~^cS2Hvs) O*3q<q i"F-xvOkRp%@nm;Hd@we[8UԹ3krt##q j{ØBEJ H]R@Jm~G8?IYav >zGO80vbE$yfHWrT$Ask=8R*1̘B)Kysɀ/LFx9JVo dv7ڄB@ K=y$&96,W4w 9'ɹpsѡ !fW٩Qu~veT=rTLzYDnH&JIQ< ٝP
%[fmV}Uz ѧ
37vNҠSH) Q量:~?w&$H/R; eYB B諧!N?֗?oWqWqQYa34W7 6i:JU23 g#.kC!k |eת* wIrA bf50tY:**ZRT#m5;+zW&Lڎktw]%B}i
I$d v
ӐNK"i)J RPni;N姥&|]u6 R[<2u #g~m4<R%#Ayׯm|vdp1ڞ44ղL pڎ颧Hq,$zr]w9}^)}$ Iړ\EJL
+ԉ)RBJ@<UK]!4sKniw{R2ߗ|,RdyzYg6R $ɑLnHe'}UC8 7PĔJ@|$0Y*Ԑ3D>;beR)וgL'-}e >gs6@JY!(IקoKmJ*!03B@ ytZ.890])
|npY%Ye
$Lsۮ֦ʽB &|$Lh [e>ҳeVYT v -=t hHiЖHSl%h֊d4B T9bTڒYjFl;_U &PH!˛lAh[. %*HJj`?z
ʒNp %Z}bȐFE\ ̰TN&q7 5U p6>]:zic Ǫ_q6̾\Bա}B\u}}3e">ۥNً*X[RCb:e2@~߳+B$ :!$τ( ·&P ɘ΄sYss
P BYu> 6+rod@1)yY
$Y5B)2S*b3aww-K*N{ۯ ]n,rZma!
6:l){it@TsNghuM%%4n,j`ptʞfmŐS?~#N y 갧p뷪SLVqҶ33Y.RζKMi$kڋ 3n1UCOX qTmC2RdO4q}o$
UR28y̕ dɞkƆ-4Aŵ f> I#d o--+F K^euRhW
;Ś?N`:oi..o aF'-O9*_@.[ꛩC`B DH'o[(|_~'
\
-sWWZ Xh+c\X=RXmaunKh$okb
I&)9<Y- &O!%ˮe;W ]l-7{e/毫x]ԩ *$ TN[ڊwQb ӡ" G7
Aa롛ӊWɣM
Ua{(buZ0w\zSns)ffi(tXgGaĈ]mIa?t(T,-
2)0e'gNb2:gT->E%0}[ -˰ytQJ1#"Puժ)d g`P:X*nvC*-4k1ڶ0ڪí-SX rڑkbw4".UDdzk~`k5㯇\eT6-׆ T5Fw{nuff jrƬTU~k4pq ܳ }^ι}^wx R'AMUDIF7*:m[>K&xx]I=PN4eP$tռ*C:ȟwHוiݹiM^r{$cCm"s{$6©CMJH ڠ@=4yZ-$hz>Awѧ][:MU8@
>{ZbB_LR5j*
Io`oKẲd &r3;ɪ"۫5Ai Πy@tkZeח *Z~]~<V
c"Z) -4ĿzwiniL2}LgM/h8QZh$Nȴ|Pҩ4%Ii!r
ԐuX kNJiשPBR:Y3Ө 9P\O'VjG͙7Ӝ
JMׂXi,)Z
9 Z|:6Պ})Rdr#\-ayȨZD<zz Ĕz0[I敏')Vc~b,yնMkKQxd-|}- xc
Ҕ BA?Qأ,TaRN*A#]X
a Zb7ݽ* @N]7ju:D+`?O25KJ/H$2vuSnL C qj[ך鲶+Sנ}oUbkRRM?>ZDϔX7uTjHmk!|6 ~Zo}ievao/RP*pK tzG+K;vZH*:>^s)k- ([
Pu+/Gc != u㪹jK6aky[U-!AI$r*trrmu*ZIB[L//]AO|7p5R RyM>VĬkOג }[
2I6pm_ꛦJO*[@I<j}-LH L?LNVjM+IiLs$)-ܼv*SOqa[ *g ߆,]K E[֠ωz lw.\wz*} \)}2ǾG~+*[seg %kjUJ*$VSm'@R`Q.2dH""$lخEswue)̬*7I%x]In:q]>_[-t!,tuʕ6
( zm"%3t^5KʉcM ym o7QNIY'_8i&JǬFNy;
S= ih \6k2.|7k8K Tu -(XJ2469}Nv+<)LW~s(@:aAHR&":[W~aRGŝC A$
lF Ih$)dmB
@vRㅶ!CLQ9t閊|'eƖI-)QD@:/+8u]J ( 6FrfvP
cQ?. DQM
ҐuF9T AͶh\RI ;dP(Sjɶs,PUJ\̗
Wh`nv9H*aEzm~tCjTf>xB;аN}4>-
fO9yKS4b$ZZ]DLﯤok^fiP`ufI 4C.b ]&Nؗ
G-ϭ( @ o V)mj#Jt`ÒYa}Fr Bd$ flWZ
W+])($)}WTPRRI :Nc
KI
nc:V#yN` 0B2$F`k
tˊ*QgYjΐP0JV$hu>źt¤ JRv<B)ĥ)_ u>_wjJ{ږP|'Gv]NeN<,F6+NU]&`%>r -)Fm dYRd蔤CʥK<@hFY?O?3j
6D}U` 62o1[|^jꜥCIK)4WD)N55Çm87 (H7۫EUZ"*gnG*n htK(dqX??]~xUk*J!.XV!$m6/Ƣ켨aJqnRQ$hk(;[T]Bj)]l|ɀ
&M]UBjY4XJ[?
I3)Ic]e%KX6N]l 4t3ݚ{z|ga-.-p\9s })qj vjkɉm r0F' {t\+.4S:
p 鐦SN Ts(zͷ4Zfrv?wVuuDUq<
Jdԓ̛1)p7tePҡqŁ t-ْ;\^FZD$wSf3it#
kx \N`M%965W[ZՒ<XR\MZ֯갡4s R x<Z U!ҦBt@@ jvrTJQ> wGR Y"ŏU7wЩŠ2QNFD/ȃ#ץs
N
%FFؼ/5Z^^9hl-%r")}u
eo5"u+,+G{g{quR:e6 r /wa
#\A#
a^ 6Ah
i7e0iNn:,)uBMU;PP
z4=I|ݜ2 ~uJj= Iz!<nkbmHKwyC`o"nNQ1ok+7 vme ;;hz-SRSmݺ/꿏cU$'Z{J(R;YI 鮇^zآPu, D ))" μ,#3"X3nf<h:%U4N f?W{Y9i /֑Wwf#bw] ;ZBuq$($f<- MwmK*li!0#XlKwR ZO ¥3-aӭ4>*7;
2:-_<ai 쥩r(aZu!YI$%Dxa[?7-\*ՐLu؈ʹ*'Dn. aIT^[/П^KDv?FT7>q)ai|6K)W^MgS 3ݖ H#I 750ͥu
eJ@'°uJP-ԗ/UoTPT
³eAuoT ap˭=UܼoX8 3+hGȎGpwIMZ>:`n(`ľYM-HLgBu >v-/h˕oJ(
9t$҃mϯ@a~wm/e\Z2RaMFRyA0s n +;>] mQ7NHY] 't}`> q8wf9A32duLG>>rJgln.>;x bwsi#a, :m5/ێ (}h>]P+ jvUBA}Rgjdw4:J l 1=(JF):FfM]Ve-)%9=:u2H$f9BDƿ5h/56$IoiVi@LZjx @S:LZ֎j<=9Q $ @lS"_T%u4:1 nl
?^]uEmkRӰ}H̛|}2ǫ8;)
I?nyJHn+O
ŗN<ՆQp:Uګ>'dCkZGk 4i_ NrZ4
}mv@ur^WѸJ( $
D3)0 !Ǻ֎<<|xn.e;tXsj<ԧn(>Q\ͮrJ%mi 5\,ÿalOKTo+q7{n$Vew$U{ OUޏ)몝yk\qDJ'ʹ 5rT 23fğ|>$3ݖS SizQ![zն
V
3IG9k,sS%fI En4, UiU_xڀi
@m by[\KES;<FMP̰Ju$Șӝ2+M-G;@; R^s WT&8 Bv FXL96Gd~pۇtT5Je:?,~ HL(f+"KbJ+K4_[IέseNZ 0IOmpD=-̥}M'xpJZBAAFOfTՐD$trd
0ßdT$IdArip$)H ): JY[qhl :m8YH孭ҥ}RP
B?o* @$1zz@D$Hz)i^e$ēzrD4x<V$e()A w>Q-8
36bt*4I $
u*DDyR[)
2DA!gY[ g)+Jʂ$ yZaY@HnT|Q&D>Zm,<R tNv> K+K`J&9Zy?<wlg
! h~'Bh3`B #fmfJsr39겕VG fw]A ¢F][H^QPgR$ o>njV [|c~
బPRf '&eU WxB:u<1M+{O
t Re gXƨNx2R Fh2 <ԧ m!
jEK%HTv
Mg )% g]gf7DAH)rTB!%@ q nQYyB-"Gq&w+sP '1H; C[KP[+B)VgoNQJIPY_?Ը\K]pTf,CAþ8 WԊ|rgg+vC Rka(qԬeC>i#i3q]Z\}* $̃"- ¼LP]5}EJ%t(LiFC Õ0|L̵0?o}uf۱ڐ\S r@Y,#_1hظTTm4E<¿.k: $g'Ϧ^Yp*( ! SKE0-jV,_qO^N;NV=̈PJv m 9'ˏ_=ܗ8u/,NOp\iД*TT 1 +nbzל mFFi1XQ4
/^(P̂DzZ5xe֚q25 e*;1Lֳ@ѿ\lgHwN y[yZIE;DFuGN]-cS*MuAJu$i;2÷s~dT b7"Dr~ vX hJiDןԜelZS.⸪"$2$ =v{%uP)++ 'YvS"Im Bޓ sޯ" }ܨsuMր F}utNi
Rˏ gI$6etrbp4U@Y2d2i
/[email protected][m`1)KT4-0{9ao!eA- $m ZsU-jJlǘ rŋԭT ;J4u*W>1x!c;\5i
r"'d0
T^lS<SHZLlQ8<h#
`,*QPµԢR"FmghÝVothv<
ʆ9Ǽw: 9t\xt/U)JAØN8t8v^(pRp'@@,15c17sOv9( hD f+X+ +֞ +Ij(h Ls$sR
>iۢgsy[a@H+4"u{k;B7E=+ ,'"7V Vat\ jUOvq5UİȆ6_xfxxBZ\L: rV? 6 mDX(i)nmy$bGqkF*Q#+ jL+Ь}2J)d :d_ J 9.*E*Uucu`jVuH%*RŔƕ^!Hh!W!uEt(Dj
U&k<{>[T&AwJ@Tm3 ۘׯ`> H$
4 ko! ighƥjq) qN+2\J
*>)Φu<| 8Jp MMTj &] tHehn!Rp \^ܦeJSIe)tQ_5\r2R n*0LJwh <5 Sπ'se_=xe[{G(3*ک
xX|? ZjJmҐMw#(m3ioh.pz[ Ja RMd蜻]˻MCn;NĄ ˚ICE!;t ^N潞gS4?Fw*b \j}%H*X WTv)@ ofKI jomS;FWkIK!Rnw-)TF6nr24}}:?oZ a =m鐥
Dt+ŔBQxm>SH9SfLrh 62i}]-jMSBN
w'9Zks8 k& :Lӕ^zUlgCu2R,ԫ.Nϔ7QH c*PbC6uPAT
6?{c__87
}u5*qaYN :A=+G|8An n4~/&.<߯$ {ډ)a<e?^.խw#N\bj
(P^|5|&4v iŌq
Jw[@p#U%С o;AҜһ_ ð}IT
x31EEq.=P
t(ܒO.G ofnĉi5
J+* i I -#ÄQe;[xU;iG ۗߊOW{P17U=T|?0%
(g)ELJ\UV[ď+vQtgɚ ;J/KHXqR6$.F*SQ.J%|lc-y[q XI Z$a/bPeJAX(YOImЩ)am<|7<d
#UHCm!|ʚI3 cםrm2-j) ˘;QyTT*IKRiYzm0 S3H;v2DeQ
e X$4
osXW!,
$3#c륺 ni!-*29@jo j ->C+IP>}mxW0v'Gsj {NizpNo ] wQH(r#[H:K2 RY,<#s'BmmsuQْ%Y:-O{5-QF
B'Pgc3 hSw$ghTH
Jy): r;+ M"ck"$/7{g
Mu~-RP<,8Ra:}Id"5}JAZU'i彠[/Xus-V@Rr䍈[1 i$ '(#~~VU;)T
rL&LNDsur)]J \1:+34tI^Kp$39ZI( TP ~ |GVK<)'|-mp:Cɂ Dk%{+ij -Mu"NɃ'MO&h
1%CkR]He>Z 曒V^^iBhVR`IOh<)AF]NFqKi iEhҡrՄVd ,V ocwTTrlI^plYp҆S+eyf
wZs){A4l[p8ӭTR=!@ͺvM$,f6D P!y3 l&AŤ@$_MiHo tH T[9)] R 0>?/
ն*]mT/'Uʔ` zk¥/93 OY@` sNA zZB[Y) Ʀtsj_-;<eubtPZtC %iruu/ -|/)n.fl/_G)SAJ $'?[vQ|vLĆוw|L8a[ G;]O .}#O% p7p_u QLR^gܡB?&ٛp
ӎB|R SNn*I6X9}O'ۺKWs\Ȭ59YxnY^aiUHV*B Gl5 u4 t { raFOӟ2 oĽRexb?\52U#yY ô
4
"$Ahk/ -4I}ԳuR +GUF6oM}Zg!Kk /?[S4L7&mÞ$)]j-"DP7* 6l;w5rPX2dh ) vOHEEZWj
TdjvD{>.z-*%I*BCEPd.zY4H;8<UC卦#]5WlRxP IIibBЏgWv+ ڹk o:z246
ݡ~XT=n* ;f bZ.
QXfA &dkkIQr7 %0yER^uܫH
V'3 N4ˠVYj<{IodU{- >.Jʰ 3 mT*^5ŧM^6K s
m{rOtRŨ %GT&c^SiHuf Vxٗ.9e/<DċaFuBs9QJ :5l5+OT(. ).Y1xIh.ONmPy>"Dk;\xػ䚚n^P!$ˤ;]M:Ys!yU? roTMR* k۳pG_r5&~.*McnLBQp;g ݯ߸ʆ[S]٨{1P Q5Ԟ8_B 7k;F&3m " a#*78
qzZF33%%K.:ksP1'Ar` ^#u$ ꕢfigmIU|8ک"#[U.A IJR$IzXg/^~z:P+p',˕QZ,xn%קx`laUxJ2e2 :m=\C^a_z]ۚg3M6\}Ԁk qcۋ
j
Þ=%AVT%*mspNaz Z MnSI\Q C4Tt_k#KS }s:0xr7v]q;^OE툀̦ʽ v !zGXLbw<<*SUz-qW\u cKȰ̪d'j#\uqCYǛj^U*ZΜ\]y͒sVWeF< y#zRۧAF$?%\T|BԀH ֵK3,楷rHF|Zyeh 9u W @\mU^5N8% OӗIq(
2v-b<BSmjpI) HY2ZOxFO}m oT%44Ӕ A7XۅG+KT - u: #o _VSIXA*5X2WtT Հ@)2\PTmt>h4 F/u
A̧#DŽ%Brj QW- ?u V+AS!Fa5 lme5c\^ M-윔
<JHspXcl6 ߁;l ϟU¢Iq^em G=cA&&?^S5iÔTK[rLA gEA[M@
S(SEu*m# +h~ _WKQHK4@|: _%v- H{[Aq
T{=@ҔKh/,suB-k7} # CΨ!
>& h "d
xmiʛ.'"NT'rI'|'\}~ a1iԱEqR:ARP:xfM-pzbb#{# [#a<G?r5vtWWIn^#B P}螖ŗ%UK>(HzO(u7e]k4AP2
N~r4-ҭm8ڈm_)<#'J+z]dz!eD)c:o빴mq%OgBRO/WX r
X)^e2N^F$<shIoijY eԪgB ؖ!tzK+~N"uo?e. \HCt{ER6\ 0o ]ymQ if=JiR%Q <UU@|vRk{Y;)-4#HGvfp'H1Gj?14YK$Ò$[],S&rhR#[G;JgQ3rH"I%Kvd3Jc(N{[ڟN$ ` VH8t *[ 57H%]RuS},i%`D)Gbti')HZ&77l0 O1q^*J)no m] IgaۤB9=,dP$[&76 K7A`
>[B
RF | **א Ra+u4LJ u HuD6 &aBb?^g!Z^SMV4:٭s̸ɧb m? ~4ekQiVd 2 vZ J V`"ztӞu!k s&|: `)*jcM6Ԅd-qꈤCM'ذ) OJu?{X?v Cc:u)+
@$#K]GW{.M@LF-E2-Cݓ c[E^:h NْFtzrRFTIZu'=T s l
V
Km %zaQ;a [ V@: %ců2Rx$e wߟlWVN!@H =|ե $0rFST xAS| `v>6JXHz2-$ LLJE
Ʀ4#Hr[1
($XsA&8'n{NȄey +Uz= %m
29uMZZe
A j$
E:![JBs8;|1NHPA$'`@X΄
N`뛑- .JI͗s$̏8?$>*OauD?
گ 0q+TZ
PgFhg S_Ҋ ћơIڶ1-W\E="UPARTۨH)Y˂8Ot^m)W'B) Зx 5 .vi_<a7u|bwRtt(M=ZW! <r=I6y%VVSҺaA#?93ozn܊FW,@XgZXTnjU:RmAIlNh-c"{|Vpo);v]7
y)H@dאRزx:ҖZYf'nvz1KMwξA [.XCTqڅ(d2 !b *=m$ɯ18r+ _:Iii\& :jg6;Ecۺ+-PCA :
7Wk^" 5jV a
R;
>)VۉpAӨ z_|3TwSSS4
*g6mORd}@d1g66h2ϟ] N+vM6ZR
vL(slok)S2X9%SH ]_tap8DM~asz0+:q%$)* ƇIؓm2{W YM%@;JSjML^hvPZ^}i ʕ\2fqƊ 74*pe ;NGx cm{ eyCհ ĤmOKkŊĎ;K("ѹDU𪒘4k}ʪ!IYKn( LԒO 1az+1ԣGLcR6#KiNԘcCx+WW2~)!j
,@!GC/ f15H&:I )&>z, {_;_m苫8_a54n8ҷ N-p}u{Ж[aUjof|sڷ
".j7
S4bD$ [n ٘
s"U>KK(8>5g]*]N1g " @2?FvyNxXV." ֤ft Ŷ?g< xૹRVUֽ 'E mR#Np,1Kp'E݄WUtT%/mjqGq#T.] @rٲ?OGݐ^#C]"-R:6 m֯+ک-(%))D1[հðuN:iQyXΩEJ* LlmYUWU^|>L'ath}X
]=MQH
ILh^^vSy.T%9 $-翤·"oZ.J
`|cOh[奄/E^*za;tm숥3s{+}u՜Ψjfmf 1KwbCTB "R$ئJߤZVuwlkDN^>:in䴵8ZJH lwbl<ȏi[:/B5HY^q()
)Q鵩ygj\{Dž4W-]sw-rt$u[x |8?/zkYL쎝
T D? ի[LPդLF/
ғu[RɄ(k:뿔km/sy믢1GWV?{3q8ERi«nw HV4z:κE w#{:^G(|&09kʦZJISj' D-ׁ+iu
+'2Tܠzx\jR7+-lmq3+c1W⪫ƚ }諒D6ujF7L+Xodxk\@`o-:ʃ]mPTR ^{m8m @
][[
2'Y I{
x!8 g]4|zi(Úe B<"hinh-'*|*s]"N \77Uĵi4f%=ԂAw""zr<QT%MroO5*Htyʗ mƻ|9d#[aĶ%2`k ?75$=1v)j%JUCGv <č6<ŷXY9iSLgn<$v^'f[BJuZO! hE[M@5Yl۔];ؒoJ2${0VH"fG sQ5CHR);t4FU%<չ\6_=Z
!JLew
.d=-/P>ޜ|o!.2@MQm^wn-ĝcoq-12Q<O@Nd@[B5ѯ=c AS K^Q1EYkIB
K1ZְzЛTe?̪Kp
#i
$$
LOҌ^@ޱcAc 3*>%؈kQVTtO9e}6V`5̟Pa*y U%Q∀}M+}aɅm,TdyZ}E'ImӯjeZ.%SyjO~Z1 Wfp3UyVāQ=,iN)\ zX/J% -9 1)|-kRJZcdy>DU<XB#.c"CYN]wiqJ^YzƧၦ#pC]oM.vdXFf'}=lAU6T} izkh+ӊ!ye
& {]3R,Az۫֘G 8iˡ {M3mwm 4GЉݔdJc DmN~xt
A%$$(FcY3lK3*d8@&`&5Kpշw^U#julq
$$h$ *K#Q Veք<m ȏ|<ݝDvϯDEvq&%(nf. .dm":4$3j.]֤%@)9mg4.SG,fNW}Pv gLo^AϺA
:GtwêEӉ"JIR
QIHo;G?r0E'PFGğIO{%@_UrwY"P5<{Q5
aҭ%n{ݕ52 f O]sA0\<Ϙ&} n6ʶnb=쫚];j˙KD%D͉Ha]@WyZP!
"0fn瘭}U8"OE %18W$|.uן+h%< =umM-$=ڞKm~+)-AHBsH%g['qSӻ0oV,!ʄ4G9 ]+N8.۶ʛ
-N@O i1OzJT]d-a%;
Βr.4p^Sab[Ea!LQ*⼩hnS RH#hӘ?j wQiM!6 CwԽTYx!ʖ3-, 7R`yOM8D8Ԡv)$
b h` tϮ e*t[a&TGāe (R<(xu#Xz*],=VˣE1 c
mp}'5τB[ D ztS5kNZP %:Ƥk.! XvrT܂'BڨmK$hBHu
H_ˮ .1_U4,w 1 ]bwmxq6mES'K*JYSh' qi@VPyGnyCt4c|pxA}m?-JSJ}uN9l c. D8Fr⦢B[i3=`G;8ê1qRjn|kvRU#VЂJgYmٳs jYm5yҙ!H +AIc ěA1w٣{q E%UC&?;Np*X^ BRB
5jIH3ړ5XK$7F[H*ԓY#[L#wpu5&iSfPBgafx$"r3 knTKn #ɮ+8Xs 8WiM;X"MֳeuSW_ݥJBBSc0[p{a$R*d8I ]]+iM}XQA~Ҹaбfzd%q[2 3j`'w( A #YUzWÕ-4 Lg L%CvչXEFۤdL5kpuFn'-uS^w xJ- u#a\ wC.Rfז ;Am0
T͈ XJVR@<x\G]SzHP6\- WQ 9D˅=Q$(k2MK0Y!CAҴ6TsL1k ]d'RC
<@뭥iۄ0hk $fgZfNH: HX/Y~ nՅH US!HuH@J`Οw}CiNg;Jbtmڼ?7F%!ZQ{i3}b~i]/ Kݿ8%TV_
U3J H ( Xe\_xcTwzRט \ͬw%Z~v+뾐 gp~w~S_7 KU&i *YNvgAch97t\ i=8p4.)}()!GQ@מZuO @%$h ˵ ]K+7QID
) ʉ2 彅Kaԕ$_29tQIN[RY3)- C[9e[8:iPzlAR=@v QER*ү p[-/9EPFᮇӧS& Kwv%^ |[2$?*i -wdd! 4s q.#zk7 k8/ں}Z$]$P~Т
[S{|&fӪ i} [\ mԾ1HfAEMrR
P"w֖nҖ@R$+ rH_'{ 9<4Q gh)H)3Y[Jo㔳t)jGGDT},@J.,2>sl$F1ɴmUڕܝ>-itOЩg.NiqE֔̑yZATucy.[H9J` ngK}/HE;@Z[ :inabڂmd`lfC_Y(h ~_/ӉI 72l7#{QʮB_h7EtdUǁI nymfu
+6ot)Z}n'.o
~J(ZY
V6SIJHTft3G͝enS* +<IC!t[}JAPptMfyt[P M?p㊉$Lΰvtp+A)2| ͫXl
$*ԙXbal6̐gqחgtB]UNP
Fu+%)+pjY
T4:ocƊ @H)~:HiMWFQfk?~V}l> FRÉ
Dνq˒ | FNJX
w-9Vl'Vk. q(!%AD(II'H/F'}BʏvNCOyM#Ʌ6J_C;n.^žAVB4ML l5m'yUh&#n?Ht JJ2HIQ :D|l#k FuG "BB&4 `eNDӟ˥XylT , :5 k0eaHU'}sX\`YF݂'N{pw8up:NDS
7MߣQ%DBd6 w
<K/%`R{9dDw<}QP8c>Jv`X54Sf='m$(i vkrqڑ|J\)S^!HfID4祜.-S_+>&)r$w c m_v '9qwScٚXCt t;Qm^a5X7m3˞;>ހkiWgrŀ7 [[l=8;p^f]UUt먻ݫHOz%i>o:va|7ɿrzBBfZ[7 1o"<*)^ UJ KM&6d.tq{}*:TG| *PD Q:AS F5
n<2:bgly5:R=¾_W<-X 0y:Ȃ tR46{p{|KRĮS.ƃhAL 彚\=8ċ@(^mrBיꁗu,uQ
q80\F%)Udd
$̩V#$ht.?i8\|=u ^WaUV%(I 9 /!kZ-uU\SBu "F
aU[u5ɩClw)%'Q$ykiw7 CazPR4":L D@SH-njNT4<)9B% iRP\<St еϟ*Q<۴sQ^*[c'veO .wq;7j*0[&A"tgihvW+H/Ti*[email protected]\`zאq qq'7pR A]\@LKlUO
X÷M*vjcQU >4 §B =K|
{ oͰơmCi@:r k++i)3u!c R; /; p
<=W K o] l(ӥ1Ӡ([wvhp0/taNָe{6'YoYtblM !Wu3Bu 9f Им<x^hZ-ůrf~[}-<Nss~G߫6n= '[o!ǙAX NBf9bn
S?p)r4hN#3y u :i jA?\~e0zUWTrH=$GY 3=(}MlFd7S gQX (`JfqVd 1lg{o7⇪. ܘ}
Wr[sSP#B 4ԼCq3(~]*Kt*Oי߯\ Ņ/ cU=J{Sjf9xHP}xۭ USD|> 홂[email protected]&O[[<<Gg2%%bH9voKxnuv䶠u0_cL6ioU*$2Q%D <:N؈⦞<|FfF
}Wn(8)R='oK.{C%IH%0O bnن<JuPKO* 6"
}8jtW=6YS ~S0ꈎCl1zwIxAV $FaE0暵($'ŹX@_@ |~1Zf+)*TyLTL1fpHjckej+V&^VʼrA8b nLR
Z lGi`Gق ET8,s+eqx[ [kNPn8 ]+1[S"}*]q$#s3b]#q *
Ķ#OIP )Q< bwUV?Tޏ0^`iGKVf9&uv=@'Vs =`[ &$Z8y7UN $K`UPӬ5Np6u7&G(X**+tI
l~'n_|->7H;zaa~:^# ХGZVtB,2m!Iu:QISF1[xLP8u+eJIZǾ f٦HT.V ڂ#oKu9}x"츽CH!^ȏ BީZD Ӭyih U=Bp0 bNش3l)RuA*ZWr H ǣs*ob߲LB3̘ܐtc7i 1y!JL V=b* @ZO3mKtkXy8'Wxe-NuAc /[yz %Bo\T5 )ŭKiG:X BUSS2tβ Χ6I!Gs3:l#\*. )C1 M-ۉ T@fiJԙ[+8+ @~%:ۈ *B˸YBߤI1a+BUЩ[((f25xd;d*ZZAR_1h˝ ]:~pr""#yE3Ir ؘpU Y3)"'ϭհi]
B'}*f{t;2 J: H6
jhTs@Ы/Q)xLU 6yݏS0AIPQ 'Iqb~v[ K,aiqH
%(*J'AouTKJb $'Q,ƾiԵ儓2@ߜ}- 0$M| lNg2DsZ{ʂH\(eP" 6&t)źTk5Kfx(wju7<1Ri*mEJ H F&JIHXe˭8PPS Nda)De[ȓӔ4.eLDlrU6$dRGuNhl,d fӖ[6vNJ$cilE"Vۚ7!+궑 _D&' kb RiKD{ܾn.AB$ XQtAղB"y
>DsP@"oV S5tAJRa!Cdh rB|6tn.ARΞMQuCn\u$eL>&I7 /VyH9ɾ4sw\@o
&{FnBsM_=zｯ6sL .
6?m
ؾ컉iol-Yg)E T۰B7CbOY7ML^j ccI8ca"
$<vUj%I94eZJ ޗSlS0w_ K>8W ^}֎7(. keݼz|gIfʶ l,3 H
Tek!{tq~<UY7nu>;7#_l g'+ N
@) HRH؏kI,oOziKoRR> Ȍy ]xݏ ?-kyDNgRG A$p&
$L|aw R*7-$ ;[; ,HirO? byd.O q8oALP-%^i`)AAJ
j66-V$x/ /uIķ
Yu ݍM:rL7:TW^ Uwxnjz 廸U R(, $P
JcB;E5h
[^U\x [@;I̧X#Z f^;s<x^ B.ʺaН gV
{JR֫˻)JmL :[cb[glղ6h蝂PNJM~jiAPұh$n'j^CnPy\Z 0K4x)ƐEK_&Iʣ
-N^4|;Q
著[JIsT)*z :i}x w>d;wU0Z2skAlYrÇיlҠIL%=} RJb:4kشGmڣky ŗn*x h`L(4$ -Pc> b by
ԧx"! H:-vtMfIJ3"f<1o ]5emwSi1筩{PreטSqp7o$]8blE{T{
$hkX3;۪ݘ/\wUqSǻ)Z+zJ<y d~xl>Âì"`%` b,~ w 5VkVWb^*̬d5RD1{ m<f`zp!YLP^5{=N`% #C OWuaRS6)M '.=uu"-Is8=F=m
cFU)+"Act7.L-\zೕr'ß[ؽc2躩 s{0MufK 5/ #1 $۔\P3 KkqF,߯<V>I:>@L ".<Z~ YT)$Bt" NʸׄCEQ-ԸB*
TBju=yYOH{SwrӣPa2`^Wn^) a{ҡuU݇$Q:H L-K8hjM# βA?.K8iۮW3
~m
H4:Ye8nvbjq&BjG>ybڊ6SM1k9ߒhGZےvBvqڃ7m?1*^A`IԘ>Qg}[Ap%JodjJV$@laqNtݢ>VdyTv'gp \7\WV$fIΜ|F 8-Em@8i
Wbč?p}U.˥SR֗T B'_)Mf;krI)Z7(QxS ~u ZwUjP+.u y˨|6viԥ&deNYq1At[x8-nڶ͇[Zۈi.)J~V Vx07 ZDSmd-[YlXi:'c>߿xs7ۭzpt>f4;w }R]WU^Ja:,'I2u=e8Z
KSUs^o6Ko%DsNdv6>EW[OQ{]%nR: r5'6 a4>ߐ
j) 1?3h8 bOaǴѺNWQ |['wb7ZOx o `I^}m?L)+)UDoDir=h+tK$+*|DNy YM,Uq 66FRG)x]yƗ^+%
D6<6g 8ΠU^eNfBuG0TT-g^RN2mWu9ީ }Hi=lv@'|O#sWawSc䭡 KnIJJܝ ;cu:H觽 KnH)Fm$iͷG=EIKūʒTv:ĦU=t y{> űf7vў* pd'zvAn: *57I!!J+~M:֥'*H ! y%!o;TL9ˬNA[~E-eD)R}lـi{ qޝmUJӝ uE1x ~eD݉of8;73Rʑ#XuÔ^8>u֠oJfe+ȳ ѝws,ҥRJ4%m}% ?Ŕ} PR yiJZZ
{|bU#B
B[RKzJ{*.HO}zٯ|V`oͩAa9RNHNqn*gRoξ$%N?;5YJ)HMK
Fޛz@&VY[++ % @},Ebބ(kSPAQV32P RJKhRʁ%CA3h{iŗ_K!_zΰsOKAeJ L4+ ZT?_[E^U t(^" dkbn,FT]~͉p
1F$w->$PusY}thq*mT3S=m% ҆H &Vsx( qgNUG>An|\WOsYuR. 6 d[]ZDPH~>/IE rbMT'"ʥE
>QiW*tC8^!I26ס@ * WBr m4Vn .5t1iX^ZR(^
ϻ7v t,
Uܾ/ İ&$4&-AeUAq* FM*W.Q)&Uo6ZeJdvسM @> " Txռ'BwZMl]VHʜ`CU#$6B%3M:O}mUӼ1wU# T*@DJISIFu`l4k/r즺1E ;$/+* 8Ns kh}\U&
}<UO_ oݠkT=OT^nwIxQVw [V
pm%
FY-d@WHctڸhib^Q!] ulWE _{Tq .&Puz< oMEUFZkpa\F@8_73~Z{S~3XÁXQ v6 ҥ Vބ ).3L۞-6#{պM+o'˯ՠ璒i`1c
tCAr"F 'y6"y$+|y駥XE2;|<+=8i/st.Ԟv<z Cĸ&bM/Ӆ<JQ* k1`S'L'DiPoEPA+*9`&rFz O߸#a_8˵
5|Q%nԥkG=t"``oj ;AF3Ri TA+$k
r
i&|{m«ۣ
`+?Eԅ4KZtfY:WHE \RnK&@> A$+wOZlKzp˂m;Q!)(΄i:$S^&hE7U8r.gIv"VP(u9Nkb zuK8 t7UsX7j(bm 5 )\JDQ Y*C*^Ъ)Mz9 ҡԴOx#0NXHkMtۘ ӌ@=qʴPS qeAF W݅m'
uc*CoPw$PPPmE R f6)%UeVK H o'Uo%Ea}%̘ӜS6J~ Ff0\}ոS~wT69 ܭ2ɍ4WjlҴW/7.z'iZ*y-0<0 DMF tk$S04Rt t$k: ^/ALi
[m!=8 GUwX 'e-菆G0L =,8]F ~RAR؛ CZk
N)IU7cg͆ٹiC@
y ʔ'&gSmMӗY}մP `J
| & фh*/R=J
? cN=Ç x3YltrC(I&WQP4'(l^:s0u9
x}~ݧpgf j.cB@9[O5 NvŔϊN=תJ)=*Ѧ%#`:ڵN-ݡ1GxZ**BA=#{H?fNmfJ
@6 58 k'zgnyxK a]unӤ @0A UX i>-ml]LT#+
<Z4m:r Iqj)&:6$tG3 .wa{ijQQ:K,)?KC].o?fiBJR);/x[yi h 8ˏ2Pcaκ}~v1$mds0O2.nq=0]xPΕHPIoj<7J*KmhE[
$TI#7c #mR J@H馣kBcJ 渞m{CF6%0u>n tU h$h6>w-y&)* {Oa[MN )ʣ@ ZP\bu($)%m%%6Y.2=>Kt3yM҄$_+bZt߸4LRN I;sy(;LP~fq`Z-Į
vq7#q FsCoh [}^ fwM7.eL<]xql ^&T&NO|}vRI!Z2{UX -4
9w }ls1Zc.9y [vaX~$: TIǬwnj7iZʅX%j0|mJv[;-{ }uխ2X e ><*ᥠirИƺo}elq4抪ӛE
5Hi}BBT & < >ڣӴ2&C'mI{**p'*dO}kC8PQ[,/|BOY E|]9\ *6*'@r(Du
wK6WJq)QD(PYzۣ ]_f mPinҵ-uIU`%_)T P-Jy>#p Ӷ/UDc$|h}zrZpȑ i˷cC\Zu@R'P
bH7[Cj{W(
3yaj
te;QBMp'(H6y #4[ó o<*:»J K]<8bW(%Zq#OFbtDI ֕Ҩni;!S3>SngN _0 5}Z
C=F7l ĒrYg )k.ʂ& ٢. {JlһBYUAP w
P
l9T<9V"'-!H prtD$z) pTN}uz*KPJN_USh#2TLřTխ$nŪG=nvWwy|%9Td4]m FG;f?k J PLy ESPi>[X"hQ$fߨ+t Nmtsb '{װZgGNY 7$(<߄ˑHHYF#T
O? l5U]u4$xc2r뷟7N.BSL> ҟbl8dulEFrS㚯*7i .-8)%zU;ۡ9TV\tyمe蒠BS:;JiPB> ZAn{lnTn1[=%2HB&gq-fv.p}Imfc6qE銖उ*]}&֟bҬQPsF]qeޮ 9fҚFдB %JТP
Κi?v8Ta $+ @<ΖMpy;
R%3*cm{Af{ d yxVt+ aS8rJ
P2tL F pp{CuSRR hka(oK4{J.)@!. ƧM, cTNuFiW!6X[Ēہ0]&,&@78Kzt5bzۻS֦)y!GTӐcjKJC*ANuDf7O)䢻ZM%rbdnyȣ
4p?1Ae/Nܷ
qU&.څB/j24 TyZ X7F"a4 YKLGXJͤĨ,onZ& ܅ j6|a
W#~p^ƘwRo{ƹc"Ъ5Dmن H os q:y~zFk.7Kw* 6O#OAm Ê|K{}b\?p&w<Ej # #V} L >M^3x h1zZwn糍-낞z=r/Р ~^.0`r˄wM; 2>(~3ߘC=.0Ue3V6P&W C@.8_ {yC@#MtN$ҽp|G]oLdIm$BFu@m]S< Rx 0A V[Q+Ovy h /I~w-t@u+JC燱'*jqykUL<1 )딘(V9/i)qJ^g0T@#=F}lEAQ\uw>G.k-)!]9VPФ č1%d6XǷNV*_^#ŭ[u, X$RfAwLe QOƌm\Iy_uIR .س bf*
uITBs>#ktX a7@մU݂#&c)@NgqFJX}lK uaACM4hNiuq5sc+/i e $C-2Ԥ<D y'r'xUkn{]f4 4T #^ +ii*uCƝ@ y˭QM L 1whZ8^ ˞]BjT[Ԓ@b<(녗</ RrnD"jNcٿ
g& N"ƨ5Elcti uQk`~x}WiMu`My
CG#6ؓk\ k;z-0'
/Ox,s p ߬P75+}C(J@+Rz̝?{qlSӴ~ ]Knlfq̣v8Sz_,GEPiUI1UWdn)B hREg6n^(%}DX~iY( ?3
? PO5xgsPA)k7륭 &ڲJ@) )S_,.Qϝ6+ * qdۗ.vɹ9+eõ+," v>n KDj㩫 +R KRtJ e<nzb7r/S4cHmD uҶGr\NVtި~ƕ$;s DYkޥ 6rC7[HIf#dʙ=IKEDVPTR|j2U\sYESsA%K ^VGeT49tsG gY~h˝b3qBN a
?ń*@BJ_ A+Ԃ|,ay_ paR-$lgO>q`{E.Rɤ2Ily
֠OyUBQЪ?L^!RI )Rع/Gt k9 4vX e bım VOni~%ĒJ+4
{TX\lJ!<Td&@<֮qcTOJ!
x1#`e4o}R4.8JH "?[e~H)(ҦRC9p: :E`8驐A*i K\;yY
D-SV166L*79VXRmq⩼l#ZNӧikܹ@a*
Jk.~YPPdk~Wt:ɞ~.SWqU)py4 A@Z9߅Lb.v{;^8Ae
evoUh^B)rI;7vb˓ ^o>]]k"0 i'"kFq×~
ʈ
ő`G1>Z +KXaKs;RFP4GmAlV+
_PT^H u2 \U4;ŇAKg($#ccm =GP%U7rI~0x)cq#aܫ$Cc>~
j݅xB@: ?;Ej쩿VHtdk'>RdA z<ytrSXpMmjikq 3
'H,^$5Q:g@N|(n}50tQaJ%ֲ9H3 |< qk|[4`/; b%AE%! ƳϞ%P祵8I*u3Im, }͠6P7lTl(] ꫨZ)J@;/~p ,]q!KQ n_WxoUK)sJڲi-%olo!'n)5
2ZeK|&$MJxYe`Ը2"}D -nTkL7g;(dH. -/Gp OS V~jv4BBtJjpm-XT*!ȍ@__^
mREIy k #$
}5lSjCKR' 15]HN+UU#!bGSڍ> V1S}4;:nO)R&(fhmjrHH..\<I<j[^y.p3JK>ꐩ} XRm*FQ5+W\!JܻY$% ee(Ȁ kKquIvXC9s hz>-BnD&D;h7{r yyڅP)˨PwS' % `] U)OtZ.mweq_rW)r=Zu)"N&[爎]5A[!,6My P
jyIuB$M?}鄂ojFSgHmY%o j.\/AK^Đ{aeljQl ooӋWCsNl҇=+ZRi#ՇqUkEe$R5Y5Zw8 B Z T%H}X\VOxoCEm]t' EVS}ލ7־b y:k*s$ZMm
mo='Y
A"ɥ?7 U bgdCz&
jvlL U}IMU{ԥZHBBXe`$* ڈ!oi:믢w>؟~<(p=TÕJaxbxW6]P#"U͕l: .ݜ n.oT^ u+lȀ7ckQ\|7
o$)gq!DIH
3G U
vw WUwsQ=D ̐
zوx8nHj'ap38zXೇj:*L)zцo_haI+ԐeIȨ;kYv]҃Nұ sNזZ6 jR̪ EwYRaƕ6n|:hZoׅ
)Χ3O Bw?3Ա:WZ*7/+MY NׅJA
[A>y[_. 8W{T;[S̐mR*o*IPFIڑsPMMZ6eB Ww#AJp V=WULJ\mVNmBR#<(+&*Ku N3 pB%<HUwPǒE8PP. Ƈ(F ǝo\-|&rjie*')h9^#p pB-.-;P,$# ȶtŝn`{ ▯ZSuwR 0A'x[9)! qAǞɥA? K-5`q`Mî'MWxUURT'Hl xrjV5}*0-D;a=v_؎mVZRH:l-Ѿ v]0]i/ ^/@p$F
A+aҒZ/'M5x%̬ns`5'{s[}yM~7}5- nP V3hcbMě~
wr
E r!U
N #6 9Wl ~ԬPi32[_ /<votsL(C(ZeVsfQZUf0?]O^~v(<eīs@T~_ӉXrh*Y*y]
RQ$ӟ[]Zm*CbI" 2 }mNp?.BPo)* &ALHs7j*ESU:R :ϯHr1L{7Ñs:6PBЈ>+XwkppNu i^VdBI2jN߯KXcJTIZj41UVqk 䓘 Q @:V1ktRk}qJX !qЈ~v'jy=ڥ* IA Qh,B nB7MP"3q?[H7{
r<W uSk]
Rbc zbJhMȞ<ū
F2HajHY
` IVi? UHVZQ$B@jEwR, (u 3o
aPY$y(B%COT%H'*R
A y M nxTĥ}6~ODjw3`JIO֛- e)Vg;ݶo2%:[yH6%@) Si bu;{R~2
pB+]L8RUT mE!GqY7R "ӽ2fA 59Z ,)@A$$6H\BN_=A:^.i|NAER@ uGC.2SS<m~?[êamvF :uNԹ@ n| wq&T % ՠC.].Վw R|9 `6k{ߎu-jyE¢$Ϥ0<N撥l+F7ruGX&Ox-" ǔ,3)g S0RI$Rt TܭR*-eHORkqaUczgRM%̢'Nyh)F"yXΑ L o҂zUgh6o wOjݍSRRY&TӬ7[o~؍w&SEVJ')m]?<#wM7s@gԎ[fBB JyK#bnz8k +?[ 躛*eј ytӜ[BE(.̚dNP O'"R{B^ s$';MuIHbT塓`>+ <Qۖ xSd+mwĥ%R yYc|(lF0
ecAU*-
sV ^B;IfN&?#VNU _yRA6#rOXɵLT5qzfCұ:2FglH*m̟J
3 $IukeUEP
LH̬7ѴWmV$RKBt וn)A 93k'}eP\!#oSRJGJx}Weuol<Bƻ T#1ea:42BJD@^ N_+ruLlj@ܸTU>%Q'XM\s4NUT+!Hllƚ$UFWX(lhaThP"R'% E
^ pVQ@͢BFhГwZ]2@BSgo
pAIMOf8 FS m7 5xvq*A Z7BuD"6ŪJi$P̧ [XvQ٤ZIDDS=)22r+W։v$k fJ,42 4v)BRe ge[ ו
deaB@%@U>6s%@JŤ [_,`):džiT%$S 4f4ǘ.^tit/8ڂV铹4'pTWyP֙STI聾1uө:v|?{Kd 2BHBW%;6ԛ#/+WRCtn"ds6˙\wK~URnu:J%I 1?;i\9 ԢitrzolgZF^6EJRI$RNSy[isж9q}p mڧbOvTBJ4'b K/>뙵{5CO\娫HQC
j'h msp+q]Kw}ſzW?)AZRUā:!N3&' xN) J2w?!Eajdom),Wۖ=bD\K@tv EYoX tļq!TRr:-I^. Eڨך mc `7VpN Vpt̾JY#@>2̼uCkpw4DCT=Xn[\T-<Zާ&'J s器.t
:h*j*QmIQN`$kl$Aۡ/Ÿ
徱)n f"HL #xbˎ*yNPPsI
PӟMdN m}$_X!p b]OxiװȤ; R4pc:SlnjCmѵ&Ln`3R'[mnN8B/-N:.SФ I 8cLkr`˟b8[U p}7c$.3 :*ylQ,A3, 0?{okC^/ -RUIz=wq6u7}cn?PO0:ͷ1
sζĩkm [؝wCpÄ8eSCj(!4B RgSb/lEF,bIHttFXwѫsum<G`kiɑ
cu+t~ mר@IRKH "݄<>)MNmD%)=<털0^0x7Lݗ]5Rn|ujϕڲ̤LI4 ?dںZ(zԸ5D(t꼣65lsE`<5N:fI ;nt<=~!73R\m B uZ=@ (U{^ uJZRfu:[L*oJWKq-
$RT`b߷ j5.6˙K!2LUt3
<: *F;eFrQ}o TW.-?iҔ@i V8S7fCHq`IA\;r0SqV)T8\D~ R 4 )@-@F#ZV> #o+U1y<M%3 -"L'p"'[ ]q}pdi aZbq a0lO@()-
ynk puіeΨ@
Db{%qq?:禨[GĒ rgc؆HJP2:2
s#EHRL@2?k2+24wk}] {N[-
TʲC[LN%&R+- G *ay]%nw. @;zZpHV
7c_JZ*
C`C#C6~i
i U:sygnV5C{,~K6 W9<VK0ҝy Jrf% O;_uYi!`L#;4 \UkʖRNC5?ߒgUP0T8pT
1v;AP y'B-/.=KWTZr`sQÝx=;U^ʚrr:AJɝlAEvIBOh/[\k.Is(~ 6|@(+^ZI${ĒL;{UR5ߖbGZ]Ĭ ,4kS {
/
ybvRL:!12uZءt hPHx3?@? #vC UeT 1 wSӯ[R-8f)g2 "uHԍM WSTjU'}5gx:zRr[%JNMO3 ֨6 >+V;2 ] ¨[mC,MH(=S`{D]\!m:jP$Dk]ѱp#JQ]RKg4I>=M}EZ]p6J.{.ٿ:4&mN\A}r/XejՔO<j< {w'r u5A.j2,u|GGcU "ք'2Ir,Mۦ/[noN#2*[P?
!.ɝţC~(×%~-ʓXe*iIIN uM`3ߋ $6˕c~V;)`=s8KN([\xe%EB4jM[Y$&p4ar ൫ ly>}- R3 }ӿǔ
!%) 4}lȔ)(R`fd/!O8|i I%;}ś8V'[}9e<OoUO-}"4Q:v bH'k4T[RR䄁~ VtP }㿯O\Kk!))KIp{hT-ڪjE3z9SϦ SuNR-0*\UKLTBNv;
hp-aD5F:V8 ך u u[sMJ\PJK>3fwe:u$# {;;#l} A3Z7 Iu STATxec:H%VsNB D2$f+) lAA_v yqKO3)@-@
\Rv>,ukvg@+A) .A$SD^/%!#4-+Q$93Q|R!EIL-@+Ǯ;JQ8UwwHwAwWu>]c`ܴ_(̵Xm*^4
'^![%$=wmu Mez)RAl$b| ry{\R5zѴ\pTTƖ l!Ж
@=,_GDU)ä
+ NTۍR<~d 0$$dG>V\<D{C>@Q3FuE=xPGmЈ*|GKX 8WejO{xU&Nצ X^ iF #pt1:Dj|hc惇v8Z:×K
葩Hמk!{)+A/OFS⋊7k~r\44K)9>[y+p
]~ kZfB KJqcØɃ+i<gk'g;M:}/)$0z Wbt SwUt!NT$Fӽ ~X:}ʰb>pf⠹(!lH66Lt^ƮUmR:S26
Ool5勰i[t6Zٌ!DgK3ko{fJ}j
[iB6I D&>0 [)۹ٻER]>!+ yklgkB1n%,^ԸfSjL( F| Q]}9S o! Lsdq_
QWyBEHBn@91>a#ʗK s8
g1$˧o6 ers3N 2L[O2ļrw_mFJ]lV^mX+qAXe]Ilns%ʡ w۠/ b+o kR%jJH3-Vhm
&F.GkQ}t`7_|8eOQIqˡB H ꠥAOKFDzn($b|d+ ÷T aE(<P4iO {(sݠÎ鮋U7\ae qGMa
z^XC;@K$B "')6־L=< 닓9 쵎7K\[_k߲xgt[E5wU%t!)+Q]ǝxtpGam'zs{}H)DOQP-pvƼ+_º mjjƉ `<#kIxwp lɮm m ؙ5s'<A A&
3pR <ׯj^5L
TRT}Q#d̥+sTb&ώnwl9_`5K~A= 2@ Hs2u&֧ON<Fcosx|u_Th)R>#jw0.*i]w8{
)Pzii?IHk .;tGɣv w>:pC4mՖQIb|w˦% uB(O i:@_j;i։
NXX ]Bӕ()H$Z66d|M 7v*PlhϔHŷU"j `%̰AǘޝW*(VA'
~fv&nʥ(EJRXZQ C VGZ
p?p \s[/ $& '˧[RVS7~( \=ߵ۵Į5YU
TۙB֡sL N]fJcRyLer/L>v+lw`L%D giS3 #^qKR@3lnSWT* sN4VqYUd"Y .OOMS naNOL]{
#5:y }-c ^ ()"d_7(u
DϮs^ӏ%ʵ (>}tSwi~ ^ C7J`%u6
m.xVª*CR =ЭˮiZ (z}-<\Ma
uc"2
_k;>q ]*VWZPR:#Zmٲؤ+Jal[I}%JVHu x=l)ܦ%m#"]#l痢M{%k`Ӛrםq7i>+c|+MnV vDc}|Xi$|']OTڙEzj!.Ψ6?{>]lTW6 {TVpU$Z58#:DԨ6,מ<5Xw][-CDP 6<fT6?
ӰHƕ5,fA..yz)e)qږPLF$DmkBԾ ^KKJI Ğ_+a檼"3d3}mv8ɯqyZj槧R( ))N1*s\d):Ym<UԔU*AN9 $R~̀ _ƮfZإC7D@
6@@JK9+ J(QVϕghۙNJ7Ux,%-)#y?߇0i=SR%T.HFI[Hշ/*bA(8҈8[S3p%PQRFxqxPGcjD
H)j;#{"2҃MAI)!zfdlR(hD'r4KoZ JI=#YlM L6S$ X̪%jVHH{2SQ v0xVBNQ >Y ys ? ,
(xBcO߭: *9c.i"?_p2N ShB]W=?K{kMe}xcց @A?m)r]u fE:#?_ݡD } 3VUU<G%KܗzXm+qDϞv& MiYp#r,Ֆ|˒N4'1:!Ǟ̍@ yio@,NvZBy [X#%y
^hB jGߒ@<<meԅ- LgAo= fw6Ma ,Y0!Ёiz@R{
;.Ow魆}ˡA[y z EL6r
P}۲TFt]RVZgYKh є[kӲaI]~ȼݼ*t{ICmEٞyT $('N)Xeٸt1@AczTJ9J EBl- I םT
#$9[\HT*lj6JcMu.v8s^U7+o8 YBV HԓOB.@ G#ԇ v5m{6ăy g[HZ+,q 7mm uJ۫$E+Titf\U<r/juu{EUK<FyiǕ^+:/<H;G?ZnpC<&R&o¢&z>j6!lkh9/$sX
b~`{Hq2Ζ(Z)ZHNGy[6Sp<2H]-l)U@&byXǵV4(kԈQ[zdB4sg FXJcJ_|̫[i@ ;%$$r-Q;45k OЬtk͇ θXuSS
{6lZ Zs
lazն}RB RMm_B|Vk/RQ6j *` :|h]IZ(^M_H[4weӺҁkY@?O;h^} Goa,4vB؊kQ f.&
fꨑ>~ q W]}ي rM-d%@.a 4rV bn %Vo AUGOʎ P<T<.@7o nMSb0c >R\|Qsc[r;WH) quޣ^HgQQ,hKQPOu h9&ACYJkND`)4upX ?*\;Y}Rd\̢bQ3Z3
\4 jޮKFBi[- R@j uŽz O/ݩ.㠷.- ;=pK p 5%ʄ*VSQ6$?q"üP/SXZu7[wls?zZ<~qg^I/z|/6 BTұ=mop?Ԏ~ulUx
2eu)7%!IZnQ%՝\F/Fn!9G6/n04 L*EI rfvOk4`^Ý}hC7G JR{ҕȓPU^ v' T&U{6HSG+T6yw >/*[^*}S&<M 9 "|5G./)S>>P 12?s~JR\ZSV#MsB@^Y+At=w"!C) CiS< Vgj+!T*=H1:\s"蒽 [7мVKw2 -2 >lC@PӔa(VZRJL! m|M%cYP
|އMNУ]Fr;KNIBO.S`ak@GPM^&җU%NZ[mKALo#ӟ+[4 ;ҽghu&Y 齪d
{T]%I
$*L {륎. ҩSj
6䁮ҕ(hwU-/g4Do)'Y\x4ah@Te` o=ɏ[]Uӭ9@a|oO^#vHBT J $
zFZZ*)})TV̀ݰ JlNZfmB<ȟb+ie*Fd4^\w*QKz-fQ?Y6.jЪvY$ωz|Tܿ8Xh}KMS E^PJV0~?;:\2Z%! {^૧+o_1B'v.U' R re+ yS?i+Y
7+eD;z~V.Fg t_+04bP4ח[H:V"ɕYXXV)dKel4 9lwOk^)rxtYPHW2S= |BblGuD3(
u:iX 48q!IL-@Hfc͢9E [$ՔQM)psZy,;\\wv
ZRzc`[MCϦ(_HoTR H w6{U<.uFz_mS&;BRgԁiJrzI#ilmysZOyے77_늵>vx)rKs
̞luwd
% %HI F]~V^ܗUZUsǧv"&C%9;?e
#(0_>+Ժ@y$._!o,,bJ@
cI]vչ[hU:g!m$ON`|mWtu
[
(:L ~vVVZ%3*RLyjj.k tE#WD.&Hi+
ʀH O` PQyiZlT!@ J#`@OST^-ָ7 0&Ѻat̾BHܭ#~P5e 3\#VC
$κ}-֫BoBbv*BҬ^ ܜ3Wg
%Bqr)!BF=~ xbx U\QPV zh'a>.p4p>aFK+Z9 ]`& 0 ԁiw=7e7Qx Jesgj yDi*lM! Um|+}eӸ($UNNYYK 2F^t !FV >vUJ%$A9|2j5ƪ%W Ӌ9T`iu.)
#O8#kITSӺjw* - T
2y1ų2;oEЄ:QQ$|)dT&R:A?YB u)LmaW\KZPl:tůcl1%ڬNQ2 h7XcP[vy+} C@m7ڊ7w' eşfXw""$6b) =~r1]~Y t4lVmϰLČ&ۧKHlʄunfI"ѕ9ݡ;sK^[۪ "xZPKi^dxrllV=*Q;{s9 5 ЭdQrVd$96 ۖ{P;>"3 'h= ,'+!N㌗;DIs#: LfY
t$ bm|UK%ΜŊvnS!y4t$zFm#wuCEk "Nf2F i>R0?Zuw -I mJ D -+߲'8M } {Q{x ))sӥ$ Fyr-I.AE9-U;p-[\3Cyn:`̃Gen&#*uh#Y4Z\KqŢ2T)Ra>.㕋>.{iJ EcdΐDs:zv 7ece/VH>\]C}!ZF P+ZIZ yVz{Ow]8IڕwJIqͬn 9k_zw}:NUKI7o^/3zzٙBAʀi 3[de3ɞSanK"֔g*B 6WJMەTRHXsF -_~el8כHH$( +S^* fI) fp:a+8ZWJ}
wjל-@twpM{jj6鮻kf)k
O|:!Ā`v~0 Ӯe|! ͦiڎ1voo
*-gĂ96;5R=WVyL}331ˌ.WvaE1QX`(T-cIrlVq
F[>ΛqCTH @&5q}J=,^teC d,1 Al>_ A}QauߗwU8BxXPRAz[ژ;ZgR=Uuplv:e_]7 a+ MMI*l0JfyMg> a cl+X8I^IJ\KIYRSȉ'x_/wW5u8sw֡3QDNb3xv:GKPU ]:1M+(Zՙ4*"IwK`jiJVSLH7㥍:l4>*YK#!xsw Cmav}SŜiQbwwUjiQH
$DV+:<*#A_^{{3- K
C,j~&lʵª*-xP0|)㤦d7+Z4 <UBA+OnF]]Jx4< $FYTWr2!* {a
%.Sa0'N H-؎Nө*RTKzh(k |,}d<g0Y)|]u S)#0`u˦v! ʋQ [6J\V2-E2NX'fu6[X(A>-cH-^1̸(U\.['Q~|
Um^QJJPf><%Ais!kYt#]6],>]@\*Lh
i9KJ3; qSw 1E-jVb`I q^7EVˁVhtNdڲiSޥ@<L'u|D;8}-g+шX'z]]jk$i6҃mxOT4T R;λYrne3S; Yu OT`m]ś%Ѵ-"uP*)]>mêi_-!Lw]_ R I-#KJ Jd)| ^r!$ t0+aKv֠ %`>fR_)RNEj*
6сwժϯy/[,ڈ?t
%nςoCn6)eT)!!n$jLH,£' I
13bHMo$@@˷] nvm :: ÝtTN6꿿)}xi`Ϻvh/qWxӴf@ m-z[|Ua^wcjeҗȢ ?+r .Hijz+Y*^eyχ1<F m @N6t/P֚a0Le ȓ>v"Z!`<.i4ϙc
ѮT$: 4~o*o%J^4~0{ST- lOvkxqqE:RuB̑aV5n8z%m8&c&'ejH} jRAOie9LyuO`[(9D* 2@<7p] UxLJb
PN ok
B+{V֖J h {͇XV_M3c7%jQ t"6" q lRLaI}$Ɩ9J_EMN?p + R wK nr:hJ=:~b868u2;|~&MgC~d{V-^ԥRn #_1UXmBJʯ+U A)?$'S~PT}Xdc h{;TR+$jtq%(:v nӃJ\)@`G+yyA0O@>V; @;PIY
6Ih)ԩSH6 O ϯh§6 O6&sMjL2@$Γ< XnViĞQbJJQ'}K bڥH˪3qWtƿ* 9'(-0)$x$ ;U|8׆#p>[aJCL$z[
-᧵RG>v3G8l135NttTR9 DeIXsJn:תtE4& {{Jb5a2הF*zr@<U o@o^ @4$o`U<3[(H$n μsW;;𩗘8MHfxB Z|&Q7NgA}MsմxP\&u&f4孢^fR-qf M],S%j*ZRB`iD-Nx]YB\+]yٷkb'T^[E/:R>/?
m<c%*wVP|J< (Tܕ8NAsRbQR}>^U%,,]#AP$FaZ@2w9I+4-TB kK\KCD(\]lRHKAH$*:@j CJs);'O)}
AR| vS `1յFzJzzgiP5I9.eF'wphԞ8+V ;XC
eWe HԒ9Z> =qmR:Kё @ yKt Ḧ́S j /pKu=r P9CHVu`n- ݕqό+-]. B+Tnч6g<彚ƍl9nmn N&=_N
m$x
^צ =U l
[email protected]_wuB0])aEQՆ 8PE+Zk6qo,M 멣s7~cD&H&`iטa@|rLd5yKԘf.nuR D
eh'2Nzs>N1.)]כ9]
AY
Lg-aOyQРJRYsBgCAke 'xf6| n
c ɻucVqkBI"6O?9ۆ-zeQNj*)*ہ49-#k gٟ JRt5DSYQ:H o\1{a*Ǻsq -:'/" y,yo9]G;gB>;|eˁW\P݄Sީ*+'@Vh<cпpʛZE+3Pڲ'YPO/odN ,0.ժX0dd(zY ( S|7LzT(~Uփ$k{Xn~@!"z̓K7ֵEޗĜb +\
4.$J{D(vLNvEog]f%@eP'A<-Ûf]zWVa{yq ||F ./ iD
vsД62 #VӹW0271}>z#};';^ m]r.ZKm`7I"t՝5ߵS
Ԉ|_{+= T꿅Vނ8
\;
O#n{qۂg~3pMsm/]=ۉ"s5vc[s ƎI{f cR+4-7PJ}B5Q!#myo9z^u ӭh+J՛(D68Yx0Kͤ!K) I7>ü n%Ҕ .xdp8UOC(R\mFC #r>VtG@z SD$ )L
{ uֵ@FyǬo vI]E0ZRkLe<>[&Ep^%`G=Fa֜eN3*$&z r[u8>;%$=D̮kN/-m- 9Ddث⻑LVS-qPΛ_+Uw2\IZ$xRtA:XTɽ*AWxsn5)& Ymdd\ BgF#l
ٽKV+kj҆R&bDץ ;غT*W)SRu |YJfX%jQ0socV*0 5#[ ST_Se P쯂u{ !~`c]4_n-i9㚙 好ݕ Lk?ݧiE:BHmzXUT;[M\ 4<8 s.ޏ s 61jZkx<VA* m uWPuäe 'Zӻ:G;*R`Կr^ ujxFqbN<#4u뭃_JCc6yB{TQ @ً}Z5$7k;vxk[t`ECURj)io9BR<N0 ڵPUYFʖ̦tnaKJ%:
m1Yu
ꦭpÌԲ #76؎!]V@{ӟN"3!JJđ"GN [+t^4m&LѨL$ i/)(FVI'6W {'U?yx/ƕ/{ R}vFew#IR"ҋuP8ڵP%e>˙)J6;<#Qkk.I)q@9>F I']i+ SwkfPɐFk7+t؛ZmҔP\Hib164RH{ɶܼT3VJ2$ NjXeh=--qȐO8}i<AX~ _(JJ3 1'{@5lV
rU= #N $ɷ%O@o
?vԠK^B
gq_.r;jc ۚ =rq ] P ZH'* .aui 2'N+PkCꋏ ~Q75yVڀP '?܅-6<R`f'8& JatV$yO-w<E<4whd/nȢiK)RS'hj
Lf}ziP Io3v)!(.JublsPrPh_m{ [5@d?6gW\۩ۀAPqF֭d B$]vT6X:~i=̽]o@JSh,*B܁'u cAf/7)6;C ]XPT} QV;}lTL lwؿ
pmmT&$MPYB
4JTR EC5eDu Ǫ%K~|9EBT ;7
=E%H
tW;DczS&H6ΰu)34~oSlmO cshR@Xmo˹w]}bjk]Ahʇ-~VAcoj)vZltyo|.1"% vRh.;E ~k,RE %Ow1DaN'ĔjS^%ufX*o!Bd'skJU;wu0- hdmOKtڇ `g{vZzXf|36x٭~TJmkk Az3v%ҭ]AGkq FԺ26Xq'"7%̄(%%"fN7/һ6:C J{y7WEp*R
əCl7iO R AVu | T d;pmC{v'g4tPX@))OHN̐t>c[T fH+RDfLFmxc a h -PW
뼸+ ;,nhzݕ QZp%G;\ӭWr2tnGʖ{7"@*|JJ{L{~ݭSCF|j>gO1Ŋ؛4suӖޫV`2s7;Av\Av]MHaf
'mRzͺG^87].w ;r9p[7I
\iZIU-Hm052:[1w/(g*u@>vxDZn=,d6{{(Gj\ - !zrQ ({\5OwZť"2tf U4z-ťJJvߤX]5NS?w8\؟!d Izu X@i@>7e9Q{"st+oJm +UM>xu||Q)u7%M[ҹUwE"zIS~Nômtnʥ-7t;ٜQp4:jx P:"v܌#su.z E]1AT#
jMMRiRiP@
0 p/z<b*"N@Vi!yzĝD LbwQ8s*OQS>2
']zm+[n q.b|gZdw5*A>*Ӹ h?rc qþݗ&zQUw(,$ I N
#(X;qWH
UPҌ -/<zJ[ZO2:5mEVm˞{%;˙a AH9yXI$|
< ]qZCվ!]ij4 |y2
L86*0#8i.Ja\`?sT e. i.@ fկqf&Øb*.)1 :r ]X*ＪBǩV*hFhH%5˝:H6ШDK&tN״\Cf^7+> ,<k vNiRA;`#p),7KX6K㫥II %%Jy:w//vԻ;Gpƥ+x\gU;%%*i ;IqYVj [b:GUBy])q7WŽ fCQCwg X h 3u2u7bǞPu vEêg]W\-Q?$=F5 a0M{)笟' 02TT曋cB一(', N[̒uIA
0:$hNYJ<UWZɉBd0}śъ/b]!iu*9t$>!:2#dK %I)[)SPs"[**
{{* yFZC!to7U6 P 'XD }֝l0T(1"#L3a@1난@T<*mWk҂uuќ3HII$gQA &;TV] $^53/T4[%
D`yeN&|q) #ltZ燙ߺ Gv$uIOXU B`9\$CU-pV=u
W^-QMd9j*A>ZT 4o( MpSR 䌣QbS
zU 鵣.q*߮iHsr"b{I;JS1R%@+Yk ;{PRI#Ryy
!T%,)+O$FRQ*I
ZT $ڥdq&y(ךֶ
U57vj G7+hn<@>*kN+P@j UjikYB( 9ZZq2w)w`*+MI\\7fCYI#cXw?*F QTPPc ;?n|Ctr_k'+T4l1u-n!i>,Kul:oӊg
W<#).p~%߂ Ë.2vWM%n lx Ԩno`[ XѾiy%ĂڂFJV
Q
?W;xN!7c
G65RU AqPKZo}xꨠuIs_W5jdH3RI
=t6ji)T T ?ĸ隫
=SFRV
FY _Mzгq]Ť4\8 9S'ӝMX qLHuejvj%n9B`TU|3)h#aɂI-
j}c?MH5mB![H ĉM߈(uk/Wu#||YS!9I@NOZ6}L" (賂+
$(trIJme\9eLfy .cb tqKszGKXuM$3mm-:[Z]ARNƱpٞ7p32'A`M: ^`JI@7ZZ!)C~V .*jC(d2BNk; 5W*x*~Ihb.ZH"-Y?xWq~.*gա L g1)B-ڶZaH@II;?yYB)\R"|8as:C6 vX_D!BzX҅n bG=,ܬS 4Ȝ@usc.s\y:JVvN 3Ej-uSy:?-nm@q1*QZ3 })i@
r bo0ql@st4#|8.7XͥҲNT|'k]WkHw47McSa6WI*Lc=uJj5qJ- 4eq`eIBc7"<Oߟbɧ R k[X8릺hU+q)͔jI~{nUI -Zf2a]cd[vj۾=Z~_ ӭq|6+=|$4x*u e2ZГUL+Cٮʗ7RA]*`!!#Mqqrik #tTJ9>OajnRPBNnv:L'V(HU zk87uW(o( &nxf =bk P!@ oR 9EgFr`Sl{*[
w奸kk8&m5F{Zץ=NG\ 9J~#X RXRs&GM5ߙE[]RԠ;Njw0ϯY!a_q=|\=\>/-;_N[Opx3m{KzyZZW)<' pGAmwpXs7UMv
4ʁnJe9@ r ]UR
qGA:o8 wP]n?AK[Q(z1
hT.J,k%D>*n7mSj}]VV'@@) 6M
YJ `!"}
(J^E+P|1$HH!9s
ӻꥼqmWN{I( &"R#{2\K}`@ M\BmŅnj
JTNc#mkX?:9v4[
e]:oX.aw*N<Nb[Iګm zy:vcn6`6-Zj9ڢJy .fq'kq!l6
r9 <w~GJMukYZ m@H 6 nY4lԝix]Y7)5
擯/ Rc ~\
Uu%9)%ZZo \ ֖]ɧKo @)Ӿ/ ]< j_XMk+]y.ARC;$"p"Ϯflu)L]xUb˒^#kCha.wNmp. b+_qau>q(CM9ډ;oDjf':Acrz^=o
c *)}UӸ%mv=Ep,
m9uѽ +8tv4ok8V*&y[vJcüHoծ]
uܩC];jmQ: .R(UMUWxl$ReTY9d]8h)71 ;뙪Yw h(1ҹ[^\A˝B8 Zjf]jgN-*m57 h )-th?5JnA % 2@I
Ngi>\Aj.o
ThMbab<;Dc[prRp^(03
#+PL _ 5 ko؆i* XmԜ: BT+QyjaOxQVc Paf)QP3ILʥ$mu2%Բ^#}J׆'u"0G0B_KyrIHG w]h&.{M3iZDkou-=HU*Y^(*g
xbKI}!
>&ѩQ`Tk).F_UUp?^QVڊR gRu~VΝIt9QN¤.6^vUIKuaf /vA:E롥xݶ`
ON_9)0,Ej\$%]ImP>yFzihnawmw0ng~}mTBkܶn!)qrB@mwۑ9ClݸNP9 ĥ&}DB望tbH@$忘W
3I͗of(mn Tg ?=G Nieΐz"df`;iaԌ r EneVLēyyD,|ZDm.sʦ$2Jj-~fꂘ TXd)"c7cmEDB|d6\BZuvZRQ$ m"Uqܛ#j
BNb 3b;RHyu9[Y*PTc}% CHqj
OSh^ej.wԖH ?.]RNW
QlvݔA2;\̩-GY&q+lyPO_Nj!m.zF [rNM] <6Y!+?_afE'0SUSvuCƴ#2k rJoV]raPR$I2C[]vF1U*x5U\(jSc;d#z҅l=KR!ĐBҬO@j} G4> V2qն |_Bo
L_8`禺m "]XHO屰~蕜\* u6u7x j[l9jQLG2WacSA+ ]r?d ?~C.9i)W)}©_],ظڐꖠ IuiMjFRQ;T@ <o {+Z-vf0tnmP4 zlKf=MbhB!D ƿ+2@ꑼm4%D~5;N~ #<a; 먉hCN!S
$hė=HԨ$;u5XMDI^Sf%4uW83<G^< 0>bB҈u>bvmk VTR@Ԟv
TN: J|ʾN͜C)V:XJ-a/Hp}yZI֒ <^tB਼*] ȓNL5H8I?HpQ[!?BET ^S QsUg#Mj. ?>+VU+3 :筂(zB[@RLbC [Xv)K]3&l:Hmb6/vzGZC_A 'eJq$6HVbtԂ#kd5dnQ9M6*-zmHU
/9QIvӄ#* t1}l -S6k:뿦ZJ[ 6ނyI@ƹFU(+\!yd:eW|RL d
?V
*RFkvq@R`RJU!zD
I>vbgG;CQ%%RuuNVeKSrvak RL4nqz G2$ ]ZiBEpRTO8Ly uQ ;]M켦RLk:{Uy<[gN8#@tF>6\K+xL
h5.WKP|&hmZa\7Eƴ8'Uk-kj ͫ.)1Zv<R jzijingqP¦,;Q ~v!O93G@GYΗM6z,Q" ? =4o0~]WEXjuu H$
lPrEi 30|ȝ7ߤ0٣a+,ڧ[T- @9wԈm⭚su]A3 <$4[zBCTg bL9k;Iu,[ɞ11A<ōQ!@Wf+.k *ih*[*Q?ʸ$6dbj]NNPAn
_jLE[y^KM[2Ӂ=G
@^:T]ׅmnvj
@Q1"Ld9Ҵ2w^ PTGS
ڜmJnRD rԟ=9Xj5Bx*<IPķuuFf6 Aŕ/2@0Bt"ߤT *7A: <ūmĈYk]<EׄmudH <657v*ixW^
%Rdp*4DNV*TTw" YG$Bloƫkl(=xwjmYT#+]I!$8T<Wi1-v:aJnapO0 쉅 !RnEiС R@Q:tl؏8M}W
*:\*% :H4>1x|ܕiL<R|E6<ѮNE}9@Uv~f|JqEʒǔw a[,R76^͗eNj2mu]Xy*,8wzj̩]ڊv9]yۯR@{6
#6?7)xGOq/
;ڻk Ku)M<s͵& EI3ass۟-yx+G0SR vaC$>vtޕ"VB jI&-p9K]e
H 'kkvS #|b!QMwqUNNCRrْ= M[']1}pp{M}ө %jALuʧxݽ uOB @8x
Xr ̢6U '"TD
H=t:ur
T9s 6=')[b\b
;\
iJVP\t |)'AojN>
2i.$@#_[
,8{'%iЦT<*V`Иc^+]]x\wCQ(:tGbl Tg/ϧg +98HRFO)[-
=h(j %!11m-,EM((Ru
jmj)q
R` kd|bx:YJu yl + !֟n 7$(E\Kz(
7_JR IIXRgY V-in!J(B ؟Y=eZ< h?j]TsMJ6>KDX rym
\ʴ&$ =[=R[aYPYHFO._W8Z0BA` ``kMڽӶA@}فMyuH aJi9rm'FZp: ''yioCC nR
C.h"}>"V3a1RrT26F*ZC=Ok%ThG(K*2unCe H%nJj@&FDi0 ,lWV̼KMuKK 6`kr0L;bەCj-8.XʰC4!#Uq} J@L:?{vRA Fm3DrG#eʑhmeSBR [j8
g߸)_Wb rīoʍZlM =p)7Tux<O':']?Y ó|e;Hdtu#5ι s6*I*7-ϗAiO1S ZOp=!1uSu -Y)N|7~<Mt9 U -Q%'^[Ol%IAI~y~9"`ę<3Y
ZY>"ot1ܥ&i
G1:>:D 2MIG;Kyϝ/T[C[@[ظlJ7 U0-Nt=-ev4'RzrWϬT$3ضt j+ ,͂'ES Y$mJ
)K` cڋ͉4o7廽I8©Z+rf$ )g6wN:iԥͱo0CsT\UD<mE\ÕU;@W t4oũmO I+YE1?wXoh@w֡Yιɟΰ]
EEBXy)2>[qJ\ScMDypҼJ` y-҄SwAw`eI|+D8AJv݄*
2! iiT}jLwm
] Gyšoq==(!#A GCgW*u iy)V\rir 2Xߧ{;eqq:,d+uB U@ > cO? LB SS8j1"A? u]Fv݊" B
v.$0u }';O υ*GpAｹ-Ǽ8iʚT6#( zg1n˾5S?O=̎t<yĕ )+LH??+ei "Pޯ)&>
,%YSeU1!A2QO!/d*Ni~Qy^vڜ zr @^euU'yJB0 _OSzR2ZX]j{:HWݫ*F9I5SVҤW*m泌-mS yFO;jCuӠSxO+A+JJg@u}IHχO_omb..\8e3S)>'q,f 4J-L-*H$NzwN #{,K31M! u@(eYLO+7f?ܿo+ȥ]irh~-bjK-wm')p"fgS 'k֚ ΕɘE2^͆,q 몗զ7:CYBcm$}|xQ^ H
V#SktRT% ߵVP IPOU 0&鐠< s# Q:%SsIJBqyl-W+؆O a83p6 <ګ`< 1)!'PC ė.v{44ד$
N]|[|$i5ىo aj+ m*nmIRKe25:8={9P_wKه aYi)I g2 -[mJˮ; a#]19;S5xuCM~w fs~1+/x2IL
$n'U$h :m"1%MC|g~H))=QRa*mkӄFy=wU^%Uu}+ѭ`H} n Fag ;Ub Wy7"F
DF% ۍ_t
dkom|EUxpw4';pER!Y³fO)A&@9L4a^Wqwsʼnjgҍ`HD$mysn 8 7J:w** DJE ;IUl~]Suxa;W{)s.HVP wܷD=S5$m0.#b\L-e8UiSHijT+ mXtN _AS.7kbqjT &`N G5SRk)T> Lw<lߕS>q;pqxjsGxĬ)*I+$Qv(= AuL}U2+uk!)#`FJa=[|hCoBu9Yw<y=8 be$-DF zWpUL
Dd=#_MA,(KLL Al-$5 AZkns~SzkOq%ɇ̥NeNF(.}TQ^(Rgm$~;]8C)k]z!$~Z?:* w> xT/5g
O^[5h##)ͧ3KtH Z@ J :i,wLG%h ;OO2%!I*US=m.sZ#hh/R &$rzY*Z|+ T
yw(֔0܇ 8/XA߂C% GG>Vr-܍#Dml[ ~\x%$m2XC%[iA2tk)-0
&dVV xA -DAWם鲇@lbslgPznmh6QR]-[F4}b*ܹ
MfԮ2RN]m?v'"ѝr (ogmCJȲRDNl2*B@Tեx6fS\FoK{BwG]Gv{9zZrnL 4T۪J
=z؞Q)$o0 3(Uv&dESK7tfݢ5u z#m+BHou[W ec!m>(H "GC#en ,okW+>'HM5JِDHAx鯻Y~ "BUkjﵦ'y^\ j4--C_+Qxk;PPХ:Zs ^i -w K1~A$f [\ fH
:_+x~$քm?%ӵ))Gf XWnkery@I Ɵ}m{i+FT4P 1 4{6ڏxNcg㯧K'$FLמaL\IIX$:kk ns Kt*R)q$ u >9V#k3
,%BFzlLJT]M0RT$/c
벙e LUټ^fT 6{FE7 ^z::? BA&Hb }&샅*liORԶY%JTy@;n'Vejzmѽ5Ynil*>)Uӂ*J PS)nt
K`Kk>ޜHΥܴ$$v8WV\VXL$~|-L 8
Z]T'QZ f\^h4az ǟYKTwP)HFdg7M/;xU%))I0}Ɏn0qn`.G7;W{S i5:kbTa7 YH'wvK@XJ`iM⪪RVHLmXGK(kz~+b!Q
nw/ m"rJ8Unꖠdߥ8Eu&
%
)I ?[2$,QGZ˩]3 !o^ĕm)D'c5 n
WT7!)*8{T R2$AK5hH# mMNjˋq-one 8]7Onz/: &-ԻJ7hBMZqw[J[JSVSAI> ĀVc@AJL /tYPVZ \S! "&rk:$1@ܿ3]y.i<
qŀiAF8w}YxW 0 'O{ZW(:}ks_JJV0Q0[r&ӴMVq$*0rα *<gux鵥UR'JrQ4 tx~wIM=={ZrTiq7vE]@%'F!24~VȔ 4).ֺ$-Q$A*T T+M-7 hm/w`,ؓw?2Wʯ*x[mD@頏nvqUK)iH|?˞nԦ:#"5INE|֮_5+q o F\-"J\7}߮>6B T [ SJuݣ&WrĐ@<W;>5uAu@Ncƚ6[N\&hV&Hn=ju܊k+_HsQLju;m((f*PCͭ6JOc;p&RP9 'o:]umn O?j#Eip
j Xn3w0[9|2'+ֻ
S4omW-UBr)>8)9r:*wۮVZH iD裤ztACzxB˕SbLNۯ
-8&8 j0<\mYr_ o*(* ycP 3vVwF;O]5iHUS:BP0m-)؟p_fQB^kjL!= ʹ9U%Ƙ5 Ji?Ak
~=mnA rˇUd~'Om1r }wqŴԊUC RPDg]vOLm_o Z/fϵ2ҕ,:PHH>B-n=]7} lݭf M|$<bR ) LaBms7QRIqj!$5Hs\Iӆ%1\pȯWXJ.:Ĩ,;2bRL t7Ud2lFBc&7Y[HgYM߭]Uj䧽L+#b hFf)V5Ρ(%':f;zkEꤺQJBVp0O1"Nj5Bj"u
uj.`u4*H mk%:6 @뎂XʒV%@!'4|-z^r騿+j-4<Duym;
S2VP| e}% xhi
+UM AS N EGQl'[zʨ0l:
yc+ϴ [i[R ;u (΄O.{p
-sY qANU3;iY0: ͋~iיQsW?w_ 0ˀ[9?ť)^uR1-fO]ҙ<=W<d'9(+%GQlwr54lJTO-(=c u%>㕜 !',-YxNSe T~)*)G+AT\E! >ZN(eJDƓٓ
ꈑ:AZ:. Rhʵoo-I%#Sn@ im,P*ii4ꃕiE45Ke D;6ko#Duߥ(í B9@Zv)BSs$$5Qi3q,w
N w:-HJe'hdyS6FPeQ66+)Av0S$k b;DZ$:X RFm}}Cjc4x vfWSLhIG LN#A
<+GP@&"u Z R¹uXo (TLEt4@$ ) WP<?BA 2{Q] źpwsnU8Vn(F`ɔ8<( ZhO0@,whW@Ds/{|;{]4tldgX筙Vq\N.!HJҨʝ@mok~<JT:$5k`<SVԯШhL
jkPT=knBRRQ
po +_8m{PAt*]bwןʋ}.:"!g¤GmjkJ!Ɓ`}v,2Ĥu/.p.2M=t jѶ&I"V'#/Е& Dg/q]-eWULC
rHH~6߽SOu]Xzʥqa:0]ԑ8
\͙쨊66 |br@uc*T$;O]mlq5p
9|@ a&RR╦ev.ɷkl$klZJЋ8w~ѿYG/hSS~մ+ <3\x^JyeB^!磊1V5U>ӊ9
cQ1 ŧڪ ?Nh2kcvB-Sh Dcia 1Ȑu<?Ma˕WKT:3 7|x VU&v+cZԓsN)Hm$+2Du76+r7=I6 MuaHduBT H徖q++
xBD.sֽx!S#~N0yA5c[EH-ru<`!A@
7~\qJK%
n*Bę0<^q'ݩJi R (9 ko.^mҴ@!"NC>A4r*ҵPL(&L:zD*O|^D$絰8ya5uXgZVV9=Nm-F.euUՑAD|tbE]bcŠUƿ"/%m2 i`3
q $LOkq5{Rp b fu\Ei.ȫJhR|f
0O=N+E;i\I3 lMjbt:+wHV4PtnmN#a<Rԃ
(m{z=UO+Q-ieq$miY:NڗeqS>bWBgB ,R's}`^uWC0K :㮶TMX)P
㡵 d yZ뱆
휎ħCIɗI'jn5crON4m$HF=o41v4Μt-T(VVݕL9sumTˤMD<IBLM St/Q$Fv˩55IRe֕!&3iثU\W[%8 2zΛ
s<0uw7
gxj #]:y\fݻ8*()ꩳ$-BT|S+ :c5\)0~24 LkHkCt Lr'=a[5^JJIZ'q5*4&SfgHMޚMV<⩖Q!.eRv9GNѼ&
#U
] W6)B]L +_np@#]R<6 3'gJ[b@eԜ*3PJu+r\ץ 6E@϶ѶӲ :
O((ue:W75hoDԂYs('Üe`s zbnϼrk TQ߷=BSVJH|MHa'<[-
ԩ2xzj/ePIWO% Djv$xsqw]vޔWABZJ^BU jXBXKEzV.t,)),G d= ¸۫÷㘉s<% JlHkLe=UN=":⩎|Q|o7qẻ 5N{ J"OFf 5R[ B G9F-v6\;WÉuL4)9J%H)1=AC^_~uĄ%Ĉ tn+t_~ +Υ խ$m$܇
R;wyξ5s"6_JۨhXqTF<-!ko+;7t)}%*0#a 0kM{ jW7qNA2$NY8c7!Ĕ)TYeF뵳qq0ʡdBHt zX#Tjq2oE4E6Є<;I'̝Onfc)>nmtÉݤ/p VP]MK)u
S {)Sa'}ߍ wRI 2 kkpca4OE͘bt"m`]w5&
)Me58P@iN>$aOaQVᥚ< Nn
&n)B[ %
y ^b+((P@4뭢)f%)Ve*lG!-%wT'2DA)H]n m+%*@)Lflmy >#]4ƙT2I@*
"UTj'BRu~,q):\ac\左tt`NY7|e HFrD@}~6sLd3@>tU rE%&$j58Ҟ
+0'4
6 v$ kP;ed&|Jd2[lI Fo!T;+XM:ik)ʧBPRu;O4CL' zZ<B/)gA˝ڒS4ɍ,=H2#+2`맥zHGI7
]PnPs6*
Az90ml#v@|=%+;[*PD
Z5UǡV[. & H@ fa V0 { N,
bwU%iNx@ :it i$&=rHЀ$}GByepL fm M-{\)%Vuʁ >G.zJ/ 'U(rzԀOe'8]h66 Ggb4Q&J/*BJ/I =+CNDx}> s^BT 뭡/J [$*o1wI+/Ւ=]}46jjMg@4cU*rh $DϞk`ӃQ 8R)0v?{K^
*J ! S }L
XL l2 ×Y33e@
/QECst4Ҝ_w\m«} Pܿߎv*2
RPT[ v@ Up+pd]AH ?Ks\ b|Q5tF4tgڃiGS ٵhw9yۘv+v8UzUέ#!2`Dt;XcRNg**)m|R5٩w QPVAIN L;ozNg3$M~gX}8RPA2F6:okp^wjo+ʜ:N nm
\nb[) !@ƿ<w߃.%x#1'H:8A,vJ Ye}PaZ7! ldL|ڬ:!K
9JD:
gA:Sδ y:G[4VWj!DtO2~yZP je
uX|JP:3 67U.kFL( /h xWPݴP{)'ü@fa\ 5`rӖ IAK(s$ߍ+u֪rIHPLs4ZʦzcRjgYxU}jRJU1 6!]*R+-fv qд9 *ZjFL3m`RdɏBzmk2kvݩZWjm*CxJw{}j%B$jDd-evtxuM`lyD
v1ɘ;ȥ;.pT`¹P^J$MۼM. DNeGTAp` ț 7Z[ 'xETL+)F;:摽eiZmk̬:(1xp 剘[)vjiEV O/+j.Qu P}++ nkUi>R8 J$ {fX a T]MC N:}̂GO}2@Y ĉO /Gsi IP-opؼMsn/{y%
+={]=Be@1;F5rEEmۮ+@ I
$nm-j?x?^pog,$*whKEuxuYhDDhAdi}m%0 pRX= X;_IR@ ;IQRTbd.IP^̟ګcU.=?Np Y@tf#m&gKLᖮfYG! P`ǖZ캯 F0E./qMy Q[4HLy2a9łu-,i9 @ lA'Pm vT ݴHVdD{!xmvI/>\㗐HKJ2*tVxל;ۯ s,-Gp^ n K .9Iӭ\8ɋ8)YnjG~tQ 6pB了8w$U3!C`iP踎V>8(/تamYKe6ޟvy<ߒcX h8"VTZUL<锏+vظqsq
Ԗ'0Kmrf, jQ{v pc}pm v)4!pU*1>v>GX_qOyv:m֞vR}juT\4s E 8` Oy Q{=BuB|%ifAg.$7N 3St)DT
VC
I'N⻣}
w{ ַ٥Vd`gCe'C"NY>q%ыъGQT뭢XYJ$)(9O,-,7抒?S֨n//$L/vӿ}NdQ- yOb&-)*q! /9IБt: T<po륁wrWӆ*RT9s;FoW}W8KT.m5-Z56|ښ _ס^"p *0*IE}EEm-&I;OH#xMºRA-r 4mÎe*3d+)BH]x ^G2g%
:ۛc8%:.a1D]SxC]
]J\Zb }h)BL'Al9Y Q[w
ϕCm% 嬍~6K4~gd1,yJ!EtH}Yji so-Z=44WH"B:K+}!ED QeR3jAH.hRvY6\+m0bYYW{tIo֨Սh="д!
4Qoe:SO
,ڋyYQOFj$[[u-3 {_Z[ ! qI Hf&i*B1B:}4Rl X@KDePT:(CcB@Y6( o[eBTe@3pB U,]I@PQgc [%? Q-#a?K/ Ϩ_! qgKL=LA" 'alUD@-[&?1OJW =-Te igt[JIJd"v;O#*"bÖMsC6
~ t ^ &I Zvqŵ*ƀ}ZdۄSqIx!n ?bw5[;($BwRP%E^(Q:N>6,ur2)J g,\dub:}pXCy:X(
7Xq)m*s
O^[uu%aJ$ ٜNB3T:@ O3< Ե A)EJ"O۠tR#]ڊNX"_z ]5WJ%hX<lT}ky{\U:B9mFm ƙ.5a'C q_AVԩQ
L:mb 9|=UVШFHdͩ mgScYl5 XUL"H!GPvl{ [tcנI ;> o-58{[*HY Nkl#Sؔ s ޔNBF#H?
Un}-KLhZV %I:$DL͈h0%-:!DRӯM[Nۭ!l8\Zs6 D =뎦P(ȒRֿoi
) r+q%R
Q)T ە>ik̕:x_gP
"G?o OV%ЄbA p|ﵽwo=%IWhЌOX;m1vz,j sKS~>;R9HTD
zo8fw6eWu%?OO?h
jJRZM =|ͯƩ( er%#Y . #1uIrk$!)KZ2 fTy
xU JyiV# qωmuwJA^:-G.5r\%N(d#ĠϊyQx?T\^BaܲA} <SfMIw>][Ғt2tuxkh4@BҠ9 xkZ
ۭT/D:R|C}m*ʡG *
WVL | JFIF C
C
"
L !1AQ"aq2 #BR$3bCr4DS
%&5cs < !1AQ"aq2#B3R$br4 ? N49 Ԑz?{!yV4J&9gPZs)o9D`'>vO.~l-yl6&vg*Z;R>UTD|~dZB>
sը);Iȍ b˭%4I`~ ֶMvNxNNa6Cָ!K4K;r kg=VtIB4ʂ]5&< Zŕ.ց9ԓ=3Í/u
Bܙ4-, \&T^#SNϣҐ<CRb>lKt2B,"B΅C9-ʅI$ӕ5Dh
ay 2j2Nץ5Zʛ%2|@7NR u K'Q(ZBBBwsnm_mP :Nn$,AܒOϺ4*9 3"<WXo9]В%|^zDGwB
&4jm%OPV6vAXUQH)IJs-KH$e^sKvZ%H$@
bu$D|c
:PiH
78g! ФƇk@>Gcu4TAK O+CAKpĥ<B,D sk~eD:T{Cϗם{/ n%!˩Iנ
AHXBe͐i _,)Ƴ8S 6q+rT-*Y1[~zR$ "H}U Y OC?K}R PgM<!6NKmLP 'Y*7I2O!d> L\@1oƲ
饦麁s^PA9_+Xb>?'JJJ\ԡ
IuuSJLV|[ n 9\yhԲ x\/!ne^CMm+w*RtN6J#0L> KV]{ Au *IHRڢ{K{M*
ꖣ07rYP KnF4X)XKn&EЍto-\e%CCoJSa.xAyoΊ^ ">iisEC hHML kt ^R oiF Ioa $,x`'Cî )GA
s?{$2][*[fS*Iͩ )T2J |:ya^ (j(n
g]'elғ*x<d:(jL
":u}2t ̥?bsR1ܢӀӤ)9Zu
6Kf ˖m-
}9|pD:ہ@
A>ZͻV}BID h:mjg+kD{I/
u0|ڋ,Hd O[g܆XK2mmp8R`9ءS.% Nwrp0 1VIJ@3ݑw:RN-@coo!>ebDq}K&D}ej
cA DM㍩PJO0ck+^7MM^.ռD[JN*(CJ'VRըTNv3ķ5=c/6 ,.c/
6A3v?dWx7C qJap
\z~eM<h#Q ^ݰZKrx-}xm2*!tI'sc#4vϒڦ[;Um+TUg)v!é9I;sm!=@ ( [mm>)A˷>{-Gw0d\m-ތ̋ymԤ&4H2v%hPs )*W(rz}OpxVF OCLy(}5U.b6
y
$APk*S%&R%Z֥u.6@$3VKU ʒA iem6ܪ}k "i]er4g+b5tHFPvոlc(v R+
ZFҵg >! {Jv0 8*lV{x[; |B/kޯWt-KI<a;IRKY۔!~FjiBe~&?ChTDr}-ޡf"'arSnc!&6RIrRcc{*_B'R E.BT
F}ֵTٶ)tL@Fa(}*FuY uOhG g2 aT2 $#NB3;lIZ*EP?F!ًn& ?kS~`R5Iצlu<i SK Ԙ'pʑpӴ"Ώ4پ<Y Oݭ: 4;~{h-R~!HvOxH4>(KJH:ӗQ6ZqNM<t+eu*qM+myH1;YqIM1[$c@: :h,XekeYc I<u@o17XH-4Z@Vzo8%ܶ@B[Ȳ@5KuDj& uiZLi%KQ.X8j^II)Ωg}֒i!A[
JIFr- LVh!* " MƤ ҩ sBLw$OnV>JѦA)뾞vU
C--9A k4YS' <OГeEBdOtoKUt
u =4.;24nːI
HeBR@k/wN`Y ͘e">[ovnQ $O;ӭ $(ײgCR c<5YVb::V;+DZrD+IJtBb5鵾
.:.! !@$z=&5 u
LOW 'ĐHO+BԼ 9QRοMن5}ԒRxWZP=_x\ZwOvvgЍ-( g^Ӻۣ:+ {I$_o C!4Tt IˑzgNs3; < nR[^K̰H[[xZvUD4 (%)N]t u7t)iC4'Q>bv̚5- $(|\l|HBJIPЍ /;X Eq_{ʂ I\(fԧM
x ZyV\R$'Ym '8R Ttߡ em,6
ԡ( $[ x0}mC`CI gy(%A$ z .VVkd- Z|[$[xCWx m,
GFPwHJVIu
ܾ)iBx :Z
i4V))x[54JҜs&A+ L-{JqT ị P.a
^% 4d46E-9;̦yڻʰnxAz ! ( nN_ ()ʣ+6WRb硓6 :h~̓}X-6TmȎ T@-5BHrkxt66O QdD"{)*k? ,|e_r
J/lڥ,aiL2Np:uDLa
Q! FUNs6;!6`A:`ݐTIHO_vod%YS1̉oQAIYe@G+pPv<Sr 1E^T]|)]TF~A&TJ1ftExz9zЏgZwCTS6;t2弑XV6sړweYSD Ċ<cP +$+kZ=7y I|셆FG73k/qSa; ⪼/z!=KTPp
7AiT I" [T~%ݚjhK.S
'DL"XBRᵐ
JծmnE^BKǏ8u[j鄌∩iʀi`ϧ캝l@-!5ЍdiX)
ӄHrLs>VQ!j3
tm41ilnbFauw5-MItg
HKAH!S}h%H!Y-5t]Ԟ^vr"9zy!n]W4x'RRSS*
4Jh5_aѶV klo%)'çnʟAxHv As ;eo:N($NR@;͵:$"is)65 +KuwOW^S$$g42*+Ҳ3oޖqYr/1mZh1 swi&[l ZJ8bv}2 $#_i Roޜ.xوLx@;VeOJ@')vXQ^J 5QJUaVi
.li;OD@4:M+ؠ|e5xեKI0Tg4Sy 9Ao. 5iNe7Ћoc+e7y`Q~.y XDG_A4J3 Ig?ѩ4/,4AtrX5ni!
f M케_JO3MH=BOפּjVt$x:ibۉ4eWKX;HNn0a )EU<PSI:;$꽣U@;y͔jkVpRIBI:ɄPRX$)!BNF`x\H}b H~+]~$"$n4u},9J a "9?[,ڋ*z"Jɝcکu+z̍IIהK=}qa!+>?m[4e*Sm"PHM6ti Ve@'i KKIVNv%&F|f_mֵBb?fJK
19ƻG_M,%IIG
y3Z+T6
RO(x6
*h$z,51qI}>[},L!E$'h>οh jž&orUO/ <ӥ:s# b&iiK
2(@='MuX|tAAeBDx+X2uC!E2T [moN2Z SRt/)@9L(fIۂ)zN ΐLm )uJu=Ak*΅ 37<>Fj!-Z\vmmKao%)$γ z[>ð BOx`gRs&G=t1xskffS/ r#S
Z]$y (V IJ@ח7Z\x!fR e yf.qISH ^( ^V{0q(*u4&P*ݞg'^ xǰbSo u=adIYN Β_HpJ(h'h˯WK8穣S% LHAJRi?G+sG1Mթ
I h*tY#x
DfIE[O[}Jp
$V),YIʐ7 q.wnNRkFXOzṭk#qn Ɂ.-
!TBUTQQe
RQH&D;|%&H)"sk-2`lN >ՒsH YMՔ(0u;i. m%0PI1b@(JTe)[B>J]HBLISkh
5l 6eVΠϟOp e`ul1zTwPGq:Z{>RTmo7US[pɅ^-d;~- h(+6[VDăa! weiP9 30L^[HH$ JD&zٍ%XZ}Lur>#! h#g`
J0P9uw4c _;55TzoN(4*|塽{)I Hēӝqg6uMӶ[j
@W^j뒔ȃߔs|2]%}},+2H9LL}w-{wu-ۇ0"$G?QoFcLu Qfu/:Vt)0k s)6=Qf" ^ U5i AqC4F.=Nw/
̅ml#mwmb.OMC !giJhR*2
t&ڬXi<~vk*E+ʢ i U]ߚGZ]Y$L<c MC#*[(~#0 ErQVФT@gbR!Fg5Oe&`
ī*]qE@j<䏱]iPU@P&)5,w3xQ4l }~) j*aZ"H {^Z5+v"zVi)iM\vK< La*<}M< ?[j4tZD²@1[&ֹ][Z* RyP 'fpm}LS='E}Jv}*^䨨nXQ. +R)KX'Քt 6ʑ)ԝdH<6?2\ :oԼԴ!J % T^}E9ZH'q:
^
a jH NsNv`^.<~ͨ
ػ;@@vRA3[ %>&\h}Jh :/oniP #~{Tu7[ܢGjǘ6
|GM ,OqD K
\RPsNsBs̭Md6Rbe8hA 4 gJRuO+a*t{DܵxQB#~+H-*J`4W_~<D^{*J@$Ln80%Dz7ziT9By;h)p$kFH4T0V]UO{}9}Lt?qb{I[P YR`wKyȉ)ԍ` +먤Ҳۨ@ZBHW]t v쀠㑍y hr[!( T:=`=5-yw2Vmz|&!]!|F51YsK#-XRJij3=$!]M7zpH ,5KRrpʑSNsi۵%
ͩL5#t$"X
!DGM0,?ԏ3 hUd\%iP3:ǦoR[FnJP@;yGc^K
Eġ.:@@-d&T_l8N-*> Ӹ[S#2U<`w_hVІ!Fsy4e@:6)e#BLh4?;)Lֱr2
Iimʞv=hT;N[q@ NlG-6ʻh7QϮ 5q^Ub T
ꒋʊ ((锁;? L;Ë.V>$-~`Ok+t~\r \P%eBOMw x/)4%Dnrf8WnwL0ٕ)jpO$ s7r.FYI ruIica3u_UT "hi<!|-e/Ku22ΚΣb猪Cf@SKVQq5H#Q")%)Rbtϙ
~QZޤ:E& (v##,ppERSW_Ǯ,=i[
C2AQ2tTuĪW*UOU mE!BD!"@T0Jjjh6N3g
6 f$'* Sv"j
Qj7xI\q ,іEmܘ[ #*`g.eɽ+\C3:A^S' $ _YBin7J(d) s0vLｦh
(TeI21j N]E.> jt믲KWM t3Z[Z\S
c4l; 7#]5*HBD H>Ǘm
`&3- uo*i
$:2)I-<RuW>#Btt뚌5UTg/k/0ewپn
U#rNkVTYmjRVC1on"?JO]NɹC~+eМԯ)<ž7y}x?8y (Rީ}!@ HyʶJ y}͙clx9x;qΪJ[yI*;[YuM&Oq4o 9tZ*BAi5R !)^ %WL= Y qH!p d)PɕAITߟaL`lkyu{ $}+D^O&
mrj7|b++S*P HdzZvMweD:;|m?quKNRR:ykaνԸhQr& cŸ^JKRR`
be9bCí%-%(mi֒H*ghfx|ZB "g ^@^3*gyHQ8 D<;I!
; vqEX>锨gTUedRU ߵ{_̳N0BITПMjX$$kC"AMϜmQXhBj2Mr(>Z T^*
IHlٚpT2m㖕 3 <ZS0mk
:x&4 vneυ $
9G.J)Jy ڽ h+ۥE
%]I? [[k+bwݽ:$|[4ӋAJ#m:Y:hJD'~_bսhUSho H$baD "ؓ
P⋑뾡AZcgC
WS.,xi5̔G6#&qjl*nr۶fWGbJ*0帕CBا_ida1E`i&$; |m? ݐGTދ@nmJ!nT+Dӭ+Uy ԲI"w1/n-j[H-LXܧ
a ~މY/ZַV㲵 g^}l(@ e,%V;] w1J!$F"}9θhBd@~=
%lsW:R PJBr : _/!%Ax^
Q t0 Dv7jR Os6g$H@vm N4iQu
]KCC̍ ?[yS(j"4e骪^ (RTƠf5S>IV<K$#d!#$ގi)9utaĬX!$$ ]TAPH$;u> ORJ)H &co(JGRӰv ^?9 .躝ZXJ7(3uS-ƕ
zͳ
[|yչ)ǁ NX:AБڋRryqu V:l9`ꯂgLZs
/ݨ( aGY >TV7sf4L$
DzשS.R}6:6 Y B7nH.n7N[;qT]j*Bb R[@ /l)7eB[9J I ,
ќ9dzCVt%Iϩ ii)i. rA<`fLԡ 'c|>hBRXP
uP IÝe3OvT 9,N쪐RV|YA* #oR iʵ)M(s
y|)md)h2J3 {}s':Ql-e( VR3)&>͠f
TH6zŦ:)
$ r<絅XЧT2KHR) ~#[%Ydftiy V $@$~Rm
R (]EԺZ.I2N^z2[i$/A |ͣ sw)
$,(2$>C[Rj4m' ZJUm#@H8ꏅ7UUR՛[XZ*^g(<vw%j^BuZ J4h0bz뢺 Jei)SG=Iᬙ'lF\~EV }5(<$MF5xOʓ9I_+K)>n6)yFB "H/fr"z
;iJZdа%c1Ik:t|Ei7KեST! & '_Kw&4C;`59'[A>[SirTT &QtyDW:,4CMvsf*:moi}=T4*y%Y`vSkJ=x&4:2R7 R~ZMݵZP)t6g$A9F`/kR5JC/8Y'z2<3yxL9EOݗz ]C'8C {:Ƒ lleqWL"պq-$3:ZibAMBB2 AMQ:@h XJ@.(ND@='_tfj즤q;JL T߃)m*v-9r׳v2ms%IIR-}MBOv&[[ ԂtpQJhh/R lTt@nz뗒UF'4.
oAA dlvvit>)ЧY%P&d
,ґ*lT-Y.[H%bIP[1){Ր ] .E-v3>YȲYSw KI!ʊJ3ʐ{Nk7ҊZB
Xdh 5s#ڣ.. #²5Sm]}GP\zq 秭mrԅҵ b +Pt5.SsF].ʫ-3e&C5ܝNkP螻jIP!C3cYX9 =x_x4u}[?-\gPmhWvI Eh?@AQmʦ<;]5qj
(x۞q&iK_vTw.+d GKJu|?&8In *!
H'L4zZ6MeQhdfeo%AZLbtk1fiRTXA Bg_/6evFdy^T25X2**p
%sM}uuZ])L[p)(.۪@o-)"TsLԭ@BU}rD+!M2[Aw8Sn$(l-77CI]3enGlw
%Ts @B
$fQ$k61,;Մ%Dk:ם- jꀧ'ƻo\:̤k 'զ
ǔuaTDA}#kJ^t"RR)> KSQ :1 G6Q̴7 jBR"f9筿6Pj++xdsPN5'pL 1VmXФI_@~P#EJLthJe)V[ZqP-#eC3D&&\71L'20Uvgt,<U$+]*i|"v1QݺˡRkK#\_5);ҕ+N]7$#7fqRilkYA#[ T.8cn:\to egʹ4 |oEZxrY)hdl8%#ݼ8&k"dhn#ٽ$s2PAHZA 'XZ`WTBI)%)
'[v*\&>ĝ|%QLR/,g<1IsS@rMUս]MNݭ`ƞ@g)hj Rm$&t`|ine_5U m4*tF甃oUv(RA*$AGy_V4mҷ @ԄA6Ij-epNs[d9yw =})J2tYւx/$a&sIs=,ik v](ZҨ3DiWb8ĺ<;F*O%
gUOFÙSK;Q ?5s'RL|[c'u\E;SZfLm'h(.) %: 0<S4kR
'M
anu !on ԶQ`@"d=<B_BAN& O(;[7U&8r f 1:i3CeIXX)ӟ=F6IUҀ | T猱kK;
ISˤZ >E*@YT'AA ;NIA*o6>
oM*Saa AٻʚGY!*mAkH|mqbK( :clrRf P]>ad_pe ](VG *
:O/}4R$ hO +T +]nv,iq҄ӡҔr=u>`r4% {DTmiBBHQ vt:k! 24~kJT% ZP7Ui,stfwDSRcOz@e* Fְ@xeR6X` v2W
ЧcVx+RS?a +.B Z)@lAzL}şк\H>Mu;kftHwyRr;vJgQYe=I'ŬuuE <COP*I OL≍ eӠdNYN]vtK}.h6Gvb,%uq*0,PGI cqMAPLDy5WB%PdǐA6uKL RbxrO; !je{wQ!uJVVtLDZZ@Q$TЧ٧@{ NvmH4ldh<O ̈5hͿRST܂9 6./R˩5(R+ ;Q y,]uZ#AȰqɘQt.HRĤk'xJXXE-+BHC3L {[=Y !+I[)yeī'?d
zYi^jųVR(B?ϮwR]aU-
\ڹPaEą!nj :CîK =uQB]h$|^Ѝy|pD,RA)6Ӊ>%* 1vu]L2kT
&DBy:Ꞽ-RΒ {|_}z1d3HuV^x488BIT0 *RR-ʩhU1K<3jEKRQ*u̦bt ,oyk ˦|QZ̺PW;)F`
m:ZO]udq
`e߮ڊOt]B_wGLa| :YF5/#u*uULIHlƃMWӟFd,R\;ql06X$ N <:T& z +3lyM g* -'3 aTMŃeڪvnEL },]t\-r/%kąu6[J]_x@SS0ifh≔<7X5[RY%cNCACRBr
c"~lL_Եw,?'Tu9[F)j w03tW '6rBtm . ɄO 8uF1-ȔV ?$|mڠeJvd9F>_;].P@`ϕeC Y{K]>Xژ.#_9vVʐ,AIH< 槛KNRA@\{Wpg(.TR"#I:
Llt֢ S ;X%wl/h<|w:F7HKkh:(I *Tud!S0wZ>݉QTt`me^}9HgVw)uFC F0Uwbu4OKm&| G8Sl%*t֟|%'(0<[
Pip7̊ |@y(ک.hAI1'[D0UT?kQ]ET:də _Mk{vC9:2p5v*MY2;bm8k]Bڛt Ʌ)#Bcˮ jnn(=) W2<_KlDzR*s$
ؑ妶cXl-B>=иZm+.S2*"<voV
&еFfFaÝ:ҩF an|rv@Stjq'1Lzk,.( ^D(. Q2|E!$Y F>rF3) F"y˟HT s/vY x`khkc wWݲ8 wKU#PZt?jflQ꼐 e
ς ֞p:2Es(#$
ڥ>!iKr`
<ϗ+Oc O|W_rp/[崶$ ̭4"b, \jFG'!="z'
}y+띉rFsݎu82S זn3 })iiX:r @ vRSF</KjKL([>]tT;6I*rJ[eAJA;sQpЦc|1h} jF÷:aDZ(CG*ԅ< $3yͤ2lDR6/\E\àaa+a% DJ
1`u#F-Q[Szf )]ۘx`.^tLfI628L ѵϓ*n6;gbgn7NIuy~.MOs]6XBP!0 h> uw2[)@Ƅ5sbDsjRh[QSbA ~#!k=6S81Ve{)(6
A9DR~mM4[K *BmxZṳ fvuʔ%FH#1L ]ufεݩLZKhRbRv6>wD tHip0fҞsexoFyG8?ZVIH$$BAۯ0BiZ Z2γ?ӊ[J9i +aCZ {lf'闕( 3lE<;jAmIB t#m#0]tNh:g M(I1B2#a? )i(^&>.KSu R=R O^Z~H:;s)2Ӟ7MT ]J3,+p69Fik[iq戒KB !Pr3'Uej=9dBlNX%: 諾*IZD5/]BD+ChJQ@5V@2&9smsJ@oi^m!$e$
YA
["qR!*Y>j>Vp}(VH S>cfTeeCC<hA|?K|ï 5 \DKrQ" %en@cyy=1 zv+ё:i:9p 2oOoJ&yþa&\,ems/N{g:4&u/3|yV ڪ7qFzuSedљ D! 6oqAuP{HYaTV3 Ā:ck/N}-@ Tl 4O; B )1xƱ z3IJVVـ%J9r#s"]SFjD=d|1GDH|\ g i5
Vj:;(KQ,|q-3wc)^
ZFrL: L6˦r0Z;ZX .O&<siiPn BTv8:q<2]xEe4g 9TAQFVvY[ fkVB:I@N\%е!QPPTNVXͶ{^<~g(r
9K # -\
uח-)(ZPIuʂFhl q#ZR<-5}[! 2>61Xo H$@0'1>P[|8=;}ބ"Rt|$;O;.-^Gy=y0>n ҽz_URp%;:Nw {:֗8FZ.̱@PuN_poa :B*Ng:S&ٜy'pTDt|7ZB >@p%ı *æ?ǀ)[4Ӗ=*V[ H2实QgW'+!c*j `d8SKCo&y
9[KaU Gj)iPt uq'C^^h3;SuE-T=ݗ
RPz4i8?1u/wCI!)1P平[QCWpydxR,ELjN;UmZˮؔ;fu*뻶M+m
Fm
$⥪HJ
#AqV5zޚUE"V=GO) <<d⊕dVLO]3R3]煴$KF?WB{PHq\֭ԄG
Н 婴y!J. .UqsR^\h-$ 6<_ē+9vwmTe;^53aE0 *G#n\ka!0VL}-;EAOyQAҐ<Ã2U: -6K4mM/ǏE[COU 6 8w ø;&tLFhʲKMɁT
Dm>5ݕx}q>M u,6hQ#T@M%v
%Dj bb-c3DZ] a`dCk Lc1Yӭ
sO
5Ry #"TO { 7I\akqIJ`~F5AR@Nt ]&-}UN+j';3!@Jgم|X;+FCξ@T(fNi P<:o6n҆ X,KfFÐNQ>/Q][^` _<:VD4h:Omם j,3_lUҁu;7*Yq*) J:yk=Shu[W
R_[
*̞GS=tmxUkqi.HSHʗ@r ܟ悤)[Ȫu?l\Rd&gH+H$oXcl6ȼ#]GJRJI:A1en*۬~a8BU籲b9^<ŕSO|o yi+|wv u7iZS ۯ[=H_ tuEM S+EPB@*P^v߉?jAMLx9% % SSl>NĺIR4%[F //d5?˟|G8 $aY #)Qcc&UMD#)2t܍`0~hU3.ԩ@-+J6tr<Nk#a˱24L8JJ%G__a% wJ|Ko^:m:%jP4Ԧvn oI{};N)
=}>C
5ׯNzZI IjIď.z54tUڗCiy
c@u %8Mo -lе!
`lq;']ʳx »ZwKm q Jd
h V|=7vv BBJ _{=pNa%Ow"eJs~$}u%Oz bfʚng6q5 ,^q2#X뢺Jk*S3+GዖHJT͘om)M R
qw9hdMBʚ
C-hmyT |;i <c2pDNsZV69U^ˤ'0( Q|;8VDdNU$$6ԕJJH%) jg#K]=LDA+09UaL epf%*"@p#iVR2βcKC`v! #qIk676)ͥ!C_Dq {g.=;N.(z?f7 HNa"'٫2W)h $<Y@<a i P;,Y^ۘ2%2<ӭnKmJSϘ>bUu:}O4wJ`,TD)H I#nQ #gCF\k;$*&#o,Wd'8Nqop u%AhFG筗4l紃 h'7U[[ié̤Z ^V J$F~Ve;( u ]-+Dõ :I;U,xSdEU-M\SNmBI#}&#[Mp?<eN ˉuĄ5q_h} @0dI3
Wq_:R"`)"v ;/aOI$ʜNQy~P/aYwl?L
%$ i#ܪRh#mi<}!8B<&w= 9g.̂Az0&a,'ssq2ת!+Jj q($g7l}ǺR@4#CS<o]{KE%kP BG-cMIʺЇZd%0"w>(M
R?6p)EQd
zX,DB'P2>g.Lch a
6@:[dd *$^x 2=Y֗Au抪5T<K9JD7n꺤\4y+:+y+"N KwB2V%7cKIȩ)(&v
3o:s鵼wK ǿ 6ï.BtvTUwafP27S٫T1AKNTA{ ǭ x8w]q28s@>=51;n|
@Ӊ~u [! 7H:ův l<y@WCD˓/χۘB캻N bRJ.(J@WȐ@1m5i.
(_aDehAHH l?W.3q*t3XD9'Fɼh*Yxi mR\}[% y$IȶuWౕj])![oFE;IRQ .3\j'].P(p?\
8-Z+ t9.=#\ g8apȣa Zu:( Ôk\4*&?/SOK*{/1U⊵BaW;Izغ({=/E=#^Ηy y F*fCBgQ6
dfanMyOn3CjVbj w=zY ̰% īB9=v We;~z+-Al(*.
oeUJq02mxn('f"YihuN*GNV^wڔƙrTOKGݞw3xjJe vqtTկ-hl _;[u^(GB|̓]FS&.&:g}jVP FRUNۅD yJFU7 |Dž4[u3LL뎇eIy^彑L]P
`hR z IL*\Amt,fΩD9M!^ۋ+p
}qg騒jQt, )Hoƈ$"U[UsXugu TĪ3 j>ˈ)xJ:Coē3]{IRqdSlCDjLrP$Hy>?{ {Qhҏ)'Xf
}RrBR$urMsFS!=jnޜUy >B4O 0ÐdAu״O4 R&cA6;vi[ely,89Gxrƻ|X&R*U$Hi|LK ×{iئc2%P@ ;ۨ w\}hNMiK8n~ ǞMy[ࢡl =Oؾ/-Cu7P-Ӹ@b
EK$Ci>tgN)\x2! ;RL5M݊o 6
T]vOSzASiRȈlSk/ 7۩4WU2s *q|ԢuRSlV!_-|qd++Oy}6H7/yDƴJ檤)K0/f|?8oUr7Nq7m]JO eb㯄A'I jWZShu$eﱌ4S[L,oA[{ܼ`cF:ʃ8N59YՏ5JQL&!Gi:rڗÏc=v2/JKmKAB2Kd V;˼FJG- rF, GqCS5kDjM
lkUJ۪m*dI?ռT ] n:A"5 VF
2R T3 k# ~K}ʴR=yNKRdKL2;!&
u 6qѲEMB%rAdc'-IP*熐(
gfծH+RP Q"yZv7ĪK B4)*3Yt eqmu JV'qj;_g'F*( U+J(*A1}9}N nK`FTG{ ą;?M/9ޙ_q7u }`%MsJFbONţp}`5if<t!(L T;6dzq)G@9QZS*$ k{uP FY3"U'A`hJcR4sǙiPX
%BrEQX[i)ˬ xSeJ@>!aI[7rJ:Ѕ H[<R
(3?X_RÈ$)hJƟZ3-GRL0c\IZ7 :P!Hb~,]>$/9
ƀG+N{@#Rv ,T J4P))+1
<=i,(7XnJZPR.v̝枞%Bt5[ԏ4u Xmw-?fgHV,dSB^Nc iaWWSܕKJ@ !@J'HۥJ\X0<c2R" ;Ni
Vrt 8ϕm҇;% ?K{3а$d,OO> <RNVr3$ijrdRDbFXvԇۅ Myi)Lp IQ0[%բNJڹRV<ACB'SQm`a!1,gV7} <e vؚ ̭I`BRg^ tw~n:EU}֗U>^.K'
BG;=`kR0o:䩪%COsFRbe:N%(n
ԝ~kjx⇉`u宇Y[RPqF)P M&'i6i6 @O\ N
8EzCGSϔ؞QxFW-ôd<Z)j\UEJԅjFBL _i˪ۺJ|NNxw"Jכ_! ȓ"~[)VJ1OgW`MZkJ O|ΐFZ| u
6*9R 1^/QJ>@پuwP{ZNgo^
qApuQVTiLu ĜJ( IeQWx@-Y|;/~ WỊidMEBr'@:y-Ê&ؠi)qp((顷,fp>4i Z\"54*};IO:XTc7> %GLz~µ8 qujśuߕQR\Vwl)k !\)I~ˆ#5"Lc4y-^7KIr ԬBA lKOC\TU]^Y䞉6,1jOwd:?}=y]%wzT:- ymîMj`5 dS-+ %?40
j19Β>ȝ=]x-MR<QmNJzduoi_ryy$:{ FX Yh߮~sBᣵï '*O-')sP GV'm}F @)҃_ Ȓ5Z
/,xÔGteAA''I($bbGܔ)ixVr4yiz~zRnp ?!i+EOCF;SXkB\ӷ
.R2@V%?µ="u$4t)뱲_T"*S5@Fż:}xuߊZwHI#j mk&NE»)ߘ)n"`6~S; 7Uh^sMB_PUK-Eż??AELZ݅ bbv_ \0.}4{qג#o ]{5HB)K cT#e NCjX"=7:b!ii*6ȍ t<q22 -/ ?>jE|^\m
"w~"dk(FhZ{_t6PB=N
ebKNT<Q6"%yO~U
:NI}x9]#
\Hҹ-'Jjx
|oK7ŏR)hxҤd-5ٛ ͜R]&]]]&GĘ Q4T9N I:mxzJ.Hl4'O;f1J.7w :~^cS2Hvs) O*3q<q i"F-xvOkRp%@nm;Hd@we[8UԹ3krt##q j{ØBEJ H]R@Jm~G8?IYav >zGO80vbE$yfHWrT$Ask=8R*1̘B)Kysɀ/LFx9JVo dv7ڄB@ K=y$&96,W4w 9'ɹpsѡ !fW٩Qu~veT=rTLzYDnH&JIQ< ٝP
%[fmV}Uz ѧ
37vNҠSH) Q量:~?w&$H/R; eYB B諧!N?֗?oWqWqQYa34W7 6i:JU23 g#.kC!k |eת* wIrA bf50tY:**ZRT#m5;+zW&Lڎktw]%B}i
I$d v
ӐNK"i)J RPni;N姥&|]u6 R[<2u #g~m4<R%#Ayׯm|vdp1ڞ44ղL pڎ颧Hq,$zr]w9}^)}$ Iړ\EJL
+ԉ)RBJ@<UK]!4sKniw{R2ߗ|,RdyzYg6R $ɑLnHe'}UC8 7PĔJ@|$0Y*Ԑ3D>;beR)וgL'-}e >gs6@JY!(IקoKmJ*!03B@ ytZ.890])
|npY%Ye
$Lsۮ֦ʽB &|$Lh [e>ҳeVYT v -=t hHiЖHSl%h֊d4B T9bTڒYjFl;_U &PH!˛lAh[. %*HJj`?z
ʒNp %Z}bȐFE\ ̰TN&q7 5U p6>]:zic Ǫ_q6̾\Bա}B\u}}3e">ۥNً*X[RCb:e2@~߳+B$ :!$τ( ·&P ɘ΄sYss
P BYu> 6+rod@1)yY
$Y5B)2S*b3aww-K*N{ۯ ]n,rZma!
6:l){it@TsNghuM%%4n,j`ptʞfmŐS?~#N y 갧p뷪SLVqҶ33Y.RζKMi$kڋ 3n1UCOX qTmC2RdO4q}o$
UR28y̕ dɞkƆ-4Aŵ f> I#d o--+F K^euRhW
;Ś?N`:oi..o aF'-O9*_@.[ꛩC`B DH'o[(|_~'
\
-sWWZ Xh+c\X=RXmaunKh$okb
I&)9<Y- &O!%ˮe;W ]l-7{e/毫x]ԩ *$ TN[ڊwQb ӡ" G7
Aa롛ӊWɣM
Ua{(buZ0w\zSns)ffi(tXgGaĈ]mIa?t(T,-
2)0e'gNb2:gT->E%0}[ -˰ytQJ1#"Puժ)d g`P:X*nvC*-4k1ڶ0ڪí-SX rڑkbw4".UDdzk~`k5㯇\eT6-׆ T5Fw{nuff jrƬTU~k4pq ܳ }^ι}^wx R'AMUDIF7*:m[>K&xx]I=PN4eP$tռ*C:ȟwHוiݹiM^r{$cCm"s{$6©CMJH ڠ@=4yZ-$hz>Awѧ][:MU8@
>{ZbB_LR5j*
Io`oKẲd &r3;ɪ"۫5Ai Πy@tkZeח *Z~]~<V
c"Z) -4ĿzwiniL2}LgM/h8QZh$Nȴ|Pҩ4%Ii!r
ԐuX kNJiשPBR:Y3Ө 9P\O'VjG͙7Ӝ
JMׂXi,)Z
9 Z|:6Պ})Rdr#\-ayȨZD<zz Ĕz0[I敏')Vc~b,yնMkKQxd-|}- xc
Ҕ BA?Qأ,TaRN*A#]X
a Zb7ݽ* @N]7ju:D+`?O25KJ/H$2vuSnL C qj[ך鲶+Sנ}oUbkRRM?>ZDϔX7uTjHmk!|6 ~Zo}ievao/RP*pK tzG+K;vZH*:>^s)k- ([
Pu+/Gc != u㪹jK6aky[U-!AI$r*trrmu*ZIB[L//]AO|7p5R RyM>VĬkOג }[
2I6pm_ꛦJO*[@I<j}-LH L?LNVjM+IiLs$)-ܼv*SOqa[ *g ߆,]K E[֠ωz lw.\wz*} \)}2ǾG~+*[seg %kjUJ*$VSm'@R`Q.2dH""$lخEswue)̬*7I%x]In:q]>_[-t!,tuʕ6
( zm"%3t^5KʉcM ym o7QNIY'_8i&JǬFNy;
S= ih \6k2.|7k8K Tu -(XJ2469}Nv+<)LW~s(@:aAHR&":[W~aRGŝC A$
lF Ih$)dmB
@vRㅶ!CLQ9t閊|'eƖI-)QD@:/+8u]J ( 6FrfvP
cQ?. DQM
ҐuF9T AͶh\RI ;dP(Sjɶs,PUJ\̗
Wh`nv9H*aEzm~tCjTf>xB;аN}4>-
fO9yKS4b$ZZ]DLﯤok^fiP`ufI 4C.b ]&Nؗ
G-ϭ( @ o V)mj#Jt`ÒYa}Fr Bd$ flWZ
W+])($)}WTPRRI :Nc
KI
nc:V#yN` 0B2$F`k
tˊ*QgYjΐP0JV$hu>źt¤ JRv<B)ĥ)_ u>_wjJ{ږP|'Gv]NeN<,F6+NU]&`%>r -)Fm dYRd蔤CʥK<@hFY?O?3j
6D}U` 62o1[|^jꜥCIK)4WD)N55Çm87 (H7۫EUZ"*gnG*n htK(dqX??]~xUk*J!.XV!$m6/Ƣ켨aJqnRQ$hk(;[T]Bj)]l|ɀ
&M]UBjY4XJ[?
I3)Ic]e%KX6N]l 4t3ݚ{z|ga-.-p\9s })qj vjkɉm r0F' {t\+.4S:
p 鐦SN Ts(zͷ4Zfrv?wVuuDUq<
Jdԓ̛1)p7tePҡqŁ t-ْ;\^FZD$wSf3it#
kx \N`M%965W[ZՒ<XR\MZ֯갡4s R x<Z U!ҦBt@@ jvrTJQ> wGR Y"ŏU7wЩŠ2QNFD/ȃ#ץs
N
%FFؼ/5Z^^9hl-%r")}u
eo5"u+,+G{g{quR:e6 r /wa
#\A#
a^ 6Ah
i7e0iNn:,)uBMU;PP
z4=I|ݜ2 ~uJj= Iz!<nkbmHKwyC`o"nNQ1ok+7 vme ;;hz-SRSmݺ/꿏cU$'Z{J(R;YI 鮇^zآPu, D ))" μ,#3"X3nf<h:%U4N f?W{Y9i /֑Wwf#bw] ;ZBuq$($f<- MwmK*li!0#XlKwR ZO ¥3-aӭ4>*7;
2:-_<ai 쥩r(aZu!YI$%Dxa[?7-\*ՐLu؈ʹ*'Dn. aIT^[/П^KDv?FT7>q)ai|6K)W^MgS 3ݖ H#I 750ͥu
eJ@'°uJP-ԗ/UoTPT
³eAuoT ap˭=UܼoX8 3+hGȎGpwIMZ>:`n(`ľYM-HLgBu >v-/h˕oJ(
9t$҃mϯ@a~wm/e\Z2RaMFRyA0s n +;>] mQ7NHY] 't}`> q8wf9A32duLG>>rJgln.>;x bwsi#a, :m5/ێ (}h>]P+ jvUBA}Rgjdw4:J l 1=(JF):FfM]Ve-)%9=:u2H$f9BDƿ5h/56$IoiVi@LZjx @S:LZ֎j<=9Q $ @lS"_T%u4:1 nl
?^]uEmkRӰ}H̛|}2ǫ8;)
I?nyJHn+O
ŗN<ՆQp:Uګ>'dCkZGk 4i_ NrZ4
}mv@ur^WѸJ( $
D3)0 !Ǻ֎<<|xn.e;tXsj<ԧn(>Q\ͮrJ%mi 5\,ÿalOKTo+q7{n$Vew$U{ OUޏ)몝yk\qDJ'ʹ 5rT 23fğ|>$3ݖS SizQ![zն
V
3IG9k,sS%fI En4, UiU_xڀi
@m by[\KES;<FMP̰Ju$Șӝ2+M-G;@; R^s WT&8 Bv FXL96Gd~pۇtT5Je:?,~ HL(f+"KbJ+K4_[IέseNZ 0IOmpD=-̥}M'xpJZBAAFOfTՐD$trd
0ßdT$IdArip$)H ): JY[qhl :m8YH孭ҥ}RP
B?o* @$1zz@D$Hz)i^e$ēzrD4x<V$e()A w>Q-8
36bt*4I $
u*DDyR[)
2DA!gY[ g)+Jʂ$ yZaY@HnT|Q&D>Zm,<R tNv> K+K`J&9Zy?<wlg
! h~'Bh3`B #fmfJsr39겕VG fw]A ¢F][H^QPgR$ o>njV [|c~
బPRf '&eU WxB:u<1M+{O
t Re gXƨNx2R Fh2 <ԧ m!
jEK%HTv
Mg )% g]gf7DAH)rTB!%@ q nQYyB-"Gq&w+sP '1H; C[KP[+B)VgoNQJIPY_?Ը\K]pTf,CAþ8 WԊ|rgg+vC Rka(qԬeC>i#i3q]Z\}* $̃"- ¼LP]5}EJ%t(LiFC Õ0|L̵0?o}uf۱ڐ\S r@Y,#_1hظTTm4E<¿.k: $g'Ϧ^Yp*( ! SKE0-jV,_qO^N;NV=̈PJv m 9'ˏ_=ܗ8u/,NOp\iД*TT 1 +nbzל mFFi1XQ4
/^(P̂DzZ5xe֚q25 e*;1Lֳ@ѿ\lgHwN y[yZIE;DFuGN]-cS*MuAJu$i;2÷s~dT b7"Dr~ vX hJiDןԜelZS.⸪"$2$ =v{%uP)++ 'YvS"Im Bޓ sޯ" }ܨsuMր F}utNi
Rˏ gI$6etrbp4U@Y2d2i
/[email protected][m`1)KT4-0{9ao!eA- $m ZsU-jJlǘ rŋԭT ;J4u*W>1x!c;\5i
r"'d0
T^lS<SHZLlQ8<h#
`,*QPµԢR"FmghÝVothv<
ʆ9Ǽw: 9t\xt/U)JAØN8t8v^(pRp'@@,15c17sOv9( hD f+X+ +֞ +Ij(h Ls$sR
>iۢgsy[a@H+4"u{k;B7E=+ ,'"7V Vat\ jUOvq5UİȆ6_xfxxBZ\L: rV? 6 mDX(i)nmy$bGqkF*Q#+ jL+Ь}2J)d :d_ J 9.*E*Uucu`jVuH%*RŔƕ^!Hh!W!uEt(Dj
U&k<{>[T&AwJ@Tm3 ۘׯ`> H$
4 ko! ighƥjq) qN+2\J
*>)Φu<| 8Jp MMTj &] tHehn!Rp \^ܦeJSIe)tQ_5\r2R n*0LJwh <5 Sπ'se_=xe[{G(3*ک
xX|? ZjJmҐMw#(m3ioh.pz[ Ja RMd蜻]˻MCn;NĄ ˚ICE!;t ^N潞gS4?Fw*b \j}%H*X WTv)@ ofKI jomS;FWkIK!Rnw-)TF6nr24}}:?oZ a =m鐥
Dt+ŔBQxm>SH9SfLrh 62i}]-jMSBN
w'9Zks8 k& :Lӕ^zUlgCu2R,ԫ.Nϔ7QH c*PbC6uPAT
6?{c__87
}u5*qaYN :A=+G|8An n4~/&.<߯$ {ډ)a<e?^.խw#N\bj
(P^|5|&4v iŌq
Jw[@p#U%С o;AҜһ_ ð}IT
x31EEq.=P
t(ܒO.G ofnĉi5
J+* i I -#ÄQe;[xU;iG ۗߊOW{P17U=T|?0%
(g)ELJ\UV[ď+vQtgɚ ;J/KHXqR6$.F*SQ.J%|lc-y[q XI Z$a/bPeJAX(YOImЩ)am<|7<d
#UHCm!|ʚI3 cםrm2-j) ˘;QyTT*IKRiYzm0 S3H;v2DeQ
e X$4
osXW!,
$3#c륺 ni!-*29@jo j ->C+IP>}mxW0v'Gsj {NizpNo ] wQH(r#[H:K2 RY,<#s'BmmsuQْ%Y:-O{5-QF
B'Pgc3 hSw$ghTH
Jy): r;+ M"ck"$/7{g
Mu~-RP<,8Ra:}Id"5}JAZU'i彠[/Xus-V@Rr䍈[1 i$ '(#~~VU;)T
rL&LNDsur)]J \1:+34tI^Kp$39ZI( TP ~ |GVK<)'|-mp:Cɂ Dk%{+ij -Mu"NɃ'MO&h
1%CkR]He>Z 曒V^^iBhVR`IOh<)AF]NFqKi iEhҡrՄVd ,V ocwTTrlI^plYp҆S+eyf
wZs){A4l[p8ӭTR=!@ͺvM$,f6D P!y3 l&AŤ@$_MiHo tH T[9)] R 0>?/
ն*]mT/'Uʔ` zk¥/93 OY@` sNA zZB[Y) Ʀtsj_-;<eubtPZtC %iruu/ -|/)n.fl/_G)SAJ $'?[vQ|vLĆוw|L8a[ G;]O .}#O% p7p_u QLR^gܡB?&ٛp
ӎB|R SNn*I6X9}O'ۺKWs\Ȭ59YxnY^aiUHV*B Gl5 u4 t { raFOӟ2 oĽRexb?\52U#yY ô
4
"$Ahk/ -4I}ԳuR +GUF6oM}Zg!Kk /?[S4L7&mÞ$)]j-"DP7* 6l;w5rPX2dh ) vOHEEZWj
TdjvD{>.z-*%I*BCEPd.zY4H;8<UC卦#]5WlRxP IIibBЏgWv+ ڹk o:z246
ݡ~XT=n* ;f bZ.
QXfA &dkkIQr7 %0yER^uܫH
V'3 N4ˠVYj<{IodU{- >.Jʰ 3 mT*^5ŧM^6K s
m{rOtRŨ %GT&c^SiHuf Vxٗ.9e/<DċaFuBs9QJ :5l5+OT(. ).Y1xIh.ONmPy>"Dk;\xػ䚚n^P!$ˤ;]M:Ys!yU? roTMR* k۳pG_r5&~.*McnLBQp;g ݯ߸ʆ[S]٨{1P Q5Ԟ8_B 7k;F&3m " a#*78
qzZF33%%K.:ksP1'Ar` ^#u$ ꕢfigmIU|8ک"#[U.A IJR$IzXg/^~z:P+p',˕QZ,xn%קx`laUxJ2e2 :m=\C^a_z]ۚg3M6\}Ԁk qcۋ
j
Þ=%AVT%*mspNaz Z MnSI\Q C4Tt_k#KS }s:0xr7v]q;^OE툀̦ʽ v !zGXLbw<<*SUz-qW\u cKȰ̪d'j#\uqCYǛj^U*ZΜ\]y͒sVWeF< y#zRۧAF$?%\T|BԀH ֵK3,楷rHF|Zyeh 9u W @\mU^5N8% OӗIq(
2v-b<BSmjpI) HY2ZOxFO}m oT%44Ӕ A7XۅG+KT - u: #o _VSIXA*5X2WtT Հ@)2\PTmt>h4 F/u
A̧#DŽ%Brj QW- ?u V+AS!Fa5 lme5c\^ M-윔
<JHspXcl6 ߁;l ϟU¢Iq^em G=cA&&?^S5iÔTK[rLA gEA[M@
S(SEu*m# +h~ _WKQHK4@|: _%v- H{[Aq
T{=@ҔKh/,suB-k7} # CΨ!
>& h "d
xmiʛ.'"NT'rI'|'\}~ a1iԱEqR:ARP:xfM-pzbb#{# [#a<G?r5vtWWIn^#B P}螖ŗ%UK>(HzO(u7e]k4AP2
N~r4-ҭm8ڈm_)<#'J+z]dz!eD)c:o빴mq%OgBRO/WX r
X)^e2N^F$<shIoijY eԪgB ؖ!tzK+~N"uo?e. \HCt{ER6\ 0o ]ymQ if=JiR%Q <UU@|vRk{Y;)-4#HGvfp'H1Gj?14YK$Ò$[],S&rhR#[G;JgQ3rH"I%Kvd3Jc(N{[ڟN$ ` VH8t *[ 57H%]RuS},i%`D)Gbti')HZ&77l0 O1q^*J)no m] IgaۤB9=,dP$[&76 K7A`
>[B
RF | **א Ra+u4LJ u HuD6 &aBb?^g!Z^SMV4:٭s̸ɧb m? ~4ekQiVd 2 vZ J V`"ztӞu!k s&|: `)*jcM6Ԅd-qꈤCM'ذ) OJu?{X?v Cc:u)+
@$#K]GW{.M@LF-E2-Cݓ c[E^:h NْFtzrRFTIZu'=T s l
V
Km %zaQ;a [ V@: %ců2Rx$e wߟlWVN!@H =|ե $0rFST xAS| `v>6JXHz2-$ LLJE
Ʀ4#Hr[1
($XsA&8'n{NȄey +Uz= %m
29uMZZe
A j$
E:![JBs8;|1NHPA$'`@X΄
N`뛑- .JI͗s$̏8?$>*OauD?
گ 0q+TZ
PgFhg S_Ҋ ћơIڶ1-W\E="UPARTۨH)Y˂8Ot^m)W'B) Зx 5 .vi_<a7u|bwRtt(M=ZW! <r=I6y%VVSҺaA#?93ozn܊FW,@XgZXTnjU:RmAIlNh-c"{|Vpo);v]7
y)H@dאRزx:ҖZYf'nvz1KMwξA [.XCTqڅ(d2 !b *=m$ɯ18r+ _:Iii\& :jg6;Ecۺ+-PCA :
7Wk^" 5jV a
R;
>)VۉpAӨ z_|3TwSSS4
*g6mORd}@d1g66h2ϟ] N+vM6ZR
vL(slok)S2X9%SH ]_tap8DM~asz0+:q%$)* ƇIؓm2{W YM%@;JSjML^hvPZ^}i ʕ\2fqƊ 74*pe ;NGx cm{ eyCհ ĤmOKkŊĎ;K("ѹDU𪒘4k}ʪ!IYKn( LԒO 1az+1ԣGLcR6#KiNԘcCx+WW2~)!j
,@!GC/ f15H&:I )&>z, {_;_m苫8_a54n8ҷ N-p}u{Ж[aUjof|sڷ
".j7
S4bD$ [n ٘
s"U>KK(8>5g]*]N1g " @2?FvyNxXV." ֤ft Ŷ?g< xૹRVUֽ 'E mR#Np,1Kp'E݄WUtT%/mjqGq#T.] @rٲ?OGݐ^#C]"-R:6 m֯+ک-(%))D1[հðuN:iQyXΩEJ* LlmYUWU^|>L'ath}X
]=MQH
ILh^^vSy.T%9 $-翤·"oZ.J
`|cOh[奄/E^*za;tm숥3s{+}u՜Ψjfmf 1KwbCTB "R$ئJߤZVuwlkDN^>:in䴵8ZJH lwbl<ȏi[:/B5HY^q()
)Q鵩ygj\{Dž4W-]sw-rt$u[x |8?/zkYL쎝
T D? ի[LPդLF/
ғu[RɄ(k:뿔km/sy믢1GWV?{3q8ERi«nw HV4z:κE w#{:^G(|&09kʦZJISj' D-ׁ+iu
+'2Tܠzx\jR7+-lmq3+c1W⪫ƚ }諒D6ujF7L+Xodxk\@`o-:ʃ]mPTR ^{m8m @
][[
2'Y I{
x!8 g]4|zi(Úe B<"hinh-'*|*s]"N \77Uĵi4f%=ԂAw""zr<QT%MroO5*Htyʗ mƻ|9d#[aĶ%2`k ?75$=1v)j%JUCGv <č6<ŷXY9iSLgn<$v^'f[BJuZO! hE[M@5Yl۔];ؒoJ2${0VH"fG sQ5CHR);t4FU%<չ\6_=Z
!JLew
.d=-/P>ޜ|o!.2@MQm^wn-ĝcoq-12Q<O@Nd@[B5ѯ=c AS K^Q1EYkIB
K1ZְzЛTe?̪Kp
#i
$$
LOҌ^@ޱcAc 3*>%؈kQVTtO9e}6V`5̟Pa*y U%Q∀}M+}aɅm,TdyZ}E'ImӯjeZ.%SyjO~Z1 Wfp3UyVāQ=,iN)\ zX/J% -9 1)|-kRJZcdy>DU<XB#.c"CYN]wiqJ^YzƧၦ#pC]oM.vdXFf'}=lAU6T} izkh+ӊ!ye
& {]3R,Az۫֘G 8iˡ {M3mwm 4GЉݔdJc DmN~xt
A%$$(FcY3lK3*d8@&`&5Kpշw^U#julq
$$h$ *K#Q Veք<m ȏ|<ݝDvϯDEvq&%(nf. .dm":4$3j.]֤%@)9mg4.SG,fNW}Pv gLo^AϺA
:GtwêEӉ"JIR
QIHo;G?r0E'PFGğIO{%@_UrwY"P5<{Q5
aҭ%n{ݕ52 f O]sA0\<Ϙ&} n6ʶnb=쫚];j˙KD%D͉Ha]@WyZP!
"0fn瘭}U8"OE %18W$|.uן+h%< =umM-$=ڞKm~+)-AHBsH%g['qSӻ0oV,!ʄ4G9 ]+N8.۶ʛ
-N@O i1OzJT]d-a%;
Βr.4p^Sab[Ea!LQ*⼩hnS RH#hӘ?j wQiM!6 CwԽTYx!ʖ3-, 7R`yOM8D8Ԡv)$
b h` tϮ e*t[a&TGāe (R<(xu#Xz*],=VˣE1 c
mp}'5τB[ D ztS5kNZP %:Ƥk.! XvrT܂'BڨmK$hBHu
H_ˮ .1_U4,w 1 ]bwmxq6mES'K*JYSh' qi@VPyGnyCt4c|pxA}m?-JSJ}uN9l c. D8Fr⦢B[i3=`G;8ê1qRjn|kvRU#VЂJgYmٳs jYm5yҙ!H +AIc ěA1w٣{q E%UC&?;Np*X^ BRB
5jIH3ړ5XK$7F[H*ԓY#[L#wpu5&iSfPBgafx$"r3 knTKn #ɮ+8Xs 8WiM;X"MֳeuSW_ݥJBBSc0[p{a$R*d8I ]]+iM}XQA~Ҹaбfzd%q[2 3j`'w( A #YUzWÕ-4 Lg L%CvչXEFۤdL5kpuFn'-uS^w xJ- u#a\ wC.Rfז ;Am0
T͈ XJVR@<x\G]SzHP6\- WQ 9D˅=Q$(k2MK0Y!CAҴ6TsL1k ]d'RC
<@뭥iۄ0hk $fgZfNH: HX/Y~ nՅH US!HuH@J`Οw}CiNg;Jbtmڼ?7F%!ZQ{i3}b~i]/ Kݿ8%TV_
U3J H ( Xe\_xcTwzRט \ͬw%Z~v+뾐 gp~w~S_7 KU&i *YNvgAch97t\ i=8p4.)}()!GQ@מZuO @%$h ˵ ]K+7QID
) ʉ2 彅Kaԕ$_29tQIN[RY3)- C[9e[8:iPzlAR=@v QER*ү p[-/9EPFᮇӧS& Kwv%^ |[2$?*i -wdd! 4s q.#zk7 k8/ں}Z$]$P~Т
[S{|&fӪ i} [\ mԾ1HfAEMrR
P"w֖nҖ@R$+ rH_'{ 9<4Q gh)H)3Y[Jo㔳t)jGGDT},@J.,2>sl$F1ɴmUڕܝ>-itOЩg.NiqE֔̑yZATucy.[H9J` ngK}/HE;@Z[ :inabڂmd`lfC_Y(h ~_/ӉI 72l7#{QʮB_h7EtdUǁI nymfu
+6ot)Z}n'.o
~J(ZY
V6SIJHTft3G͝enS* +<IC!t[}JAPptMfyt[P M?p㊉$Lΰvtp+A)2| ͫXl
$*ԙXbal6̐gqחgtB]UNP
Fu+%)+pjY
T4:ocƊ @H)~:HiMWFQfk?~V}l> FRÉ
Dνq˒ | FNJX
w-9Vl'Vk. q(!%AD(II'H/F'}BʏvNCOyM#Ʌ6J_C;n.^žAVB4ML l5m'yUh&#n?Ht JJ2HIQ :D|l#k FuG "BB&4 `eNDӟ˥XylT , :5 k0eaHU'}sX\`YF݂'N{pw8up:NDS
7MߣQ%DBd6 w
<K/%`R{9dDw<}QP8c>Jv`X54Sf='m$(i vkrqڑ|J\)S^!HfID4祜.-S_+>&)r$w c m_v '9qwScٚXCt t;Qm^a5X7m3˞;>ހkiWgrŀ7 [[l=8;p^f]UUt먻ݫHOz%i>o:va|7ɿrzBBfZ[7 1o"<*)^ UJ KM&6d.tq{}*:TG| *PD Q:AS F5
n<2:bgly5:R=¾_W<-X 0y:Ȃ tR46{p{|KRĮS.ƃhAL 彚\=8ċ@(^mrBיꁗu,uQ
q80\F%)Udd
$̩V#$ht.?i8\|=u ^WaUV%(I 9 /!kZ-uU\SBu "F
aU[u5ɩClw)%'Q$ykiw7 CazPR4":L D@SH-njNT4<)9B% iRP\<St еϟ*Q<۴sQ^*[c'veO .wq;7j*0[&A"tgihvW+H/Ti*[email protected]\`zאq qq'7pR A]\@LKlUO
X÷M*vjcQU >4 §B =K|
{ oͰơmCi@:r k++i)3u!c R; /; p
<=W K o] l(ӥ1Ӡ([wvhp0/taNָe{6'YoYtblM !Wu3Bu 9f Им<x^hZ-ůrf~[}-<Nss~G߫6n= '[o!ǙAX NBf9bn
S?p)r4hN#3y u :i jA?\~e0zUWTrH=$GY 3=(}MlFd7S gQX (`JfqVd 1lg{o7⇪. ܘ}
Wr[sSP#B 4ԼCq3(~]*Kt*Oי߯\ Ņ/ cU=J{Sjf9xHP}xۭ USD|> 홂[email protected]&O[[<<Gg2%%bH9voKxnuv䶠u0_cL6ioU*$2Q%D <:N؈⦞<|FfF
}Wn(8)R='oK.{C%IH%0O bnن<JuPKO* 6"
}8jtW=6YS ~S0ꈎCl1zwIxAV $FaE0暵($'ŹX@_@ |~1Zf+)*TyLTL1fpHjckej+V&^VʼrA8b nLR
Z lGi`Gق ET8,s+eqx[ [kNPn8 ]+1[S"}*]q$#s3b]#q *
Ķ#OIP )Q< bwUV?Tޏ0^`iGKVf9&uv=@'Vs =`[ &$Z8y7UN $K`UPӬ5Np6u7&G(X**+tI
l~'n_|->7H;zaa~:^# ХGZVtB,2m!Iu:QISF1[xLP8u+eJIZǾ f٦HT.V ڂ#oKu9}x"츽CH!^ȏ BީZD Ӭyih U=Bp0 bNش3l)RuA*ZWr H ǣs*ob߲LB3̘ܐtc7i 1y!JL V=b* @ZO3mKtkXy8'Wxe-NuAc /[yz %Bo\T5 )ŭKiG:X BUSS2tβ Χ6I!Gs3:l#\*. )C1 M-ۉ T@fiJԙ[+8+ @~%:ۈ *B˸YBߤI1a+BUЩ[((f25xd;d*ZZAR_1h˝ ]:~pr""#yE3Ir ؘpU Y3)"'ϭհi]
B'}*f{t;2 J: H6
jhTs@Ы/Q)xLU 6yݏS0AIPQ 'Iqb~v[ K,aiqH
%(*J'AouTKJb $'Q,ƾiԵ儓2@ߜ}- 0$M| lNg2DsZ{ʂH\(eP" 6&t)źTk5Kfx(wju7<1Ri*mEJ H F&JIHXe˭8PPS Nda)De[ȓӔ4.eLDlrU6$dRGuNhl,d fӖ[6vNJ$cilE"Vۚ7!+궑 _D&' kb RiKD{ܾn.AB$ XQtAղB"y
>DsP@"oV S5tAJRa!Cdh rB|6tn.ARΞMQuCn\u$eL>&I7 /VyH9ɾ4sw\@o
&{FnBsM_=zｯ6sL .
6?m
ؾ컉iol-Yg)E T۰B7CbOY7ML^j ccI8ca"
$<vUj%I94eZJ ޗSlS0w_ K>8W ^}֎7(. keݼz|gIfʶ l,3 H
Tek!{tq~<UY7nu>;7#_l g'+ N
@) HRH؏kI,oOziKoRR> Ȍy ]xݏ ?-kyDNgRG A$p&
$L|aw R*7-$ ;[; ,HirO? byd.O q8oALP-%^i`)AAJ
j66-V$x/ /uIķ
Yu ݍM:rL7:TW^ Uwxnjz 廸U R(, $P
JcB;E5h
[^U\x [@;I̧X#Z f^;s<x^ B.ʺaН gV
{JR֫˻)JmL :[cb[glղ6h蝂PNJM~jiAPұh$n'j^CnPy\Z 0K4x)ƐEK_&Iʣ
-N^4|;Q
著[JIsT)*z :i}x w>d;wU0Z2skAlYrÇיlҠIL%=} RJb:4kشGmڣky ŗn*x h`L(4$ -Pc> b by
ԧx"! H:-vtMfIJ3"f<1o ]5emwSi1筩{PreטSqp7o$]8blE{T{
$hkX3;۪ݘ/\wUqSǻ)Z+zJ<y d~xl>Âì"`%` b,~ w 5VkVWb^*̬d5RD1{ m<f`zp!YLP^5{=N`% #C OWuaRS6)M '.=uu"-Is8=F=m
cFU)+"Act7.L-\zೕr'ß[ؽc2躩 s{0MufK 5/ #1 $۔\P3 KkqF,߯<V>I:>@L ".<Z~ YT)$Bt" NʸׄCEQ-ԸB*
TBju=yYOH{SwrӣPa2`^Wn^) a{ҡuU݇$Q:H L-K8hjM# βA?.K8iۮW3
~m
H4:Ye8nvbjq&BjG>ybڊ6SM1k9ߒhGZےvBvqڃ7m?1*^A`IԘ>Qg}[Ap%JodjJV$@laqNtݢ>VdyTv'gp \7\WV$fIΜ|F 8-Em@8i
Wbč?p}U.˥SR֗T B'_)Mf;krI)Z7(QxS ~u ZwUjP+.u y˨|6viԥ&deNYq1At[x8-nڶ͇[Zۈi.)J~V Vx07 ZDSmd-[YlXi:'c>߿xs7ۭzpt>f4;w }R]WU^Ja:,'I2u=e8Z
KSUs^o6Ko%DsNdv6>EW[OQ{]%nR: r5'6 a4>ߐ
j) 1?3h8 bOaǴѺNWQ |['wb7ZOx o `I^}m?L)+)UDoDir=h+tK$+*|DNy YM,Uq 66FRG)x]yƗ^+%
D6<6g 8ΠU^eNfBuG0TT-g^RN2mWu9ީ }Hi=lv@'|O#sWawSc䭡 KnIJJܝ ;cu:H觽 KnH)Fm$iͷG=EIKūʒTv:ĦU=t y{> űf7vў* pd'zvAn: *57I!!J+~M:֥'*H ! y%!o;TL9ˬNA[~E-eD)R}lـi{ qޝmUJӝ uE1x ~eD݉of8;73Rʑ#XuÔ^8>u֠oJfe+ȳ ѝws,ҥRJ4%m}% ?Ŕ} PR yiJZZ
{|bU#B
B[RKzJ{*.HO}zٯ|V`oͩAa9RNHNqn*gRoξ$%N?;5YJ)HMK
Fޛz@&VY[++ % @},Ebބ(kSPAQV32P RJKhRʁ%CA3h{iŗ_K!_zΰsOKAeJ L4+ ZT?_[E^U t(^" dkbn,FT]~͉p
1F$w->$PusY}thq*mT3S=m% ҆H &Vsx( qgNUG>An|\WOsYuR. 6 d[]ZDPH~>/IE rbMT'"ʥE
>QiW*tC8^!I26ס@ * WBr m4Vn .5t1iX^ZR(^
ϻ7v t,
Uܾ/ İ&$4&-AeUAq* FM*W.Q)&Uo6ZeJdvسM @> " Txռ'BwZMl]VHʜ`CU#$6B%3M:O}mUӼ1wU# T*@DJISIFu`l4k/r즺1E ;$/+* 8Ns kh}\U&
}<UO_ oݠkT=OT^nwIxQVw [V
pm%
FY-d@WHctڸhib^Q!] ulWE _{Tq .&Puz< oMEUFZkpa\F@8_73~Z{S~3XÁXQ v6 ҥ Vބ ).3L۞-6#{պM+o'˯ՠ璒i`1c
tCAr"F 'y6"y$+|y駥XE2;|<+=8i/st.Ԟv<z Cĸ&bM/Ӆ<JQ* k1`S'L'DiPoEPA+*9`&rFz O߸#a_8˵
5|Q%nԥkG=t"``oj ;AF3Ri TA+$k
r
i&|{m«ۣ
`+?Eԅ4KZtfY:WHE \RnK&@> A$+wOZlKzp˂m;Q!)(΄i:$S^&hE7U8r.gIv"VP(u9Nkb zuK8 t7UsX7j(bm 5 )\JDQ Y*C*^Ъ)Mz9 ҡԴOx#0NXHkMtۘ ӌ@=qʴPS qeAF W݅m'
uc*CoPw$PPPmE R f6)%UeVK H o'Uo%Ea}%̘ӜS6J~ Ff0\}ոS~wT69 ܭ2ɍ4WjlҴW/7.z'iZ*y-0<0 DMF tk$S04Rt t$k: ^/ALi
[m!=8 GUwX 'e-菆G0L =,8]F ~RAR؛ CZk
N)IU7cg͆ٹiC@
y ʔ'&gSmMӗY}մP `J
| & фh*/R=J
? cN=Ç x3YltrC(I&WQP4'(l^:s0u9
x}~ݧpgf j.cB@9[O5 NvŔϊN=תJ)=*Ѧ%#`:ڵN-ݡ1GxZ**BA=#{H?fNmfJ
@6 58 k'zgnyxK a]unӤ @0A UX i>-ml]LT#+
<Z4m:r Iqj)&:6$tG3 .wa{ijQQ:K,)?KC].o?fiBJR);/x[yi h 8ˏ2Pcaκ}~v1$mds0O2.nq=0]xPΕHPIoj<7J*KmhE[
$TI#7c #mR J@H馣kBcJ 渞m{CF6%0u>n tU h$h6>w-y&)* {Oa[MN )ʣ@ ZP\bu($)%m%%6Y.2=>Kt3yM҄$_+bZt߸4LRN I;sy(;LP~fq`Z-Į
vq7#q FsCoh [}^ fwM7.eL<]xql ^&T&NO|}vRI!Z2{UX -4
9w }ls1Zc.9y [vaX~$: TIǬwnj7iZʅX%j0|mJv[;-{ }uխ2X e ><*ᥠirИƺo}elq4抪ӛE
5Hi}BBT & < >ڣӴ2&C'mI{**p'*dO}kC8PQ[,/|BOY E|]9\ *6*'@r(Du
wK6WJq)QD(PYzۣ ]_f mPinҵ-uIU`%_)T P-Jy>#p Ӷ/UDc$|h}zrZpȑ i˷cC\Zu@R'P
bH7[Cj{W(
3yaj
te;QBMp'(H6y #4[ó o<*:»J K]<8bW(%Zq#OFbtDI ֕Ҩni;!S3>SngN _0 5}Z
C=F7l ĒrYg )k.ʂ& ٢. {JlһBYUAP w
P
l9T<9V"'-!H prtD$z) pTN}uz*KPJN_USh#2TLřTխ$nŪG=nvWwy|%9Td4]m FG;f?k J PLy ESPi>[X"hQ$fߨ+t Nmtsb '{װZgGNY 7$(<߄ˑHHYF#T
O? l5U]u4$xc2r뷟7N.BSL> ҟbl8dulEFrS㚯*7i .-8)%zU;ۡ9TV\tyمe蒠BS:;JiPB> ZAn{lnTn1[=%2HB&gq-fv.p}Imfc6qE銖उ*]}&֟bҬQPsF]qeޮ 9fҚFдB %JТP
Κi?v8Ta $+ @<ΖMpy;
R%3*cm{Af{ d yxVt+ aS8rJ
P2tL F pp{CuSRR hka(oK4{J.)@!. ƧM, cTNuFiW!6X[Ēہ0]&,&@78Kzt5bzۻS֦)y!GTӐcjKJC*ANuDf7O)䢻ZM%rbdnyȣ
4p?1Ae/Nܷ
qU&.څB/j24 TyZ X7F"a4 YKLGXJͤĨ,onZ& ܅ j6|a
W#~p^ƘwRo{ƹc"Ъ5Dmن H os q:y~zFk.7Kw* 6O#OAm Ê|K{}b\?p&w<Ej # #V} L >M^3x h1zZwn糍-낞z=r/Р ~^.0`r˄wM; 2>(~3ߘC=.0Ue3V6P&W C@.8_ {yC@#MtN$ҽp|G]oLdIm$BFu@m]S< Rx 0A V[Q+Ovy h /I~w-t@u+JC燱'*jqykUL<1 )딘(V9/i)qJ^g0T@#=F}lEAQ\uw>G.k-)!]9VPФ č1%d6XǷNV*_^#ŭ[u, X$RfAwLe QOƌm\Iy_uIR .س bf*
uITBs>#ktX a7@մU݂#&c)@NgqFJX}lK uaACM4hNiuq5sc+/i e $C-2Ԥ<D y'r'xUkn{]f4 4T #^ +ii*uCƝ@ y˭QM L 1whZ8^ ˞]BjT[Ԓ@b<(녗</ RrnD"jNcٿ
g& N"ƨ5Elcti uQk`~x}WiMu`My
CG#6ؓk\ k;z-0'
/Ox,s p ߬P75+}C(J@+Rz̝?{qlSӴ~ ]Knlfq̣v8Sz_,GEPiUI1UWdn)B hREg6n^(%}DX~iY( ?3
? PO5xgsPA)k7륭 &ڲJ@) )S_,.Qϝ6+ * qdۗ.vɹ9+eõ+," v>n KDj㩫 +R KRtJ e<nzb7r/S4cHmD uҶGr\NVtި~ƕ$;s DYkޥ 6rC7[HIf#dʙ=IKEDVPTR|j2U\sYESsA%K ^VGeT49tsG gY~h˝b3qBN a
?ń*@BJ_ A+Ԃ|,ay_ paR-$lgO>q`{E.Rɤ2Ily
֠OyUBQЪ?L^!RI )Rع/Gt k9 4vX e bım VOni~%ĒJ+4
{TX\lJ!<Td&@<֮qcTOJ!
x1#`e4o}R4.8JH "?[e~H)(ҦRC9p: :E`8驐A*i K\;yY
D-SV166L*79VXRmq⩼l#ZNӧikܹ@a*
Jk.~YPPdk~Wt:ɞ~.SWqU)py4 A@Z9߅Lb.v{;^8Ae
evoUh^B)rI;7vb˓ ^o>]]k"0 i'"kFq×~
ʈ
ő`G1>Z +KXaKs;RFP4GmAlV+
_PT^H u2 \U4;ŇAKg($#ccm =GP%U7rI~0x)cq#aܫ$Cc>~
j݅xB@: ?;Ej쩿VHtdk'>RdA z<ytrSXpMmjikq 3
'H,^$5Q:g@N|(n}50tQaJ%ֲ9H3 |< qk|[4`/; b%AE%! ƳϞ%P祵8I*u3Im, }͠6P7lTl(] ꫨZ)J@;/~p ,]q!KQ n_WxoUK)sJڲi-%olo!'n)5
2ZeK|&$MJxYe`Ը2"}D -nTkL7g;(dH. -/Gp OS V~jv4BBtJjpm-XT*!ȍ@__^
mREIy k #$
}5lSjCKR' 15]HN+UU#!bGSڍ> V1S}4;:nO)R&(fhmjrHH..\<I<j[^y.p3JK>ꐩ} XRm*FQ5+W\!JܻY$% ee(Ȁ kKquIvXC9s hz>-BnD&D;h7{r yyڅP)˨PwS' % `] U)OtZ.mweq_rW)r=Zu)"N&[爎]5A[!,6My P
jyIuB$M?}鄂ojFSgHmY%o j.\/AK^Đ{aeljQl ooӋWCsNl҇=+ZRi#ՇqUkEe$R5Y5Zw8 B Z T%H}X\VOxoCEm]t' EVS}ލ7־b y:k*s$ZMm
mo='Y
A"ɥ?7 U bgdCz&
jvlL U}IMU{ԥZHBBXe`$* ڈ!oi:믢w>؟~<(p=TÕJaxbxW6]P#"U͕l: .ݜ n.oT^ u+lȀ7ckQ\|7
o$)gq!DIH
3G U
vw WUwsQ=D ̐
zوx8nHj'ap38zXೇj:*L)zцo_haI+ԐeIȨ;kYv]҃Nұ sNזZ6 jR̪ EwYRaƕ6n|:hZoׅ
)Χ3O Bw?3Ա:WZ*7/+MY NׅJA
[A>y[_. 8W{T;[S̐mR*o*IPFIڑsPMMZ6eB Ww#AJp V=WULJ\mVNmBR#<(+&*Ku N3 pB%<HUwPǒE8PP. Ƈ(F ǝo\-|&rjie*')h9^#p pB-.-;P,$# ȶtŝn`{ ▯ZSuwR 0A'x[9)! qAǞɥA? K-5`q`Mî'MWxUURT'Hl xrjV5}*0-D;a=v_؎mVZRH:l-Ѿ v]0]i/ ^/@p$F
A+aҒZ/'M5x%̬ns`5'{s[}yM~7}5- nP V3hcbMě~
wr
E r!U
N #6 9Wl ~ԬPi32[_ /<votsL(C(ZeVsfQZUf0?]O^~v(<eīs@T~_ӉXrh*Y*y]
RQ$ӟ[]Zm*CbI" 2 }mNp?.BPo)* &ALHs7j*ESU:R :ϯHr1L{7Ñs:6PBЈ>+XwkppNu i^VdBI2jN߯KXcJTIZj41UVqk 䓘 Q @:V1ktRk}qJX !qЈ~v'jy=ڥ* IA Qh,B nB7MP"3q?[H7{
r<W uSk]
Rbc zbJhMȞ<ū
F2HajHY
` IVi? UHVZQ$B@jEwR, (u 3o
aPY$y(B%COT%H'*R
A y M nxTĥ}6~ODjw3`JIO֛- e)Vg;ݶo2%:[yH6%@) Si bu;{R~2
pB+]L8RUT mE!GqY7R "ӽ2fA 59Z ,)@A$$6H\BN_=A:^.i|NAER@ uGC.2SS<m~?[êamvF :uNԹ@ n| wq&T % ՠC.].Վw R|9 `6k{ߎu-jyE¢$Ϥ0<N撥l+F7ruGX&Ox-" ǔ,3)g S0RI$Rt TܭR*-eHORkqaUczgRM%̢'Nyh)F"yXΑ L o҂zUgh6o wOjݍSRRY&TӬ7[o~؍w&SEVJ')m]?<#wM7s@gԎ[fBB JyK#bnz8k +?[ 躛*eј ytӜ[BE(.̚dNP O'"R{B^ s$';MuIHbT塓`>+ <Qۖ xSd+mwĥ%R yYc|(lF0
ecAU*-
sV ^B;IfN&?#VNU _yRA6#rOXɵLT5qzfCұ:2FglH*m̟J
3 $IukeUEP
LH̬7ѴWmV$RKBt וn)A 93k'}eP\!#oSRJGJx}Weuol<Bƻ T#1ea:42BJD@^ N_+ruLlj@ܸTU>%Q'XM\s4NUT+!Hllƚ$UFWX(lhaThP"R'% E
^ pVQ@͢BFhГwZ]2@BSgo
pAIMOf8 FS m7 5xvq*A Z7BuD"6ŪJi$P̧ [XvQ٤ZIDDS=)22r+W։v$k fJ,42 4v)BRe ge[ ו
deaB@%@U>6s%@JŤ [_,`):džiT%$S 4f4ǘ.^tit/8ڂV铹4'pTWyP֙STI聾1uө:v|?{Kd 2BHBW%;6ԛ#/+WRCtn"ds6˙\wK~URnu:J%I 1?;i\9 ԢitrzolgZF^6EJRI$RNSy[isж9q}p mڧbOvTBJ4'b K/>뙵{5CO\娫HQC
j'h msp+q]Kw}ſzW?)AZRUā:!N3&' xN) J2w?!Eajdom),Wۖ=bD\K@tv EYoX tļq!TRr:-I^. Eڨך mc `7VpN Vpt̾JY#@>2̼uCkpw4DCT=Xn[\T-<Zާ&'J s器.t
:h*j*QmIQN`$kl$Aۡ/Ÿ
徱)n f"HL #xbˎ*yNPPsI
PӟMdN m}$_X!p b]OxiװȤ; R4pc:SlnjCmѵ&Ln`3R'[mnN8B/-N:.SФ I 8cLkr`˟b8[U p}7c$.3 :*ylQ,A3, 0?{okC^/ -RUIz=wq6u7}cn?PO0:ͷ1
sζĩkm [؝wCpÄ8eSCj(!4B RgSb/lEF,bIHttFXwѫsum<G`kiɑ
cu+t~ mר@IRKH "݄<>)MNmD%)=<털0^0x7Lݗ]5Rn|ujϕڲ̤LI4 ?dںZ(zԸ5D(t꼣65lsE`<5N:fI ;nt<=~!73R\m B uZ=@ (U{^ uJZRfu:[L*oJWKq-
$RT`b߷ j5.6˙K!2LUt3
<: *F;eFrQ}o TW.-?iҔ@i V8S7fCHq`IA\;r0SqV)T8\D~ R 4 )@-@F#ZV> #o+U1y<M%3 -"L'p"'[ ]q}pdi aZbq a0lO@()-
ynk puіeΨ@
Db{%qq?:禨[GĒ rgc؆HJP2:2
s#EHRL@2?k2+24wk}] {N[-
TʲC[LN%&R+- G *ay]%nw. @;zZpHV
7c_JZ*
C`C#C6~i
i U:sygnV5C{,~K6 W9<VK0ҝy Jrf% O;_uYi!`L#;4 \UkʖRNC5?ߒgUP0T8pT
1v;AP y'B-/.=KWTZr`sQÝx=;U^ʚrr:AJɝlAEvIBOh/[\k.Is(~ 6|@(+^ZI${ĒL;{UR5ߖbGZ]Ĭ ,4kS {
/
ybvRL:!12uZءt hPHx3?@? #vC UeT 1 wSӯ[R-8f)g2 "uHԍM WSTjU'}5gx:zRr[%JNMO3 ֨6 >+V;2 ] ¨[mC,MH(=S`{D]\!m:jP$Dk]ѱp#JQ]RKg4I>=M}EZ]p6J.{.ٿ:4&mN\A}r/XejՔO<j< {w'r u5A.j2,u|GGcU "ք'2Ir,Mۦ/[noN#2*[P?
!.ɝţC~(×%~-ʓXe*iIIN uM`3ߋ $6˕c~V;)`=s8KN([\xe%EB4jM[Y$&p4ar ൫ ly>}- R3 }ӿǔ
!%) 4}lȔ)(R`fd/!O8|i I%;}ś8V'[}9e<OoUO-}"4Q:v bH'k4T[RR䄁~ VtP }㿯O\Kk!))KIp{hT-ڪjE3z9SϦ SuNR-0*\UKLTBNv;
hp-aD5F:V8 ך u u[sMJ\PJK>3fwe:u$# {;;#l} A3Z7 Iu STATxec:H%VsNB D2$f+) lAA_v yqKO3)@-@
\Rv>,ukvg@+A) .A$SD^/%!#4-+Q$93Q|R!EIL-@+Ǯ;JQ8UwwHwAwWu>]c`ܴ_(̵Xm*^4
'^![%$=wmu Mez)RAl$b| ry{\R5zѴ\pTTƖ l!Ж
@=,_GDU)ä
+ NTۍR<~d 0$$dG>V\<D{C>@Q3FuE=xPGmЈ*|GKX 8WejO{xU&Nצ X^ iF #pt1:Dj|hc惇v8Z:×K
葩Hמk!{)+A/OFS⋊7k~r\44K)9>[y+p
]~ kZfB KJqcØɃ+i<gk'g;M:}/)$0z Wbt SwUt!NT$Fӽ ~X:}ʰb>pf⠹(!lH66Lt^ƮUmR:S26
Ool5勰i[t6Zٌ!DgK3ko{fJ}j
[iB6I D&>0 [)۹ٻER]>!+ yklgkB1n%,^ԸfSjL( F| Q]}9S o! Lsdq_
QWyBEHBn@91>a#ʗK s8
g1$˧o6 ers3N 2L[O2ļrw_mFJ]lV^mX+qAXe]Ilns%ʡ w۠/ b+o kR%jJH3-Vhm
&F.GkQ}t`7_|8eOQIqˡB H ꠥAOKFDzn($b|d+ ÷T aE(<P4iO {(sݠÎ鮋U7\ae qGMa
z^XC;@K$B "')6־L=< 닓9 쵎7K\[_k߲xgt[E5wU%t!)+Q]ǝxtpGam'zs{}H)DOQP-pvƼ+_º mjjƉ `<#kIxwp lɮm m ؙ5s'<A A&
3pR <ׯj^5L
TRT}Q#d̥+sTb&ώnwl9_`5K~A= 2@ Hs2u&֧ON<Fcosx|u_Th)R>#jw0.*i]w8{
)Pzii?IHk .;tGɣv w>:pC4mՖQIb|w˦% uB(O i:@_j;i։
NXX ]Bӕ()H$Z66d|M 7v*PlhϔHŷU"j `%̰AǘޝW*(VA'
~fv&nʥ(EJRXZQ C VGZ
p?p \s[/ $& '˧[RVS7~( \=ߵ۵Į5YU
TۙB֡sL N]fJcRyLer/L>v+lw`L%D giS3 #^qKR@3lnSWT* sN4VqYUd"Y .OOMS naNOL]{
#5:y }-c ^ ()"d_7(u
DϮs^ӏ%ʵ (>}tSwi~ ^ C7J`%u6
m.xVª*CR =ЭˮiZ (z}-<\Ma
uc"2
_k;>q ]*VWZPR:#Zmٲؤ+Jal[I}%JVHu x=l)ܦ%m#"]#l痢M{%k`Ӛrםq7i>+c|+MnV vDc}|Xi$|']OTڙEzj!.Ψ6?{>]lTW6 {TVpU$Z58#:DԨ6,מ<5Xw][-CDP 6<fT6?
ӰHƕ5,fA..yz)e)qږPLF$DmkBԾ ^KKJI Ğ_+a檼"3d3}mv8ɯqyZj槧R( ))N1*s\d):Ym<UԔU*AN9 $R~̀ _ƮfZإC7D@
6@@JK9+ J(QVϕghۙNJ7Ux,%-)#y?߇0i=SR%T.HFI[Hշ/*bA(8҈8[S3p%PQRFxqxPGcjD
H)j;#{"2҃MAI)!zfdlR(hD'r4KoZ JI=#YlM L6S$ X̪%jVHH{2SQ v0xVBNQ >Y ys ? ,
(xBcO߭: *9c.i"?_p2N ShB]W=?K{kMe}xcց @A?m)r]u fE:#?_ݡD } 3VUU<G%KܗzXm+qDϞv& MiYp#r,Ֆ|˒N4'1:!Ǟ̍@ yio@,NvZBy [X#%y
^hB jGߒ@<<meԅ- LgAo= fw6Ma ,Y0!Ёiz@R{
;.Ow魆}ˡA[y z EL6r
P}۲TFt]RVZgYKh є[kӲaI]~ȼݼ*t{ICmEٞyT $('N)Xeٸt1@AczTJ9J EBl- I םT
#$9[\HT*lj6JcMu.v8s^U7+o8 YBV HԓOB.@ G#ԇ v5m{6ăy g[HZ+,q 7mm uJ۫$E+Titf\U<r/juu{EUK<FyiǕ^+:/<H;G?ZnpC<&R&o¢&z>j6!lkh9/$sX
b~`{Hq2Ζ(Z)ZHNGy[6Sp<2H]-l)U@&byXǵV4(kԈQ[zdB4sg FXJcJ_|̫[i@ ;%$$r-Q;45k OЬtk͇ θXuSS
{6lZ Zs
lazն}RB RMm_B|Vk/RQ6j *` :|h]IZ(^M_H[4weӺҁkY@?O;h^} Goa,4vB؊kQ f.&
fꨑ>~ q W]}ي rM-d%@.a 4rV bn %Vo AUGOʎ P<T<.@7o nMSb0c >R\|Qsc[r;WH) quޣ^HgQQ,hKQPOu h9&ACYJkND`)4upX ?*\;Y}Rd\̢bQ3Z3
\4 jޮKFBi[- R@j uŽz O/ݩ.㠷.- ;=pK p 5%ʄ*VSQ6$?q"üP/SXZu7[wls?zZ<~qg^I/z|/6 BTұ=mop?Ԏ~ulUx
2eu)7%!IZnQ%՝\F/Fn!9G6/n04 L*EI rfvOk4`^Ý}hC7G JR{ҕȓPU^ v' T&U{6HSG+T6yw >/*[^*}S&<M 9 "|5G./)S>>P 12?s~JR\ZSV#MsB@^Y+At=w"!C) CiS< Vgj+!T*=H1:\s"蒽 [7мVKw2 -2 >lC@PӔa(VZRJL! m|M%cYP
|އMNУ]Fr;KNIBO.S`ak@GPM^&җU%NZ[mKALo#ӟ+[4 ;ҽghu&Y 齪d
{T]%I
$*L {륎. ҩSj
6䁮ҕ(hwU-/g4Do)'Y\x4ah@Te` o=ɏ[]Uӭ9@a|oO^#vHBT J $
zFZZ*)})TV̀ݰ JlNZfmB<ȟb+ie*Fd4^\w*QKz-fQ?Y6.jЪvY$ωz|Tܿ8Xh}KMS E^PJV0~?;:\2Z%! {^૧+o_1B'v.U' R re+ yS?i+Y
7+eD;z~V.Fg t_+04bP4ח[H:V"ɕYXXV)dKel4 9lwOk^)rxtYPHW2S= |BblGuD3(
u:iX 48q!IL-@Hfc͢9E [$ՔQM)psZy,;\\wv
ZRzc`[MCϦ(_HoTR H w6{U<.uFz_mS&;BRgԁiJrzI#ilmysZOyے77_늵>vx)rKs
̞luwd
% %HI F]~V^ܗUZUsǧv"&C%9;?e
#(0_>+Ժ@y$._!o,,bJ@
cI]vչ[hU:g!m$ON`|mWtu
[
(:L ~vVVZ%3*RLyjj.k tE#WD.&Hi+
ʀH O` PQyiZlT!@ J#`@OST^-ָ7 0&Ѻat̾BHܭ#~P5e 3\#VC
$κ}-֫BoBbv*BҬ^ ܜ3Wg
%Bqr)!BF=~ xbx U\QPV zh'a>.p4p>aFK+Z9 ]`& 0 ԁiw=7e7Qx Jesgj yDi*lM! Um|+}eӸ($UNNYYK 2F^t !FV >vUJ%$A9|2j5ƪ%W Ӌ9T`iu.)
#O8#kITSӺjw* - T
2y1ų2;oEЄ:QQ$|)dT&R:A?YB u)LmaW\KZPl:tůcl1%ڬNQ2 h7XcP[vy+} C@m7ڊ7w' eşfXw""$6b) =~r1]~Y t4lVmϰLČ&ۧKHlʄunfI"ѕ9ݡ;sK^[۪ "xZPKi^dxrllV=*Q;{s9 5 ЭdQrVd$96 ۖ{P;>"3 'h= ,'+!N㌗;DIs#: LfY
t$ bm|UK%ΜŊvnS!y4t$zFm#wuCEk "Nf2F i>R0?Zuw -I mJ D -+߲'8M } {Q{x ))sӥ$ Fyr-I.AE9-U;p-[\3Cyn:`̃Gen&#*uh#Y4Z\KqŢ2T)Ra>.㕋>.{iJ EcdΐDs:zv 7ece/VH>\]C}!ZF P+ZIZ yVz{Ow]8IڕwJIqͬn 9k_zw}:NUKI7o^/3zzٙBAʀi 3[de3ɞSanK"֔g*B 6WJMەTRHXsF -_~el8כHH$( +S^* fI) fp:a+8ZWJ}
wjל-@twpM{jj6鮻kf)k
O|:!Ā`v~0 Ӯe|! ͦiڎ1voo
*-gĂ96;5R=WVyL}331ˌ.WvaE1QX`(T-cIrlVq
F[>ΛqCTH @&5q}J=,^teC d,1 Al>_ A}QauߗwU8BxXPRAz[ژ;ZgR=Uuplv:e_]7 a+ MMI*l0JfyMg> a cl+X8I^IJ\KIYRSȉ'x_/wW5u8sw֡3QDNb3xv:GKPU ]:1M+(Zՙ4*"IwK`jiJVSLH7㥍:l4>*YK#!xsw Cmav}SŜiQbwwUjiQH
$DV+:<*#A_^{{3- K
C,j~&lʵª*-xP0|)㤦d7+Z4 <UBA+OnF]]Jx4< $FYTWr2!* {a
%.Sa0'N H-؎Nө*RTKzh(k |,}d<g0Y)|]u S)#0`u˦v! ʋQ [6J\V2-E2NX'fu6[X(A>-cH-^1̸(U\.['Q~|
Um^QJJPf><%Ais!kYt#]6],>]@\*Lh
i9KJ3; qSw 1E-jVb`I q^7EVˁVhtNdڲiSޥ@<L'u|D;8}-g+шX'z]]jk$i6҃mxOT4T R;λYrne3S; Yu OT`m]ś%Ѵ-"uP*)]>mêi_-!Lw]_ R I-#KJ Jd)| ^r!$ t0+aKv֠ %`>fR_)RNEj*
6сwժϯy/[,ڈ?t
%nςoCn6)eT)!!n$jLH,£' I
13bHMo$@@˷] nvm :: ÝtTN6꿿)}xi`Ϻvh/qWxӴf@ m-z[|Ua^wcjeҗȢ ?+r .Hijz+Y*^eyχ1<F m @N6t/P֚a0Le ȓ>v"Z!`<.i4ϙc
ѮT$: 4~o*o%J^4~0{ST- lOvkxqqE:RuB̑aV5n8z%m8&c&'ejH} jRAOie9LyuO`[(9D* 2@<7p] UxLJb
PN ok
B+{V֖J h {͇XV_M3c7%jQ t"6" q lRLaI}$Ɩ9J_EMN?p + R wK nr:hJ=:~b868u2;|~&MgC~d{V-^ԥRn #_1UXmBJʯ+U A)?$'S~PT}Xdc h{;TR+$jtq%(:v nӃJ\)@`G+yyA0O@>V; @;PIY
6Ih)ԩSH6 O ϯh§6 O6&sMjL2@$Γ< XnViĞQbJJQ'}K bڥH˪3qWtƿ* 9'(-0)$x$ ;U|8׆#p>[aJCL$z[
-᧵RG>v3G8l135NttTR9 DeIXsJn:תtE4& {{Jb5a2הF*zr@<U o@o^ @4$o`U<3[(H$n μsW;;𩗘8MHfxB Z|&Q7NgA}MsմxP\&u&f4孢^fR-qf M],S%j*ZRB`iD-Nx]YB\+]yٷkb'T^[E/:R>/?
m<c%*wVP|J< (Tܕ8NAsRbQR}>^U%,,]#AP$FaZ@2w9I+4-TB kK\KCD(\]lRHKAH$*:@j CJs);'O)}
AR| vS `1յFzJzzgiP5I9.eF'wphԞ8+V ;XC
eWe HԒ9Z> =qmR:Kё @ yKt Ḧ́S j /pKu=r P9CHVu`n- ݕqό+-]. B+Tnч6g<彚ƍl9nmn N&=_N
m$x
^צ =U l
[email protected]_wuB0])aEQՆ 8PE+Zk6qo,M 멣s7~cD&H&`iטa@|rLd5yKԘf.nuR D
eh'2Nzs>N1.)]כ9]
AY
Lg-aOyQРJRYsBgCAke 'xf6| n
c ɻucVqkBI"6O?9ۆ-zeQNj*)*ہ49-#k gٟ JRt5DSYQ:H o\1{a*Ǻsq -:'/" y,yo9]G;gB>;|eˁW\P݄Sީ*+'@Vh<cпpʛZE+3Pڲ'YPO/odN ,0.ժX0dd(zY ( S|7LzT(~Uփ$k{Xn~@!"z̓K7ֵEޗĜb +\
4.$J{D(vLNvEog]f%@eP'A<-Ûf]zWVa{yq ||F ./ iD
vsД62 #VӹW0271}>z#};';^ m]r.ZKm`7I"t՝5ߵS
Ԉ|_{+= T꿅Vނ8
\;
O#n{qۂg~3pMsm/]=ۉ"s5vc[s ƎI{f cR+4-7PJ}B5Q!#myo9z^u ӭh+J՛(D68Yx0Kͤ!K) I7>ü n%Ҕ .xdp8UOC(R\mFC #r>VtG@z SD$ )L
{ uֵ@FyǬo vI]E0ZRkLe<>[&Ep^%`G=Fa֜eN3*$&z r[u8>;%$=D̮kN/-m- 9Ddث⻑LVS-qPΛ_+Uw2\IZ$xRtA:XTɽ*AWxsn5)& Ymdd\ BgF#l
ٽKV+kj҆R&bDץ ;غT*W)SRu |YJfX%jQ0socV*0 5#[ ST_Se P쯂u{ !~`c]4_n-i9㚙 好ݕ Lk?ݧiE:BHmzXUT;[M\ 4<8 s.ޏ s 61jZkx<VA* m uWPuäe 'Zӻ:G;*R`Կr^ ujxFqbN<#4u뭃_JCc6yB{TQ @ً}Z5$7k;vxk[t`ECURj)io9BR<N0 ڵPUYFʖ̦tnaKJ%:
m1Yu
ꦭpÌԲ #76؎!]V@{ӟN"3!JJđ"GN [+t^4m&LѨL$ i/)(FVI'6W {'U?yx/ƕ/{ R}vFew#IR"ҋuP8ڵP%e>˙)J6;<#Qkk.I)q@9>F I']i+ SwkfPɐFk7+t؛ZmҔP\Hib164RH{ɶܼT3VJ2$ NjXeh=--qȐO8}i<AX~ _(JJ3 1'{@5lV
rU= #N $ɷ%O@o
?vԠK^B
gq_.r;jc ۚ =rq ] P ZH'* .aui 2'N+PkCꋏ ~Q75yVڀP '?܅-6<R`f'8& JatV$yO-w<E<4whd/nȢiK)RS'hj
Lf}ziP Io3v)!(.JublsPrPh_m{ [5@d?6gW\۩ۀAPqF֭d B$]vT6X:~i=̽]o@JSh,*B܁'u cAf/7)6;C ]XPT} QV;}lTL lwؿ
pmmT&$MPYB
4JTR EC5eDu Ǫ%K~|9EBT ;7
=E%H
tW;DczS&H6ΰu)34~oSlmO cshR@Xmo˹w]}bjk]Ahʇ-~VAcoj)vZltyo|.1"% vRh.;E ~k,RE %Ow1DaN'ĔjS^%ufX*o!Bd'skJU;wu0- hdmOKtڇ `g{vZzXf|36x٭~TJmkk Az3v%ҭ]AGkq FԺ26Xq'"7%̄(%%"fN7/һ6:C J{y7WEp*R
əCl7iO R AVu | T d;pmC{v'g4tPX@))OHN̐t>c[T fH+RDfLFmxc a h -PW
뼸+ ;,nhzݕ QZp%G;\ӭWr2tnGʖ{7"@*|JJ{L{~ݭSCF|j>gO1Ŋ؛4suӖޫV`2s7;Av\Av]MHaf
'mRzͺG^87].w ;r9p[7I
\iZIU-Hm052:[1w/(g*u@>vxDZn=,d6{{(Gj\ - !zrQ ({\5OwZť"2tf U4z-ťJJvߤX]5NS?w8\؟!d Izu X@i@>7e9Q{"st+oJm +UM>xu||Q)u7%M[ҹUwE"zIS~Nômtnʥ-7t;ٜQp4:jx P:"v܌#su.z E]1AT#
jMMRiRiP@
0 p/z<b*"N@Vi!yzĝD LbwQ8s*OQS>2
']zm+[n q.b|gZdw5*A>*Ӹ h?rc qþݗ&zQUw(,$ I N
#(X;qWH
UPҌ -/<zJ[ZO2:5mEVm˞{%;˙a AH9yXI$|
< ]qZCվ!]ij4 |y2
L86*0#8i.Ja\`?sT e. i.@ fկqf&Øb*.)1 :r ]X*ＪBǩV*hFhH%5˝:H6ШDK&tN״\Cf^7+> ,<k vNiRA;`#p),7KX6K㫥II %%Jy:w//vԻ;Gpƥ+x\gU;%%*i ;IqYVj [b:GUBy])q7WŽ fCQCwg X h 3u2u7bǞPu vEêg]W\-Q?$=F5 a0M{)笟' 02TT曋cB一(', N[̒uIA
0:$hNYJ<UWZɉBd0}śъ/b]!iu*9t$>!:2#dK %I)[)SPs"[**
{{* yFZC!to7U6 P 'XD }֝l0T(1"#L3a@1난@T<*mWk҂uuќ3HII$gQA &;TV] $^53/T4[%
D`yeN&|q) #ltZ燙ߺ Gv$uIOXU B`9\$CU-pV=u
W^-QMd9j*A>ZT 4o( MpSR 䌣QbS
zU 鵣.q*߮iHsr"b{I;JS1R%@+Yk ;{PRI#Ryy
!T%,)+O$FRQ*I
ZT $ڥdq&y(ךֶ
U57vj G7+hn<@>*kN+P@j UjikYB( 9ZZq2w)w`*+MI\\7fCYI#cXw?*F QTPPc ;?n|Ctr_k'+T4l1u-n!i>,Kul:oӊg
W<#).p~%߂ Ë.2vWM%n lx Ԩno`[ XѾiy%ĂڂFJV
Q
?W;xN!7c
G65RU AqPKZo}xꨠuIs_W5jdH3RI
=t6ji)T T ?ĸ隫
=SFRV
FY _Mzгq]Ť4\8 9S'ӝMX qLHuejvj%n9B`TU|3)h#aɂI-
j}c?MH5mB![H ĉM߈(uk/Wu#||YS!9I@NOZ6}L" (賂+
$(trIJme\9eLfy .cb tqKszGKXuM$3mm-:[Z]ARNƱpٞ7p32'A`M: ^`JI@7ZZ!)C~V .*jC(d2BNk; 5W*x*~Ihb.ZH"-Y?xWq~.*gա L g1)B-ڶZaH@II;?yYB)\R"|8as:C6 vX_D!BzX҅n bG=,ܬS 4Ȝ@usc.s\y:JVvN 3Ej-uSy:?-nm@q1*QZ3 })i@
r bo0ql@st4#|8.7XͥҲNT|'k]WkHw47McSa6WI*Lc=uJj5qJ- 4eq`eIBc7"<Oߟbɧ R k[X8릺hU+q)͔jI~{nUI -Zf2a]cd[vj۾=Z~_ ӭq|6+=|$4x*u e2ZГUL+Cٮʗ7RA]*`!!#Mqqrik #tTJ9>OajnRPBNnv:L'V(HU zk87uW(o( &nxf =bk P!@ oR 9EgFr`Sl{*[
w奸kk8&m5F{Zץ=NG\ 9J~#X RXRs&GM5ߙE[]RԠ;Njw0ϯY!a_q=|\=\>/-;_N[Opx3m{KzyZZW)<' pGAmwpXs7UMv
4ʁnJe9@ r ]UR
qGA:o8 wP]n?AK[Q(z1
hT.J,k%D>*n7mSj}]VV'@@) 6M
YJ `!"}
(J^E+P|1$HH!9s
ӻꥼqmWN{I( &"R#{2\K}`@ M\BmŅnj
JTNc#mkX?:9v4[
e]:oX.aw*N<Nb[Iګm zy:vcn6`6-Zj9ڢJy .fq'kq!l6
r9 <w~GJMukYZ m@H 6 nY4lԝix]Y7)5
擯/ Rc ~\
Uu%9)%ZZo \ ֖]ɧKo @)Ӿ/ ]< j_XMk+]y.ARC;$"p"Ϯflu)L]xUb˒^#kCha.wNmp. b+_qau>q(CM9ډ;oDjf':Acrz^=o
c *)}UӸ%mv=Ep,
m9uѽ +8tv4ok8V*&y[vJcüHoծ]
uܩC];jmQ: .R(UMUWxl$ReTY9d]8h)71 ;뙪Yw h(1ҹ[^\A˝B8 Zjf]jgN-*m57 h )-th?5JnA % 2@I
Ngi>\Aj.o
ThMbab<;Dc[prRp^(03
#+PL _ 5 ko؆i* XmԜ: BT+QyjaOxQVc Paf)QP3ILʥ$mu2%Բ^#}J׆'u"0G0B_KyrIHG w]h&.{M3iZDkou-=HU*Y^(*g
xbKI}!
>&ѩQ`Tk).F_UUp?^QVڊR gRu~VΝIt9QN¤.6^vUIKuaf /vA:E롥xݶ`
ON_9)0,Ej\$%]ImP>yFzihnawmw0ng~}mTBkܶn!)qrB@mwۑ9ClݸNP9 ĥ&}DB望tbH@$忘W
3I͗of(mn Tg ?=G Nieΐz"df`;iaԌ r EneVLēyyD,|ZDm.sʦ$2Jj-~fꂘ TXd)"c7cmEDB|d6\BZuvZRQ$ m"Uqܛ#j
BNb 3b;RHyu9[Y*PTc}% CHqj
OSh^ej.wԖH ?.]RNW
QlvݔA2;\̩-GY&q+lyPO_Nj!m.zF [rNM] <6Y!+?_afE'0SUSvuCƴ#2k rJoV]raPR$I2C[]vF1U*x5U\(jSc;d#z҅l=KR!ĐBҬO@j} G4> V2qն |_Bo
L_8`禺m "]XHO屰~蕜\* u6u7x j[l9jQLG2WacSA+ ]r?d ?~C.9i)W)}©_],ظڐꖠ IuiMjFRQ;T@ <o {+Z-vf0tnmP4 zlKf=MbhB!D ƿ+2@ꑼm4%D~5;N~ #<a; 먉hCN!S
$hė=HԨ$;u5XMDI^Sf%4uW83<G^< 0>bB҈u>bvmk VTR@Ԟv
TN: J|ʾN͜C)V:XJ-a/Hp}yZI֒ <^tB਼*] ȓNL5H8I?HpQ[!?BET ^S QsUg#Mj. ?>+VU+3 :筂(zB[@RLbC [Xv)K]3&l:Hmb6/vzGZC_A 'eJq$6HVbtԂ#kd5dnQ9M6*-zmHU
/9QIvӄ#* t1}l -S6k:뿦ZJ[ 6ނyI@ƹFU(+\!yd:eW|RL d
?V
*RFkvq@R`RJU!zD
I>vbgG;CQ%%RuuNVeKSrvak RL4nqz G2$ ]ZiBEpRTO8Ly uQ ;]M켦RLk:{Uy<[gN8#@tF>6\K+xL
h5.WKP|&hmZa\7Eƴ8'Uk-kj ͫ.)1Zv<R jzijingqP¦,;Q ~v!O93G@GYΗM6z,Q" ? =4o0~]WEXjuu H$
lPrEi 30|ȝ7ߤ0٣a+,ڧ[T- @9wԈm⭚su]A3 <$4[zBCTg bL9k;Iu,[ɞ11A<ōQ!@Wf+.k *ih*[*Q?ʸ$6dbj]NNPAn
_jLE[y^KM[2Ӂ=G
@^:T]ׅmnvj
@Q1"Ld9Ҵ2w^ PTGS
ڜmJnRD rԟ=9Xj5Bx*<IPķuuFf6 Aŕ/2@0Bt"ߤT *7A: <ūmĈYk]<EׄmudH <657v*ixW^
%Rdp*4DNV*TTw" YG$Bloƫkl(=xwjmYT#+]I!$8T<Wi1-v:aJnapO0 쉅 !RnEiС R@Q:tl؏8M}W
*:\*% :H4>1x|ܕiL<R|E6<ѮNE}9@Uv~f|JqEʒǔw a[,R76^͗eNj2mu]Xy*,8wzj̩]ڊv9]yۯR@{6
#6?7)xGOq/
;ڻk Ku)M<s͵& EI3ass۟-yx+G0SR vaC$>vtޕ"VB jI&-p9K]e
H 'kkvS #|b!QMwqUNNCRrْ= M[']1}pp{M}ө %jALuʧxݽ uOB @8x
Xr ̢6U '"TD
H=t:ur
T9s 6=')[b\b
;\
iJVP\t |)'AojN>
2i.$@#_[
,8{'%iЦT<*V`Иc^+]]x\wCQ(:tGbl Tg/ϧg +98HRFO)[-
=h(j %!11m-,EM((Ru
jmj)q
R` kd|bx:YJu yl + !֟n 7$(E\Kz(
7_JR IIXRgY V-in!J(B ؟Y=eZ< h?j]TsMJ6>KDX rym
\ʴ&$ =[=R[aYPYHFO._W8Z0BA` ``kMڽӶA@}فMyuH aJi9rm'FZp: ''yioCC nR
C.h"}>"V3a1RrT26F*ZC=Ok%ThG(K*2unCe H%nJj@&FDi0 ,lWV̼KMuKK 6`kr0L;bەCj-8.XʰC4!#Uq} J@L:?{vRA Fm3DrG#eʑhmeSBR [j8
g߸)_Wb rīoʍZlM =p)7Tux<O':']?Y ó|e;Hdtu#5ι s6*I*7-ϗAiO1S ZOp=!1uSu -Y)N|7~<Mt9 U -Q%'^[Ol%IAI~y~9"`ę<3Y
ZY>"ot1ܥ&i
G1:>:D 2MIG;Kyϝ/T[C[@[ظlJ7 U0-Nt=-ev4'RzrWϬT$3ضt j+ ,͂'ES Y$mJ
)K` cڋ͉4o7廽I8©Z+rf$ )g6wN:iԥͱo0CsT\UD<mE\ÕU;@W t4oũmO I+YE1?wXoh@w֡Yιɟΰ]
EEBXy)2>[qJ\ScMDypҼJ` y-҄SwAw`eI|+D8AJv݄*
2! iiT}jLwm
] Gyšoq==(!#A GCgW*u iy)V\rir 2Xߧ{;eqq:,d+uB U@ > cO? LB SS8j1"A? u]Fv݊" B
v.$0u }';O υ*GpAｹ-Ǽ8iʚT6#( zg1n˾5S?O=̎t<yĕ )+LH??+ei "Pޯ)&>
,%YSeU1!A2QO!/d*Ni~Qy^vڜ zr @^euU'yJB0 _OSzR2ZX]j{:HWݫ*F9I5SVҤW*m泌-mS yFO;jCuӠSxO+A+JJg@u}IHχO_omb..\8e3S)>'q,f 4J-L-*H$NzwN #{,K31M! u@(eYLO+7f?ܿo+ȥ]irh~-bjK-wm')p"fgS 'k֚ ΕɘE2^͆,q 몗զ7:CYBcm$}|xQ^ H
V#SktRT% ߵVP IPOU 0&鐠< s# Q:%SsIJBqyl-W+؆O a83p6 <ګ`< 1)!'PC ė.v{44ד$
N]|[|$i5ىo aj+ m*nmIRKe25:8={9P_wKه aYi)I g2 -[mJˮ; a#]19;S5xuCM~w fs~1+/x2IL
$n'U$h :m"1%MC|g~H))=QRa*mkӄFy=wU^%Uu}+ѭ`H} n Fag ;Ub Wy7"F
DF% ۍ_t
dkom|EUxpw4';pER!Y³fO)A&@9L4a^Wqwsʼnjgҍ`HD$mysn 8 7J:w** DJE ;IUl~]Suxa;W{)s.HVP wܷD=S5$m0.#b\L-e8UiSHijT+ mXtN _AS.7kbqjT &`N G5SRk)T> Lw<lߕS>q;pqxjsGxĬ)*I+$Qv(= AuL}U2+uk!)#`FJa=[|hCoBu9Yw<y=8 be$-DF zWpUL
Dd=#_MA,(KLL Al-$5 AZkns~SzkOq%ɇ̥NeNF(.}TQ^(Rgm$~;]8C)k]z!$~Z?:* w> xT/5g
O^[5h##)ͧ3KtH Z@ J :i,wLG%h ;OO2%!I*US=m.sZ#hh/R &$rzY*Z|+ T
yw(֔0܇ 8/XA߂C% GG>Vr-܍#Dml[ ~\x%$m2XC%[iA2tk)-0
&dVV xA -DAWם鲇@lbslgPznmh6QR]-[F4}b*ܹ
MfԮ2RN]m?v'"ѝr (ogmCJȲRDNl2*B@Tեx6fS\FoK{BwG]Gv{9zZrnL 4T۪J
=z؞Q)$o0 3(Uv&dESK7tfݢ5u z#m+BHou[W ec!m>(H "GC#en ,okW+>'HM5JِDHAx鯻Y~ "BUkjﵦ'y^\ j4--C_+Qxk;PPХ:Zs ^i -w K1~A$f [\ fH
:_+x~$քm?%ӵ))Gf XWnkery@I Ɵ}m{i+FT4P 1 4{6ڏxNcg㯧K'$FLמaL\IIX$:kk ns Kt*R)q$ u >9V#k3
,%BFzlLJT]M0RT$/c
벙e LUټ^fT 6{FE7 ^z::? BA&Hb }&샅*liORԶY%JTy@;n'Vejzmѽ5Ynil*>)Uӂ*J PS)nt
K`Kk>ޜHΥܴ$$v8WV\VXL$~|-L 8
Z]T'QZ f\^h4az ǟYKTwP)HFdg7M/;xU%))I0}Ɏn0qn`.G7;W{S i5:kbTa7 YH'wvK@XJ`iM⪪RVHLmXGK(kz~+b!Q
nw/ m"rJ8Unꖠdߥ8Eu&
%
)I ?[2$,QGZ˩]3 !o^ĕm)D'c5 n
WT7!)*8{T R2$AK5hH# mMNjˋq-one 8]7Onz/: &-ԻJ7hBMZqw[J[JSVSAI> ĀVc@AJL /tYPVZ \S! "&rk:$1@ܿ3]y.i<
qŀiAF8w}YxW 0 'O{ZW(:}ks_JJV0Q0[r&ӴMVq$*0rα *<gux鵥UR'JrQ4 tx~wIM=={ZrTiq7vE]@%'F!24~VȔ 4).ֺ$-Q$A*T T+M-7 hm/w`,ؓw?2Wʯ*x[mD@頏nvqUK)iH|?˞nԦ:#"5INE|֮_5+q o F\-"J\7}߮>6B T [ SJuݣ&WrĐ@<W;>5uAu@Ncƚ6[N\&hV&Hn=ju܊k+_HsQLju;m((f*PCͭ6JOc;p&RP9 'o:]umn O?j#Eip
j Xn3w0[9|2'+ֻ
S4omW-UBr)>8)9r:*wۮVZH iD裤ztACzxB˕SbLNۯ
-8&8 j0<\mYr_ o*(* ycP 3vVwF;O]5iHUS:BP0m-)؟p_fQB^kjL!= ʹ9U%Ƙ5 Ji?Ak
~=mnA rˇUd~'Om1r }wqŴԊUC RPDg]vOLm_o Z/fϵ2ҕ,:PHH>B-n=]7} lݭf M|$<bR ) LaBms7QRIqj!$5Hs\Iӆ%1\pȯWXJ.:Ĩ,;2bRL t7Ud2lFBc&7Y[HgYM߭]Uj䧽L+#b hFf)V5Ρ(%':f;zkEꤺQJBVp0O1"Nj5Bj"u
uj.`u4*H mk%:6 @뎂XʒV%@!'4|-z^r騿+j-4<Duym;
S2VP| e}% xhi
+UM AS N EGQl'[zʨ0l:
yc+ϴ [i[R ;u (΄O.{p
-sY qANU3;iY0: ͋~iיQsW?w_ 0ˀ[9?ť)^uR1-fO]ҙ<=W<d'9(+%GQlwr54lJTO-(=c u%>㕜 !',-YxNSe T~)*)G+AT\E! >ZN(eJDƓٓ
ꈑ:AZ:. Rhʵoo-I%#Sn@ im,P*ii4ꃕiE45Ke D;6ko#Duߥ(í B9@Zv)BSs$$5Qi3q,w
N w:-HJe'hdyS6FPeQ66+)Av0S$k b;DZ$:X RFm}}Cjc4x vfWSLhIG LN#A
<+GP@&"u Z R¹uXo (TLEt4@$ ) WP<?BA 2{Q] źpwsnU8Vn(F`ɔ8<( ZhO0@,whW@Ds/{|;{]4tldgX筙Vq\N.!HJҨʝ@mok~<JT:$5k`<SVԯШhL
jkPT=knBRRQ
po +_8m{PAt*]bwןʋ}.:"!g¤GmjkJ!Ɓ`}v,2Ĥu/.p.2M=t jѶ&I"V'#/Е& Dg/q]-eWULC
rHH~6߽SOu]Xzʥqa:0]ԑ8
\͙쨊66 |br@uc*T$;O]mlq5p
9|@ a&RR╦ev.ɷkl$klZJЋ8w~ѿYG/hSS~մ+ <3\x^JyeB^!磊1V5U>ӊ9
cQ1 ŧڪ ?Nh2kcvB-Sh Dcia 1Ȑu<?Ma˕WKT:3 7|x VU&v+cZԓsN)Hm$+2Du76+r7=I6 MuaHduBT H徖q++
xBD.sֽx!S#~N0yA5c[EH-ru<`!A@
7~\qJK%
n*Bę0<^q'ݩJi R (9 ko.^mҴ@!"NC>A4r*ҵPL(&L:zD*O|^D$絰8ya5uXgZVV9=Nm-F.euUՑAD|tbE]bcŠUƿ"/%m2 i`3
q $LOkq5{Rp b fu\Ei.ȫJhR|f
0O=N+E;i\I3 lMjbt:+wHV4PtnmN#a<Rԃ
(m{z=UO+Q-ieq$miY:NڗeqS>bWBgB ,R's}`^uWC0K :㮶TMX)P
㡵 d yZ뱆
휎ħCIɗI'jn5crON4m$HF=o41v4Μt-T(VVݕL9sumTˤMD<IBLM St/Q$Fv˩55IRe֕!&3iثU\W[%8 2zΛ
s<0uw7
gxj #]:y\fݻ8*()ꩳ$-BT|S+ :c5\)0~24 LkHkCt Lr'=a[5^JJIZ'q5*4&SfgHMޚMV<⩖Q!.eRv9GNѼ&
#U
] W6)B]L +_np@#]R<6 3'gJ[b@eԜ*3PJu+r\ץ 6E@϶ѶӲ :
O((ue:W75hoDԂYs('Üe`s zbnϼrk TQ߷=BSVJH|MHa'<[-
ԩ2xzj/ePIWO% Djv$xsqw]vޔWABZJ^BU jXBXKEzV.t,)),G d= ¸۫÷㘉s<% JlHkLe=UN=":⩎|Q|o7qẻ 5N{ J"OFf 5R[ B G9F-v6\;WÉuL4)9J%H)1=AC^_~uĄ%Ĉ tn+t_~ +Υ խ$m$܇
R;wyξ5s"6_JۨhXqTF<-!ko+;7t)}%*0#a 0kM{ jW7qNA2$NY8c7!Ĕ)TYeF뵳qq0ʡdBHt zX#Tjq2oE4E6Є<;I'̝Onfc)>nmtÉݤ/p VP]MK)u
S {)Sa'}ߍ wRI 2 kkpca4OE͘bt"m`]w5&
)Me58P@iN>$aOaQVᥚ< Nn
&n)B[ %
y ^b+((P@4뭢)f%)Ve*lG!-%wT'2DA)H]n m+%*@)Lflmy >#]4ƙT2I@*
"UTj'BRu~,q):\ac\左tt`NY7|e HFrD@}~6sLd3@>tU rE%&$j58Ҟ
+0'4
6 v$ kP;ed&|Jd2[lI Fo!T;+XM:ik)ʧBPRu;O4CL' zZ<B/)gA˝ڒS4ɍ,=H2#+2`맥zHGI7
]PnPs6*
Az90ml#v@|=%+;[*PD
Z5UǡV[. & H@ fa V0 { N,
bwU%iNx@ :it i$&=rHЀ$}GByepL fm M-{\)%Vuʁ >G.zJ/ 'U(rzԀOe'8]h66 Ggb4Q&J/*BJ/I =+CNDx}> s^BT 뭡/J [$*o1wI+/Ւ=]}46jjMg@4cU*rh $DϞk`ӃQ 8R)0v?{K^
*J ! S }L
XL l2 ×Y33e@
/QECst4Ҝ_w\m«} Pܿߎv*2
RPT[ v@ Up+pd]AH ?Ks\ b|Q5tF4tgڃiGS ٵhw9yۘv+v8UzUέ#!2`Dt;XcRNg**)m|R5٩w QPVAIN L;ozNg3$M~gX}8RPA2F6:okp^wjo+ʜ:N nm
\nb[) !@ƿ<w߃.%x#1'H:8A,vJ Ye}PaZ7! ldL|ڬ:!K
9JD:
gA:Sδ y:G[4VWj!DtO2~yZP je
uX|JP:3 67U.kFL( /h xWPݴP{)'ü@fa\ 5`rӖ IAK(s$ߍ+u֪rIHPLs4ZʦzcRjgYxU}jRJU1 6!]*R+-fv qд9 *ZjFL3m`RdɏBzmk2kvݩZWjm*CxJw{}j%B$jDd-evtxuM`lyD
v1ɘ;ȥ;.pT`¹P^J$MۼM. DNeGTAp` ț 7Z[ 'xETL+)F;:摽eiZmk̬:(1xp 剘[)vjiEV O/+j.Qu P}++ nkUi>R8 J$ {fX a T]MC N:}̂GO}2@Y ĉO /Gsi IP-opؼMsn/{y%
+={]=Be@1;F5rEEmۮ+@ I
$nm-j?x?^pog,$*whKEuxuYhDDhAdi}m%0 pRX= X;_IR@ ;IQRTbd.IP^̟ګcU.=?Np Y@tf#m&gKLᖮfYG! P`ǖZ캯 F0E./qMy Q[4HLy2a9łu-,i9 @ lA'Pm vT ݴHVdD{!xmvI/>\㗐HKJ2*tVxל;ۯ s,-Gp^ n K .9Iӭ\8ɋ8)YnjG~tQ 6pB了8w$U3!C`iP踎V>8(/تamYKe6ޟvy<ߒcX h8"VTZUL<锏+vظqsq
Ԗ'0Kmrf, jQ{v pc}pm v)4!pU*1>v>GX_qOyv:m֞vR}juT\4s E 8` Oy Q{=BuB|%ifAg.$7N 3St)DT
VC
I'N⻣}
w{ ַ٥Vd`gCe'C"NY>q%ыъGQT뭢XYJ$)(9O,-,7抒?S֨n//$L/vӿ}NdQ- yOb&-)*q! /9IБt: T<po륁wrWӆ*RT9s;FoW}W8KT.m5-Z56|ښ _ס^"p *0*IE}EEm-&I;OH#xMºRA-r 4mÎe*3d+)BH]x ^G2g%
:ۛc8%:.a1D]SxC]
]J\Zb }h)BL'Al9Y Q[w
ϕCm% 嬍~6K4~gd1,yJ!EtH}Yji so-Z=44WH"B:K+}!ED QeR3jAH.hRvY6\+m0bYYW{tIo֨Սh="д!
4Qoe:SO
,ڋyYQOFj$[[u-3 {_Z[ ! qI Hf&i*B1B:}4Rl X@KDePT:(CcB@Y6( o[eBTe@3pB U,]I@PQgc [%? Q-#a?K/ Ϩ_! qgKL=LA" 'alUD@-[&?1OJW =-Te igt[JIJd"v;O#*"bÖMsC6
~ t ^ &I Zvqŵ*ƀ}ZdۄSqIx!n ?bw5[;($BwRP%E^(Q:N>6,ur2)J g,\dub:}pXCy:X(
7Xq)m*s
O^[uu%aJ$ ٜNB3T:@ O3< Ե A)EJ"O۠tR#]ڊNX"_z ]5WJ%hX<lT}ky{\U:B9mFm ƙ.5a'C q_AVԩQ
L:mb 9|=UVШFHdͩ mgScYl5 XUL"H!GPvl{ [tcנI ;> o-58{[*HY Nkl#Sؔ s ޔNBF#H?
Un}-KLhZV %I:$DL͈h0%-:!DRӯM[Nۭ!l8\Zs6 D =뎦P(ȒRֿoi
) r+q%R
Q)T ە>ik̕:x_gP
"G?o OV%ЄbA p|ﵽwo=%IWhЌOX;m1vz,j sKS~>;R9HTD
zo8fw6eWu%?OO?h
jJRZM =|ͯƩ( er%#Y . #1uIrk$!)KZ2 fTy
xU JyiV# qωmuwJA^:-G.5r\%N(d#ĠϊyQx?T\^BaܲA} <SfMIw>][Ғt2tuxkh4@BҠ9 xkZ
ۭT/D:R|C}m*ʡG *
WVL | -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| -1 |
||
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Find Volumes of Various Shapes.
Wikipedia reference: https://en.wikipedia.org/wiki/Volume
"""
from __future__ import annotations
from math import pi, pow
def vol_cube(side_length: int | float) -> float:
"""
Calculate the Volume of a Cube.
>>> vol_cube(1)
1.0
>>> vol_cube(3)
27.0
"""
return pow(side_length, 3)
def vol_spherical_cap(height: float, radius: float) -> float:
"""
Calculate the Volume of the spherical cap.
:return 1/3 pi * height ^ 2 * (3 * radius - height)
>>> vol_spherical_cap(1, 2)
5.235987755982988
"""
return 1 / 3 * pi * pow(height, 2) * (3 * radius - height)
def vol_spheres_intersect(
radius_1: float, radius_2: float, centers_distance: float
) -> float:
"""
Calculate the volume of the intersection of two spheres.
The intersection is composed by two spherical caps and therefore its volume is the
sum of the volumes of the spherical caps. First it calculates the heights (h1, h2)
of the the spherical caps, then the two volumes and it returns the sum.
The height formulas are
h1 = (radius_1 - radius_2 + centers_distance)
* (radius_1 + radius_2 - centers_distance)
/ (2 * centers_distance)
h2 = (radius_2 - radius_1 + centers_distance)
* (radius_2 + radius_1 - centers_distance)
/ (2 * centers_distance)
if centers_distance is 0 then it returns the volume of the smallers sphere
:return vol_spherical_cap(h1, radius_2) + vol_spherical_cap(h2, radius_1)
>>> vol_spheres_intersect(2, 2, 1)
21.205750411731103
"""
if centers_distance == 0:
return vol_sphere(min(radius_1, radius_2))
h1 = (
(radius_1 - radius_2 + centers_distance)
* (radius_1 + radius_2 - centers_distance)
/ (2 * centers_distance)
)
h2 = (
(radius_2 - radius_1 + centers_distance)
* (radius_2 + radius_1 - centers_distance)
/ (2 * centers_distance)
)
return vol_spherical_cap(h1, radius_2) + vol_spherical_cap(h2, radius_1)
def vol_cuboid(width: float, height: float, length: float) -> float:
"""
Calculate the Volume of a Cuboid.
:return multiple of width, length and height
>>> vol_cuboid(1, 1, 1)
1.0
>>> vol_cuboid(1, 2, 3)
6.0
"""
return float(width * height * length)
def vol_cone(area_of_base: float, height: float) -> float:
"""
Calculate the Volume of a Cone.
Wikipedia reference: https://en.wikipedia.org/wiki/Cone
:return (1/3) * area_of_base * height
>>> vol_cone(10, 3)
10.0
>>> vol_cone(1, 1)
0.3333333333333333
"""
return area_of_base * height / 3.0
def vol_right_circ_cone(radius: float, height: float) -> float:
"""
Calculate the Volume of a Right Circular Cone.
Wikipedia reference: https://en.wikipedia.org/wiki/Cone
:return (1/3) * pi * radius^2 * height
>>> vol_right_circ_cone(2, 3)
12.566370614359172
"""
return pi * pow(radius, 2) * height / 3.0
def vol_prism(area_of_base: float, height: float) -> float:
"""
Calculate the Volume of a Prism.
Wikipedia reference: https://en.wikipedia.org/wiki/Prism_(geometry)
:return V = Bh
>>> vol_prism(10, 2)
20.0
>>> vol_prism(11, 1)
11.0
"""
return float(area_of_base * height)
def vol_pyramid(area_of_base: float, height: float) -> float:
"""
Calculate the Volume of a Pyramid.
Wikipedia reference: https://en.wikipedia.org/wiki/Pyramid_(geometry)
:return (1/3) * Bh
>>> vol_pyramid(10, 3)
10.0
>>> vol_pyramid(1.5, 3)
1.5
"""
return area_of_base * height / 3.0
def vol_sphere(radius: float) -> float:
"""
Calculate the Volume of a Sphere.
Wikipedia reference: https://en.wikipedia.org/wiki/Sphere
:return (4/3) * pi * r^3
>>> vol_sphere(5)
523.5987755982989
>>> vol_sphere(1)
4.1887902047863905
"""
return 4 / 3 * pi * pow(radius, 3)
def vol_circular_cylinder(radius: float, height: float) -> float:
"""Calculate the Volume of a Circular Cylinder.
Wikipedia reference: https://en.wikipedia.org/wiki/Cylinder
:return pi * radius^2 * height
>>> vol_circular_cylinder(1, 1)
3.141592653589793
>>> vol_circular_cylinder(4, 3)
150.79644737231007
"""
return pi * pow(radius, 2) * height
def main():
"""Print the Results of Various Volume Calculations."""
print("Volumes:")
print("Cube: " + str(vol_cube(2))) # = 8
print("Cuboid: " + str(vol_cuboid(2, 2, 2))) # = 8
print("Cone: " + str(vol_cone(2, 2))) # ~= 1.33
print("Right Circular Cone: " + str(vol_right_circ_cone(2, 2))) # ~= 8.38
print("Prism: " + str(vol_prism(2, 2))) # = 4
print("Pyramid: " + str(vol_pyramid(2, 2))) # ~= 1.33
print("Sphere: " + str(vol_sphere(2))) # ~= 33.5
print("Circular Cylinder: " + str(vol_circular_cylinder(2, 2))) # ~= 25.1
print("Spherical cap: " + str(vol_spherical_cap(1, 2))) # ~= 5.24
print("Spheres intersetion: " + str(vol_spheres_intersect(2, 2, 1))) # ~= 21.21
if __name__ == "__main__":
main()
| """
Find Volumes of Various Shapes.
Wikipedia reference: https://en.wikipedia.org/wiki/Volume
"""
from __future__ import annotations
from math import pi, pow
def vol_cube(side_length: int | float) -> float:
"""
Calculate the Volume of a Cube.
>>> vol_cube(1)
1.0
>>> vol_cube(3)
27.0
"""
return pow(side_length, 3)
def vol_spherical_cap(height: float, radius: float) -> float:
"""
Calculate the Volume of the spherical cap.
:return 1/3 pi * height ^ 2 * (3 * radius - height)
>>> vol_spherical_cap(1, 2)
5.235987755982988
"""
return 1 / 3 * pi * pow(height, 2) * (3 * radius - height)
def vol_spheres_intersect(
radius_1: float, radius_2: float, centers_distance: float
) -> float:
"""
Calculate the volume of the intersection of two spheres.
The intersection is composed by two spherical caps and therefore its volume is the
sum of the volumes of the spherical caps. First it calculates the heights (h1, h2)
of the the spherical caps, then the two volumes and it returns the sum.
The height formulas are
h1 = (radius_1 - radius_2 + centers_distance)
* (radius_1 + radius_2 - centers_distance)
/ (2 * centers_distance)
h2 = (radius_2 - radius_1 + centers_distance)
* (radius_2 + radius_1 - centers_distance)
/ (2 * centers_distance)
if centers_distance is 0 then it returns the volume of the smallers sphere
:return vol_spherical_cap(h1, radius_2) + vol_spherical_cap(h2, radius_1)
>>> vol_spheres_intersect(2, 2, 1)
21.205750411731103
"""
if centers_distance == 0:
return vol_sphere(min(radius_1, radius_2))
h1 = (
(radius_1 - radius_2 + centers_distance)
* (radius_1 + radius_2 - centers_distance)
/ (2 * centers_distance)
)
h2 = (
(radius_2 - radius_1 + centers_distance)
* (radius_2 + radius_1 - centers_distance)
/ (2 * centers_distance)
)
return vol_spherical_cap(h1, radius_2) + vol_spherical_cap(h2, radius_1)
def vol_cuboid(width: float, height: float, length: float) -> float:
"""
Calculate the Volume of a Cuboid.
:return multiple of width, length and height
>>> vol_cuboid(1, 1, 1)
1.0
>>> vol_cuboid(1, 2, 3)
6.0
"""
return float(width * height * length)
def vol_cone(area_of_base: float, height: float) -> float:
"""
Calculate the Volume of a Cone.
Wikipedia reference: https://en.wikipedia.org/wiki/Cone
:return (1/3) * area_of_base * height
>>> vol_cone(10, 3)
10.0
>>> vol_cone(1, 1)
0.3333333333333333
"""
return area_of_base * height / 3.0
def vol_right_circ_cone(radius: float, height: float) -> float:
"""
Calculate the Volume of a Right Circular Cone.
Wikipedia reference: https://en.wikipedia.org/wiki/Cone
:return (1/3) * pi * radius^2 * height
>>> vol_right_circ_cone(2, 3)
12.566370614359172
"""
return pi * pow(radius, 2) * height / 3.0
def vol_prism(area_of_base: float, height: float) -> float:
"""
Calculate the Volume of a Prism.
Wikipedia reference: https://en.wikipedia.org/wiki/Prism_(geometry)
:return V = Bh
>>> vol_prism(10, 2)
20.0
>>> vol_prism(11, 1)
11.0
"""
return float(area_of_base * height)
def vol_pyramid(area_of_base: float, height: float) -> float:
"""
Calculate the Volume of a Pyramid.
Wikipedia reference: https://en.wikipedia.org/wiki/Pyramid_(geometry)
:return (1/3) * Bh
>>> vol_pyramid(10, 3)
10.0
>>> vol_pyramid(1.5, 3)
1.5
"""
return area_of_base * height / 3.0
def vol_sphere(radius: float) -> float:
"""
Calculate the Volume of a Sphere.
Wikipedia reference: https://en.wikipedia.org/wiki/Sphere
:return (4/3) * pi * r^3
>>> vol_sphere(5)
523.5987755982989
>>> vol_sphere(1)
4.1887902047863905
"""
return 4 / 3 * pi * pow(radius, 3)
def vol_circular_cylinder(radius: float, height: float) -> float:
"""Calculate the Volume of a Circular Cylinder.
Wikipedia reference: https://en.wikipedia.org/wiki/Cylinder
:return pi * radius^2 * height
>>> vol_circular_cylinder(1, 1)
3.141592653589793
>>> vol_circular_cylinder(4, 3)
150.79644737231007
"""
return pi * pow(radius, 2) * height
def main():
"""Print the Results of Various Volume Calculations."""
print("Volumes:")
print("Cube: " + str(vol_cube(2))) # = 8
print("Cuboid: " + str(vol_cuboid(2, 2, 2))) # = 8
print("Cone: " + str(vol_cone(2, 2))) # ~= 1.33
print("Right Circular Cone: " + str(vol_right_circ_cone(2, 2))) # ~= 8.38
print("Prism: " + str(vol_prism(2, 2))) # = 4
print("Pyramid: " + str(vol_pyramid(2, 2))) # ~= 1.33
print("Sphere: " + str(vol_sphere(2))) # ~= 33.5
print("Circular Cylinder: " + str(vol_circular_cylinder(2, 2))) # ~= 25.1
print("Spherical cap: " + str(vol_spherical_cap(1, 2))) # ~= 5.24
print("Spheres intersetion: " + str(vol_spheres_intersect(2, 2, 1))) # ~= 21.21
if __name__ == "__main__":
main()
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """
Project Euler Problem 4: https://projecteuler.net/problem=4
Largest palindrome product
A palindromic number reads the same both ways. The largest palindrome made
from the product of two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome made from the product of two 3-digit numbers.
References:
- https://en.wikipedia.org/wiki/Palindromic_number
"""
def solution(n: int = 998001) -> int:
"""
Returns the largest palindrome made from the product of two 3-digit
numbers which is less than n.
>>> solution(20000)
19591
>>> solution(30000)
29992
>>> solution(40000)
39893
>>> solution(10000)
Traceback (most recent call last):
...
ValueError: That number is larger than our acceptable range.
"""
# fetches the next number
for number in range(n - 1, 9999, -1):
str_number = str(number)
# checks whether 'str_number' is a palindrome.
if str_number == str_number[::-1]:
divisor = 999
# if 'number' is a product of two 3-digit numbers
# then number is the answer otherwise fetch next number.
while divisor != 99:
if (number % divisor == 0) and (len(str(number // divisor)) == 3.0):
return number
divisor -= 1
raise ValueError("That number is larger than our acceptable range.")
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler Problem 4: https://projecteuler.net/problem=4
Largest palindrome product
A palindromic number reads the same both ways. The largest palindrome made
from the product of two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome made from the product of two 3-digit numbers.
References:
- https://en.wikipedia.org/wiki/Palindromic_number
"""
def solution(n: int = 998001) -> int:
"""
Returns the largest palindrome made from the product of two 3-digit
numbers which is less than n.
>>> solution(20000)
19591
>>> solution(30000)
29992
>>> solution(40000)
39893
>>> solution(10000)
Traceback (most recent call last):
...
ValueError: That number is larger than our acceptable range.
"""
# fetches the next number
for number in range(n - 1, 9999, -1):
str_number = str(number)
# checks whether 'str_number' is a palindrome.
if str_number == str_number[::-1]:
divisor = 999
# if 'number' is a product of two 3-digit numbers
# then number is the answer otherwise fetch next number.
while divisor != 99:
if (number % divisor == 0) and (len(str(number // divisor)) == 3.0):
return number
divisor -= 1
raise ValueError("That number is larger than our acceptable range.")
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 5,362 | Rewrite parts of Vector and Matrix | ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| tianyizheng02 | "2021-10-16T22:20:43Z" | "2021-10-27T03:48:43Z" | 8285913e81fb8f46b90d0e19da233862964c07dc | fe5c711ce68cb1d410d13d8c8a02ee7bfd49b1d3 | Rewrite parts of Vector and Matrix. ### **Describe your change:**
Rewrote parts of Vector and Matrix and added unit tests as needed
* [x] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [x] Documentation change?
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file. To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
| """Convert a Decimal Number to an Octal Number."""
import math
# Modified from:
# https://github.com/TheAlgorithms/Javascript/blob/master/Conversions/DecimalToOctal.js
def decimal_to_octal(num: int) -> str:
"""Convert a Decimal Number to an Octal Number.
>>> all(decimal_to_octal(i) == oct(i) for i
... in (0, 2, 8, 64, 65, 216, 255, 256, 512))
True
"""
octal = 0
counter = 0
while num > 0:
remainder = num % 8
octal = octal + (remainder * math.floor(math.pow(10, counter)))
counter += 1
num = math.floor(num / 8) # basically /= 8 without remainder if any
# This formatting removes trailing '.0' from `octal`.
return f"0o{int(octal)}"
def main() -> None:
"""Print octal equivalents of decimal numbers."""
print("\n2 in octal is:")
print(decimal_to_octal(2)) # = 2
print("\n8 in octal is:")
print(decimal_to_octal(8)) # = 10
print("\n65 in octal is:")
print(decimal_to_octal(65)) # = 101
print("\n216 in octal is:")
print(decimal_to_octal(216)) # = 330
print("\n512 in octal is:")
print(decimal_to_octal(512)) # = 1000
print("\n")
if __name__ == "__main__":
main()
| """Convert a Decimal Number to an Octal Number."""
import math
# Modified from:
# https://github.com/TheAlgorithms/Javascript/blob/master/Conversions/DecimalToOctal.js
def decimal_to_octal(num: int) -> str:
"""Convert a Decimal Number to an Octal Number.
>>> all(decimal_to_octal(i) == oct(i) for i
... in (0, 2, 8, 64, 65, 216, 255, 256, 512))
True
"""
octal = 0
counter = 0
while num > 0:
remainder = num % 8
octal = octal + (remainder * math.floor(math.pow(10, counter)))
counter += 1
num = math.floor(num / 8) # basically /= 8 without remainder if any
# This formatting removes trailing '.0' from `octal`.
return f"0o{int(octal)}"
def main() -> None:
"""Print octal equivalents of decimal numbers."""
print("\n2 in octal is:")
print(decimal_to_octal(2)) # = 2
print("\n8 in octal is:")
print(decimal_to_octal(8)) # = 10
print("\n65 in octal is:")
print(decimal_to_octal(65)) # = 101
print("\n216 in octal is:")
print(decimal_to_octal(216)) # = 330
print("\n512 in octal is:")
print(decimal_to_octal(512)) # = 1000
print("\n")
if __name__ == "__main__":
main()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | https://docs.python.org/3/reference/expressions.html#binary-bitwise-operations
https://docs.python.org/3/reference/expressions.html#unary-arithmetic-and-bitwise-operations
https://docs.python.org/3/library/stdtypes.html#bitwise-operations-on-integer-types
https://wiki.python.org/moin/BitManipulation
https://wiki.python.org/moin/BitwiseOperators
https://www.tutorialspoint.com/python3/bitwise_operators_example.htm
| * https://docs.python.org/3/reference/expressions.html#binary-bitwise-operations
* https://docs.python.org/3/reference/expressions.html#unary-arithmetic-and-bitwise-operations
* https://docs.python.org/3/library/stdtypes.html#bitwise-operations-on-integer-types
* https://wiki.python.org/moin/BitManipulation
* https://wiki.python.org/moin/BitwiseOperators
* https://www.tutorialspoint.com/python3/bitwise_operators_example.htm
| 1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | # https://www.tutorialspoint.com/python3/bitwise_operators_example.htm
def binary_and(a: int, b: int) -> str:
"""
Take in 2 integers, convert them to binary,
return a binary number that is the
result of a binary and operation on the integers provided.
>>> binary_and(25, 32)
'0b000000'
>>> binary_and(37, 50)
'0b100000'
>>> binary_and(21, 30)
'0b10100'
>>> binary_and(58, 73)
'0b0001000'
>>> binary_and(0, 255)
'0b00000000'
>>> binary_and(256, 256)
'0b100000000'
>>> binary_and(0, -1)
Traceback (most recent call last):
...
ValueError: the value of both input must be positive
>>> binary_and(0, 1.1)
Traceback (most recent call last):
...
TypeError: 'float' object cannot be interpreted as an integer
>>> binary_and("0", "1")
Traceback (most recent call last):
...
TypeError: '<' not supported between instances of 'str' and 'int'
"""
if a < 0 or b < 0:
raise ValueError("the value of both input must be positive")
a_binary = str(bin(a))[2:] # remove the leading "0b"
b_binary = str(bin(b))[2:] # remove the leading "0b"
max_len = max(len(a_binary), len(b_binary))
return "0b" + "".join(
str(int(char_a == "1" and char_b == "1"))
for char_a, char_b in zip(a_binary.zfill(max_len), b_binary.zfill(max_len))
)
if __name__ == "__main__":
import doctest
doctest.testmod()
| # https://www.tutorialspoint.com/python3/bitwise_operators_example.htm
def binary_and(a: int, b: int) -> str:
"""
Take in 2 integers, convert them to binary,
return a binary number that is the
result of a binary and operation on the integers provided.
>>> binary_and(25, 32)
'0b000000'
>>> binary_and(37, 50)
'0b100000'
>>> binary_and(21, 30)
'0b10100'
>>> binary_and(58, 73)
'0b0001000'
>>> binary_and(0, 255)
'0b00000000'
>>> binary_and(256, 256)
'0b100000000'
>>> binary_and(0, -1)
Traceback (most recent call last):
...
ValueError: the value of both inputs must be positive
>>> binary_and(0, 1.1)
Traceback (most recent call last):
...
TypeError: 'float' object cannot be interpreted as an integer
>>> binary_and("0", "1")
Traceback (most recent call last):
...
TypeError: '<' not supported between instances of 'str' and 'int'
"""
if a < 0 or b < 0:
raise ValueError("the value of both inputs must be positive")
a_binary = str(bin(a))[2:] # remove the leading "0b"
b_binary = str(bin(b))[2:] # remove the leading "0b"
max_len = max(len(a_binary), len(b_binary))
return "0b" + "".join(
str(int(char_a == "1" and char_b == "1"))
for char_a, char_b in zip(a_binary.zfill(max_len), b_binary.zfill(max_len))
)
if __name__ == "__main__":
import doctest
doctest.testmod()
| 1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | # https://www.tutorialspoint.com/python3/bitwise_operators_example.htm
def binary_or(a: int, b: int) -> str:
"""
Take in 2 integers, convert them to binary, and return a binary number that is the
result of a binary or operation on the integers provided.
>>> binary_or(25, 32)
'0b111001'
>>> binary_or(37, 50)
'0b110111'
>>> binary_or(21, 30)
'0b11111'
>>> binary_or(58, 73)
'0b1111011'
>>> binary_or(0, 255)
'0b11111111'
>>> binary_or(0, 256)
'0b100000000'
>>> binary_or(0, -1)
Traceback (most recent call last):
...
ValueError: the value of both input must be positive
>>> binary_or(0, 1.1)
Traceback (most recent call last):
...
TypeError: 'float' object cannot be interpreted as an integer
>>> binary_or("0", "1")
Traceback (most recent call last):
...
TypeError: '<' not supported between instances of 'str' and 'int'
"""
if a < 0 or b < 0:
raise ValueError("the value of both input must be positive")
a_binary = str(bin(a))[2:] # remove the leading "0b"
b_binary = str(bin(b))[2:]
max_len = max(len(a_binary), len(b_binary))
return "0b" + "".join(
str(int("1" in (char_a, char_b)))
for char_a, char_b in zip(a_binary.zfill(max_len), b_binary.zfill(max_len))
)
if __name__ == "__main__":
import doctest
doctest.testmod()
| # https://www.tutorialspoint.com/python3/bitwise_operators_example.htm
def binary_or(a: int, b: int) -> str:
"""
Take in 2 integers, convert them to binary, and return a binary number that is the
result of a binary or operation on the integers provided.
>>> binary_or(25, 32)
'0b111001'
>>> binary_or(37, 50)
'0b110111'
>>> binary_or(21, 30)
'0b11111'
>>> binary_or(58, 73)
'0b1111011'
>>> binary_or(0, 255)
'0b11111111'
>>> binary_or(0, 256)
'0b100000000'
>>> binary_or(0, -1)
Traceback (most recent call last):
...
ValueError: the value of both inputs must be positive
>>> binary_or(0, 1.1)
Traceback (most recent call last):
...
TypeError: 'float' object cannot be interpreted as an integer
>>> binary_or("0", "1")
Traceback (most recent call last):
...
TypeError: '<' not supported between instances of 'str' and 'int'
"""
if a < 0 or b < 0:
raise ValueError("the value of both inputs must be positive")
a_binary = str(bin(a))[2:] # remove the leading "0b"
b_binary = str(bin(b))[2:]
max_len = max(len(a_binary), len(b_binary))
return "0b" + "".join(
str(int("1" in (char_a, char_b)))
for char_a, char_b in zip(a_binary.zfill(max_len), b_binary.zfill(max_len))
)
if __name__ == "__main__":
import doctest
doctest.testmod()
| 1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | # https://www.tutorialspoint.com/python3/bitwise_operators_example.htm
def binary_xor(a: int, b: int) -> str:
"""
Take in 2 integers, convert them to binary,
return a binary number that is the
result of a binary xor operation on the integers provided.
>>> binary_xor(25, 32)
'0b111001'
>>> binary_xor(37, 50)
'0b010111'
>>> binary_xor(21, 30)
'0b01011'
>>> binary_xor(58, 73)
'0b1110011'
>>> binary_xor(0, 255)
'0b11111111'
>>> binary_xor(256, 256)
'0b000000000'
>>> binary_xor(0, -1)
Traceback (most recent call last):
...
ValueError: the value of both input must be positive
>>> binary_xor(0, 1.1)
Traceback (most recent call last):
...
TypeError: 'float' object cannot be interpreted as an integer
>>> binary_xor("0", "1")
Traceback (most recent call last):
...
TypeError: '<' not supported between instances of 'str' and 'int'
"""
if a < 0 or b < 0:
raise ValueError("the value of both input must be positive")
a_binary = str(bin(a))[2:] # remove the leading "0b"
b_binary = str(bin(b))[2:] # remove the leading "0b"
max_len = max(len(a_binary), len(b_binary))
return "0b" + "".join(
str(int(char_a != char_b))
for char_a, char_b in zip(a_binary.zfill(max_len), b_binary.zfill(max_len))
)
if __name__ == "__main__":
import doctest
doctest.testmod()
| # https://www.tutorialspoint.com/python3/bitwise_operators_example.htm
def binary_xor(a: int, b: int) -> str:
"""
Take in 2 integers, convert them to binary,
return a binary number that is the
result of a binary xor operation on the integers provided.
>>> binary_xor(25, 32)
'0b111001'
>>> binary_xor(37, 50)
'0b010111'
>>> binary_xor(21, 30)
'0b01011'
>>> binary_xor(58, 73)
'0b1110011'
>>> binary_xor(0, 255)
'0b11111111'
>>> binary_xor(256, 256)
'0b000000000'
>>> binary_xor(0, -1)
Traceback (most recent call last):
...
ValueError: the value of both inputs must be positive
>>> binary_xor(0, 1.1)
Traceback (most recent call last):
...
TypeError: 'float' object cannot be interpreted as an integer
>>> binary_xor("0", "1")
Traceback (most recent call last):
...
TypeError: '<' not supported between instances of 'str' and 'int'
"""
if a < 0 or b < 0:
raise ValueError("the value of both inputs must be positive")
a_binary = str(bin(a))[2:] # remove the leading "0b"
b_binary = str(bin(b))[2:] # remove the leading "0b"
max_len = max(len(a_binary), len(b_binary))
return "0b" + "".join(
str(int(char_a != char_b))
for char_a, char_b in zip(a_binary.zfill(max_len), b_binary.zfill(max_len))
)
if __name__ == "__main__":
import doctest
doctest.testmod()
| 1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Bead sort only works for sequences of non-negative integers.
https://en.wikipedia.org/wiki/Bead_sort
"""
def bead_sort(sequence: list) -> list:
"""
>>> bead_sort([6, 11, 12, 4, 1, 5])
[1, 4, 5, 6, 11, 12]
>>> bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1])
[1, 2, 3, 4, 5, 6, 7, 8, 9]
>>> bead_sort([5, 0, 4, 3])
[0, 3, 4, 5]
>>> bead_sort([8, 2, 1])
[1, 2, 8]
>>> bead_sort([1, .9, 0.0, 0, -1, -.9])
Traceback (most recent call last):
...
TypeError: Sequence must be list of nonnegative integers
>>> bead_sort("Hello world")
Traceback (most recent call last):
...
TypeError: Sequence must be list of nonnegative integers
"""
if any(not isinstance(x, int) or x < 0 for x in sequence):
raise TypeError("Sequence must be list of nonnegative integers")
for _ in range(len(sequence)):
for i, (rod_upper, rod_lower) in enumerate(zip(sequence, sequence[1:])):
if rod_upper > rod_lower:
sequence[i] -= rod_upper - rod_lower
sequence[i + 1] += rod_upper - rod_lower
return sequence
if __name__ == "__main__":
assert bead_sort([5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5]
assert bead_sort([7, 9, 4, 3, 5]) == [3, 4, 5, 7, 9]
| """
Bead sort only works for sequences of non-negative integers.
https://en.wikipedia.org/wiki/Bead_sort
"""
def bead_sort(sequence: list) -> list:
"""
>>> bead_sort([6, 11, 12, 4, 1, 5])
[1, 4, 5, 6, 11, 12]
>>> bead_sort([9, 8, 7, 6, 5, 4 ,3, 2, 1])
[1, 2, 3, 4, 5, 6, 7, 8, 9]
>>> bead_sort([5, 0, 4, 3])
[0, 3, 4, 5]
>>> bead_sort([8, 2, 1])
[1, 2, 8]
>>> bead_sort([1, .9, 0.0, 0, -1, -.9])
Traceback (most recent call last):
...
TypeError: Sequence must be list of non-negative integers
>>> bead_sort("Hello world")
Traceback (most recent call last):
...
TypeError: Sequence must be list of non-negative integers
"""
if any(not isinstance(x, int) or x < 0 for x in sequence):
raise TypeError("Sequence must be list of non-negative integers")
for _ in range(len(sequence)):
for i, (rod_upper, rod_lower) in enumerate(zip(sequence, sequence[1:])):
if rod_upper > rod_lower:
sequence[i] -= rod_upper - rod_lower
sequence[i + 1] += rod_upper - rod_lower
return sequence
if __name__ == "__main__":
assert bead_sort([5, 4, 3, 2, 1]) == [1, 2, 3, 4, 5]
assert bead_sort([7, 9, 4, 3, 5]) == [3, 4, 5, 7, 9]
| 1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | def double_sort(lst):
"""this sorting algorithm sorts an array using the principle of bubble sort,
but does it both from left to right and right to left,
hence i decided to call it "double sort"
:param collection: mutable ordered sequence of elements
:return: the same collection in ascending order
Examples:
>>> double_sort([-1 ,-2 ,-3 ,-4 ,-5 ,-6 ,-7])
[-7, -6, -5, -4, -3, -2, -1]
>>> double_sort([])
[]
>>> double_sort([-1 ,-2 ,-3 ,-4 ,-5 ,-6])
[-6, -5, -4, -3, -2, -1]
>>> double_sort([-3, 10, 16, -42, 29]) == sorted([-3, 10, 16, -42, 29])
True
"""
no_of_elements = len(lst)
for i in range(
0, int(((no_of_elements - 1) / 2) + 1)
): # we don't need to traverse to end of list as
for j in range(0, no_of_elements - 1):
if (
lst[j + 1] < lst[j]
): # applying bubble sort algorithm from left to right (or forwards)
temp = lst[j + 1]
lst[j + 1] = lst[j]
lst[j] = temp
if (
lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
): # applying bubble sort algorithm from right to left (or backwards)
temp = lst[no_of_elements - 1 - j]
lst[no_of_elements - 1 - j] = lst[no_of_elements - 2 - j]
lst[no_of_elements - 2 - j] = temp
return lst
if __name__ == "__main__":
print("enter the list to be sorted")
lst = [int(x) for x in input().split()] # inputing elements of the list in one line
sorted_lst = double_sort(lst)
print("the sorted list is")
print(sorted_lst)
| def double_sort(lst):
"""This sorting algorithm sorts an array using the principle of bubble sort,
but does it both from left to right and right to left.
Hence, it's called "Double sort"
:param collection: mutable ordered sequence of elements
:return: the same collection in ascending order
Examples:
>>> double_sort([-1 ,-2 ,-3 ,-4 ,-5 ,-6 ,-7])
[-7, -6, -5, -4, -3, -2, -1]
>>> double_sort([])
[]
>>> double_sort([-1 ,-2 ,-3 ,-4 ,-5 ,-6])
[-6, -5, -4, -3, -2, -1]
>>> double_sort([-3, 10, 16, -42, 29]) == sorted([-3, 10, 16, -42, 29])
True
"""
no_of_elements = len(lst)
for i in range(
0, int(((no_of_elements - 1) / 2) + 1)
): # we don't need to traverse to end of list as
for j in range(0, no_of_elements - 1):
if (
lst[j + 1] < lst[j]
): # applying bubble sort algorithm from left to right (or forwards)
temp = lst[j + 1]
lst[j + 1] = lst[j]
lst[j] = temp
if (
lst[no_of_elements - 1 - j] < lst[no_of_elements - 2 - j]
): # applying bubble sort algorithm from right to left (or backwards)
temp = lst[no_of_elements - 1 - j]
lst[no_of_elements - 1 - j] = lst[no_of_elements - 2 - j]
lst[no_of_elements - 2 - j] = temp
return lst
if __name__ == "__main__":
print("enter the list to be sorted")
lst = [int(x) for x in input().split()] # inputing elements of the list in one line
sorted_lst = double_sort(lst)
print("the sorted list is")
print(sorted_lst)
| 1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Harmonic mean
Reference: https://en.wikipedia.org/wiki/Harmonic_mean
Harmonic series
Reference: https://en.wikipedia.org/wiki/Harmonic_series(mathematics)
"""
def is_harmonic_series(series: list) -> bool:
"""
checking whether the input series is arithmetic series or not
>>> is_harmonic_series([ 1, 2/3, 1/2, 2/5, 1/3])
True
>>> is_harmonic_series([ 1, 2/3, 2/5, 1/3])
False
>>> is_harmonic_series([1, 2, 3])
False
>>> is_harmonic_series([1/2, 1/3, 1/4])
True
>>> is_harmonic_series([2/5, 2/10, 2/15, 2/20, 2/25])
True
>>> is_harmonic_series(4)
Traceback (most recent call last):
...
ValueError: Input series is not valid, valid series - [1, 2/3, 2]
>>> is_harmonic_series([])
Traceback (most recent call last):
...
ValueError: Input list must be a non empty list
>>> is_harmonic_series([0])
Traceback (most recent call last):
...
ValueError: Input series cannot have 0 as an element
>>> is_harmonic_series([1,2,0,6])
Traceback (most recent call last):
...
ValueError: Input series cannot have 0 as an element
"""
if not isinstance(series, list):
raise ValueError("Input series is not valid, valid series - [1, 2/3, 2]")
if len(series) == 0:
raise ValueError("Input list must be a non empty list")
if len(series) == 1 and series[0] != 0:
return True
rec_series = []
series_len = len(series)
for i in range(0, series_len):
if series[i] == 0:
raise ValueError("Input series cannot have 0 as an element")
rec_series.append(1 / series[i])
common_diff = rec_series[1] - rec_series[0]
for index in range(2, series_len):
if rec_series[index] - rec_series[index - 1] != common_diff:
return False
return True
def harmonic_mean(series: list) -> float:
"""
return the harmonic mean of series
>>> harmonic_mean([1, 4, 4])
2.0
>>> harmonic_mean([3, 6, 9, 12])
5.759999999999999
>>> harmonic_mean(4)
Traceback (most recent call last):
...
ValueError: Input series is not valid, valid series - [2, 4, 6]
>>> harmonic_mean([1, 2, 3])
1.6363636363636365
>>> harmonic_mean([])
Traceback (most recent call last):
...
ValueError: Input list must be a non empty list
"""
if not isinstance(series, list):
raise ValueError("Input series is not valid, valid series - [2, 4, 6]")
if len(series) == 0:
raise ValueError("Input list must be a non empty list")
answer = 0
for val in series:
answer += 1 / val
return len(series) / answer
if __name__ == "__main__":
import doctest
doctest.testmod()
| """
Harmonic mean
Reference: https://en.wikipedia.org/wiki/Harmonic_mean
Harmonic series
Reference: https://en.wikipedia.org/wiki/Harmonic_series(mathematics)
"""
def is_harmonic_series(series: list) -> bool:
"""
checking whether the input series is arithmetic series or not
>>> is_harmonic_series([ 1, 2/3, 1/2, 2/5, 1/3])
True
>>> is_harmonic_series([ 1, 2/3, 2/5, 1/3])
False
>>> is_harmonic_series([1, 2, 3])
False
>>> is_harmonic_series([1/2, 1/3, 1/4])
True
>>> is_harmonic_series([2/5, 2/10, 2/15, 2/20, 2/25])
True
>>> is_harmonic_series(4)
Traceback (most recent call last):
...
ValueError: Input series is not valid, valid series - [1, 2/3, 2]
>>> is_harmonic_series([])
Traceback (most recent call last):
...
ValueError: Input list must be a non empty list
>>> is_harmonic_series([0])
Traceback (most recent call last):
...
ValueError: Input series cannot have 0 as an element
>>> is_harmonic_series([1,2,0,6])
Traceback (most recent call last):
...
ValueError: Input series cannot have 0 as an element
"""
if not isinstance(series, list):
raise ValueError("Input series is not valid, valid series - [1, 2/3, 2]")
if len(series) == 0:
raise ValueError("Input list must be a non empty list")
if len(series) == 1 and series[0] != 0:
return True
rec_series = []
series_len = len(series)
for i in range(0, series_len):
if series[i] == 0:
raise ValueError("Input series cannot have 0 as an element")
rec_series.append(1 / series[i])
common_diff = rec_series[1] - rec_series[0]
for index in range(2, series_len):
if rec_series[index] - rec_series[index - 1] != common_diff:
return False
return True
def harmonic_mean(series: list) -> float:
"""
return the harmonic mean of series
>>> harmonic_mean([1, 4, 4])
2.0
>>> harmonic_mean([3, 6, 9, 12])
5.759999999999999
>>> harmonic_mean(4)
Traceback (most recent call last):
...
ValueError: Input series is not valid, valid series - [2, 4, 6]
>>> harmonic_mean([1, 2, 3])
1.6363636363636365
>>> harmonic_mean([])
Traceback (most recent call last):
...
ValueError: Input list must be a non empty list
"""
if not isinstance(series, list):
raise ValueError("Input series is not valid, valid series - [2, 4, 6]")
if len(series) == 0:
raise ValueError("Input list must be a non empty list")
answer = 0
for val in series:
answer += 1 / val
return len(series) / answer
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | -1 |
||
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | # Eulers Totient function finds the number of relative primes of a number n from 1 to n
def totient(n: int) -> list:
is_prime = [True for i in range(n + 1)]
totients = [i - 1 for i in range(n + 1)]
primes = []
for i in range(2, n + 1):
if is_prime[i]:
primes.append(i)
for j in range(0, len(primes)):
if i * primes[j] >= n:
break
is_prime[i * primes[j]] = False
if i % primes[j] == 0:
totients[i * primes[j]] = totients[i] * primes[j]
break
totients[i * primes[j]] = totients[i] * (primes[j] - 1)
return totients
def test_totient() -> None:
"""
>>> n = 10
>>> totient_calculation = totient(n)
>>> for i in range(1, n):
... print(f"{i} has {totient_calculation[i]} relative primes.")
1 has 0 relative primes.
2 has 1 relative primes.
3 has 2 relative primes.
4 has 2 relative primes.
5 has 4 relative primes.
6 has 2 relative primes.
7 has 6 relative primes.
8 has 4 relative primes.
9 has 6 relative primes.
"""
pass
if __name__ == "__main__":
import doctest
doctest.testmod()
| # Eulers Totient function finds the number of relative primes of a number n from 1 to n
def totient(n: int) -> list:
is_prime = [True for i in range(n + 1)]
totients = [i - 1 for i in range(n + 1)]
primes = []
for i in range(2, n + 1):
if is_prime[i]:
primes.append(i)
for j in range(0, len(primes)):
if i * primes[j] >= n:
break
is_prime[i * primes[j]] = False
if i % primes[j] == 0:
totients[i * primes[j]] = totients[i] * primes[j]
break
totients[i * primes[j]] = totients[i] * (primes[j] - 1)
return totients
def test_totient() -> None:
"""
>>> n = 10
>>> totient_calculation = totient(n)
>>> for i in range(1, n):
... print(f"{i} has {totient_calculation[i]} relative primes.")
1 has 0 relative primes.
2 has 1 relative primes.
3 has 2 relative primes.
4 has 2 relative primes.
5 has 4 relative primes.
6 has 2 relative primes.
7 has 6 relative primes.
8 has 4 relative primes.
9 has 6 relative primes.
"""
pass
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Number letter counts
Problem 17: https://projecteuler.net/problem=17
If the numbers 1 to 5 are written out in words: one, two, three, four, five,
then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.
If all the numbers from 1 to 1000 (one thousand) inclusive were written out in
words, how many letters would be used?
NOTE: Do not count spaces or hyphens. For example, 342 (three hundred and
forty-two) contains 23 letters and 115 (one hundred and fifteen) contains 20
letters. The use of "and" when writing out numbers is in compliance withBritish
usage.
"""
def solution(n: int = 1000) -> int:
"""Returns the number of letters used to write all numbers from 1 to n.
where n is lower or equals to 1000.
>>> solution(1000)
21124
>>> solution(5)
19
"""
# number of letters in zero, one, two, ..., nineteen (0 for zero since it's
# never said aloud)
ones_counts = [0, 3, 3, 5, 4, 4, 3, 5, 5, 4, 3, 6, 6, 8, 8, 7, 7, 9, 8, 8]
# number of letters in twenty, thirty, ..., ninety (0 for numbers less than
# 20 due to inconsistency in teens)
tens_counts = [0, 0, 6, 6, 5, 5, 5, 7, 6, 6]
count = 0
for i in range(1, n + 1):
if i < 1000:
if i >= 100:
# add number of letters for "n hundred"
count += ones_counts[i // 100] + 7
if i % 100 != 0:
# add number of letters for "and" if number is not multiple
# of 100
count += 3
if 0 < i % 100 < 20:
# add number of letters for one, two, three, ..., nineteen
# (could be combined with below if not for inconsistency in
# teens)
count += ones_counts[i % 100]
else:
# add number of letters for twenty, twenty one, ..., ninety
# nine
count += ones_counts[i % 10]
count += tens_counts[(i % 100 - i % 10) // 10]
else:
count += ones_counts[i // 1000] + 8
return count
if __name__ == "__main__":
print(solution(int(input().strip())))
| """
Number letter counts
Problem 17: https://projecteuler.net/problem=17
If the numbers 1 to 5 are written out in words: one, two, three, four, five,
then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.
If all the numbers from 1 to 1000 (one thousand) inclusive were written out in
words, how many letters would be used?
NOTE: Do not count spaces or hyphens. For example, 342 (three hundred and
forty-two) contains 23 letters and 115 (one hundred and fifteen) contains 20
letters. The use of "and" when writing out numbers is in compliance withBritish
usage.
"""
def solution(n: int = 1000) -> int:
"""Returns the number of letters used to write all numbers from 1 to n.
where n is lower or equals to 1000.
>>> solution(1000)
21124
>>> solution(5)
19
"""
# number of letters in zero, one, two, ..., nineteen (0 for zero since it's
# never said aloud)
ones_counts = [0, 3, 3, 5, 4, 4, 3, 5, 5, 4, 3, 6, 6, 8, 8, 7, 7, 9, 8, 8]
# number of letters in twenty, thirty, ..., ninety (0 for numbers less than
# 20 due to inconsistency in teens)
tens_counts = [0, 0, 6, 6, 5, 5, 5, 7, 6, 6]
count = 0
for i in range(1, n + 1):
if i < 1000:
if i >= 100:
# add number of letters for "n hundred"
count += ones_counts[i // 100] + 7
if i % 100 != 0:
# add number of letters for "and" if number is not multiple
# of 100
count += 3
if 0 < i % 100 < 20:
# add number of letters for one, two, three, ..., nineteen
# (could be combined with below if not for inconsistency in
# teens)
count += ones_counts[i % 100]
else:
# add number of letters for twenty, twenty one, ..., ninety
# nine
count += ones_counts[i % 10]
count += tens_counts[(i % 100 - i % 10) // 10]
else:
count += ones_counts[i // 1000] + 8
return count
if __name__ == "__main__":
print(solution(int(input().strip())))
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | from sys import maxsize
def max_sub_array_sum(a: list, size: int = 0):
"""
>>> max_sub_array_sum([-13, -3, -25, -20, -3, -16, -23, -12, -5, -22, -15, -4, -7])
-3
"""
size = size or len(a)
max_so_far = -maxsize - 1
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_so_far < max_ending_here:
max_so_far = max_ending_here
if max_ending_here < 0:
max_ending_here = 0
return max_so_far
if __name__ == "__main__":
a = [-13, -3, -25, -20, 1, -16, -23, -12, -5, -22, -15, -4, -7]
print(("Maximum contiguous sum is", max_sub_array_sum(a, len(a))))
| from sys import maxsize
def max_sub_array_sum(a: list, size: int = 0):
"""
>>> max_sub_array_sum([-13, -3, -25, -20, -3, -16, -23, -12, -5, -22, -15, -4, -7])
-3
"""
size = size or len(a)
max_so_far = -maxsize - 1
max_ending_here = 0
for i in range(0, size):
max_ending_here = max_ending_here + a[i]
if max_so_far < max_ending_here:
max_so_far = max_ending_here
if max_ending_here < 0:
max_ending_here = 0
return max_so_far
if __name__ == "__main__":
a = [-13, -3, -25, -20, 1, -16, -23, -12, -5, -22, -15, -4, -7]
print(("Maximum contiguous sum is", max_sub_array_sum(a, len(a))))
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Get the citation from google scholar
using title and year of publication, and volume and pages of journal.
"""
import requests
from bs4 import BeautifulSoup
def get_citation(base_url: str, params: dict) -> str:
"""
Return the citation number.
"""
soup = BeautifulSoup(requests.get(base_url, params=params).content, "html.parser")
div = soup.find("div", attrs={"class": "gs_ri"})
anchors = div.find("div", attrs={"class": "gs_fl"}).find_all("a")
return anchors[2].get_text()
if __name__ == "__main__":
params = {
"title": (
"Precisely geometry controlled microsupercapacitors for ultrahigh areal "
"capacitance, volumetric capacitance, and energy density"
),
"journal": "Chem. Mater.",
"volume": 30,
"pages": "3979-3990",
"year": 2018,
"hl": "en",
}
print(get_citation("http://scholar.google.com/scholar_lookup", params=params))
| """
Get the citation from google scholar
using title and year of publication, and volume and pages of journal.
"""
import requests
from bs4 import BeautifulSoup
def get_citation(base_url: str, params: dict) -> str:
"""
Return the citation number.
"""
soup = BeautifulSoup(requests.get(base_url, params=params).content, "html.parser")
div = soup.find("div", attrs={"class": "gs_ri"})
anchors = div.find("div", attrs={"class": "gs_fl"}).find_all("a")
return anchors[2].get_text()
if __name__ == "__main__":
params = {
"title": (
"Precisely geometry controlled microsupercapacitors for ultrahigh areal "
"capacitance, volumetric capacitance, and energy density"
),
"journal": "Chem. Mater.",
"volume": 30,
"pages": "3979-3990",
"year": 2018,
"hl": "en",
}
print(get_citation("http://scholar.google.com/scholar_lookup", params=params))
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | # https://www.geeksforgeeks.org/newton-forward-backward-interpolation/
from __future__ import annotations
import math
# for calculating u value
def ucal(u: float, p: int) -> float:
"""
>>> ucal(1, 2)
0
>>> ucal(1.1, 2)
0.11000000000000011
>>> ucal(1.2, 2)
0.23999999999999994
"""
temp = u
for i in range(1, p):
temp = temp * (u - i)
return temp
def main() -> None:
n = int(input("enter the numbers of values: "))
y: list[list[float]] = []
for i in range(n):
y.append([])
for i in range(n):
for j in range(n):
y[i].append(j)
y[i][j] = 0
print("enter the values of parameters in a list: ")
x = list(map(int, input().split()))
print("enter the values of corresponding parameters: ")
for i in range(n):
y[i][0] = float(input())
value = int(input("enter the value to interpolate: "))
u = (value - x[0]) / (x[1] - x[0])
# for calculating forward difference table
for i in range(1, n):
for j in range(n - i):
y[j][i] = y[j + 1][i - 1] - y[j][i - 1]
summ = y[0][0]
for i in range(1, n):
summ += (ucal(u, i) * y[0][i]) / math.factorial(i)
print(f"the value at {value} is {summ}")
if __name__ == "__main__":
main()
| # https://www.geeksforgeeks.org/newton-forward-backward-interpolation/
from __future__ import annotations
import math
# for calculating u value
def ucal(u: float, p: int) -> float:
"""
>>> ucal(1, 2)
0
>>> ucal(1.1, 2)
0.11000000000000011
>>> ucal(1.2, 2)
0.23999999999999994
"""
temp = u
for i in range(1, p):
temp = temp * (u - i)
return temp
def main() -> None:
n = int(input("enter the numbers of values: "))
y: list[list[float]] = []
for i in range(n):
y.append([])
for i in range(n):
for j in range(n):
y[i].append(j)
y[i][j] = 0
print("enter the values of parameters in a list: ")
x = list(map(int, input().split()))
print("enter the values of corresponding parameters: ")
for i in range(n):
y[i][0] = float(input())
value = int(input("enter the value to interpolate: "))
u = (value - x[0]) / (x[1] - x[0])
# for calculating forward difference table
for i in range(1, n):
for j in range(n - i):
y[j][i] = y[j + 1][i - 1] - y[j][i - 1]
summ = y[0][0]
for i in range(1, n):
summ += (ucal(u, i) * y[0][i]) / math.factorial(i)
print(f"the value at {value} is {summ}")
if __name__ == "__main__":
main()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | # Check whether Graph is Bipartite or Not using BFS
# A Bipartite Graph is a graph whose vertices can be divided into two independent sets,
# U and V such that every edge (u, v) either connects a vertex from U to V or a vertex
# from V to U. In other words, for every edge (u, v), either u belongs to U and v to V,
# or u belongs to V and v to U. We can also say that there is no edge that connects
# vertices of same set.
def checkBipartite(graph):
queue = []
visited = [False] * len(graph)
color = [-1] * len(graph)
def bfs():
while queue:
u = queue.pop(0)
visited[u] = True
for neighbour in graph[u]:
if neighbour == u:
return False
if color[neighbour] == -1:
color[neighbour] = 1 - color[u]
queue.append(neighbour)
elif color[neighbour] == color[u]:
return False
return True
for i in range(len(graph)):
if not visited[i]:
queue.append(i)
color[i] = 0
if bfs() is False:
return False
return True
if __name__ == "__main__":
# Adjacency List of graph
print(checkBipartite({0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2]}))
| # Check whether Graph is Bipartite or Not using BFS
# A Bipartite Graph is a graph whose vertices can be divided into two independent sets,
# U and V such that every edge (u, v) either connects a vertex from U to V or a vertex
# from V to U. In other words, for every edge (u, v), either u belongs to U and v to V,
# or u belongs to V and v to U. We can also say that there is no edge that connects
# vertices of same set.
def checkBipartite(graph):
queue = []
visited = [False] * len(graph)
color = [-1] * len(graph)
def bfs():
while queue:
u = queue.pop(0)
visited[u] = True
for neighbour in graph[u]:
if neighbour == u:
return False
if color[neighbour] == -1:
color[neighbour] = 1 - color[u]
queue.append(neighbour)
elif color[neighbour] == color[u]:
return False
return True
for i in range(len(graph)):
if not visited[i]:
queue.append(i)
color[i] = 0
if bfs() is False:
return False
return True
if __name__ == "__main__":
# Adjacency List of graph
print(checkBipartite({0: [1, 3], 1: [0, 2], 2: [1, 3], 3: [0, 2]}))
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | from __future__ import annotations
class Node:
"""
A Node has data variable and pointers to Nodes to its left and right.
"""
def __init__(self, data: int) -> None:
self.data = data
self.left: Node | None = None
self.right: Node | None = None
def display(tree: Node | None) -> None: # In Order traversal of the tree
"""
>>> root = Node(1)
>>> root.left = Node(0)
>>> root.right = Node(2)
>>> display(root)
0
1
2
>>> display(root.right)
2
"""
if tree:
display(tree.left)
print(tree.data)
display(tree.right)
def depth_of_tree(tree: Node | None) -> int:
"""
Recursive function that returns the depth of a binary tree.
>>> root = Node(0)
>>> depth_of_tree(root)
1
>>> root.left = Node(0)
>>> depth_of_tree(root)
2
>>> root.right = Node(0)
>>> depth_of_tree(root)
2
>>> root.left.right = Node(0)
>>> depth_of_tree(root)
3
>>> depth_of_tree(root.left)
2
"""
return 1 + max(depth_of_tree(tree.left), depth_of_tree(tree.right)) if tree else 0
def is_full_binary_tree(tree: Node) -> bool:
"""
Returns True if this is a full binary tree
>>> root = Node(0)
>>> is_full_binary_tree(root)
True
>>> root.left = Node(0)
>>> is_full_binary_tree(root)
False
>>> root.right = Node(0)
>>> is_full_binary_tree(root)
True
>>> root.left.left = Node(0)
>>> is_full_binary_tree(root)
False
>>> root.right.right = Node(0)
>>> is_full_binary_tree(root)
False
"""
if not tree:
return True
if tree.left and tree.right:
return is_full_binary_tree(tree.left) and is_full_binary_tree(tree.right)
else:
return not tree.left and not tree.right
def main() -> None: # Main function for testing.
tree = Node(1)
tree.left = Node(2)
tree.right = Node(3)
tree.left.left = Node(4)
tree.left.right = Node(5)
tree.left.right.left = Node(6)
tree.right.left = Node(7)
tree.right.left.left = Node(8)
tree.right.left.left.right = Node(9)
print(is_full_binary_tree(tree))
print(depth_of_tree(tree))
print("Tree is: ")
display(tree)
if __name__ == "__main__":
main()
| from __future__ import annotations
class Node:
"""
A Node has data variable and pointers to Nodes to its left and right.
"""
def __init__(self, data: int) -> None:
self.data = data
self.left: Node | None = None
self.right: Node | None = None
def display(tree: Node | None) -> None: # In Order traversal of the tree
"""
>>> root = Node(1)
>>> root.left = Node(0)
>>> root.right = Node(2)
>>> display(root)
0
1
2
>>> display(root.right)
2
"""
if tree:
display(tree.left)
print(tree.data)
display(tree.right)
def depth_of_tree(tree: Node | None) -> int:
"""
Recursive function that returns the depth of a binary tree.
>>> root = Node(0)
>>> depth_of_tree(root)
1
>>> root.left = Node(0)
>>> depth_of_tree(root)
2
>>> root.right = Node(0)
>>> depth_of_tree(root)
2
>>> root.left.right = Node(0)
>>> depth_of_tree(root)
3
>>> depth_of_tree(root.left)
2
"""
return 1 + max(depth_of_tree(tree.left), depth_of_tree(tree.right)) if tree else 0
def is_full_binary_tree(tree: Node) -> bool:
"""
Returns True if this is a full binary tree
>>> root = Node(0)
>>> is_full_binary_tree(root)
True
>>> root.left = Node(0)
>>> is_full_binary_tree(root)
False
>>> root.right = Node(0)
>>> is_full_binary_tree(root)
True
>>> root.left.left = Node(0)
>>> is_full_binary_tree(root)
False
>>> root.right.right = Node(0)
>>> is_full_binary_tree(root)
False
"""
if not tree:
return True
if tree.left and tree.right:
return is_full_binary_tree(tree.left) and is_full_binary_tree(tree.right)
else:
return not tree.left and not tree.right
def main() -> None: # Main function for testing.
tree = Node(1)
tree.left = Node(2)
tree.right = Node(3)
tree.left.left = Node(4)
tree.left.right = Node(5)
tree.left.right.left = Node(6)
tree.right.left = Node(7)
tree.right.left.left = Node(8)
tree.right.left.left.right = Node(9)
print(is_full_binary_tree(tree))
print(depth_of_tree(tree))
print("Tree is: ")
display(tree)
if __name__ == "__main__":
main()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
https://en.wikipedia.org/wiki/Breadth-first_search
pseudo-code:
breadth_first_search(graph G, start vertex s):
// all nodes initially unexplored
mark s as explored
let Q = queue data structure, initialized with s
while Q is non-empty:
remove the first node of Q, call it v
for each edge(v, w): // for w in graph[v]
if w unexplored:
mark w as explored
add w to Q (at the end)
"""
from __future__ import annotations
G = {
"A": ["B", "C"],
"B": ["A", "D", "E"],
"C": ["A", "F"],
"D": ["B"],
"E": ["B", "F"],
"F": ["C", "E"],
}
def breadth_first_search(graph: dict, start: str) -> set[str]:
"""
>>> ''.join(sorted(breadth_first_search(G, 'A')))
'ABCDEF'
"""
explored = {start}
queue = [start]
while queue:
v = queue.pop(0) # queue.popleft()
for w in graph[v]:
if w not in explored:
explored.add(w)
queue.append(w)
return explored
if __name__ == "__main__":
print(breadth_first_search(G, "A"))
| """
https://en.wikipedia.org/wiki/Breadth-first_search
pseudo-code:
breadth_first_search(graph G, start vertex s):
// all nodes initially unexplored
mark s as explored
let Q = queue data structure, initialized with s
while Q is non-empty:
remove the first node of Q, call it v
for each edge(v, w): // for w in graph[v]
if w unexplored:
mark w as explored
add w to Q (at the end)
"""
from __future__ import annotations
G = {
"A": ["B", "C"],
"B": ["A", "D", "E"],
"C": ["A", "F"],
"D": ["B"],
"E": ["B", "F"],
"F": ["C", "E"],
}
def breadth_first_search(graph: dict, start: str) -> set[str]:
"""
>>> ''.join(sorted(breadth_first_search(G, 'A')))
'ABCDEF'
"""
explored = {start}
queue = [start]
while queue:
v = queue.pop(0) # queue.popleft()
for w in graph[v]:
if w not in explored:
explored.add(w)
queue.append(w)
return explored
if __name__ == "__main__":
print(breadth_first_search(G, "A"))
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | from timeit import timeit
def sum_of_digits(n: int) -> int:
"""
Find the sum of digits of a number.
>>> sum_of_digits(12345)
15
>>> sum_of_digits(123)
6
>>> sum_of_digits(-123)
6
>>> sum_of_digits(0)
0
"""
n = -n if n < 0 else n
res = 0
while n > 0:
res += n % 10
n = n // 10
return res
def sum_of_digits_recursion(n: int) -> int:
"""
Find the sum of digits of a number using recursion
>>> sum_of_digits_recursion(12345)
15
>>> sum_of_digits_recursion(123)
6
>>> sum_of_digits_recursion(-123)
6
>>> sum_of_digits_recursion(0)
0
"""
n = -n if n < 0 else n
return n if n < 10 else n % 10 + sum_of_digits(n // 10)
def sum_of_digits_compact(n: int) -> int:
"""
Find the sum of digits of a number
>>> sum_of_digits_compact(12345)
15
>>> sum_of_digits_compact(123)
6
>>> sum_of_digits_compact(-123)
6
>>> sum_of_digits_compact(0)
0
"""
return sum(int(c) for c in str(abs(n)))
def benchmark() -> None:
"""
Benchmark code for comparing 3 functions,
with 3 different length int values.
"""
print("\nFor small_num = ", small_num, ":")
print(
"> sum_of_digits()",
"\t\tans =",
sum_of_digits(small_num),
"\ttime =",
timeit("z.sum_of_digits(z.small_num)", setup="import __main__ as z"),
"seconds",
)
print(
"> sum_of_digits_recursion()",
"\tans =",
sum_of_digits_recursion(small_num),
"\ttime =",
timeit("z.sum_of_digits_recursion(z.small_num)", setup="import __main__ as z"),
"seconds",
)
print(
"> sum_of_digits_compact()",
"\tans =",
sum_of_digits_compact(small_num),
"\ttime =",
timeit("z.sum_of_digits_compact(z.small_num)", setup="import __main__ as z"),
"seconds",
)
print("\nFor medium_num = ", medium_num, ":")
print(
"> sum_of_digits()",
"\t\tans =",
sum_of_digits(medium_num),
"\ttime =",
timeit("z.sum_of_digits(z.medium_num)", setup="import __main__ as z"),
"seconds",
)
print(
"> sum_of_digits_recursion()",
"\tans =",
sum_of_digits_recursion(medium_num),
"\ttime =",
timeit("z.sum_of_digits_recursion(z.medium_num)", setup="import __main__ as z"),
"seconds",
)
print(
"> sum_of_digits_compact()",
"\tans =",
sum_of_digits_compact(medium_num),
"\ttime =",
timeit("z.sum_of_digits_compact(z.medium_num)", setup="import __main__ as z"),
"seconds",
)
print("\nFor large_num = ", large_num, ":")
print(
"> sum_of_digits()",
"\t\tans =",
sum_of_digits(large_num),
"\ttime =",
timeit("z.sum_of_digits(z.large_num)", setup="import __main__ as z"),
"seconds",
)
print(
"> sum_of_digits_recursion()",
"\tans =",
sum_of_digits_recursion(large_num),
"\ttime =",
timeit("z.sum_of_digits_recursion(z.large_num)", setup="import __main__ as z"),
"seconds",
)
print(
"> sum_of_digits_compact()",
"\tans =",
sum_of_digits_compact(large_num),
"\ttime =",
timeit("z.sum_of_digits_compact(z.large_num)", setup="import __main__ as z"),
"seconds",
)
if __name__ == "__main__":
small_num = 262144
medium_num = 1125899906842624
large_num = 1267650600228229401496703205376
benchmark()
import doctest
doctest.testmod()
| from timeit import timeit
def sum_of_digits(n: int) -> int:
"""
Find the sum of digits of a number.
>>> sum_of_digits(12345)
15
>>> sum_of_digits(123)
6
>>> sum_of_digits(-123)
6
>>> sum_of_digits(0)
0
"""
n = -n if n < 0 else n
res = 0
while n > 0:
res += n % 10
n = n // 10
return res
def sum_of_digits_recursion(n: int) -> int:
"""
Find the sum of digits of a number using recursion
>>> sum_of_digits_recursion(12345)
15
>>> sum_of_digits_recursion(123)
6
>>> sum_of_digits_recursion(-123)
6
>>> sum_of_digits_recursion(0)
0
"""
n = -n if n < 0 else n
return n if n < 10 else n % 10 + sum_of_digits(n // 10)
def sum_of_digits_compact(n: int) -> int:
"""
Find the sum of digits of a number
>>> sum_of_digits_compact(12345)
15
>>> sum_of_digits_compact(123)
6
>>> sum_of_digits_compact(-123)
6
>>> sum_of_digits_compact(0)
0
"""
return sum(int(c) for c in str(abs(n)))
def benchmark() -> None:
"""
Benchmark code for comparing 3 functions,
with 3 different length int values.
"""
print("\nFor small_num = ", small_num, ":")
print(
"> sum_of_digits()",
"\t\tans =",
sum_of_digits(small_num),
"\ttime =",
timeit("z.sum_of_digits(z.small_num)", setup="import __main__ as z"),
"seconds",
)
print(
"> sum_of_digits_recursion()",
"\tans =",
sum_of_digits_recursion(small_num),
"\ttime =",
timeit("z.sum_of_digits_recursion(z.small_num)", setup="import __main__ as z"),
"seconds",
)
print(
"> sum_of_digits_compact()",
"\tans =",
sum_of_digits_compact(small_num),
"\ttime =",
timeit("z.sum_of_digits_compact(z.small_num)", setup="import __main__ as z"),
"seconds",
)
print("\nFor medium_num = ", medium_num, ":")
print(
"> sum_of_digits()",
"\t\tans =",
sum_of_digits(medium_num),
"\ttime =",
timeit("z.sum_of_digits(z.medium_num)", setup="import __main__ as z"),
"seconds",
)
print(
"> sum_of_digits_recursion()",
"\tans =",
sum_of_digits_recursion(medium_num),
"\ttime =",
timeit("z.sum_of_digits_recursion(z.medium_num)", setup="import __main__ as z"),
"seconds",
)
print(
"> sum_of_digits_compact()",
"\tans =",
sum_of_digits_compact(medium_num),
"\ttime =",
timeit("z.sum_of_digits_compact(z.medium_num)", setup="import __main__ as z"),
"seconds",
)
print("\nFor large_num = ", large_num, ":")
print(
"> sum_of_digits()",
"\t\tans =",
sum_of_digits(large_num),
"\ttime =",
timeit("z.sum_of_digits(z.large_num)", setup="import __main__ as z"),
"seconds",
)
print(
"> sum_of_digits_recursion()",
"\tans =",
sum_of_digits_recursion(large_num),
"\ttime =",
timeit("z.sum_of_digits_recursion(z.large_num)", setup="import __main__ as z"),
"seconds",
)
print(
"> sum_of_digits_compact()",
"\tans =",
sum_of_digits_compact(large_num),
"\ttime =",
timeit("z.sum_of_digits_compact(z.large_num)", setup="import __main__ as z"),
"seconds",
)
if __name__ == "__main__":
small_num = 262144
medium_num = 1125899906842624
large_num = 1267650600228229401496703205376
benchmark()
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | -1 |
||
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | import bs4
import requests
def get_movie_data_from_soup(soup: bs4.element.ResultSet) -> dict[str, str]:
return {
"name": soup.h3.a.text,
"genre": soup.find("span", class_="genre").text.strip(),
"rating": soup.strong.text,
"page_link": f"https://www.imdb.com{soup.a.get('href')}",
}
def get_imdb_top_movies(num_movies: int = 5) -> tuple:
"""Get the top num_movies most highly rated movies from IMDB and
return a tuple of dicts describing each movie's name, genre, rating, and URL.
Args:
num_movies: The number of movies to get. Defaults to 5.
Returns:
A list of tuples containing information about the top n movies.
>>> len(get_imdb_top_movies(5))
5
>>> len(get_imdb_top_movies(-3))
0
>>> len(get_imdb_top_movies(4.99999))
4
"""
num_movies = int(float(num_movies))
if num_movies < 1:
return ()
base_url = (
"https://www.imdb.com/search/title?title_type="
f"feature&sort=num_votes,desc&count={num_movies}"
)
source = bs4.BeautifulSoup(requests.get(base_url).content, "html.parser")
return tuple(
get_movie_data_from_soup(movie)
for movie in source.find_all("div", class_="lister-item mode-advanced")
)
if __name__ == "__main__":
import json
num_movies = int(input("How many movies would you like to see? "))
print(
", ".join(
json.dumps(movie, indent=4) for movie in get_imdb_top_movies(num_movies)
)
)
| import bs4
import requests
def get_movie_data_from_soup(soup: bs4.element.ResultSet) -> dict[str, str]:
return {
"name": soup.h3.a.text,
"genre": soup.find("span", class_="genre").text.strip(),
"rating": soup.strong.text,
"page_link": f"https://www.imdb.com{soup.a.get('href')}",
}
def get_imdb_top_movies(num_movies: int = 5) -> tuple:
"""Get the top num_movies most highly rated movies from IMDB and
return a tuple of dicts describing each movie's name, genre, rating, and URL.
Args:
num_movies: The number of movies to get. Defaults to 5.
Returns:
A list of tuples containing information about the top n movies.
>>> len(get_imdb_top_movies(5))
5
>>> len(get_imdb_top_movies(-3))
0
>>> len(get_imdb_top_movies(4.99999))
4
"""
num_movies = int(float(num_movies))
if num_movies < 1:
return ()
base_url = (
"https://www.imdb.com/search/title?title_type="
f"feature&sort=num_votes,desc&count={num_movies}"
)
source = bs4.BeautifulSoup(requests.get(base_url).content, "html.parser")
return tuple(
get_movie_data_from_soup(movie)
for movie in source.find_all("div", class_="lister-item mode-advanced")
)
if __name__ == "__main__":
import json
num_movies = int(input("How many movies would you like to see? "))
print(
", ".join(
json.dumps(movie, indent=4) for movie in get_imdb_top_movies(num_movies)
)
)
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | -1 |
||
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Project Euler Problem 9: https://projecteuler.net/problem=9
Special Pythagorean triplet
A Pythagorean triplet is a set of three natural numbers, a < b < c, for which,
a^2 + b^2 = c^2
For example, 3^2 + 4^2 = 9 + 16 = 25 = 5^2.
There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product a*b*c.
References:
- https://en.wikipedia.org/wiki/Pythagorean_triple
"""
def solution() -> int:
"""
Returns the product of a,b,c which are Pythagorean Triplet that satisfies
the following:
1. a**2 + b**2 = c**2
2. a + b + c = 1000
# The code below has been commented due to slow execution affecting Travis.
# >>> solution()
# 31875000
"""
return [
a * b * (1000 - a - b)
for a in range(1, 999)
for b in range(a, 999)
if (a * a + b * b == (1000 - a - b) ** 2)
][0]
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler Problem 9: https://projecteuler.net/problem=9
Special Pythagorean triplet
A Pythagorean triplet is a set of three natural numbers, a < b < c, for which,
a^2 + b^2 = c^2
For example, 3^2 + 4^2 = 9 + 16 = 25 = 5^2.
There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product a*b*c.
References:
- https://en.wikipedia.org/wiki/Pythagorean_triple
"""
def solution() -> int:
"""
Returns the product of a,b,c which are Pythagorean Triplet that satisfies
the following:
1. a**2 + b**2 = c**2
2. a + b + c = 1000
# The code below has been commented due to slow execution affecting Travis.
# >>> solution()
# 31875000
"""
return [
a * b * (1000 - a - b)
for a in range(1, 999)
for b in range(a, 999)
if (a * a + b * b == (1000 - a - b) ** 2)
][0]
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | def oct_to_decimal(oct_string: str) -> int:
"""
Convert a octal value to its decimal equivalent
>>> oct_to_decimal("12")
10
>>> oct_to_decimal(" 12 ")
10
>>> oct_to_decimal("-45")
-37
>>> oct_to_decimal("2-0Fm")
Traceback (most recent call last):
...
ValueError: Non-octal value was passed to the function
>>> oct_to_decimal("")
Traceback (most recent call last):
...
ValueError: Empty string was passed to the function
>>> oct_to_decimal("19")
Traceback (most recent call last):
...
ValueError: Non-octal value was passed to the function
"""
oct_string = str(oct_string).strip()
if not oct_string:
raise ValueError("Empty string was passed to the function")
is_negative = oct_string[0] == "-"
if is_negative:
oct_string = oct_string[1:]
if not oct_string.isdigit() or not all(0 <= int(char) <= 7 for char in oct_string):
raise ValueError("Non-octal value was passed to the function")
decimal_number = 0
for char in oct_string:
decimal_number = 8 * decimal_number + int(char)
if is_negative:
decimal_number = -decimal_number
return decimal_number
if __name__ == "__main__":
from doctest import testmod
testmod()
| def oct_to_decimal(oct_string: str) -> int:
"""
Convert a octal value to its decimal equivalent
>>> oct_to_decimal("12")
10
>>> oct_to_decimal(" 12 ")
10
>>> oct_to_decimal("-45")
-37
>>> oct_to_decimal("2-0Fm")
Traceback (most recent call last):
...
ValueError: Non-octal value was passed to the function
>>> oct_to_decimal("")
Traceback (most recent call last):
...
ValueError: Empty string was passed to the function
>>> oct_to_decimal("19")
Traceback (most recent call last):
...
ValueError: Non-octal value was passed to the function
"""
oct_string = str(oct_string).strip()
if not oct_string:
raise ValueError("Empty string was passed to the function")
is_negative = oct_string[0] == "-"
if is_negative:
oct_string = oct_string[1:]
if not oct_string.isdigit() or not all(0 <= int(char) <= 7 for char in oct_string):
raise ValueError("Non-octal value was passed to the function")
decimal_number = 0
for char in oct_string:
decimal_number = 8 * decimal_number + int(char)
if is_negative:
decimal_number = -decimal_number
return decimal_number
if __name__ == "__main__":
from doctest import testmod
testmod()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | #
| #
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
https://en.wikipedia.org/wiki/Bidirectional_search
"""
from __future__ import annotations
import time
Path = list[tuple[int, int]]
grid = [
[0, 0, 0, 0, 0, 0, 0],
[0, 1, 0, 0, 0, 0, 0], # 0 are free path whereas 1's are obstacles
[0, 0, 0, 0, 0, 0, 0],
[0, 0, 1, 0, 0, 0, 0],
[1, 0, 1, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 1, 0, 0],
]
delta = [[-1, 0], [0, -1], [1, 0], [0, 1]] # up, left, down, right
class Node:
def __init__(
self, pos_x: int, pos_y: int, goal_x: int, goal_y: int, parent: Node | None
):
self.pos_x = pos_x
self.pos_y = pos_y
self.pos = (pos_y, pos_x)
self.goal_x = goal_x
self.goal_y = goal_y
self.parent = parent
class BreadthFirstSearch:
"""
>>> bfs = BreadthFirstSearch((0, 0), (len(grid) - 1, len(grid[0]) - 1))
>>> (bfs.start.pos_y + delta[3][0], bfs.start.pos_x + delta[3][1])
(0, 1)
>>> [x.pos for x in bfs.get_successors(bfs.start)]
[(1, 0), (0, 1)]
>>> (bfs.start.pos_y + delta[2][0], bfs.start.pos_x + delta[2][1])
(1, 0)
>>> bfs.retrace_path(bfs.start)
[(0, 0)]
>>> bfs.search() # doctest: +NORMALIZE_WHITESPACE
[(0, 0), (1, 0), (2, 0), (3, 0), (3, 1), (4, 1),
(5, 1), (5, 2), (5, 3), (5, 4), (5, 5), (6, 5), (6, 6)]
"""
def __init__(self, start: tuple[int, int], goal: tuple[int, int]):
self.start = Node(start[1], start[0], goal[1], goal[0], None)
self.target = Node(goal[1], goal[0], goal[1], goal[0], None)
self.node_queue = [self.start]
self.reached = False
def search(self) -> Path | None:
while self.node_queue:
current_node = self.node_queue.pop(0)
if current_node.pos == self.target.pos:
self.reached = True
return self.retrace_path(current_node)
successors = self.get_successors(current_node)
for node in successors:
self.node_queue.append(node)
if not self.reached:
return [self.start.pos]
return None
def get_successors(self, parent: Node) -> list[Node]:
"""
Returns a list of successors (both in the grid and free spaces)
"""
successors = []
for action in delta:
pos_x = parent.pos_x + action[1]
pos_y = parent.pos_y + action[0]
if not (0 <= pos_x <= len(grid[0]) - 1 and 0 <= pos_y <= len(grid) - 1):
continue
if grid[pos_y][pos_x] != 0:
continue
successors.append(
Node(pos_x, pos_y, self.target.pos_y, self.target.pos_x, parent)
)
return successors
def retrace_path(self, node: Node | None) -> Path:
"""
Retrace the path from parents to parents until start node
"""
current_node = node
path = []
while current_node is not None:
path.append((current_node.pos_y, current_node.pos_x))
current_node = current_node.parent
path.reverse()
return path
class BidirectionalBreadthFirstSearch:
"""
>>> bd_bfs = BidirectionalBreadthFirstSearch((0, 0), (len(grid) - 1,
... len(grid[0]) - 1))
>>> bd_bfs.fwd_bfs.start.pos == bd_bfs.bwd_bfs.target.pos
True
>>> bd_bfs.retrace_bidirectional_path(bd_bfs.fwd_bfs.start,
... bd_bfs.bwd_bfs.start)
[(0, 0)]
>>> bd_bfs.search() # doctest: +NORMALIZE_WHITESPACE
[(0, 0), (0, 1), (0, 2), (1, 2), (2, 2), (2, 3),
(2, 4), (3, 4), (3, 5), (3, 6), (4, 6), (5, 6), (6, 6)]
"""
def __init__(self, start, goal):
self.fwd_bfs = BreadthFirstSearch(start, goal)
self.bwd_bfs = BreadthFirstSearch(goal, start)
self.reached = False
def search(self) -> Path | None:
while self.fwd_bfs.node_queue or self.bwd_bfs.node_queue:
current_fwd_node = self.fwd_bfs.node_queue.pop(0)
current_bwd_node = self.bwd_bfs.node_queue.pop(0)
if current_bwd_node.pos == current_fwd_node.pos:
self.reached = True
return self.retrace_bidirectional_path(
current_fwd_node, current_bwd_node
)
self.fwd_bfs.target = current_bwd_node
self.bwd_bfs.target = current_fwd_node
successors = {
self.fwd_bfs: self.fwd_bfs.get_successors(current_fwd_node),
self.bwd_bfs: self.bwd_bfs.get_successors(current_bwd_node),
}
for bfs in [self.fwd_bfs, self.bwd_bfs]:
for node in successors[bfs]:
bfs.node_queue.append(node)
if not self.reached:
return [self.fwd_bfs.start.pos]
return None
def retrace_bidirectional_path(self, fwd_node: Node, bwd_node: Node) -> Path:
fwd_path = self.fwd_bfs.retrace_path(fwd_node)
bwd_path = self.bwd_bfs.retrace_path(bwd_node)
bwd_path.pop()
bwd_path.reverse()
path = fwd_path + bwd_path
return path
if __name__ == "__main__":
# all coordinates are given in format [y,x]
import doctest
doctest.testmod()
init = (0, 0)
goal = (len(grid) - 1, len(grid[0]) - 1)
for elem in grid:
print(elem)
start_bfs_time = time.time()
bfs = BreadthFirstSearch(init, goal)
path = bfs.search()
bfs_time = time.time() - start_bfs_time
print("Unidirectional BFS computation time : ", bfs_time)
start_bd_bfs_time = time.time()
bd_bfs = BidirectionalBreadthFirstSearch(init, goal)
bd_path = bd_bfs.search()
bd_bfs_time = time.time() - start_bd_bfs_time
print("Bidirectional BFS computation time : ", bd_bfs_time)
| """
https://en.wikipedia.org/wiki/Bidirectional_search
"""
from __future__ import annotations
import time
Path = list[tuple[int, int]]
grid = [
[0, 0, 0, 0, 0, 0, 0],
[0, 1, 0, 0, 0, 0, 0], # 0 are free path whereas 1's are obstacles
[0, 0, 0, 0, 0, 0, 0],
[0, 0, 1, 0, 0, 0, 0],
[1, 0, 1, 0, 0, 0, 0],
[0, 0, 0, 0, 0, 0, 0],
[0, 0, 0, 0, 1, 0, 0],
]
delta = [[-1, 0], [0, -1], [1, 0], [0, 1]] # up, left, down, right
class Node:
def __init__(
self, pos_x: int, pos_y: int, goal_x: int, goal_y: int, parent: Node | None
):
self.pos_x = pos_x
self.pos_y = pos_y
self.pos = (pos_y, pos_x)
self.goal_x = goal_x
self.goal_y = goal_y
self.parent = parent
class BreadthFirstSearch:
"""
>>> bfs = BreadthFirstSearch((0, 0), (len(grid) - 1, len(grid[0]) - 1))
>>> (bfs.start.pos_y + delta[3][0], bfs.start.pos_x + delta[3][1])
(0, 1)
>>> [x.pos for x in bfs.get_successors(bfs.start)]
[(1, 0), (0, 1)]
>>> (bfs.start.pos_y + delta[2][0], bfs.start.pos_x + delta[2][1])
(1, 0)
>>> bfs.retrace_path(bfs.start)
[(0, 0)]
>>> bfs.search() # doctest: +NORMALIZE_WHITESPACE
[(0, 0), (1, 0), (2, 0), (3, 0), (3, 1), (4, 1),
(5, 1), (5, 2), (5, 3), (5, 4), (5, 5), (6, 5), (6, 6)]
"""
def __init__(self, start: tuple[int, int], goal: tuple[int, int]):
self.start = Node(start[1], start[0], goal[1], goal[0], None)
self.target = Node(goal[1], goal[0], goal[1], goal[0], None)
self.node_queue = [self.start]
self.reached = False
def search(self) -> Path | None:
while self.node_queue:
current_node = self.node_queue.pop(0)
if current_node.pos == self.target.pos:
self.reached = True
return self.retrace_path(current_node)
successors = self.get_successors(current_node)
for node in successors:
self.node_queue.append(node)
if not self.reached:
return [self.start.pos]
return None
def get_successors(self, parent: Node) -> list[Node]:
"""
Returns a list of successors (both in the grid and free spaces)
"""
successors = []
for action in delta:
pos_x = parent.pos_x + action[1]
pos_y = parent.pos_y + action[0]
if not (0 <= pos_x <= len(grid[0]) - 1 and 0 <= pos_y <= len(grid) - 1):
continue
if grid[pos_y][pos_x] != 0:
continue
successors.append(
Node(pos_x, pos_y, self.target.pos_y, self.target.pos_x, parent)
)
return successors
def retrace_path(self, node: Node | None) -> Path:
"""
Retrace the path from parents to parents until start node
"""
current_node = node
path = []
while current_node is not None:
path.append((current_node.pos_y, current_node.pos_x))
current_node = current_node.parent
path.reverse()
return path
class BidirectionalBreadthFirstSearch:
"""
>>> bd_bfs = BidirectionalBreadthFirstSearch((0, 0), (len(grid) - 1,
... len(grid[0]) - 1))
>>> bd_bfs.fwd_bfs.start.pos == bd_bfs.bwd_bfs.target.pos
True
>>> bd_bfs.retrace_bidirectional_path(bd_bfs.fwd_bfs.start,
... bd_bfs.bwd_bfs.start)
[(0, 0)]
>>> bd_bfs.search() # doctest: +NORMALIZE_WHITESPACE
[(0, 0), (0, 1), (0, 2), (1, 2), (2, 2), (2, 3),
(2, 4), (3, 4), (3, 5), (3, 6), (4, 6), (5, 6), (6, 6)]
"""
def __init__(self, start, goal):
self.fwd_bfs = BreadthFirstSearch(start, goal)
self.bwd_bfs = BreadthFirstSearch(goal, start)
self.reached = False
def search(self) -> Path | None:
while self.fwd_bfs.node_queue or self.bwd_bfs.node_queue:
current_fwd_node = self.fwd_bfs.node_queue.pop(0)
current_bwd_node = self.bwd_bfs.node_queue.pop(0)
if current_bwd_node.pos == current_fwd_node.pos:
self.reached = True
return self.retrace_bidirectional_path(
current_fwd_node, current_bwd_node
)
self.fwd_bfs.target = current_bwd_node
self.bwd_bfs.target = current_fwd_node
successors = {
self.fwd_bfs: self.fwd_bfs.get_successors(current_fwd_node),
self.bwd_bfs: self.bwd_bfs.get_successors(current_bwd_node),
}
for bfs in [self.fwd_bfs, self.bwd_bfs]:
for node in successors[bfs]:
bfs.node_queue.append(node)
if not self.reached:
return [self.fwd_bfs.start.pos]
return None
def retrace_bidirectional_path(self, fwd_node: Node, bwd_node: Node) -> Path:
fwd_path = self.fwd_bfs.retrace_path(fwd_node)
bwd_path = self.bwd_bfs.retrace_path(bwd_node)
bwd_path.pop()
bwd_path.reverse()
path = fwd_path + bwd_path
return path
if __name__ == "__main__":
# all coordinates are given in format [y,x]
import doctest
doctest.testmod()
init = (0, 0)
goal = (len(grid) - 1, len(grid[0]) - 1)
for elem in grid:
print(elem)
start_bfs_time = time.time()
bfs = BreadthFirstSearch(init, goal)
path = bfs.search()
bfs_time = time.time() - start_bfs_time
print("Unidirectional BFS computation time : ", bfs_time)
start_bd_bfs_time = time.time()
bd_bfs = BidirectionalBreadthFirstSearch(init, goal)
bd_path = bd_bfs.search()
bd_bfs_time = time.time() - start_bd_bfs_time
print("Bidirectional BFS computation time : ", bd_bfs_time)
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | from typing import Any
class Node:
def __init__(self, data: Any):
"""
Create and initialize Node class instance.
>>> Node(20)
Node(20)
>>> Node("Hello, world!")
Node(Hello, world!)
>>> Node(None)
Node(None)
>>> Node(True)
Node(True)
"""
self.data = data
self.next = None
def __repr__(self) -> str:
"""
Get the string representation of this node.
>>> Node(10).__repr__()
'Node(10)'
"""
return f"Node({self.data})"
class LinkedList:
def __init__(self):
"""
Create and initialize LinkedList class instance.
>>> linked_list = LinkedList()
"""
self.head = None
def __iter__(self) -> Any:
"""
This function is intended for iterators to access
and iterate through data inside linked list.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("tail")
>>> linked_list.insert_tail("tail_1")
>>> linked_list.insert_tail("tail_2")
>>> for node in linked_list: # __iter__ used here.
... node
'tail'
'tail_1'
'tail_2'
"""
node = self.head
while node:
yield node.data
node = node.next
def __len__(self) -> int:
"""
Return length of linked list i.e. number of nodes
>>> linked_list = LinkedList()
>>> len(linked_list)
0
>>> linked_list.insert_tail("tail")
>>> len(linked_list)
1
>>> linked_list.insert_head("head")
>>> len(linked_list)
2
>>> _ = linked_list.delete_tail()
>>> len(linked_list)
1
>>> _ = linked_list.delete_head()
>>> len(linked_list)
0
"""
return len(tuple(iter(self)))
def __repr__(self) -> str:
"""
String representation/visualization of a Linked Lists
>>> linked_list = LinkedList()
>>> linked_list.insert_tail(1)
>>> linked_list.insert_tail(3)
>>> linked_list.__repr__()
'1->3'
"""
return "->".join([str(item) for item in self])
def __getitem__(self, index: int) -> Any:
"""
Indexing Support. Used to get a node at particular position
>>> linked_list = LinkedList()
>>> for i in range(0, 10):
... linked_list.insert_nth(i, i)
>>> all(str(linked_list[i]) == str(i) for i in range(0, 10))
True
>>> linked_list[-10]
Traceback (most recent call last):
...
ValueError: list index out of range.
>>> linked_list[len(linked_list)]
Traceback (most recent call last):
...
ValueError: list index out of range.
"""
if not 0 <= index < len(self):
raise ValueError("list index out of range.")
for i, node in enumerate(self):
if i == index:
return node
# Used to change the data of a particular node
def __setitem__(self, index: int, data: Any) -> None:
"""
>>> linked_list = LinkedList()
>>> for i in range(0, 10):
... linked_list.insert_nth(i, i)
>>> linked_list[0] = 666
>>> linked_list[0]
666
>>> linked_list[5] = -666
>>> linked_list[5]
-666
>>> linked_list[-10] = 666
Traceback (most recent call last):
...
ValueError: list index out of range.
>>> linked_list[len(linked_list)] = 666
Traceback (most recent call last):
...
ValueError: list index out of range.
"""
if not 0 <= index < len(self):
raise ValueError("list index out of range.")
current = self.head
for i in range(index):
current = current.next
current.data = data
def insert_tail(self, data: Any) -> None:
"""
Insert data to the end of linked list.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("tail")
>>> linked_list
tail
>>> linked_list.insert_tail("tail_2")
>>> linked_list
tail->tail_2
>>> linked_list.insert_tail("tail_3")
>>> linked_list
tail->tail_2->tail_3
"""
self.insert_nth(len(self), data)
def insert_head(self, data: Any) -> None:
"""
Insert data to the beginning of linked list.
>>> linked_list = LinkedList()
>>> linked_list.insert_head("head")
>>> linked_list
head
>>> linked_list.insert_head("head_2")
>>> linked_list
head_2->head
>>> linked_list.insert_head("head_3")
>>> linked_list
head_3->head_2->head
"""
self.insert_nth(0, data)
def insert_nth(self, index: int, data: Any) -> None:
"""
Insert data at given index.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("first")
>>> linked_list.insert_tail("second")
>>> linked_list.insert_tail("third")
>>> linked_list
first->second->third
>>> linked_list.insert_nth(1, "fourth")
>>> linked_list
first->fourth->second->third
>>> linked_list.insert_nth(3, "fifth")
>>> linked_list
first->fourth->second->fifth->third
"""
if not 0 <= index <= len(self):
raise IndexError("list index out of range")
new_node = Node(data)
if self.head is None:
self.head = new_node
elif index == 0:
new_node.next = self.head # link new_node to head
self.head = new_node
else:
temp = self.head
for _ in range(index - 1):
temp = temp.next
new_node.next = temp.next
temp.next = new_node
def print_list(self) -> None: # print every node data
"""
This method prints every node data.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("first")
>>> linked_list.insert_tail("second")
>>> linked_list.insert_tail("third")
>>> linked_list
first->second->third
"""
print(self)
def delete_head(self) -> Any:
"""
Delete the first node and return the
node's data.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("first")
>>> linked_list.insert_tail("second")
>>> linked_list.insert_tail("third")
>>> linked_list
first->second->third
>>> linked_list.delete_head()
'first'
>>> linked_list
second->third
>>> linked_list.delete_head()
'second'
>>> linked_list
third
>>> linked_list.delete_head()
'third'
>>> linked_list.delete_head()
Traceback (most recent call last):
...
IndexError: List index out of range.
"""
return self.delete_nth(0)
def delete_tail(self) -> Any: # delete from tail
"""
Delete the tail end node and return the
node's data.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("first")
>>> linked_list.insert_tail("second")
>>> linked_list.insert_tail("third")
>>> linked_list
first->second->third
>>> linked_list.delete_tail()
'third'
>>> linked_list
first->second
>>> linked_list.delete_tail()
'second'
>>> linked_list
first
>>> linked_list.delete_tail()
'first'
>>> linked_list.delete_tail()
Traceback (most recent call last):
...
IndexError: List index out of range.
"""
return self.delete_nth(len(self) - 1)
def delete_nth(self, index: int = 0) -> Any:
"""
Delete node at given index and return the
node's data.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("first")
>>> linked_list.insert_tail("second")
>>> linked_list.insert_tail("third")
>>> linked_list
first->second->third
>>> linked_list.delete_nth(1) # delete middle
'second'
>>> linked_list
first->third
>>> linked_list.delete_nth(5) # this raises error
Traceback (most recent call last):
...
IndexError: List index out of range.
>>> linked_list.delete_nth(-1) # this also raises error
Traceback (most recent call last):
...
IndexError: List index out of range.
"""
if not 0 <= index <= len(self) - 1: # test if index is valid
raise IndexError("List index out of range.")
delete_node = self.head # default first node
if index == 0:
self.head = self.head.next
else:
temp = self.head
for _ in range(index - 1):
temp = temp.next
delete_node = temp.next
temp.next = temp.next.next
return delete_node.data
def is_empty(self) -> bool:
"""
Check if linked list is empty.
>>> linked_list = LinkedList()
>>> linked_list.is_empty()
True
>>> linked_list.insert_head("first")
>>> linked_list.is_empty()
False
"""
return self.head is None
def reverse(self) -> None:
"""
This reverses the linked list order.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("first")
>>> linked_list.insert_tail("second")
>>> linked_list.insert_tail("third")
>>> linked_list
first->second->third
>>> linked_list.reverse()
>>> linked_list
third->second->first
"""
prev = None
current = self.head
while current:
# Store the current node's next node.
next_node = current.next
# Make the current node's next point backwards
current.next = prev
# Make the previous node be the current node
prev = current
# Make the current node the next node (to progress iteration)
current = next_node
# Return prev in order to put the head at the end
self.head = prev
def test_singly_linked_list() -> None:
"""
>>> test_singly_linked_list()
"""
linked_list = LinkedList()
assert linked_list.is_empty() is True
assert str(linked_list) == ""
try:
linked_list.delete_head()
assert False # This should not happen.
except IndexError:
assert True # This should happen.
try:
linked_list.delete_tail()
assert False # This should not happen.
except IndexError:
assert True # This should happen.
for i in range(10):
assert len(linked_list) == i
linked_list.insert_nth(i, i + 1)
assert str(linked_list) == "->".join(str(i) for i in range(1, 11))
linked_list.insert_head(0)
linked_list.insert_tail(11)
assert str(linked_list) == "->".join(str(i) for i in range(0, 12))
assert linked_list.delete_head() == 0
assert linked_list.delete_nth(9) == 10
assert linked_list.delete_tail() == 11
assert len(linked_list) == 9
assert str(linked_list) == "->".join(str(i) for i in range(1, 10))
assert all(linked_list[i] == i + 1 for i in range(0, 9)) is True
for i in range(0, 9):
linked_list[i] = -i
assert all(linked_list[i] == -i for i in range(0, 9)) is True
linked_list.reverse()
assert str(linked_list) == "->".join(str(i) for i in range(-8, 1))
def test_singly_linked_list_2() -> None:
"""
This section of the test used varying data types for input.
>>> test_singly_linked_list_2()
"""
input = [
-9,
100,
Node(77345112),
"dlrow olleH",
7,
5555,
0,
-192.55555,
"Hello, world!",
77.9,
Node(10),
None,
None,
12.20,
]
linked_list = LinkedList()
[linked_list.insert_tail(i) for i in input]
# Check if it's empty or not
assert linked_list.is_empty() is False
assert (
str(linked_list) == "-9->100->Node(77345112)->dlrow olleH->7->5555->0->"
"-192.55555->Hello, world!->77.9->Node(10)->None->None->12.2"
)
# Delete the head
result = linked_list.delete_head()
assert result == -9
assert (
str(linked_list) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
"Hello, world!->77.9->Node(10)->None->None->12.2"
)
# Delete the tail
result = linked_list.delete_tail()
assert result == 12.2
assert (
str(linked_list) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
"Hello, world!->77.9->Node(10)->None->None"
)
# Delete a node in specific location in linked list
result = linked_list.delete_nth(10)
assert result is None
assert (
str(linked_list) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
"Hello, world!->77.9->Node(10)->None"
)
# Add a Node instance to its head
linked_list.insert_head(Node("Hello again, world!"))
assert (
str(linked_list)
== "Node(Hello again, world!)->100->Node(77345112)->dlrow olleH->"
"7->5555->0->-192.55555->Hello, world!->77.9->Node(10)->None"
)
# Add None to its tail
linked_list.insert_tail(None)
assert (
str(linked_list)
== "Node(Hello again, world!)->100->Node(77345112)->dlrow olleH->"
"7->5555->0->-192.55555->Hello, world!->77.9->Node(10)->None->None"
)
# Reverse the linked list
linked_list.reverse()
assert (
str(linked_list)
== "None->None->Node(10)->77.9->Hello, world!->-192.55555->0->5555->"
"7->dlrow olleH->Node(77345112)->100->Node(Hello again, world!)"
)
def main():
from doctest import testmod
testmod()
linked_list = LinkedList()
linked_list.insert_head(input("Inserting 1st at head ").strip())
linked_list.insert_head(input("Inserting 2nd at head ").strip())
print("\nPrint list:")
linked_list.print_list()
linked_list.insert_tail(input("\nInserting 1st at tail ").strip())
linked_list.insert_tail(input("Inserting 2nd at tail ").strip())
print("\nPrint list:")
linked_list.print_list()
print("\nDelete head")
linked_list.delete_head()
print("Delete tail")
linked_list.delete_tail()
print("\nPrint list:")
linked_list.print_list()
print("\nReverse linked list")
linked_list.reverse()
print("\nPrint list:")
linked_list.print_list()
print("\nString representation of linked list:")
print(linked_list)
print("\nReading/changing Node data using indexing:")
print(f"Element at Position 1: {linked_list[1]}")
linked_list[1] = input("Enter New Value: ").strip()
print("New list:")
print(linked_list)
print(f"length of linked_list is : {len(linked_list)}")
if __name__ == "__main__":
main()
| from typing import Any
class Node:
def __init__(self, data: Any):
"""
Create and initialize Node class instance.
>>> Node(20)
Node(20)
>>> Node("Hello, world!")
Node(Hello, world!)
>>> Node(None)
Node(None)
>>> Node(True)
Node(True)
"""
self.data = data
self.next = None
def __repr__(self) -> str:
"""
Get the string representation of this node.
>>> Node(10).__repr__()
'Node(10)'
"""
return f"Node({self.data})"
class LinkedList:
def __init__(self):
"""
Create and initialize LinkedList class instance.
>>> linked_list = LinkedList()
"""
self.head = None
def __iter__(self) -> Any:
"""
This function is intended for iterators to access
and iterate through data inside linked list.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("tail")
>>> linked_list.insert_tail("tail_1")
>>> linked_list.insert_tail("tail_2")
>>> for node in linked_list: # __iter__ used here.
... node
'tail'
'tail_1'
'tail_2'
"""
node = self.head
while node:
yield node.data
node = node.next
def __len__(self) -> int:
"""
Return length of linked list i.e. number of nodes
>>> linked_list = LinkedList()
>>> len(linked_list)
0
>>> linked_list.insert_tail("tail")
>>> len(linked_list)
1
>>> linked_list.insert_head("head")
>>> len(linked_list)
2
>>> _ = linked_list.delete_tail()
>>> len(linked_list)
1
>>> _ = linked_list.delete_head()
>>> len(linked_list)
0
"""
return len(tuple(iter(self)))
def __repr__(self) -> str:
"""
String representation/visualization of a Linked Lists
>>> linked_list = LinkedList()
>>> linked_list.insert_tail(1)
>>> linked_list.insert_tail(3)
>>> linked_list.__repr__()
'1->3'
"""
return "->".join([str(item) for item in self])
def __getitem__(self, index: int) -> Any:
"""
Indexing Support. Used to get a node at particular position
>>> linked_list = LinkedList()
>>> for i in range(0, 10):
... linked_list.insert_nth(i, i)
>>> all(str(linked_list[i]) == str(i) for i in range(0, 10))
True
>>> linked_list[-10]
Traceback (most recent call last):
...
ValueError: list index out of range.
>>> linked_list[len(linked_list)]
Traceback (most recent call last):
...
ValueError: list index out of range.
"""
if not 0 <= index < len(self):
raise ValueError("list index out of range.")
for i, node in enumerate(self):
if i == index:
return node
# Used to change the data of a particular node
def __setitem__(self, index: int, data: Any) -> None:
"""
>>> linked_list = LinkedList()
>>> for i in range(0, 10):
... linked_list.insert_nth(i, i)
>>> linked_list[0] = 666
>>> linked_list[0]
666
>>> linked_list[5] = -666
>>> linked_list[5]
-666
>>> linked_list[-10] = 666
Traceback (most recent call last):
...
ValueError: list index out of range.
>>> linked_list[len(linked_list)] = 666
Traceback (most recent call last):
...
ValueError: list index out of range.
"""
if not 0 <= index < len(self):
raise ValueError("list index out of range.")
current = self.head
for i in range(index):
current = current.next
current.data = data
def insert_tail(self, data: Any) -> None:
"""
Insert data to the end of linked list.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("tail")
>>> linked_list
tail
>>> linked_list.insert_tail("tail_2")
>>> linked_list
tail->tail_2
>>> linked_list.insert_tail("tail_3")
>>> linked_list
tail->tail_2->tail_3
"""
self.insert_nth(len(self), data)
def insert_head(self, data: Any) -> None:
"""
Insert data to the beginning of linked list.
>>> linked_list = LinkedList()
>>> linked_list.insert_head("head")
>>> linked_list
head
>>> linked_list.insert_head("head_2")
>>> linked_list
head_2->head
>>> linked_list.insert_head("head_3")
>>> linked_list
head_3->head_2->head
"""
self.insert_nth(0, data)
def insert_nth(self, index: int, data: Any) -> None:
"""
Insert data at given index.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("first")
>>> linked_list.insert_tail("second")
>>> linked_list.insert_tail("third")
>>> linked_list
first->second->third
>>> linked_list.insert_nth(1, "fourth")
>>> linked_list
first->fourth->second->third
>>> linked_list.insert_nth(3, "fifth")
>>> linked_list
first->fourth->second->fifth->third
"""
if not 0 <= index <= len(self):
raise IndexError("list index out of range")
new_node = Node(data)
if self.head is None:
self.head = new_node
elif index == 0:
new_node.next = self.head # link new_node to head
self.head = new_node
else:
temp = self.head
for _ in range(index - 1):
temp = temp.next
new_node.next = temp.next
temp.next = new_node
def print_list(self) -> None: # print every node data
"""
This method prints every node data.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("first")
>>> linked_list.insert_tail("second")
>>> linked_list.insert_tail("third")
>>> linked_list
first->second->third
"""
print(self)
def delete_head(self) -> Any:
"""
Delete the first node and return the
node's data.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("first")
>>> linked_list.insert_tail("second")
>>> linked_list.insert_tail("third")
>>> linked_list
first->second->third
>>> linked_list.delete_head()
'first'
>>> linked_list
second->third
>>> linked_list.delete_head()
'second'
>>> linked_list
third
>>> linked_list.delete_head()
'third'
>>> linked_list.delete_head()
Traceback (most recent call last):
...
IndexError: List index out of range.
"""
return self.delete_nth(0)
def delete_tail(self) -> Any: # delete from tail
"""
Delete the tail end node and return the
node's data.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("first")
>>> linked_list.insert_tail("second")
>>> linked_list.insert_tail("third")
>>> linked_list
first->second->third
>>> linked_list.delete_tail()
'third'
>>> linked_list
first->second
>>> linked_list.delete_tail()
'second'
>>> linked_list
first
>>> linked_list.delete_tail()
'first'
>>> linked_list.delete_tail()
Traceback (most recent call last):
...
IndexError: List index out of range.
"""
return self.delete_nth(len(self) - 1)
def delete_nth(self, index: int = 0) -> Any:
"""
Delete node at given index and return the
node's data.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("first")
>>> linked_list.insert_tail("second")
>>> linked_list.insert_tail("third")
>>> linked_list
first->second->third
>>> linked_list.delete_nth(1) # delete middle
'second'
>>> linked_list
first->third
>>> linked_list.delete_nth(5) # this raises error
Traceback (most recent call last):
...
IndexError: List index out of range.
>>> linked_list.delete_nth(-1) # this also raises error
Traceback (most recent call last):
...
IndexError: List index out of range.
"""
if not 0 <= index <= len(self) - 1: # test if index is valid
raise IndexError("List index out of range.")
delete_node = self.head # default first node
if index == 0:
self.head = self.head.next
else:
temp = self.head
for _ in range(index - 1):
temp = temp.next
delete_node = temp.next
temp.next = temp.next.next
return delete_node.data
def is_empty(self) -> bool:
"""
Check if linked list is empty.
>>> linked_list = LinkedList()
>>> linked_list.is_empty()
True
>>> linked_list.insert_head("first")
>>> linked_list.is_empty()
False
"""
return self.head is None
def reverse(self) -> None:
"""
This reverses the linked list order.
>>> linked_list = LinkedList()
>>> linked_list.insert_tail("first")
>>> linked_list.insert_tail("second")
>>> linked_list.insert_tail("third")
>>> linked_list
first->second->third
>>> linked_list.reverse()
>>> linked_list
third->second->first
"""
prev = None
current = self.head
while current:
# Store the current node's next node.
next_node = current.next
# Make the current node's next point backwards
current.next = prev
# Make the previous node be the current node
prev = current
# Make the current node the next node (to progress iteration)
current = next_node
# Return prev in order to put the head at the end
self.head = prev
def test_singly_linked_list() -> None:
"""
>>> test_singly_linked_list()
"""
linked_list = LinkedList()
assert linked_list.is_empty() is True
assert str(linked_list) == ""
try:
linked_list.delete_head()
assert False # This should not happen.
except IndexError:
assert True # This should happen.
try:
linked_list.delete_tail()
assert False # This should not happen.
except IndexError:
assert True # This should happen.
for i in range(10):
assert len(linked_list) == i
linked_list.insert_nth(i, i + 1)
assert str(linked_list) == "->".join(str(i) for i in range(1, 11))
linked_list.insert_head(0)
linked_list.insert_tail(11)
assert str(linked_list) == "->".join(str(i) for i in range(0, 12))
assert linked_list.delete_head() == 0
assert linked_list.delete_nth(9) == 10
assert linked_list.delete_tail() == 11
assert len(linked_list) == 9
assert str(linked_list) == "->".join(str(i) for i in range(1, 10))
assert all(linked_list[i] == i + 1 for i in range(0, 9)) is True
for i in range(0, 9):
linked_list[i] = -i
assert all(linked_list[i] == -i for i in range(0, 9)) is True
linked_list.reverse()
assert str(linked_list) == "->".join(str(i) for i in range(-8, 1))
def test_singly_linked_list_2() -> None:
"""
This section of the test used varying data types for input.
>>> test_singly_linked_list_2()
"""
input = [
-9,
100,
Node(77345112),
"dlrow olleH",
7,
5555,
0,
-192.55555,
"Hello, world!",
77.9,
Node(10),
None,
None,
12.20,
]
linked_list = LinkedList()
[linked_list.insert_tail(i) for i in input]
# Check if it's empty or not
assert linked_list.is_empty() is False
assert (
str(linked_list) == "-9->100->Node(77345112)->dlrow olleH->7->5555->0->"
"-192.55555->Hello, world!->77.9->Node(10)->None->None->12.2"
)
# Delete the head
result = linked_list.delete_head()
assert result == -9
assert (
str(linked_list) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
"Hello, world!->77.9->Node(10)->None->None->12.2"
)
# Delete the tail
result = linked_list.delete_tail()
assert result == 12.2
assert (
str(linked_list) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
"Hello, world!->77.9->Node(10)->None->None"
)
# Delete a node in specific location in linked list
result = linked_list.delete_nth(10)
assert result is None
assert (
str(linked_list) == "100->Node(77345112)->dlrow olleH->7->5555->0->-192.55555->"
"Hello, world!->77.9->Node(10)->None"
)
# Add a Node instance to its head
linked_list.insert_head(Node("Hello again, world!"))
assert (
str(linked_list)
== "Node(Hello again, world!)->100->Node(77345112)->dlrow olleH->"
"7->5555->0->-192.55555->Hello, world!->77.9->Node(10)->None"
)
# Add None to its tail
linked_list.insert_tail(None)
assert (
str(linked_list)
== "Node(Hello again, world!)->100->Node(77345112)->dlrow olleH->"
"7->5555->0->-192.55555->Hello, world!->77.9->Node(10)->None->None"
)
# Reverse the linked list
linked_list.reverse()
assert (
str(linked_list)
== "None->None->Node(10)->77.9->Hello, world!->-192.55555->0->5555->"
"7->dlrow olleH->Node(77345112)->100->Node(Hello again, world!)"
)
def main():
from doctest import testmod
testmod()
linked_list = LinkedList()
linked_list.insert_head(input("Inserting 1st at head ").strip())
linked_list.insert_head(input("Inserting 2nd at head ").strip())
print("\nPrint list:")
linked_list.print_list()
linked_list.insert_tail(input("\nInserting 1st at tail ").strip())
linked_list.insert_tail(input("Inserting 2nd at tail ").strip())
print("\nPrint list:")
linked_list.print_list()
print("\nDelete head")
linked_list.delete_head()
print("Delete tail")
linked_list.delete_tail()
print("\nPrint list:")
linked_list.print_list()
print("\nReverse linked list")
linked_list.reverse()
print("\nPrint list:")
linked_list.print_list()
print("\nString representation of linked list:")
print(linked_list)
print("\nReading/changing Node data using indexing:")
print(f"Element at Position 1: {linked_list[1]}")
linked_list[1] = input("Enter New Value: ").strip()
print("New list:")
print(linked_list)
print(f"length of linked_list is : {len(linked_list)}")
if __name__ == "__main__":
main()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | -1 |
||
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Project Euler Problem 50: https://projecteuler.net/problem=50
Consecutive prime sum
The prime 41, can be written as the sum of six consecutive primes:
41 = 2 + 3 + 5 + 7 + 11 + 13
This is the longest sum of consecutive primes that adds to a prime below
one-hundred.
The longest sum of consecutive primes below one-thousand that adds to a prime,
contains 21 terms, and is equal to 953.
Which prime, below one-million, can be written as the sum of the most
consecutive primes?
"""
from __future__ import annotations
def prime_sieve(limit: int) -> list[int]:
"""
Sieve of Erotosthenes
Function to return all the prime numbers up to a number 'limit'
https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
>>> prime_sieve(3)
[2]
>>> prime_sieve(50)
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
"""
is_prime = [True] * limit
is_prime[0] = False
is_prime[1] = False
is_prime[2] = True
for i in range(3, int(limit ** 0.5 + 1), 2):
index = i * 2
while index < limit:
is_prime[index] = False
index = index + i
primes = [2]
for i in range(3, limit, 2):
if is_prime[i]:
primes.append(i)
return primes
def solution(ceiling: int = 1_000_000) -> int:
"""
Returns the biggest prime, below the celing, that can be written as the sum
of consecutive the most consecutive primes.
>>> solution(500)
499
>>> solution(1_000)
953
>>> solution(10_000)
9521
"""
primes = prime_sieve(ceiling)
length = 0
largest = 0
for i in range(len(primes)):
for j in range(i + length, len(primes)):
sol = sum(primes[i:j])
if sol >= ceiling:
break
if sol in primes:
length = j - i
largest = sol
return largest
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler Problem 50: https://projecteuler.net/problem=50
Consecutive prime sum
The prime 41, can be written as the sum of six consecutive primes:
41 = 2 + 3 + 5 + 7 + 11 + 13
This is the longest sum of consecutive primes that adds to a prime below
one-hundred.
The longest sum of consecutive primes below one-thousand that adds to a prime,
contains 21 terms, and is equal to 953.
Which prime, below one-million, can be written as the sum of the most
consecutive primes?
"""
from __future__ import annotations
def prime_sieve(limit: int) -> list[int]:
"""
Sieve of Erotosthenes
Function to return all the prime numbers up to a number 'limit'
https://en.wikipedia.org/wiki/Sieve_of_Eratosthenes
>>> prime_sieve(3)
[2]
>>> prime_sieve(50)
[2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]
"""
is_prime = [True] * limit
is_prime[0] = False
is_prime[1] = False
is_prime[2] = True
for i in range(3, int(limit ** 0.5 + 1), 2):
index = i * 2
while index < limit:
is_prime[index] = False
index = index + i
primes = [2]
for i in range(3, limit, 2):
if is_prime[i]:
primes.append(i)
return primes
def solution(ceiling: int = 1_000_000) -> int:
"""
Returns the biggest prime, below the celing, that can be written as the sum
of consecutive the most consecutive primes.
>>> solution(500)
499
>>> solution(1_000)
953
>>> solution(10_000)
9521
"""
primes = prime_sieve(ceiling)
length = 0
largest = 0
for i in range(len(primes)):
for j in range(i + length, len(primes)):
sol = sum(primes[i:j])
if sol >= ceiling:
break
if sol in primes:
length = j - i
largest = sol
return largest
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | #!/usr/local/bin/python3
"""
Problem Description: Given two binary tree, return the merged tree.
The rule for merging is that if two nodes overlap, then put the value sum of
both nodes to the new value of the merged node. Otherwise, the NOT null node
will be used as the node of new tree.
"""
from __future__ import annotations
class Node:
"""
A binary node has value variable and pointers to its left and right node.
"""
def __init__(self, value: int = 0) -> None:
self.value = value
self.left: Node | None = None
self.right: Node | None = None
def merge_two_binary_trees(tree1: Node | None, tree2: Node | None) -> Node:
"""
Returns root node of the merged tree.
>>> tree1 = Node(5)
>>> tree1.left = Node(6)
>>> tree1.right = Node(7)
>>> tree1.left.left = Node(2)
>>> tree2 = Node(4)
>>> tree2.left = Node(5)
>>> tree2.right = Node(8)
>>> tree2.left.right = Node(1)
>>> tree2.right.right = Node(4)
>>> merged_tree = merge_two_binary_trees(tree1, tree2)
>>> print_preorder(merged_tree)
9
11
2
1
15
4
"""
if tree1 is None:
return tree2
if tree2 is None:
return tree1
tree1.value = tree1.value + tree2.value
tree1.left = merge_two_binary_trees(tree1.left, tree2.left)
tree1.right = merge_two_binary_trees(tree1.right, tree2.right)
return tree1
def print_preorder(root: Node | None) -> None:
"""
Print pre-order traversal of the tree.
>>> root = Node(1)
>>> root.left = Node(2)
>>> root.right = Node(3)
>>> print_preorder(root)
1
2
3
>>> print_preorder(root.right)
3
"""
if root:
print(root.value)
print_preorder(root.left)
print_preorder(root.right)
if __name__ == "__main__":
tree1 = Node(1)
tree1.left = Node(2)
tree1.right = Node(3)
tree1.left.left = Node(4)
tree2 = Node(2)
tree2.left = Node(4)
tree2.right = Node(6)
tree2.left.right = Node(9)
tree2.right.right = Node(5)
print("Tree1 is: ")
print_preorder(tree1)
print("Tree2 is: ")
print_preorder(tree2)
merged_tree = merge_two_binary_trees(tree1, tree2)
print("Merged Tree is: ")
print_preorder(merged_tree)
| #!/usr/local/bin/python3
"""
Problem Description: Given two binary tree, return the merged tree.
The rule for merging is that if two nodes overlap, then put the value sum of
both nodes to the new value of the merged node. Otherwise, the NOT null node
will be used as the node of new tree.
"""
from __future__ import annotations
class Node:
"""
A binary node has value variable and pointers to its left and right node.
"""
def __init__(self, value: int = 0) -> None:
self.value = value
self.left: Node | None = None
self.right: Node | None = None
def merge_two_binary_trees(tree1: Node | None, tree2: Node | None) -> Node:
"""
Returns root node of the merged tree.
>>> tree1 = Node(5)
>>> tree1.left = Node(6)
>>> tree1.right = Node(7)
>>> tree1.left.left = Node(2)
>>> tree2 = Node(4)
>>> tree2.left = Node(5)
>>> tree2.right = Node(8)
>>> tree2.left.right = Node(1)
>>> tree2.right.right = Node(4)
>>> merged_tree = merge_two_binary_trees(tree1, tree2)
>>> print_preorder(merged_tree)
9
11
2
1
15
4
"""
if tree1 is None:
return tree2
if tree2 is None:
return tree1
tree1.value = tree1.value + tree2.value
tree1.left = merge_two_binary_trees(tree1.left, tree2.left)
tree1.right = merge_two_binary_trees(tree1.right, tree2.right)
return tree1
def print_preorder(root: Node | None) -> None:
"""
Print pre-order traversal of the tree.
>>> root = Node(1)
>>> root.left = Node(2)
>>> root.right = Node(3)
>>> print_preorder(root)
1
2
3
>>> print_preorder(root.right)
3
"""
if root:
print(root.value)
print_preorder(root.left)
print_preorder(root.right)
if __name__ == "__main__":
tree1 = Node(1)
tree1.left = Node(2)
tree1.right = Node(3)
tree1.left.left = Node(4)
tree2 = Node(2)
tree2.left = Node(4)
tree2.right = Node(6)
tree2.left.right = Node(9)
tree2.right.right = Node(5)
print("Tree1 is: ")
print_preorder(tree1)
print("Tree2 is: ")
print_preorder(tree2)
merged_tree = merge_two_binary_trees(tree1, tree2)
print("Merged Tree is: ")
print_preorder(merged_tree)
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Project Euler Problem 1: https://projecteuler.net/problem=1
Multiples of 3 and 5
If we list all the natural numbers below 10 that are multiples of 3 or 5,
we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.
"""
def solution(n: int = 1000) -> int:
"""
Returns the sum of all the multiples of 3 or 5 below n.
>>> solution(3)
0
>>> solution(4)
3
>>> solution(10)
23
>>> solution(600)
83700
"""
a = 3
result = 0
while a < n:
if a % 3 == 0 or a % 5 == 0:
result += a
elif a % 15 == 0:
result -= a
a += 1
return result
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler Problem 1: https://projecteuler.net/problem=1
Multiples of 3 and 5
If we list all the natural numbers below 10 that are multiples of 3 or 5,
we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.
"""
def solution(n: int = 1000) -> int:
"""
Returns the sum of all the multiples of 3 or 5 below n.
>>> solution(3)
0
>>> solution(4)
3
>>> solution(10)
23
>>> solution(600)
83700
"""
a = 3
result = 0
while a < n:
if a % 3 == 0 or a % 5 == 0:
result += a
elif a % 15 == 0:
result -= a
a += 1
return result
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
The 5-digit number, 16807=75, is also a fifth power. Similarly, the 9-digit number,
134217728=89, is a ninth power.
How many n-digit positive integers exist which are also an nth power?
"""
"""
The maximum base can be 9 because all n-digit numbers < 10^n.
Now 9**23 has 22 digits so the maximum power can be 22.
Using these conclusions, we will calculate the result.
"""
def solution(max_base: int = 10, max_power: int = 22) -> int:
"""
Returns the count of all n-digit numbers which are nth power
>>> solution(10, 22)
49
>>> solution(0, 0)
0
>>> solution(1, 1)
0
>>> solution(-1, -1)
0
"""
bases = range(1, max_base)
powers = range(1, max_power)
return sum(
1 for power in powers for base in bases if len(str(base ** power)) == power
)
if __name__ == "__main__":
print(f"{solution(10, 22) = }")
| """
The 5-digit number, 16807=75, is also a fifth power. Similarly, the 9-digit number,
134217728=89, is a ninth power.
How many n-digit positive integers exist which are also an nth power?
"""
"""
The maximum base can be 9 because all n-digit numbers < 10^n.
Now 9**23 has 22 digits so the maximum power can be 22.
Using these conclusions, we will calculate the result.
"""
def solution(max_base: int = 10, max_power: int = 22) -> int:
"""
Returns the count of all n-digit numbers which are nth power
>>> solution(10, 22)
49
>>> solution(0, 0)
0
>>> solution(1, 1)
0
>>> solution(-1, -1)
0
"""
bases = range(1, max_base)
powers = range(1, max_power)
return sum(
1 for power in powers for base in bases if len(str(base ** power)) == power
)
if __name__ == "__main__":
print(f"{solution(10, 22) = }")
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | -1 |
||
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | -1 |
||
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
author: Christian Bender
date: 21.12.2017
class: XORCipher
This class implements the XOR-cipher algorithm and provides
some useful methods for encrypting and decrypting strings and
files.
Overview about methods
- encrypt : list of char
- decrypt : list of char
- encrypt_string : str
- decrypt_string : str
- encrypt_file : boolean
- decrypt_file : boolean
"""
from __future__ import annotations
class XORCipher:
def __init__(self, key: int = 0):
"""
simple constructor that receives a key or uses
default key = 0
"""
# private field
self.__key = key
def encrypt(self, content: str, key: int) -> list[str]:
"""
input: 'content' of type string and 'key' of type int
output: encrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
# precondition
assert isinstance(key, int) and isinstance(content, str)
key = key or self.__key or 1
# make sure key is an appropriate size
key %= 255
return [chr(ord(ch) ^ key) for ch in content]
def decrypt(self, content: str, key: int) -> list[str]:
"""
input: 'content' of type list and 'key' of type int
output: decrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
# precondition
assert isinstance(key, int) and isinstance(content, list)
key = key or self.__key or 1
# make sure key is an appropriate size
key %= 255
return [chr(ord(ch) ^ key) for ch in content]
def encrypt_string(self, content: str, key: int = 0) -> str:
"""
input: 'content' of type string and 'key' of type int
output: encrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
# precondition
assert isinstance(key, int) and isinstance(content, str)
key = key or self.__key or 1
# make sure key can be any size
while key > 255:
key -= 255
# This will be returned
ans = ""
for ch in content:
ans += chr(ord(ch) ^ key)
return ans
def decrypt_string(self, content: str, key: int = 0) -> str:
"""
input: 'content' of type string and 'key' of type int
output: decrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
# precondition
assert isinstance(key, int) and isinstance(content, str)
key = key or self.__key or 1
# make sure key can be any size
while key > 255:
key -= 255
# This will be returned
ans = ""
for ch in content:
ans += chr(ord(ch) ^ key)
return ans
def encrypt_file(self, file: str, key: int = 0) -> bool:
"""
input: filename (str) and a key (int)
output: returns true if encrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
# precondition
assert isinstance(file, str) and isinstance(key, int)
try:
with open(file) as fin:
with open("encrypt.out", "w+") as fout:
# actual encrypt-process
for line in fin:
fout.write(self.encrypt_string(line, key))
except OSError:
return False
return True
def decrypt_file(self, file: str, key: int) -> bool:
"""
input: filename (str) and a key (int)
output: returns true if decrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
# precondition
assert isinstance(file, str) and isinstance(key, int)
try:
with open(file) as fin:
with open("decrypt.out", "w+") as fout:
# actual encrypt-process
for line in fin:
fout.write(self.decrypt_string(line, key))
except OSError:
return False
return True
# Tests
# crypt = XORCipher()
# key = 67
# # test encrypt
# print(crypt.encrypt("hallo welt",key))
# # test decrypt
# print(crypt.decrypt(crypt.encrypt("hallo welt",key), key))
# # test encrypt_string
# print(crypt.encrypt_string("hallo welt",key))
# # test decrypt_string
# print(crypt.decrypt_string(crypt.encrypt_string("hallo welt",key),key))
# if (crypt.encrypt_file("test.txt",key)):
# print("encrypt successful")
# else:
# print("encrypt unsuccessful")
# if (crypt.decrypt_file("encrypt.out",key)):
# print("decrypt successful")
# else:
# print("decrypt unsuccessful")
| """
author: Christian Bender
date: 21.12.2017
class: XORCipher
This class implements the XOR-cipher algorithm and provides
some useful methods for encrypting and decrypting strings and
files.
Overview about methods
- encrypt : list of char
- decrypt : list of char
- encrypt_string : str
- decrypt_string : str
- encrypt_file : boolean
- decrypt_file : boolean
"""
from __future__ import annotations
class XORCipher:
def __init__(self, key: int = 0):
"""
simple constructor that receives a key or uses
default key = 0
"""
# private field
self.__key = key
def encrypt(self, content: str, key: int) -> list[str]:
"""
input: 'content' of type string and 'key' of type int
output: encrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
# precondition
assert isinstance(key, int) and isinstance(content, str)
key = key or self.__key or 1
# make sure key is an appropriate size
key %= 255
return [chr(ord(ch) ^ key) for ch in content]
def decrypt(self, content: str, key: int) -> list[str]:
"""
input: 'content' of type list and 'key' of type int
output: decrypted string 'content' as a list of chars
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
# precondition
assert isinstance(key, int) and isinstance(content, list)
key = key or self.__key or 1
# make sure key is an appropriate size
key %= 255
return [chr(ord(ch) ^ key) for ch in content]
def encrypt_string(self, content: str, key: int = 0) -> str:
"""
input: 'content' of type string and 'key' of type int
output: encrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
# precondition
assert isinstance(key, int) and isinstance(content, str)
key = key or self.__key or 1
# make sure key can be any size
while key > 255:
key -= 255
# This will be returned
ans = ""
for ch in content:
ans += chr(ord(ch) ^ key)
return ans
def decrypt_string(self, content: str, key: int = 0) -> str:
"""
input: 'content' of type string and 'key' of type int
output: decrypted string 'content'
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
# precondition
assert isinstance(key, int) and isinstance(content, str)
key = key or self.__key or 1
# make sure key can be any size
while key > 255:
key -= 255
# This will be returned
ans = ""
for ch in content:
ans += chr(ord(ch) ^ key)
return ans
def encrypt_file(self, file: str, key: int = 0) -> bool:
"""
input: filename (str) and a key (int)
output: returns true if encrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
# precondition
assert isinstance(file, str) and isinstance(key, int)
try:
with open(file) as fin:
with open("encrypt.out", "w+") as fout:
# actual encrypt-process
for line in fin:
fout.write(self.encrypt_string(line, key))
except OSError:
return False
return True
def decrypt_file(self, file: str, key: int) -> bool:
"""
input: filename (str) and a key (int)
output: returns true if decrypt process was
successful otherwise false
if key not passed the method uses the key by the constructor.
otherwise key = 1
"""
# precondition
assert isinstance(file, str) and isinstance(key, int)
try:
with open(file) as fin:
with open("decrypt.out", "w+") as fout:
# actual encrypt-process
for line in fin:
fout.write(self.decrypt_string(line, key))
except OSError:
return False
return True
# Tests
# crypt = XORCipher()
# key = 67
# # test encrypt
# print(crypt.encrypt("hallo welt",key))
# # test decrypt
# print(crypt.decrypt(crypt.encrypt("hallo welt",key), key))
# # test encrypt_string
# print(crypt.encrypt_string("hallo welt",key))
# # test decrypt_string
# print(crypt.decrypt_string(crypt.encrypt_string("hallo welt",key),key))
# if (crypt.encrypt_file("test.txt",key)):
# print("encrypt successful")
# else:
# print("encrypt unsuccessful")
# if (crypt.decrypt_file("encrypt.out",key)):
# print("decrypt successful")
# else:
# print("decrypt unsuccessful")
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | import numpy as np
from PIL import Image
def rgb2gray(rgb: np.array) -> np.array:
"""
Return gray image from rgb image
>>> rgb2gray(np.array([[[127, 255, 0]]]))
array([[187.6453]])
>>> rgb2gray(np.array([[[0, 0, 0]]]))
array([[0.]])
>>> rgb2gray(np.array([[[2, 4, 1]]]))
array([[3.0598]])
>>> rgb2gray(np.array([[[26, 255, 14], [5, 147, 20], [1, 200, 0]]]))
array([[159.0524, 90.0635, 117.6989]])
"""
r, g, b = rgb[:, :, 0], rgb[:, :, 1], rgb[:, :, 2]
return 0.2989 * r + 0.5870 * g + 0.1140 * b
def gray2binary(gray: np.array) -> np.array:
"""
Return binary image from gray image
>>> gray2binary(np.array([[127, 255, 0]]))
array([[False, True, False]])
>>> gray2binary(np.array([[0]]))
array([[False]])
>>> gray2binary(np.array([[26.2409, 4.9315, 1.4729]]))
array([[False, False, False]])
>>> gray2binary(np.array([[26, 255, 14], [5, 147, 20], [1, 200, 0]]))
array([[False, True, False],
[False, True, False],
[False, True, False]])
"""
return (127 < gray) & (gray <= 255)
def erosion(image: np.array, kernel: np.array) -> np.array:
"""
Return eroded image
>>> erosion(np.array([[True, True, False]]), np.array([[0, 1, 0]]))
array([[False, False, False]])
>>> erosion(np.array([[True, False, False]]), np.array([[1, 1, 0]]))
array([[False, False, False]])
"""
output = np.zeros_like(image)
image_padded = np.zeros(
(image.shape[0] + kernel.shape[0] - 1, image.shape[1] + kernel.shape[1] - 1)
)
# Copy image to padded image
image_padded[kernel.shape[0] - 2 : -1 :, kernel.shape[1] - 2 : -1 :] = image
# Iterate over image & apply kernel
for x in range(image.shape[1]):
for y in range(image.shape[0]):
summation = (
kernel * image_padded[y : y + kernel.shape[0], x : x + kernel.shape[1]]
).sum()
output[y, x] = int(summation == 5)
return output
# kernel to be applied
structuring_element = np.array([[0, 1, 0], [1, 1, 1], [0, 1, 0]])
if __name__ == "__main__":
# read original image
image = np.array(Image.open(r"..\image_data\lena.jpg"))
# Apply erosion operation to a binary image
output = erosion(gray2binary(rgb2gray(image)), structuring_element)
# Save the output image
pil_img = Image.fromarray(output).convert("RGB")
pil_img.save("result_erosion.png")
| import numpy as np
from PIL import Image
def rgb2gray(rgb: np.array) -> np.array:
"""
Return gray image from rgb image
>>> rgb2gray(np.array([[[127, 255, 0]]]))
array([[187.6453]])
>>> rgb2gray(np.array([[[0, 0, 0]]]))
array([[0.]])
>>> rgb2gray(np.array([[[2, 4, 1]]]))
array([[3.0598]])
>>> rgb2gray(np.array([[[26, 255, 14], [5, 147, 20], [1, 200, 0]]]))
array([[159.0524, 90.0635, 117.6989]])
"""
r, g, b = rgb[:, :, 0], rgb[:, :, 1], rgb[:, :, 2]
return 0.2989 * r + 0.5870 * g + 0.1140 * b
def gray2binary(gray: np.array) -> np.array:
"""
Return binary image from gray image
>>> gray2binary(np.array([[127, 255, 0]]))
array([[False, True, False]])
>>> gray2binary(np.array([[0]]))
array([[False]])
>>> gray2binary(np.array([[26.2409, 4.9315, 1.4729]]))
array([[False, False, False]])
>>> gray2binary(np.array([[26, 255, 14], [5, 147, 20], [1, 200, 0]]))
array([[False, True, False],
[False, True, False],
[False, True, False]])
"""
return (127 < gray) & (gray <= 255)
def erosion(image: np.array, kernel: np.array) -> np.array:
"""
Return eroded image
>>> erosion(np.array([[True, True, False]]), np.array([[0, 1, 0]]))
array([[False, False, False]])
>>> erosion(np.array([[True, False, False]]), np.array([[1, 1, 0]]))
array([[False, False, False]])
"""
output = np.zeros_like(image)
image_padded = np.zeros(
(image.shape[0] + kernel.shape[0] - 1, image.shape[1] + kernel.shape[1] - 1)
)
# Copy image to padded image
image_padded[kernel.shape[0] - 2 : -1 :, kernel.shape[1] - 2 : -1 :] = image
# Iterate over image & apply kernel
for x in range(image.shape[1]):
for y in range(image.shape[0]):
summation = (
kernel * image_padded[y : y + kernel.shape[0], x : x + kernel.shape[1]]
).sum()
output[y, x] = int(summation == 5)
return output
# kernel to be applied
structuring_element = np.array([[0, 1, 0], [1, 1, 1], [0, 1, 0]])
if __name__ == "__main__":
# read original image
image = np.array(Image.open(r"..\image_data\lena.jpg"))
# Apply erosion operation to a binary image
output = erosion(gray2binary(rgb2gray(image)), structuring_element)
# Save the output image
pil_img = Image.fromarray(output).convert("RGB")
pil_img.save("result_erosion.png")
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Project Euler Problem 75: https://projecteuler.net/problem=75
It turns out that 12 cm is the smallest length of wire that can be bent to form an
integer sided right angle triangle in exactly one way, but there are many more examples.
12 cm: (3,4,5)
24 cm: (6,8,10)
30 cm: (5,12,13)
36 cm: (9,12,15)
40 cm: (8,15,17)
48 cm: (12,16,20)
In contrast, some lengths of wire, like 20 cm, cannot be bent to form an integer sided
right angle triangle, and other lengths allow more than one solution to be found; for
example, using 120 cm it is possible to form exactly three different integer sided
right angle triangles.
120 cm: (30,40,50), (20,48,52), (24,45,51)
Given that L is the length of the wire, for how many values of L ≤ 1,500,000 can
exactly one integer sided right angle triangle be formed?
Solution: we generate all pythagorean triples using Euclid's formula and
keep track of the frequencies of the perimeters.
Reference: https://en.wikipedia.org/wiki/Pythagorean_triple#Generating_a_triple
"""
from collections import defaultdict
from math import gcd
from typing import DefaultDict
def solution(limit: int = 1500000) -> int:
"""
Return the number of values of L <= limit such that a wire of length L can be
formmed into an integer sided right angle triangle in exactly one way.
>>> solution(50)
6
>>> solution(1000)
112
>>> solution(50000)
5502
"""
frequencies: DefaultDict = defaultdict(int)
euclid_m = 2
while 2 * euclid_m * (euclid_m + 1) <= limit:
for euclid_n in range((euclid_m % 2) + 1, euclid_m, 2):
if gcd(euclid_m, euclid_n) > 1:
continue
primitive_perimeter = 2 * euclid_m * (euclid_m + euclid_n)
for perimeter in range(primitive_perimeter, limit + 1, primitive_perimeter):
frequencies[perimeter] += 1
euclid_m += 1
return sum(1 for frequency in frequencies.values() if frequency == 1)
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler Problem 75: https://projecteuler.net/problem=75
It turns out that 12 cm is the smallest length of wire that can be bent to form an
integer sided right angle triangle in exactly one way, but there are many more examples.
12 cm: (3,4,5)
24 cm: (6,8,10)
30 cm: (5,12,13)
36 cm: (9,12,15)
40 cm: (8,15,17)
48 cm: (12,16,20)
In contrast, some lengths of wire, like 20 cm, cannot be bent to form an integer sided
right angle triangle, and other lengths allow more than one solution to be found; for
example, using 120 cm it is possible to form exactly three different integer sided
right angle triangles.
120 cm: (30,40,50), (20,48,52), (24,45,51)
Given that L is the length of the wire, for how many values of L ≤ 1,500,000 can
exactly one integer sided right angle triangle be formed?
Solution: we generate all pythagorean triples using Euclid's formula and
keep track of the frequencies of the perimeters.
Reference: https://en.wikipedia.org/wiki/Pythagorean_triple#Generating_a_triple
"""
from collections import defaultdict
from math import gcd
from typing import DefaultDict
def solution(limit: int = 1500000) -> int:
"""
Return the number of values of L <= limit such that a wire of length L can be
formmed into an integer sided right angle triangle in exactly one way.
>>> solution(50)
6
>>> solution(1000)
112
>>> solution(50000)
5502
"""
frequencies: DefaultDict = defaultdict(int)
euclid_m = 2
while 2 * euclid_m * (euclid_m + 1) <= limit:
for euclid_n in range((euclid_m % 2) + 1, euclid_m, 2):
if gcd(euclid_m, euclid_n) > 1:
continue
primitive_perimeter = 2 * euclid_m * (euclid_m + euclid_n)
for perimeter in range(primitive_perimeter, limit + 1, primitive_perimeter):
frequencies[perimeter] += 1
euclid_m += 1
return sum(1 for frequency in frequencies.values() if frequency == 1)
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Tree_sort algorithm.
Build a BST and in order traverse.
"""
class node:
# BST data structure
def __init__(self, val):
self.val = val
self.left = None
self.right = None
def insert(self, val):
if self.val:
if val < self.val:
if self.left is None:
self.left = node(val)
else:
self.left.insert(val)
elif val > self.val:
if self.right is None:
self.right = node(val)
else:
self.right.insert(val)
else:
self.val = val
def inorder(root, res):
# Recursive traversal
if root:
inorder(root.left, res)
res.append(root.val)
inorder(root.right, res)
def tree_sort(arr):
# Build BST
if len(arr) == 0:
return arr
root = node(arr[0])
for i in range(1, len(arr)):
root.insert(arr[i])
# Traverse BST in order.
res = []
inorder(root, res)
return res
if __name__ == "__main__":
print(tree_sort([10, 1, 3, 2, 9, 14, 13]))
| """
Tree_sort algorithm.
Build a BST and in order traverse.
"""
class node:
# BST data structure
def __init__(self, val):
self.val = val
self.left = None
self.right = None
def insert(self, val):
if self.val:
if val < self.val:
if self.left is None:
self.left = node(val)
else:
self.left.insert(val)
elif val > self.val:
if self.right is None:
self.right = node(val)
else:
self.right.insert(val)
else:
self.val = val
def inorder(root, res):
# Recursive traversal
if root:
inorder(root.left, res)
res.append(root.val)
inorder(root.right, res)
def tree_sort(arr):
# Build BST
if len(arr) == 0:
return arr
root = node(arr[0])
for i in range(1, len(arr)):
root.insert(arr[i])
# Traverse BST in order.
res = []
inorder(root, res)
return res
if __name__ == "__main__":
print(tree_sort([10, 1, 3, 2, 9, 14, 13]))
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
This is pure Python implementation of fibonacci search.
Resources used:
https://en.wikipedia.org/wiki/Fibonacci_search_technique
For doctests run following command:
python3 -m doctest -v fibonacci_search.py
For manual testing run:
python3 fibonacci_search.py
"""
from functools import lru_cache
@lru_cache
def fibonacci(k: int) -> int:
"""Finds fibonacci number in index k.
Parameters
----------
k :
Index of fibonacci.
Returns
-------
int
Fibonacci number in position k.
>>> fibonacci(0)
0
>>> fibonacci(2)
1
>>> fibonacci(5)
5
>>> fibonacci(15)
610
>>> fibonacci('a')
Traceback (most recent call last):
TypeError: k must be an integer.
>>> fibonacci(-5)
Traceback (most recent call last):
ValueError: k integer must be greater or equal to zero.
"""
if not isinstance(k, int):
raise TypeError("k must be an integer.")
if k < 0:
raise ValueError("k integer must be greater or equal to zero.")
if k == 0:
return 0
elif k == 1:
return 1
else:
return fibonacci(k - 1) + fibonacci(k - 2)
def fibonacci_search(arr: list, val: int) -> int:
"""A pure Python implementation of a fibonacci search algorithm.
Parameters
----------
arr
List of sorted elements.
val
Element to search in list.
Returns
-------
int
The index of the element in the array.
-1 if the element is not found.
>>> fibonacci_search([4, 5, 6, 7], 4)
0
>>> fibonacci_search([4, 5, 6, 7], -10)
-1
>>> fibonacci_search([-18, 2], -18)
0
>>> fibonacci_search([5], 5)
0
>>> fibonacci_search(['a', 'c', 'd'], 'c')
1
>>> fibonacci_search(['a', 'c', 'd'], 'f')
-1
>>> fibonacci_search([], 1)
-1
>>> fibonacci_search([.1, .4 , 7], .4)
1
>>> fibonacci_search([], 9)
-1
>>> fibonacci_search(list(range(100)), 63)
63
>>> fibonacci_search(list(range(100)), 99)
99
>>> fibonacci_search(list(range(-100, 100, 3)), -97)
1
>>> fibonacci_search(list(range(-100, 100, 3)), 0)
-1
>>> fibonacci_search(list(range(-100, 100, 5)), 0)
20
>>> fibonacci_search(list(range(-100, 100, 5)), 95)
39
"""
len_list = len(arr)
# Find m such that F_m >= n where F_i is the i_th fibonacci number.
i = 0
while True:
if fibonacci(i) >= len_list:
fibb_k = i
break
i += 1
offset = 0
while fibb_k > 0:
index_k = min(
offset + fibonacci(fibb_k - 1), len_list - 1
) # Prevent out of range
item_k_1 = arr[index_k]
if item_k_1 == val:
return index_k
elif val < item_k_1:
fibb_k -= 1
elif val > item_k_1:
offset += fibonacci(fibb_k - 1)
fibb_k -= 2
else:
return -1
if __name__ == "__main__":
import doctest
doctest.testmod()
| """
This is pure Python implementation of fibonacci search.
Resources used:
https://en.wikipedia.org/wiki/Fibonacci_search_technique
For doctests run following command:
python3 -m doctest -v fibonacci_search.py
For manual testing run:
python3 fibonacci_search.py
"""
from functools import lru_cache
@lru_cache
def fibonacci(k: int) -> int:
"""Finds fibonacci number in index k.
Parameters
----------
k :
Index of fibonacci.
Returns
-------
int
Fibonacci number in position k.
>>> fibonacci(0)
0
>>> fibonacci(2)
1
>>> fibonacci(5)
5
>>> fibonacci(15)
610
>>> fibonacci('a')
Traceback (most recent call last):
TypeError: k must be an integer.
>>> fibonacci(-5)
Traceback (most recent call last):
ValueError: k integer must be greater or equal to zero.
"""
if not isinstance(k, int):
raise TypeError("k must be an integer.")
if k < 0:
raise ValueError("k integer must be greater or equal to zero.")
if k == 0:
return 0
elif k == 1:
return 1
else:
return fibonacci(k - 1) + fibonacci(k - 2)
def fibonacci_search(arr: list, val: int) -> int:
"""A pure Python implementation of a fibonacci search algorithm.
Parameters
----------
arr
List of sorted elements.
val
Element to search in list.
Returns
-------
int
The index of the element in the array.
-1 if the element is not found.
>>> fibonacci_search([4, 5, 6, 7], 4)
0
>>> fibonacci_search([4, 5, 6, 7], -10)
-1
>>> fibonacci_search([-18, 2], -18)
0
>>> fibonacci_search([5], 5)
0
>>> fibonacci_search(['a', 'c', 'd'], 'c')
1
>>> fibonacci_search(['a', 'c', 'd'], 'f')
-1
>>> fibonacci_search([], 1)
-1
>>> fibonacci_search([.1, .4 , 7], .4)
1
>>> fibonacci_search([], 9)
-1
>>> fibonacci_search(list(range(100)), 63)
63
>>> fibonacci_search(list(range(100)), 99)
99
>>> fibonacci_search(list(range(-100, 100, 3)), -97)
1
>>> fibonacci_search(list(range(-100, 100, 3)), 0)
-1
>>> fibonacci_search(list(range(-100, 100, 5)), 0)
20
>>> fibonacci_search(list(range(-100, 100, 5)), 95)
39
"""
len_list = len(arr)
# Find m such that F_m >= n where F_i is the i_th fibonacci number.
i = 0
while True:
if fibonacci(i) >= len_list:
fibb_k = i
break
i += 1
offset = 0
while fibb_k > 0:
index_k = min(
offset + fibonacci(fibb_k - 1), len_list - 1
) # Prevent out of range
item_k_1 = arr[index_k]
if item_k_1 == val:
return index_k
elif val < item_k_1:
fibb_k -= 1
elif val > item_k_1:
offset += fibonacci(fibb_k - 1)
fibb_k -= 2
else:
return -1
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
This is a pure Python implementation of the bogosort algorithm,
also known as permutation sort, stupid sort, slowsort, shotgun sort, or monkey sort.
Bogosort generates random permutations until it guesses the correct one.
More info on: https://en.wikipedia.org/wiki/Bogosort
For doctests run following command:
python -m doctest -v bogo_sort.py
or
python3 -m doctest -v bogo_sort.py
For manual testing run:
python bogo_sort.py
"""
import random
def bogo_sort(collection):
"""Pure implementation of the bogosort algorithm in Python
:param collection: some mutable ordered collection with heterogeneous
comparable items inside
:return: the same collection ordered by ascending
Examples:
>>> bogo_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> bogo_sort([])
[]
>>> bogo_sort([-2, -5, -45])
[-45, -5, -2]
"""
def is_sorted(collection):
if len(collection) < 2:
return True
for i in range(len(collection) - 1):
if collection[i] > collection[i + 1]:
return False
return True
while not is_sorted(collection):
random.shuffle(collection)
return collection
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(bogo_sort(unsorted))
| """
This is a pure Python implementation of the bogosort algorithm,
also known as permutation sort, stupid sort, slowsort, shotgun sort, or monkey sort.
Bogosort generates random permutations until it guesses the correct one.
More info on: https://en.wikipedia.org/wiki/Bogosort
For doctests run following command:
python -m doctest -v bogo_sort.py
or
python3 -m doctest -v bogo_sort.py
For manual testing run:
python bogo_sort.py
"""
import random
def bogo_sort(collection):
"""Pure implementation of the bogosort algorithm in Python
:param collection: some mutable ordered collection with heterogeneous
comparable items inside
:return: the same collection ordered by ascending
Examples:
>>> bogo_sort([0, 5, 3, 2, 2])
[0, 2, 2, 3, 5]
>>> bogo_sort([])
[]
>>> bogo_sort([-2, -5, -45])
[-45, -5, -2]
"""
def is_sorted(collection):
if len(collection) < 2:
return True
for i in range(len(collection) - 1):
if collection[i] > collection[i + 1]:
return False
return True
while not is_sorted(collection):
random.shuffle(collection)
return collection
if __name__ == "__main__":
user_input = input("Enter numbers separated by a comma:\n").strip()
unsorted = [int(item) for item in user_input.split(",")]
print(bogo_sort(unsorted))
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | -1 |
||
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
wiki: https://en.wikipedia.org/wiki/Pangram
"""
def check_pangram(
input_str: str = "The quick brown fox jumps over the lazy dog",
) -> bool:
"""
A Pangram String contains all the alphabets at least once.
>>> check_pangram("The quick brown fox jumps over the lazy dog")
True
>>> check_pangram("Waltz, bad nymph, for quick jigs vex.")
True
>>> check_pangram("Jived fox nymph grabs quick waltz.")
True
>>> check_pangram("My name is Unknown")
False
>>> check_pangram("The quick brown fox jumps over the la_y dog")
False
>>> check_pangram()
True
"""
frequency = set()
input_str = input_str.replace(
" ", ""
) # Replacing all the Whitespaces in our sentence
for alpha in input_str:
if "a" <= alpha.lower() <= "z":
frequency.add(alpha.lower())
return True if len(frequency) == 26 else False
def check_pangram_faster(
input_str: str = "The quick brown fox jumps over the lazy dog",
) -> bool:
"""
>>> check_pangram_faster("The quick brown fox jumps over the lazy dog")
True
>>> check_pangram_faster("Waltz, bad nymph, for quick jigs vex.")
True
>>> check_pangram_faster("Jived fox nymph grabs quick waltz.")
True
>>> check_pangram_faster("The quick brown fox jumps over the la_y dog")
False
>>> check_pangram_faster()
True
"""
flag = [False] * 26
for char in input_str:
if char.islower():
flag[ord(char) - 97] = True
elif char.isupper():
flag[ord(char) - 65] = True
return all(flag)
def benchmark() -> None:
"""
Benchmark code comparing different version.
"""
from timeit import timeit
setup = "from __main__ import check_pangram, check_pangram_faster"
print(timeit("check_pangram()", setup=setup))
print(timeit("check_pangram_faster()", setup=setup))
if __name__ == "__main__":
import doctest
doctest.testmod()
benchmark()
| """
wiki: https://en.wikipedia.org/wiki/Pangram
"""
def check_pangram(
input_str: str = "The quick brown fox jumps over the lazy dog",
) -> bool:
"""
A Pangram String contains all the alphabets at least once.
>>> check_pangram("The quick brown fox jumps over the lazy dog")
True
>>> check_pangram("Waltz, bad nymph, for quick jigs vex.")
True
>>> check_pangram("Jived fox nymph grabs quick waltz.")
True
>>> check_pangram("My name is Unknown")
False
>>> check_pangram("The quick brown fox jumps over the la_y dog")
False
>>> check_pangram()
True
"""
frequency = set()
input_str = input_str.replace(
" ", ""
) # Replacing all the Whitespaces in our sentence
for alpha in input_str:
if "a" <= alpha.lower() <= "z":
frequency.add(alpha.lower())
return True if len(frequency) == 26 else False
def check_pangram_faster(
input_str: str = "The quick brown fox jumps over the lazy dog",
) -> bool:
"""
>>> check_pangram_faster("The quick brown fox jumps over the lazy dog")
True
>>> check_pangram_faster("Waltz, bad nymph, for quick jigs vex.")
True
>>> check_pangram_faster("Jived fox nymph grabs quick waltz.")
True
>>> check_pangram_faster("The quick brown fox jumps over the la_y dog")
False
>>> check_pangram_faster()
True
"""
flag = [False] * 26
for char in input_str:
if char.islower():
flag[ord(char) - 97] = True
elif char.isupper():
flag[ord(char) - 65] = True
return all(flag)
def benchmark() -> None:
"""
Benchmark code comparing different version.
"""
from timeit import timeit
setup = "from __main__ import check_pangram, check_pangram_faster"
print(timeit("check_pangram()", setup=setup))
print(timeit("check_pangram_faster()", setup=setup))
if __name__ == "__main__":
import doctest
doctest.testmod()
benchmark()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | from __future__ import annotations
from cmath import sqrt
def quadratic_roots(a: int, b: int, c: int) -> tuple[complex, complex]:
"""
Given the numerical coefficients a, b and c,
calculates the roots for any quadratic equation of the form ax^2 + bx + c
>>> quadratic_roots(a=1, b=3, c=-4)
(1.0, -4.0)
>>> quadratic_roots(5, 6, 1)
(-0.2, -1.0)
>>> quadratic_roots(1, -6, 25)
((3+4j), (3-4j))
"""
if a == 0:
raise ValueError("Coefficient 'a' must not be zero.")
delta = b * b - 4 * a * c
root_1 = (-b + sqrt(delta)) / (2 * a)
root_2 = (-b - sqrt(delta)) / (2 * a)
return (
root_1.real if not root_1.imag else root_1,
root_2.real if not root_2.imag else root_2,
)
def main():
solution1, solution2 = quadratic_roots(a=5, b=6, c=1)
print(f"The solutions are: {solution1} and {solution2}")
if __name__ == "__main__":
main()
| from __future__ import annotations
from cmath import sqrt
def quadratic_roots(a: int, b: int, c: int) -> tuple[complex, complex]:
"""
Given the numerical coefficients a, b and c,
calculates the roots for any quadratic equation of the form ax^2 + bx + c
>>> quadratic_roots(a=1, b=3, c=-4)
(1.0, -4.0)
>>> quadratic_roots(5, 6, 1)
(-0.2, -1.0)
>>> quadratic_roots(1, -6, 25)
((3+4j), (3-4j))
"""
if a == 0:
raise ValueError("Coefficient 'a' must not be zero.")
delta = b * b - 4 * a * c
root_1 = (-b + sqrt(delta)) / (2 * a)
root_2 = (-b - sqrt(delta)) / (2 * a)
return (
root_1.real if not root_1.imag else root_1,
root_2.real if not root_2.imag else root_2,
)
def main():
solution1, solution2 = quadratic_roots(a=5, b=6, c=1)
print(f"The solutions are: {solution1} and {solution2}")
if __name__ == "__main__":
main()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | -1 |
||
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | def upper(word: str) -> str:
"""
Will convert the entire string to uppercase letters
>>> upper("wow")
'WOW'
>>> upper("Hello")
'HELLO'
>>> upper("WHAT")
'WHAT'
>>> upper("wh[]32")
'WH[]32'
"""
# Converting to ascii value int value and checking to see if char is a lower letter
# if it is a lowercase letter it is getting shift by 32 which makes it an uppercase
# case letter
return "".join(chr(ord(char) - 32) if "a" <= char <= "z" else char for char in word)
if __name__ == "__main__":
from doctest import testmod
testmod()
| def upper(word: str) -> str:
"""
Will convert the entire string to uppercase letters
>>> upper("wow")
'WOW'
>>> upper("Hello")
'HELLO'
>>> upper("WHAT")
'WHAT'
>>> upper("wh[]32")
'WH[]32'
"""
# Converting to ascii value int value and checking to see if char is a lower letter
# if it is a lowercase letter it is getting shift by 32 which makes it an uppercase
# case letter
return "".join(chr(ord(char) - 32) if "a" <= char <= "z" else char for char in word)
if __name__ == "__main__":
from doctest import testmod
testmod()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
This is a Python implementation for questions involving task assignments between people.
Here Bitmasking and DP are used for solving this.
Question :-
We have N tasks and M people. Each person in M can do only certain of these tasks. Also
a person can do only one task and a task is performed only by one person.
Find the total no of ways in which the tasks can be distributed.
"""
from collections import defaultdict
class AssignmentUsingBitmask:
def __init__(self, task_performed, total):
self.total_tasks = total # total no of tasks (N)
# DP table will have a dimension of (2^M)*N
# initially all values are set to -1
self.dp = [
[-1 for i in range(total + 1)] for j in range(2 ** len(task_performed))
]
self.task = defaultdict(list) # stores the list of persons for each task
# final_mask is used to check if all persons are included by setting all bits
# to 1
self.final_mask = (1 << len(task_performed)) - 1
def CountWaysUtil(self, mask, task_no):
# if mask == self.finalmask all persons are distributed tasks, return 1
if mask == self.final_mask:
return 1
# if not everyone gets the task and no more tasks are available, return 0
if task_no > self.total_tasks:
return 0
# if case already considered
if self.dp[mask][task_no] != -1:
return self.dp[mask][task_no]
# Number of ways when we don't this task in the arrangement
total_ways_util = self.CountWaysUtil(mask, task_no + 1)
# now assign the tasks one by one to all possible persons and recursively
# assign for the remaining tasks.
if task_no in self.task:
for p in self.task[task_no]:
# if p is already given a task
if mask & (1 << p):
continue
# assign this task to p and change the mask value. And recursively
# assign tasks with the new mask value.
total_ways_util += self.CountWaysUtil(mask | (1 << p), task_no + 1)
# save the value.
self.dp[mask][task_no] = total_ways_util
return self.dp[mask][task_no]
def countNoOfWays(self, task_performed):
# Store the list of persons for each task
for i in range(len(task_performed)):
for j in task_performed[i]:
self.task[j].append(i)
# call the function to fill the DP table, final answer is stored in dp[0][1]
return self.CountWaysUtil(0, 1)
if __name__ == "__main__":
total_tasks = 5 # total no of tasks (the value of N)
# the list of tasks that can be done by M persons.
task_performed = [[1, 3, 4], [1, 2, 5], [3, 4]]
print(
AssignmentUsingBitmask(task_performed, total_tasks).countNoOfWays(
task_performed
)
)
"""
For the particular example the tasks can be distributed as
(1,2,3), (1,2,4), (1,5,3), (1,5,4), (3,1,4),
(3,2,4), (3,5,4), (4,1,3), (4,2,3), (4,5,3)
total 10
"""
| """
This is a Python implementation for questions involving task assignments between people.
Here Bitmasking and DP are used for solving this.
Question :-
We have N tasks and M people. Each person in M can do only certain of these tasks. Also
a person can do only one task and a task is performed only by one person.
Find the total no of ways in which the tasks can be distributed.
"""
from collections import defaultdict
class AssignmentUsingBitmask:
def __init__(self, task_performed, total):
self.total_tasks = total # total no of tasks (N)
# DP table will have a dimension of (2^M)*N
# initially all values are set to -1
self.dp = [
[-1 for i in range(total + 1)] for j in range(2 ** len(task_performed))
]
self.task = defaultdict(list) # stores the list of persons for each task
# final_mask is used to check if all persons are included by setting all bits
# to 1
self.final_mask = (1 << len(task_performed)) - 1
def CountWaysUtil(self, mask, task_no):
# if mask == self.finalmask all persons are distributed tasks, return 1
if mask == self.final_mask:
return 1
# if not everyone gets the task and no more tasks are available, return 0
if task_no > self.total_tasks:
return 0
# if case already considered
if self.dp[mask][task_no] != -1:
return self.dp[mask][task_no]
# Number of ways when we don't this task in the arrangement
total_ways_util = self.CountWaysUtil(mask, task_no + 1)
# now assign the tasks one by one to all possible persons and recursively
# assign for the remaining tasks.
if task_no in self.task:
for p in self.task[task_no]:
# if p is already given a task
if mask & (1 << p):
continue
# assign this task to p and change the mask value. And recursively
# assign tasks with the new mask value.
total_ways_util += self.CountWaysUtil(mask | (1 << p), task_no + 1)
# save the value.
self.dp[mask][task_no] = total_ways_util
return self.dp[mask][task_no]
def countNoOfWays(self, task_performed):
# Store the list of persons for each task
for i in range(len(task_performed)):
for j in task_performed[i]:
self.task[j].append(i)
# call the function to fill the DP table, final answer is stored in dp[0][1]
return self.CountWaysUtil(0, 1)
if __name__ == "__main__":
total_tasks = 5 # total no of tasks (the value of N)
# the list of tasks that can be done by M persons.
task_performed = [[1, 3, 4], [1, 2, 5], [3, 4]]
print(
AssignmentUsingBitmask(task_performed, total_tasks).countNoOfWays(
task_performed
)
)
"""
For the particular example the tasks can be distributed as
(1,2,3), (1,2,4), (1,5,3), (1,5,4), (3,1,4),
(3,2,4), (3,5,4), (4,1,3), (4,2,3), (4,5,3)
total 10
"""
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | #!/bin/python3
# Doomsday algorithm info: https://en.wikipedia.org/wiki/Doomsday_rule
DOOMSDAY_LEAP = [4, 1, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
DOOMSDAY_NOT_LEAP = [3, 7, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
WEEK_DAY_NAMES = {
0: "Sunday",
1: "Monday",
2: "Tuesday",
3: "Wednesday",
4: "Thursday",
5: "Friday",
6: "Saturday",
}
def get_week_day(year: int, month: int, day: int) -> str:
"""Returns the week-day name out of a given date.
>>> get_week_day(2020, 10, 24)
'Saturday'
>>> get_week_day(2017, 10, 24)
'Tuesday'
>>> get_week_day(2019, 5, 3)
'Friday'
>>> get_week_day(1970, 9, 16)
'Wednesday'
>>> get_week_day(1870, 8, 13)
'Saturday'
>>> get_week_day(2040, 3, 14)
'Wednesday'
"""
# minimal input check:
assert len(str(year)) > 2, "year should be in YYYY format"
assert 1 <= month <= 12, "month should be between 1 to 12"
assert 1 <= day <= 31, "day should be between 1 to 31"
# Doomsday algorithm:
century = year // 100
century_anchor = (5 * (century % 4) + 2) % 7
centurian = year % 100
centurian_m = centurian % 12
dooms_day = (
(centurian // 12) + centurian_m + (centurian_m // 4) + century_anchor
) % 7
day_anchor = (
DOOMSDAY_NOT_LEAP[month - 1]
if (year % 4 != 0) or (centurian == 0 and (year % 400) == 0)
else DOOMSDAY_LEAP[month - 1]
)
week_day = (dooms_day + day - day_anchor) % 7
return WEEK_DAY_NAMES[week_day]
if __name__ == "__main__":
import doctest
doctest.testmod()
| #!/bin/python3
# Doomsday algorithm info: https://en.wikipedia.org/wiki/Doomsday_rule
DOOMSDAY_LEAP = [4, 1, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
DOOMSDAY_NOT_LEAP = [3, 7, 7, 4, 2, 6, 4, 1, 5, 3, 7, 5]
WEEK_DAY_NAMES = {
0: "Sunday",
1: "Monday",
2: "Tuesday",
3: "Wednesday",
4: "Thursday",
5: "Friday",
6: "Saturday",
}
def get_week_day(year: int, month: int, day: int) -> str:
"""Returns the week-day name out of a given date.
>>> get_week_day(2020, 10, 24)
'Saturday'
>>> get_week_day(2017, 10, 24)
'Tuesday'
>>> get_week_day(2019, 5, 3)
'Friday'
>>> get_week_day(1970, 9, 16)
'Wednesday'
>>> get_week_day(1870, 8, 13)
'Saturday'
>>> get_week_day(2040, 3, 14)
'Wednesday'
"""
# minimal input check:
assert len(str(year)) > 2, "year should be in YYYY format"
assert 1 <= month <= 12, "month should be between 1 to 12"
assert 1 <= day <= 31, "day should be between 1 to 31"
# Doomsday algorithm:
century = year // 100
century_anchor = (5 * (century % 4) + 2) % 7
centurian = year % 100
centurian_m = centurian % 12
dooms_day = (
(centurian // 12) + centurian_m + (centurian_m // 4) + century_anchor
) % 7
day_anchor = (
DOOMSDAY_NOT_LEAP[month - 1]
if (year % 4 != 0) or (centurian == 0 and (year % 400) == 0)
else DOOMSDAY_LEAP[month - 1]
)
week_day = (dooms_day + day - day_anchor) % 7
return WEEK_DAY_NAMES[week_day]
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Project Euler Problem 56: https://projecteuler.net/problem=56
A googol (10^100) is a massive number: one followed by one-hundred zeros;
100^100 is almost unimaginably large: one followed by two-hundred zeros.
Despite their size, the sum of the digits in each number is only 1.
Considering natural numbers of the form, ab, where a, b < 100,
what is the maximum digital sum?
"""
def solution(a: int = 100, b: int = 100) -> int:
"""
Considering natural numbers of the form, a**b, where a, b < 100,
what is the maximum digital sum?
:param a:
:param b:
:return:
>>> solution(10,10)
45
>>> solution(100,100)
972
>>> solution(100,200)
1872
"""
# RETURN the MAXIMUM from the list of SUMs of the list of INT converted from STR of
# BASE raised to the POWER
return max(
sum(int(x) for x in str(base ** power))
for base in range(a)
for power in range(b)
)
# Tests
if __name__ == "__main__":
import doctest
doctest.testmod()
| """
Project Euler Problem 56: https://projecteuler.net/problem=56
A googol (10^100) is a massive number: one followed by one-hundred zeros;
100^100 is almost unimaginably large: one followed by two-hundred zeros.
Despite their size, the sum of the digits in each number is only 1.
Considering natural numbers of the form, ab, where a, b < 100,
what is the maximum digital sum?
"""
def solution(a: int = 100, b: int = 100) -> int:
"""
Considering natural numbers of the form, a**b, where a, b < 100,
what is the maximum digital sum?
:param a:
:param b:
:return:
>>> solution(10,10)
45
>>> solution(100,100)
972
>>> solution(100,200)
1872
"""
# RETURN the MAXIMUM from the list of SUMs of the list of INT converted from STR of
# BASE raised to the POWER
return max(
sum(int(x) for x in str(base ** power))
for base in range(a)
for power in range(b)
)
# Tests
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Project Euler Problem 174: https://projecteuler.net/problem=174
We shall define a square lamina to be a square outline with a square "hole" so that
the shape possesses vertical and horizontal symmetry.
Given eight tiles it is possible to form a lamina in only one way: 3x3 square with a
1x1 hole in the middle. However, using thirty-two tiles it is possible to form two
distinct laminae.
If t represents the number of tiles used, we shall say that t = 8 is type L(1) and
t = 32 is type L(2).
Let N(n) be the number of t ≤ 1000000 such that t is type L(n); for example,
N(15) = 832.
What is ∑ N(n) for 1 ≤ n ≤ 10?
"""
from collections import defaultdict
from math import ceil, sqrt
def solution(t_limit: int = 1000000, n_limit: int = 10) -> int:
"""
Return the sum of N(n) for 1 <= n <= n_limit.
>>> solution(1000,5)
249
>>> solution(10000,10)
2383
"""
count: defaultdict = defaultdict(int)
for outer_width in range(3, (t_limit // 4) + 2):
if outer_width * outer_width > t_limit:
hole_width_lower_bound = max(
ceil(sqrt(outer_width * outer_width - t_limit)), 1
)
else:
hole_width_lower_bound = 1
hole_width_lower_bound += (outer_width - hole_width_lower_bound) % 2
for hole_width in range(hole_width_lower_bound, outer_width - 1, 2):
count[outer_width * outer_width - hole_width * hole_width] += 1
return sum(1 for n in count.values() if 1 <= n <= 10)
if __name__ == "__main__":
print(f"{solution() = }")
| """
Project Euler Problem 174: https://projecteuler.net/problem=174
We shall define a square lamina to be a square outline with a square "hole" so that
the shape possesses vertical and horizontal symmetry.
Given eight tiles it is possible to form a lamina in only one way: 3x3 square with a
1x1 hole in the middle. However, using thirty-two tiles it is possible to form two
distinct laminae.
If t represents the number of tiles used, we shall say that t = 8 is type L(1) and
t = 32 is type L(2).
Let N(n) be the number of t ≤ 1000000 such that t is type L(n); for example,
N(15) = 832.
What is ∑ N(n) for 1 ≤ n ≤ 10?
"""
from collections import defaultdict
from math import ceil, sqrt
def solution(t_limit: int = 1000000, n_limit: int = 10) -> int:
"""
Return the sum of N(n) for 1 <= n <= n_limit.
>>> solution(1000,5)
249
>>> solution(10000,10)
2383
"""
count: defaultdict = defaultdict(int)
for outer_width in range(3, (t_limit // 4) + 2):
if outer_width * outer_width > t_limit:
hole_width_lower_bound = max(
ceil(sqrt(outer_width * outer_width - t_limit)), 1
)
else:
hole_width_lower_bound = 1
hole_width_lower_bound += (outer_width - hole_width_lower_bound) % 2
for hole_width in range(hole_width_lower_bound, outer_width - 1, 2):
count[outer_width * outer_width - hole_width * hole_width] += 1
return sum(1 for n in count.values() if 1 <= n <= 10)
if __name__ == "__main__":
print(f"{solution() = }")
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | -1 |
||
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | import unittest
import numpy as np
def schur_complement(
mat_a: np.ndarray,
mat_b: np.ndarray,
mat_c: np.ndarray,
pseudo_inv: np.ndarray = None,
) -> np.ndarray:
"""
Schur complement of a symmetric matrix X given as a 2x2 block matrix
consisting of matrices A, B and C.
Matrix A must be quadratic and non-singular.
In case A is singular, a pseudo-inverse may be provided using
the pseudo_inv argument.
Link to Wiki: https://en.wikipedia.org/wiki/Schur_complement
See also Convex Optimization – Boyd and Vandenberghe, A.5.5
>>> import numpy as np
>>> a = np.array([[1, 2], [2, 1]])
>>> b = np.array([[0, 3], [3, 0]])
>>> c = np.array([[2, 1], [6, 3]])
>>> schur_complement(a, b, c)
array([[ 5., -5.],
[ 0., 6.]])
"""
shape_a = np.shape(mat_a)
shape_b = np.shape(mat_b)
shape_c = np.shape(mat_c)
if shape_a[0] != shape_b[0]:
raise ValueError(
f"Expected the same number of rows for A and B. \
Instead found A of size {shape_a} and B of size {shape_b}"
)
if shape_b[1] != shape_c[1]:
raise ValueError(
f"Expected the same number of columns for B and C. \
Instead found B of size {shape_b} and C of size {shape_c}"
)
a_inv = pseudo_inv
if a_inv is None:
try:
a_inv = np.linalg.inv(mat_a)
except np.linalg.LinAlgError:
raise ValueError(
"Input matrix A is not invertible. Cannot compute Schur complement."
)
return mat_c - mat_b.T @ a_inv @ mat_b
class TestSchurComplement(unittest.TestCase):
def test_schur_complement(self) -> None:
a = np.array([[1, 2, 1], [2, 1, 2], [3, 2, 4]])
b = np.array([[0, 3], [3, 0], [2, 3]])
c = np.array([[2, 1], [6, 3]])
s = schur_complement(a, b, c)
input_matrix = np.block([[a, b], [b.T, c]])
det_x = np.linalg.det(input_matrix)
det_a = np.linalg.det(a)
det_s = np.linalg.det(s)
self.assertAlmostEqual(det_x, det_a * det_s)
def test_improper_a_b_dimensions(self) -> None:
a = np.array([[1, 2, 1], [2, 1, 2], [3, 2, 4]])
b = np.array([[0, 3], [3, 0], [2, 3]])
c = np.array([[2, 1], [6, 3]])
with self.assertRaises(ValueError):
schur_complement(a, b, c)
def test_improper_b_c_dimensions(self) -> None:
a = np.array([[1, 2, 1], [2, 1, 2], [3, 2, 4]])
b = np.array([[0, 3], [3, 0], [2, 3]])
c = np.array([[2, 1, 3], [6, 3, 5]])
with self.assertRaises(ValueError):
schur_complement(a, b, c)
if __name__ == "__main__":
import doctest
doctest.testmod()
unittest.main()
| import unittest
import numpy as np
def schur_complement(
mat_a: np.ndarray,
mat_b: np.ndarray,
mat_c: np.ndarray,
pseudo_inv: np.ndarray = None,
) -> np.ndarray:
"""
Schur complement of a symmetric matrix X given as a 2x2 block matrix
consisting of matrices A, B and C.
Matrix A must be quadratic and non-singular.
In case A is singular, a pseudo-inverse may be provided using
the pseudo_inv argument.
Link to Wiki: https://en.wikipedia.org/wiki/Schur_complement
See also Convex Optimization – Boyd and Vandenberghe, A.5.5
>>> import numpy as np
>>> a = np.array([[1, 2], [2, 1]])
>>> b = np.array([[0, 3], [3, 0]])
>>> c = np.array([[2, 1], [6, 3]])
>>> schur_complement(a, b, c)
array([[ 5., -5.],
[ 0., 6.]])
"""
shape_a = np.shape(mat_a)
shape_b = np.shape(mat_b)
shape_c = np.shape(mat_c)
if shape_a[0] != shape_b[0]:
raise ValueError(
f"Expected the same number of rows for A and B. \
Instead found A of size {shape_a} and B of size {shape_b}"
)
if shape_b[1] != shape_c[1]:
raise ValueError(
f"Expected the same number of columns for B and C. \
Instead found B of size {shape_b} and C of size {shape_c}"
)
a_inv = pseudo_inv
if a_inv is None:
try:
a_inv = np.linalg.inv(mat_a)
except np.linalg.LinAlgError:
raise ValueError(
"Input matrix A is not invertible. Cannot compute Schur complement."
)
return mat_c - mat_b.T @ a_inv @ mat_b
class TestSchurComplement(unittest.TestCase):
def test_schur_complement(self) -> None:
a = np.array([[1, 2, 1], [2, 1, 2], [3, 2, 4]])
b = np.array([[0, 3], [3, 0], [2, 3]])
c = np.array([[2, 1], [6, 3]])
s = schur_complement(a, b, c)
input_matrix = np.block([[a, b], [b.T, c]])
det_x = np.linalg.det(input_matrix)
det_a = np.linalg.det(a)
det_s = np.linalg.det(s)
self.assertAlmostEqual(det_x, det_a * det_s)
def test_improper_a_b_dimensions(self) -> None:
a = np.array([[1, 2, 1], [2, 1, 2], [3, 2, 4]])
b = np.array([[0, 3], [3, 0], [2, 3]])
c = np.array([[2, 1], [6, 3]])
with self.assertRaises(ValueError):
schur_complement(a, b, c)
def test_improper_b_c_dimensions(self) -> None:
a = np.array([[1, 2, 1], [2, 1, 2], [3, 2, 4]])
b = np.array([[0, 3], [3, 0], [2, 3]])
c = np.array([[2, 1, 3], [6, 3, 5]])
with self.assertRaises(ValueError):
schur_complement(a, b, c)
if __name__ == "__main__":
import doctest
doctest.testmod()
unittest.main()
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | -1 |
||
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | #!/usr/bin/python
"""
The Fisher–Yates shuffle is an algorithm for generating a random permutation of a
finite sequence.
For more details visit
wikipedia/Fischer-Yates-Shuffle.
"""
import random
def fisher_yates_shuffle(data: list) -> list:
for _ in range(len(list)):
a = random.randint(0, len(list) - 1)
b = random.randint(0, len(list) - 1)
list[a], list[b] = list[b], list[a]
return list
if __name__ == "__main__":
integers = [0, 1, 2, 3, 4, 5, 6, 7]
strings = ["python", "says", "hello", "!"]
print("Fisher-Yates Shuffle:")
print("List", integers, strings)
print("FY Shuffle", fisher_yates_shuffle(integers), fisher_yates_shuffle(strings))
| #!/usr/bin/python
"""
The Fisher–Yates shuffle is an algorithm for generating a random permutation of a
finite sequence.
For more details visit
wikipedia/Fischer-Yates-Shuffle.
"""
import random
def fisher_yates_shuffle(data: list) -> list:
for _ in range(len(list)):
a = random.randint(0, len(list) - 1)
b = random.randint(0, len(list) - 1)
list[a], list[b] = list[b], list[a]
return list
if __name__ == "__main__":
integers = [0, 1, 2, 3, 4, 5, 6, 7]
strings = ["python", "says", "hello", "!"]
print("Fisher-Yates Shuffle:")
print("List", integers, strings)
print("FY Shuffle", fisher_yates_shuffle(integers), fisher_yates_shuffle(strings))
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
What is the greatest product of four adjacent numbers (horizontally,
vertically, or diagonally) in this 20x20 array?
08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
"""
import os
def solution():
"""Returns the greatest product of four adjacent numbers (horizontally,
vertically, or diagonally).
>>> solution()
70600674
"""
with open(os.path.dirname(__file__) + "/grid.txt") as f:
l = [] # noqa: E741
for i in range(20):
l.append([int(x) for x in f.readline().split()])
maximum = 0
# right
for i in range(20):
for j in range(17):
temp = l[i][j] * l[i][j + 1] * l[i][j + 2] * l[i][j + 3]
if temp > maximum:
maximum = temp
# down
for i in range(17):
for j in range(20):
temp = l[i][j] * l[i + 1][j] * l[i + 2][j] * l[i + 3][j]
if temp > maximum:
maximum = temp
# diagonal 1
for i in range(17):
for j in range(17):
temp = l[i][j] * l[i + 1][j + 1] * l[i + 2][j + 2] * l[i + 3][j + 3]
if temp > maximum:
maximum = temp
# diagonal 2
for i in range(17):
for j in range(3, 20):
temp = l[i][j] * l[i + 1][j - 1] * l[i + 2][j - 2] * l[i + 3][j - 3]
if temp > maximum:
maximum = temp
return maximum
if __name__ == "__main__":
print(solution())
| """
What is the greatest product of four adjacent numbers (horizontally,
vertically, or diagonally) in this 20x20 array?
08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00
81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65
52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91
22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80
24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50
32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70
67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21
24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72
21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95
78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92
16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57
86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58
19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40
04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66
88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69
04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36
20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16
20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54
01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48
"""
import os
def solution():
"""Returns the greatest product of four adjacent numbers (horizontally,
vertically, or diagonally).
>>> solution()
70600674
"""
with open(os.path.dirname(__file__) + "/grid.txt") as f:
l = [] # noqa: E741
for i in range(20):
l.append([int(x) for x in f.readline().split()])
maximum = 0
# right
for i in range(20):
for j in range(17):
temp = l[i][j] * l[i][j + 1] * l[i][j + 2] * l[i][j + 3]
if temp > maximum:
maximum = temp
# down
for i in range(17):
for j in range(20):
temp = l[i][j] * l[i + 1][j] * l[i + 2][j] * l[i + 3][j]
if temp > maximum:
maximum = temp
# diagonal 1
for i in range(17):
for j in range(17):
temp = l[i][j] * l[i + 1][j + 1] * l[i + 2][j + 2] * l[i + 3][j + 3]
if temp > maximum:
maximum = temp
# diagonal 2
for i in range(17):
for j in range(3, 20):
temp = l[i][j] * l[i + 1][j - 1] * l[i + 2][j - 2] * l[i + 3][j - 3]
if temp > maximum:
maximum = temp
return maximum
if __name__ == "__main__":
print(solution())
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
This is to show simple COVID19 info fetching from worldometers site using lxml
* The main motivation to use lxml in place of bs4 is that it is faster and therefore
more convenient to use in Python web projects (e.g. Django or Flask-based)
"""
from collections import namedtuple
import requests
from lxml import html # type: ignore
covid_data = namedtuple("covid_data", "cases deaths recovered")
def covid_stats(url: str = "https://www.worldometers.info/coronavirus/") -> covid_data:
xpath_str = '//div[@class = "maincounter-number"]/span/text()'
return covid_data(*html.fromstring(requests.get(url).content).xpath(xpath_str))
fmt = """Total COVID-19 cases in the world: {}
Total deaths due to COVID-19 in the world: {}
Total COVID-19 patients recovered in the world: {}"""
print(fmt.format(*covid_stats()))
| """
This is to show simple COVID19 info fetching from worldometers site using lxml
* The main motivation to use lxml in place of bs4 is that it is faster and therefore
more convenient to use in Python web projects (e.g. Django or Flask-based)
"""
from collections import namedtuple
import requests
from lxml import html # type: ignore
covid_data = namedtuple("covid_data", "cases deaths recovered")
def covid_stats(url: str = "https://www.worldometers.info/coronavirus/") -> covid_data:
xpath_str = '//div[@class = "maincounter-number"]/span/text()'
return covid_data(*html.fromstring(requests.get(url).content).xpath(xpath_str))
fmt = """Total COVID-19 cases in the world: {}
Total deaths due to COVID-19 in the world: {}
Total COVID-19 patients recovered in the world: {}"""
print(fmt.format(*covid_stats()))
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | MIT License
Copyright (c) 2016-2021 The Algorithms
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
| MIT License
Copyright (c) 2016-2021 The Algorithms
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | #!/bin/sh
#
# An example hook script to make use of push options.
# The example simply echoes all push options that start with 'echoback='
# and rejects all pushes when the "reject" push option is used.
#
# To enable this hook, rename this file to "pre-receive".
if test -n "$GIT_PUSH_OPTION_COUNT"
then
i=0
while test "$i" -lt "$GIT_PUSH_OPTION_COUNT"
do
eval "value=\$GIT_PUSH_OPTION_$i"
case "$value" in
echoback=*)
echo "echo from the pre-receive-hook: ${value#*=}" >&2
;;
reject)
exit 1
esac
i=$((i + 1))
done
fi
| #!/bin/sh
#
# An example hook script to make use of push options.
# The example simply echoes all push options that start with 'echoback='
# and rejects all pushes when the "reject" push option is used.
#
# To enable this hook, rename this file to "pre-receive".
if test -n "$GIT_PUSH_OPTION_COUNT"
then
i=0
while test "$i" -lt "$GIT_PUSH_OPTION_COUNT"
do
eval "value=\$GIT_PUSH_OPTION_$i"
case "$value" in
echoback=*)
echo "echo from the pre-receive-hook: ${value#*=}" >&2
;;
reject)
exit 1
esac
i=$((i + 1))
done
fi
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Name scores
Problem 22
Using names.txt (right click and 'Save Link/Target As...'), a 46K text file
containing over five-thousand first names, begin by sorting it into
alphabetical order. Then working out the alphabetical value for each name,
multiply this value by its alphabetical position in the list to obtain a name
score.
For example, when the list is sorted into alphabetical order, COLIN, which is
worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. So, COLIN would
obtain a score of 938 × 53 = 49714.
What is the total of all the name scores in the file?
"""
import os
def solution():
"""Returns the total of all the name scores in the file.
>>> solution()
871198282
"""
total_sum = 0
temp_sum = 0
with open(os.path.dirname(__file__) + "/p022_names.txt") as file:
name = str(file.readlines()[0])
name = name.replace('"', "").split(",")
name.sort()
for i in range(len(name)):
for j in name[i]:
temp_sum += ord(j) - ord("A") + 1
total_sum += (i + 1) * temp_sum
temp_sum = 0
return total_sum
if __name__ == "__main__":
print(solution())
| """
Name scores
Problem 22
Using names.txt (right click and 'Save Link/Target As...'), a 46K text file
containing over five-thousand first names, begin by sorting it into
alphabetical order. Then working out the alphabetical value for each name,
multiply this value by its alphabetical position in the list to obtain a name
score.
For example, when the list is sorted into alphabetical order, COLIN, which is
worth 3 + 15 + 12 + 9 + 14 = 53, is the 938th name in the list. So, COLIN would
obtain a score of 938 × 53 = 49714.
What is the total of all the name scores in the file?
"""
import os
def solution():
"""Returns the total of all the name scores in the file.
>>> solution()
871198282
"""
total_sum = 0
temp_sum = 0
with open(os.path.dirname(__file__) + "/p022_names.txt") as file:
name = str(file.readlines()[0])
name = name.replace('"', "").split(",")
name.sort()
for i in range(len(name)):
for j in name[i]:
temp_sum += ord(j) - ord("A") + 1
total_sum += (i + 1) * temp_sum
temp_sum = 0
return total_sum
if __name__ == "__main__":
print(solution())
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
A Hamiltonian cycle (Hamiltonian circuit) is a graph cycle
through a graph that visits each node exactly once.
Determining whether such paths and cycles exist in graphs
is the 'Hamiltonian path problem', which is NP-complete.
Wikipedia: https://en.wikipedia.org/wiki/Hamiltonian_path
"""
def valid_connection(
graph: list[list[int]], next_ver: int, curr_ind: int, path: list[int]
) -> bool:
"""
Checks whether it is possible to add next into path by validating 2 statements
1. There should be path between current and next vertex
2. Next vertex should not be in path
If both validations succeed we return True, saying that it is possible to connect
this vertices, otherwise we return False
Case 1:Use exact graph as in main function, with initialized values
>>> graph = [[0, 1, 0, 1, 0],
... [1, 0, 1, 1, 1],
... [0, 1, 0, 0, 1],
... [1, 1, 0, 0, 1],
... [0, 1, 1, 1, 0]]
>>> path = [0, -1, -1, -1, -1, 0]
>>> curr_ind = 1
>>> next_ver = 1
>>> valid_connection(graph, next_ver, curr_ind, path)
True
Case 2: Same graph, but trying to connect to node that is already in path
>>> path = [0, 1, 2, 4, -1, 0]
>>> curr_ind = 4
>>> next_ver = 1
>>> valid_connection(graph, next_ver, curr_ind, path)
False
"""
# 1. Validate that path exists between current and next vertices
if graph[path[curr_ind - 1]][next_ver] == 0:
return False
# 2. Validate that next vertex is not already in path
return not any(vertex == next_ver for vertex in path)
def util_hamilton_cycle(graph: list[list[int]], path: list[int], curr_ind: int) -> bool:
"""
Pseudo-Code
Base Case:
1. Check if we visited all of vertices
1.1 If last visited vertex has path to starting vertex return True either
return False
Recursive Step:
2. Iterate over each vertex
Check if next vertex is valid for transiting from current vertex
2.1 Remember next vertex as next transition
2.2 Do recursive call and check if going to this vertex solves problem
2.3 If next vertex leads to solution return True
2.4 Else backtrack, delete remembered vertex
Case 1: Use exact graph as in main function, with initialized values
>>> graph = [[0, 1, 0, 1, 0],
... [1, 0, 1, 1, 1],
... [0, 1, 0, 0, 1],
... [1, 1, 0, 0, 1],
... [0, 1, 1, 1, 0]]
>>> path = [0, -1, -1, -1, -1, 0]
>>> curr_ind = 1
>>> util_hamilton_cycle(graph, path, curr_ind)
True
>>> print(path)
[0, 1, 2, 4, 3, 0]
Case 2: Use exact graph as in previous case, but in the properties taken from
middle of calculation
>>> graph = [[0, 1, 0, 1, 0],
... [1, 0, 1, 1, 1],
... [0, 1, 0, 0, 1],
... [1, 1, 0, 0, 1],
... [0, 1, 1, 1, 0]]
>>> path = [0, 1, 2, -1, -1, 0]
>>> curr_ind = 3
>>> util_hamilton_cycle(graph, path, curr_ind)
True
>>> print(path)
[0, 1, 2, 4, 3, 0]
"""
# Base Case
if curr_ind == len(graph):
# return whether path exists between current and starting vertices
return graph[path[curr_ind - 1]][path[0]] == 1
# Recursive Step
for next in range(0, len(graph)):
if valid_connection(graph, next, curr_ind, path):
# Insert current vertex into path as next transition
path[curr_ind] = next
# Validate created path
if util_hamilton_cycle(graph, path, curr_ind + 1):
return True
# Backtrack
path[curr_ind] = -1
return False
def hamilton_cycle(graph: list[list[int]], start_index: int = 0) -> list[int]:
r"""
Wrapper function to call subroutine called util_hamilton_cycle,
which will either return array of vertices indicating hamiltonian cycle
or an empty list indicating that hamiltonian cycle was not found.
Case 1:
Following graph consists of 5 edges.
If we look closely, we can see that there are multiple Hamiltonian cycles.
For example one result is when we iterate like:
(0)->(1)->(2)->(4)->(3)->(0)
(0)---(1)---(2)
| / \ |
| / \ |
| / \ |
|/ \|
(3)---------(4)
>>> graph = [[0, 1, 0, 1, 0],
... [1, 0, 1, 1, 1],
... [0, 1, 0, 0, 1],
... [1, 1, 0, 0, 1],
... [0, 1, 1, 1, 0]]
>>> hamilton_cycle(graph)
[0, 1, 2, 4, 3, 0]
Case 2:
Same Graph as it was in Case 1, changed starting index from default to 3
(0)---(1)---(2)
| / \ |
| / \ |
| / \ |
|/ \|
(3)---------(4)
>>> graph = [[0, 1, 0, 1, 0],
... [1, 0, 1, 1, 1],
... [0, 1, 0, 0, 1],
... [1, 1, 0, 0, 1],
... [0, 1, 1, 1, 0]]
>>> hamilton_cycle(graph, 3)
[3, 0, 1, 2, 4, 3]
Case 3:
Following Graph is exactly what it was before, but edge 3-4 is removed.
Result is that there is no Hamiltonian Cycle anymore.
(0)---(1)---(2)
| / \ |
| / \ |
| / \ |
|/ \|
(3) (4)
>>> graph = [[0, 1, 0, 1, 0],
... [1, 0, 1, 1, 1],
... [0, 1, 0, 0, 1],
... [1, 1, 0, 0, 0],
... [0, 1, 1, 0, 0]]
>>> hamilton_cycle(graph,4)
[]
"""
# Initialize path with -1, indicating that we have not visited them yet
path = [-1] * (len(graph) + 1)
# initialize start and end of path with starting index
path[0] = path[-1] = start_index
# evaluate and if we find answer return path either return empty array
return path if util_hamilton_cycle(graph, path, 1) else []
| """
A Hamiltonian cycle (Hamiltonian circuit) is a graph cycle
through a graph that visits each node exactly once.
Determining whether such paths and cycles exist in graphs
is the 'Hamiltonian path problem', which is NP-complete.
Wikipedia: https://en.wikipedia.org/wiki/Hamiltonian_path
"""
def valid_connection(
graph: list[list[int]], next_ver: int, curr_ind: int, path: list[int]
) -> bool:
"""
Checks whether it is possible to add next into path by validating 2 statements
1. There should be path between current and next vertex
2. Next vertex should not be in path
If both validations succeed we return True, saying that it is possible to connect
this vertices, otherwise we return False
Case 1:Use exact graph as in main function, with initialized values
>>> graph = [[0, 1, 0, 1, 0],
... [1, 0, 1, 1, 1],
... [0, 1, 0, 0, 1],
... [1, 1, 0, 0, 1],
... [0, 1, 1, 1, 0]]
>>> path = [0, -1, -1, -1, -1, 0]
>>> curr_ind = 1
>>> next_ver = 1
>>> valid_connection(graph, next_ver, curr_ind, path)
True
Case 2: Same graph, but trying to connect to node that is already in path
>>> path = [0, 1, 2, 4, -1, 0]
>>> curr_ind = 4
>>> next_ver = 1
>>> valid_connection(graph, next_ver, curr_ind, path)
False
"""
# 1. Validate that path exists between current and next vertices
if graph[path[curr_ind - 1]][next_ver] == 0:
return False
# 2. Validate that next vertex is not already in path
return not any(vertex == next_ver for vertex in path)
def util_hamilton_cycle(graph: list[list[int]], path: list[int], curr_ind: int) -> bool:
"""
Pseudo-Code
Base Case:
1. Check if we visited all of vertices
1.1 If last visited vertex has path to starting vertex return True either
return False
Recursive Step:
2. Iterate over each vertex
Check if next vertex is valid for transiting from current vertex
2.1 Remember next vertex as next transition
2.2 Do recursive call and check if going to this vertex solves problem
2.3 If next vertex leads to solution return True
2.4 Else backtrack, delete remembered vertex
Case 1: Use exact graph as in main function, with initialized values
>>> graph = [[0, 1, 0, 1, 0],
... [1, 0, 1, 1, 1],
... [0, 1, 0, 0, 1],
... [1, 1, 0, 0, 1],
... [0, 1, 1, 1, 0]]
>>> path = [0, -1, -1, -1, -1, 0]
>>> curr_ind = 1
>>> util_hamilton_cycle(graph, path, curr_ind)
True
>>> print(path)
[0, 1, 2, 4, 3, 0]
Case 2: Use exact graph as in previous case, but in the properties taken from
middle of calculation
>>> graph = [[0, 1, 0, 1, 0],
... [1, 0, 1, 1, 1],
... [0, 1, 0, 0, 1],
... [1, 1, 0, 0, 1],
... [0, 1, 1, 1, 0]]
>>> path = [0, 1, 2, -1, -1, 0]
>>> curr_ind = 3
>>> util_hamilton_cycle(graph, path, curr_ind)
True
>>> print(path)
[0, 1, 2, 4, 3, 0]
"""
# Base Case
if curr_ind == len(graph):
# return whether path exists between current and starting vertices
return graph[path[curr_ind - 1]][path[0]] == 1
# Recursive Step
for next in range(0, len(graph)):
if valid_connection(graph, next, curr_ind, path):
# Insert current vertex into path as next transition
path[curr_ind] = next
# Validate created path
if util_hamilton_cycle(graph, path, curr_ind + 1):
return True
# Backtrack
path[curr_ind] = -1
return False
def hamilton_cycle(graph: list[list[int]], start_index: int = 0) -> list[int]:
r"""
Wrapper function to call subroutine called util_hamilton_cycle,
which will either return array of vertices indicating hamiltonian cycle
or an empty list indicating that hamiltonian cycle was not found.
Case 1:
Following graph consists of 5 edges.
If we look closely, we can see that there are multiple Hamiltonian cycles.
For example one result is when we iterate like:
(0)->(1)->(2)->(4)->(3)->(0)
(0)---(1)---(2)
| / \ |
| / \ |
| / \ |
|/ \|
(3)---------(4)
>>> graph = [[0, 1, 0, 1, 0],
... [1, 0, 1, 1, 1],
... [0, 1, 0, 0, 1],
... [1, 1, 0, 0, 1],
... [0, 1, 1, 1, 0]]
>>> hamilton_cycle(graph)
[0, 1, 2, 4, 3, 0]
Case 2:
Same Graph as it was in Case 1, changed starting index from default to 3
(0)---(1)---(2)
| / \ |
| / \ |
| / \ |
|/ \|
(3)---------(4)
>>> graph = [[0, 1, 0, 1, 0],
... [1, 0, 1, 1, 1],
... [0, 1, 0, 0, 1],
... [1, 1, 0, 0, 1],
... [0, 1, 1, 1, 0]]
>>> hamilton_cycle(graph, 3)
[3, 0, 1, 2, 4, 3]
Case 3:
Following Graph is exactly what it was before, but edge 3-4 is removed.
Result is that there is no Hamiltonian Cycle anymore.
(0)---(1)---(2)
| / \ |
| / \ |
| / \ |
|/ \|
(3) (4)
>>> graph = [[0, 1, 0, 1, 0],
... [1, 0, 1, 1, 1],
... [0, 1, 0, 0, 1],
... [1, 1, 0, 0, 0],
... [0, 1, 1, 0, 0]]
>>> hamilton_cycle(graph,4)
[]
"""
# Initialize path with -1, indicating that we have not visited them yet
path = [-1] * (len(graph) + 1)
# initialize start and end of path with starting index
path[0] = path[-1] = start_index
# evaluate and if we find answer return path either return empty array
return path if util_hamilton_cycle(graph, path, 1) else []
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Implements a disjoint set using Lists and some added heuristics for efficiency
Union by Rank Heuristic and Path Compression
"""
class DisjointSet:
def __init__(self, set_counts: list) -> None:
"""
Initialize with a list of the number of items in each set
and with rank = 1 for each set
"""
self.set_counts = set_counts
self.max_set = max(set_counts)
num_sets = len(set_counts)
self.ranks = [1] * num_sets
self.parents = list(range(num_sets))
def merge(self, src: int, dst: int) -> bool:
"""
Merge two sets together using Union by rank heuristic
Return True if successful
Merge two disjoint sets
>>> A = DisjointSet([1, 1, 1])
>>> A.merge(1, 2)
True
>>> A.merge(0, 2)
True
>>> A.merge(0, 1)
False
"""
src_parent = self.get_parent(src)
dst_parent = self.get_parent(dst)
if src_parent == dst_parent:
return False
if self.ranks[dst_parent] >= self.ranks[src_parent]:
self.set_counts[dst_parent] += self.set_counts[src_parent]
self.set_counts[src_parent] = 0
self.parents[src_parent] = dst_parent
if self.ranks[dst_parent] == self.ranks[src_parent]:
self.ranks[dst_parent] += 1
joined_set_size = self.set_counts[dst_parent]
else:
self.set_counts[src_parent] += self.set_counts[dst_parent]
self.set_counts[dst_parent] = 0
self.parents[dst_parent] = src_parent
joined_set_size = self.set_counts[src_parent]
self.max_set = max(self.max_set, joined_set_size)
return True
def get_parent(self, disj_set: int) -> int:
"""
Find the Parent of a given set
>>> A = DisjointSet([1, 1, 1])
>>> A.merge(1, 2)
True
>>> A.get_parent(0)
0
>>> A.get_parent(1)
2
"""
if self.parents[disj_set] == disj_set:
return disj_set
self.parents[disj_set] = self.get_parent(self.parents[disj_set])
return self.parents[disj_set]
| """
Implements a disjoint set using Lists and some added heuristics for efficiency
Union by Rank Heuristic and Path Compression
"""
class DisjointSet:
def __init__(self, set_counts: list) -> None:
"""
Initialize with a list of the number of items in each set
and with rank = 1 for each set
"""
self.set_counts = set_counts
self.max_set = max(set_counts)
num_sets = len(set_counts)
self.ranks = [1] * num_sets
self.parents = list(range(num_sets))
def merge(self, src: int, dst: int) -> bool:
"""
Merge two sets together using Union by rank heuristic
Return True if successful
Merge two disjoint sets
>>> A = DisjointSet([1, 1, 1])
>>> A.merge(1, 2)
True
>>> A.merge(0, 2)
True
>>> A.merge(0, 1)
False
"""
src_parent = self.get_parent(src)
dst_parent = self.get_parent(dst)
if src_parent == dst_parent:
return False
if self.ranks[dst_parent] >= self.ranks[src_parent]:
self.set_counts[dst_parent] += self.set_counts[src_parent]
self.set_counts[src_parent] = 0
self.parents[src_parent] = dst_parent
if self.ranks[dst_parent] == self.ranks[src_parent]:
self.ranks[dst_parent] += 1
joined_set_size = self.set_counts[dst_parent]
else:
self.set_counts[src_parent] += self.set_counts[dst_parent]
self.set_counts[dst_parent] = 0
self.parents[dst_parent] = src_parent
joined_set_size = self.set_counts[src_parent]
self.max_set = max(self.max_set, joined_set_size)
return True
def get_parent(self, disj_set: int) -> int:
"""
Find the Parent of a given set
>>> A = DisjointSet([1, 1, 1])
>>> A.merge(1, 2)
True
>>> A.get_parent(0)
0
>>> A.get_parent(1)
2
"""
if self.parents[disj_set] == disj_set:
return disj_set
self.parents[disj_set] = self.get_parent(self.parents[disj_set])
return self.parents[disj_set]
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | -1 |
||
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | #!/usr/bin/env python3
# Author: OMKAR PATHAK, Nwachukwu Chidiebere
# Use a Python dictionary to construct the graph.
from __future__ import annotations
from pprint import pformat
from typing import Generic, TypeVar
T = TypeVar("T")
class GraphAdjacencyList(Generic[T]):
"""
Adjacency List type Graph Data Structure that accounts for directed and undirected
Graphs. Initialize graph object indicating whether it's directed or undirected.
Directed graph example:
>>> d_graph = GraphAdjacencyList()
>>> d_graph
{}
>>> d_graph.add_edge(0, 1)
{0: [1], 1: []}
>>> d_graph.add_edge(1, 2).add_edge(1, 4).add_edge(1, 5)
{0: [1], 1: [2, 4, 5], 2: [], 4: [], 5: []}
>>> d_graph.add_edge(2, 0).add_edge(2, 6).add_edge(2, 7)
{0: [1], 1: [2, 4, 5], 2: [0, 6, 7], 4: [], 5: [], 6: [], 7: []}
>>> print(d_graph)
{0: [1], 1: [2, 4, 5], 2: [0, 6, 7], 4: [], 5: [], 6: [], 7: []}
>>> print(repr(d_graph))
{0: [1], 1: [2, 4, 5], 2: [0, 6, 7], 4: [], 5: [], 6: [], 7: []}
Undirected graph example:
>>> u_graph = GraphAdjacencyList(directed=False)
>>> u_graph.add_edge(0, 1)
{0: [1], 1: [0]}
>>> u_graph.add_edge(1, 2).add_edge(1, 4).add_edge(1, 5)
{0: [1], 1: [0, 2, 4, 5], 2: [1], 4: [1], 5: [1]}
>>> u_graph.add_edge(2, 0).add_edge(2, 6).add_edge(2, 7)
{0: [1, 2], 1: [0, 2, 4, 5], 2: [1, 0, 6, 7], 4: [1], 5: [1], 6: [2], 7: [2]}
>>> u_graph.add_edge(4, 5)
{0: [1, 2],
1: [0, 2, 4, 5],
2: [1, 0, 6, 7],
4: [1, 5],
5: [1, 4],
6: [2],
7: [2]}
>>> print(u_graph)
{0: [1, 2],
1: [0, 2, 4, 5],
2: [1, 0, 6, 7],
4: [1, 5],
5: [1, 4],
6: [2],
7: [2]}
>>> print(repr(u_graph))
{0: [1, 2],
1: [0, 2, 4, 5],
2: [1, 0, 6, 7],
4: [1, 5],
5: [1, 4],
6: [2],
7: [2]}
>>> char_graph = GraphAdjacencyList(directed=False)
>>> char_graph.add_edge('a', 'b')
{'a': ['b'], 'b': ['a']}
>>> char_graph.add_edge('b', 'c').add_edge('b', 'e').add_edge('b', 'f')
{'a': ['b'], 'b': ['a', 'c', 'e', 'f'], 'c': ['b'], 'e': ['b'], 'f': ['b']}
>>> print(char_graph)
{'a': ['b'], 'b': ['a', 'c', 'e', 'f'], 'c': ['b'], 'e': ['b'], 'f': ['b']}
"""
def __init__(self, directed: bool = True) -> None:
"""
Parameters:
directed: (bool) Indicates if graph is directed or undirected. Default is True.
"""
self.adj_list: dict[T, list[T]] = {} # dictionary of lists
self.directed = directed
def add_edge(
self, source_vertex: T, destination_vertex: T
) -> GraphAdjacencyList[T]:
"""
Connects vertices together. Creates and Edge from source vertex to destination
vertex.
Vertices will be created if not found in graph
"""
if not self.directed: # For undirected graphs
# if both source vertex and destination vertex are both present in the
# adjacency list, add destination vertex to source vertex list of adjacent
# vertices and add source vertex to destination vertex list of adjacent
# vertices.
if source_vertex in self.adj_list and destination_vertex in self.adj_list:
self.adj_list[source_vertex].append(destination_vertex)
self.adj_list[destination_vertex].append(source_vertex)
# if only source vertex is present in adjacency list, add destination vertex
# to source vertex list of adjacent vertices, then create a new vertex with
# destination vertex as key and assign a list containing the source vertex
# as it's first adjacent vertex.
elif source_vertex in self.adj_list:
self.adj_list[source_vertex].append(destination_vertex)
self.adj_list[destination_vertex] = [source_vertex]
# if only destination vertex is present in adjacency list, add source vertex
# to destination vertex list of adjacent vertices, then create a new vertex
# with source vertex as key and assign a list containing the source vertex
# as it's first adjacent vertex.
elif destination_vertex in self.adj_list:
self.adj_list[destination_vertex].append(source_vertex)
self.adj_list[source_vertex] = [destination_vertex]
# if both source vertex and destination vertex are not present in adjacency
# list, create a new vertex with source vertex as key and assign a list
# containing the destination vertex as it's first adjacent vertex also
# create a new vertex with destination vertex as key and assign a list
# containing the source vertex as it's first adjacent vertex.
else:
self.adj_list[source_vertex] = [destination_vertex]
self.adj_list[destination_vertex] = [source_vertex]
else: # For directed graphs
# if both source vertex and destination vertex are present in adjacency
# list, add destination vertex to source vertex list of adjacent vertices.
if source_vertex in self.adj_list and destination_vertex in self.adj_list:
self.adj_list[source_vertex].append(destination_vertex)
# if only source vertex is present in adjacency list, add destination
# vertex to source vertex list of adjacent vertices and create a new vertex
# with destination vertex as key, which has no adjacent vertex
elif source_vertex in self.adj_list:
self.adj_list[source_vertex].append(destination_vertex)
self.adj_list[destination_vertex] = []
# if only destination vertex is present in adjacency list, create a new
# vertex with source vertex as key and assign a list containing destination
# vertex as first adjacent vertex
elif destination_vertex in self.adj_list:
self.adj_list[source_vertex] = [destination_vertex]
# if both source vertex and destination vertex are not present in adjacency
# list, create a new vertex with source vertex as key and a list containing
# destination vertex as it's first adjacent vertex. Then create a new vertex
# with destination vertex as key, which has no adjacent vertex
else:
self.adj_list[source_vertex] = [destination_vertex]
self.adj_list[destination_vertex] = []
return self
def __repr__(self) -> str:
return pformat(self.adj_list)
| #!/usr/bin/env python3
# Author: OMKAR PATHAK, Nwachukwu Chidiebere
# Use a Python dictionary to construct the graph.
from __future__ import annotations
from pprint import pformat
from typing import Generic, TypeVar
T = TypeVar("T")
class GraphAdjacencyList(Generic[T]):
"""
Adjacency List type Graph Data Structure that accounts for directed and undirected
Graphs. Initialize graph object indicating whether it's directed or undirected.
Directed graph example:
>>> d_graph = GraphAdjacencyList()
>>> d_graph
{}
>>> d_graph.add_edge(0, 1)
{0: [1], 1: []}
>>> d_graph.add_edge(1, 2).add_edge(1, 4).add_edge(1, 5)
{0: [1], 1: [2, 4, 5], 2: [], 4: [], 5: []}
>>> d_graph.add_edge(2, 0).add_edge(2, 6).add_edge(2, 7)
{0: [1], 1: [2, 4, 5], 2: [0, 6, 7], 4: [], 5: [], 6: [], 7: []}
>>> print(d_graph)
{0: [1], 1: [2, 4, 5], 2: [0, 6, 7], 4: [], 5: [], 6: [], 7: []}
>>> print(repr(d_graph))
{0: [1], 1: [2, 4, 5], 2: [0, 6, 7], 4: [], 5: [], 6: [], 7: []}
Undirected graph example:
>>> u_graph = GraphAdjacencyList(directed=False)
>>> u_graph.add_edge(0, 1)
{0: [1], 1: [0]}
>>> u_graph.add_edge(1, 2).add_edge(1, 4).add_edge(1, 5)
{0: [1], 1: [0, 2, 4, 5], 2: [1], 4: [1], 5: [1]}
>>> u_graph.add_edge(2, 0).add_edge(2, 6).add_edge(2, 7)
{0: [1, 2], 1: [0, 2, 4, 5], 2: [1, 0, 6, 7], 4: [1], 5: [1], 6: [2], 7: [2]}
>>> u_graph.add_edge(4, 5)
{0: [1, 2],
1: [0, 2, 4, 5],
2: [1, 0, 6, 7],
4: [1, 5],
5: [1, 4],
6: [2],
7: [2]}
>>> print(u_graph)
{0: [1, 2],
1: [0, 2, 4, 5],
2: [1, 0, 6, 7],
4: [1, 5],
5: [1, 4],
6: [2],
7: [2]}
>>> print(repr(u_graph))
{0: [1, 2],
1: [0, 2, 4, 5],
2: [1, 0, 6, 7],
4: [1, 5],
5: [1, 4],
6: [2],
7: [2]}
>>> char_graph = GraphAdjacencyList(directed=False)
>>> char_graph.add_edge('a', 'b')
{'a': ['b'], 'b': ['a']}
>>> char_graph.add_edge('b', 'c').add_edge('b', 'e').add_edge('b', 'f')
{'a': ['b'], 'b': ['a', 'c', 'e', 'f'], 'c': ['b'], 'e': ['b'], 'f': ['b']}
>>> print(char_graph)
{'a': ['b'], 'b': ['a', 'c', 'e', 'f'], 'c': ['b'], 'e': ['b'], 'f': ['b']}
"""
def __init__(self, directed: bool = True) -> None:
"""
Parameters:
directed: (bool) Indicates if graph is directed or undirected. Default is True.
"""
self.adj_list: dict[T, list[T]] = {} # dictionary of lists
self.directed = directed
def add_edge(
self, source_vertex: T, destination_vertex: T
) -> GraphAdjacencyList[T]:
"""
Connects vertices together. Creates and Edge from source vertex to destination
vertex.
Vertices will be created if not found in graph
"""
if not self.directed: # For undirected graphs
# if both source vertex and destination vertex are both present in the
# adjacency list, add destination vertex to source vertex list of adjacent
# vertices and add source vertex to destination vertex list of adjacent
# vertices.
if source_vertex in self.adj_list and destination_vertex in self.adj_list:
self.adj_list[source_vertex].append(destination_vertex)
self.adj_list[destination_vertex].append(source_vertex)
# if only source vertex is present in adjacency list, add destination vertex
# to source vertex list of adjacent vertices, then create a new vertex with
# destination vertex as key and assign a list containing the source vertex
# as it's first adjacent vertex.
elif source_vertex in self.adj_list:
self.adj_list[source_vertex].append(destination_vertex)
self.adj_list[destination_vertex] = [source_vertex]
# if only destination vertex is present in adjacency list, add source vertex
# to destination vertex list of adjacent vertices, then create a new vertex
# with source vertex as key and assign a list containing the source vertex
# as it's first adjacent vertex.
elif destination_vertex in self.adj_list:
self.adj_list[destination_vertex].append(source_vertex)
self.adj_list[source_vertex] = [destination_vertex]
# if both source vertex and destination vertex are not present in adjacency
# list, create a new vertex with source vertex as key and assign a list
# containing the destination vertex as it's first adjacent vertex also
# create a new vertex with destination vertex as key and assign a list
# containing the source vertex as it's first adjacent vertex.
else:
self.adj_list[source_vertex] = [destination_vertex]
self.adj_list[destination_vertex] = [source_vertex]
else: # For directed graphs
# if both source vertex and destination vertex are present in adjacency
# list, add destination vertex to source vertex list of adjacent vertices.
if source_vertex in self.adj_list and destination_vertex in self.adj_list:
self.adj_list[source_vertex].append(destination_vertex)
# if only source vertex is present in adjacency list, add destination
# vertex to source vertex list of adjacent vertices and create a new vertex
# with destination vertex as key, which has no adjacent vertex
elif source_vertex in self.adj_list:
self.adj_list[source_vertex].append(destination_vertex)
self.adj_list[destination_vertex] = []
# if only destination vertex is present in adjacency list, create a new
# vertex with source vertex as key and assign a list containing destination
# vertex as first adjacent vertex
elif destination_vertex in self.adj_list:
self.adj_list[source_vertex] = [destination_vertex]
# if both source vertex and destination vertex are not present in adjacency
# list, create a new vertex with source vertex as key and a list containing
# destination vertex as it's first adjacent vertex. Then create a new vertex
# with destination vertex as key, which has no adjacent vertex
else:
self.adj_list[source_vertex] = [destination_vertex]
self.adj_list[destination_vertex] = []
return self
def __repr__(self) -> str:
return pformat(self.adj_list)
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
Problem 15: https://projecteuler.net/problem=15
Starting in the top left corner of a 2×2 grid, and only being able to move to
the right and down, there are exactly 6 routes to the bottom right corner.
How many such routes are there through a 20×20 grid?
"""
from math import factorial
def solution(n: int = 20) -> int:
"""
Returns the number of paths possible in a n x n grid starting at top left
corner going to bottom right corner and being able to move right and down
only.
>>> solution(25)
126410606437752
>>> solution(23)
8233430727600
>>> solution(20)
137846528820
>>> solution(15)
155117520
>>> solution(1)
2
"""
n = 2 * n # middle entry of odd rows starting at row 3 is the solution for n = 1,
# 2, 3,...
k = n / 2
return int(factorial(n) / (factorial(k) * factorial(n - k)))
if __name__ == "__main__":
import sys
if len(sys.argv) == 1:
print(solution(20))
else:
try:
n = int(sys.argv[1])
print(solution(n))
except ValueError:
print("Invalid entry - please enter a number.")
| """
Problem 15: https://projecteuler.net/problem=15
Starting in the top left corner of a 2×2 grid, and only being able to move to
the right and down, there are exactly 6 routes to the bottom right corner.
How many such routes are there through a 20×20 grid?
"""
from math import factorial
def solution(n: int = 20) -> int:
"""
Returns the number of paths possible in a n x n grid starting at top left
corner going to bottom right corner and being able to move right and down
only.
>>> solution(25)
126410606437752
>>> solution(23)
8233430727600
>>> solution(20)
137846528820
>>> solution(15)
155117520
>>> solution(1)
2
"""
n = 2 * n # middle entry of odd rows starting at row 3 is the solution for n = 1,
# 2, 3,...
k = n / 2
return int(factorial(n) / (factorial(k) * factorial(n - k)))
if __name__ == "__main__":
import sys
if len(sys.argv) == 1:
print(solution(20))
else:
try:
n = int(sys.argv[1])
print(solution(n))
except ValueError:
print("Invalid entry - please enter a number.")
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | """
render 3d points for 2d surfaces.
"""
from __future__ import annotations
import math
__version__ = "2020.9.26"
__author__ = "xcodz-dot, cclaus, dhruvmanila"
def convert_to_2d(
x: float, y: float, z: float, scale: float, distance: float
) -> tuple[float, float]:
"""
Converts 3d point to a 2d drawable point
>>> convert_to_2d(1.0, 2.0, 3.0, 10.0, 10.0)
(7.6923076923076925, 15.384615384615385)
>>> convert_to_2d(1, 2, 3, 10, 10)
(7.6923076923076925, 15.384615384615385)
>>> convert_to_2d("1", 2, 3, 10, 10) # '1' is str
Traceback (most recent call last):
...
TypeError: Input values must either be float or int: ['1', 2, 3, 10, 10]
"""
if not all(isinstance(val, (float, int)) for val in locals().values()):
raise TypeError(
"Input values must either be float or int: " f"{list(locals().values())}"
)
projected_x = ((x * distance) / (z + distance)) * scale
projected_y = ((y * distance) / (z + distance)) * scale
return projected_x, projected_y
def rotate(
x: float, y: float, z: float, axis: str, angle: float
) -> tuple[float, float, float]:
"""
rotate a point around a certain axis with a certain angle
angle can be any integer between 1, 360 and axis can be any one of
'x', 'y', 'z'
>>> rotate(1.0, 2.0, 3.0, 'y', 90.0)
(3.130524675073759, 2.0, 0.4470070007889556)
>>> rotate(1, 2, 3, "z", 180)
(0.999736015495891, -2.0001319704760485, 3)
>>> rotate('1', 2, 3, "z", 90.0) # '1' is str
Traceback (most recent call last):
...
TypeError: Input values except axis must either be float or int: ['1', 2, 3, 90.0]
>>> rotate(1, 2, 3, "n", 90) # 'n' is not a valid axis
Traceback (most recent call last):
...
ValueError: not a valid axis, choose one of 'x', 'y', 'z'
>>> rotate(1, 2, 3, "x", -90)
(1, -2.5049096187183877, -2.5933429780983657)
>>> rotate(1, 2, 3, "x", 450) # 450 wrap around to 90
(1, 3.5776792428178217, -0.44744970165427644)
"""
if not isinstance(axis, str):
raise TypeError("Axis must be a str")
input_variables = locals()
del input_variables["axis"]
if not all(isinstance(val, (float, int)) for val in input_variables.values()):
raise TypeError(
"Input values except axis must either be float or int: "
f"{list(input_variables.values())}"
)
angle = (angle % 360) / 450 * 180 / math.pi
if axis == "z":
new_x = x * math.cos(angle) - y * math.sin(angle)
new_y = y * math.cos(angle) + x * math.sin(angle)
new_z = z
elif axis == "x":
new_y = y * math.cos(angle) - z * math.sin(angle)
new_z = z * math.cos(angle) + y * math.sin(angle)
new_x = x
elif axis == "y":
new_x = x * math.cos(angle) - z * math.sin(angle)
new_z = z * math.cos(angle) + x * math.sin(angle)
new_y = y
else:
raise ValueError("not a valid axis, choose one of 'x', 'y', 'z'")
return new_x, new_y, new_z
if __name__ == "__main__":
import doctest
doctest.testmod()
print(f"{convert_to_2d(1.0, 2.0, 3.0, 10.0, 10.0) = }")
print(f"{rotate(1.0, 2.0, 3.0, 'y', 90.0) = }")
| """
render 3d points for 2d surfaces.
"""
from __future__ import annotations
import math
__version__ = "2020.9.26"
__author__ = "xcodz-dot, cclaus, dhruvmanila"
def convert_to_2d(
x: float, y: float, z: float, scale: float, distance: float
) -> tuple[float, float]:
"""
Converts 3d point to a 2d drawable point
>>> convert_to_2d(1.0, 2.0, 3.0, 10.0, 10.0)
(7.6923076923076925, 15.384615384615385)
>>> convert_to_2d(1, 2, 3, 10, 10)
(7.6923076923076925, 15.384615384615385)
>>> convert_to_2d("1", 2, 3, 10, 10) # '1' is str
Traceback (most recent call last):
...
TypeError: Input values must either be float or int: ['1', 2, 3, 10, 10]
"""
if not all(isinstance(val, (float, int)) for val in locals().values()):
raise TypeError(
"Input values must either be float or int: " f"{list(locals().values())}"
)
projected_x = ((x * distance) / (z + distance)) * scale
projected_y = ((y * distance) / (z + distance)) * scale
return projected_x, projected_y
def rotate(
x: float, y: float, z: float, axis: str, angle: float
) -> tuple[float, float, float]:
"""
rotate a point around a certain axis with a certain angle
angle can be any integer between 1, 360 and axis can be any one of
'x', 'y', 'z'
>>> rotate(1.0, 2.0, 3.0, 'y', 90.0)
(3.130524675073759, 2.0, 0.4470070007889556)
>>> rotate(1, 2, 3, "z", 180)
(0.999736015495891, -2.0001319704760485, 3)
>>> rotate('1', 2, 3, "z", 90.0) # '1' is str
Traceback (most recent call last):
...
TypeError: Input values except axis must either be float or int: ['1', 2, 3, 90.0]
>>> rotate(1, 2, 3, "n", 90) # 'n' is not a valid axis
Traceback (most recent call last):
...
ValueError: not a valid axis, choose one of 'x', 'y', 'z'
>>> rotate(1, 2, 3, "x", -90)
(1, -2.5049096187183877, -2.5933429780983657)
>>> rotate(1, 2, 3, "x", 450) # 450 wrap around to 90
(1, 3.5776792428178217, -0.44744970165427644)
"""
if not isinstance(axis, str):
raise TypeError("Axis must be a str")
input_variables = locals()
del input_variables["axis"]
if not all(isinstance(val, (float, int)) for val in input_variables.values()):
raise TypeError(
"Input values except axis must either be float or int: "
f"{list(input_variables.values())}"
)
angle = (angle % 360) / 450 * 180 / math.pi
if axis == "z":
new_x = x * math.cos(angle) - y * math.sin(angle)
new_y = y * math.cos(angle) + x * math.sin(angle)
new_z = z
elif axis == "x":
new_y = y * math.cos(angle) - z * math.sin(angle)
new_z = z * math.cos(angle) + y * math.sin(angle)
new_x = x
elif axis == "y":
new_x = x * math.cos(angle) - z * math.sin(angle)
new_z = z * math.cos(angle) + x * math.sin(angle)
new_y = y
else:
raise ValueError("not a valid axis, choose one of 'x', 'y', 'z'")
return new_x, new_y, new_z
if __name__ == "__main__":
import doctest
doctest.testmod()
print(f"{convert_to_2d(1.0, 2.0, 3.0, 10.0, 10.0) = }")
print(f"{rotate(1.0, 2.0, 3.0, 'y', 90.0) = }")
| -1 |
TheAlgorithms/Python | 4,949 | Fix typos in Sorts and Bit_manipulation | ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | Manan-Rathi | "2021-10-03T08:24:44Z" | "2021-10-20T08:42:32Z" | 83cf5786cddd694a2af25827f8861b7dbcbf706c | 50485f7c8e33b0a3bf6e603cdae3505d40b1d97a | Fix typos in Sorts and Bit_manipulation. ### **Describe your change:**
* [x] Fixes the typos in the sorts and bit_manipulation folder
* [x] Fixes the initially messed links in bit_manipulation/README.md
### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md). | import numpy as np
def explicit_euler(ode_func, y0, x0, step_size, x_end):
"""
Calculate numeric solution at each step to an ODE using Euler's Method
https://en.wikipedia.org/wiki/Euler_method
Arguments:
ode_func -- The ode as a function of x and y
y0 -- the initial value for y
x0 -- the initial value for x
stepsize -- the increment value for x
x_end -- the end value for x
>>> # the exact solution is math.exp(x)
>>> def f(x, y):
... return y
>>> y0 = 1
>>> y = explicit_euler(f, y0, 0.0, 0.01, 5)
>>> y[-1]
144.77277243257308
"""
N = int(np.ceil((x_end - x0) / step_size))
y = np.zeros((N + 1,))
y[0] = y0
x = x0
for k in range(N):
y[k + 1] = y[k] + step_size * ode_func(x, y[k])
x += step_size
return y
if __name__ == "__main__":
import doctest
doctest.testmod()
| import numpy as np
def explicit_euler(ode_func, y0, x0, step_size, x_end):
"""
Calculate numeric solution at each step to an ODE using Euler's Method
https://en.wikipedia.org/wiki/Euler_method
Arguments:
ode_func -- The ode as a function of x and y
y0 -- the initial value for y
x0 -- the initial value for x
stepsize -- the increment value for x
x_end -- the end value for x
>>> # the exact solution is math.exp(x)
>>> def f(x, y):
... return y
>>> y0 = 1
>>> y = explicit_euler(f, y0, 0.0, 0.01, 5)
>>> y[-1]
144.77277243257308
"""
N = int(np.ceil((x_end - x0) / step_size))
y = np.zeros((N + 1,))
y[0] = y0
x = x0
for k in range(N):
y[k + 1] = y[k] + step_size * ode_func(x, y[k])
x += step_size
return y
if __name__ == "__main__":
import doctest
doctest.testmod()
| -1 |
Subsets and Splits