12 2017 档案

摘要:E. Test time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output Sometimes it is hard to prepare 阅读全文
posted @ 2017-12-31 23:47 zbtrs 阅读(288) 评论(0) 推荐(0) 编辑
摘要:Constellations Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 6522 Accepted: 1311 Description The starry sky in the summer night is one of 阅读全文
posted @ 2017-12-31 20:45 zbtrs 阅读(200) 评论(0) 推荐(0) 编辑
摘要:C. Weakness and Poorness time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output C. Weakness and 阅读全文
posted @ 2017-12-31 14:40 zbtrs 阅读(298) 评论(0) 推荐(0) 编辑
摘要:Evacuation Plan Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 5103 Accepted: 1329 Special Judge Description The City has a number of muni 阅读全文
posted @ 2017-12-30 19:47 zbtrs 阅读(345) 评论(0) 推荐(0) 编辑
摘要:Kaka's Matrix Travels Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10171 Accepted: 4128 Description On an N × N chessboard with a non-ne 阅读全文
posted @ 2017-12-30 14:34 zbtrs 阅读(183) 评论(0) 推荐(0) 编辑
摘要:The Windy's Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 5733 Accepted: 2369 Description The Windy's is a world famous toy factory that 阅读全文
posted @ 2017-12-30 12:36 zbtrs 阅读(182) 评论(0) 推荐(0) 编辑
摘要:Farm Tour Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 18334 Accepted: 7095 Description When FJ's friends visit him on the farm, he like 阅读全文
posted @ 2017-12-29 23:02 zbtrs 阅读(178) 评论(0) 推荐(0) 编辑
摘要:Firing Time Limit: 5000MS Memory Limit: 131072K Total Submissions: 11132 Accepted: 3372 Description You’ve finally got mad at “the world’s most stupid 阅读全文
posted @ 2017-12-29 00:01 zbtrs 阅读(189) 评论(0) 推荐(0) 编辑
摘要:Dual Core CPU Time Limit: 15000MS Memory Limit: 131072K Total Submissions: 25576 Accepted: 11033 Case Time Limit: 5000MS Description As more and more 阅读全文
posted @ 2017-12-28 21:54 zbtrs 阅读(331) 评论(0) 推荐(0) 编辑
摘要:Dining Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 20081 Accepted: 8925 Description Cows are such finicky eaters. Each cow has a prefer 阅读全文
posted @ 2017-12-28 21:13 zbtrs 阅读(139) 评论(0) 推荐(0) 编辑
摘要:PIGS Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 21917 Accepted: 10034 Description Mirko works on a pig farm that consists of M locked 阅读全文
posted @ 2017-12-28 20:43 zbtrs 阅读(108) 评论(0) 推荐(0) 编辑
摘要:Asteroids Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 24203 Accepted: 13112 Description Bessie wants to navigate her spaceship through 阅读全文
posted @ 2017-12-27 18:16 zbtrs 阅读(127) 评论(0) 推荐(0) 编辑
摘要:Drainage Ditches Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 79977 Accepted: 31112 Description Every time it rains on Farmer John's fie 阅读全文
posted @ 2017-12-27 16:53 zbtrs 阅读(272) 评论(0) 推荐(0) 编辑
摘要:Triangle Time Limit: 3000MS Memory Limit: 30000K Total Submissions: 9992 Accepted: 3001 Description Given n distinct points on a plane, your task is t 阅读全文
posted @ 2017-12-27 15:55 zbtrs 阅读(175) 评论(0) 推荐(0) 编辑
摘要:1185: [HNOI2007]最小矩形覆盖 Description 分析:有一个比较显然的结论:最小的矩形一定有一条边在凸包上.利用旋转卡壳求出对应边的最远点.这两个是比较容易做到的,有点难的是如何求另外两边的最远点. 另外两个点的位置显然是单峰函数,可以利用旋转卡壳的思想.关键就是如何以当前凸包 阅读全文
posted @ 2017-12-27 14:55 zbtrs 阅读(239) 评论(0) 推荐(0) 编辑
摘要:1043: [HAOI2008]下落的圆盘 Description 有n个圆盘从天而降,后面落下的可以盖住前面的。求最后形成的封闭区域的周长。看下面这副图, 所有的红色线条的总长度即为所求. 有n个圆盘从天而降,后面落下的可以盖住前面的。求最后形成的封闭区域的周长。看下面这副图, 所有的红色线条的总 阅读全文
posted @ 2017-12-26 20:50 zbtrs 阅读(199) 评论(0) 推荐(0) 编辑
摘要:Grandpa's Estate Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 14553 Accepted: 4070 Description Being the only living descendant of his g 阅读全文
posted @ 2017-12-26 14:34 zbtrs 阅读(224) 评论(0) 推荐(0) 编辑
摘要:Beauty Contest Time Limit: 3000MS Memory Limit: 65536K Total Submissions: 39574 Accepted: 12275 Description Bessie, Farmer John's prize cow, has just 阅读全文
posted @ 2017-12-25 23:42 zbtrs 阅读(176) 评论(0) 推荐(0) 编辑
摘要:Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 10039 Accepted: 4408 Description Your friend to the south is interested in building fe 阅读全文
posted @ 2017-12-25 22:01 zbtrs 阅读(153) 评论(0) 推荐(0) 编辑
摘要:Pipe Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 11421 Accepted: 3567 Description The GX Light Pipeline Company started to prepare bent 阅读全文
posted @ 2017-12-24 23:49 zbtrs 阅读(181) 评论(0) 推荐(0) 编辑
摘要:Segments Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 15967 Accepted: 5063 Description Given n segments in the two dimensional space, wr 阅读全文
posted @ 2017-12-24 15:58 zbtrs 阅读(165) 评论(0) 推荐(0) 编辑
摘要:TOYS Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 16851 Accepted: 8069 Description Calculate the number of toys that land in each bin of 阅读全文
posted @ 2017-12-24 12:44 zbtrs 阅读(159) 评论(0) 推荐(0) 编辑
摘要:Build Your Home Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 1121 Accepted: 621 Description Mr. Tenant is going to buy a new house. In f 阅读全文
posted @ 2017-12-24 11:58 zbtrs 阅读(174) 评论(0) 推荐(0) 编辑
摘要:Intersecting Lines Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 17149 Accepted: 7373 Description We all know that a pair of distinct poi 阅读全文
posted @ 2017-12-24 11:38 zbtrs 阅读(221) 评论(0) 推荐(0) 编辑
摘要:Statement of the Problem Several drawing applications allow us to draw polygons and almost all of them allow us to fill them with some color. The task 阅读全文
posted @ 2017-12-24 10:21 zbtrs 阅读(203) 评论(0) 推荐(0) 编辑
摘要:You're given a tree on N vertices. Each vertex has a positive integer written on it, number on the ith vertex being vi. Your program must process two 阅读全文
posted @ 2017-12-23 23:50 zbtrs 阅读(341) 评论(0) 推荐(0) 编辑
摘要:F. Heroes of Making Magic III time limit per test 3 seconds memory limit per test 256 megabytes input standard input output standard output F. Heroes 阅读全文
posted @ 2017-12-23 09:38 zbtrs 阅读(319) 评论(0) 推荐(0) 编辑
摘要:2243: [SDOI2011]染色 Description 给定一棵有n个节点的无根树和m个操作,操作有2类: 1、将节点a到节点b路径上所有点都染成颜色c; 2、询问节点a到节点b路径上的颜色段数量(连续相同颜色被认为是同一段), 如“112221”由3段组成:“11”、“222”和“1”。 请 阅读全文
posted @ 2017-12-23 00:01 zbtrs 阅读(232) 评论(0) 推荐(0) 编辑
摘要:Decrypt Messages Time Limit: 8000/4000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 657 Accepted Submission(s): 158 阅读全文
posted @ 2017-12-22 23:56 zbtrs 阅读(275) 评论(0) 推荐(0) 编辑
摘要:1036: [ZJOI2008]树的统计Count Description 一棵树上有n个节点,编号分别为1到n,每个节点都有一个权值w。我们将以下面的形式来要求你对这棵树完成 一些操作: I. CHANGE u t : 把结点u的权值改为t II. QMAX u v: 询问从点u到点v的路径上的节 阅读全文
posted @ 2017-12-22 19:01 zbtrs 阅读(212) 评论(0) 推荐(0) 编辑
摘要:1367: [Baltic2004]sequence Description Input Output 一个整数R Sample Input 7 9 4 8 20 14 15 18 Sample Output 13 HINT 所求的Z序列为6,7,8,13,14,15,18. R=13 分析:左偏树 阅读全文
posted @ 2017-12-22 16:15 zbtrs 阅读(245) 评论(0) 推荐(0) 编辑
摘要:2809: [Apio2012]dispatching Description 在一个忍者的帮派里,一些忍者们被选中派遣给顾客,然后依据自己的工作获取报偿。在这个帮派里,有一名忍者被称之为 Master。除了 Master以外,每名忍者都有且仅有一个上级。为保密,同时增强忍者们的领导力,所有与他们工 阅读全文
posted @ 2017-12-22 13:48 zbtrs 阅读(151) 评论(0) 推荐(0) 编辑
摘要:Primitive Roots Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 4775 Accepted: 2827 Description We say that integer x, 0 < x < p, is a prim 阅读全文
posted @ 2017-12-21 20:48 zbtrs 阅读(234) 评论(0) 推荐(0) 编辑
摘要:Last Digits Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2378 Accepted: 501 Description Exponentiation of one integer by another often p 阅读全文
posted @ 2017-12-20 23:57 zbtrs 阅读(305) 评论(0) 推荐(0) 编辑
摘要:C. Jzzhu and Apples time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Jzzhu has picked n ap 阅读全文
posted @ 2017-12-20 16:21 zbtrs 阅读(361) 评论(0) 推荐(0) 编辑
摘要:C Looooops Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 29262 Accepted: 8441 Description A Compiler Mystery: We are given a C-language s 阅读全文
posted @ 2017-12-20 14:56 zbtrs 阅读(158) 评论(0) 推荐(0) 编辑
摘要:X-factor Chains Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 7733 Accepted: 2447 Description Given a positive integer X, an X-factor cha 阅读全文
posted @ 2017-12-20 13:49 zbtrs 阅读(185) 评论(0) 推荐(0) 编辑
摘要:Prime Distance Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 19952 Accepted: 5357 Description The branch of mathematics called number the 阅读全文
posted @ 2017-12-20 00:04 zbtrs 阅读(156) 评论(0) 推荐(0) 编辑
摘要:E. Palisection time limit per test 2 seconds memory limit per test 128 megabytes input standard input output standard output E. Palisection time limit 阅读全文
posted @ 2017-12-19 21:51 zbtrs 阅读(289) 评论(0) 推荐(0) 编辑
摘要:pdf题面:传送门 题目大意:给定一些单词和一个句子,问有多少个单词在句子中出现过,如果一个但单词包含另一个单词,并且两个单词都出现过,那么只算最外层的单词(包含另一个单词的单词). 分析:这道题如果没有第二个条件的话就和hdu2222是一模一样的题.但是没关系,可以先用hdu2222的方法找出所有 阅读全文
posted @ 2017-12-19 15:00 zbtrs 阅读(409) 评论(0) 推荐(0) 编辑
摘要:2565: 最长双回文串 Description 顺序和逆序读起来完全一样的串叫做回文串。比如acbca是回文串,而abc不是(abc的顺序为“abc”,逆序为“cba”,不相同)。输入长度为n的串S,求S的最长双回文子串T,即可将T分为两部分X,Y,(|X|,|Y|≥1)且X和Y都是回文串。 顺序 阅读全文
posted @ 2017-12-18 21:35 zbtrs 阅读(238) 评论(0) 推荐(0) 编辑
摘要:病毒侵袭持续中 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 16101 Accepted Submission(s): 5463 Proble 阅读全文
posted @ 2017-12-18 15:44 zbtrs 阅读(152) 评论(0) 推荐(0) 编辑
摘要:Palindrome Time Limit: 15000MS Memory Limit: 65536K Total Submissions: 10526 Accepted: 4001 Description Andy the smart computer science student was at 阅读全文
posted @ 2017-12-17 23:45 zbtrs 阅读(158) 评论(0) 推荐(0) 编辑
摘要:Word Puzzles Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 12090 Accepted: 4547 Special Judge Description Word puzzles are usually simple 阅读全文
posted @ 2017-12-17 23:41 zbtrs 阅读(617) 评论(0) 推荐(0) 编辑
摘要:Keywords Search Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 70386 Accepted Submission(s): 2 阅读全文
posted @ 2017-12-17 15:52 zbtrs 阅读(268) 评论(0) 推荐(0) 编辑
摘要:C. Spy Syndrome 2 time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output After observing the re 阅读全文
posted @ 2017-12-17 11:33 zbtrs 阅读(216) 评论(0) 推荐(0) 编辑
摘要:Wild Words Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 5567 Accepted: 1475 Description A word is a string of lowercases. A word pattern 阅读全文
posted @ 2017-12-17 09:55 zbtrs 阅读(304) 评论(0) 推荐(0) 编辑
摘要:Find the Clones Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 8490 Accepted: 3210 Description Doubleville, a small town in Texas, was att 阅读全文
posted @ 2017-12-16 17:33 zbtrs 阅读(191) 评论(0) 推荐(0) 编辑
摘要:Phone List Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 31545 Accepted: 9244 Description Given a list of phone numbers, determine if it 阅读全文
posted @ 2017-12-16 17:10 zbtrs 阅读(181) 评论(0) 推荐(0) 编辑
摘要:D. Om Nom and Necklace time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output D. Om Nom and Neck 阅读全文
posted @ 2017-12-16 16:01 zbtrs 阅读(283) 评论(0) 推荐(0) 编辑
摘要:E. Eyes Closed time limit per test 2.5 seconds memory limit per test 256 megabytes input standard input output standard output Vasya and Petya were ti 阅读全文
posted @ 2017-12-16 14:42 zbtrs 阅读(259) 评论(0) 推荐(0) 编辑
摘要:D. String Mark time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output At the Byteland State Uni 阅读全文
posted @ 2017-12-16 13:53 zbtrs 阅读(211) 评论(0) 推荐(0) 编辑
摘要:C. Square Subsets time limit per test 4 seconds memory limit per test 256 megabytes input standard input output standard output Petya was late for the 阅读全文
posted @ 2017-12-16 11:47 zbtrs 阅读(531) 评论(0) 推荐(0) 编辑
摘要:B. XK Segments time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output While Vasya finished eatin 阅读全文
posted @ 2017-12-16 11:13 zbtrs 阅读(316) 评论(0) 推荐(0) 编辑
摘要:A. Pizza Separation time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output A. Pizza Separation t 阅读全文
posted @ 2017-12-16 11:01 zbtrs 阅读(218) 评论(0) 推荐(0) 编辑
摘要:Oulipo Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 44519 Accepted: 17845 Description The French author Georges Perec (1936–1982) once w 阅读全文
posted @ 2017-12-16 10:54 zbtrs 阅读(153) 评论(0) 推荐(0) 编辑
摘要:Wedding Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 10975 Accepted: 3355 Special Judge Description Up to thirty couples will attend a w 阅读全文
posted @ 2017-12-16 10:08 zbtrs 阅读(201) 评论(0) 推荐(0) 编辑
摘要:SPF Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 9616 Accepted: 4334 Description Consider the two networks shown below. Assuming that da 阅读全文
posted @ 2017-12-15 19:38 zbtrs 阅读(231) 评论(0) 推荐(0) 编辑
摘要:Redundant Paths Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 16630 Accepted: 6935 Description In order to get from one of the F (1 <= F 阅读全文
posted @ 2017-12-15 16:22 zbtrs 阅读(184) 评论(0) 推荐(0) 编辑
摘要:Network of Schools Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 20114 Accepted: 7915 Description A number of schools are connected to a 阅读全文
posted @ 2017-12-15 15:36 zbtrs 阅读(154) 评论(0) 推荐(0) 编辑
摘要:The Cow Prom Time Limit: 1000MS Memory Limit: 65536K Total Submissions: 2373 Accepted: 1402 Description The N (2 <= N <= 10,000) cows are so excited: 阅读全文
posted @ 2017-12-15 14:41 zbtrs 阅读(174) 评论(0) 推荐(0) 编辑
摘要:Popular Cows Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 36087 Accepted: 14710 Description Every cow's dream is to become the most popu 阅读全文
posted @ 2017-12-15 14:22 zbtrs 阅读(177) 评论(0) 推荐(0) 编辑
摘要:E. Ralph and Mushrooms time limit per test 2.5 seconds memory limit per test 512 megabytes input standard input output standard output E. Ralph and Mu 阅读全文
posted @ 2017-12-14 21:38 zbtrs 阅读(315) 评论(0) 推荐(0) 编辑
摘要:D. Ralph And His Tour in Binary Country time limit per test 2.5 seconds memory limit per test 512 megabytes input standard input output standard outpu 阅读全文
posted @ 2017-12-13 23:27 zbtrs 阅读(413) 评论(0) 推荐(0) 编辑
摘要:C. Marco and GCD Sequence time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output In a dream Marc 阅读全文
posted @ 2017-12-13 17:10 zbtrs 阅读(362) 评论(0) 推荐(0) 编辑
摘要:B. Ralph And His Magic Field time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output Ralph has a 阅读全文
posted @ 2017-12-13 16:12 zbtrs 阅读(323) 评论(0) 推荐(0) 编辑
摘要:A. QAQ time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output "QAQ" is a word to denote an expre 阅读全文
posted @ 2017-12-13 15:07 zbtrs 阅读(430) 评论(0) 推荐(0) 编辑
摘要:Cycle Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 955 Accepted Submission(s): 284 Problem D 阅读全文
posted @ 2017-12-13 14:49 zbtrs 阅读(219) 评论(0) 推荐(0) 编辑
摘要:Frogs' Neighborhood Time Limit: 5000MS Memory Limit: 10000K Total Submissions: 10239 Accepted: 4272 Special Judge Description 未名湖附近共有N个大小湖泊L1, L2, ... 阅读全文
posted @ 2017-12-12 23:31 zbtrs 阅读(232) 评论(0) 推荐(0) 编辑
摘要:D. Pair of Numbers time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output D. Pair of Numbers ti 阅读全文
posted @ 2017-12-09 14:24 zbtrs 阅读(317) 评论(0) 推荐(0) 编辑
摘要:覆盖的面积 Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6453 Accepted Submission(s): 3283 Problem 阅读全文
posted @ 2017-12-09 09:40 zbtrs 阅读(247) 评论(0) 推荐(0) 编辑
摘要:Picture Time Limit: 6000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5516 Accepted Submission(s): 2636 Problem 阅读全文
posted @ 2017-12-09 08:20 zbtrs 阅读(372) 评论(0) 推荐(0) 编辑
摘要:Atlantis Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15236 Accepted Submission(s): 6265 Probl 阅读全文
posted @ 2017-12-08 18:32 zbtrs 阅读(204) 评论(0) 推荐(0) 编辑
摘要:2111: [ZJOI2010]Perm 排列计数 Description 称一个1,2,...,N的排列P1,P2...,Pn是Magic的,当且仅当2<=i<=N时,Pi>Pi/2. 计算1,2,...N的排列中有多少是Magic的,答案可能很大,只能输出模P以后的值 称一个1,2,...,N的 阅读全文
posted @ 2017-12-07 13:33 zbtrs 阅读(243) 评论(0) 推荐(0) 编辑
摘要:1951: [Sdoi2010]古代猪文 Description “在那山的那边海的那边有一群小肥猪。他们活泼又聪明,他们调皮又灵敏。他们自由自在生活在那绿色的大草坪,他们善良勇敢相互都关心……” ——选自猪王国民歌 很久很久以前,在山的那边海的那边的某片风水宝地曾经存在过一个猪王国。猪王国地理位置 阅读全文
posted @ 2017-12-06 21:50 zbtrs 阅读(271) 评论(0) 推荐(0) 编辑
摘要:2693: jzptab Description Input 一个正整数T表示数据组数 接下来T行 每行两个正整数 表示N、M 一个正整数T表示数据组数 接下来T行 每行两个正整数 表示N、M Output T行 每行一个整数 表示第i组数据的结果 T行 每行一个整数 表示第i组数据的结果 Samp 阅读全文
posted @ 2017-12-05 16:35 zbtrs 阅读(235) 评论(0) 推荐(0) 编辑
摘要:这一章节讲的主要是组合数学方面的知识,涉及到的知识点有: 1.计数原理 2.稳定婚姻问题 3.组合问题分类 4.排列 5.组合 6.母函数 7.莫比乌斯反演 8.Lucas定理 其中母函数与莫比乌斯反演较难,省选可能会考到,大多数题目都有很多的技巧,但题型都是差不多的.一般分为4类:1.存在性问题. 阅读全文
posted @ 2017-12-05 13:22 zbtrs 阅读(536) 评论(0) 推荐(0) 编辑
摘要:Number Sequence Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 40638 Accepted: 11826 Description A single positive integer i is given. Wri 阅读全文
posted @ 2017-12-02 19:12 zbtrs 阅读(211) 评论(0) 推荐(0) 编辑
摘要:179. Brackets light 179. Brackets light time limit per test: 0.25 sec. memory limit per test: 131072 KB input: standard output: standard There is a co 阅读全文
posted @ 2017-12-02 17:00 zbtrs 阅读(161) 评论(0) 推荐(0) 编辑
摘要:字母A,B,C的所有可能的组合(按字典顺序排序)是:A, AB,ABC,AC,B,BC,C 每个组合都对应一个字典顺序的序号,如下所示: 1 A 2 AB 3 ABC 4 AC 5 B 6 BC 7 C 找出编号为K的字母组合。例如,上例中编号为4的组合为AC。 注:假设某个字母组合为X1X2X3… 阅读全文
posted @ 2017-12-02 15:59 zbtrs 阅读(606) 评论(0) 推荐(0) 编辑
摘要:字母A,B,C的所有可能的组合(按字典顺序排序)是:A, AB,ABC,AC,B,BC,C 每个组合都对应一个字典顺序的序号,如下所示: 1 A 2 AB 3 ABC 4 AC 5 B 6 BC 7 C 找出某个字母组合的字典序号。例如,上例中AC的字典序号是4。 注:假设某个字母组合为X1X2X3 阅读全文
posted @ 2017-12-02 14:44 zbtrs 阅读(1183) 评论(0) 推荐(0) 编辑
摘要:Code Time Limit: 1000MS Memory Limit: 30000K Total Submissions: 10059 Accepted: 4816 Description Transmitting and memorizing information is a task tha 阅读全文
posted @ 2017-12-02 13:48 zbtrs 阅读(299) 评论(0) 推荐(0) 编辑
摘要:Description Description 现有r个互不相同的盒子和n个互不相同的球,要将这n个球放入r个盒子中,且不允许有空盒子。则有多少种放法? 现有r个互不相同的盒子和n个互不相同的球,要将这n个球放入r个盒子中,且不允许有空盒子。则有多少种放法? Input Input n, r(0 < 阅读全文
posted @ 2017-12-02 10:29 zbtrs 阅读(282) 评论(0) 推荐(0) 编辑
摘要:Tom and matrix Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 867 Accepted Submission(s): 284 Pr 阅读全文
posted @ 2017-12-02 09:51 zbtrs 阅读(288) 评论(0) 推荐(0) 编辑
摘要:Saving Beans Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6236 Accepted Submission(s): 2518 Pr 阅读全文
posted @ 2017-12-02 08:26 zbtrs 阅读(540) 评论(0) 推荐(0) 编辑
摘要:3994: [SDOI2015]约数个数和 Description 设d(x)为x的约数个数,给定N、M,求 设d(x)为x的约数个数,给定N、M,求 Input 输入文件包含多组测试数据。 第一行,一个整数T,表示测试数据的组数。 接下来的T行,每行两个整数N、M。 输入文件包含多组测试数据。 第 阅读全文
posted @ 2017-12-01 22:11 zbtrs 阅读(209) 评论(0) 推荐(0) 编辑
摘要:2154: Crash的数字表格 Description 今天的数学课上,Crash小朋友学习了最小公倍数(Least Common Multiple)。对于两个正整数a和b,LCM(a, b)表示能同时被a和b整除的最小正整数。例如,LCM(6, 8) = 24。回到家后,Crash还在想着课上学 阅读全文
posted @ 2017-12-01 16:48 zbtrs 阅读(266) 评论(0) 推荐(0) 编辑