摘要： MPI MaelstromTime Limit:1000MSMemory Limit:10000KTotal Submissions:4017Accepted:2412DescriptionBIT has recently taken delivery of their new supercomputer, a 32 processor Apollo Odyssey distributed shared memory machine with a hierarchical communication subsystem. Valentine McKee's research advis 阅读全文

摘要： WormholesTime Limit:2000MSMemory Limit:65536KTotal Submissions:24249Accepted:8652DescriptionWhile exploring his many farms, Farmer John has discovered a number of amazing wormholes. A wormhole is very peculiar because it is a one-way path that delivers you to its destination at a time that is BEFORE 阅读全文

摘要： Silver Cow PartyTime Limit:2000MSMemory Limit:65536KTotal Submissions:10147Accepted:4497DescriptionOne cow from each ofNfarms (1 ≤N≤ 1000) conveniently numbered 1..Nis going to attend the big cow party to be held at farm #X(1 ≤X≤N). A total ofM(1 ≤M≤ 100,000) unidirectional (one-way roads connects p 阅读全文

摘要： Heavy TransportationTime Limit:3000MSMemory Limit:30000KTotal Submissions:17314Accepted:4546DescriptionBackgroundHugo Heavy is happy. After the breakdown of the Cargolifter project he can now expand business. But he needs a clever man who tells him whether there really is a way from the place his cu 阅读全文

摘要： FroggerTime Limit:1000MSMemory Limit:65536KTotal Submissions:20314Accepted:6601DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sunscreen 阅读全文

摘要： FroggerTime Limit:1000MSMemory Limit:65536KTotal Submissions:20310Accepted:6597DescriptionFreddy Frog is sitting on a stone in the middle of a lake. Suddenly he notices Fiona Frog who is sitting on another stone. He plans to visit her, but since the water is dirty and full of tourists' sunscreen 阅读全文

摘要： 题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3534题意：给出一颗树（n个顶点，n-1条边）求最长的路径，以及最长路径的条数。路径无非就是连接两个点直接的路。因为是一颗树，所以连接两个点肯定是唯一的路径。其实就是求两点间距离的最大值，以及这个最大值有多少个。很裸的树形DP；首先统计出结点到叶子结点的最长距离和次长距离。然后找寻经过这个点的，在这个为根结点的子树中的最长路径个数目。代码：#include <string.h>#include <iostream>#include <algorithm>#incl 阅读全文

摘要： 今天的比赛。。。。。速度还是慢了。。。无缘无故错误提交好多次。。哭了。。。。比较简单：A题：HDU 4557非诚勿扰链接：http://acm.hdu.edu.cn/showproblem.php?pid=4557暴力胡搞，水题：//============================================================================// Name : A.cpp// Author : // Version :// Copyright : Your copyright notice// Description... 阅读全文

摘要： Problem B: Fire!Joe works in a maze. Unfortunately, portions of the maze have caught on fire, and the owner of the maze neglected to create a fire escape plan. Help Joe escape the maze.Given Joe's location in the maze and which squares of the maze are on fire, you must determine whether Joe can 阅读全文

摘要： M斐波那契数列Time Limit: 3000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 353Accepted Submission(s): 93Problem DescriptionM斐波那契数列F[n]是一种整数数列，它的定义如下：F[0] = aF[1] = bF[n] = F[n-1] * F[n-2] ( n > 1 )现在给出a, b, n，你能求出F[n]的值吗？Input输入包含多组测试数据；每组数据占一行，包含3个整数a, b, n（ 0 < 阅读全文