kongming_acm的专栏

Problem DescriptionAli has taken the Computer Organization and Architecture course this term. He learned that there may be dependence between instructions, like WAR (write after read), WAW, RAW.If

DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He p

DescriptionBig Johnsson Trucks Inc. is a company specialized in manufacturing big trucks. Their latest model, the Godzilla V12, is so big

DescriptionArbitrage is the use of discrepancies in currency exchange rates to transform one unit of a currency into more than one unit of

DescriptionSeveral startup companies have decided to build a better Internet, called the "FiberNet". They have already installed many node

Problem DescriptionIn order to get rid of Conan, Kaitou KID disguises himself as a teacher in the kindergarten. He knows kids love games a

Problem DescriptionEveryone knows how to calculate the shortest path in a directed graph. In fact, the opposite problem is also easy. Give

Problem DescriptionAfter awarded lands to ACMers, the queen want to choose a city be her capital. This is an important event in ice_crea

Problem DescriptionIt's now the year 21XX,when the earth will explode soon.The evil U.S. decided to invade the Mars to save their lives.

Problem DescriptionXiaoA lives in a village. Last year flood rained the village. So they decide to move the whole village to the mountai

We need irrigate our farms, but there is only one source of water nearby. So we need build some water channels with minimum cost.In Figu

DescriptionAfter a long lasting war on words, a war on arms finally breaks out between littleken’s and KnuthOcean’s kingdoms. A sudden

Problem DescriptionTC (Tian Chao) is magical place, as you all know...The railways and the rail-stations in TC are fragile and always

<br />#include<iostream><br />#include<cstring><br />#include<cmath><br />using namespace std;<br />const int N = 10005;<br />const int M =

村长要召开羊族大会，讨论羊族未来的发展，要求羊羊们到指定地点集合。小羊们收到通知后从家里出发到达指定地点。每个羊的家都是与其他羊的家连通的，可以互相访问。 比如说可以从1到3，同样也可以从3到1 。灰太郎听到这个消息后，准备有所行动（你懂的）。但他不知道应该在哪条路上等羊。但他知

大学的时光是值得怀念的，有多少事情珍藏在我们的记忆里，又有多少人我们一辈子都忘不掉。 123abc是一个不起眼的小男孩，他曾经在很多方面努力过，也经历了很多失败，在这些努力和失败中，他收获了自己的人生。 whx是123abc认识的一个女生，123abc很喜欢她，总是用各种方法想见

It's almost summer time, and that means that it's almost summer construction time! This year, the good people who are in charge of the roads

Chinese Postman Problem is a very famous hard problem in graph theory. The problem is to find a shortest closed path or circuit that visits

Problem DescriptionZLGG found a magic theory that the bigger banana the bigger banana peel .This important theory can help him make a po

//#include#include#include#include#include#includeusing namespace std;const int maxn=1100;struct Point{    double x,y;    int peo;};int n;Point pi[maxn];doubl

DescriptionMap generation is a difficult task in cartography. A vital part of such task is automatic labeling of the cities in a map; where for each city there is text label to be attached to its lo

DescriptionRatish is a young man who always dreams of being a hero. One day his friend Luffy was caught by Pirate Arlong. Ratish set off at once to Arlong's island. When he got there, he found the s

Problem DescriptionRobbie is playing an interesting computer game. The game field is an unbounded 2-dimensional region. There are N roun

Descriptionliympanda, one of Ikki’s friend, likes playing games with Ikki. Today after minesweeping with Ikki and winning so many time

DescriptionKatu Puzzle is presented as a directed graph G(V, E) with each edgee(a, b) labeled by a boolean operator op (one of AND,

tyvj 1111//自己模板//#include#include#include#includeusing namespace std;const int maxn=100000;int V,E;//点数(1) 边数str

DescriptionGord is training for a marathon. Behind his house is a park with a large network of jogging trails connecting water stations.

DescriptionLittle Johnny has got a new car. He decided to drive around the town to visit his friends. Johnny wanted to visit all his fri

A 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.

Problem DescriptionIn Fuzhou, there is a crazy super man. He can’t fly, but he could jump from housetop to housetop. Today he plans to use

It is well known that, in the period of The Three Empires, Liu Bei, the emperor of the Shu Empire, was defeated by Lu Xun, a general of the

Integer IntervalsTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9285 Accepted: 3898DescriptionAn integer interval [a,

The city executive board in Lund wants to construct a sightseeing tour by bus in Lund, so that tourists can see every corner of the beautifu

DescriptionIn the movie "Blues Brothers", the orphanage where Elwood and Jack were raised may be sold to the Board of Education if they do

Samball is going to travel in the coming vacation. Now it's time to make a plan. After choosing the destination city, the next step is to de

In order to get from one of the F (1 Given a description of the current set of R (F-1 There might already be more than one paths between the

After recapturing Sylla, the Company plans to establish a new secure system, a transferring net! The new system is designed as follows:The C

DescriptionHave you ever heard a star charity show called Charitable Exchange? In this show, a famous star starts with a small item which va

#include#include#include#includeusing namespace std;const int INF=(1struct Graph{    int s,t,w;//s->t=w;};Graph edge[5201];int dis[501];int V,E;//点数[1-n] 边数[0-E)bool bellman_ford(int s0)//原点{     for(int i=1;i       dis[i]=INF; dis[s0]=0;     for(int i=1;i

Invitation CardsTime Limit: 8000MS Memory Limit: 262144KTotal Submissions: 9544 Accepted: 3027DescriptionIn the age of television, not many people attend theater performances. Antique Comedians of Malidinesia are aware of this fact. They want to propagate