Sicily 1172. Queens, Knights and Pawns

Queens, Knights and Pawns Constraints Time Limit: 1 secs, Memory Limit: 64 MB Description You all are familiar with the famous 8-queens problem which...

2019-04-23 14:51:49

阅读数 39

评论数 0

Sicily 1134. 积木分发

积木分发 Constraints Time Limit: 10 secs, Memory Limit: 32 MB Description 歌手The Pancakes到幼儿园跟小朋友玩耍,她到达的时候小朋友们已经争着积木玩了。小朋友都想要更多的积木砌一个自己喜欢的图形,砌完就可以和The Pan...

2019-04-23 14:46:31

阅读数 34

评论数 0

Sicily 1029. Rabbit

Rabbit Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description The rabbits have powerful reproduction ability. One pair of adult rabbits can ...

2019-04-23 14:43:43

阅读数 23

评论数 0

Sicily 1500. Prime Gap

Prime Gap Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description The sequence of n ? 1 consecutive composite numbers (positive integers that...

2019-04-23 14:35:44

阅读数 44

评论数 0

Sicily 1240. Faulty Odometer

Faulty Odometer Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description You are given a car odometer which displays the miles traveled as an...

2019-04-23 14:33:34

阅读数 45

评论数 0

Sicily 1231. The Embarrassed Cryptography

The Embarrassed Cryptography Constraints Time Limit: 2 secs, Memory Limit: 32 MB Description The young and very promising cryptographer Odd Even has ...

2019-04-23 14:31:26

阅读数 24

评论数 0

Sicily 1214 信号分析

信号分析 Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description 半人马座(Centaurus)不仅有着美丽的传说,其中的比邻星还是距离太阳系最近的恒星。C博士是一直热衷于对地外文明的探测,最近他发现了一组来自半人马座的奇怪电...

2019-04-23 14:27:43

阅读数 22

评论数 0

Sicily 1119. Factstone Benchmark

Factstone Benchmark Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Amtel has announced that it will release a 128-bit computer chip ...

2019-04-23 14:23:35

阅读数 23

评论数 0

Sicily 1099 Packing Passengers

Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description PTA, Pack ‘em Tight Airlines is attempting the seemingly impossible—to fly with only ...

2019-04-23 14:21:23

阅读数 24

评论数 0

Sicily 1014. Specialized Four-Dig

1014. Specialized Four-Dig Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Find and list all four-digit numbers in decimal notati...

2019-04-23 14:16:43

阅读数 19

评论数 0

Sicily 1381 a*b

1381 ab Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Give two positive integers a and b, please help us calculate ab. Input The fi...

2019-04-16 10:23:47

阅读数 21

评论数 0

Sicily 1028. Hanoi Tower Sequence

Hanoi Tower Sequence Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Hanoi Tower is a famous game invented by the French mathematicia...

2019-04-16 10:23:19

阅读数 30

评论数 0

Sicily 1148. 过河

过河 Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description 在河上有一座独木桥,一只青蛙想沿着独木桥从河的一侧跳到另一侧。在桥上有一些石子,青蛙很讨厌踩在这些石 子上。由于桥的长度和青蛙一次跳过的距离都是正整数,我们可以把独...

2019-04-06 13:54:27

阅读数 31

评论数 0

Sicily 13062. SubDiagonal Paths

SubDiagonal Paths Constraints Time Limit: 1 secs, Memory Limit: 256 MB Description You are to find all of the paths on the bottom diagonal of a n x n...

2019-04-06 13:49:36

阅读数 88

评论数 0

Sicily 1828. Minimal

Minimal Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description There are two sets S1 and S2 subjecting to: 4 - (1) S1, S2 are both the sub...

2019-04-06 13:47:23

阅读数 82

评论数 0

Sicily 1121 Tri Tiling

Tri Tiling Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description In how many ways can you tile a 3xn rectangle with 2x1 dominoes? 3 - Her...

2019-04-06 13:45:10

阅读数 82

评论数 0

Sicily 1011. Lenny's Lucky Lotto

Constraints Time Limit: 1 secs, Memory Limit: 32 MB Description Lenny likes to play the game of lotto. In the lotto game, he picks a list of N unique...

2019-04-06 13:38:18

阅读数 31

评论数 0

中山大学2018年软件工程专业初级实训

以下为实训代码,只到AgendaService类,因为我的UI还有问题,不过已经通过了我就没有再搞 以下代码亲测在2018年的软件工程初级实训中可以通过Matrix的机器测试,希望造福大家 User类 #include<iostream> #in...

2018-11-29 15:44:52

阅读数 71

评论数 0

POJ 2533 最大上升子序列

题意很简单,给出一串数字,求最长的子序列,该子序列需要满足的要求是:该子序列递增。例:输入1 7 3 5 9 4 8输出 4用a[i]表示输入的字符串这个题首先分解成子问题,子问题是以a[i]结尾的最长子字符串所以用n[i]表示以a[i]结尾的最长公共子串.当a[i]大于a[i-1]时,显然n[i...

2018-05-11 15:26:32

阅读数 42

评论数 0

POJ1163 数字三角形三种解法(递归+动态规划)

7 3 8 8 1 0 2 7 4 4 4 5 2 6 5如上图所示,给出一个三角形,从三角形的顶点,只能走左下方或者右下方,然后把所遍历的数字加起来,求出最大的值比如对于上图来说,答案就是30(7+3+8+7+5)我们从定点开始走,其最大值为定点的值加上从...

2018-05-11 14:57:22

阅读数 127

评论数 0

提示
确定要删除当前文章?
取消 删除
关闭
关闭