资源列表
VTH_-_Visu18195911182004
- VTH - Visual Basic Source Code to Html Syntax Highlighting Converter
WBC_-_Web_197865372006
- WBC - Web Browser Controller -
Sox_-_WinS839885162002
- API - WinSock OCX replication to Advanced WinSock API Class
Use__NET_C1976792282006
- Use .NET Class Libraries in VB6 Apps
join_wave_1693561122004
- add / join wave files -add / join wave files
CODE_UPLOAD99879192000
- EXE / DLL / OCX File - information -EXE / DLL / OCX File - information
RFI___LFI_2112655122008
- RFI / LFI / XSS Automation tool kit v1.5
Day___Week1171978122002
- Day / Week / Month Calendar
STOP_WATCH1081207192002
- A 0 Cool -STOP WATCH -A 0 Cool -STOP WATCH
A-0-0-Volu25714912001
- Volunteers for Visual Basic.
SHA_1___SH199962682006
- SHA 1 / SHA-1 / SHA1 Secure Hash Algorithm Fast!
Integer-change
- 整数变换问题。关于整数i的变换f和g定义如下：f(i)=3i；g(i)=ë i/2û 。 试设计一个算法，对于给定的2 个整数n和m，用最少的f和g变换次数将n变换为m。 例如，可以将整数15用4 次变换将它变换为整数4：4=gfgg(15)。当整数n不可能变换 为整数m时，算法应如何处理?