算法爱好者

摘要： Sequence operationTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3114Accepted Submission(s): 909Problem Descriptionlxhgww got a sequence contains n characters which are all '0's or '1's.We have five operations here:Change operatio 阅读全文

摘要： 汉诺塔 XTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 294Accepted Submission(s): 175Problem Description1,2,...,n表示n个盘子．数字大盘子就大．n个盘子放在第１根柱子上．大盘不能放在小盘上．在第１根柱子上的盘子是a[1],a[2],...,a[n]. a[1]=n,a[2]=n-1,...,a[n]=1.即a[1]是最下面的盘子．把n个盘子移动到第3根柱子．每次只能移动1个盘子，且大盘 阅读全文

摘要： 汉诺塔IXTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 404Accepted Submission(s): 235Problem Description1,2,...,n表示n个盘子．数字大盘子就大．n个盘子放在第１根柱子上．大盘不能放在小盘上． 在第１根柱子上的盘子是a[1],a[2],...,a[n]. a[1]=n,a[2]=n-1,...,a[n]=1.即a[1]是最下 面的盘子．把n个盘子移动到第３根柱子．每次只能移动１个盘子，且 阅读全文

摘要： RelativesTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 8923Accepted: 4184DescriptionGiven n, a positive integer, how many positive integers less than n are relatively prime to n? Two integers a and b are relatively prime if there are no integers x > 1, y > 0, z > 0 such that a = 阅读全文

摘要： Brave balloonistsTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4546Accepted: 1924DescriptionTen mathematicians are flying on a balloon over the Pacific ocean. When they are crossing the equator they decide to celebrate this event and open a bottle of champagne. Unfortunately, the cork mak 阅读全文

摘要： Smith NumbersTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 10002Accepted: 3512DescriptionWhile skimming his phone directory in 1982, Albert Wilansky, a mathematician of Lehigh University,noticed that the telephone number of his brother-in-law H. Smith had the following peculiar property: 阅读全文

摘要： A/BTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 592Accepted Submission(s): 475Problem Description要求(A/B)%9973，但由于A很大，我们只给出n(n=A%9973)(我们给定的A必能被B整除，且gcd(B,9973) = 1)。Input数据的第一行是一个T，表示有T组数据。每组数据有两个数n(0 <= n < 9973)和B(1 <= B <= 10^9)。O 阅读全文

摘要： HotelTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 6681Accepted: 2777DescriptionThe cows are journeying north to Thunder Bay in Canada to gain cultural enrichment and enjoy a vacation on the sunny shores of Lake Superior. Bessie, ever the competent travel agent, has named the Bullmoose Ho 阅读全文

摘要： Another LCISTime Limit: 1000 ms Memory Limit: 65536 kB Solved: 111 Tried: 1673 SubmitStatusBest SolutionBackDescription For a sequence S1,S2,...,SN, and a pair of integers (i, j), if 1 <= i <= j <= N and Si < Si+1 < Si+2 <...< Sj-1 < Sj, then the sequence Si,Si+1,...,Sj is a 阅读全文

摘要： BeansTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1433Accepted Submission(s): 741Problem DescriptionBean-eating is an interesting game, everyone owns an M*N matrix, which is filled with different qualities beans. Meantime, there is only one bean 阅读全文