def main(argv): number = files.read_int(argv[0]) perms = list(permutations([i + 1 for i in xrange(number)])) print len(perms) for perm in perms: print ' '.join([str(i) for i in perm])
def main(argv): k = files.read_int(argv[0]) kmers = [''.join(p) for p in product('01', repeat=k)] edges = graphs.debruijn_graph(kmers) path = graphs.eulerian_cycle(edges[0][0], edges) print genetics.reconstruct_circular_string_from_path(path)
def main(argv): n = files.read_int(argv[0]) N = 2 * n cum = [] for i in xrange(1, N + 1): cum.append(math.log10(probs.binomial_cumulative(N, i, 0.5))) print ' '.join('%0.3f' % val for val in cum)
def main(argv): N = files.read_int(argv[0]) print(math.factorial(N))
def main(argv): n = files.read_int(argv[0]) print combinatorics.double_factorial((2 * n) - 3) % 1000000
def main(argv): N = files.read_int(argv[0]) print('\n'.join('%s' % row for row in staircase(N)))
def main(argv): print files.read_int(argv[0]) - 2
def main(argv): N = files.read_int(argv[0]) print pow(2, N, 1000000)
def main(argv): int_mass = table.integer_mass(argv[0]) mass = files.read_int(argv[1]) print genetics.count_peptides_with_mass(mass, int_mass)
def main(argv): M = files.read_int(argv[0]) print(1 if (sum_digits(M) == sum([sum_digits(f) for f in prime_factors(M)])) else 0)
def main(argv): print combinatorics.fibonacci(files.read_int(argv[0]))