mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-11-23 21:11:08 +00:00
Compare commits
6 Commits
20637e5ae5
...
c3aa695f1c
Author | SHA1 | Date | |
---|---|---|---|
|
c3aa695f1c | ||
|
f3f32ae3ca | ||
|
e3bd7721c8 | ||
|
e3f3d668be | ||
|
7800f1e645 | ||
|
32634eff5a |
|
@ -16,7 +16,7 @@ repos:
|
|||
- id: auto-walrus
|
||||
|
||||
- repo: https://github.com/astral-sh/ruff-pre-commit
|
||||
rev: v0.7.2
|
||||
rev: v0.7.4
|
||||
hooks:
|
||||
- id: ruff
|
||||
- id: ruff-format
|
||||
|
@ -42,7 +42,7 @@ repos:
|
|||
pass_filenames: false
|
||||
|
||||
- repo: https://github.com/abravalheri/validate-pyproject
|
||||
rev: v0.22
|
||||
rev: v0.23
|
||||
hooks:
|
||||
- id: validate-pyproject
|
||||
|
||||
|
|
|
@ -172,7 +172,7 @@ def solved(values):
|
|||
|
||||
def from_file(filename, sep="\n"):
|
||||
"Parse a file into a list of strings, separated by sep."
|
||||
return open(filename).read().strip().split(sep) # noqa: SIM115
|
||||
return open(filename).read().strip().split(sep)
|
||||
|
||||
|
||||
def random_puzzle(assignments=17):
|
||||
|
|
|
@ -1,23 +1,42 @@
|
|||
# DarkCoder
|
||||
def sum_of_series(first_term: int, common_diff: int, num_of_terms: int) -> float:
|
||||
# Reeka
|
||||
def sum_of_ap_series(a: int, d: int, n: int) -> int:
|
||||
"""
|
||||
Find the sum of n terms in an arithmetic progression.
|
||||
Calculates the sum of the first 'n' terms of an arithmetic progression (AP)
|
||||
series with the first term 'a' and common difference 'd'.
|
||||
|
||||
>>> sum_of_series(1, 1, 10)
|
||||
55.0
|
||||
>>> sum_of_series(1, 10, 100)
|
||||
49600.0
|
||||
Parameters:
|
||||
a (int): The first term of the AP.
|
||||
d (int): The common difference between terms.
|
||||
n (int): The number of terms to sum.
|
||||
|
||||
Returns:
|
||||
int: The sum of the first 'n' terms of the AP.
|
||||
|
||||
Examples:
|
||||
>>> sum_of_ap_series(1, 1, 5) # Sum of first 5 natural numbers
|
||||
15
|
||||
>>> sum_of_ap_series(2, 3, 4) # Sum of 2, 5, 8, 11
|
||||
26
|
||||
>>> sum_of_ap_series(5, 0, 3) # Sum of 5, 5, 5
|
||||
15
|
||||
>>> sum_of_ap_series(1, 2, 1) # Single term AP series
|
||||
1
|
||||
>>> sum_of_ap_series(1, -1, 5) # Decreasing AP series
|
||||
-5
|
||||
>>> sum_of_ap_series(1, 1, -5) # Negative 'n' should raise an error
|
||||
Traceback (most recent call last):
|
||||
...
|
||||
ValueError: Number of terms 'n' must be a positive integer
|
||||
>>> sum_of_ap_series(1, 1, 0) # Zero terms should also raise an error
|
||||
Traceback (most recent call last):
|
||||
...
|
||||
ValueError: Number of terms 'n' must be a positive integer
|
||||
"""
|
||||
total = (num_of_terms / 2) * (2 * first_term + (num_of_terms - 1) * common_diff)
|
||||
# formula for sum of series
|
||||
return total
|
||||
if n <= 0:
|
||||
raise ValueError("Number of terms 'n' must be a positive integer")
|
||||
|
||||
# Formula for the sum of an AP series: S_n = n/2 * (2a + (n-1) * d)
|
||||
return n * (2 * a + (n - 1) * d) // 2
|
||||
|
||||
|
||||
def main():
|
||||
print(sum_of_series(1, 1, 10))
|
||||
|
||||
|
||||
if __name__ == "__main__":
|
||||
import doctest
|
||||
|
||||
doctest.testmod()
|
||||
# Reeka
|
||||
|
|
|
@ -1,4 +1,4 @@
|
|||
#!/usr/bin/env python3
|
||||
#!python
|
||||
import os
|
||||
|
||||
try:
|
||||
|
|
Loading…
Reference in New Issue
Block a user