ios – How to calculate the total distance between points covered by a taxi when my pick-up and drop-off location is the same?

I am working on an application related to the cabin. But I have a problem: if my starting point is the same, how can I calculate the distance traveled by the cabin at that time?

Currently, I am calculating the distance from one coordinate to another using the code mentioned below.

func calculatesDistance (pickLat: String, pickLong: String, dropLat: String, dropLong: String) {
let Coordinate0 = CLLocation (latitude: Double (pickLat)!, longitude: Double (pickLong)!)
let Coordinate1 = CLLocation (latitude: Double (dropLat)!, longitude: Double (dropLong)!)

let distanceInMeters = Coordinate0.distance (from: Coordinate1) // the result is in meters.
print (distanceInMeters)
}

It's a normal process that I'm doing. Please help me.

Get 57 points – Easy task

Instructions:
1. Open and enjoy the video.
2. Play the video until the end.
3. Comment on the video.
4. Go back here and answer your Youtube user name so that I can check and send you the reward.

Code:

https://www.youtube.com/watch?v=oYXoiCODXBY

Multiplication of Bitcoin points

Does any one know he or does he have any idea of ​​how, in python, multiplying points or reversing points? I do not think about scalar multiplication (aA), I know it.
I need one
B

Multiplication of effective integers using BDD and fixed points

Suppose we have two sets A, B of size n, k respectively, which are sets of non-negative integers each coded with N bits, and which we would like to form a set of bit strings of length 3N and [maximum] size n * k such that they represent all possible multiplications of integers, one taken from A and the other from B. Thus, if one of the sets is { 1,2} and the other {3,4} (in bits), the result set must be {1 * 3, 1 * 4, 2 * 3, 2 * 4}.

Assume that A, B are given as binary decision diagrams (BDD) and that we would like to compute the multiplication set also in the form of a binary decision diagram, representing the bit strings of all the multiplication results.

Now, it is well known that the BDDs representing the multiplication, even if A, B were of size 1 each, have an exponential size. Otherwise, we could factor integers in polynomial time.

My question is whether the multiplication set can be calculated in polynomial time, but by iterating BDD operations until reaching a fixed point. In this way, we will not be able to factor integers (at least not easily). For example, it is well known that we can calculate the addition of binary numbers by iterating AND and XOR until a fixed point is reached (each step gives an intermediate addition and a holdback, to be added until that the postponement is null).

I need this for the practical implementation of mine, where indeed I have two sets of integers at fixed bit widths represented in BDDs, and I would like to calculate their multiplication, without having to "decompress" BDDs into real numbers, each BDD can encode many numbers.

Get a request in the share points _api / web / siteusers

I have created an application in SharePoint and I want this application to query the list of users of the site:
https://test.sharepoint.com/_api/web/siteusers. I have given the application the following permissions in the application authorization XML application using this URL:
https://test.sharepoint.com/_layouts/15/AppInv.aspx

    
    

So, basically, I trigger a feed when something is added to a list of share points and I get the access token by running a post
request at https://accounts.accesscontrol.windows.net/common/tokens/OAuth/2
combining the client identifier, appid and tenantid of the sharepoint application that I created, in the body of the application.

I then use this access code below to query the site's user list

When I execute a get query in the stream or in the fiddler:

GET https://test.sharepoint.com/_api/web/siteusers
Accept: application / json; odata = verbose
Content type: application / json; odata = nometadata
Host: test.sharepoint.com
Authorization: carrier 

I receive the following:

"Access denied, you are not authorized to perform this action or access this resource." or {"odata.error": {"code": "- 2147024891, System.UnauthorizedAccessException", "message": {"lang": "en-US", "value": "Access denied.
You are not authorized to perform this action or access this resource. "}}}

Can someone show me the right direction?

Thank you.

Get 56 points – Easy task

Instructions:
1. Open and enjoy the video.
2. Play the video until the end.
3. Comment on the video.
4. Go back here and answer your Youtube user name so that I can check and send you the reward.

Code:

https://www.youtube.com/watch?v=WQCOWTUXiNQ

python – CrossOver with 2 points

Hello, I need a genetic algorithm function that gets 2 parents, as well as the number of points and the crossing generating their children. My function for the moment only works to make the crossing using 1 point, I must also work for the crossing with 2 points.

cross cross (parent1, parent2, points):
index = int (np.random.uniform (bottom = 1, top = len (parent1) -1)) # the random point between 1 and 1 is always 1
child1 = np.hstack ([parent1[:index], parent2[index:]])
child2 = np.hstack ([parent2[:index], parent1[index:]])
returns the child1, the child2
crossing[0,1,2,3,4,5],[6,7,8,9,10,11], 0)

Get 55 points – Easy task

Instructions:
1. Open and enjoy the video.
2. Play the video until the end.
3. Comment on the video.
4. Go back here and answer your Youtube user name so that I can check and send you the reward.

Code:

https://www.youtube.com/watch?v=xt39evOsGEw

Applications – How often does Waze update points on the map while driving?

Today, before going to work by car, I opened Waze and he posted the gas stations near me, as planned.

I then noticed that after traveling 10 miles, the map always indicated the old points. The map was not refreshing. I had to close the application and open it to see the new points closest to me.

My question: how often does Waze update the map while I'm driving?

Thank you.

Get 59 points – Easy task

Instructions:
1. Open and enjoy the video.
2. Play the video until the end.
3. Comment on the video.
4. Go back here and answer your Youtube user name so that I can check and send you the reward.

Code:

https://www.youtube.com/watch?v=EjMpt5laJmE