摘要： DescriptionPermutation TransformerWrite a program to transform the permutation1, 2, 3,...,naccording tominstructions. Each instruction(a,b)means to take out the subsequence from thea-th to theb-th element, reverse it, then append it to the end.InputThere is only one case for this problem. The first 阅读全文

摘要： *.bat@echo off :loop rand.exe > data.in std.exe std.out my.exe my.out fc my.out std.out if not errorlevel 1 goto loop pause goto loop 阅读全文

摘要： Graph and QueriesTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1333Accepted Submission(s): 267Problem DescriptionYou are given an undirected graph with N vertexes and M edges. Every vertex in this graph has an integer value assigned to it at the 阅读全文

摘要： 改良#include #include #include #define MAX 100using namespace std;const int MAX_NODE=100;struct Node{ Node* ch[2];//左右子树 int fix;//优先级。数值越大，优先级越高 int key; int size;//以它为根的子树的总结点数 bool operatorsize; if (ch[1]!=NULL) size+=ch[1]->size; }};struct Treap{ Node nodePool[MAX_NODE]... 阅读全文

摘要： DescriptionProblem DMorley’s TheoremInput:Standard InputOutput:Standard OutputMorley’s theorem states that that the lines trisecting the angles of an arbitrary plane triangle meet at the vertices of an equilateral triangle. For example in the figure below the tri-sectors of angles A, B and C has int 阅读全文

摘要： Optimal MilkingTime Limit:2000MSMemory Limit:30000KTotal Submissions:10010Accepted:3630Case Time Limit:1000MSDescriptionFJ has moved his K (1 15, a row is broken into successive lines of 15 numbers and a potentially shorter line to finish up a row. Each new row begins on its own line.OutputA single. 阅读全文

摘要： Power NetworkTime Limit:2000MSMemory Limit:32768KTotal Submissions:20743Accepted:10866DescriptionA power network consists of nodes (power stations, consumers and dispatchers) connected by power transport lines. A node u may be supplied with an amount s(u) >= 0 of power, may produce an amount 0 #i 阅读全文

摘要： Priest John's Busiest DayTime Limit:2000MSMemory Limit:65536KTotal Submissions:7055Accepted:2405Special JudgeDescriptionJohn is the only priest in his town. September 1st is the John's busiest day in a year because there is an old legend in the town that the couple who get married on that da 阅读全文

摘要： Katu PuzzleTime Limit:1000MSMemory Limit:65536KTotal Submissions:6702Accepted:2463DescriptionKatu Puzzle is presented as a directed graphG(V,E) with each edgee(a,b) labeled by a boolean operatorop(one of AND, OR, XOR) and an integerc(0 ≤c≤ 1). One Katu is solvable if one can find each vertexVia valu 阅读全文

摘要： WeddingTime Limit:1000MSMemory Limit:65536KTotal Submissions:6919Accepted:2127Special JudgeDescriptionUp to thirty couples will attend a wedding feast, at which they will be seated on either side of a long table. The bride and groom sit at one end, opposite each other, and the bride wears an elabora 阅读全文