pass.words是弱口令字典,是一个纯文本文件,每行一个口令,可以向里面添加候选口令。 pass.c是进行口令检查的c语言原程序,有两个命令行参数 -w file: 可以使用该选项指定口令字典 -P:默认情况下对/ETC/shadow中的用户检查弱口令,可以使用该选项指定检查的文件 编译gcc –o pass pass.c –l crypt 由于要使用加密函数,所以要使用加密库crypt,使用选项-l crypt 运行程序:pass –w ./pass.words –p /ETC/shadow
上传时间: 2017-01-21
上传用户:朗朗乾坤
this a user-mode application to detect device change on the system, i.e. plug-in a USB drive, iPod, USB wireless network card, ETC.
标签: i.e. application user-mode plug-in
上传时间: 2014-01-05
上传用户:lmeeworm
硬盘结构、参数、品牌等,PC3000维修介绍,硬盘维修流程介绍 --Hard disk structure , parameter , brand ETC. , PC3000 are kept in repair introduce that, the technological process the hard disk is kept in repair introduces that
上传时间: 2014-01-21
上传用户:lepoke
A java GUI interface program used to download a batch of files in a specified URL, or a kind of similar files like pic01, pic02, pic03, ..., pic99, ETC. And it can download all the links of index.html automatically.
标签: interface specified download program
上传时间: 2017-02-16
上传用户:大三三
This software performs code conversion of Chinese characters, including GB2312/GBK and BIG5. It also supports some encodings of Chinese character code which are used widely in Japan, such as Chinese Writer, cWnn, Nihao, Zhongwen Qigao, ETC.
标签: characters conversion including software
上传时间: 2014-01-05
上传用户:GavinNeko
www工具包. 这是W3C官方支持的www支撑库. 其中提供通用目的的客户端的WebAPI: complete HTTP/1.1 (with caching, pipelining, PUT, POST, Digest Authentication, deflate, ETC), MySQL logging, FTP, HTML/4, XML (expat), RDF (SiRPAC), WebDAV, and much more
标签: pipelining www complete caching
上传时间: 2017-02-24
上传用户:qq21508895
我的VIM配置,把此文件直接覆盖/ETC/vimrc文件即可,希望对大家有用。
标签: VIM
上传时间: 2014-06-14
上传用户:ynwbosss
You use variables in your program to hold data which may be in different type, such as characters, numbers, date and time ETC.
标签: characters different variables program
上传时间: 2017-03-07
上传用户:xaijhqx
这是日本OKI公司开发的ML9636芯片说明书,这款芯片专门用于DSRC开发,由于国内只有ETC标准,尚无DSRC标准,此款芯片是基于日本ARIB STD-T75标准开发的。希望能对打算研究DSRC的朋友提供帮助
上传时间: 2014-01-03
上传用户:拔丝土豆
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 ETC) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
标签: Multiplicative undirected Shortest measured
上传时间: 2017-04-08
上传用户:邶刖