2012年8月11日

HDU 1041 Computer Transformation(高精度)

摘要: Computer TransformationTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3845Accepted Submission(s): 1420Problem DescriptionA sequence consisting of one digit, the number 1 is initially written into a computer. At each successive time step, the compu 阅读全文

posted @ 2012-08-11 22:44 kuangbin 阅读(477) 评论(0) 推荐(0) 编辑

高精度模板总结1(string 实现加、减、乘、除)常用版 kuangbin

摘要: 加、减、乘、除高精度 string kuangbin#include<stdio.h>#include<string>#include<string.h>#include<iostream>using namespace std;//compare比较函数:相等返回0,大于返回1,小于返回-1int compare(string str1,string str2){ if(str1.length()>str2.length()) return 1; else if(str1.length()<str2.length()) return 阅读全文

posted @ 2012-08-11 21:52 kuangbin 阅读(4899) 评论(2) 推荐(2) 编辑

HDU 1943 Ball bearings(简单数学问题)

摘要: Ball bearingsTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40Accepted Submission(s): 20Problem DescriptionThe Swedish company SKF makes ball bearings. As explained by Britannica Online, a ball bearing is “one of the two types of rolling, or anti 阅读全文

posted @ 2012-08-11 17:15 kuangbin 阅读(704) 评论(0) 推荐(0) 编辑

HDU 1166 敌兵布阵(线段树,树状数组)

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

posted @ 2012-08-11 16:36 kuangbin 阅读(767) 评论(0) 推荐(0) 编辑

HDU 4027 Can you answer these queries?(线段树)

摘要: Can you answer these queries?Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65768/65768 K (Java/Others)Total Submission(s): 4570Accepted Submission(s): 1087Problem DescriptionA lot of battleships of evil are arranged in a line before the battle. Our commander decides to use our secret weapon to 阅读全文

posted @ 2012-08-11 09:49 kuangbin 阅读(1142) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: