牛客网刷题：python

1、求素数

def prime(n):
    if n<=1:
        return 0
    for i in range(2,int(math.sqrt(n)+1)):
        if n%i==0:
            return 0
    return 1
for i in range(2,100000):
    if prime(i):
        count+=1
        if count>=begin and count<=end:
            primes.append(i)
        if count==10000:
            print i


# print primes
primes = [str(i) for i in primes]
print "\n".join([i + 10 > len(primes) and " ".join(primes[i:]) or " ".join(primes[i:i+10]) for i in range(len(primes)) if i % 10 == 0])

2、密码解密

# coding : utf-8

a, b, c, d = raw_input(), raw_input(), raw_input(), raw_input()

DAY = {'A': 'MON', 'B': 'TUE', 'C': 'WED', 'D': 'THU', 'E': 'FRI', 'F': 'SAT', 'G': 'SUN'}

HH = {"0": "00", "1": "01", "2": "02", "3": "03", "4": "04", "5": "05", "6": "06", "7": "07", "8": "08", "9": "09",
      "A": "10", "B": "11", "C": "12", "D": "13", "E": "14", "F": "15", "G": "16", "H": "17", "I": "18", "J": "19",
      "K": "20", "L": "21", "M": "22", "N": "23"}

count = 0
day = ""
while True:
    if a[count] == b[count]:
        if day != "":
            hh = a[count]
            break
        elif (a[count] in DAY.keys()) and (b[count] in DAY.keys()):
            day = a[count]
    count += 1
count = 0
lst = range(97, 123)
while True:
    if ord(c[count]) in lst:
        if c[count] == d[count]:
            break
    count += 1

print DAY[day], HH[hh] + ':%02d' % (count)