TensorFlow 2 文档 TensorFlow 2 教程 Python 简明教程 Go 语言简明教程 Go 面试题 Go 高性能编程

随笔分类 -  ACM Training

在信息竞赛过程中记录的一些代码与思路
摘要:104. Little shop of flowers time limit per test: 0.25 sec. memory limit per test: 4096 KB 问题: 你想要将你的花窗安排得最具美感。有F束花,每一束花都不一样,至少有F个按顺序排成一行的花瓶。花瓶从左到右,依次编 阅读全文
posted @ 2015-03-21 21:31 呆尐兔兔 阅读(624) 评论(0) 推荐(1)
摘要:Array Diversity Time Limit:404MS Memory Limit:0KB 64bit IO Format:%lld & %llu Description Here we go! Let's define the diversity of a list of numbers 阅读全文
posted @ 2015-03-06 00:00 呆尐兔兔 阅读(436) 评论(0) 推荐(1)
摘要:Goblin Wars Time Limit:432MS Memory Limit:0KB 64bit IO Format:%lld & %llu Description The wizards and witches of Hogwarts School of Witchcraft found P 阅读全文
posted @ 2015-03-05 20:55 呆尐兔兔 阅读(382) 评论(0) 推荐(1)
摘要:Save the Students Time Limit:134MS Memory Limit:0KB 64bit IO Format:%lld & %llu Description Hogwarts is under attack by the Dark Lord, He-Who-Must-Not 阅读全文
posted @ 2015-03-05 20:50 呆尐兔兔 阅读(351) 评论(0) 推荐(1)
摘要:Magic Grid Time Limit:336MS Memory Limit:0KB 64bit IO Format:%lld & %llu Description Thanks a lot for helping Harry Potter in finding the Sorcerer's S 阅读全文
posted @ 2015-03-05 20:49 呆尐兔兔 阅读(762) 评论(0) 推荐(1)
摘要:233 Matrix Time Limit:5000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Description In our daily life we often use 233 to express our feelings 阅读全文
posted @ 2015-03-04 00:40 呆尐兔兔 阅读(640) 评论(0) 推荐(1)
摘要:Number Sequence Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Problem Description There is a special number sequence which has 阅读全文
posted @ 2015-03-03 22:26 呆尐兔兔 阅读(479) 评论(0) 推荐(1)
摘要:Dice Time Limit:1000MS Memory Limit:65536KB Description There are 2 special dices on the table. On each face of the dice, a distinct number was writte 阅读全文
posted @ 2015-03-03 21:01 呆尐兔兔 阅读(326) 评论(0) 推荐(1)
摘要:Game Time Limit:1000MS Memory Limit:65536KB Description Here is a game for two players. The rule of the game is described below: ● In the beginning of 阅读全文
posted @ 2015-03-03 18:39 呆尐兔兔 阅读(445) 评论(0) 推荐(1)
摘要:Post Robot Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K Problem Description DT is a big fan of digital products. He writes posts 阅读全文
posted @ 2015-03-03 18:22 呆尐兔兔 阅读(312) 评论(0) 推荐(1)
摘要:Time Limit:3000MS Memory Limit:0KB Description Most crossword puzzle fans are used to anagrams--groups of words with the same letters in different ord 阅读全文
posted @ 2015-02-24 22:44 呆尐兔兔 阅读(334) 评论(0) 推荐(1)
摘要:Time Limit:3000MS Memory Limit:0KB Description Queues and Priority Queues are data structures which are known to most computer scientists. The Team Qu 阅读全文
posted @ 2015-02-24 22:44 呆尐兔兔 阅读(532) 评论(0) 推荐(0)
摘要:use stringstream Time Limit:3000MS Memory Limit:0KB Description Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an eas 阅读全文
posted @ 2015-02-24 22:43 呆尐兔兔 阅读(642) 评论(0) 推荐(1)
摘要:Time Limit:3000MS Memory Limit:0KB Description Background Many areas of Computer Science use simple, abstract domains for both analytical and empirica 阅读全文
posted @ 2015-02-24 22:42 呆尐兔兔 阅读(631) 评论(0) 推荐(0)
摘要:Time Limit:2000MS Memory Limit:65536KB Description Given a string consisting of brackets of two types find its longest substring that is a regular bra 阅读全文
posted @ 2015-02-24 22:38 呆尐兔兔 阅读(390) 评论(0) 推荐(0)
摘要:Time Limit:3000MS Memory Limit:0KB Description Download as PDF Raju and Meena love to play with Marbles. They have got a lot of marbles with numbers w 阅读全文
posted @ 2015-02-24 22:38 呆尐兔兔 阅读(493) 评论(0) 推荐(0)
摘要:Time Limit:2000MS Memory Limit:65536KB Description A data stream is a real-time, continuous, ordered sequence of items. Some examples include sensor d 阅读全文
posted @ 2015-02-24 22:37 呆尐兔兔 阅读(317) 评论(0) 推荐(0)
摘要:Time Limit:1000MS Memory Limit:32768KB Description ​A number sequence is defined as follows:f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) m 阅读全文
posted @ 2015-02-24 13:35 呆尐兔兔 阅读(392) 评论(0) 推荐(0)
摘要:Time Limit:1000MS Memory Limit:32768KB Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, th 阅读全文
posted @ 2015-02-24 10:52 呆尐兔兔 阅读(468) 评论(0) 推荐(0)
摘要:Time Limit:1000MS Memory Limit:32768KB Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. 阅读全文
posted @ 2015-02-24 01:56 呆尐兔兔 阅读(364) 评论(0) 推荐(0)