dzięki

Thank you

Thank you very much 😎

for sure 🖤

🖤🖤🖤

Thank you 🙂

🖤

Dzięki. Tak cały czas szukam kupuje i kolekcjonuje stare nowe vinyle także za niedługo znów coś nagram 😁

🖤

Thank You Daniela 🖤

🖤

Dzięki

Thank you

klasyka 😃

Thank you so much !

Thank you !

No tak kuriozum nie ma końca przepławkę dla ryb też wybudowali tak że jest równo z barierą elektryczną. Jedno wyklucza drugie bo nic tam nie podejdzie. Głupota, aż boli.

Thanks !

Niestety nie mam

Thank you

Thank you

🖤

thank you

Thank you

Thank you

// A class to represent a point class Point { int x, y, z; // Constructor Point(int x, int y, int z) { this.x = x; this.y = y; this.z = z; } } // A class to represent a graph class Graph { // A list of points List<Point> points; // Constructor Graph(List<Point> points) { this.points = points; } // A method to find the distance between two points double distance(Point p1, Point p2) { return Math.sqrt(Math.pow(p1.x - p2.x, 2) + Math.pow(p1.y - p2.y, 2) + Math.pow(p1.z - p2.z, 2)); } // A method to find the shortest path between two points using Dijkstra's algorithm List<Point> shortestPath(Point start, Point end) { // A map to store the distance of each point from the start point Map<Point, Double> dist = new HashMap<>(); // A map to store the previous point of each point on the shortest path Map<Point, Point> prev = new HashMap<>(); // A priority queue to store the points by their distance from the start point PriorityQueue<Point> queue = new PriorityQueue<>((p1, p2) -> Double.compare(dist.get(p1), dist.get(p2))); // Initialize the distance of each point to infinity for (Point p : points) { dist.put(p, Double.POSITIVE_INFINITY); } // Initialize the distance of the start point to zero dist.put(start, 0.0); // Add the start point to the queue queue.add(start); // Loop until the queue is empty or the end point is reached while (!queue.isEmpty()) { // Remove the point with the minimum distance from the queue Point p = queue.poll(); // If the end point is reached, break the loop if (p.equals(end)) { break; } // For each neighbor of the current point for (Point q : points) { // If the neighbor satisfies the equation x + y = z and x <= 20 if (q.x + q.y == q.z && q.x <= 20) { // Calculate the distance to the neighbor double d = distance(p, q); // If the distance to the neighbor is smaller than the current distance if (dist.get(p) + d < dist.get(q)) { // Update the distance to the neighbor dist.put(q, dist.get(p) + d); // Update the previous point of the neighbor prev.put(q, p); // Add the neighbor to the queue queue.add(q); } } } } // A list to store the shortest path List<Point> path = new ArrayList<>(); // If the end point is reachable if (dist.get(end) < Double.POSITIVE_INFINITY) { // Trace back the path from the end point to the start point Point p = end; while (p != null) { // Add the point to the path path.add(p); // Move to the previous point p = prev.get(p); } // Reverse the path Collections.reverse(path); } // Return the path return path; } }

Thank you 🖤

🖤

🖤