CS50 Problem Set 6#

1
name = input("What is your name? ")
2

3
print(f"hello, {name}")

1
while True:
2
    try:
3
        h = int(input("Height: "))
4

5
        if 1 <= h <= 8:
6
            break
7
        else:
8
            print("", end='')
9
    except ValueError:
10
        print("", end='')
11

12
for i in range(1, h+1):
13
    for j in range(0, h-i):
14
        print(" ", end='')
15
#        j += 1
16

17
    for k in range(0, i):
18
        print("#", end='')
19
#        k += 1
20

21
    print("  ", end='')
22

23
    for m in range(0, i):
24
        print("#", end='')
25
#        m += 1
26

27
    print()

1
while True:
2
    number = input("Number: ")
3
    if number.isdigit() == True:
4
        break
5
    else:
6
        number = input("Number: ")
7

8
reversed_number = number[::-1]
9

10
if len(number) == 15:
11
    sum = 0
12
    temp_sum_1 = 0
13
    temp_sum_2 = 0
14
    if number[:2] != "37" and number[:2] != "34":
15
        print("INVALID")
16
    else:
17
        for i in range(1, 15, 2):
18
            temp = int(reversed_number[i]) * 2
19
            if temp > 9:
20
                temp = temp // 10 + temp % 10
21
            temp_sum_1 += temp
22

23
        for i in range(0, 15, 2):
24
            temp = int(reversed_number[i])
25
            temp_sum_2 += temp
26

27
        sum = temp_sum_1 + temp_sum_2
28
        if sum % 10 == 0:
29
            print("AMEX")
30
        else:
31
            print("INVALID")
32

33
elif len(number) == 13:
34
    sum = 0
35
    temp_sum_1 = 0
36
    temp_sum_2 = 0
37
    if number[:1] != "4":
38
        print("INVALID")
39
    else:
40
        for i in range(1, 13, 2):
41
            temp = int(reversed_number[i]) * 2
42
            if temp > 9:
43
                temp = temp // 10 + temp % 10
44
            temp_sum_1 += temp
45

46
        for i in range(0, 13, 2):
47
            temp = int(reversed_number[i])
48
            temp_sum_2 += temp
49

50
        sum = temp_sum_1 + temp_sum_2
51
        if sum % 10 == 0:
52
            print("VISA")
53
        else:
54
            print("INVALID")
55

56
elif len(number) == 16:
57
    sum = 0
58
    temp_sum_1 = 0
59
    temp_sum_2 = 0
60
    if number[:1] != "4" and number[:2] != "51" and number[:2] != "52" and number[:2] != "53" and number[:2] != "54" and number[:2] != "55":
61
        print("INVALID")
62
    elif number[:1] == "4":
63
        for i in range(1, 16, 2):
64
            temp = int(reversed_number[i]) * 2
65
            if temp > 9:
66
                temp = temp // 10 + temp % 10
67
            temp_sum_1 += temp
68

69
        for i in range(0, 16, 2):
70
            temp = int(reversed_number[i])
71
            temp_sum_2 += temp
72

73
        sum = temp_sum_1 + temp_sum_2
74
        if sum % 10 == 0:
75
            print("VISA")
76
        else:
77
            print("INVALID")
78
    else:
79
        for i in range(1, 16, 2):
80
            temp = int(reversed_number[i]) * 2
81
            if temp > 9:
82
                temp = temp // 10 + temp % 10
83
            temp_sum_1 += temp
84

85
        for i in range(0, 16, 2):
86
            temp = int(reversed_number[i])
87
            temp_sum_2 += temp
88

89
        sum = temp_sum_1 + temp_sum_2
90
        if sum % 10 == 0:
91
            print("MASTERCARD")
92
        else:
93
            print("INVALID")
94

95
else:
96
    print("INVALID")

1
def words(text):
2
    words = 1
3
    for i in range(0, len(text)):
4
        if text[i] == ' ':
5
            words += 1
6
    return words
7

8

9
def letters(text):
10
    letters = 0
11
    for i in range(0, len(text)):
12
        if text[i].isalpha() == True:
13
            letters += 1
14
    return letters
15

16

17
def sentences(text):
18
    sentences = 0
19
    for i in range(0, len(text)):
20
        if text[i] == '.' or text[i] == '!' or text[i] == '?':
21
            sentences += 1
22
    return sentences
23

24

25
text = input("Text: ")
26

27
index = round(0.0588 * letters(text) / words(text) * 100 -
28
              0.296 * sentences(text) / words(text) * 100 - 15.8)
29

30
if index < 1:
31
    print("Before Grade 1")
32

33
elif index >= 16:
34
    print("Grade 16+")
35
else:
36
    print(f"Grade {index}")

1
import csv
2
import sys
3

4

5
def main():
6

7
    # TODO: Check for command-line usage
8
    if len(sys.argv) != 3:
9
        print("Missing command line arguments! ")
10
        sys.exit()
11

12
    # TODO: Read database file into a variable
13
    database = []
14
    with open(sys.argv[1], "r") as database_file:
15
        reader = csv.DictReader(database_file)
16
        for row in reader:
17
            database.append(row)
18

19
    # TODO: Read DNA sequence file into a variable
20
    sequence = []
21
    with open(sys.argv[2], "r") as sequence_file:
22
        sequence = sequence_file.read()
23

24
    # TODO: Find longest match of each STR in DNA sequence
25
    str_count = {}  # Initlize a list
26
    for key in database[0].keys():
27
        if key == "name":
28
            continue
29
        # When you insert a value but the key doesn't exist, python will create the key automatically and insert the value
30
        str_count[key] = longest_match(sequence, key)
31

32
    # TODO: Check database for matching profiles
33
    for row in database:
34
        match = True
35
        # 遍历所有的key，并去除'name'
36
        for key in row.keys():
37
            if key == "name":
38
                continue
39
            # 当row[key]与str_count[key]不相等时，返回false，继续下一个key
40
            if str_count[key] != int(row[key]):
41
                match = False
42
                break
43
        if match:
44
            print(row["name"])
45
            return
46
    print("No match")
47

48

49
def longest_match(sequence, subsequence):
50
    """Returns length of longest run of subsequence in sequence."""
51

52
    # Initialize variables
53
    longest_run = 0
54
    subsequence_length = len(subsequence)
55
    sequence_length = len(sequence)
56

57
    # Check each character in sequence for most consecutive runs of subsequence
58
    for i in range(sequence_length):
59

60
        # Initialize count of consecutive runs
61
        count = 0
62

63
        # Check for a subsequence match in a "substring" (a subset of characters) within sequence
64
        # If a match, move substring to next potential match in sequence
65
        # Continue moving substring and checking for matches until out of consecutive matches
66
        while True:
67

68
            # Adjust substring start and end
69
            start = i + count * subsequence_length
70
            end = start + subsequence_length
71

72
            # If there is a match in the substring
73
            if sequence[start:end] == subsequence:
74
                count += 1
75

76
            # If there is no match in the substring
77
            else:
78
                break
79

80
        # Update most consecutive matches found
81
        longest_run = max(longest_run, count)
82

83
    # After checking for runs at each character in sequence, return longest run found
84
    return longest_run
85

86

87
main()