用netbeans写的swing程序，写了非递归求两整数最大公因子、分治法求大整数乘法、动态规划求最长公共子串，集合划分问题。 -Netbeans swing with written procedures, write a non recursive find the greatest common factor of two integers, divide and conquer seek large integer multiplication, dynamic programming

实现大整数相乘，时间复杂度n(logn),c++源码-Achieve a large integer multiplication, time complexity n (logn), c++ source