不少交易者喜欢用EA策略，其中马丁策略（马丁格尔策略）较受欢迎。不得不说，现实中很多投资者寄希望于马丁策略来赚大钱。然而，这种交易工具真的靠谱吗?资深交易者认为这是国外多少年前玩剩的东西，不应该盲目追捧。
【马丁策略最好就是控制好风险，设置好严格的止损止盈，用好马丁策略年收益200%不是问题】
下面我们来说华尔街下马丁EA,这个策略加载时间周期30分钟，适合所有的货币，只要是设置严格的止损止盈， 控制好加仓的倍率，以及间距。
Many traders like EA strategy, among which Martin strategy (martinger strategy) is more popular. It has to be said that many investors in reality are hoping to make a lot of money from Martin's strategy. However, is this kind of trading tool really reliable? Senior traders think it is something left over many years ago abroad, and should not be blindly pursued.
[Martin's strategy is best to control risks, set strict stop loss and profit stop, and it is not a problem to use Martin's strategy to achieve 200% annual earnings]
Let's say that the wall street down the Martin EA, this strategy loading time cycle 30 minutes, suitable for all currencies, as long as the strict stop loss and earnings, control the double rate of positions, and spacing. (2021-04-05, C/C++, 73KB, 下载0次)
AF-lnvesting.Cv-EA是一款稳健的网格型策略，入场条件有指标判断，效果非常稳定盈利的全自动EA，固定止盈非常稳定，加仓以稳定的数列式加仓，对冲挂单即时开仓，不依附指标和K线有效规避过滤不真实的信号，可以选择合适的交易时段。顺势挂单开仓，不惧单边和震荡，该策略为每笔交易者使用止损和止盈，并且实施多种尾随止损技术以最小化风险并使盈利最大化，单量大既能刷单又能盈利还能刷返佣。
AF-lnvesting.Cv-EA is a robust grid strategy. The entry conditions are judged by indicators, the effect is very stable and profitable, the fixed take profit is very stable, the positions are incrEAsed in a stable sequence, the positions are immediately opened by hedging pending orders, and the false signals are effectively avoided and filtered without depending on indicators and K-line, so the appropriate trading hours can be selected. Taking advantage of the opportunity to open positions with pending orders, without fear of unilateral and shocks, this strategy uses stop loss and take profit for each trader, and implements a variety of trailing stop loss techniques to minimize risks and maximize profits. With a large order quantity, it can not only brush orders, but also make profits and return commissions. (2020-12-16, C/C++, 1681KB, 下载2次)
高胜率极限反转-EA是一款高胜率的好策略，能给你安全感的是每天都有USD入账的好策略，让你在短时间里收益迅速翻倍的印钞机，零差评的好策略，客户用着都makemoney的EA，是你真正不容错过的赚钱机器，高胜率极限反转不是传统意义上的加仓开仓策略，是通过144均线偏离600微点开仓，入场精确率比较高，开单条件严格，做单准确率高，可以回测，实盘盈利效果让人惊艳。适合大小资金都可以跑的策略,对点差要求不高，基本持仓不过夜，不惧震荡和单边适合所有行情。
High winning rate limit reversal -EA is a good strategy with high winning rate. What can give you a sense of security is a good strategy of USD accounting every day, a printing machine that allows you to double your income quickly in a short time, and a good strategy of zero bad reviews. Customers use EA with all makemoney, which is a money-making machine that you can't miss. High winning rate limit reversal is not a strategy of opening positions in the traditional sense. It is a deviation from 600 micro points through the 144 moving average, and the admission accuracy is relatively high. It is suitable for the strategy that large and small funds can run, with low requirements on spread, basic positions not staying overnight, fear of shocks and unilateral suitability for all markets. (2020-11-25, C/C++, 472KB, 下载12次)
破解版趋势刷单EA这是一款即简单又十分有效的刷单策略，融合顺势加仓，单品种对冲，多品种对，把握趋势和震荡策略，虽然交易量比较大，但是并非高频或者所谓的头皮交易模式，而是结合时间和空间双重要素，首次开仓方向由EMA20均线判断，在均线上方做多，下方做空，按照价格的运行轨迹自行判断多空，可以挂多货币来刷单，根据不同的品种选择可以自由调整本EA的交易模式和开单环境，而不是一杆直尺量天下的单一策略。
This is a simple and very effective brush strategy, which integrates the strategy of increasing position with the trend, hedging with single variety, and grasping the trend and shock strategy. Although the trading volume is relatively large, it is not a high-frequency or so-called scalp trading mode, but combined with the dual elements of time and space. The first opening direction is judged by the EMA 20 moving average, and is long above the moving average, Short at the bottom, you can judge the short position according to the running track of the price, you can hang multiple currencies to brush orders, and you can freely adjust the trading mode and billing environment of this EA according to different varieties, rather than a single strategy of measuring the world with a ruler. (2020-10-22, C/C++, 85KB, 下载4次)
龙之影对冲货币EA是一款结合人工智能交易技术，让它能够24小时捕捉行情，根据行情的波动来准确判断机会，在对冲货币策略的基础上开发，盈利水平，风控能力更是进一步的升级，龙之影对冲货币让策略独有的支撑压力开仓——入场准、斐波那契加仓——浮亏小、盈亏比计算——平仓快。
Dragon Shadow Hedging Currency EA is a trading technology combined with artificial intelligence, which enables it to capture the market 24 hours a day, accurately judge the opportunity according to the fluctuation of the market, develop on the basis of hedging currency strategy, and further upgrade its profit level and risk control capability. Dragon Shadow Hedging Currency allows the unique supporting pressure of the strategy to open positions-admission is allowed, Fibonacci adds positions-floating losses are small, profit-loss ratio is calculated-closing positions are quick. (2020-10-16, C/C++, 59KB, 下载3次)
炒金子智能自动交易系统策略的预期月平均收益可达到账户资金的5%-10%。在规避掉常规可能导致风险的大数据行情后，或出现无法预期的极端或突发性行情，波动超出系统的波幅极限值时，账户可能因保证金不足导致交易风险。
行情发生突发性时按间距设的下单那么单量相当大，EA能避免这样无谓的加单会正当选择一个价位下单不多，避免频繁的加单加大风险并且这个只需一个小的回调能快速走单，一般不会持仓到过夜，当天就能走完单。
加载周期：15分钟
加载货币对：EURUSD USDJPY USDCHF GBPUSD AUDUSD EURGBP USDCAB EURGBP EURJPY NZDUSD
When the market is sudden, if the order is set according to the interval, the order volume is quite large. EA can avoid such unnecessary order increase. It will just choose a price and place a small order to increase the risk. In addition, it only needs a small callback to make a quick order. Generally, it won't be held too late, and the order can be finished on the same day.
Loading cycle: 15 minutes
Loading currency pair: EURUSD USDJPY USDCHF GBPUSD AUDUSD EURGBP usdcab EURGBP EURJPY NZDUSD (2020-10-16, C/C++, 86KB, 下载2次)
用拉格朗日插值法依据N个已知数据点即使函数值 输入 n--已知数据点的个数N-1 x--已知数据点第一坐标的N维列向
The Lagrange interpolation method is used to input the N dimension direction of the first coordinate of the known data points according to N known data points even though the number of n-known data points is inputted by the function value. (2018-11-10, C/C++, 2KB, 下载0次)
实现朴素贝叶斯分类器，并在真实的数据集上进行测试。要求在实际数据集上现和应用算法，评价算法的实现，并分析实验的结果。
The naive Bias classifier is implemented and tested on real data sets. It is necessary to present and apply algorithms on the actual data sets, evaluate the implementation of the algorithm, and analyze the results of the experiments. (2018-07-05, C/C++, 2KB, 下载1次)
阿里巴巴面试题个人题解。
对于一个数字串，需要通过一定的操作变成另一个数字串，问最小操作次数。
总共有3钟操作：
1.某位数字加一
2.某位数字减一
3.调换任意两位数字
The Alibaba interview questions personal problem.
For a digit string, we need to turn another operation into another string and ask the minimum number of operations.
A total of 3 clock operations:
1. one digit plus one
2. one digit reduction
3. change any two digit number (2018-04-17, C/C++, 1KB, 下载2次)
任意次方后的最后 计算某日是该年的第几天 婚礼上的谎言 18
实例016 百元买百鸡 19
实例017 打渔晒网问题 20
实例018 判断三角形的类型 22
实例019 直接插入排序 23
实例020 希尔排序 25
实例021 冒泡排序 26
实例022 快速排序 27
实例023 选择排序 28
实例024 归并排序 29
实例025 二分查找 31
实例026 分块查找 32
实例027 哈希查找 34
实例028 斐波那契数列 37
实例029 哥德巴赫猜想 38
实例030 尼科彻斯定理 39
Getting Algorithm
(2016-07-19, C/C++, 10KB, 下载1次)
迪杰斯特拉（dijkstra）算法解决了从某个源点到其余各顶点的最短路径。从循环嵌套可以很容易得到此算法的时间复杂度为o（n^2）。这是一个按路径长度递增的次序产生最短路径的算法。
Dijkstra算法，求有向网G的v0顶点到其余顶点v的最短路径P[v]及带权长度D[v]。P[v]的值为前驱顶点下标,
D[v]表示v0到v的最短路径长度和 。
Dijkstra (dijkstra) algorithm to solve from a source point to the rest of the nodes in the shortest path. From the nested loop can easily get this algorithm s time complexity is o (n ^ 2). This is an order of increasing path length according to the shortest path algorithm generated.
Dijkstra s algorithm, seeking a directed network G, v0 vertex to vertex v the rest of the shortest path P [v] and with the right length D [v]. P [v] value of the subscript precursor vertex,
D [v] v0 to v represents the shortest path length. (2013-10-01, C/C++, 2KB, 下载2次)
C的正定矩阵计算，主要用于求解对称正定方程组的平方根，利用的是乔里斯基分解法求解系数矩阵为对称正定。
C positive definite matrix calculation, mainly used to solve the equations of symmetric positive definite square root, and use of the Cholesky decomposition method for solving the coefficient matrix is symmetric positive definite. (2013-01-15, C/C++, 1KB, 下载11次)
河内塔
费式数列
巴斯卡三角形
三色棋
老鼠走迷官（一）
老鼠走迷官（二）
骑士走棋盘
八个皇后
八枚银币
生命游戏
字串核对
双色、三色河内塔
背包问题（Knapsack Problem）
数、运算
蒙地卡罗法求 PI
Eratosthenes筛选求质数
超长整数运算（大数运算）
长 PI
最大公因数、最小公倍数、因式分解
完美数
阿姆斯壮数
最大访客数
中序式转后序式（前序式）
后序式的运算
关于赌博
洗扑克牌（乱数排列）
Craps赌博游戏
约瑟夫问题（Josephus Problem）
集合问题
排列组合
格雷码（Gray Code）
产生可能的集合
m元素集合的n个元素子集
数字拆解
排序
得分排行
选择、插入、气泡排序
Shell 排序法 - 改良的插入排序
Shaker 排序法 - 改良的气泡排序
Heap 排序法 - 改良的选择排序
快速排序法（一）
快速排序法（二）
快速排序法（三）
合并排序法
基数排序法
搜寻
循序搜寻法（使用卫兵）
二分搜寻法（搜寻原则的代表）
插补搜寻法
费氏搜寻法
矩阵
稀疏矩阵
多维矩阵转一维矩阵
上三角、下三角、对称矩阵
奇数魔方阵
4N 魔方阵
2(2N+1) 魔方阵
对C语言的学习非常有用。
Tower of Hanoi
Fibonacci row
Pascal triangle
Three-color chess
Mice have gone astray Officer (a)
Mice have gone astray Officer (2)
Knights go board
Eight Queen
Eight of silver
Game of Life
String to check
Color, tri-color Towers of Hanoi
Knapsack problem (Knapsack Problem)
The number of operator
Monte Carlo method for PI
Eratosthenes screening and quality
Long integer arithmetic (large numbers operation)
Long PI
The greatest common divisor, least common multiple, factoring
Perfect number
Armstrong number
The maximum number of visitors
Sequence type (pre-order type) in sequence rotary
After the order type of computing
On gambling
Wash cards (random number order)
Craps gambling game
The problem of Joseph (Josephus Problem)
Collection of problems
Permutations and combinations
Gray code (Gray Code)
Produce may be the collection of
m elements of a collection of n elements in a subset of
Digital dismantling
Sort
Score Ranking
Select, insert, bubble sort
S (2012-07-20, C/C++, 63KB, 下载15次)
补充函数double fun(double x[10])，该函数的功能是求长度为N的一维数组x中元素值的平均值，并对所得结果进行四舍五入（保留两位小数）。
Added function double fun (double x [10]), the demand function is the function of the length of one-dimensional array of N elements in the average value of x, and the results were rounded (with two decimal places.) (2011-06-07, C/C++, 3KB, 下载2次)
Apriori算法是一种最有影响的挖掘布尔关联规则频繁项集的算法。其核心是基于两阶段频集思想的递推算法。该关联规则在分类上属于单维、单层、布尔关联规则。在这里，所有支持度大于最小支持度的项集称为频繁项集，简称频集。
（1） L1 = find_frequent_1-itemsets(D) （2） for (k=2 Lk-1 ≠Φ k++) { （3） Ck = apriori_gen(Lk-1 ,min_sup) （4） for each transaction t ∈ D {//scan D for counts （5） Ct = subset(Ck,t) //get the subsets of t that are candidates （6） for each candidate c ∈ Ct （7） c.count++ （8） } （9） Lk ={c ∈ Ck|c.count≥min_sup} （10） } （11） return L= ∪ k Lk (2011-06-06, C/C++, 11KB, 下载4次)
我将要把常用的算法集上传上来给大家共享，这只是其中一个共轭梯度算法的源程序，陆续上传的还有armijo_goldstein线搜索方法， 0.618方法进行一维线搜索，DFP算法等。。。希望对你们有帮助
I will upload should set up the algorithm used to share, this is just one of the conjugate gradient algorithm of the source, one after another upload there armijo_goldstein line search method, 0.618 for one-dimensional line search method, DFP algorithm. . . Want to help you (2010-08-28, C/C++, 1KB, 下载8次)
10个重要的算法C语言实现源代码：拉格朗日，牛顿插值，高斯，龙贝格，牛顿迭代，牛顿-科特斯，雅克比，秦九昭，幂法，高斯塞德尔
10 key algorithm C language source code: Lagrange, Newton interpolation, Gaussian, Romberg, Newton, Newton- Cortez, Jacobi, Qinjiu Zhao, power method, high Sisedeer (2010-05-26, C/C++, 4KB, 下载5次)
这是一个算法设计与分析课程的实验，对曼彻斯特乘法链进求最有运算顺序的源码。由本人自行编写，希望和大家交流与分享。
This is an algorithm design and analysis of the experimental program, the multiplication of Manchester into the demand chain operations in order to source the most. Prepared by me on their own, and we hope the exchange and sharing. (2010-05-18, C/C++, 2KB, 下载1次)
神经网络中的K均值聚类算法II：
1.KMIn为输入数据文本，其中，第一个参数为所要聚类点个数，第二个参数为聚类点的维数,第三个参数为所要求聚类的个数
2.KM2OUT为经过K均值聚类算法II计算后得到的结果
Neural network in K-means clustering algorithm II: 1.KMIn input data for the text, of which the first parameter to be the number of clustering points, the second parameter is the dimension of clustering points, the third parameter for the clustering the number of requests for 2.KM2OUT after K-means clustering algorithm II calculation results (2007-09-04, C/C++, 271KB, 下载67次)
FIR滤波器系数计算 C源码，有多种加窗处理
FIR filter coefficients C source code, plus a variety of window treatment (2004-10-16, C/C++, 327KB, 下载1201次)