md2perpe

import itertools

def primes():

    def sieve(numbers):
        try:
            n = next(numbers)
            yield n
            yield from sieve(filter(lambda m: m%n!=0, numbers))
        except StopIteration:

md2perpe

#!/usr/bin/env python3

import sys
import fileinput
import re

if sys.argv[2] == "merge":
    with fileinput.input(sys.argv[1], inplace=True) as f:
        for line in f:
            if line.startswith("Merge branch"):

md2perpe

from itertools import count, cycle

for (n, d3, d5) in zip(count(0), cycle([True, False, False]), cycle([True, False, False, False, False])):
  print(("Fizz" if d3 else "")+("Buzz" if d5 else "") or str(n))

md2perpe

# Solve:
#    LETA
#   +TALL
#   =====
#   CACHE

for a in range(10):
  for e in range(10):
    for l in range(10):
      for t in range(10):

md2perpe

*.o

md2perpe

# https://www.facebook.com/groups/270834543757117/?creative_provider_id=admin_can_post_branded_content&notif_id=1607539332809717&notif_t=qp_notifs_pups_notification_to_mall_dogfood_1730789509&ref=notif

N = 10

for i in range(N):
  print("He" * i)
  print("Ha" * i)
  print("Hi" * i)

md2perpe

function permutations(list)
{
	// Empty list has one permutation
	if (list.length == 0)
		return [[]];
		
		
	var result = [];
	
	for (var i=0; i<list.length; i++)

md2perpe

# Maximum unattacked squares

def attacked_from_square(r, c):
    attacked = set([])
    for i in range(5):
        attacked.add((r,i))
        attacked.add((i,c))
        if 0<=r+i<5 and 0<=c+i<5:
            attacked.add((r+i,c+i))
        if 0<=r+i<5 and 0<=c-i<5:

md2perpe

################
known_domains = {
  "hotmail.com": [],
  "gmail.com": [],
  "yahoo.com": [],
  "mail.ru": [],
}
notfound = []
################

md2perpe

We couldn’t find that file to show.