登录
首页 » Visual C++ » BiYe

BiYe

于 2005-06-19 发布 文件大小:634KB
0 252
下载积分: 1 下载次数: 46

代码说明:

  该系统分成客户端和服务器两部分。用于远程控制可以实现远程访问,远程技术支持等。(The system is divided into client and server in two parts. For remote control can be achieved remote access, remote technical support.)

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

发表评论

0 个回复

  • 73562472624
    VB采用UDP远程唤醒主机一例,有需要的就下。(VB uses UDP remote wakeup host one case, there is a need on the next.)
    2013-07-28 08:24:04下载
    积分:1
  • netcat
    netcat木马程序。类似bo2000,用于获取对方机器上的信息。(netcat wooden horse procedure. Similar bo2000, uses in to gain on opposite party machine the information. )
    2020-06-26 11:20:01下载
    积分:1
  • GUITelnet
    图形界面的远程登陆程序源代码(graphical interface remote login source code)
    2004-09-29 07:22:28下载
    积分:1
  • ghost-2012
    GHOST 2012 原版远控 免杀好做的呢 大家来下吧(GHOST 2012)
    2012-03-06 23:04:22下载
    积分:1
  • Queue
    队列的顺序定义,队列的调用算法等,队列的模板类及其实现(Defined in the order queue, queue calls algorithm, queue template class and its implementation)
    2013-07-17 15:42:54下载
    积分:1
  • template
    template 模版函数 函数模版 深入了解(template template template-depth understanding of the function function)
    2013-07-15 17:33:53下载
    积分:1
  • gh0st1.0
    gh0st1.0远程控制源码,VC++6.0编译通过。仅供大家学习参考!(h0st1.0 remote control source, VC++6.0 compile. We only learn reference!)
    2020-06-30 18:40:01下载
    积分:1
  • WinTool3389
    用于3389远程端口修改的小工具,MFC实现并且增加虚拟机检测功能,防止小白遇到黑心服务商用虚拟机代替服务器(Remote 3389 port to modify the gadgets used, MFC and increase the virtual machine detection function, prevent white encounter black heart service commercial virtual machine instead of the server )
    2015-11-17 13:30:19下载
    积分:1
  • medo
    设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组,每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n(n<=200),表示每个数组有n个数。接下来的两行分别是X,Y数组的元素。结果输出 程序运行结束时,将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)
    2021-03-22 16:29:16下载
    积分:1
  • gh0stdan-exe-ban
    gh0st想必大家都知道不用多说了。 这个不知道是那个牛人改的单exe无DLL不版(gh0st surely we all know rest is history. The cattle do not know that people have switched to single-exe version without DLL does not)
    2011-08-20 21:49:29下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载