摘要：1028: MultiplicationTime Limit: 2 Sec Memory Limit: 128 MBSubmit: 547 Solved: 126[Submit][Status][Web Board]DescriptionIf C=A⋄B, thenC[k]=∑max(i,j)=kA[i]⋅B[j]mod(109+7).Work out sequence C=A⋄B for given sequence A and B.InputThe first line contains a integer n, which denotes the length of sequence.. 阅读全文

摘要：- Little Elephant and Sorting Time Limit:1000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Submit Status Practice CodeForces 205BDescriptionThe Little Elephant loves sortings.He has an array a consisting of n integers. Let's number the array elements from 1 to n, then the i-th eleme 阅读全文

摘要：Happy TelephonesTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 199Accepted Submission(s): 159Problem DescriptionIn the land of Eden, all phone conversations are happy ones. People complaining on the phone are immediately put in jail. To enforce th 阅读全文

摘要：Tick and TickTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5214Accepted Submission(s): 1402Problem DescriptionThe three hands of the clock are rotating every second and meeting each other many times everyday. Finally, they get bored of this and e 阅读全文

摘要：ZOJ Problem Set - 1879Jolly JumpersTime Limit: 2 Seconds Memory Limit: 65536 KBA sequence of n > 0 integers is called a jolly jumper if the absolute values of the difference between successive elements take on all the values 1 through n-1. For instance,1 4 2 3is a jolly jumper, because the absolu 阅读全文

摘要：取石子游戏Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1304Accepted Submission(s): 732Problem Description1堆石子有n个,两人轮流取.先取者第1次可以取任意多个，但不能全部取完.以后每次取的石子数不能超过上次取子数的2倍。取完者胜.先取者负输出"Second win".先取者胜输出"First win".Input输入有多组.每组第1行是2<=n& 阅读全文

摘要：1006 - Hex-a-bonacci PDF (English) Statistics Forum Time Limit: 0.5 second(s)Memory Limit: 32 MBGiven a code (not optimized), and necessary inputs, you have to find the output of the code for the inputs. The code is as follows:inta,b,c,d,e,f;intfn(intn){if(n==0)returna;if(n==1)returnb;if(n==2)retu.. 阅读全文

摘要：1202 - Bishops PDF (English) Statistics Forum Time Limit: 1 second(s)Memory Limit: 32 MBThere is an Infinite chessboard. Two bishops are there. (Bishop means the chess piece that moves diagonally).Now you are given the position of the two bishops. You have to find the minimum chess moves to take o.. 阅读全文

摘要：JohnTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1312Accepted Submission(s): 683Problem DescriptionLittle John is playing very funny game with his younger brother. There is one big box filled with M&Ms of different colors. At first John has 阅读全文

摘要：Game of Life Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Practice UVALive 4034DescriptionLIFE is a evolutionary game played on a 2D game board. Initially, the game board is filled with white and black stones. For each iteration of the game, each stone is checked 阅读全文

摘要：A - Miss Kitty and Her Little Ice Cream Shop Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld & %llu Submit Status Practice UVALive 4033DescriptionMiss Kitty graduated from University N that has a long history of training their students to become teachers in an island country T. All of he 阅读全文

摘要：ZOJ Problem Set - 1244Definite ValuesTime Limit: 2 Seconds Memory Limit: 65536 KBA common error in programming is to use variables that have not been initialized before. For example, in C and C++, all variables have an indefinite value after declaration - their value can be anything. Thus, the fo... 阅读全文

摘要：小孩报数问题Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 7211Accepted: 3437Description有N个小孩围成一圈，给他们从1开始依次编号，现指定从第W个开始报数，报到第S个时，该小孩出列，然后从下一个小孩开始报数，仍是报到S个出列，如此重复下去，直到所有的小孩都出列（总人数不足S个时将循环报数），求小孩出列的顺序。Input第一行输入小孩的人数N（N<=64） 接下来每行输入一个小孩的名字(人名不超过15个字符)最后一行输入W,S (W < N)，用逗号","间隔Outpu 阅读全文

摘要：Number GameTime Limit : 3000/1000ms (Java/Other)Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 30Accepted Submission(s) : 10Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem Description有上下两个圆圈，每个圆圈边沿上均匀分布有N个点。上圆和下圆的点用一条竖直的直线连起来。将连续的自然数1到N，这N个数按逆时针方向放到下圆那N个不 同的点上。将连续的自然数N+ 阅读全文

摘要：汉诺塔 XTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 294Accepted Submission(s): 175Problem Description1,2,...,n表示n个盘子．数字大盘子就大．n个盘子放在第１根柱子上．大盘不能放在小盘上．在第１根柱子上的盘子是a[1],a[2],...,a[n]. a[1]=n,a[2]=n-1,...,a[n]=1.即a[1]是最下面的盘子．把n个盘子移动到第3根柱子．每次只能移动1个盘子，且大盘 阅读全文

摘要：汉诺塔IXTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 404Accepted Submission(s): 235Problem Description1,2,...,n表示n个盘子．数字大盘子就大．n个盘子放在第１根柱子上．大盘不能放在小盘上． 在第１根柱子上的盘子是a[1],a[2],...,a[n]. a[1]=n,a[2]=n-1,...,a[n]=1.即a[1]是最下 面的盘子．把n个盘子移动到第３根柱子．每次只能移动１个盘子，且 阅读全文

摘要：2 6 4 1 3 7 0 5 88 1 5 7 3 6 4 0 231treap sbt splay//今天写的八数码 速度不行呀、老超时、照着白皮书写的#include <iostream>#include <stdio.h>#include <string.h>#include <algorithm>#include <queue>#define MAXSIZE 362888using namespace std;typedef int State[9];State st[MAXSIZE],goal;int dis[MAXSIZ 阅读全文

摘要：kiki's gameTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 40000/1000 K (Java/Others)Total Submission(s): 3365Accepted Submission(s): 1952Problem Description Recently kiki has nothing to do. While she is bored, an idea appears in his mind, she just playes the checkerboard game.The size of th 阅读全文

摘要：Sum时间限制：1000 ms | 内存限制：65535 KB难度：2描述Consider the natural numbers from 1 to N. By associating to each number a sign (+ or -) and calculating the value of this expression we obtain a sum S. The problem is to determine for a given sum S the minimum number N for which we can obtain S by associating sig 阅读全文

摘要：Problem Description上次Gardon的迷宫城堡小希玩了很久（见Problem B），现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样，首先她认为所有的通道都应该是双向连通的，就是说如果有一个通道连通了房间A和B，那么既可以通过它从房间A走到房间B，也可以通过它从房间B走到房间A，为了提高难度，小希希望任意两个房间有且仅有一条路径可以相通（除非走了回头路）。小希现在把她的设计图给你，让你帮忙判断她的设计图是否符合她的设计思路。比如下面的例子，前两个是符合条件的，但是最后一个却有两种方法从5到达8。 Input输入包含多组数据，每组数据是一个以0 0结尾的整数 阅读全文