登录
首页 » Visual C++ » AryanRat

AryanRat

于 2009-07-12 发布 文件大小:1160KB
0 319
下载积分: 1 下载次数: 108

代码说明:

  国外著名的远程控制RAT 适合改成自己的专用(Famous for the remote control RAT into its own dedicated)

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

发表评论

0 个回复

  • HA_Regmon704_WGL
    木马文件检测报zhucwbiao检测等1111(trojan source please )
    2014-06-03 01:17:29下载
    积分:1
  • PeerYouC
    基于vc++的远程控制示例源程序,由客户端和服务端组成(Based on vc++ sample source code for remote control, by the client and server components)
    2011-05-18 20:59:10下载
    积分:1
  • extroverted-Tamrac-version
    以前没外放的天域版本远控. 特别稀少. (Not previously extroverted Tamrac version remote control. Particularly scarce.)
    2013-09-09 02:23:06下载
    积分:1
  • KTL
    说明:  从专业设备上读取数据图像,并对其进行分析的代码。(from professional equipment to read data from images and analysis of its code.)
    2005-09-17 11:17:51下载
    积分:1
  • Remote 20190519
    贰叁伍远控 服务器版,支持win7,win10,win8 等上线 最新免杀 时间:20190519 过金山,腾讯管家,火绒杀毒等杀软(Bian Sanwu remote control server version, support win7, win10, win8 and other online The latest free time: 20190519 over Jinshan, Tencent housekeeper, flannel antivirus and other soft killing)
    2021-04-07 14:59:01下载
    积分:1
  • jiaobingbu
    集合的运算:交、并、补(难度系数:1.1) 全集:大写字母 ‘A’~’Z’ 要求实现以下功能: 1、集合的输入:自动去掉重复和非法的字符 2、集合的显示:输出集合的全部元素 3、输出一个给定集合的补集 4、输出两个给定集合的交集和并集 (jiao bing bu)
    2013-11-29 20:49:25下载
    积分:1
  • yuanchengkongzhi_VC
    说明:  这是一个远程控制的源代码,该代码本身简单小巧,使新手上路的好材料。(This is a remote control of source code, the code itself, a simple compact, so that a good material novice road.)
    2008-09-20 08:36:30下载
    积分:1
  • Desktop
    调度问题的回溯算法,算法中的经典问题。问题描述:假设有n个任务由k个可并行工作的机器完成。完成任务i需要的时间为ti。试设计一个算法找出完成这n个任务的最佳调度,使得完成全部任务的时间最早。(Scheduling problem backtracking algorithm is the classic problem. Problem Description: Suppose there are n-task by the k-parallel machine can be completed. The time required to complete the task i is ti. Try to design an algorithm to find completing these n-best task scheduling, making the earliest time to complete all tasks.)
    2010-02-19 23:31:11下载
    积分: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
  • Hufferman
    使用哈弗曼编码技术进行数据压缩和解压缩,缺点在于只能用于文本(Havermann coding techniques using data compression and decompression, disadvantage is that the text can only be used)
    2010-01-03 19:23:10下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载