Skip to content

Instantly share code, notes, and snippets.

View tjkendev's full-sized avatar
🛌
oyasumi

yaketake08 tjkendev

🛌
oyasumi
13 followers · 2 following
View GitHub Profile
@tjkendev
tjkendev / ctf2014a-a.py
Last active May 12, 2016 04:10
Code Thanks Festival A日程 各問題の提出ソース(A~FはAC, GはWAしたもの)
a, b = map(int, raw_input().split())
print a*4 + b*2
@tjkendev
tjkendev / cf-final-a.py
Last active May 12, 2016 04:09
Code Festival 2015 決勝問題 - submit
s,t,u = map(len,raw_input().split())
print "valid" if s==5 and t==7 and u==5 else "invalid"
@tjkendev
tjkendev / cf-mm-a.py
Created November 15, 2015 14:24
Code Festival 2015 朝プロMiddle - submit
n,k,m,r = map(int, raw_input().split())
s = sorted((input() for i in xrange(n-1)), reverse=True)
sk = sum(s[:k])
sk1 = sum(s[:k-1])
if sk>=r*k:
print "0"
else:
p = r*k-sk1
print p if 0<=p<=m else "-1"
@tjkendev
tjkendev / cf-relay-g.cpp
Last active May 12, 2016 04:10
Code Festival 2015 チーム対抗リレー - submit
#include<iostream>
#include<string>
#include<vector>
#include<queue>
#include<stack>
#include<map>
#include<set>
#include<algorithm>
#include<functional>
#include<cstdio>
@tjkendev
tjkendev / cf-sc-a.py
Created November 15, 2015 15:46
Code Festival 2015 短縮王 - submit
# 69Byte
n=input();s=map(input,[""]*n);print"Pass"if sum(s)<2*n*s[0]else"Fail"
@tjkendev
tjkendev / coderunner-final.py
Created December 12, 2015 09:24
Code Runner 決勝用に書いたソースコード
# -*- encoding: utf-8 -*-
import urllib2, time, os
import itertools, random
import socket
urlopen = urllib2.urlopen
random.seed()
rand = random.randint
randf = random.random
@tjkendev
tjkendev / incomplete_unlambda.py
Last active February 28, 2017 08:49
pythonでラムダ式使ってunlambdaを実行しようとして失敗したもの。関数cがcall/ccとして書けない。
# -*- encoding: utf-8 -*-
u"""
Unlambdaをpython上で実行するプログラム
"""
import sys
import inspect
import greenlet
# User Exception
class UnlambdaSyntaxError(Exception):
@tjkendev
tjkendev / BitMatrix.py
Last active May 13, 2016 01:43
ビット行列の計算をPythonでするよ
# -*- encoding: utf-8 -*-
# 以下を参考にさせていただきました
# http://anond.hatelabo.jp/20151220172711
class BitMatrix:
def __init__(self, n=0, m=0, l=8):
self.n = n; self.m = m
self.mat = [[0] * ((m+l-1)/l) for i in xrange((n+l-1)/l)]
self.l = l
self.mask = 2**(l**2)-1
self.nr = range((n+l-1)/l)
@tjkendev
tjkendev / SAIS.py
Last active January 18, 2020 14:22
pythonで実装したSA-IS (線形のSuffix Array構築アルゴリズム)
# encoding: utf-8
from collections import Counter
def SAIS(lst, num):
l = len(lst)
if l<2: return lst+[0]
lst = lst + [0]
l += 1
res = [None] * l
# L-type(t[i] = 0) or S-type(t[i] = 1)
# s{i} < s{i+1} --> iはS-type
@tjkendev
tjkendev / DSL_2_C.py
Last active June 21, 2016 17:29
領域木(kd木) (from AOJ DSL_2-C : Range Query - Range Search (kD Tree))
# TLE(http://judge.u-aizu.ac.jp/onlinejudge/review.jsp?rid=1843450)
# もうちょっと高速化したい
import sys
readline = sys.stdin.readline
from bisect import bisect, bisect_right
from itertools import chain
n = input()
n0 = 2**n.bit_length()
data = [None]*(n0*2)
# セグメント木の構築