
搜索
bupt_xycr
欢迎关注我的公众号:算法入门
熟悉
c++
caffe
pytorch
mxnet
tensorflow
深度学习
自动驾驶
点云
图像处理
编程比赛
python
java
展开
-
HDU 5339 Untitled
。。UntitledTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 301 Accepted Submission(s): 156Problem DescriptionThere is an integer a and n integ原创 2016-04-21 19:03:42 · 317 阅读 · 0 评论 -
HDU 5326 Work
欢迎WorkTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 601 Accepted Submission(s): 401Problem DescriptionIt’s an interesting experience to mov原创 2016-04-21 19:03:31 · 261 阅读 · 0 评论 -
HDU 2612 Find a way
http://acm.hdu.edu.cn/showproblem.php?pid=2612Find a wayTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4478 Accepted Submission(s): 1525Prob原创 2016-04-21 19:00:04 · 240 阅读 · 0 评论 -
POJ 3984 迷宫问题
http://poj.org/problem?id=3984迷宫问题Time Limit: 1000MSMemory Limit: 65536KTotal Submissions: 9158Accepted: 5416Description定义一个二维数组: int maze[5][5] = { 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0,原创 2016-04-21 19:00:01 · 251 阅读 · 0 评论 -
POJ 1426 Find The Multiple
http://poj.org/problem?id=1426Find The MultipleTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 19337Accepted: 7845Special JudgeDescriptionGiven a positive integer n, write a program to find o原创 2016-04-21 18:59:59 · 233 阅读 · 0 评论 -
HDU 2181 哈密顿绕行世界问题
http://acm.hdu.edu.cn/showproblem.php?pid=2181哈密顿绕行世界问题Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1459 Accepted Submission(s): 922Proble原创 2016-04-21 18:59:56 · 232 阅读 · 0 评论 -
HDU 4707Pet
http://acm.hdu.edu.cn/showproblem.php?pid=4707PetTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1435 Accepted Submission(s): 692Problem Desc原创 2016-04-21 18:57:43 · 289 阅读 · 0 评论 -
ZOJ1091 Knight Moves
http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=91Knight MovesTime Limit: 2 Seconds Memory Limit: 65536 KBA friend of you is doing research on the Traveling Knight Problem (TKP) where原创 2016-04-21 18:57:27 · 293 阅读 · 0 评论 -
HDU 2952 Counting Sheep
http://acm.hdu.edu.cn/showproblem.php?pid=2952和油区那个一样,就是改了个搜索方向,用dfs标记#include#include#include#include#include#include#include#include#include#include#include#include #include #define maxn 10000+5#def原创 2016-04-21 18:55:46 · 201 阅读 · 0 评论 -
HDU 1181 变形课
http://acm.hdu.edu.cn/showproblem.php?pid=1181BFS搜索建树,找到一条边 b~m那么就输出yes 否则输出no#include#include#include#include#include#include#include#include#include#include#include#include #include #define maxn 10原创 2016-04-21 18:55:22 · 205 阅读 · 0 评论 -
HDU1241 Oil Deposits
http://acm.hdu.edu.cn/showproblem.php?pid=1241这道题目题意还是很好理解的,重要的是做法:DFS(),一共n*m个入口,进行DFS.我们可以从(1,1)开始找,如果遇到“@”进行搜索标记,把这个点(“@”)的8个方向扫一下,若这8个方向还有“@”,则接着搜索标记....#include#include#include#include#include#in原创 2016-04-21 18:55:17 · 231 阅读 · 0 评论 -
HDU2771 Stealing Harry Potter\'s Precious(bfs+dfs)
http://acm.hdu.edu.cn/showproblem.php?pid=4771这道题的题意:求从起点经过所有的Harry's precious所在点的最小步数;解析:BFS+DFSBFS用来求宝贝和起点这几个点的最短路径(步数)。并用这几个点建图(双向的),然后用dfs()求经过这几个点的最小路径。。刚开始没有想到用dfs()求最短路径。(以为dijkstra)..。。#includ原创 2016-04-21 18:54:55 · 433 阅读 · 0 评论 -
搜索入门题
http://poj.org/problem?id=2488A Knight's JourneyTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 32979Accepted: 11244DescriptionBackground The knight is getting bored of seeing the same black原创 2016-04-21 18:52:18 · 549 阅读 · 0 评论 -
杭电1010题
#include#includeusing namespace std;char map[8][8];int mx[]={1,-1,0,0};int my[]={0,0,-1,1};int n,m,t;int ex,ey;bool escape;void dfs(int sx,int sy,int cnt){ if(sx==ex&&sy==ey&&t==cnt) { escape=true;re原创 2016-04-21 18:52:15 · 489 阅读 · 0 评论 -
杭电1016 素数环
#includeusing namespace std;int A[50];int vis[50];int isp[50];int n;int is_prime(int n){ for(int i=2;i*i if(n%i==0)return 0; return 1;}void dfs(int cur){ if(cur==n&&isp[1+A[n-1]]) { for(int i=0;i原创 2016-04-21 18:52:09 · 355 阅读 · 0 评论