I hereby claim:
- I am varundey on github.
- I am varundey (https://keybase.io/varundey) on keybase.
- I have a public key ASCiQHGqH8_r9Qp8Om48zYLFjVeCYyhQRcO3i4o5WDj7ogo
To claim this, I am signing this object:
#!/usr/bin/env python | |
from elasticsearch import Elasticsearch | |
es = Elasticsearch() | |
import json | |
import os | |
x= os.listdir("/home/varun/Desktop/git/zeroclickinfo-goodies/share/goodie/cheat_sheets/json") | |
li=[] | |
for xx in x: |
url = "http://timesofindia.indiatimes.com/rss.cms" | |
from bs4 import BeautifulSoup as bs | |
import requests | |
soup = bs(requests.get(url).content, "lxml") | |
soup = soup.findAll("table",{"border":"0", "width":"740", "cellspacing":"0", "cellpadding":'0'}) | |
print len(soup) | |
dic = {} | |
file = open("newsrss.txt","a") | |
for i in soup: |
def value(k, degree, coefficients): | |
ans = 0 | |
for i in range(degree+1): | |
ans += coefficients[i]*pow(k,i) | |
return ans | |
degree = input() | |
coefficients = map(int,raw_input().split()) | |
t=input() |
#include <stdio.h> | |
#include <math.h> | |
void val(long long int k, long long int coeff[], long long int deg){ | |
long long int ans=0,p; | |
for(int i=0;i<=deg;i++){ | |
double ow = pow(k,i); | |
p = (int)ow; | |
ans+=coeff[i]*p; | |
printf("%lld",ans); |
from flask import Flask, render_template | |
from flask.ext.security import SQLAlchemyUserDatastore, Security | |
from flask.ext.sqlalchemy import SQLAlchemy | |
from flask.ext.bootstrap import Bootstrap | |
from flask_mail import Mail | |
from flask.ext.security import UserMixin, RoleMixin | |
app = Flask(__name__) |
n=input() | |
arr=[] | |
while n!=0: | |
n-=1 | |
arr.append(input()) | |
m=input() | |
while m!=0: | |
m-=1 | |
arr.append(input()) | |
for i in sorted(arr): |
a = map(int, raw_input().split()) | |
def rearrange(li): | |
val = len(li)-1 | |
for i in range(len(li)): | |
if li[i]>0 and i<mid: | |
while True: | |
if li[val]<0: | |
li[i], li[val] = li[val], li[i] | |
break |
I hereby claim:
To claim this, I am signing this object:
def memoize(f): | |
memo = {} | |
def helper(x): | |
if x not in memo: | |
memo[x] = f(x) | |
return memo[x] | |
return helper | |
@memoize | |
def fib(n): |