家谱管理系统

一个rulerkjian,有水平和垂直的标尺(A rulerkjian, a horizontal and vertical rule)

A Survey of Gaussian Convolution Algorithms 高斯卷积方面的综述文档和源码 可以供相关人员参考(A Survey of Gaussian Convolution Algorithms digital image processing)

用于微芯公司的dspic30F4011单片机控制场效应管例如（RF540等）实现DC-DC电源转换，并具有稳压和过流保护功能

稀疏矩阵的实例，讲述如何用稀疏矩阵进行实际的编程。本例是以超市购物为实际背景。(Examples of sparse matrix)

数字证书的demo程序，用于KPI建设。基于openssl实现。采用vc6.0编译。

破解全加密的key 支持PN532 这个程序允许从Mifare Classic卡恢复认证密钥。 请注意mfoc能够恢复密钥的目标只有有一个已知的关键：默认（硬编码在mfoc）或自定义（用户使用命令行）。(This program allow to recover authentication keys from MIFARE Classic card. Please note MFOC is able to recover keys from target only if it have a known key: default one (hardcoded in MFOC) or custom one (user provided using command line).)

关于C#如何设置系统热键，取消系统热键。-On the C# How to set up a hotkey system, the abolition of the system hotkey.

我们的目的是将一个分数拆分成若干个分子是1分母是正整数的分数之和的形式。例如2/3可以拆分成1/2+1/6的形式。这里不考虑顺序，比如1/6+1/2和1/2+1/6相同。 输入p, q, a, n, 其中p/q为分数，对这个分数进行拆分，要求拆分的分数个数不能多于n个，所有分母的乘积不能大于a。求有多少种拆分方法? 输入：最多200组数据。在每行中都有四个数分别表示p, q, a, n，之间以空格隔开，并且满足p,q<=800，a<=12000，n<=7，最后以四个0做为输入的结束。 输入示例: 2 3 120 3 2 3 300 3 0 0 0 0 输出示例: 4 7 (Our aim is to split a fraction into a number of elements is a denominator is a positive integer fraction of the sum of form. For example, 2/3 can be split into 1/2+1/6 form. Not considered here, the order, such as 1/6+1/2 and 1/2+1/6 of the same. Input p, q, a, n, where p/q as a fraction of this split scores require no more than the number of split points n-all the product of the denominator can not be larger than a. How many kinds of demand split method? Input: Up to 200 sets of data. In each line has four numbers indicate the p, q, a, n, separated by a space between, and meet the p, q < = 800, a < = 12000, n < = 7, the end, four 0 as the input end. Input Example: 2,312,032,330,030,000 sample output: 47)

A C code for reading/writing data to ProSlic Si3200/3220 using CodeVision

【实例简介】 ICPC，大学生ACM竞赛经典模板