UVa Problem Set

This is a simple problem with a couple of traps.

Here is a reference solution to this simple simulation problem.

This is a two dimensional geometry problem with two traps.

Another simple simulation problem. My solution is here.

Simple simulation problem. Here is my solution.

Compute the intersection of two convex hulls.

You may enumerate all permutations to solve this problem.

Follow the instructions to solve the problem.

Enumerate the first ten answers of the problem.

Write a parser to solve this problem.

You may solve this problem with best-first search.

This problem is convex hull in disguise.

This problem ask you to simulate Roman Roulette.

This problem asks you to generate the i-th string of a list of strings (in alphabetical order) that do not contain identical, adjacent substrings.

Simply follow the problem description literally.

This is a very tedious problem that requires complicated input parsing and output formatting; a reference solution is here.

You may apply Floyd-Warshall algorithm to this problem.

You may build an index from keyword to a sorted list of positions to solve this problem.

This problem requires you to design a somewhat cleaver data structure of binary tree.

This problem is pretty straightforward to solve.

This problem challenges your ability to read through its cumbersome description.

Given pairs of nodes in a forest, you are asked to find their common ancestors.

This is a very simple dynamic programming problem with very puzzling description.

This problem asks you to generate all primitive Pythagorean triples less than an upper bound.

Basically this problem asks you to implement a convex hull algorithm.

You may solve this "problem":http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=3&page=show_problem&problem=43 with prime factorization.

This problem asks you to generate permutation of letters in alphabetically ascending order.

The problem outlines the algorithm for computing the hash value. Follow it and you may solve the problem.

Follow problem description literally and you may solve the problem.

You may solve this problem straightforwardly.

One pitfall of this problem is that when you left-shift \(m\) for 2 bytes to compute \(m_2\), you have to be careful of overflow. A reference solution is here.

Given a partial order, this problem asks you to enumerate all orderings of variables that satisfy the partial order.

Compare the number of pipes stored in grid pattern and skewed pattern, and print the larger of the two. This problem is quote easy to solve.

A solution to this problem is quite straightforward: You keep “flipping” the largest unsorted pancake until all pancakes are sorted.

Follow the problem description literally and you may solve it without much trouble.

This problem asks you to find the weight of the shortest cycle that visits all edges at least once.

In this problem you are going to find the path that has minimal weight and is lexicographically smallest.

You may solve this problem with double.

In this problem you write a parser for S-expressions. A reference solution is here.

This is a quite challenging recursive function problem, in which you generate a decision tree of sorting \(n\)-variables.

You may solve this problem with a technique called summed area table, also known as integral image.

You may solve this problem with brute-force: Build an array \(h[x]\) of heights indexed by \(x\)-coordinate initialized to \(0\).

This problem is a shortest path problem in disguise.

The longest path problem in general is NP-hard, but since the graph \(G\) constructed from the ‘nests-in’ relation is a directed acyclic graph, we may solve it by solving the shortest path problem of \(-G\).

Enumerate all bin permutations in alphabetical order, and this problem should be tedious to solve.

Read the problem carefully and you should be able to solve it. This is a tedious problem.

Note that the first input number \(i\) can be greater than the second input number \(j\).