OJ Board

carofe82

The brute force algo won't pass in Java. The O(n^2 log(n)) does and it is the best algorithm.

carofe82

mr.wa,
I think you need to put the Node and the Graph class inside the Main class

public class Main{
    ...
    
    static class Graph{
    ...
    }
    
    static class Node{
    ...
    }
    
}

carofe82

Hi,
Is the UVa planning to support Java 8? there are some good features in Java 8 that can help us to make our code more readable.

Thank you,
Carlos.

OJ Board

Search found 3 matches

Re: 10125 - Sumsets

Re: 459 - Graph Connectivity

Java 8 Support