|
摘要：
学习数据结构了，写下来，加深记忆。第一篇：//system("cls"); 控制台屏幕刷新#include#include#include#define MAXSIZE 100typedef int DataType;typedef struct{ DataType data[MAXSIZE]; int length;}SeqList;//初始化顺序表SeqList SeqListInit( ){ SeqList L; //coutL.length-1) return -1;// 超出表范围，错误，返回-1 return L.data[i-1];//顺序表元素下标从0开始} 阅读全文
摘要：
Problem DescriptionConsidera positive integer X,and let S be the sum of all positive integer divisors of2004^X. Your job is to determine S modulo 29 (the rest of the division of S by29).Take X = 1 for an example. The positive integer divisors of 2004^1 are 1, 2, 3,4, 6, 12, 167, 334, 501, 668, 1002 阅读全文
|
