上一页 1 ··· 21 22 23 24 25 26 27 28 29 ··· 43 下一页
摘要: A1 = ?Time Limit: 5000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3244Accepted Submission(s): 2054Problem Description有如下方程:Ai = (Ai-1 + Ai+1)/2 - Ci (i = 1, 2, 3, .... n).若给出A0, An+1, 和 C1, C2, .....Cn.请编程计算A1 = ?Input输入包括多个测试实例。对于每个实例,首先是一个正整数n,(n <= 3000) 阅读全文
posted @ 2012-09-13 22:42 可笑痴狂 阅读(1964) 评论(0) 推荐(0)
摘要: The areaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5074Accepted Submission(s): 3542Problem DescriptionIgnatius bought a land last week, but he didn't know the area of the land because the land is enclosed by a parabola and a straight line. 阅读全文
posted @ 2012-09-13 21:51 可笑痴狂 阅读(1935) 评论(0) 推荐(0)
摘要: 圆桌会议Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1914Accepted Submission(s): 1319Problem DescriptionHDU ACM集训队的队员在暑假集训时经常要讨论自己在做题中遇到的问题.每当面临自己解决不了的问题时,他们就会围坐在一张圆形的桌子旁进行交流,经过大家的讨论后一般没有解决不了的问题,这也只有HDU ACM集训队特有的圆桌会议,有一天你也可以进来体会一下哦:),在一天在讨论的时候,Eddy想 阅读全文
posted @ 2012-09-13 20:44 可笑痴狂 阅读(1865) 评论(1) 推荐(1)
摘要: 转载请注明出处:優YoU http://blog.csdn.net/lyy289065406/article/details/6642573最近AC题:2528更新时间:2011.09.22 已AC题数:146初级题已在2011.06.30全部完成部分解题报告添加新内容,除了原有的“大致题意”和“解题思路”外,新增“Source修正”,因为原Source较模糊,这是为了帮助某些狂WA的同学找到测试数据库,但是我不希望大家利用测试数据打表刷题PS:部分题目的评论中也有给出了测试数据,未必完全,仅供参考这个POJ分类版本是被我修改过的,现在还在根据我做的题在逐步修改中有部分题目的分类不合理,所以根 阅读全文
posted @ 2012-09-12 12:46 可笑痴狂 阅读(706) 评论(0) 推荐(0)
摘要: 一:基本输入输出: 1 import java.util.Scanner; //导入扫描仪 2 public class Test1{ 3 public static void main(String[] args){ 4 Scanner in=new Scanner(System.in); //声明扫描仪并开辟空间 5 System.out.println("请输入姓名:"); 6 String name=in.next(); //接收字符串 7 System.out.println("请输入年龄:");... 阅读全文
posted @ 2012-09-12 12:32 可笑痴狂 阅读(246) 评论(0) 推荐(0)
摘要: Flip GameTime Limit: 15000/5000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 824Accepted Submission(s): 283Problem DescriptionFlip game is played on a square N*N field with two-sided pieces placed on each of its N^2 squares. One side of each piece is white and the ot 阅读全文
posted @ 2012-09-07 17:48 可笑痴狂 阅读(566) 评论(0) 推荐(0)
摘要: Ignatius and the Princess IIITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7479Accepted Submission(s): 5313Problem Description"Well, it seems the first problem is too easy. I will let you know how foolish you are later." feng5166 says.& 阅读全文
posted @ 2012-09-06 23:05 可笑痴狂 阅读(329) 评论(0) 推荐(0)
摘要: 一卡通大冒险Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 860Accepted Submission(s): 530Problem Description因为长期钻研算法, 无暇顾及个人问题,BUAA ACM/ICPC 训练小组的帅哥们大部分都是单身。某天,他们在机房商量一个绝妙的计划"一卡通大冒险"。这个计划是由wf最先提出来的,计划的内容是,把自己的联系方式写在校园一卡通的背面,然后故意将自己的卡"遗失&q 阅读全文
posted @ 2012-09-06 20:26 可笑痴狂 阅读(967) 评论(0) 推荐(0)
摘要: FatMouse and CheeseTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2829Accepted Submission(s): 1098Problem DescriptionFatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is label 阅读全文
posted @ 2012-08-31 21:37 可笑痴狂 阅读(1154) 评论(0) 推荐(0)
摘要: 各种位运算位运算的操作数必须是整数,当二元位运算的操作数是不同类型的整数时,也会自动进行类型转换。n&(n-1)作用:将n的二进制表示中的最低位为1的改为0,先看一个简单的例子: n = 10100(二进制),则(n-1) = 10011 ==》n&(n-1) = 10000 可以看到原本最低位为1的那位变为0。 弄明白了n&(n-1)的作用,那它有哪些应用? 1. 求某一个数的二进制表示中1的个数 while (n >0 ) { count ++; n &= (n-1); }2. 判断一个数是否是2的方幂 n > 0 && ((n 阅读全文
posted @ 2012-08-31 14:04 可笑痴狂 阅读(5030) 评论(1) 推荐(0)
上一页 1 ··· 21 22 23 24 25 26 27 28 29 ··· 43 下一页