摘要： Finding LCMTime Limit:2000MSMemory Limit:32768KB64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionLCMis an abbreviation used forLeastCommonMultiple in Mathematics. We sayLCM (a, b, c) = Lif and only ifLis the least integer which is divisible bya, bandc.You will be givena, bandL. Y 阅读全文

摘要： Dice (II)Time Limit:3000MSMemory Limit:32768KB64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionYou haveNdices; each of them hasKfaces numbered from1toK. Now you can arrange theNdices in a line. If the summation of the top faces of the dices isS, you calculate the score as the mul 阅读全文

摘要： D. Mysterious Presenttime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard outputPeter decided to wish happy birthday to his friend from Australia and send him a card. To make his present more mysterious, he decided to make achain. Chain here is such a sequen 阅读全文

摘要： E. Fishtime limit per test3 secondsmemory limit per test128 megabytesinputstandard inputoutputstandard outputnfish, numbered from1ton, live in a lake. Every day right one pair of fish meet, and the probability of each other pair meeting is the same. If two fish with indexes i and j meet, the first w 阅读全文

摘要： 郑厂长系列故事——排兵布阵Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1509Accepted Submission(s): 554Problem Description 郑厂长不是正厂长 也不是副厂长 他根本就不是厂长 事实上 他是带兵打仗的团长 一天，郑厂长带着他的军队来到了一个n*m的平原准备布阵。 根据以往的战斗经验，每个士兵可以攻击到并且只能攻击到与之曼哈顿距离为2的位置以及士兵本身所在的位置。当然，一个士兵不能站... 阅读全文

摘要： Corn FieldsTime Limit:2000MSMemory Limit:65536KTotal Submissions:6081Accepted:3226DescriptionFarmer John has purchased a lush new rectangular pasture composed ofMbyN(1 ≤M≤ 12; 1 ≤N≤ 12) square parcels. He wants to grow some yummy corn for the cows on a number of squares. Regrettably, some of the squ 阅读全文

摘要： Suneast & DaxiaTime Limit:1000MSMemory Limit:32768KB64bit IO Format:%I64d & %I64u[Submit] [Go Back] [Status]DescriptionDaxia is so cute that people loves it so much.Everyone wants to buy Daxia from Suneast (a business man who sells Daxia).Suneast is a strange business man. He sells Daxia in 阅读全文

摘要： C -Coin Change (III)Time Limit:2000MSMemory Limit:32768KB64bit IO Format:%lld & %lluSubmitStatusPracticeLightOJ 1233DescriptionIn a strange shop there arentypes of coins of valueA1, A2... An.C1, C2, ... Cndenote the number of coins of valueA1, A2... Anrespectively. You have to find the number of 阅读全文

摘要： Coin Change (IV)Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionGivenncoins, values of them areA1, A2... Anrespectively, you have to find whether you can payKusing the coins. You can use any coin at most two times.InputInput starts with an in 阅读全文

摘要： Coin Change (II)Time Limit:1000MSMemory Limit:32768KB64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionIn a strange shop there arentypes of coins of valueA1, A2... An. You have to find the number of ways you can makeKusing the coins. You can use any coin a... 阅读全文