.
package com.javarush.task.pro.task08.task0818;
import java.util.Arrays;
/*
Путь через аномалию
*/
public class Solution {
public static int[][] anomalySpace = new int[][]{
{383, 961, 904}, {769, 887, 770}, {184, 608, 406}, {310, 821, 445}, {412, 908, 158},
{562, 844, 573}, {260, 880, 230}, {635, 254, 756}, {816, 754, 508}, {947, 195, 379},
{576, 678, 682}, {207, 653, 588}, {901, 315, 223}, {310, 561, 255}, {199, 356, 350},
{971, 276, 974}, {413, 829, 494}, {344, 345, 322}, {889, 713, 222}, {628, 963, 234},
{254, 428, 926}, {633, 762, 848}, {896, 130, 653}, {971, 636, 861}, {328, 976, 139}};
public static double[] safeRoute = new double[25];
public static void main(String[] args) {
for (int x = 0; x < anomalySpace.length; x++) {
for (int y = 0; y < anomalySpace.length; y++) {
for (int z = 0; z < anomalySpace.length; z++) {
double num = Math.sin(x) * Math.PI + Math.cos(y) * Math.min(x,Math.min(y, z)) + tn(y) / ln(z);
if (num == 100 && num == 200) {
Arrays.fill(safeRoute, num);
}
}
}
}
}
}