HDU1312——Red and Black (DFS)

Red and BlackTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 12907    Accepted Submission(s):...

2018-05-27 20:04:43

阅读数:17

评论数:0

HDU1241——Oil Deposits (DFS)

题目:The GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvCompworkswithonelargerectangularregionofland...

2018-05-23 20:20:42

阅读数:27

评论数:0

POJ1426——Find The Multiple (BFS)

Given a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You ...

2018-05-23 19:32:50

阅读数:13

评论数:0

HDU1195——Open the Lock (BFS)

原题链接: http://acm.hdu.edu.cn/showproblem.php?pid=1195 #include<iostream> #include<cstdio> #include&amp...

2018-05-21 20:19:50

阅读数:16

评论数:0

笔记——queue

queue是面对队列使用的使用queue之前,要先利用构造函数一个队列对象,才可以进行元素的入队,出队,取队首和队尾等操作;#include <iostream>#include <queue>using na...

2018-05-18 19:32:32

阅读数:19

评论数:0

HDU1012——判断素数

1.简单暴力的方法    判断[2,n-1]区间有没有约数即可    int isPrime(int n) {      int i;      for (i = 2; i < n; ++i) {          if (n % i == 0) return 0;     ...

2018-05-16 19:08:30

阅读数:13

评论数:0

提示
确定要删除当前文章?
取消 删除
关闭
关闭