ACMSTEPS
sdau20163940
努力学习,天天向上!
展开
-
Turn the corner(三分)
Problem DescriptionMr. West bought a new car! So he is travelling around the city.One day he comes to a vertical corner. The street he is currently in has a width x, the street he wants to tur转载 2017-06-15 18:02:37 · 334 阅读 · 0 评论 -
Fling(深搜)
首先,先简单介绍一下这款游戏!游戏中,会有几颗毛球随意摆放在方格中,玩家必须找出正确的滚球顺序,然后将毛球们一一相互撞击出方格外,留下最后一颗毛球才算成功过关。在同一行或同一列的毛球才能彼此撞击,但紧靠在一起的两颗毛球是无法移动的哦!两者中间一定要留下至少一个空格才行,如果撞击的顺序不对,最后剩下的毛球都不在同一行列上或是相连的话,就无法继续下个关卡。原创 2017-06-23 17:32:43 · 362 阅读 · 0 评论 -
Children’s Queue大数加法及规律
先写出前面几个来,可以发现规律f[i]=f[i-1]+f[i-2]+f[i-4];注意当1000的时候会爆long long所以要用大数!!!代码:原创 2017-06-07 23:59:24 · 365 阅读 · 0 评论 -
骨牌铺方格
Problem Description在2×n的一个长方形方格中,用一个1× 2的骨牌铺满方格,输入n ,输出铺放方案的总数.例如n=3时,为2× 3方格,骨牌的铺放方案有三种,如下图: Input输入数据由多行组成,每行包含一个整数n,表示该测试实例的长方形方格的规格是2×n (0 Output 对于每原创 2017-06-03 13:19:34 · 267 阅读 · 0 评论 -
母牛的故事(递归)
Problem Description有一头母牛,它每年年初生一头小母牛。每头小母牛从第四个年头开始,每年年初也生一头小母牛。请编程实现在第n年的时候,共有多少头母牛? Input输入数据由多个测试实例组成,每个测试实例占一行,包括一个整数n(0n=0表示输入数据的结束,不做处理。 Output对于每个测试实例,输出在第n年的时候母牛原创 2017-06-03 12:33:34 · 1414 阅读 · 1 评论 -
一只小蜜蜂...
Problem Description有一只经过训练的蜜蜂只能爬向右侧相邻的蜂房,不能反向爬行。请编程计算蜜蜂从蜂房a爬到蜂房b的可能路线数。其中,蜂房的结构如下所示。 Input输入数据的第一行是一个整数N,表示测试实例的个数,然后是N 行数据,每行包含两个整数a和b(0 Output原创 2017-06-03 00:07:51 · 294 阅读 · 0 评论 -
Joseph
Problem DescriptionThe Joseph\\\\\\\'s problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., n, standing in circle ever原创 2017-06-02 23:45:39 · 354 阅读 · 0 评论 -
Number Sequence
Problem DescriptionA 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).原创 2017-06-02 18:31:37 · 1526 阅读 · 0 评论 -
Tiling_easy version
Problem Description有一个大小是 2 x n 的网格,现在需要用2种规格的骨牌铺满,骨牌规格分别是 2 x 1 和 2 x 2,请计算一共有多少种铺设的方法。 Input输入的第一行包含一个正整数T(T Output输出一共有多少种铺设的方法,每组数据的输出占一行。 Sample Input32812原创 2017-06-06 23:22:59 · 206 阅读 · 0 评论 -
A Bug's Life(并查集)
Problem DescriptionBackground Professor Hopper is researching the sexual behavior of a rare species of bugs. He assumes that they feature two different genders and that they only interact with b原创 2017-06-18 18:54:00 · 595 阅读 · 1 评论 -
Count the Trees
Problem DescriptionAnother common social inability is known as ACM (Abnormally Compulsive Meditation). This psychological disorder is somewhat common among programmers. It can be described as the原创 2017-06-18 16:52:54 · 322 阅读 · 0 评论 -
Dome of Circus(三分)
Problem DescriptionA travelling circus faces a tough challenge in designing the dome for its performances. The circus has a number of shows that happen above the stage in the air under the dome. V转载 2017-06-18 11:38:10 · 330 阅读 · 0 评论 -
小希的迷宫(并查集问题)
Problem Description上次Gardon的迷宫城堡小希玩了很久(见Problem B),现在她也想设计一个迷宫让Gardon来走。但是她设计迷宫的思路不一样,首先她认为所有的通道都应该是双向连通的,就是说如果有一个通道连通了房间A和B,那么既可以通过它从房间A走到房间B,也可以通过它从房间B走到房间A,为了提高难度,小希希望任意两个房间有且仅有一条路径可以相通(除非走了回头路)。原创 2017-06-24 10:55:17 · 380 阅读 · 0 评论 -
饭卡(01背包)
题意:这是一个经典的01背包问题,但此问题处理起来却需要小技巧,对我来说算是比较新颖,需要加一个限制,那就是余额要大于等于5,要注意的是这里只要剩余的钱不低于5元,就可以购买任何一件物品,所以5在这道题中是很特殊的,在使用01背包之前,我们首先要在现在所拥有的余额中保留5元,用这五元去购买最贵的物品(此处默认最贵的比5元贵了),而剩下的钱就是背包的总容量,可以随意使用!代码:#incl原创 2017-06-13 09:10:36 · 203 阅读 · 0 评论 -
find the nth digit
Problem Description假设:S1 = 1S2 = 12S3 = 123S4 = 1234.........S9 = 123456789S10 = 1234567891S11 = 12345678912............S18 = 123456789123456789..................现在我们把所有的串连原创 2017-06-15 11:01:42 · 185 阅读 · 0 评论 -
Can you find it?(二分)
Problem DescriptionGive you three sequences of numbers A, B, C, then we give you a number X. Now you need to calculate if you can find the three numbers Ai, Bj, Ck, which satisfy the formula Ai+Bj原创 2017-06-15 00:34:01 · 383 阅读 · 0 评论 -
Coins
Problem DescriptionWhuacmers use coins.They have coins of value A1,A2,A3...An Silverland dollar. One day Hibix opened purse and found there were some coins. He decided to buy a very nice watch in原创 2017-06-14 17:16:11 · 250 阅读 · 0 评论 -
最大报销额(可转化成01背包)
Problem Description现有一笔经费可以报销一定额度的发票。允许报销的发票类型包括买图书(A类)、文具(B类)、差旅(C类),要求每张发票的总额不得超过1000元,每张发票上,单项物品的价值不得超过600元。现请你编写程序,在给出的一堆发票中找出可以报销的、不超过给定额度的最大报销额。 Input测试输入包含若干测试用例。每个测试用例的原创 2017-06-14 01:13:41 · 159 阅读 · 0 评论 -
I love sneakers!(多重背包)
Problem DescriptionAfter months of hard working, Iserlohn finally wins awesome amount of scholarship. As a great zealot of sneakers, he decides to spend all his money on them in a sneaker store.原创 2017-06-14 00:15:51 · 790 阅读 · 0 评论 -
带权并查集 How Many Answers Are Wrong
了解不是太透彻。多看,多思考!多努力!并查集并查集是一个很高效算法,理解起来也很简单,写起来更简单。①fat[i] = i;②找到一个点的祖先int findfat(int x){ if(fat[x] == x) return x; return findfat(fat[x]);}③二中的方法肯定不好,因为如果数据比较极端,那么并查集就退化成一个链了如果原创 2017-06-25 00:37:32 · 222 阅读 · 0 评论 -
Code Lock(并查集加二分求幂)
Problem DescriptionA lock you use has a code system to be opened instead of a key. The lock contains a sequence of wheels. Each wheel has the 26 letters of the English alphabet 'a' through 'z', in o转载 2017-06-25 00:17:37 · 213 阅读 · 0 评论 -
Rank of Tetris(并查集和拓扑排序)
Problem Description自从Lele开发了Rating系统,他的Tetris事业更是如虎添翼,不久他遍把这个游戏推向了全球。为了更好的符合那些爱好者的喜好,Lele又想了一个新点子:他将制作一个全球Tetris高手排行榜,定时更新,名堂要比福布斯富豪榜还响。关于如何排名,这个不用说都知道是根据Rating从高到低来排,如果两个人具有相同的Rating,那就按这几个人的RP原创 2017-06-24 23:57:54 · 453 阅读 · 0 评论 -
Is It A Tree?(并查集)
Is It A Tree?Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1206 Accepted Submission(s): 378 Problem DescriptionA tr原创 2017-06-24 21:32:49 · 428 阅读 · 0 评论 -
FatMouse's Speed(dp)
此题目为经典的动态规划题目,让你寻找一组最长的随着体重增加而速度减小的,输出它们的编号!代码;#include #include #include #include #include #include #include #include #include #include #include #include #define MAXN 1000#define max原创 2017-06-13 09:31:27 · 236 阅读 · 0 评论 -
悼念512汶川大地震遇难同胞——珍惜现在,感恩生活(多重背包)
Problem Description急!灾区的食物依然短缺!为了挽救灾区同胞的生命,心系灾区同胞的你准备自己采购一些粮食支援灾区,现在假设你一共有资金n元,而市场有m种大米,每种大米都是袋装产品,其价格不等,并且只能整袋购买。请问:你用有限的资金最多能采购多少公斤粮食呢?后记:人生是一个充满了变数的生命过程,天灾、人祸、病痛是我们生命历程中不可预知的威胁。月有阴晴原创 2017-06-13 09:20:18 · 160 阅读 · 0 评论 -
Game of Connections(标准卡特兰数及高精度)
Problem DescriptionThis is a small but ancient game. You are supposed to write down the numbers 1, 2, 3, ... , 2n - 1, 2n consecutively in clockwise order on the ground to form a circle, and then,原创 2017-06-18 11:10:02 · 381 阅读 · 0 评论 -
Buy the Ticket(卡特兰)
Problem DescriptionThe \\\\\\\"Harry Potter and the Goblet of Fire\\\\\\\" will be on show in the next few days. As a crazy fan of Harry Potter, you will go to the cinema and have the first sight,转载 2017-06-18 10:34:47 · 417 阅读 · 0 评论 -
Sequence one(深搜)
Problem DescriptionSearch is important in the acm algorithm. When you want to solve a problem by using the search method, try to cut is very important.Now give you a number sequence, include n (转载 2017-06-18 00:36:39 · 272 阅读 · 0 评论 -
Train Problem II(卡特兰数以及高精度运算)
Problem DescriptionAs we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders that all the trains can原创 2017-05-30 10:33:35 · 1309 阅读 · 1 评论 -
找新朋友(欧拉函数)
Problem Description新年快到了,“猪头帮协会”准备搞一个聚会,已经知道现有会员N人,把会员从1到N编号,其中会长的号码是N号,凡是和会长是老朋友的,那么该会员的号码肯定和N有大于1的公约数,否则都是新朋友,现在会长想知道究竟有几个新朋友?请你编程序帮会长计算出来。 Input第一行是测试数据的组数CN(Case number,1原创 2017-05-28 14:46:42 · 205 阅读 · 0 评论 -
A + B Problem II(大数加法)
Problem DescriptionI have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum of A + B. InputThe first line of the input contains an integer T(1原创 2017-05-28 13:08:24 · 1288 阅读 · 0 评论 -
Wooden Sticks HDU(贪心)
题意:n根木材长l重w,前一根木材大于后一根的话要浪费一分钟准备机器,求最省方案!思路:首先对数据进行自定义排序,按长度 由小到大排序,注意当长度相等时,按宽度从小到大排序!!!然后开一个数组用来记录木头是否处理过,然后定一个flag,一开始置为0,如果仍有未使用的木头,则变为0,用一个while语句,当flag始终为1时,则结束while.大题思路就是先使用一个变量,来记录没原创 2017-05-18 00:02:38 · 175 阅读 · 0 评论 -
Largest prime factor(筛法求素数)
Problem DescriptionEverybody knows any number can be combined by the prime number.Now, your task is telling me what position of the largest prime factor.The position of prime 2 is 1, prime 3 is原创 2017-05-27 23:08:51 · 475 阅读 · 0 评论 -
Cake
只要找到公式即可解决问题,一开始走了很大一个弯路。。。没往公式这方面想,导致毫无思路!!其实就是简单的一个公式即;A+B-gcd(A,B);代码:#include #include #include #include #include #include #include #include #include #include #include #include #原创 2017-05-26 10:07:59 · 243 阅读 · 0 评论 -
the area hdu
题意:给你抛物线顶点,以及它与直线的两个交点,让我们来求直线和抛物线包围的面积的大小!思路:求出各个线的方程!!求出k, h, a, b, cy1 = kx + h; y2 = a*x*x + b * x + c;再求出f (x) = (y1 - y2)的原积函数(x2 ~ x3)area = F(x3) - F(x2).代码:原创 2017-05-25 23:46:48 · 355 阅读 · 0 评论 -
判断素数How many prime numbers
Problem DescriptionGive you a lot of positive integers, just to find out how many prime numbers there are. InputThere are a lot of cases. In each case, there is an integer N representing t原创 2017-05-16 08:21:28 · 335 阅读 · 0 评论 -
考试排名(结构体的运用)
Problem DescriptionC++编程考试使用的实时提交系统,具有即时获得成绩排名的特点。它的功能是怎么实现的呢?我们做好了题目的解答,提交之后,要么“AC”,要么错误,不管怎样错法,总是给你记上一笔,表明你曾经有过一次错误提交,因而当你一旦提交该题“AC”后,就要与你算一算帐了,总共该题错误提交了几回。虽然你在题数上,大步地跃上了一个台阶,但是在耗时上要摊上你共花去的时间。特别原创 2017-05-16 07:35:53 · 1748 阅读 · 1 评论 -
水题hdu Identity Card
Problem DescriptionDo you own an ID card?You must have a identity card number in your family's Household Register. From the ID card you can get specific personal information of everyone. The number原创 2017-05-14 23:58:52 · 512 阅读 · 0 评论 -
百步穿杨
Problem Description时维九月,序属三秋,辽军大举进攻MCA山,战场上两军正交锋.辽军统帅是名噪一时的耶律-James,而MCA方则是派出了传统武将中草药123.双方经过协商,约定在十一月八日正午十分进行射箭对攻战.中草药123早早就开始准备,但是他是武将而不是铁匠,造弓箭的活就交给聪明能干的你了,现在告诉你每种弓箭规格,即箭身的长度,以及每种规格弓箭所需要的数目,要求你把需要原创 2017-05-14 13:19:49 · 559 阅读 · 0 评论 -
Hat's Fibonacci(大数)
Problem DescriptionA Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1.F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n -原创 2017-05-30 11:01:20 · 194 阅读 · 0 评论