摘要：
1 import java.awt.*; 2 import java.awt.event.*; 3 public class calculator//一个类。 4 { 5 public static void main(String args[])//主函数。 6 { 7 MyWindow my=new MyWindow("计算器"); //设置框架标题 8 } 9 } 10 class MyWindow extends Frame implements ActionListener 11 { StringBuffer m=new StringBuffer();//创... 阅读全文
摘要：
Problem DescriptionA friend of you is doing research on the Traveling Knight Problem (TKP) where you are to find the shortest closed tour of knight moves that visits each square of a given set of n squares on a chessboard exactly once. He thinks that the most difficult part of the problem is determi 阅读全文
摘要：
排列2Time Limit : 1000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 15Accepted Submission(s) : 12Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem DescriptionRay又对数字的列产生了兴趣： 现有四张卡片，用这四张卡片能排列出很多不同的4位数，要求按从小到大的顺序输出这些4位数。Input每组数据占一行，代表四张卡片上的数字（0 2 #include 3 in. 阅读全文
摘要：
Oil DepositsTime Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 15Accepted Submission(s) : 14Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposit. 阅读全文
摘要：
Counting SheepTime Limit : 2000/1000ms (Java/Other)Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 14Accepted Submission(s) : 12Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem DescriptionA while ago I had trouble sleeping. I used to lie awake, staring at the ceiling, for hours. 阅读全文
摘要：
SquareTime Limit : 10000/5000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 20Accepted Submission(s) : 12Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem DescriptionGiven a set of sticks of various lengths, is it possible to join them end-to-end to form a square. 阅读全文
摘要：
此题可以做为三维深搜模板题。。胜利大逃亡Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 21776Accepted Submission(s): 8547 Problem DescriptionIgnatius被魔王抓走了,有一天魔王出差去了,这可是Ignatius逃亡的好机会.魔王住在一个城堡里,城堡是一个A*B*C的立方体,可以被表示成A个B*C的矩阵,刚开始Ignatius被关在(0,0,0)的位置,离开城堡的门在(A-1,B-1,C- 阅读全文
摘要：
这道题还解决出，问题是数组装的路径是所有的路径，而不是那个最短路径，但是最短时间算对了，怎么样把数组装成那个最短的路径，是我一直要解决的问题，求大神帮我，or等我再有水平了，重新解决这个问题。。。。。 Ignatius and the Princess ITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 9911Accepted Submission(s): 2960 Special JudgeProblem DescriptionThe Pr 阅读全文