Skip to content

Instantly share code, notes, and snippets.

@popey456963
popey456963 / index.html
Last active February 29, 2016 08:05
Hex Clock
<!DOCTYPE html><html><head><title>Hex Clock</title><meta charset="UTF-8" ><link href='http://fonts.googleapis.com/css?family=Open+Sans:800,400,300' rel='stylesheet' type='text/css'>
<!--
CREDIT TO:
http://whatcolourisit.scn9a.org/ - Page Design
/u/antennas_to_heaven - Improvements
-->
<meta name="viewport" content="width=device-width, user-scalable=no, initial-scale=1">
@popey456963
popey456963 / primes.py
Created November 17, 2015 11:18
primes
import math
def factors(number):
return [(x, number / x) for x in range(int(math.sqrt(number)))[2:] if not number % x]
import time
start_time = time.time()
print(factors(543340953458958439))
print("--- %s seconds ---" % (time.time() - start_time))
@popey456963
popey456963 / keybase.md
Created November 10, 2015 21:38
Keybase Proof

Keybase proof

I hereby claim:

  • I am popey456963 on github.
  • I am alexandercraggs (https://keybase.io/alexandercraggs) on keybase.
  • I have a public key whose fingerprint is 34D6 38E0 B08B ECE7 430B F1B5 7D70 13F7 BEC9 9F40

To claim this, I am signing this object:

@popey456963
popey456963 / intoperations.py
Created November 5, 2015 18:31
Int Operations
a, b = [int(i) for i in input().split()]
n = int(input())
for i in range(n):
x = int(input())
print((x*a)+b)
@popey456963
popey456963 / midpoint.py
Created November 5, 2015 18:08
Midpoint Finder
x_1, y_1 = [int(i) for i in input().split()]
x_2, y_2 = [int(i) for i in input().split()]
x = (x_1+x_2)/2
y = (y_1+y_2)/2
if str(x)[-2:]==".0":
x = int(x)
if str(y)[-2:]==".0":
y = int(y)
print(x, y)
@popey456963
popey456963 / addingsquares.py
Created November 5, 2015 14:05
Adding Squares
line = []
n = int(input())
for i in range(n):
line.append(input())
if len(line) != 1:
a = sum([int(i) for i in line[0].split()])
b = sum([int(i) for i in line[n-1].split()])
c = 0
for i in range(len(line)-2):
@popey456963
popey456963 / order.py
Created November 5, 2015 13:55
Descending Order Array
n=int(input())
d = []
for i in range(n):
d.append(int(input()))
print(" ".join([str(i) for i in sorted(d,reverse=True)]))
@popey456963
popey456963 / fib.py
Created November 5, 2015 13:46
Fibonacci
n = int(input())
print(int(n * (n+1)/2))
@popey456963
popey456963 / programming.md
Last active October 26, 2017 06:12
List of Programs
@popey456963
popey456963 / reverseword.py
Created November 5, 2015 13:26
Reverse Words
print(" ".join(input().split()[::-1]))