Circles Game 题目连接: http://acm.hdu.edu.cn/showproblem.php?pid=5299 Description There are n circles on a infinit…
分类:Online Judge
hdu 5446 Unknown Treasure lucas和CRT
Unknown Treasure Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.php?pid=…
hdu 5206 Four Inages Strategy 判断是否是正方形
Four Inages Strategy Time Limit: 1 Sec Memory Limit: 256 MB 题目连接 http://acm.hdu.edu.cn/showproblem.…
Codeforces Round #228 (Div. 1) B. Fox and Minimal path 构造
B. Fox and Minimal path 题目连接: http://codeforces.com/contest/388/problem/B Description Fox Ciel wants to write …
HDU 4738 Caocao's Bridges (2013杭州网络赛1001题,连通图,求桥)
Caocao’s Bridges Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768…
HDU 4622 Reincarnation (查询一段字符串的不同子串个数,后缀自动机)
Reincarnation Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java…
HDU 4178 Roll-call in Woop Woop High(字符串处理题)
#include<stdio.h> #include<string.h> #include<iostream> using namespace std; char str[1000];…
HDU 1015 Safecracker (枚举)
Safecracker Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Ot…
HDU 1043 [Eight] 八数码
关键思想:关于这个问题,有大牛给出了八境界,我先介绍一种比较容易理解的。BFS+康托展开。 康托展开其实就是把一个排列和一个整数对应起来,比如我们把空格当作9,那八数码的每个格局就是9的全排列中的某一个排列,经过康托展开…
2010-2011 ACM-ICPC, NEERC, Moscow Subregional Contest Problem A. Alien Visit 计算几何
Problem A. Alien Visit 题目连接: http://codeforces.com/gym/100714 Description Witness: “First, I saw only one UFO.…
Codeforces Round #354 (Div. 2) E. The Last Fight Between Human and AI 数学
E. The Last Fight Between Human and AI 题目连接: http://codeforces.com/contest/676/problem/E Description 100 years…
ACM/ICPC 之 拓扑排序-反向(POJ3687)
难点依旧是题意。。。。需要反向构图+去重+看题 POJ3687-Labeling Balls 题意:1-N编号的球,输出满足给定约束的按原编号排列的重量序列,如果有多组答案,…