Tuple unpacking and the mapping problem.

Question

I'm stuck on the problem that has to do with tuple unpacking with mapping software. I am asked to output the shortest distance from the point (0, 0) out of a list of points. The code I have feels right but the test case says it is wrong and the test case is hidden so I have no idea if I'm close or if it is problem with the final number not being rounded. Can anybody tell me where I am doing wrong? Here's my code.

import math

# Calculate and output the distance to the closest point from
# the point (0, 0)

points = [
(12, 55),
(880, 123),
(64, 64),
(190, 1024),
(77, 33),
(42, 11),
(0, 90)
]

distances = []
for (x, y) in points:
z = math.sqrt((x ** 2) + ( y ** 2))
distances.append([z])
print(min(distances))

Answer 1

This works fine, without importing math:

points = [
(12, 55),
(880, 123),
(64, 64),
(190, 1024),
(77, 33),
(42, 11),
(0, 90)
]
#your code goes here

distances = []

for (x, y) in points:
distances.append((x**2 + y**2)**0.5)

print(min(distances))

Answer 2

#can be modify
import math

points = [
(12, 55),
(880, 123),
(64, 64),
(190, 1024),
(77, 33),
(42, 11),
(0, 90)
]

list1=[]
for (x,y) in points:
distance=math.sqrt(x**2+y**2)
list1.append(distance)
print(min(list1))

Answer 3

This worked for me:

from math import sqrt

points = [
(12, 55),
(880, 123),
(64, 64),
(190, 1024),
(77, 33),
(42, 11),
(0, 90)
]
#your code goes here
distancias = []
for (x,y) in points:
elemento = sqrt(x**2+y**2)
distancias.append(elemento)

print (min(distancias))

Answer 4

since its a tuple, you need another for loop to iterate over those values. OR call them directly

dustances = []
for pair in points:
for x,y in pair:
.....
.....

AND the best way to test is to give input you know the answer too and Print your variables! Dkn't matter how the code "feels" or if test cases are hidden

Answer 5

Slick
I tried this but it did not work
points = [
(12, 55),
(880, 123),
(64, 64),
(190, 1024),
(77, 33),
(42, 11),
(0, 90)
]
distances = []
for pair in points:
for x,y in pair:
z=((x**2)+(y**2))
distances.appened([z])
print(min(distances))

Answer 6

yup, that code would only append the last sum of squares.

distances.append(z) needs to be in the second for loop, not the first

Answer 7

i don't get

Answer 8

put the code in the playground and link here

Answer 9

https://code.sololearn.com/ciG4JI6Z5Hhe/?ref=app

Answer 10

https://code.sololearn.com/c92PWMzbcZT4/?ref=app

ended up, dropping the second loop because Im unable to unpack integers. But using indexing, you can access each tuple pair and get the values

Answer 11

Slick it still did not work

Answer 12

What do you mean? the code does exactly what its written. What kind of output do you want?

the code adds the squares of each numer in the list and prints the smallest total.

Answer 13

Slick here is the queestion
You are working on a mapping software. The map is stored as a list of points, where each item is represented as a tuple, containing the X and Y coordinates of the point.
You need to calculate and output the distance to the closest point from the point (0, 0).
To calculate the distance of the point (x, y) from (0, 0), use the following formula: √x²+y²
You can iterate over the list and use tuple unpacking to get the x and y coordinates of each point: for (x, y) in points: and output the smallest value.

I can't know what exactly the problem is because it is only one test case

Answer 14

You can though, just do the problem out on paper with serveral examples the right way. Then try each set of examples in the code. If the answers match, you did it right. Then try it out in the code coach. If it doesnt pass, then its the math thats wrong. You gotta figure out the math, we'll be here to help with the coding

Answer 15

I decided to go straight to the smallest distance instead of creating another list with all distances. By using 'for x, y in points' no second loop is necessary.

import math

points = [
(12, 55),
(880, 123),
(64, 64),
(190, 1024),
(77, 33),
(42, 11),
(0, 90)
]
#your code goes here
distance = int()
for x, y in points:
distance = math.sqrt(x**2 + y**2)
shortest = distance if distance < shortest or shortest == 0 else shortest

print(shortest)

Answer 16

points = [
(12, 55),
(880, 123),
(64, 64),
(190, 1024),
(77, 33),
(42, 11),
(0, 90)
]

distances = [(x**2 + y**2) ** 0.5 for x, y in points]
print(min(distances))

Answer 17

points = [
(12, 55),
(880, 123),
(64, 64),
(190, 1024),
(77, 33),
(42, 11),
(0, 90)
]
#your code goes here
new_list=[]
for num1,num2 in points:
result = (num1**2+num2**2)**0.5
new_list.append(result)

print (min(new_list))

Answer 18

how about my short way ;)

import math

points = [
(12, 55),
(880, 123),
(64, 64),
(190, 1024),
(77, 33),
(42, 11),
(0, 90)
]

daftar =[ math.sqrt(pow(x,2)+pow(y,2)) for(x,y) in points]
print(min(daftar))

Answer 19

try this,

points = [
(12, 55),
(880, 123),
(64, 64),
(190, 1024),
(77, 33),
(42, 11),
(0, 90)
]
distances = []

for (x, y) in points:
distances.append((x**2 + y**2)**0.5)

print(min(distances))

Answer 20

points = [
(12, 55),
(880, 123),
(64, 64),
(190, 1024),
(77, 33),
(42, 11),
(0, 90)
]
#your code goes here

distances = []

for (x, y) in points:
distances.append((x**2 + y**2)**0.5)

print(min(distances))