流水依依

HDU 4390 Number Sequence 容斥原理

摘要： Number SequenceTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others) Problem DescriptionGiven a number sequence b1,b2…bn. Please count how many number sequences a1,a2,...,an satisfy the condition that a1*a2*...*an=b1*b2*…*bn (ai>1).InputThe input consists of multiple te 阅读全文

posted @ 2013-10-23 22:42 流水依依阅读(203) 评论(0) 推荐(0)

HDU 4407 Sum 容斥原理

摘要： SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Problem DescriptionXXX is puzzled with the question below: 1, 2, 3, ..., n (1#include #include #include #include #include #include #include #include #include #include #include #define Max(a,b) ((a)>(b)?(a):(b))#def 阅读全文

posted @ 2013-10-23 15:40 流水依依阅读(183) 评论(0) 推荐(0)

HDU 4059 The Boss on Mars 容斥原理

摘要： The Boss on MarsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1528Accepted Submission(s): 452Problem DescriptionOn Mars, there is a huge company called ACM (A huge Company on Mars), and it’s owned by a younger boss.Due to no moons around Mars, th 阅读全文

posted @ 2013-10-23 13:47 流水依依阅读(319) 评论(0) 推荐(0)

UVA12653 Buses

摘要： Problem HBusesFile: buses.[c|cpp|java]Programming competitions usually require infrastructure and organization on the part of thoseresponsible. A problem that frequently must be solved is regarding transportation. While participatingin a recent competition, Ricardinho watched the buses and micro-bus 阅读全文

posted @ 2013-10-22 18:09 流水依依阅读(374) 评论(0) 推荐(0)

UVA 12651 Triangles

摘要： You will be given N points on a circle. You must write a program to determine how many distinctequilateral triangles can be constructed using the given points as vertices.The gure below illustrates an example: (a) shows a set of points, determined by the lengths of thecircular arcs that have adjace. 阅读全文

posted @ 2013-10-21 23:45 流水依依阅读(267) 评论(0) 推荐(0)

UVA 10892 - LCM Cardinality

摘要： Problem F LCM Cardinality Input: Standard InputOutput: Standard OutputTime Limit: 2 SecondsA pair of numbers has a unique LCM but a single number can be the LCM of more than one possible pairs. For example 12 is the LCM of (1, 12), (2, 12), (3,4) etc. For a given positive integer N, the number of di 阅读全文

posted @ 2013-10-21 21:14 流水依依阅读(273) 评论(0) 推荐(0)

HDU 4292 Food

摘要： FoodTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2136Accepted Submission(s): 745Problem Description You, a part-time dining service worker in your college’s dining hall, are now confused with a new problem: serve as many people as possible. Th.. 阅读全文

posted @ 2013-10-20 22:58 流水依依阅读(205) 评论(0) 推荐(0)

HDU 4288 Coder

摘要： CoderTime Limit: 20000/10000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2431Accepted Submission(s): 969Problem Description In mathematics and computer science, an algorithm describes a set of procedures or instructions that define a procedure. The term has become . 阅读全文

posted @ 2013-10-20 21:58 流水依依阅读(199) 评论(0) 推荐(0)

Problem 1274 - 可怜的lpx

摘要： Problem 1274 - 可怜的lpxTime Limit: 1000MS Memory Limit: 65536KB Description可怜的lpx终于在别人的帮助下追上了aqx，可是他那瘦弱的身体想要去强行从aqx那里抢回烟那是不可能的。aqx看着可怜的lpx实在不忍心继续欺负他，便随手扔出来一堆长短不一的木棍，让lpx从中挑出来三根木棍，组成一个三角形，如果这个三角形的周长最大，那么aqx将把烟还给lpx。哎，可怜的lpx。。。Input多组数据，每组数据一个n（5#include #include #include #include #include #include #inc 阅读全文

posted @ 2013-10-18 12:51 流水依依阅读(300) 评论(0) 推荐(0)

题目1008：最短路径问题

摘要：题目1008：最短路径问题时间限制：1 秒内存限制：32 兆特殊判题：否题目描述：给你n个点，m条无向边，每条边都有长度d和花费p，给你起点s终点t，要求输出起点到终点的最短距离及其花费，如果最短距离有多条路线，则输出花费最少的。输入：输入n,m，点的编号是1~n,然后是m行，每行4个数 a,b,d,p，表示a和b之间有一条边，且其长度为d，花费为p。最后一行是两个数 s,t;起点s，终点t。n和m为0时输入结束。(1#include #include #include #include #include #include #include #include #include #include 阅读全文

posted @ 2013-10-17 23:00 流水依依阅读(294) 评论(0) 推荐(0)

公告