最爱剪刀手 - 博客园

2015年8月2日

摘要： DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular... 阅读全文

posted @ 2015-08-02 18:59 最爱剪刀手阅读(103) 评论(0) 推荐(0) 编辑

HUAS Summer Trainning #3 K

摘要： Description在一个给定形状的棋盘（形状可能是不规则的）上面摆放棋子，棋子没有区别。要求摆放时任意的两个棋子不能放在棋盘中的同一行或者同一列，请编程求解对于给定形状和大小的棋盘，摆放k个棋子的所有可行的摆放方案C。Input输入含有多组测试数据。每组数据的第一行是两个正整数，n k，用一个... 阅读全文

posted @ 2015-08-02 18:50 最爱剪刀手阅读(141) 评论(0) 推荐(0) 编辑

HUAS Summer Trainning #3 E

摘要： Today on a lecture about strings Gerald learned a new definition of string equivalency. Two stringsaandbof equal length are calledequivalentin one of ... 阅读全文

posted @ 2015-08-02 18:42 最爱剪刀手阅读(153) 评论(0) 推荐(0) 编辑

2015年8月1日

HUAS Summer Trainning #3 C

摘要： DescriptionA ring is composed of n (even number) circles as shown in diagram. Put natural numbersinto each circle separately, and the sum of numbers i... 阅读全文

posted @ 2015-08-01 15:44 最爱剪刀手阅读(108) 评论(0) 推荐(0) 编辑

HUAS Summer Trainning #3 B

摘要：题目：Given a sequence of integers S = {S1, S2, . . . , Sn}, you should determine what is the value of themaximum positive product involving consecutive ... 阅读全文

posted @ 2015-08-01 15:08 最爱剪刀手阅读(181) 评论(0) 推荐(0) 编辑

HUAS Summer Trainning #3 A

摘要：题目：DescriptionWrite a program that finds and displays all pairs of 5-digit numbers that between them use the digits0through9once each, such that the f... 阅读全文

posted @ 2015-08-01 14:57 最爱剪刀手阅读(296) 评论(0) 推荐(0) 编辑

2015年7月24日

2015 HUAS Summer Training#2 G

摘要：题目：DescriptionDue to recent rains, water has pooled in various places in Farmer John's field, which is represented by a rectangle of N x M (1 =m||c=n)... 阅读全文

posted @ 2015-07-24 21:19 最爱剪刀手阅读(102) 评论(0) 推荐(0) 编辑

2015 HUAS Summer Training#2 F

摘要：题目：DescriptionA robot has to patrol around a rectangular area which is in a form ofmxngrid (mrows andncolumns). The rows are labeled from 1 tom. The c... 阅读全文

posted @ 2015-07-24 21:14 最爱剪刀手阅读(113) 评论(0) 推荐(0) 编辑

2015 HUAS Summer Training#2 E

摘要：题目：DescriptionA friend of you is doing research on theTraveling Knight Problem (TKP)where you are to find the shortest closed tour of knight moves tha... 阅读全文

posted @ 2015-07-24 21:09 最爱剪刀手阅读(101) 评论(0) 推荐(0) 编辑

2015 HUAS Summer Training#2 D

摘要：题目：DescriptionLittle Valentine liked playing with binary trees very much. Her favorite game was constructing randomly looking binary trees with capita... 阅读全文

posted @ 2015-07-24 21:02 最爱剪刀手阅读(106) 评论(0) 推荐(0) 编辑