摘要：
Morse Mismatches Samuel F. B. Morse is best known for the coding scheme that carries his name. Morse code is still used in internation... 阅读全文
摘要：
Sample Input Sample Output 5.699141892149156e76 9.205357638345294e18 0e0 5 8 8 6 #include #define DET 1e-4using namespace std;do... 阅读全文
摘要：
The Decoder Write a complete program that will correctly decode a set of characters into a valid message. Your program should read a gi... 阅读全文
摘要：
The figure shown on the left is left-right symmetric as it is possible to fold the sheet of paper along a vertical line, drawn as a dashed line, an... 阅读全文
摘要：
Problem E Foreign Exchange Input: standard input Output: standard output Time Limit: 1 second Your non-profit organization (iCORE - international ... 阅读全文
摘要：
Problem E: Compound Words You are to find all the two-word compound words in a dictionary. A two-word compound word is a word in the dictionary th... 阅读全文
摘要：
Problem B: Throwing cards away I Given is an ordered deck of n cards numbered 1 to n with card 1 at the top and card n at the bottom. The followin... 阅读全文
摘要：
A Ducci sequence is a sequence of n-tuples of integers. Given an n-tuple of integers (a1, a2, ... , an), the next n-tuple in the sequence is forme... 阅读全文
摘要：
You are working in a team that writes Incredibly Customizable Programming Codewriter (ICPC) which is basically a text editor with bells and whistle... 阅读全文
摘要：
埃拉托斯特尼筛法，是一种公元前250年由古希腊数学家埃拉托斯特尼所提出的一种简单检定素数的算法。 给出要筛数值的范围n，找出以内的素数。先用2去筛，即把2留下，把2的倍数剔除掉；再用下一个质数，也就是3筛，把3留下，把3的倍数剔除掉；接下去用下一个质数5筛，把5留下，把5的倍数剔除掉；不断重复下... 阅读全文
摘要：
自己写的大整数模板，已经升级到V2.0 功能： 计算大整数加减乘数取模运算，支持无限位数，支持正负数输入输出及运算，支持判断两个大整数的大小 保障： 1.VC++2013，GCC4.7.3运行测试通过 2.学校OJ加减乘除取模均AC //BigInt V2.0//By KunSoft#inclu... 阅读全文
摘要：
Flooded! To enable homebuyers to estimate the cost of flood insurance, a real-estate firm provides clients with the elevation of each 1... 阅读全文
摘要：
Description Alex is administrator of IP networks. His clients have a bunch of individual IP addresses and he decided to group all those IP addre... 阅读全文
摘要：
Extraordinarily Tired Students Time Limit: 3000MS Memory Limit: Unknown 64bit IO Format: %lld & %llu Submit Status Description Whe... 阅读全文
摘要：
N! Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 56209 Accepted Submission(s): 15948 ... 阅读全文
摘要：
Squares A children's board game consists of a square array of dots that contains lines connecting some of the pairs of adjacent dots.... 阅读全文
摘要：
Ancient Roman empire had a strong government system with various departments, including a secret service department. Important documents were sent b... 阅读全文
摘要：
Repeating Decimals The decimal expansion of the fraction 1/33 is , where the is used to indicate that the cycle 03 repeats indefinite... 阅读全文
摘要：
The 3n + 1 problem Background Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, ... 阅读全文
摘要：
All in All Input: standard input Output: standard output Time Limit: 2 seconds Memory Limit: 32 MB You have devised a new encryption technique which... 阅读全文