| import sys | |
| from heapq import heappush, heappop | |
| class Dijkstra: | |
| def __init__(self, adjacents): | |
| self.adj = adjacents | |
| self.n = len(adjacents) | |
| def dijkstra(self, start): | |
| dis, vis, hq = {}, {}, [] |
| class KMP: | |
| def partial(self, pattern): | |
| """ Calculate partial match table: String -> [Int]""" | |
| ret = [0] | |
| for i in range(1, len(pattern)): | |
| j = ret[i - 1] | |
| while j > 0 and pattern[j] != pattern[i]: | |
| j = ret[j - 1] | |
| ret.append(j + 1 if pattern[j] == pattern[i] else j) |
| class NQueen: | |
| # @return a list of lists of string | |
| def solveNQueens(self, n): | |
| self.__ans = [] | |
| self.__stack = [] | |
| self.__n = n | |
| self.solve(0) | |
| return self.__ans | |
Every so often I have to restore my gpg keys and I'm never sure how best to do it. So, I've spent some time playing around with the various ways to export/import (backup/restore) keys.
cp ~/.gnupg/pubring.gpg /path/to/backups/
cp ~/.gnupg/secring.gpg /path/to/backups/
cp ~/.gnupg/trustdb.gpg /path/to/backups/