(2007040809)killyou

图像分割，完整程序，验证可行。新手上传，望支持。(image direct)

基于VC++的,多个串口的,带通讯协议的应用程序,两个通讯口,可分别接受,发送协议数据包.()

VC 6.0 自己写的图书馆管理系统， 用的MFC 数据库类CDatabase CRecordset(VC 6.0 to write their own library management system, using the MFC database classes CDatabase CRecordset)

一个完全用C语言实现的贪吃蛇游戏，在TC环境下运行！对于初学C的同志，写个小游戏无疑是打基础的好方法，同时也提高自己对编程的兴趣！(A Snake game entirely in C language to run in the TC environment! Beginner C comrades to write a small game is undoubtedly a good way to lay the foundation, but also improve their own interest in programming!)

锁定显示器时自动关闭计算机屏幕，节约能源(Automatic shutdown the computer lock screen display, energy saving)

采用算符优先分析法，对G[S]所定义的赋值语句进行语法分析，并在语法分析过程中将所输入的赋值语句翻译为四元式。(Priority use of operator analysis of G [S] defined assignment for parsing and grammar analysis of the process entered assignment translated into Quaternion type.)

不可压缩稳态滑块润滑，一定长度的变间隙油膜厚度解析(Incompressible variable gap steady slide lubrication film thickness resolve certain length)

DRM发射和接收端完整仿真,包括编解码,同步(时间同步和频率同步),调制解调,均衡等(DRM-side transmitting and receiving a complete simulation, including the coding and decoding, synchronized (time synchronization and frequency synchronization), modulation and demodulation, balanced, etc.)

666，将**转换程__,dejdioejdiejwoideoijh(fcdhewuecdfwfvcewvcerdfverfd)

poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills. (poj 3941 Hideyuki is allowed by his father Ujisato some 1000 yen bills every month for his pocket money. In the first day of every month, the number of bills is decided as follows. Ujisato prepares n pieces of m-sided dice and declares the cutback k. Hideyuki rolls these dice. The number of bills given is the sum of the spots of the rolled dice decreased by the cutback. Fortunately to Hideyuki, Ujisato promises him to give at least one bill, even if the sum of the spots does not exceed the cutback. Each of the dice has spots of 1 through m inclusive on each side, and the probability of each side is the same. In this problem, you are asked to write a program that finds the expected value of the number of given bills.)