forevermemory

摘要：题目描述HJ，LWC，HRQ三个人在外面比赛，比赛前他们想去外面玩，但是三个人相去的地方不一样。他们坐一辆出租车，请问怎么走，把他们三个都送到目的地的路程最短？输入第一行是一个整数K(K#include#include#include#include#include#define inf 100000000using namespace std;int visit[1005];int pre[1005];int des[1005];int save[4];int sg[4][4];int n,m;struct lmx{int to;int next;int w;};lmx lm[80004]; 阅读全文

摘要：DescriptionLittle Johnny has got a new car. He decided to drive around the town to visit his friends. Johnny wanted to visit all his friends, but there was many of them. In each street he had one friend. He started thinking how to make his trip as short as possible. Very soon he realized that the be 阅读全文

摘要：DescriptionA catenym is a pair of words separated by a period such that the last letter of the first word is the same as the last letter of the second. For example, the following are catenyms:dog.gopher gopher.rat rat.tiger aloha.aloha arachnid.dogA compound catenym is a sequence of three or more wo 阅读全文

摘要：Problem DescriptionNow you are given one non-negative integer n in 10-base notation, it will only contain digits ('0'-'9'). You are allowed to choose 2 integers i and j, such that: i!=j, 1≤i#include#includeusing namespace std;int p[1010];void swap(int &a,int &b){int temp=a;a= 阅读全文

摘要：DescriptionA single-player game is played on a rectangular board divided in R rows and C columns. There is a single uppercase letter (A-Z) written in every position in the board. Before the begging of the game there is a figure in the upper-left corner of the board (first row, first column). In ever 阅读全文

摘要：DescriptionYou are given a bunch of wooden sticks. Each endpoint of each stick is colored with some color. Is it possible to align the sticks in a straight line such that the colors of the endpoints that touch are of the same color?InputInput is a sequence of lines, each line contains two words, sep 阅读全文

摘要：Problem DescriptionOverpower often go to the playground with classmates. They play and chat on the playground. One day, there are a lot of stars in the sky. Suddenly, one of Overpower’s classmates ask him: “How many acute triangles whose inner angles are less than 90 degrees (regarding stars as poin 阅读全文

摘要：Problem DescriptionBob enjoys playing computer games, especially strategic games, but sometimes he cannot find the solution fast enough and then he is very sad. Now he has the following problem. He must defend a medieval city, the roads of which form a tree. He has to put the minimum number of soldi 阅读全文

摘要：Problem Descriptionthe second year of the university somebody started a study on the romantic relations between the students. The relation “romantically involved” is defined between one girl and one boy. For the study reasons it is necessary to find out the maximum set satisfying the condition: ther 阅读全文

摘要：Problem DescriptionJason买来了n米长的竹篱笆，打算将n米长的竹篱笆全部用来围成一个三角形的养鸡场。为方便起见，养鸡场三条边的长度都为正整数。同时，他想让自己的养鸡场看起来更美观一些，要求三条边的长度分别在一个区间范围内。现在，他想知道有多少种不同的方案使得围成的养鸡场满足要求？ Input输入包含多组数据。输入数据第一行是一个正整数n，表示竹篱笆的长度。在接下来三行中，第i行的两个正整数为xi，yi。表示三角形的第i条边的边长ai的范围在[xi,yi]内。注意：Jason规定a1≤a2≤a3。 Output输出一个整数，表示满足要求的不同方案数。约定：对于第二行至第四行 阅读全文

摘要：Problem Description现在有一个等式如下：x^2+s(x,m)x-n=0。其中s(x,m)表示把x写成m进制时，每个位数相加的和。现在，在给定n，m的情况下，求出满足等式的最小的正整数x。如果不存在，请输出-1。 Input有T组测试数据。以下有T(T#include#includeusing namespace std;#define ll __int64ll lmx(int x,int m){ll temp=x,sum=0;while(temp){ sum+=temp%m; temp/=m;}return sum;}int main(){ int test;ll n,m,x 阅读全文

摘要：Problem Description某省调查乡村交通状况，得到的统计表中列出了任意两村庄间的距离。省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路交通（但不一定有直接的公路相连，只要能间接通过公路可达即可），并要求铺设的公路总长度为最小。请计算最小的公路总长度。Input测试输入包含若干测试用例。每个测试用例的第1行给出村庄数目N ( #include#include#includeusing namespace std;int p[105],n,sum;void init(){int i;for(i=1;i<=n;i++) p[i]=i;}int find(int x){ 阅读全文

摘要：Problem DescriptionThere was no donkey in the province of Gui Zhou, China. A trouble maker shipped one and put it in the forest which could be considered as an N×N grid. The coordinates of the up-left cell is (0,0) , the down-right cell is (N-1,N-1) and the cell below the up-left cell is (1,0). 阅读全文

摘要：Problem DescriptionIn the ancient three kingdom period, Zhuge Liang was the most famous and smartest military leader. His enemy was Shima Yi, who always looked stupid when fighting against Zhuge Liang. But it was Shima Yi who laughed to the end. Once, Zhuge Liang sent the arrogant Ma Shu to defend J 阅读全文

摘要：Problem DescriptionThere are n numbers in a array, as a0, a1 ... , an-1, and another number m. We define a function f(i, j) = ai|ai+1|ai+2| ... | aj . Where "|" is the bit-OR operation. (i int p[100005];int main(){ int test,n,i,ca=0,j,m;scanf("%d",&test);while(test--){ca++;in 阅读全文

摘要：Problem DescriptionThere are N points in total. Every point moves in certain direction and certain speed. We want to know at what time that the largest distance between any two points would be minimum. And also, we require you to calculate that minimum distance. We guarantee that no two points will 阅读全文

摘要：Problem DescriptionThree wizards are doing a experiment. To avoid from bothering, a special magic is set around them. The magic forms a circle, which covers those three wizards, in other words, all of them are inside or on the border of the circle. And due to save the magic power, circle's area 阅读全文

摘要：Problem DescriptionIf we sum up every digit of a number and the result can be exactly divided by 10, we say this number is a good number.You are required to count the number of good numbers in the range from A to B, inclusive.InputThe first line has a number T (T #include#define ll __int64using name 阅读全文

摘要：Problem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In the field of Cyberground, the position of each toy is fixed, and the ring is carefully designed so it can only encircle one toy at a tim 阅读全文

摘要：DescriptionAlice想要从城市A出发到城市B,由于Alice最近比较穷(不像集训队陈兴老师是个rich second)，所以只能选择做火车从A到B。不过Alice很讨厌坐火车，火车上人比较多，比较拥挤，所以Alice有很严格的要求：火车的相邻两站间的最大距离尽可能的短，这样Alice就可以在停站的时候下车休息一下。当然Alice希望整个旅途比较短。Input有多组测试数据。每组测试数据的第一行有两个整数N,M，A,B(N=2, A,B#include#include#include#define inf 10000000using namespace std;struct lmx{ 阅读全文

摘要：#includeint p[10][10];int n;int main(){int cnt,i,x,y,j; while(scanf("%d",&n)!=EOF) { cnt=0; for(i=1;i<=n;i++) { p[1][i]=++cnt; } x=1;y=n; int temp=n-1; for(j=1;j<=n-1;j++) { for(i=1;i<=temp;i++) { x++; p[x][y]=++cnt; } for(i=1;i<=temp;i++) { y--; p[x][y]=++cnt; } temp-=1; f 阅读全文

摘要：Problem DescriptionThese are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should be delivered from one city to another. The transportation fee consists of two parts: The cost of the transportation on the path betw 阅读全文

摘要：Description任意一个分数都是有理数，对于任意一个有限小数，我们都可以表示成一个无限循环小数的形式(在其末尾添加0)，对于任意一个无限循环小数都可以转化成一个分数。现在你的任务就是将任意一个无限循环小数转化成既约分数形式。所谓既约分数表示，分子和分母的最大公约数是1。Input有多组数据。每组数据一行。输入为0.a1a2a3...ak(b1b2...bm)的形式，其中a1a2a3...ak为非循环部分，(b1b2b3..bm)为循环部分。数据保证非循环部分的长度k和循环部分的长度m不会超过8.Output对于每组测试数据输出A/B，其中A是分子，B是分母，A,B均为整数。Sample 阅读全文