搜索资源列表
重言式判别问题
- 逻辑表达式从终端输入，长度不超过一行。逻辑运算符包括“｜”、“＆”和“～”，分别表示或、与和非，运算优先程度递增，但可有括号改变，即括号内的运算优先。逻辑变元为大写字母。表达式中任何地方都可以含有多个空格符。 若是重言式或矛盾式，可以只显示“True Forever”或“False Forever”，否则显示“Satisfactible”以及变量名序列，与用户交互。若用户对表达式变元取定一组值，程序就求出并显示逻辑表达式的值。-logic expression from the termin
railroad
- 在n个城市之间修建高速公路，使任意两个城市之间都有城市相连，且费用最少-Build roads between some cities, make sure that you can get anywhere from everywhere,besides, the cost is least
Order-form-insert
- 任意长度的线性表的任意位置顺序插入值的操作-Any length anywhere in the linear order of the table into the value of operating
splay
- 利用伸展树完成对数列的维护 包括插入删除翻转求最大子序列和 任意位置后n个位置和等功能-Stretch tree complete after a series of maintenance, including to insert delete Flip seeking the largest sub-sequences and anywhere n positions and other functions
Supermarket-location-problem-
- 基于MFC的超市选址问题。用户可以点击屏幕地图任意位置设置居民住址，系统会根据快排序、中值算法找出最佳的超市修建位置。-MFC-based supermarket siting problems. Users can click anywhere on the map screen settings resident address, the system will soon sort out the best value in the algorithm to build a supermar