数据结构是计算机存储、组织数据的方式。数据结构是指相互之间存在一种或多种特定关系的数据元素的集合。
字典树也称Trie树，是一种哈希树，适用于字符串的查找，存储，统计，排序等操作。
Trie树的C语言实现代码如下：
#define MAX 26 //26个字母
#define SLEN 100 //节点中存储的字符串长度
//Trie结构体定义
struct Trie
{
struct Trie *next[MAX];
char s[SLEN]; //节点处存储的字符串
int isword; //节点处是否为单词
char val; //节点的代表字符
} *root;
//初始化Trie树
struct Trie *init()
{
struct Trie *root ...CRC是一种常用的错误侦测编码，例如，字符串"test"的CRC12余数计算结果为：
CRC12 remainder of str "test" is 679
The binary string is:
01110100 01100101 01110011 01110100 011001111001
计算CRC12的C语言代码如下：
/**
CRC12
*/
#include <cstring>
#include <stdlib.h>
#include <cstdio>
#include <iostream>
#define CHAR_SIZE 8
#define CRC_SIZE 12
using namespace ...Colored Sticks (POJ 2513)
Time Limit: 5000MS Memory Limit: 128000K
Description
You are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a straight ...
The Average (POJ 2833)
Time Limit: 6000MS Memory Limit: 10000K
Case Time Limit: 4000MS
Description
In a speech contest, when a contestant finishes his speech, the judges will then grade his performance. The staff remove the highest grade and ...