Description: The length of L1, L2... Ln n programs put in the tape on T1 and T2, and hope that in accordance with the maximum search time to obtain the minimum value is stored, that is, if stored in T1 and T2 procedures set respectively a and B, hope that the choice of a and B the max {sigma Li 1, sigma li2} (I1 and belong to a, I2 b) has the smallest. Realization of using backtracking
To Search:
File list (Check if you may need any files):
FindStudent\FindStudent\AddClass.cpp
...........\...........\AddClass.h
...........\...........\Advance.cpp
...........\...........\Advance.h
...........\...........\Calling.cpp
...........\...........\Calling.h
...........\...........\Class.cpp
...........\...........\Class.h
...........\...........\FindStudent.aps
...........\...........\FindStudent.cpp
...........\...........\FindStudent.h
...........\...........\FindStudent.rc
...........\...........\FindStudent.vcproj
...........\...........\FindStudent.vcproj.tiger-PC.tiger.user
...........\...........\FindStudentDlg.cpp
...........\...........\FindStudentDlg.h
...........\...........\Inc.cpp
...........\...........\Inc.h
...........\...........\MngClass.cpp
...........\...........\MngClass.h
...........\...........\ReadMe.txt
...........\...........\res\FindStudent.ico
...........\...........\...\FindStudent.rc2
...........\...........\resource.h
...........\...........\stdafx.cpp
...........\...........\stdafx.h
...........\...........\Student.cpp
...........\...........\Student.h
...........\FindStudent.exe
...........\FindStudent.ncb
...........\FindStudent.sln
...........\FindStudent.suo
...........\...........\res
...........\FindStudent
FindStudent
Download