brisk

让ARToolKit支持MQO模型的必须头文件，GLMetaseq.h(Let ARToolKit support MQO model must header files, GLMetaseq.h)

说明：   有一个长度为整数L(1<=L<=10000)的马路，可以想象成数轴上长度为L的一个线段，起点是坐标原点，在每个整数坐标点有一棵树，即在0,1,2，...，L共L+1个位置上有L+1棵树。 现在要移走一些树，移走的树的区间用一对数字表示，如 100 200表示移走从100到200之间（包括端点）所有的树。 可能有M(1<=M<=100)个区间，区间之间可能有重叠。现在要求移走所有区间的树之后剩下的树的个数。 输入： 两个整数L(1<=L<=10000)和M(1<=M<=100)。 接下来有M组整数，每组有一对数字。 输出： 可能有多组输入数据，对于每组输入数据，输出一个数，表示移走所有区间的树之后剩下的树的个数。(Has a length of integer L (1 &lt = L &lt = 10000) of the road, one can imagine a number line segment of length L, the starting point is the coordinate origin, each integer coordinate points in a tree, i.e. 0,1 , 2, ..., L total has L+1 L+1 positions on the tree. Now to remove some trees, tree removed by a range of digitally represented, such as 100 200 represents removed (inclusive) between 100 and 200 all the trees. There may be M (1 &lt = M &lt = 100) intervals, there may be overlap between the intervals. Now, after the number of trees require the removal of all remaining sections of the tree. Input: two integer L (1 &lt = L &lt = 10000) and M (1 &lt = M &lt = 100). Then there is an integer M groups, each with a pair of numbers. Output: there may be multiple sets of input data, for each set of input data, the output of a number indicating the number of the removal of all remaining sections of the tree after tree.)

负责火星的一个低轨道空间站的设计。为简化结构，该空间站由一系列密闭的立方体（airtight cubical modules ACM）组成，这些ACM曾连接在一起。困扰你的一个问题是致命的病菌也许留在火星的上层大气中。因为空间站有时需要在上层大气中飞行，所以急需在ACM的各个接触面进行额外的防护，无论是边对边还是面对面，连接是密闭的，所以没有细菌能够进入。一个ACM与另外一个ACM共享的面不需要防护。如果在每个ACM每个面上都加防护，花费巨大。因此，需要知道ACM额外防护的确切面数目(Responsible for the design of a low-orbit space station on Mars. In order to simplify the structure of the space station by a series of closed cubes (airtight cubical modules ACM) composed of these ACM had together. One problem is bothering you deadly germs might stay in the upper atmosphere of Mars. Because the station is sometimes necessary to fly in the upper atmosphere, so urgently needed in all contact surfaces of the ACM additional protection, either face to face or side-to-side, the connection is closed, so no bacteria can enter. An ACM ACM shared with another surface does not need protection. If you have added protection on each side of each ACM, costly. Therefore, the need to know the exact number of additional surface protection ACM)

使用MATLAB程序通过18个循环,求最少费用的问题.(new Cumulative )

用移位寄存器产生M序列的MATLAB软件实现(M generated using shift register sequences MATLAB software)

一个samp的监狱脚本,机不可失失不再来！大家都拿去看看吧(A script samp prison)

用MATCOM实现VC_对MATLAB中_m文件的调用(With MATCOM achieve VC_ on file in MATLAB call _m)

说明：  使用MATCOM使VC与MATLAB混编的小例子(VC and MATLAB using the mixed MATCOM small example of)

能够见汉字转为拼音，并且速度很快，可以很好的将文字进行转化(脛脺 鹿 禄录 没 潞 潞 脳 脰 脳 陋 脦 陋 脝)

说明：  求N个字符的最大公共子串，超高效率，希望能给大家带来帮助谢谢(Request N sub-character string of the largest public, high efficiency, We hope you help thank you)