cltt - 博客园

ACM Changchun 2015 J. Chip Factory

摘要： John is a manager of a CPU chip factory, the factory produces lots of chips everyday. To manage large amounts of products, every processor has a seria 阅读全文

posted @ 2018-09-11 15:36 cltt 阅读(199) 评论(0) 推荐(0)

一些小程序

摘要： 1 2 3 4 5 6 是不换行的 --> 7 8 1到100以内的完数有： 9 10 "); 21 } 22 } 23 %> 24 25 26 27 28 程序片创建Date对象： "+date+""); int m=100; %> 的因子之和是(不包括) 1... 阅读全文

posted @ 2018-09-10 22:56 cltt 阅读(205) 评论(0) 推荐(0)

ACM-ICPC 2018 徐州赛区网络预赛 H. Ryuji doesn't want to study

摘要： 262144K Ryuji is not a good student, and he doesn't want to study. But there are n books he should learn, each book has its knowledge a[i]a[i]. Unfort 阅读全文

posted @ 2018-09-09 21:00 cltt 阅读(557) 评论(0) 推荐(0)

ACM-ICPC 2018 徐州赛区网络预赛 F. Features Track

摘要： 262144K Morgana is learning computer vision, and he likes cats, too. One day he wants to find the cat movement from a cat video. To do this, he extrac 阅读全文

posted @ 2018-09-09 19:11 cltt 阅读(384) 评论(0) 推荐(0)

ACM-ICPC 2018 徐州赛区网络预赛 I. Characters with Hash

摘要： Mur loves hash algorithm, and he sometimes encrypt another one's name, and call him with that encrypted value. For instance, he calls Kimura KMR, and 阅读全文

posted @ 2018-09-09 18:38 cltt 阅读(316) 评论(0) 推荐(0)

hdu 5437

摘要： Alisha’s Party Time Limit: 3000/2000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 7514 Accepted Submission(s): 174 阅读全文

posted @ 2018-09-09 11:08 cltt 阅读(147) 评论(0) 推荐(0)

poj 1502

摘要： MPI Maelstrom Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 12087 Accepted: 7464 Description BIT has recently taken delivery of their new 阅读全文

posted @ 2018-09-08 20:36 cltt 阅读(136) 评论(0) 推荐(0)

ACM-ICPC 2018 沈阳赛区网络预赛 K. Supreme Number

摘要： A prime number (or a prime) is a natural number greater than 11 that cannot be formed by multiplying two smaller natural numbers. Now lets define a nu 阅读全文

posted @ 2018-09-08 19:29 cltt 阅读(294) 评论(0) 推荐(0)

ACM-ICPC 2018 沈阳赛区网络预赛 F. Fantastic Graph

摘要： "Oh, There is a bipartite graph.""Make it Fantastic." X wants to check whether a bipartite graph is a fantastic graph. He has two fantastic numbers, a 阅读全文

posted @ 2018-09-08 19:05 cltt 阅读(861) 评论(1) 推荐(0)

ACM-ICPC 2018 南京赛区网络预赛 B. The writing on the wall

摘要： Feeling hungry, a cute hamster decides to order some take-away food (like fried chicken for only 3030 Yuan). However, his owner CXY thinks that take-a 阅读全文

posted @ 2018-09-07 23:32 cltt 阅读(240) 评论(0) 推荐(0)