登录
首页 » 算法 » HOOK API please tell me why

HOOK API please tell me why

于 2023-07-03 发布 文件大小:1.40 kB
0 124
下载积分: 2 下载次数: 1

代码说明:

this is a createfile hook i love you please tell me why come on baby give me your love

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

发表评论

0 个回复

  • mfcc经典代码
    mfcc,最全面的,非网上流传的,首先对输入数据采取加窗分帧,对于每帧的语音,进行SFFT,求得功率谱,送mel滤波器组,经对数变换,DCT变换求得压缩的最终MFCC特征参数
    2022-03-04 11:23:13下载
    积分:1
  • fortan
    fortran算法集还行吧,大家积极下载使用,希望有帮助,各种算法齐全,不会浪费积分,1线性方程组求解2矩阵运算14多项式和一般函数计算10极值问题8拟合和逼近7常微分方程(组)求解9数据处理和回归分析6数值积分等
    2022-02-07 08:53:50下载
    积分:1
  • 字母数字简写展开(例:a~d => abcd)
    资源描述 输入一个字符串,将字母和数字 简写形式展开(例:a~d => abcd) 例如输入:hello a~d world 1~9 ok 输出:hello abcd world 123456789 ok
    2022-07-14 14:13:45下载
    积分:1
  • 最短路径
    Description 求出有n(1 < n < 600)个结点有向图中,结点1到结点n的最短路径。  Input 第一行有2个整数n和m(0 < m
    2022-07-25 07:53:30下载
    积分:1
  • Started Jacobian symbols used to calculate Legendre symbol for the value judgmen...
    新手上路 用雅可比符号来计算勒让德符号的值 用于判断与素数p互素的正整数n是否是mod p 的二次剩余-Started Jacobian symbols used to calculate Legendre symbol for the value judgment and mutual-p-a positive integer n is whether the mod p Quadratic Residue
    2022-07-24 00:22:37下载
    积分:1
  • 非常好的三角剖分程序(用visual c++ 编写)
    用vc++编写的三角剖分程序,程序好用,有兴趣的看看吧:只需要点一系列的点,然后就可以自动剖分了。
    2023-04-29 03:35:04下载
    积分:1
  • 我的串的比较实现
    我的串的比较算法实现-my string comparison algorithm
    2023-02-17 15:10:03下载
    积分:1
  • 一种最大数量的随机抽取
    输入一个最大数字,随机数抽奖-importation of a maximum number of random draw
    2022-03-03 12:47:21下载
    积分:1
  • 哈夫曼编码
    资源描述 用C语言实现哈夫曼编码 用C语言实现哈夫曼编码 用C语言实现哈夫曼编码 用C语言实现哈夫曼编码 用C语言实现哈夫曼编码
    2022-02-04 15:40:09下载
    积分:1
  • Sicily 1009梅森素数
    One of the world-wide cooperative computing tasks is the "Grand Internet Mersenne Prime Search" -- GIMPS -- striving to find ever-larger prime numbers by examining a particular category of such numbers. A Mersenne number is defined as a number of the form (2p–1), where p is a prime number -- a number divisible only by one and itself. (A number that can be divided by numbers other than itself and one are called "composite" numbers, and each of these can be uniquely represented by the prime numbers that can be multiplied together to generate the composite number — referred to as its prime factors.) Initially it looks as though the Mersenne numbers are all primes. Prime Corresponding Mersenne Number 2 4–1 = 3 -- prime 3 8–1 = 7
    2022-03-17 05:46:40下载
    积分:1
  • 696518资源总数
  • 106161会员总数
  • 5今日下载