http://poj.org/problem?id=3083 Description The cornfield maze is a popular Halloween treat. Visitors are shown the entrance and must wander through th
http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=1157 题目描述 小鼠a与小鼠b身处一个m×n的迷宫中，如图
http://poj.org/problem?id=2049 Description Nemo is a naughty boy. One day he went into the deep sea all by himself. Unfortunately, he became lost and
Dungeon Master Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16748 Accepted: 6522 Description You are trapped in a 3D dungeon and need to
http://poj.org/problem?id=1062 Description 年轻的探险家来到了一个印第安部落里。在那里他和酋长的女儿相爱了，于是便
http://acm.hdu.edu.cn/showproblem.php?pid=5012 Problem Description There are 2 special dices on the table. On each face of the dice, a distinct number
http://poj.org/problem?id=1860 Description Several currency exchange points are working in our city. Let us suppose that each point specializes in two
http://poj.org/problem?id=1789 Description Advanced Cargo Movement, Ltd. uses trucks of different types. Some trucks are used for vegetable delivery,
http://poj.org/problem?id=2485 Description The island nation of Flatopia is perfectly flat. Unfortunately, Flatopia has no public highways. So the tra
http://poj.org/problem?id=1258 Description Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connecti
http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2465 题目描述 由于前两次的打击，ZYJ同学不再喜欢
http://acm.sdut.edu.cn:8080/vjudge/contest/view.action?cid=259#problem/F Description 呃......变形课上Harry碰到了一点小麻烦,因为他并不像Hermione那样能够记住所有的咒语而随意的将一个棒球变成刺猬什么
http://acm.sdut.edu.cn:8080/vjudge/contest/view.action?cid=259#problem/E Description The Borg is an immensely powerful race of enhanced humanoids from
http://acm.hdu.edu.cn/showproblem.php?pid=4308 Saving Princess claire_ Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others
http://acm.hdu.edu.cn/showproblem.php?pid=1372 Knight Moves Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Sub
http://poj.org/problem?id=1481 The Die Is Cast Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 860 Accepted: 358 Description InterGames is
http://poj.org/problem?id=1562 Oil Deposits Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 12595 Accepted: 6868 Description The GeoSurvCom
http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=1124 飞跃原野 题目描述 勇敢的法里奥出色
http://acm.sdut.edu.cn/sdutoj/problem.php?action=showproblem&problemid=2193 救基友记3 Time Limit: 1000ms Memory limit: 6553
BFS广搜题目有时间一个个做下来 图形graphc优化存储游戏 有时间要去做做这些题目，所以从他人空间copy过来了，谢谢那位大虾啦。pku 1175 Starry Night 题目地址：http://acm.pku.edu.cn/JudgeOnline/problem?id=1175 解法：BFS，要注意的是如何判断图形是一样的，我的做法就是计算每两个点的距离之和。 pku 1020
http://poj.org/problem?id=1426 Description Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representat
http://poj.org/problem?id=2488 Description Background The knight is getting bored of seeing the same black and white squares again and again and has d
http://acm.hdu.edu.cn/showproblem.php?pid=1010 //题目链接http://ycool.com/post/ymsvd2s//一个很好理解剪枝思想的博客 Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a
http://poj.org/problem?id=3009 Description On Planet MM-21, after their Olympic games this year, curling is getting popular. But the rules are somewha
#include <iostream>#include <string.h>#include <stdlib.h>#include <stdio.h>#include <queue>#include<algorithm>#define inf 0x3f3f3f3fusing namespace st
http://poj.org/problem?id=1273 Description Every time it rains on Farmer John's fields, a pond forms over Bessie's favorite clover patch. This means t
http://poj.org/problem?id=2195
http://poj.org/problem?id=2135
http://poj.org/problem?id=1175 题目解析： 这个题因为数据的原因可以很水的过，但我因为把1e-8写成了1e-9WA了N遍，一直WA,题目意思很简单就是相似图形（就是求旋转的图形，我不会，但在discuss中看到 可以通过求图形的长度来求）另外常识性问题double数据类
#include #include #include #include #include #define inf 1000001 using namespace std; struct node { int x,y,c,w; int next; } eg[400001]; int n,m,K,s,t,tt,head[2005],dis[2005],pre[2005],v...
Copyright © 2005-2024 51CTO.COM 版权所有 京ICP证060544号
