不少交易者喜欢用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次)
设有n 个立方体，每个立方体的每一面用红、黄、蓝、绿等n 种颜色之一染色。要把这n 个立方体叠成一个方形柱体，使得柱体的4 个侧面的每一侧均有n 种不同的颜色。试设计一个回溯算法，计算出n 个立方体的一种满足要求的叠置方案。
Square cylinder problem. (2019-12-25, C/C++, 419KB, 下载0次)
吴恩达的机器学习课程笔记 非常好的学习资料
Andrew Ag's machine learning course notes are excellent learning materials (2019-07-07, C/C++, 6155KB, 下载3次)
24点游戏,相信大家都玩过 这里给出一个c＋＋算法实现计算机运算
24:00 game, I believe everyone has played here to give a c + algorithm to implement computer operations (2018-11-23, C/C++, 97KB, 下载0次)
第一章 命题逻辑
1．（P Q） （ Q R）的主合取范式和主析取范式。
2．试求下列公式的主析取范式：
（1） ；（2）
（an:
）
Chapter 1 propositional logic
The principal conjunctive normal form and the principal disjunctive normal form of 1. (P Q) (Q R).
2. try to find the main disjunctive normal form of the following formula:
(1); (2)
(an:
)
3. use truth table to determine the following formula is "Heng Zhen"? Constant holiday? Is it satisfied? (2018-10-08, C/C++, 1KB, 下载0次)
可以实现简单的五子棋AI功能，还有玩残局的功能。
A simple Gobang AI function can be realized. (2018-03-18, C/C++, 939KB, 下载1次)
有关ACM的电子书，是斯坦福大学的ACM教程，很好的东西
ACM about e-books, tutorials ACM is Stanford University, a good thing (2016-05-22, C/C++, 3014KB, 下载13次)
有一推销员，欲到n(n<=10)个城市推销产品。为了节省旅行费用，在出发前他查清了任意两个城市间的旅行费用，想找到一条旅行路线，仅经过每个城市一次，且使旅行费用最少。本问题已知城市n，和n*n的表达任意两个城市间费用的矩阵。试求最短路径及其费用；
There is a salesman, want to n (n<=10) a city to sell products. In order to save travel costs, before departure, he found out the cost of travel between any two cities, would like to find a travel route, only through each city once, and to minimize the cost of travel. This problem is known to the city of N, and n*n is the expression of the matrix between any two cities. Try to find the shortest path and cost (2016-03-28, C/C++, 1KB, 下载1次)
北邮14年软院机试第三题，最长等差子序列，自己用动态规划写的。
BUPT 14 years soft hospital machine test third question, the longest arithmetic sequence, using dynamic programming to write your own. (2014-04-17, C/C++, 5KB, 下载1次)
运用分类算法实现线性回归，通过学生的上自习时间预测其期末考试成绩。
Classification algorithm using linear regression, through the student' s study hall time to predict the final exam. (2013-10-10, C/C++, 3KB, 下载1次)
是关于算法的很好的一本书 斯坦福大学使用的教材
Good algorithm, a book used by the Stanford University textbooks (2012-10-02, C/C++, 4858KB, 下载11次)
acm的一手资料，玩ACM的都知道的，
基本代码库
first-hand information acm, ACM, playing all know, the basic code library (2011-01-21, C/C++, 68KB, 下载9次)
1.16② 试写一算法，如果三个整数X，Y和Z
的值不是依次非递增的，则通过交换，令其为
非递增。
Status Dencendant(Array1D L,Array1D R,int n,int u,int v)
/* If node u is the dencendant of node v ,*/
/* then return TRUE else return FALSE . */
/* L[i] is the left child of the i_th node, */
/* R[i] is the right child of the i_th node */
/* in the Binary Tree which has n nodes. */ (2010-05-29, C/C++, 1KB, 下载4次)
贝叶斯 iris 程序源码，可以用的，大家可以试下，是我从CSDN下过来的
Bayesian iris program source code, you can use, we can try next, I come from under the CSDN (2010-05-29, C/C++, 920KB, 下载10次)
数据结构大作业
Choose_Best_Address_For_Hospital
寻径问题:
给定n个村庄之间的交通图，若村庄i和村庄j之间有道路，则将顶点i和顶点j用边连接，边上的权Wij 表示这条道路的长度。现在要从这n个村庄选择一个村庄建一所医院，问这所医院应建在哪个村庄，才能使离医院最远的村庄到医院的距离最短？试设计一个算法来解决该问题。
Great job data structure Choose_Best_Address_For_Hospital routing problem: Given n traffic between villages map of the village if the village i and j between the roads, will be vertex i and vertex j with edge connectivity, the edge of the right to express this Wij The length of the road. Now select from this n-a village in the village build a hospital, and asked the hospital to be built in which the village in order to make the furthest away from the hospital' s distance from the village to the hospital the shortest? Try to design an algorithm to solve the problem. (2010-03-02, C/C++, 51KB, 下载11次)
人类必须在最短的时间内迁往月球。现有n个太空站位于地球与月球之间，且有m 艘公共交通太空船在其间来回穿梭。每个太空站可容纳无限多的人，而每艘太空船i 只可容纳H[i]个人。每艘太空船将周期性地停靠一系列的太空站，例如：(1，3，4)表示该太空船将周期性地停靠太空站134134134…。每一艘太空船从一个太空站驶往任一太空站耗时均为1。人们只能在太空船停靠太空站(或月球、地球)时上、下船。初始时所有人全在地球上，太空船全在初始站。
试设计一个算法，找出让所有人尽快地全部转移到月球上的运输方案。
Human beings must in the shortest possible time to move to the moon. N of the existing station is located between Earth and the moon, and there is public transport spacecraft m vessels shuttling back and forth in the meantime. Each station can accommodate an unlimited number of people, and i each spacecraft can accommodate H [i] of individuals. Each spacecraft will periodically call a series of space station, for example: (1,3,4) that the spacecraft docking station will be periodically 134,134,134 .... Each spacecraft a space station from a time-consuming drive to any one station are 1. One can only spacecraft docked at the space station (or the moon, the Earth) when on the ship. All of the initial full-time on Earth, the spacecraft in the initial station-wide.
Try to design an algorithm to find all as soon as possible so that all transferred to the moon on the transport program.
(2009-07-24, C/C++, 16KB, 下载4次)
遗传算法的旅行商问题,中间有点问题，你可以试一试
Genetic TSP， it s have some problem,if you test it ok! (2009-06-08, C/C++, 194KB, 下载6次)
设停车场内只有一个可停放n辆汽车的狭长通道，且只有一个大门可供汽车进出。汽车在停车场内按车辆到达时间的先后顺序，依次由北向南排列（大门在最南端，最先到达的第一辆车停放在车场的最北端），若车场内已停满n辆汽车，则后来的汽车只能在门外的便道上等候，一旦有车开走，则排在便道上的第一辆车即可开入；当停车场内某辆车要离开时，在它之后开入的车辆必须先退出车场为它让路，待该辆车开出大门外，其它车辆再按原次序进入车场，每辆停放在车场的车在它离开停车场时必须按它停留的时间长短交纳费用。试为停车场编制按上述要求进行管理的模拟程序。
设停车场内只有一个可停放n辆汽车的狭长通道，且只有一个大门可供汽车进出。汽车在停车场内按车辆到达时间的先后顺序，依次由北向南排列（大门在最南端，最先到达的第一辆车停放在车场的最北端），若车场内已停满n辆汽车，则后来的汽车只能在门外的便道上等候，一旦有车开走，则排在便道上的第一辆车即可开入；当停车场内某辆车要离开时，在它之后开入的车辆必须先退出车场为它让路，待该辆车开出大门外，其它车辆再按原次序进入车场，每辆停放在车场的车在它离开停车场时必须按它停留的时间长短交纳费用。试为停车场编制按上述要求进行管理的模拟程序。 (2009-04-07, C/C++, 2KB, 下载7次)
石子合并问题
在一个圆形操场的四周摆放着n 堆石子。现要将石子有次序地合并成一堆。规定每次只能选相邻的2 堆石子合并成新的一堆，并将新的一堆石子数记为该次合并的得分。试设计一个算法，计算出将n堆石子合并成一堆的最小得分和最大得分。
Merger stones in a circle around the playground n heap stones are placed. Stone is to have the order to merge into a pile. Provisions can only choose 2 adjacent stones piled into a heap of new and new pile of stones a few in mind for its combined score. Try to design an algorithm to calculate the n heap into a pile of stones the minimum scores and maximum scores. (2007-11-25, C/C++, 3KB, 下载29次)
1） 【八皇后问题】设在初始状态下在国际象棋棋盘上没有任何棋子(皇后)。然后顺序在第1行，第2行，…。第8行上布放棋子。在每一行中有8个可选择位置，但在任一时刻，棋盘的合法布局都必须满足3个限制条件，即任何两个棋子不得放在棋盘上的同一行、或者同一列、或者同一斜线上。试编写一个递归算法，求解并输出此问题的所有合法布局。
1) [8 Queen's problems-- in the initial state in the international chess pieces on no pawn (Queen's). Then the order in a line, line 2, .... Line 8-sheets on the pawn. Each line can have eight locations, but in the one moment, the legal chessboard layout must meet three conditions imposed that is not any two pawn on the chessboard of the same line, or the same series, or a slash on the same. Test preparation of a recursive algorithm to solve this problem and the output of all the legitimate distribution. (2006-06-19, C/C++, 1KB, 下载9次)