登录
首页 » Visual C++ » HotDogs

HotDogs

于 2014-08-21 发布 文件大小:3KB
0 295
下载积分: 1 下载次数: 3

代码说明:

  热狗工作脚本samp gtasa联机 内含pwn可修改 转载。。。(Hot work script samp. Instead gta)

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

发表评论

0 个回复

  • texexp
    Text Processing example, a program to recognize tokens
    2014-11-25 00:43:38下载
    积分:1
  • Multi2Carrier-Measurements
    利用GNSS 进行高精度导航定位的前提是正确固定载波相位观测值的整周模糊度。由Galileo 系统的4 个载波观测值可以 形成诸多有良好特性的组合观测值,利用这些组合观测值,结合MCAR 方法,可以有效地确定整周模糊度。(The use of high-precision GNSS navigation and positioning the premise is correct carrier phase observations fixed integer ambiguity. May consist of four carriers observations Galileo system There are many good characteristics to form a combination of observations using a combination of these observations, combined with MCAR method can effectively determine the integer ambiguity.)
    2013-12-21 14:07:20下载
    积分:1
  • charu
    请输入非递减的有序序列,输入-1结束,再输入一个数字,插入其中,按照从小到大的顺序进行排列,完成这个程序(Please enter a non-decreasing ordered sequence, enter-1 end, and then enter a number, into which, in ascending order of arrangement, complete this program)
    2014-11-15 18:50:27下载
    积分:1
  • mat
    matlab simulink 模糊控制器模型(matlab simulink fuzzy controller model)
    2014-01-17 10:21:25下载
    积分:1
  • 5
    说明:  matlab高效编程程序源代码第五章,可以运行。(efficient programming source code matlab chapter, you can run.)
    2011-04-10 15:31:05下载
    积分:1
  • gfor
    Gfor 用于Jacket 的MATLAB加速插件使用说明书(Jacket reference)
    2015-03-27 11:32:54下载
    积分:1
  • 737434a8c47e4bbbb27d8e445b921785
    换热站计算及选型,非常有用,里面用的XLS编写的,直接用就可以~~~~~(Calculation and selection of heat transfer stations, very useful, which use XLS written directly on it ~ ~ ~ ~ ~)
    2014-01-21 09:42:04下载
    积分:1
  • FUZZY-control
    是对于运用模糊控制的场合 这些资料极其具有意义(very important docume)
    2011-12-27 10:30:08下载
    积分:1
  • Vcmatlabsrc
    Visual C++和matlab联合编程的详细代码(Visual C++ And joint programming in detail matlab code)
    2007-08-02 23:59:05下载
    积分:1
  • beibaowenti
    有N件物品和一个容量为V的背包。第i件物品的费用是c,价值是w。求解将哪些物品装入背包可使这些物品的费用总和不超过背包容量,且价值总和最大。(There are N items and a knapsack capacity of V' s. No. i is the cost of items c, the value of w. Solving items into the backpack which will enable the cost of these items does not exceed the sum of the capacity of backpack, and the sum of the maximum value.)
    2009-05-07 22:10:10下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载