![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
acm_杂题
文章平均质量分 82
ascii991
这个作者很懒,什么都没留下…
展开
-
topcoder SRM500 DIV1 level2 500分
Problem Statement Nick likes to draw fractals. For the special occasion of Single Round Match 500, he decided to draw the 500th generation of his favorite fractal.Each generation of the原创 2012-05-14 16:47:23 · 686 阅读 · 0 评论 -
topcoder SRM500 DIV1 LEVEL1 250分题
Problem Statement N friends (numbered from 0 to N-1) play a game called Mafia. The exact rules of the game are not important for this problem. What's important is that at some point in the原创 2012-05-14 17:08:46 · 703 阅读 · 0 评论 -
topcoder SRM500 div1 Level3
Problem Statement NOTE: This problem statement contains superscripts that may not display properly if viewed outside of the applet.A positive integer is called nice if the sum of its di原创 2012-05-19 10:36:40 · 969 阅读 · 0 评论 -
topcoder SRM 500 div2 level3
Problem Statement NOTE: This problem statement contains superscripts that may not display properly if viewed outside of the applet.You are given two geometric progressions S1 = (b1*q1i,原创 2012-05-19 10:41:14 · 484 阅读 · 0 评论 -
SRM 492 div1level1
There are N trees arranged in a straight horizontal line. They are numbered 0 through N-1 from left to right. The distance between tree i and tree (i+1) is distance[i], and the initial vertical height原创 2012-05-25 17:39:37 · 413 阅读 · 0 评论 -
poj模拟题总结(一)
模拟是acm算法中基础但深奥的算法,不容轻视。本次模拟题练习题为1835,2623,2271,2996,2706,1676,1472,1027,3371。1835 宇航员:可以以左手,脸,头三个参量的方向来确定自己的方向。自己比划比划即可。2996:棋盘问题,比较水。2706:线段相交+DFS,注意线段相交的判断。1676:DFS即可。1472:典型的递归题,构建栈。原创 2012-07-11 14:02:26 · 1385 阅读 · 0 评论 -
ural 1165 subnumber ------猥琐的超级大繁题
1165. SubnumberTime Limit: 1.0 secondMemory Limit: 16 MBGeorge likes arithmetics very much. Especially he likes the integers series. His most favourite thing is the infinite sequence of digi原创 2012-07-11 14:50:52 · 897 阅读 · 0 评论 -
poj1379 模拟退火
【题意】地图中有N个陷阱,给出他们的坐标,求一个点,使得这个点到所有陷阱的最小距离最大。【题解】乍一看是二分,但没有好方法。看到题目要求的精度为0.1,则自然想到了模拟退火。模拟退火的流程大致如下1、随即生成若干解2、定下步长d,和降温速度3、开始模拟退火过程【代码】#include #include #include #include #inclu原创 2012-06-06 10:39:20 · 3225 阅读 · 0 评论 -
poj 1635 判断树是否同构
【题意】给出两棵树,判断树是否同构。树的表示:从根节点深搜,0表示向下,1表示向上回溯,得到的01串。【题解】将树最小表示,排序如何得到子树:子树的01串中0和1的数量相等。所以只需递归求解。【代码】#include #include #include #include using namespace std;const int maxn=3005;原创 2012-04-26 17:41:19 · 2207 阅读 · 0 评论