Problem Summary

Given an array of N integers, find the maximal length of its “repeating” subsequence.

Read More

Problem Summary

Implement a windowing interface with 5 types of basic operations and a sequence of commands consisting of the basic operations.

5 basic operations:

1. Create a window
2. Bring a window to the top
3. Put a window to the bottom
4. Destroy a window
5. Output what percentage of a window is visible (i.e., is not covered by windows above it).

Read More

Problem Summary

Given a software distribution network of schools, i.e. a directed graph, compute :

1. The minimal number of shools that must receive a copy of the new software in order for it to reach all schools.

2. The minimal number of extensions (i.e. edges) that have to be made so that whatever school we send the new software to, it will reach all other schools.

Read More

Problem Summary

Given N spots on 2D plane, find the convex hull with minimem perimeter.

Read More

Problem Summary

Given a directed graph, find the minimum cut.

Read More

Problem Summary

Given a picture of several overlapping frames, find all possible sequence of the frames in the order they were stacked from bottom to top.

Read More

Problem Summary

Given a directed graph, a source and a sink, find the maximum flow from the source to the sink.

Read More

Problem Summary

Given a graph, find the minimum length cycle.

Read More

Problem summary

Given a bipartite graph, compute the size of the maximum matching.

Solution

I use Hungarian Algorithm to solve this problem.

Read More

Problem Summary

Given N positive integers, d[1],d[2],…d[N] (1<=N<=10, 1<=d[i]<=256), compute the largest impossible number that cannot be written as a[1]d[1]+a[2]d[2]+…+a[n]*d[n] (a[i] is non-negative integer, 1<=i<=N).
If this number does not exist, print 0.

Read More