摘要:
ZOJ Problem Set - 1010 AreaTime Limit: 2 Seconds Memory Limit: 65536 KB Special Judge Jerry, a middle school student, addicts himself to mathematical 阅读全文
摘要:
ZOJ Problem Set - 1004 Anagrams by StackTime Limit: 2 Seconds Memory Limit: 65536 KB How can anagrams result from sequences of stack operations? There 阅读全文
摘要:
ZOJ Problem Set - 1003 Crashing BalloonTime Limit: 2 Seconds Memory Limit: 65536 KB On every June 1st, the Children's Day, there will be a game named 阅读全文
摘要:
ZOJ Problem Set - 1002 Fire NetTime Limit: 2 Seconds Memory Limit: 65536 KB Suppose that we have a square city with straight streets. A map of a city 阅读全文
摘要:
题目描述 有形如:ax3+bx2+cx+d=0 这样的一个一元三次方程。给出该方程中各项的系数(a,b,c,d 均为实数),并约定该方程存在三个不同实根(根的范围在-100至100之间),且根与根之差的绝对值>=1。要求由小到大依次在同一行输出这三个实根(根与根之间留有空格),并精确到小数点后2位。 阅读全文
摘要:
HASH意为(散列),是OI的常用算法。 我们常用哈希的原因是,hash可以快速(一般来说是O(段长))的求出一个子段的hash值,然后就可以快速的判断两个串是否相同。 今天先讲string类的hash。 可以发现,与一个string有关的HASH值不仅仅跟每个字符的个数有关,还和字符的位子有关。 阅读全文
摘要:
Oulipo Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 45515 Accepted: 18181 Description The French author Georges Perec (1936–1982) once w 阅读全文