GodLike

Maya CalendarTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 60309 Accepted: 18596DescriptionDuring his last sabbatical, professor M. A. Ya made a surpris

Help JimmyTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8228 Accepted: 2630Description"Help Jimmy" 是在下图所示的场景上完成的游戏。 场景中包括多个长度和高度各不相同的平台。地面是最低的平台

Oil DepositsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11423 Accepted: 6208DescriptionThe GeoSurvComp geologic survey company is responsible for de

Lake CountingTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17082 Accepted: 8654DescriptionDue to recent rains, water has pooled in various places in F

Curling 2.0Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9485 Accepted: 4003DescriptionOn Planet MM-21, after their Olympic games this year, curling i

Meteor ShowerTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 6806 Accepted: 1985DescriptionBessie hears that an extraordinary meteor shower is coming; r

Backward Digit SumsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3579 Accepted: 2054DescriptionFJ and his cows enjoy playing a mental game. They write

Milking TimeTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 4129 Accepted: 1720DescriptionBessie is such a hard-working cow. In fact, she is so focuse

Cheapest PalindromeTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 5173 Accepted: 2512DescriptionKeeping track of all the cows can be a tricky task so F

GCommando WarInput: Standard InputOutput: Standard Output  “Waiting for orders we held in the wood, word from thefront never cameBy evening the sound of the gunfire was mil

注意：给定数轴上的n 个点，在数轴上的所有点中，中位数离所有顶点的距离之和最小。 F. Spreading the Wealth ProblemA Communist regime is trying to redistribute wealth in a village. They have have decided tosit eve

Programming contests became so popular in the year 2397 that the governor of New Earck -- the largest human-inhabited planet of the galaxy -- opened a special Alley of Contestant Memories (ACM) at the

Source CodeProblem: 2393 User: zoujinyongMemory: 252K Time: 94MSLanguage: C++ Result: AcceptedSource Code#include #include using namespace std;int main(){ int N, S; cin >> N >> S;

StripiesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 11128 Accepted: 5327DescriptionOur chemical biologists have invented a new very useful form of lif

题目一：求1！+2！+…..+n！ 的和的后6位，（注意n的范围）#include using namespace std;const int MAX = 1000000;int getResu(int n){ int sum=0; int temp= 1; for(int i=1; i <= n; i++) { temp *= i; temp %= MAX;

#include using namespace std;template class testClass{ public: static int _data;};int testClass::_data = 1;int testClass::_data = 2;int main(){ cout ::_data << endl; cout ::_data <<

AntsTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7418 Accepted: 3426DescriptionAn army of ants walk on a horizontal pole of length l cm, each with a

棋盘分割Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11457 Accepted: 4032Description将一个８*８的棋盘进行如下分割：将原棋盘割下一块矩形棋盘并使剩下部分也是矩形，再将剩下的部分继续如此分割，这样割了(n-1)次后，连同最后

棋盘问题Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19935 Accepted: 9933Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解

DNA SortingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 75079 Accepted: 30074DescriptionOne measure of ``unsortedness'' in a sequence is the number of

487-3279Time Limit: 2000MS Memory Limit: 65536KTotal Submissions: 220050 Accepted: 38357DescriptionBusinesses like to have memorable telephone numbers. One way to m

好久没上帖了，现在把昨天一个晚上和今天一上午的努力写出来，大家互相交流下。题目的描述我就直接COPY了：ExponentiationTime Limit: 500MS Memory Limit: 10000KTotal Submissions: 121122 Accepted: 29574Description

HangoverTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 91219 Accepted: 44197DescriptionHow far can you make a stack of cards overhang a table? If you h

BiorhythmsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 103717 Accepted: 32096DescriptionSome people believe that there are three cycles in a person's l

Financial ManagementTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 107802 Accepted: 51472DescriptionLarry graduated this year and finally has a job. He's

I Think I Need a HouseboatTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 79136 Accepted: 34102DescriptionFred Mapper is considering purchasing some land

SticksTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 113105 Accepted: 25961DescriptionGeorge took sticks of the same length and cut them randomly until

快速排序算法是基于分治策略的另一个排序算法。其基本思想是，对于输入的子数组，按以下三步进行排序。一：分解二：递归求解三：合并#include #define N 8typedef int Type;using namespace std;void QuickSort(Type a[], int left, int right){ if(left < right)

对于包括n 个元素的输入序列来说，任何比较排序在最坏情况下都要经过nlg(n) 次比较，因此归并和堆排序是渐进最优的，并且任何已知的比较排序最多就是在常数因子上优于它们。而对于非比较排序来说，下界nlg(n) 对它们是没用的，在某些情况下排序的复杂度可以达到 n .下面介绍其中的一种非比较排序：计数排序计数排序有一个非常重要的地方就是：假定数据的范围是在某个区间内，如果数据的大小相差非常大

相对于计数排序，桶排序和计数排序的差别就在于处理相同数据的差别上。计数排序假设输入数据都属于一个小区间内的整数，而桶排序则是假设输入是由一个随时过程产生的，该过程将元素均匀分布在[0, 1)区间上。在桶排序的过程中有一个非常重要的地方就是，投射的位置 =  current_data * number_array / maximum_array_scope ， 如果出现多个数投射在相同的

DividingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 54590 Accepted: 13973DescriptionMarsha and Bill own a collection of marbles. They want to split

Communication SystemTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 21631 Accepted: 7689DescriptionWe have received an order from Pizoor Communications

滑雪Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 70183 Accepted: 25897DescriptionMichael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等

Stockbroker GrapevineTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 24476 Accepted: 13468DescriptionStockbrokers are known to overreact to rumours. You

HopscotchTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 1605 Accepted: 1141DescriptionThe cows play the child's game of hopscotch in a non-traditional

By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.37 42 4 68 5 9 3That is, 3 + 7 + 4 + 9 = 23.Find th