杭电acm
文章平均质量分 58
flying_fish_233
真诚做人,认真做事
展开
-
杭电1002(简单的大数)
Problem Description I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B.Input The first line of the input contains an integer T(1<=T<=20) which原创 2015-10-17 16:17:20 · 412 阅读 · 0 评论 -
杭电1010——Tempter of the Bone(DFS、剪枝)
Problem Description The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He rea原创 2016-01-22 13:38:18 · 386 阅读 · 0 评论 -
杭电1056——HangOver(水题)
Problem Description How far can you make a stack of cards overhang a table? If you have one card, you can create a maximum overhang of half a card length. (We’re assuming that the cards must be perpen原创 2016-01-22 16:37:37 · 1399 阅读 · 0 评论 -
杭电1022——Train Problem I(栈的应用)
Problem Description As the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train Station is th原创 2016-01-07 20:07:33 · 422 阅读 · 0 评论 -
杭电1015——Safecracker(dfs、递归枚举排列)
Problem Description === Op tech briefing, 2002/11/02 06:42 CST === “The item is locked in a Klein safe behind a painting in the second-floor library. Klein safes are extremely rare; most of them, al原创 2016-01-27 13:38:16 · 393 阅读 · 0 评论 -
杭电1671——Phone List(字典树的应用)
原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=1671问题分析: 该题需要我们判断字符串中是否有字符串是其他字符串的前缀。本题中使用了字典树,字典树结构对处理字符串前缀问题非常方便。主要考虑一下三种情况: (1)以前插入的字符串是当前字符串的前缀:比如,之前向字典树中插入字符串“911”,当前插入的字符串为“9110”。当前字符串“9110”插入第原创 2016-02-13 15:16:37 · 545 阅读 · 0 评论 -
杭电1072——Nightmare(BFS)
Problem Description Ignatius had a nightmare last night. He found himself in a labyrinth with a time bomb on him. The labyrinth has an exit, Ignatius should get out of the labyrinth before the bomb e原创 2016-02-01 15:55:18 · 475 阅读 · 0 评论 -
杭电1026——Ignatius and the Princess I(BFS)
Problem Description The Princess has been abducted by the BEelzebub feng5166, our hero Ignatius has to rescue our pretty Princess. Now he gets into feng5166’s castle. The castle is a large labyrinth.原创 2016-02-01 16:01:05 · 410 阅读 · 0 评论 -
杭电1058——Humble Numbers(丑数问题)
原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=1058任何一个数分解到最后都是由一些质数或者1相乘。基于此,题目中将一个数的质数因子在2,3,5,7之中,所以,这个数应当从1开始,不断乘以2,3,5,7获得。最开始想到穷举法,判断一个数是否为丑数的算法如下,那依次遍历所有2~2000000000的数(第一个丑数为1),判断其是否为丑数://判断一个数是原创 2016-03-03 12:56:19 · 5108 阅读 · 0 评论 -
杭电1075——What Are You Talking About(字典树应用)
原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=1075主要算法: 一开始使用数组存储英文和对应的火星文,排序,再折半查找,结果超时。后来,百度了下,改成用字典树存储。其典型应用是用于统计,排序和保存大量的字符串(但不仅限于字符串),所以经常被搜索引擎系统用于文本词频统计。它的优点是:利用字符串的公共前缀来减少查询时间,最大限度地减少无谓的字符串比较,原创 2016-02-04 11:29:23 · 519 阅读 · 0 评论 -
杭电1251——统计难题(字典树的应用)
原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=1251主要算法: 该题运用了字典树的知识。输入单词时,建立字典树。每个节点的v的值代表从根节点到该节点路径上所有字母组成的前缀出现的次数。当输入前缀时,只需查找字典树中是否有该前缀,若有,输出前缀的最后一个字母的v 的值,若无,输出0.AC代码:# include<stdio.h># include<原创 2016-02-04 17:13:00 · 392 阅读 · 0 评论 -
杭电1003——Max Sum(最大连续子序列和、递归分治)
原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=1003本题使用递归分治求解最大子序列问题。# include<stdio.h># include<malloc.h>typedef struct{ int left;//区间的左下标 int right;//区间的右下标 int maxsum;//区间最大和}Sum;Sum m原创 2016-02-18 15:52:48 · 939 阅读 · 0 评论 -
杭电1175——连连看(DFS)
原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=1175# include<stdio.h># include<string.h>int x1,y1,x2,y2,flag,n,m;int dir[4][2]={{-1,0},{1,0},{0,-1},{0,1}};int chess[1005][1005];int visited[1005][10原创 2016-02-21 16:56:11 · 638 阅读 · 0 评论 -
杭电1019——最小公倍数(简单题)
Problem Description The least common multiple (LCM) of a set of positive integers is the smallest positive integer which is divisible by all the numbers in the set. For example, the LCM of 5, 7 and 15原创 2015-11-01 13:52:15 · 656 阅读 · 1 评论 -
杭电1021——Fibonacci Again(找规律、简单题)
问题描述Problem Description There are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).Input Input consists of a sequence of lines, each containing an integer n. (n <原创 2015-11-01 14:53:59 · 2265 阅读 · 1 评论 -
杭电1017——A Mathematical Curiosity(简单题)
Problem Description Given two integers n and m, count the number of pairs of integers (a,b) such that 0 < a < b < n and (a^2+b^2 +m)/(ab) is an integer.This problem contains multiple test cases!The fi原创 2015-10-25 19:40:53 · 713 阅读 · 0 评论 -
杭电1004(简单题)
Problem Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges’ favorite time is guessing the most popular problem. When the contest is原创 2015-10-17 20:34:52 · 1392 阅读 · 0 评论 -
杭电1001(简单题)
Problem Description Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + … + n.Input The input will consist of a series of int原创 2015-10-17 15:09:43 · 698 阅读 · 0 评论 -
杭电1028——整数拆分(递归实现)
问题描述Problem Description “Well, it seems the first problem is too easy. I will let you know how foolish you are later.” feng5166 says.“The second problem is, given an positive integer N, we define an e原创 2015-11-03 21:49:20 · 540 阅读 · 0 评论 -
杭电1013——Digital Roots(简单题)
Problem Description The digital root of a positive integer is found by summing the digits of the integer. If the resulting value is a single digit then that digit is the digital root. If the resulting原创 2015-10-23 12:08:19 · 449 阅读 · 0 评论 -
杭电1032——The 3n + 1 problem(简单题)
问题描述Problem Description Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a propert原创 2015-11-08 11:47:01 · 845 阅读 · 0 评论 -
杭电1029——出现(n+1)/2次的数
问题描述Problem Description “OK, you are not too bad, em… But you can never pass the next test.” feng5166 says.“I will tell you an odd number N, and then N integers. There will be a special integer among原创 2015-11-06 16:26:04 · 1278 阅读 · 0 评论 -
杭电1040——As Easy As A+B(排序)
题目描述Problem Description These days, I am thinking about a question, how can I get a problem as easy as A+B? It is fairly difficulty to do such a thing. Of course, I got it after many waking nights. G原创 2015-11-08 17:05:31 · 689 阅读 · 0 评论 -
杭电1048——The Hardest Problem Ever(字符串)
问题描述Problem Description Julius Caesar lived in a time of danger and intrigue. The hardest situation Caesar ever faced was keeping himself alive. In order for him to survive, he decided to create one o原创 2015-11-08 17:53:30 · 885 阅读 · 0 评论 -
杭电1037——Keep on Truckin'(简单题)
题目描述Problem Description Boudreaux and Thibodeaux are on the road again …“Boudreaux, we have to get this shipment of mudbugs to Baton Rouge by tonight!”“Don’t worry, Thibodeaux, I already checked ahead原创 2015-11-08 16:40:45 · 1674 阅读 · 0 评论 -
杭电1012——u Calculate e(简单题)
Problem Description A simple mathematical formula for e is where n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.Output O原创 2015-10-23 11:06:02 · 830 阅读 · 0 评论 -
杭电1008(简单题)
Problem Description The highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified o原创 2015-10-22 20:43:18 · 416 阅读 · 0 评论 -
*杭电1014——Uniform Generator(数学题)
Problem Description Computer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formseed(x+1) = [seed(x) + STEP] % MODwhere ‘%’ is the modulus原创 2015-10-25 10:46:02 · 350 阅读 · 0 评论 -
*杭电1005——Number Sequence(数学题)
Problem Description A number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.Given A, B, and n, you are to calculate the value of f(n).Input The input co原创 2015-10-22 17:12:59 · 335 阅读 · 0 评论 -
杭电1180——诡异的楼梯(BFS+优先队列)
原题链接:http://acm.hdu.edu.cn/showproblem.php?pid=1180主要算法:遇到楼梯时,如果楼梯方向和前进方向一致且通过楼梯的下一格能走,则前进且时间加一。如果楼梯方向和前进方向不一致,则在原地等一分钟。 至于楼梯方向的判断,无需每时每刻都改变一下楼梯的方向,只需根据当前时间,如果时间为偶数,则楼梯方向与初始方向一样,如果时间为奇数,则楼梯方向和初始方向相反。ps原创 2016-02-28 12:05:38 · 2058 阅读 · 0 评论