Description: Description of the problem description: Given a contain only numbers [0 .. 9] of the string, seeking to use some of the characters in the string, one can build the largest integer divisible by 15. Note that the string for each character can only be used once. Programming task: seeking from the given string that can build the largest integer divisible by 15.
To Search:
- [test5-2] - Description of the problem: Given n-ston
- [threadpool] - The definition of a fixed-size thread po
File list (Check if you may need any files):
test6-2\Debug\test6-2.exe
.......\.....\test6-2.ilk
.......\.....\test6-2.pdb
.......\test6-2\Debug\BuildLog.htm
.......\.......\.....\mt.dep
.......\.......\.....\stdafx.obj
.......\.......\.....\test6-2.exe.embed.manifest
.......\.......\.....\test6-2.exe.embed.manifest.res
.......\.......\.....\test6-2.exe.intermediate.manifest
.......\.......\.....\test6-2.obj
.......\.......\.....\test6-2.pch
.......\.......\.....\vc90.idb
.......\.......\.....\vc90.pdb
.......\.......\ReadMe.txt
.......\.......\stdafx.cpp
.......\.......\stdafx.h
.......\.......\targetver.h
.......\.......\test6-2.cpp
.......\.......\test6-2.vcproj
.......\.......\test6-2.vcproj.B9F12BE2664840F.Administrator.user
.......\test6-2.ncb
.......\test6-2.sln
.......\test6-2.suo
.......\.......\Debug
.......\Debug
.......\test6-2
test6-2
Download