- 博客(14)
- 资源 (188)
- 收藏
- 关注
RSS订阅原创 1010 迷宫问题
Problem DescriptionThe doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He re
2009-12-14 11:25:00
341
原创 1009 贪心
Problem DescriptionFatMouse prepared M pounds of cat food, ready to trade with the cats guarding the warehouse containing his favorite food, JavaBean.The warehouse has N rooms. The i-th room contain
2009-12-13 23:09:00
369
原创 1008
Problem DescriptionThe highest building in our city has only one elevator. A request list is made up with N positive numbers. The numbers denote at which floors the elevator will stop, in specified
2009-12-13 21:38:00
279
原创 ★1007 给定一些点求两点之间的最短距离
Problem DescriptionHave you ever played quoit in a playground? Quoit is a game in which flat rings are pitched at some toys, with all the toys encircled awarded.In the field of Cyberground, the pos
2009-12-13 16:05:00
1256
原创 1004
Problem DescriptionContest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges favorite time is guessing the most popular problem. When the contest i
2009-12-13 15:57:00
290
原创 1003 局部最值问题
Problem DescriptionGiven a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 +
2009-12-13 15:46:00
358
原创 1002
大数相加 #include using namespace std;int main(){ char a[1000],b[1000],c[1000]; int n,Case = 1; cin>>n; while(n--) { cin>>a>>b; int i = strlen(a);
2009-12-13 15:36:00
250
原创 1248
http://acm.hdu.edu.cn/showproblem.php?pid=1248 #includeusing namespace std;int flag[]={150,200,350};bool avi[10001]={false};int main(){ int t,n,i,j,k; for(i=0;i<10001;i+=flag[0])
2009-12-13 12:55:00
349
原创 1050
http://acm.hdu.edu.cn/showproblem.php?pid=1050 //维护一张表P[]，其值最大的数即为所需的时间数#includeint main(){ int i,j,t,N,P[200],k,s,d,temp,min; scanf("%d",&t); for(i=0;i<t;i++) { for(j=0;j<200;j+
2009-12-13 12:42:00
192
原创 语义网格学习报告
网格是一种信息社会的网络基础设施，是利用互联网把分散在不同地理位置上的多个资源，包括计算资源、存储资源、通信资源、软件资源、信息资源、知识资源等全面连通和统一分配、管理及协调起来，通过逻辑关系组成一台“虚拟的超级计算机”。这台机器把每一台参与其中的、包括个人电脑在内的计算机都作为自己的一个“节点”，成千上万个这样的“节点”并联起来，就组成了“一张有超级计算能力的网格”。而每一位将自己的计算机连接到
2009-12-09 23:13:00
473
转载 Linux集群-软件体系结构小探
在本文中，笔者以IBM eServer Cluster 1300为例介绍了Beowulf集群中硬件和网络体系结构和组成部分。1 Beowulf集群软件结构一般来说，Beowulf集群由如下几个软件部分组成： 操作系统：勿容置疑，操作系统是任何计算机系统的软件基础。相对于桌面系统而言，集群系统对操作系统的任务调度和文件管理方面的要求更高。 并行开发库：只要是指用于集群中进程通信的软件
2009-12-09 22:54:00
340
first original essay
As for the bad net environment here inthe lab . I cannot publish on CSDN . ok , i'll write here ,It's my first essay in javaeye.
2009-08-01 10:35:16
123
原创 【转】MyEclipse快捷键
存盘 Ctrl+s(肯定知道) 注释代码 Ctrl+/ 取消注释 Ctrl+\(Eclipse3已经都合并到Ctrl+/了) 代码辅助 Alt+/ 快速修复 Ctrl+1 代码格式化 Ctrl+Shift+f 整理导入 Ctrl+Shift+o 切换窗口 Ctrl+f6 ctrl+shift+M 导入未引用的包 ctrl+w 关闭单个窗口 F3 跳转到类、变...
2009-08-01 10:22:13
68
XML HTML CSS XSL Web编程实作教程.rar
2009-05-18
XML - Programming Web Services With Soap (O'Reilly).pdf
2009-05-18
7 Development Projects with the 2007 Microsoft Office System and Windows SharePoint Services 2007.pdf
2009-05-18
VB一点通.EXE VB一点通.EXE
2009-05-18
Programming.for.the.Absolute.Beginner.pdf
2009-05-15
张孝祥 Java就业培训教程-书内源码及PPT文档.rar
2009-05-15
Java AWT Reference.pdf
2009-05-15
Java 2 GUI Fundamentals with Swing.pdf
2009-05-15
Core Java 2 Volume II-Advanced Features 5th Edition.exe
2009-05-15
Core Java 2 Volume I - Fundamentals, 6th Edition.chm
2009-05-15
Core Java 2 Volume I 7th Edithon.chm
2009-05-15
Absolute Java 1st Edition.rar
2009-05-15
javascript高级教程(html).rar
2009-05-15
Div+CSSToArrangePage.docx
2009-05-15
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人