『楼 主』:
最近做的一个卡片编码的计算程序
使用 LLM 解释/回答一下
最近在做一个卡片识别的机器。因为需要统计卡片上具有一定对称关系的编码，所以在TC下写了个计算程序(在0~256范围内寻找具有对称关系的数字)。根据对称关系的不同，各类数字被存放在不同的数据文件中。有兴趣的朋友可以研究下。
运行后生成8个文件，分别代表8种组合关系。举例：0x01和0x08成上下对称，0x01和0x10呈左右对称，0x01和0x80呈中心对称。0x01，0x08，0x10，0x80这四个数字组成一个对称关系的集合，这个程序就是来生成0~255内成所有的对称关系集合的。
Last edited by enjoyer on 2009-12-17 at 23:10 ]
Recently, I am working on a card recognition machine. Since I need to count the codes with certain symmetric relationships on the cards, I wrote a calculation program under TC (to find numbers with symmetric relationships within the range of 0 to 256). According to different symmetric relationships, various numbers are stored in different data files. Friends who are interested can study it.
After running, 8 files are generated, representing 8 kinds of combination relationships. For example, 0x01 and 0x08 are vertically symmetric, 0x01 and 0x10 are horizontally symmetric, and 0x01 and 0x80 are centrally symmetric. The four numbers 0x01, 0x08, 0x10, and 0x80 form a set of symmetric relationships, and this program is used to generate all sets of symmetric relationships within 0 to 255.
Last edited by enjoyer on 2009-12-17 at 23:10 ]
附件
1:  cardcode.rar (2009-12-6 04:04, 7.21 KiB,下载次数： 14)
|
