编译原理实验用来识别无符号数,代码不长.

c#写的终端上的程序源码 -write terminal procedures source write c# terminal procedures FO

这个项目是用Java语言实现的一个CMM语法词法分析器。输入cmm源文件，可以进行词法分析，如果通过词法分析后可以进一步语法分析。

在COJ上测试通过，大数据的加法，不止64位可以加哦~

一个同步复制歌词的程序,方便在使用MP3时不要在硬盘上到处找歌词-A synchronization process to copy the lyrics to make it easier to not use the MP3 on your hard drive around in search of the lyrics

预防小说沉迷：1．通过命令可以将一个小说文件分割成40个内容大小大致相等的文件，将其存放到一个文件夹里面（也可以让他们杂乱无章的随机存放到多个文件夹下面），并且文件名为随机的字符和数字组成的随机长度(20-60)的字符串。 2．通过执行命令， 可以返回当天阅读的文件。每天只能执行一次来进行拷贝工作：将正确的4个文件按顺序合并成一个文件(此文件名为第X天)拷贝至供阅读的文件夹里，这样每天只能读十分之一 -Prevention of novels indulge: 1. A novel by the command file can be split into 40 roughly equal the size of the contents of the document be placed into a folder inside (you can also let them mess of random store to multiple folders below), and the file name is random characters and numbers of random length (20-60) in the string. 2. By executing the command, you can return the same day to read documents. Only do this once a day to carry copies of work: the correct order, four documents into a single file (this file name is the first X days) for the copy to the folder to read, so that can only be read one-tenth of a day

这是一个基本的ATM模拟和它

Rotating a triangle in a 2d space

窗口杀手 在使用win2000/xp的时候发现，老是出现n个输入法的窗口，不能关掉，又总在最上面，看着很不爽，就写了这个小程序来把他们关掉。 方法很简单，就是FindWindow()在PostMessage(WM_CLOSE,...)，没有技术含量，仅仅图实用而已。-window Win2000/xp killer in the use of the time found that there always n input window, we can not switch off, the total at the top, watching very quickly wrote a small procedure to them to switch off. It is very simple, FindWindow () PostMessage (WM_CLOSE etc. no technical content, it only practical plan.

利用vc实现了一个非常漂亮的滚动静态文本-use vc achieve a very beautiful rolling static text

编号为1，2，…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数），一开始人选一个正整数作为报数上限m,从第一个人开始按顺时针方向从自1开始顺序报数，报道m时停止报数。报m的人出列，将他的密码作为新的m值，从他的顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止，设计一个程序求出出列顺序。采用单向循环链表模拟此过程，按照出列的顺序印出各人的编号测试数据：m的初值为20；n=7,7个人的密码依次为：3，1，7，2，4，8，4，首先m的值为6（正确的出列顺序应为6,1,4,7,2,3,5）-No. 1, 2, ..., n n clockwise direction by individuals sitting around a circle, each holding a password (positive integers), a candidate started as a positive integers m ceiling on the number of reported from the first individuals to embark on the clockwise direction from the start sequence from a few newspaper reports m reportedly stopped a few. M reported out of the list of his password as a new value m, from the clockwise direction on the next re-started from a few reported so on, until all out all out, the design of a procedure sought out the order out. Listless one-cycle simulation process and follow the sequence shown in the numbers printed each test data : m for the initial 20; N = 7,7 personal passwords were : 3,1,7,2,4,8