杂
文章平均质量分 79
zoey-lyly
这个作者很懒,什么都没留下…
展开
-
简易航班订票系统
描述:点定义两个链表,一个存储航班信息,一个存储客户信息;进行一系列简单的增删查找;代码如下#include#include#include#includeusing namespace std;const int MAXN=250;typedef struct{ string p_id; int sum; int r; int原创 2017-12-23 17:06:27 · 2165 阅读 · 0 评论 -
文章标题 Chinese Girls' Amusement
You must have heard that the Chinese culture is quite different from that of Europe or Russia. So some Chinese habits seem quite unusual or even weird to us.So it is known that there is one popular gam原创 2017-04-18 21:25:45 · 420 阅读 · 0 评论 -
Coprime Sequence
Problem DescriptionDo you know what is called ``Coprime Sequence''? That is a sequence consists of n positive integers, and the GCD (Greatest Common Divisor) of them is equal to 1.``Coprime Se原创 2017-05-09 21:42:28 · 403 阅读 · 0 评论 -
文章标题 HDU-3067 小t的游戏
小t有点神经质,喜欢发明一些稀奇古怪的游戏,比如说左手和右手打架就是他发明的。 这个周末,小t又发明了一个有趣的硬币游戏:小t手里有6枚硬币,他把硬币分成了两堆,一左一右并排堆放,一堆2个,一堆4个。然后他开始从这两个堆中各取出1个硬币,再组成一个新的堆放在最右边。用(2,4)表示初始两堆,于是作下抽象,第一次操作后(2,4)变成了(1,3,2)。小t继续操作,他从这三堆中继续各取出1个硬币,组原创 2017-02-26 14:12:19 · 375 阅读 · 0 评论 -
文章标题 Break Standard Weight
The balance was the first mass measuring instrument invented. In its traditional form, it consists of a pivoted horizontal lever of equal length arms, called the beam, with a weighing pan, also called原创 2017-04-07 17:36:29 · 280 阅读 · 0 评论 -
文章标题 Friends
Alice lives in the country where people like to make friends. The friendship is bidirectional and if any two person have no less than k friends in common, they will become friends in several days. Curr原创 2017-04-07 17:40:50 · 427 阅读 · 0 评论 -
Euclidean Geometry
在某节无聊的课上,SK同学随意画了一个三角形然后用尺子量了一下,发现三边长分别为,然后SK同学拿起圆规分别以三个顶点为圆心画了三个圆,为了使图形看上去更美观,这三个圆两两不相交也互不包含,这里认为圆的半径可以是(称之为“点圆”),现在SK同学想知道怎么画圆才能使三个圆的面积之和最大。Input第一行是一个正整数,表示测试数据的组数,每组测试数据只有一行,包含三个不超原创 2017-04-22 19:55:10 · 599 阅读 · 0 评论 -
Dogs' Candies
Problem DescriptionFar far away, there live a lot of dogs in the forest. Unlike other dogs, those dogs love candies much more than bones.Every candy has two attributes: the sweetness degree p原创 2017-04-27 21:02:23 · 252 阅读 · 0 评论 -
辗转相除求最大公约数,最小公倍数
x*y=最大公约数*最小公倍数;求最大公约数:int gcd(int a,int b){ return (b==0)?a:gcd(b,a%b);}原创 2017-11-02 11:05:21 · 292 阅读 · 0 评论 -
排列组合 "n个球放入m个盒子m"问题
求,盒子都可以分成是否不能区分,和能区分,还能分成是否能有空箱子,所以一共是8种情况,我们现在来一一讨论。1.球同,盒不同,无空箱C(n-1,m-1), n>=m0, n<m使用插板法:n个球中间有n-1个间隙,现在要分成m个盒子,而且不能有空箱子,所以只要在n-1个间隙选出m-1个间隙即可2.球同,盒不同,...转载 2018-04-18 17:48:01 · 498 阅读 · 0 评论