Xondekt
所属分类:数值算法/人工智能
开发工具:Visual C++
文件大小:10KB
下载次数:0
上传日期:2018-11-21 01:26:12
上 传 者:
Ealabv
说明: 本算法实现2-10集合划分问题,采用动态规划法和大整数方法
(This algorithm implements 2-10 set partition problem, using dynamic programming method and large integer method.)
文件列表:
Vasubsetcalculator\input.txt (2, 2006-04-18)
Vasubsetcalculator\output.txt (48, 2006-04-19)
Vasubsetcalculator\bigint.h (637, 2006-04-18)
Vasubsetcalculator\bigint.cpp (6412, 2006-04-19)
Vasubsetcalculator\subsetcalculator.cpp (2288, 2006-04-19)
Vasubsetcalculator\subsetcalculator.dsp (3584, 2006-04-19)
Vasubsetcalculator\subsetcalculator.dsw (540, 2006-04-19)
Vasubsetcalculator\subsetcalculator.ncb (33792, 2006-04-19)
Vasubsetcalculator\subsetcalculator.opt (48640, 2006-04-19)
Vasubsetcalculator\subsetcalculator.plg (828, 2006-04-19)
Vasubsetcalculator\subsetcalculator.sln (921, 2006-04-15)
Vasubsetcalculator\subsetcalculator.suo (9216, 2006-04-18)
Vasubsetcalculator\subsetcalculator.vcproj (3513, 2006-04-18)
Vasubsetcalculator\Debug (0, 2006-04-19)
Vasubsetcalculator (0, 2018-11-08)
1.采用动态规划算法,时间复杂度为O(n*n)
2.使用了大整数类BigInteger
3.使用vs.net 2003开发,Windows xp pro平台
4.默认的输入和输出文件与程序在同一个文件夹中
5.为节省空间,删去了可执行代码,请重新编译执行之
近期下载者:
相关文件:
收藏者: