摘要： SubstringsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 9527Accepted: 3272DescriptionYou are given a number of case-sensitive strings of al... 阅读全文

摘要： The 3n + 1 problemTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 43840Accepted: 13797DescriptionProblems in Computer Science are often class... 阅读全文

摘要： Color Me LessTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 26432Accepted: 12740DescriptionA color reduction is a mapping from a set of disc... 阅读全文

摘要： 什么是GCD？GCD是最大公约数的简称（当然理解为我们伟大的党也未尝不可）。在开头，我们先下几个定义：①a|b表示a能整除b（a是b的约数）②a mod b表示a-[a/b]b（[a/b]在Pascal中相当于a div b）③gcd(a,b)表示a和b的最大公约数④a和b的线性组合表示ax+by（x,y为整数）。我们有：若d|a且d|b，则d|ax+by（这很重要！）线性组合与GCD现在我们证明一个重要的定理：gcd(a,b)是a和b的最小的正线性组合。证明：设gcd(a,b)为d，a和b的最小的正线性组合为s∵d|a且d|b，∴d|s。而a mod s=a-[a/s]s =a-[a/s]( 阅读全文

摘要： BiorhythmsTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 94863Accepted: 29139DescriptionSome people believe that there are three cycles in a... 阅读全文

摘要： <1> 用辗转相除法求最大公约数 算法描述: m对n求余为a, 若a不等于0 则 m <- n, n <- a, 继续求余 否则 n 为最大公约数 <2> 最小公倍数 = 两个数的积 / 最大公约数 阅读全文

摘要： DNA SortingTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 67603Accepted: 26858DescriptionOne measure of ``unsortedness'' in a sequence is th... 阅读全文

摘要： Rank ListTime Limit: 10000MSMemory Limit: 65536KTotal Submissions: 7883Accepted: 2561DescriptionLi Ming is a good student. He always asks the teacher ... 阅读全文

摘要： ArgusTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 8312Accepted: 3701DescriptionA data stream is a real-time, continuous, ordered sequence ... 阅读全文

摘要： Choose Your Own AdventureTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 1559Accepted: 638DescriptionAfter reading the book Tim and Marc Kill... 阅读全文