GrPA 4 Loops Application Graded

Week 3 GrPA

GrPA 4 Loops Application Graded 👨‍💻

Instructions

Question ❓

You are tasked with writing a program that can handle various tasks based on the input. The first line of the input represents the task to be performed. The possible tasks are:

factors - Find the factors of a number n (including 1 and itself) in ascending order.

find_min - Take n numbers from the input and print the minimum number. prime_check - Check whether a given number is prime or not.

is_sorted - Check if all characters of the given string from input are in alphabetical order. Print the output as “True” or “False” accordingly.

any_true - Take n numbers from input and check if any of the numbers are divisible by 3. Print the output as “True” or “False” accordingly.

manhattan - Take inputs directions such as “UP”, “DOWN”, “LEFT” and “RIGHT” from the input until the input is “STOP”. Assume you are starting from (0,0) in a cartesian coordinate. Find the Manhattan distance between the starting point and the ending point by following the steps in the cartesian plane.

Write a program to solve these tasks. Use loops where necessary.

Python Code 🐍

1
2
3
4
5
6
# this is to ensure that you cannot use the built in any, all and min function for this exercise but you can use it in the OPPEs.
any = None 
all = None
min = None 

task = input()

Python Code Solution ✅

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
any = None 
all = None
min = None 

task = input()

if task == "factors":
    n = int(input())
    for i in range(1, n + 1):
        if n % i == 0:
            print(i)

elif task == "find_min":
    count = int(input())
    first = int(input())
    minimum = first
    for _ in range(count - 1):
        num = int(input())
        if num < minimum:
            minimum = num
    print(minimum)

elif task == "prime_check":
    n = int(input())
    if n < 2:
        print("False")
    else:
        is_prime = True
        for i in range(2, int(n ** 0.5) + 1):
            if n % i == 0:
                is_prime = False
                break
        print("True" if is_prime else "False")

elif task == "is_sorted":
    s = input()
    sorted_flag = True
    for i in range(1, len(s)):
        if s[i] < s[i - 1]:
            sorted_flag = False
            break
    print("True" if sorted_flag else "False")

elif task == "any_true":
    count = int(input())
    found = False
    for _ in range(count):
        num = int(input())
        if num % 3 == 0:
            found = True
    print("True" if found else "False")

elif task == "manhattan":
    x, y = 0, 0
    while True:
        direction = input()
        if direction == "STOP":
            break
        if direction == "UP":
            y += 1
        elif direction == "DOWN":
            y -= 1
        elif direction == "LEFT":
            x -= 1
        elif direction == "RIGHT":
            x += 1
    print(abs(x) + abs(y))