UVa Online Judge Challenge "272"
“TEX is a typesetting language developed by Donald Knuth. It takes source text together with a few typesetting instructions and produces, one hopes, a beautiful document. Beautiful documents use…”
Problem
My Solution
import java.util.Scanner;
public class Main {
public static void main(String[] args){
Scanner sc = new Scanner(System.in);
boolean verticalMarks = false;
while (sc.hasNextLine()) {
StringBuilder sb = new StringBuilder();
String input = sc.nextLine();
for (int i = 0; i < input.length(); i++) {
if (input.charAt(i) == 34) {
if (!verticalMarks) {
sb.append("``");
verticalMarks = true;
} else if (verticalMarks) {
sb.append("''");
verticalMarks = false;
}
} else {
sb.append(input.charAt(i));
}
}
System.out.println(sb);
}
}
}
Related Reading
Related entries
Ranked from shared tags, categories, and keywords, with recent section entries used as a fallback.
UVa Online Judge Challenge "11045"
This is a maximum flow problem on a bipartite graph. I created the flow chart above to visualize the 3 test cases. The virtual judge run time was 0.18s.
UVa Online Judge Challenge "10305"
This problem presents a DAG and the solution requires implementing a topological sort. I noticed that a topological sort can be implemented using only boolean arrays so I used this as an opportunity to finally get around to using Java’s BitSet class. The virtual judge run time was 0.050s.
UVa Online Judge Challenge "572"
Although BFS and DFS were recommended solutions to the problem, I saw an opportunity to solve this problem using Disjoint Sets. The virtual judge run time was 0.050s.
UVa Online Judge Challenge "1112"
This problem involves a relatively small graph, so I opted to implement the Floyd-Warshall Algorithm instead of Dijkstra’s Algorithm for the sake of simplicity. This algorithm finds the shortest path between every pair of vertices in a graph, running in O(n^3) time. Although this might sound inefficient, the UVA judge accepted this program with a runtime of 0.12 seconds, which is well within the 3-second threshold. I designed this algorithm using an object-oriented approach and avoided arrays, so that if I ever have enough free time, I can easily integrate it into Processing and visualize it in 3D.
