newt/the-honk
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

dailyprogrammer 390

Browse source
This commit is contained in:
newt 2021-07-20 20:52:18 +01:00
parent d23a41f711
commit 19e92d4115
No known key found for this signature in database
GPG key ID: A0D2776505CA4B20
2 changed files with 19 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

16
python/dailyprogrammer/#390 - Number of 1s.py Normal file
View file

@ -0,0 +1,16 @@
def count1(n):
x = str(n)
count = 0
for index, digit in enumerate(x[::-1]):
digit = int(digit)
if digit != 0:
if digit == 1:
numberAfter = x[len(x) - index:] or '0'
count += int(numberAfter) + 1
else:
count += 10 ** index
count += int(10 ** (index - 1) * index * digit)
return count
print(count1(3**35))

3
python/dailyprogrammer/readme.md
View file

@ -5,6 +5,9 @@
[The Subreddit](https://reddit.com/r/dailyprogrammer) [The Subreddit](https://reddit.com/r/dailyprogrammer)
- #390 - Number of 1s
- [Solution](%23390%20-%20Number%20of%201s.py)
- [Reddit Post](https://www.reddit.com/r/dailyprogrammer/comments/neg49j/20210517_challenge_390_difficult_number_of_1s/)
- #391 - ABACABA - #391 - ABACABA
- [Solution](%23391%20-%20ABACABA.py) - [Solution](%23391%20-%20ABACABA.py)
- [Reddit Post](https://www.reddit.com/r/dailyprogrammer/comments/njxq95/20210524_challenge_391_easy_the_abacaba_sequence/) - [Reddit Post](https://www.reddit.com/r/dailyprogrammer/comments/njxq95/20210524_challenge_391_easy_the_abacaba_sequence/)