ACM_未分类
文章平均质量分 79
Mr_Lsz
该博客停更,不再维护。
展开
-
计算木桩围成的长度
样例:#include#include#includeusing namespace std;struct zb{ int a,b;}t[100001];bool cmp1(zb p1,zb p2){ if(p1.a != p2.a) return p1.a < p2.a; else return p1.b < p2.b;}bool cmp2(zb p原创 2014-11-08 17:31:04 · 655 阅读 · 0 评论 -
HDU 1070 Milk
Problem DescriptionIgnatius drinks milk everyday, now he is in the supermarket and he wants to choose a bottle of milk. There are many kinds of milk in the supermarket, so Ignatius wants to know w原创 2015-03-21 21:01:29 · 471 阅读 · 0 评论 -
HDU 1098 Ignatius's puzzle
Problem DescriptionIgnatius is poor at math,he falls across a puzzle problem,so he has no choice but to appeal to Eddy. this problem describes that ,input a nonegative integer k(kno exists that原创 2015-03-21 22:53:23 · 599 阅读 · 0 评论 -
HDU 1157 Who's in the Middle
Problem DescriptionFJ is surveying his herd to find the most average cow. He wants to know how much milk this 'median' cow gives: half of the cows give as much or more than the median; half give a原创 2015-03-21 23:01:59 · 486 阅读 · 0 评论 -
HDU 1032 The 3n + 1 problem
Problem DescriptionProblems 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 property原创 2015-03-10 17:30:07 · 444 阅读 · 0 评论 -
HDU 1040 As Easy As A+B
As Easy As A+BTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 42450 Accepted Submission(s): 18162Problem DescriptionThese day原创 2015-03-12 21:30:38 · 602 阅读 · 0 评论 -
HDU 1037 Keep on Truckin'
Problem DescriptionBoudreaux 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 ch原创 2015-03-12 21:28:39 · 705 阅读 · 0 评论 -
HDU 1048 The Hardest Problem Ever
Problem DescriptionJulius 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 of原创 2015-03-12 21:33:19 · 442 阅读 · 0 评论 -
HDU 1056 HangOver
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10280 Accepted Submission(s): 4359Problem DescriptionHow far can you make a sta原创 2015-03-12 21:40:02 · 502 阅读 · 0 评论 -
翻煎饼 swustoj 254
题目描述:麦兜最喜欢的食物是煎饼,每次在街上看到煎饼摊的时候都会在那里停留几分钟。最吸引麦兜还是煎饼师傅那一手熟练的翻煎饼的技术,一堆煎饼在那里,师傅只需要用铲子翻几下,就让煎饼整齐的叠在了一起。 这天,为了庆祝麦兜被保送上研究生,他从煎饼师傅那里买回来一些煎饼请客。但是麦兜买回的煎饼大小不一,麦兜太想吃煎饼了,他想吃这些煎饼中最大的那个。麦兜还知道同学们也很喜欢煎饼,为了表示他的诚意,他想让原创 2016-03-30 23:47:46 · 4015 阅读 · 0 评论 -
2016年第七届蓝桥杯省赛(C/C++ A组)
版权声明:本文为博主原创文章,未经博主允许不得转载。目录(?)[-]父亲和儿子 枚举生日蜡烛 枚举填格子 DFS快速排序去掉尾1四则运算 DFS剪邮票 DFS四方定理 枚举回文串 区间DP最小回文代价区间DP最小回文代价 经典例题最大公比此处有目录↑基本都是暴力搜索解决,最后两道算法题不会 - -1.父亲和儿子转载 2016-03-20 23:57:08 · 2563 阅读 · 0 评论 -
第七届蓝桥杯C/C++ B组省赛题解
第一题:煤球数目有一堆煤球,堆成三角棱锥形。具体:第一层放1个,第二层3个(排列成三角形),第三层6个(排列成三角形),第四层10个(排列成三角形),....如果一共有100层,共有多少个煤球?请填表示煤球总数目的数字。注意:你提交的应该是一个整数,不要填写任何多余的内容或说明性文字。这道题坑死了,第一次看转载 2016-03-20 22:24:50 · 3123 阅读 · 2 评论 -
约瑟夫问题实现的方法总结
题目:n个人围成一个圈,每个人分别标注为1、2、...、n,要求从1号从1开始报数,报到k的人出圈,接着下一个人又从1开始报数,如此循环,直到只剩最后一个人时,该人即为胜利者。例如当n=10,k=4时,依次出列的人分别为4、8、2、7、3、10,9、1、6、5,则5号位置的人为胜利者。给定n个人,请你编程计算出最后胜利者标号数。(要求用单循环链表完成。)第一行为人数n; 第二行为报原创 2016-04-11 20:47:19 · 22570 阅读 · 3 评论 -
最近点对问题 Swust Oj 794
Swust oj 794问题描述:设p1=(x1, y1), p2=(x2, y2), …, pn=(xn, yn)是平面上n个点构成的集合S,设计算法找出集合S中距离最近的点对。多组测试数据,第一行为测试数据组数n(0每组测试数据输出一行,为该组数据最近点的距离,保留4为小数。#include#include#include原创 2016-04-12 22:52:05 · 2735 阅读 · 0 评论 -
HDU 1097 A hard puzzle
Problem Descriptionlcy gives a hard puzzle to feng5166,lwg,JGShining and Ignatius: gave a and b,how to know the a^b.everybody objects to this BT problem,so lcy makes the problem easier than begin.原创 2015-03-21 20:12:10 · 599 阅读 · 0 评论 -
HDU 1096 A+B for Input-Output Practice (VIII)
Problem DescriptionYour task is to calculate the sum of some integers. InputInput contains an integer N in the first line, and then N lines follow. Each line starts with a integer原创 2015-03-21 20:09:18 · 456 阅读 · 0 评论 -
输出指定位置的数字
样例:原创 2014-11-08 19:39:10 · 1216 阅读 · 0 评论 -
选猴王
DescriptionBackground There are a lot of monkeys in a mountain. Every one wants to be the monkey king. They keep arguing with each other about that for many years. It is your task to help them s原创 2014-11-08 17:05:23 · 1187 阅读 · 0 评论 -
ACM比赛排名与罚时计算问题
样例:原创 2014-11-09 00:00:55 · 10132 阅读 · 0 评论 -
成绩的几种种输出形式
样例:#include#include#includeusing namespace std;struct st // 结构体声明{ char x[15]; //学号定义为字符型 char y[15]; // 名字 int z; //分数};bool cmp1(st p1,st p2)原创 2014-11-08 19:15:12 · 1042 阅读 · 0 评论 -
HDU1016 Prime Ring Problem
Prime Ring ProblemTime Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 28668 Accepted Submission(s): 12753Problem DescriptionA rin原创 2014-12-22 21:51:57 · 799 阅读 · 0 评论 -
HDU 1010 View Code
Tempter of the BoneTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 75484 Accepted Submission(s): 20633Problem DescriptionThe原创 2014-12-22 22:13:41 · 608 阅读 · 0 评论 -
HDU 1003 Max Sum
Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5原创 2014-12-26 16:52:16 · 851 阅读 · 0 评论 -
HDU 1012 u Calculate e
Problem DescriptionA simple mathematical formula for e iswhere n is allowed to go to infinity. This can actually yield very accurate approximations of e using relatively small values of n.原创 2015-03-09 22:46:51 · 441 阅读 · 0 评论 -
HDU1008 Elevator
Problem DescriptionThe 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 or原创 2015-03-09 22:41:15 · 894 阅读 · 0 评论 -
HDU1005 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).原创 2015-03-09 22:33:08 · 516 阅读 · 0 评论 -
HDU 1013 Digital Roots
Problem DescriptionThe 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 result原创 2015-03-10 16:02:41 · 420 阅读 · 0 评论 -
HDU 1019 Least Common Multiple
Problem DescriptionThe 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原创 2015-03-10 16:50:03 · 423 阅读 · 0 评论 -
HDU 1021 Fibonacci Again
Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2). InputInput consists of a sequence of lines, each containing an i原创 2015-03-10 16:59:28 · 540 阅读 · 0 评论 -
HDU 1017 A Mathematical Curiosity
Problem DescriptionGiven two integers n and m, count the number of pairs of integers (a,b) such that 0 This problem contains multiple test cases!The first line of a multiple input is an in原创 2015-03-10 16:36:06 · 698 阅读 · 0 评论 -
HDU 1028 Ignatius and the Princess III
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 a原创 2015-03-10 17:08:36 · 511 阅读 · 0 评论 -
HDU 1029 Ignatius and the Princess IV
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 a原创 2015-03-10 17:14:35 · 473 阅读 · 0 评论