Skip to content

Instantly share code, notes, and snippets.

function! Alt()
let c = nr2char(getchar() + 128)
exec 'normal gi'.c
endfunction
inoremap <C-i> <C-o>:call Alt()<cr>
Command: Format.AlignBottoms
Id: 5efc7975-14bc-11cf-9b2b-00aa00573819 1
Binding: VC Dialog Editor::Ctrl+Shift+Down Arrow
Key Binding: VC Dialog Editor VC Dialog Editor::Ctrl+Shift+Down Arrow
Command: Format.AlignMiddles
Id: 5efc7975-14bc-11cf-9b2b-00aa00573819 2
Binding: VC Dialog Editor::F9
Key Binding: VC Dialog Editor VC Dialog Editor::F9
Command: Format.AlignLefts
Id: 5efc7975-14bc-11cf-9b2b-00aa00573819 3
>+>+>++++<[>[-<+++++>]<<]>
qaqqbqqaj@bkk:if getline('.') != '0' | exe 'normal !a' | endif
qqb<C-x>k5<C-a>j:if getline('.') != '0' | exe 'normal @b' | endif
qj<C-a>j<C-a>j4<C-a>k@ak
#Input: (0, 0, 0)
#Output:
* * *
----------- -------
/ * \ |*|*|*|
/* * *\ |*|*|*|
/ * * * \ |*|*|*|
| * * | |*|*|*|
|* * * * * *| |*|*|*|
------- ------- -------
from math import ceil as c
def best_score(n):
score = lambda l:abs(l[1]-l[0])+(l[0]*l[1]-n)
possible = []
for i in range(1,n+1):
possible.append((i, c(n/i)))
return min(possible, key=score)
for i in range(1, 100):
Input: windmills
Output:
-----------
windmills