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 ]
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 ]
Attachments
cardcode.rar (7.21 KiB, Downloads: 14)一切从底层开始