zqxLonely

2014年11月10日

摘要： 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 probl... 阅读全文

posted @ 2014-11-10 12:59 zqxLonely 阅读(293) 评论(0) 推荐(0)

Easier Done Than Said?

摘要： Problem DescriptionPassword security is a tricky thing. Users prefer simple passwords that are easy to remember (like buddy), but such passwords are o... 阅读全文

posted @ 2014-11-10 11:19 zqxLonely 阅读(270) 评论(0) 推荐(0)

利用map可以对很大的数出现的次数进行记数

摘要： Problem DescriptionIn the year 8888, the Earth is ruled by the PPF Empire . As the population growing , PPF needs to find more land for the newborns .... 阅读全文

posted @ 2014-11-10 00:00 zqxLonely 阅读(269) 评论(0) 推荐(0)

2014年11月9日

A+B Coming

摘要： Problem DescriptionMany classmates said to me that A+B is must needs.If you can’t AC this problem, you would invite me for night meal. ^_^InputInput m... 阅读全文

posted @ 2014-11-09 23:20 zqxLonely 阅读(220) 评论(0) 推荐(0)

ACMer

摘要： Problem DescriptionThere are at least P% and at most Q% students of HDU are ACMers, now I want to know how many students HDU have at least?InputThe in... 阅读全文

posted @ 2014-11-09 23:07 zqxLonely 阅读(352) 评论(0) 推荐(0)

find the nth digit

摘要： Problem Description假设：S1 = 1S2 = 12S3 = 123S4 = 1234.........S9 = 123456789S10 = 1234567891S11 = 12345678912............S18 = 123456789123456789......... 阅读全文

posted @ 2014-11-09 21:39 zqxLonely 阅读(209) 评论(0) 推荐(0)

A C

摘要： Problem DescriptionAre you excited when you see the title "AC" ? If the answer is YES , AC it ;You must learn these two combination formulas in the sc... 阅读全文

posted @ 2014-11-09 21:14 zqxLonely 阅读(262) 评论(0) 推荐(0)

已知六条边的边长，求四面体体积

摘要： Problem Description杭州电子科技大学即将迎来50周年的校庆，作为校庆委员会成员的我被上级要求设计一座神秘的建筑物来迎合校庆，因此我苦思冥想了一个月，终于设计出了一套方案，这座建筑物有点象古老埃及的金字塔，不过这个神秘建筑的根基是三角形的而不是矩形的，从数学的专业角度来讲，它是四面体... 阅读全文

posted @ 2014-11-09 19:30 zqxLonely 阅读(1522) 评论(0) 推荐(0)

快速排序

摘要： Problem Description给你n个整数，请按从大到小的顺序输出其中前m大的数。Input每组测试数据有两行，第一行有两个数n,m(0 2 3 void quickSort(int a[],int left,int right); 4 int array[1000001]; 5 6 i... 阅读全文

posted @ 2014-11-09 18:14 zqxLonely 阅读(274) 评论(0) 推荐(0)

{A} + {B}

摘要： Problem Description给你两个集合，要求{A} + {B}.注:同一个集合中不会有两个相同的元素.Input每组输入数据分为三行,第一行有两个数字n,m(0 2 3 int main(){ 4 int array[20001]; 5 int n; 6 int... 阅读全文

posted @ 2014-11-09 15:10 zqxLonely 阅读(323) 评论(0) 推荐(0)

公告