恒邪

上一页 1 2 3 4 5 6 7 8 ··· 13 下一页

2014年4月21日 #

[2011山东ACM省赛] Identifiers(模拟)

摘要: IdentifiersTime Limit: 1000ms Memory limit: 65536K有疑问?点这里^_^题目描述Identifier is an important concept in the C programming language. Identifiers provide names for several language elements, such as functions, variables, labels, etc.An identifier is a sequence of characters. A valid identifier can conta 阅读全文

posted @ 2014-04-21 21:25 恒邪 阅读(127) 评论(0) 推荐(0) 编辑

[ACM] hrbustoj 1400 汽车比赛 (树状数组)

摘要: 汽车比赛Time Limit: 1000 MSMemory Limit: 65536 KTotal Submit: 188(56 users)Total Accepted: 72(50 users)Rating:Special Judge:NoDescriptionXianGe非常喜欢赛车比赛尤其是像达喀尔拉力赛,这种的比赛规模很大,涉及到很多国家的车队的许多车手参赛。XianGe也梦想着自己能举办一个这样大规模的比赛,XianGe幻想着有许多人参赛,那是人山人海啊,不过XianGe只允许最多100000人参加比赛。这么大规模的比赛应该有技术统计,在XianGe的比赛中所有车辆的起始点可能不同 阅读全文

posted @ 2014-04-21 20:35 恒邪 阅读(205) 评论(0) 推荐(0) 编辑

2014年4月20日 #

[2011山东ACM省赛] Binomial Coeffcients(求组合数)

摘要: Binomial CoeffcientsTime Limit: 1000ms Memory limit: 65536K有疑问?点这里^_^题目描述输入输出示例输入31 110 2954 723示例输出1453557658提示来源山东省第二届ACM大学生程序设计竞赛解题思路:这道题坑死我了。。本来很简单的一道题,却怎么也做不对。。就是求组合数,结果对10000003取模。一开始对c(m,n)是用公式直接求的,但是计算过程中涉及到取余,不能用以下代码写:int c(int m,int n){ int sum=1; for(int i=1;i#include using namespac... 阅读全文

posted @ 2014-04-20 17:57 恒邪 阅读(211) 评论(0) 推荐(0) 编辑

[2011山东ACM省赛] Mathman Bank(模拟题)

摘要: Mathman BankTime Limit: 1000ms Memory limit: 65536K有疑问?点这里^_^题目描述With the development of mathmen's mathematics knowlege, they have finallyinvented computers. Therefore, they want to use computers to manage theirbanks. However, mathmen's programming skills are not as good as theirmath- ematic 阅读全文

posted @ 2014-04-20 17:30 恒邪 阅读(169) 评论(0) 推荐(0) 编辑

2014年4月19日 #

[ACM] hdu 2352 Stars (树状数组)

摘要: StarsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 30272Accepted: 13206DescriptionAstronomers often examine star maps where stars are represented by points on a plane and each star has Cartesian coordinates. Let the level of a star be an amount of the stars that are not higher and not to 阅读全文

posted @ 2014-04-19 20:53 恒邪 阅读(161) 评论(0) 推荐(0) 编辑

[ACM] hdu 1166 敌兵布阵(树状数组)

摘要: 敌兵布阵Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 36928Accepted Submission(s): 15589Problem DescriptionC国的死对头A国这段时间正在进行军事演习,所以C国间谍头子Derek和他手下Tidy又开始忙乎了。A国在海岸线沿直线布置了N个工兵营地,Derek和Tidy的任务就是要监视这些工兵营地的活动情况。由于采取了某种先进的监测手段,所以每个工兵营地的人数C国都掌握的一清二楚,每个工兵营地的人 阅读全文

posted @ 2014-04-19 19:02 恒邪 阅读(108) 评论(0) 推荐(0) 编辑

2014年4月17日 #

[ACM] poj 3468 A Simple Problem with Integers(线段树,成段更新,懒惰标记)

摘要: A Simple Problem with IntegersTime Limit: 5000MSMemory Limit: 131072KTotal Submissions: 55273Accepted: 16628Case Time Limit: 2000MSDescriptionYou have N integers, A1, A2, ... ,AN. You need to deal with two kinds of operations. One type of operation is to add some given number to each number in a giv 阅读全文

posted @ 2014-04-17 21:39 恒邪 阅读(108) 评论(0) 推荐(0) 编辑

[ACM] hdu 2795 Billboard (线段树)

摘要: BillboardTime Limit: 20000/8000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8962Accepted Submission(s): 3997Problem DescriptionAt the entrance to the university, there is a huge rectangular billboard of size h*w (h is its height and w is its width). The board is the 阅读全文

posted @ 2014-04-17 20:40 恒邪 阅读(155) 评论(0) 推荐(0) 编辑

[ACM] hdu 1698 Just a Hook (线段树,成段更新,懒惰标记)

摘要: Just a HookTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14942Accepted Submission(s): 7409Problem DescriptionIn the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecu 阅读全文

posted @ 2014-04-17 12:59 恒邪 阅读(152) 评论(0) 推荐(0) 编辑

ACM hdu 1028 Ignatius and the Princess III

摘要: Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11692Accepted Submiss... 阅读全文

posted @ 2014-04-17 11:19 恒邪 阅读(146) 评论(0) 推荐(0) 编辑

上一页 1 2 3 4 5 6 7 8 ··· 13 下一页

导航