Description: Given n closed interval [ai, bi] (1 < = i < = n), and the interval can be expressed as a number of disjoint interval and closed. In these representations required to find the smallest number of disjoint intervals containing solution.
To Search:
File list (Check if you may need any files):
prz\Debug\prz.exe
...\.....\prz.ilk
...\.....\prz.obj
...\.....\prz.pch
...\.....\prz.pdb
...\.....\vc60.idb
...\.....\vc60.pdb
...\prz.c
...\prz.dsp
...\prz.dsw
...\prz.in
...\prz.ncb
...\prz.opt
...\prz.out
...\prz.plg
...\Debug
prz
Download