03 2020 档案

挑战程序设计竞赛3.3例题：Crane POJ - 2991
摘要：ACM has bought a new crane (crane -- jeřáb) . The crane consists of n segments of various lengths, connected by flexible joints. The end of the i-th s 阅读全文
posted @ 2020-03-26 16:21 funforever 阅读(213) 评论(0) 推荐(0) 编辑
挑战程序设计竞赛3.2例题：Physics Experiment POJ - 3684
摘要：Simon is doing a physics experiment with N identical balls with the same radius of R centimeters. Before the experiment, all N balls are fastened with 阅读全文
posted @ 2020-03-18 19:15 funforever 阅读(123) 评论(0) 推荐(0) 编辑
SQL之双重not exists
摘要：答案： select sname from s where not exists (select * from c where teacher = '程军' and not exists (select * from sc where c.cno = sc.cno and sc.sno = s 阅读全文
posted @ 2020-03-09 22:01 funforever 阅读(1027) 评论(0) 推荐(0) 编辑
挑战程序设计竞赛3.1习题：Drying POJ - 3104
摘要：It is very hard to wash and especially to dry clothes in winter. But Jane is a very smart girl. She is not afraid of this boring process. Jane has dec 阅读全文
posted @ 2020-03-09 15:39 funforever 阅读(153) 评论(0) 推荐(0) 编辑
蓝桥杯2013年部分省赛题解
摘要：买不到的数目 Description 小明开了一家糖果店。他别出心裁：把水果糖包成4颗一包和7颗一包的两种。糖果不能拆包卖。 小朋友来买糖的时候，他就用这两种包装来组合。当然有些糖果数目是无法组合出来的，比如要买 10 颗糖。 你可以用计算机测试一下，在这种包装情况下，最大不能买到的数量是17。大于 阅读全文
posted @ 2020-03-06 17:02 funforever 阅读(280) 评论(0) 推荐(0) 编辑
挑战程序设计竞赛3.2习题：Bound Found POJ - 2566
摘要：Signals of most probably extra-terrestrial origin have been received and digitalized by The Aeronautic and Space Administration (that must be going th 阅读全文
posted @ 2020-03-03 09:52 funforever 阅读(210) 评论(0) 推荐(0) 编辑