Skip to content

Instantly share code, notes, and snippets.

View haje01's full-sized avatar

Kim Jeong Ju haje01

View GitHub Profile
@haje01
haje01 / calc.py
Last active December 22, 2015 17:28
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
Caculator for Python Korea GangNam Study
"""
import re
from collections import deque
@haje01
haje01 / gist:6892583
Last active December 25, 2015 01:09
집단지성프로그래밍 3장 for 파이썬 코리아 강남 스터디
{
"metadata": {
"name": ""
},
"nbformat": 3,
"nbformat_minor": 0,
"worksheets": [
{
"cells": [
{
@haje01
haje01 / reivew.py
Last active November 21, 2017 07:18
Google Play Review Scraper
import sys
import urllib
import urllib2
import json
import codecs
url = "https://play.google.com/store/getreviews"
values = {
"reviewType": "0", "pageNum": "2",
"id":
@haje01
haje01 / festival.py
Created November 24, 2014 11:57
손고리즘 - Festival
def calc_mavg(prc, ft):
mavg = 100
n = len(prc)
fs = 0
for start in xrange(0, n - ft + 1):
cur = start + ft
fs = sum(prc[start:cur]) if fs == 0 else fs - prc[start - 1] + prc[cur - 1]
avg = fs / float(cur - start)
if avg < mavg:
mavg = avg
@haje01
haje01 / festival2.py
Created November 24, 2014 12:14
손고리즘 - Festival2
def calc_mavg(prc, ft):
t = 0
aprc = []
for p in prc:
t += p
aprc.append(t)
n = len(prc)
ma = 100 * n
for s in xrange(0, n - ft + 1):
i = s - 1
def gen_data():
a = 1983
po = pow(2, 32)
while True:
yield a % 10000 + 1
a = (a * 214013 + 2531011) % po
def do_case(k, n):
head = gen_data().next
def do_case(n, ok):
a = range(2, n+1)
la = len(a)
k = 0
while la > 2:
k = (k + ok - 1) % la
a.pop(k)
la -= 1
return a
@haje01
haje01 / dynamicprog.ipynb
Last active August 29, 2015 14:14
동적계획법 보강 코드
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
@haje01
haje01 / pi.py
Created February 2, 2015 11:50
원주율 외우기
def sfn1(na, o):
a, b, c = na[o-2], na[o-1], na[o]
if a == b and b == c:
return 1
df = b - a
if df == c - b:
return 2 if abs(df) == 1 else 5
elif a == c:
return 4
return 10
cache = None
def memoize(fn):
global cache
def helper(w, ts, i):
if cache[w][i] == -1:
cache[w][i] = fn(w, ts, i)
return cache[w][i]