MCPcopy Create free account
hub / github.com/algorithmzuo/algorithm-journey / main

Method main

src/class129/Code05_RoadTrip.java:64–92  ·  view source on GitHub ↗
(String[] args)

Source from the content-addressed store, hash-verified

62 public static int n, m;
63
64 public static void main(String[] args) throws IOException {
65 BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
66 StreamTokenizer in = new StreamTokenizer(br);
67 PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
68 in.nextToken();
69 n = (int) in.nval;
70 for (int i = 1; i <= n; i++) {
71 in.nextToken();
72 arr[i] = (int) in.nval;
73 }
74 near();
75 st();
76 in.nextToken();
77 int x0 = (int) in.nval;
78 out.println(best(x0));
79 in.nextToken();
80 m = (int) in.nval;
81 for (int i = 1; i <= m; i++) {
82 in.nextToken();
83 int s = (int) in.nval;
84 in.nextToken();
85 int x = (int) in.nval;
86 travel(s, x);
87 out.println(a + " " + b);
88 }
89 out.flush();
90 out.close();
91 br.close();
92 }
93
94 public static void near() {
95 for (int i = 1; i <= n; i++) {

Callers

nothing calls this directly

Calls 7

nearMethod · 0.95
stMethod · 0.95
bestMethod · 0.95
travelMethod · 0.95
printlnMethod · 0.45
flushMethod · 0.45
closeMethod · 0.45

Tested by

no test coverage detected