pythagorean

I have implemented a simple Dijkstra's algorithm for finding the shortest path on an .osm map with Java. The pathfinding in a graph which is created from an .osm file works pretty well. But in case the user's current location and/or destination is not a node of this graph (just raw coordinates) how do we 'link' those coordinates to the graph to make pathfinding work? The simple straightforward solution "find the nearest to the current location node and draw a straight line" doesn't seem to be realistic. What if we have a situation like on the attached picture? (UPD) The problem here is that

I can find out Pythagorean triplets using for loop as follows: def triplet(n): # Find all the Pythagorean triplets between 1 and n (inclusive) for a in range(n+1): for b in range(a): for c in range(b): if a*a == b*b + c*c: print(a, b, c) I wanted to replace this with a one-liner using list comprehension and tried the following piece: [a, b, c in range(n+1), range(a), range(b) if a*a == b*b + c*c] But, I get a syntax error on the closing square bracket. I tried to change the list into tuple using simple brackets, but with no success. May I know how to get it right? I think you mean [(a,b,c) for

A Pythagorean triplet is a set of three natural numbers, a < b < c, for which, a 2 + b 2 = c 2 For example, 3 2 + 4 2 = 9 + 16 = 25 = 5 2 . There exists exactly one Pythagorean triplet for which a + b + c = 1000. Find the product abc. Source : http://projecteuler.net/index.php?section=problems&id=9 I tried but didn't know where my code went wrong. Here's my code in C: #include <math.h> #include <stdio.h> #include <conio.h> void main() { int a=0, b=0, c=0; int i; for (a = 0; a<=1000; a++) { for (b = 0; b<=1000; b++) { for (c = 0; c<=1000; c++) { if ((a^(2) + b^(2) == c^(2)) && ((a+b+c) ==1000))