Skip to content

Instantly share code, notes, and snippets.

@MenaHabib
MenaHabib / Day_2.py
Created December 8, 2017 02:27
Solution of day 2 of Advent of Code 2017
import numpy as np
import itertools
#---------------------------------------------------
#Part One
sum1 = 0
sum2 = 0
matrix = np.loadtxt('INPUT-FILE-NAME-HERE',dtype=int)
for row in matrix:
sum1 += max(row) - min(row)
print sum1
@MenaHabib
MenaHabib / Day_1.py
Created December 5, 2017 01:42
Solution of day 1 of Advent of Code 2017
sum =0
sum2 =0
input = input("wuddup yo, gimme your input!\n")
in_arr = [int(x) for x in str(input)]
steps = len(in_arr)/2
#---------------------------------------------------
#Part One
for y in range(len(in_arr)):
if y == (len(in_arr)-1):
if in_arr[y] == in_arr[0]:

Keybase proof

I hereby claim:

  • I am MenaHabib on github.
  • I am 0x4d (https://keybase.io/0x4d) on keybase.
  • I have a public key whose fingerprint is BAB0 6C4F 1D70 C7BC B35C 5228 E995 2B4D 90CC 1224

To claim this, I am signing this object: