Skip to content

Instantly share code, notes, and snippets.

@cocodrips
cocodrips / GeometricProgressions.py
Last active January 1, 2016 04:29
SRM500 Div2 1000点問題 もうちょっと高速化しないときつそうだし答えちがう。/ http://community.topcoder.com/stat?c=problem_statement&pm=11343&rd=14429
import math
import collections
class GeometricProgressions:
def count(self, b1, q1, n1, b2, q2, n2):
s = set()
self.primes = self._primetable(int(math.ceil(math.sqrt(max(b1, q1, b2, q2)))))
self._check01(b1, q1, n1, s)
self._check01(b2, q2, n2, s)
return len(s)
import collections
class GeometricProgressions:
def count(self, b1, q1, n1, b2, q2, n2):
s = set()
self._add_set(b1, q1, n1, s)
self._add_set(b2, q2, n2, s)
return len(s)
def _add_set(self, b, q, n, s):
@cocodrips
cocodrips / Tw.py
Last active January 1, 2016 07:59
女子大生にPython講座しました。
# -*- coding: utf-8 -*-
import tweepy
class Tw:
def __init__(self):
consumer_key = ''
consumer_secret = ''
oauth_token_secret = ''
oauth_token = ''
import itertools
class ConvertibleStrings:
def leastRemovals(self, A, B):
candi = list(set(A + B))
perms = itertools.permutations(candi)
mini = 55
for perm in perms:
@cocodrips
cocodrips / ConvertibleStrings.cpp
Last active January 1, 2016 12:49
SRM591 Div2 Med/ c++ ver
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
@cocodrips
cocodrips / noda.py
Last active January 1, 2016 17:29
noda
import itertools
import bisect
def solve(items, camps):
combi = itertools.combinations(items, 2)
sums = [a+b for a, b in combi]
sums.sort()
for camp in camps:
i = bisect.bisect_right(sums, camp)
@cocodrips
cocodrips / maze.py
Created January 1, 2014 16:09
Codeforces Round #222 (Div. 2) C. Maze 解けない。
import Queue
def solve(k, strs):
strsX = []
for str in strs:
strsX.append(list(str.replace('.', 'X')))
num_X = countX(strsX)
strsX = replaceX(strsX, num_X - k)
@cocodrips
cocodrips / combination.py
Last active January 2, 2016 23:59
Combinationの総数を計算する
def combination(n, m):
a, b = 1, 1
if m > n / 2:
m = n - m
for i in xrange(m):
a *= n - i
b *= i + 1
return a / b
@cocodrips
cocodrips / FoxAndWord.py
Created January 12, 2014 03:19
SRM604 div2 easy
import math
import string
class FoxAndWord:
def howManyPairs(self, words):
cnt = 0
for i, word in enumerate(words):
for j in xrange(i + 1, len(words)):
if len(words[j]) != len(words[i]): #Contest中書き忘れたとこ。
@cocodrips
cocodrips / class.coffee
Last active January 3, 2016 10:39
クラス内の関数が呼べない
#これでほかのページからhoge = new Hoge()
#hoge.a()ってやると、bがありませんって言われるのなんでーーー。
#hoge.b(date)は呼べるよー( ・ั﹏・ั)
class @Hoge
a: ()=>
now = new Date()
b(now)
b: (date)=>