hdu
Puppet__
努力想变得更好
展开
-
给你N个数求其最小公倍数(hdu 1019 Least Common Multiple)
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原创 2017-11-06 19:51:34 · 663 阅读 · 0 评论 -
HDU 2955 Robberies(0-1背包问题)
Problem Description The aspiring Roy the Robber has seen a lot of American movies, and knows that the bad guys usually gets caught in the end, often because they become too greedy. He has decided to w原创 2018-02-20 14:49:48 · 287 阅读 · 0 评论 -
山东省第五届省赛 F - Full Binary Tree (利用满二叉树性质的一个思维题)
Description In computer science, a binary tree is a tree data structure in which each node has at most two children. Consider an infinite full binary tree (each node has two children except the leaf n原创 2018-01-22 15:00:02 · 472 阅读 · 0 评论 -
并查集(以hdu 1232 畅通工程为例)
在讲并查集之前我们先举一个例子。(这个例子是出自别人之手) 话说江湖上散落着各式各样的大侠,有上千个之多。他们没有什么正当职业,整天背着剑在外面走来走去,碰到和自己不是一路人的,就免不了要打一架。但大侠们有一个优点就是讲义气,绝对不打自己的朋友。而且他们信奉“朋友的朋友就是我的朋友”,只要是能通过朋友关系串联起来的,不管拐了多少个弯,都认为是自己人。这样一来,江湖上就形成了一个一个的群落,通过两两之原创 2017-11-09 13:07:52 · 329 阅读 · 0 评论 -
HDU 1874 Dijkstra (迪杰斯特拉)(队列及邻接矩阵)
AC代码(1):/* 关于三个数组:map数组存的为点边的信息,比如map[1][2]=3,表示1号点和2号点的距离为3 dis数组存的为起始点与每个点的最短距离,比如dis[3]=5,表示起始点与3号点最短距离为5 visit数组存的为0或者1,1表示已经走过这个点。 */ #include <iostream> #include <algorithm> #include <cstdio> #in原创 2017-07-25 17:54:31 · 435 阅读 · 1 评论