随笔分类 -  数论+计算几何

摘要：R(N)Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1412Accepted Submission(s): 729Problem DescriptionWe know that some positive integer x can be expressed as x=A^2+B^2(A,B are integers). Take x=10 for example, 10=(-3)^2+1^2.We define R(N) (N is po 阅读全文

摘要：A Simple ProblemTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1959Accepted Submission(s): 518Problem DescriptionFor a given positive integer n, please find the smallest positive integer x that we can find an integer y such that y^2 = n +x^2.Input 阅读全文

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

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

摘要：圆桌会议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想 阅读全文

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

摘要：一卡通大冒险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 阅读全文

摘要：神、上帝以及老天爷Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 13589Accepted Submission(s): 5811Problem DescriptionHDU 2006'10 ACM contest的颁奖晚会隆重开始了！为了活跃气氛，组织者举行了一个别开生面、奖品丰厚的抽奖活动，这个活动的具体要求是这样的：首先，所有参加晚会的人员都将一张写有自己名字的字条放入抽奖箱中；然后，待所有字条加入完毕，每人从箱中取一个字条；最 阅读全文

摘要：不可摸数Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5334Accepted Submission(s): 1405Problem Descriptions(n)是正整数n的真因子之和，即小于n且整除n的因子和.例如s(12)=1+2+3+4+6=16.如果任何数m，s(m)都不等于n,则称n为不可摸数.Input包含多组数据，首先输入T,表示有T组数据.每组数据1行给出n(2<=n<=1000)是整数。Output如果n是不可 阅读全文

摘要：阶乘的0时间限制：3000 ms | 内存限制：65535 KB难度：3描述计算n!的十进制表示最后有多少个0输入第一行输入一个整数N表示测试数据的组数(1 5 #include 6 int a[10000000]; 7 int main() 8 { 9 int n,m,i,j,t,num,bit;10 scanf("%d",&n);11 while(n--)12 {13 num=0;14 memset(a,0,sizeof(a));15 scanf("%d",&m);16 a[0]=1;17 ... 阅读全文