05 2012 档案

百度之星资格赛代码全集:
摘要:各种水题啊。。。。A:#include<stdio.h>int main(){ int a,b; while(scanf("%d%d",&a,&b)!=EOF) { printf("%d\n",a+b); } return 0;} B:#include<stdio.h>int main(){ int T; int n; int ans; int t; scanf("%d",&T); while(T--) { ans=0; scanf("%d",&n); ... 阅读全文

posted @ 2012-05-30 00:36 kuangbin 阅读(2689) 评论(5) 推荐(0)

百度之星资格赛 I:地图的省钱计划
摘要:I:地图的省钱计划查看提交统计提问时间限制:1000ms内存限制:65536kB描述百度地图有自己的一套坐标系(你可以把它看作一个笛卡尔坐标系),在这套坐标系里,一个标准单位为1km。而在这坐标系上针对地理信息进行标注的数据,大多数时候是通过购买的方式完成的。为了节约数据更新的成本,数据组里的鑫哥想出了一个好主意——自己测数据。鑫哥按照他的预想开始实验;在每组试验中,鑫哥选取了三个已经被准确标注在百度地图的坐标系里的移动运营商的基站作为信号接收点(这里可以准确的得到信号的接收时间信息)。当信号接收点附近的用户手机签到时,三个信号接收点就会先后接收到这个信号,并可以准确的知晓接收到信号的时间(将 阅读全文

posted @ 2012-05-29 23:44 kuangbin 阅读(1334) 评论(2) 推荐(0)

HDU 1155 Bungee Jumping(简单的物理题)
摘要:Bungee JumpingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 419Accepted Submission(s): 189Problem DescriptionOnce again, James Bond is fleeing from some evil people who want to see him dead. Fortunately, he has left a bungee rope on a nearby high 阅读全文

posted @ 2012-05-27 09:33 kuangbin 阅读(765) 评论(0) 推荐(0)

HDU 1030 Delta-wave (找规律)
摘要:Delta-waveTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3200Accepted Submission(s): 1204Problem DescriptionA triangle field is numbered with successive integers in the way shown on the picture below. The traveller needs to go from the cell with n 阅读全文

posted @ 2012-05-11 00:05 kuangbin 阅读(2203) 评论(0) 推荐(0)

HDU 1059 Dividing(多重背包)
摘要:DividingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7678Accepted Submission(s): 2095Problem DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the ma 阅读全文

posted @ 2012-05-10 01:08 kuangbin 阅读(2824) 评论(0) 推荐(0)

POJ 2769 Reduced ID Numbers
摘要:Reduced ID NumbersTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 7494Accepted: 3029DescriptionT. Chur teaches various groups of students at university U. Every U-student has a unique Student Identification Number (SIN). A SIN s is an integer in the range 0 ≤ s ≤ MaxSIN with MaxSIN = 106-1. 阅读全文

posted @ 2012-05-08 21:49 kuangbin 阅读(999) 评论(0) 推荐(0)

SHUOJ 241 Franklin's Trouble(简单数学题)
摘要:http://acmoj.shu.edu.cn/openjudge/viewproblem?coll_id=1&prob_id=241Franklin's TroubleDescriptionProfessor Franklin is consulting for an oil company, which is planning a large pipeline running east to west through an oil field of M wells. From each well, a sub-pipeline is to be connected dire 阅读全文

posted @ 2012-05-08 19:32 kuangbin 阅读(812) 评论(0) 推荐(0)

导航

JAVASCRIPT: