登录
首页 » Python » Python3通过whois生成通讯录

Python3通过whois生成通讯录

于 2018-04-27 发布 文件大小:13KB
0 95
下载积分: 1 下载次数: 2

代码说明:

  Python3通过whois生成通讯录实例(Python3 generates an instance of the address book through whois)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • example for windows socket UDP.
    example for windows socket UDP.
    2022-04-15 03:16:42下载
    积分:1
  • MyJob
    为了显示调试信息的方便,做了这个控件,用Message2Console函数向控件增加消息. 也可用SendMessage的方式向控件增加消息. 本MyBigJob只是为了测试这个控件. 这是我第三次上传这控件,改进了多个相同控件的兼容.(因为之前在响应函数里加了static) 这段代码是我学线程时做的. 线程方面学到的函数有:Sleep,WaitForSingleObject,SetEvent(To display debugging information easy to do this control, add a message to the control Message2Console function can also be used the the SendMessage way to add a message to the control. The MyBigJob just this is the third time I upload this control in order to test the controls. Improved more of the same control compatible (as before in the response function Riga static) this code I do learn thread. threading learned function: Sleep, WaitForSingleObject SetEvent)
    2012-10-01 14:48:48下载
    积分:1
  • ARAY1D
    This is how to make aray 1 dimension. I give you a source code to learn how to make array 1 dimension use C++.
    2014-11-21 00:15:28下载
    积分:1
  • q1
    说明:  Pokeface 题目描述 魔术师将一叠扑克顺次在桌上排成一行,初始全部正面朝上。随后,他每次挥一挥衣袖,都会翻转一连串的扑克,改变它们的正反朝向。从古代传下来的规矩,魔术师皆有师傅,他们要随时准备回答师傅的问题。问题形如:目前从第i张扑克牌到第j张扑克牌中,有几张正面朝上? 作为魔术师的助手,你被要求学习程序设计、算法与数据结构。现在,魔术师把这个问题交给了你,你需要编写一个程序,维护相应的数据结构来保存桌子上牌面的情况,同时对于师傅的每一个问题,你要用尽量快的速度计算出答案。 输入 第一行包含三个正整数n、p和q。n表示扑克牌的数量,p表示魔术师的挥一挥次数,q表示师傅的问话次数。 接下来共p+q行,每行包含一个操作,操作分为2种: H i j 魔术师挥一挥,改变了第i张牌到第j张牌的正反 Q i j 师傅问话:截至目前,第i张到第j张牌中有多少张正面朝上 操作中恰好包含p次H操作,q次Q操作,与第一行的p和q吻合。H操作和Q操作的范围均包含边界(即第i张和第j张牌)。 对于每个操作,输入保证1 ≤ i ≤ j ≤ n。 输出 对于每次Q操作,输出一行,包含一个整数,表示问题的答案。 提示:线段树(Pokeface Title Description The magician will stack poker table sequentially in a row, all the initial face-up. He then every wisp will flip a series of poker pros and cons of changing their orientation. The rules handed down ancient times, the master magician Jie, they be ready to answer the teacher s questions. Question of the form: Currently playing cards i to j-card poker, there are a few face-up? As a magician s assistant, you are required to learn programming, algorithms and data structures. Now, the magician put this question to you, you need to write a program to maintain appropriate data structure to hold the cards on the table face the situation, while the master for each question, and you want to use as quickly calculate the answer. Enter The first line contains three positive integers n, p and q. n represents the number of poker, p represents the wave of the magic number, q represents the number of master s questioning. Next, a total of p+ q rows, each containi)
    2015-01-18 15:02:14下载
    积分:1
  • DBBackup v2.5.1
    DBBackup v2.5.1 -DBBackup v2.5.1DBBackup v2.5.1
    2022-02-05 23:47:55下载
    积分:1
  • src
    说明:  steganography challenge in c++
    2020-05-08 21:52:36下载
    积分:1
  • jisuanqi
    简单的算术计算实现,可以在此代码上多加功能。(Simple arithmetic calculations to achieve, you can more features on this code.)
    2010-01-04 12:50:18下载
    积分:1
  • Java 码常规
    Java 编码常规-conventional Java code
    2023-03-14 04:45:03下载
    积分:1
  • SevLaunch
    自制的一个快捷启动工具,简介好用。功能可以继续完善(Made a quick start tool, Introduction handy.)
    2013-11-28 14:43:44下载
    积分:1
  • random_shuffle
    Since many variables of this type are allocated.Draw local copies to avoid false sharing.
    2015-07-15 22:12:11下载
    积分:1
  • 696518资源总数
  • 104226会员总数
  • 29今日下载