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

摘要: 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 呆尐兔兔 阅读(327) 评论(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 呆尐兔兔 阅读(517) 评论(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 呆尐兔兔 阅读(636) 评论(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 呆尐兔兔 阅读(606) 评论(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 呆尐兔兔 阅读(488) 评论(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 呆尐兔兔 阅读(379) 评论(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 呆尐兔兔 阅读(305) 评论(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 呆尐兔兔 阅读(384) 评论(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 呆尐兔兔 阅读(463) 评论(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 呆尐兔兔 阅读(361) 评论(0) 推荐(0) 编辑
摘要: Time Limit:1000MS Memory Limit:32768KB Description I have a very simple problem for you. Given two integers A and B, your job is to calculate the Sum 阅读全文
posted @ 2015-02-24 00:29 呆尐兔兔 阅读(295) 评论(0) 推荐(0) 编辑