Advent of Code 2020: Python Solution Day 1

Advent of Code 2020: Python Solution (25 Part Series)

This is my first ever challenge and I was amazed by the challenges. I am proficient in Python so all codes will be on Python3.

Day 1 seems to be easier to tackle.
I am saving my input as day1.txt on same directory as my Jupyter Notebook is.

with open("day1.txt", "r") as fp:
    num = fp.readlines()
# print(num) num = [int(i.split("\n")[0]) for i in num]
print("Solution: 1\n")
# solution 1 for i in num:
    if 2020-i in num:
        print(i, 2020-i, i*(2020-i))

print("Solution: 2\n")        
# solution 2 for i in num:
    for j in num:
        if (2020-i - j) in num:
            print(2020-i-j, i, j)

Enter fullscreen mode Exit fullscreen mode

Result of above code is given below:

Solution: 1

933 1087 1014171
1087 933 1014171

Solution: 2

566 59 1395
1395 59 566
566 1395 59
59 1395 566
1395 566 59
59 566 1395

Enter fullscreen mode Exit fullscreen mode

I write blogs about Computer Vision projects on my GitHub page q-viper.github.io and if you got some time please share yours too.

Advent of Code 2020: Python Solution (25 Part Series)

原文链接：Advent of Code 2020: Python Solution Day 1

文章版权声明 1、本网站名称：拾光赋
2、本站永久网址：https://www.blogs.ink
3、本网站的文章部分内容可能来源于网络，仅供大家学习与参考，如有侵权，请联系站长QQ：805375623进行删除处理。
4、本站一切资源不代表本站立场，并不代表本站赞同其观点和对其真实性负责。
5、本站一律禁止以任何方式发布或转载任何违法的相关信息，访客发现请向站长举报
6、本站资源大多存储在云盘，如发现链接失效，请联系我们我们会第一时间更新。

THE END