Sites com problemas computacionais

-
Veja abaixo alguns links onde é possível treinar a resolução de problemas de programação:

- SPOJ: http://br.spoj.com/

- UVA: http://uva.onlinejudge.org/

- Coderbyte: http://coderbyte.com/

- URI: http://www.urionlinejudge.com.br/

Comments

Post a Comment

Popular posts from this blog

(Coderbyte) Powers of Two - Solução

-
Have the function PowersofTwo( num ) take the num parameter being passed which will be an integer and return the string true if it's a power of two. If it's not return the string false . For example if the input is 16 then your program should return the string true but if the input is 22 then the output should be the string false. Solução: import java.util.*; import java.io.*; class Function {    String PowersofTwo(int num) {       for (int i = 0; Math.pow(2, i) <= num; i++) {       if (Math.pow(2, i) == num) {            return "true";       }     }            return "false";       }     public static void main (String[] args) {      // keep this function call here         Scanner  s = new Scanner(Sy...
Read more

(Hacker Rank) Kruskal (MST): Really Special Subtree - Solution

-
Link to the problem: https://www.hackerrank.com/challenges/kruskalmstrsub This problem requires to find the minimum spanning tree of the given graphs using Kruskal's algorithm. Although the problem gives a stating node, the solution below starts using the edge whose weight is the minimum. import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution {     public static ArrayList<Edge> edges;     public static int[] nodeParent;     public static int[] depth;         public static int root(int n) {         while (n != nodeParent[n]) {             n = nodeParent[n];         }         return n;     }         public static boolean union(int ...
Read more

(Hacker Rank) Dijkstra: Shortest Reach 2 - Solution

-
Link to the problem: https://www.hackerrank.com/challenges/dijkstrashortreach Once the problem asks us to find the shortest distance from a node to all the other nodes, and all the edges in the graph are weighted, a good way to solve this problem is using Dijkstra. import java.io.*; import java.util.*; import java.text.*; import java.math.*; import java.util.regex.*; public class Solution {     public static HashMap<Integer, ArrayList<Edge>> adjList;         public static Comparator<Edge> costComparator = new Comparator<Edge>() {         public int compare(Edge e1, Edge e2) {             return e1.cost-e2.cost;         }        };         public static void dijkstra(int start, int[] shortestPaths) {      ...
Read more