04 2014 档案

摘要:折线分割平面Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15709Accepted Submission(s): 10836Problem De... 阅读全文
posted @ 2014-04-29 12:08 heaventouch 阅读(528) 评论(0) 推荐(0) 编辑
摘要:钱币兑换问题Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5069Accepted Submission(s): 2868Problem Desc... 阅读全文
posted @ 2014-04-28 09:23 heaventouch 阅读(342) 评论(0) 推荐(0) 编辑
摘要:下沙的沙子有几粒?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2584Accepted Submission(s): 1346Problem D... 阅读全文
posted @ 2014-04-27 20:46 heaventouch 阅读(289) 评论(0) 推荐(0) 编辑
摘要:三角形Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4390Accepted Submission(s): 2957Problem Descrip... 阅读全文
posted @ 2014-04-27 16:03 heaventouch 阅读(337) 评论(0) 推荐(0) 编辑
摘要:汉诺塔IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4529Accepted Submission(s): 2231Problem Descr... 阅读全文
posted @ 2014-04-27 12:48 heaventouch 阅读(346) 评论(0) 推荐(0) 编辑
摘要:Buy the TicketTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4185Accepted Submission(s): 1759Prob... 阅读全文
posted @ 2014-04-27 10:44 heaventouch 阅读(215) 评论(0) 推荐(0) 编辑
摘要:Radar InstallationTime Limit:1000MSMemory Limit:10000KTotal Submissions:48890Accepted:10917DescriptionAssume the coasting is an infinite straight line... 阅读全文
posted @ 2014-04-27 09:28 heaventouch 阅读(205) 评论(0) 推荐(0) 编辑
摘要:今年暑假不ACTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25527Accepted Submission(s): 13375Problem D... 阅读全文
posted @ 2014-04-26 15:15 heaventouch 阅读(216) 评论(0) 推荐(0) 编辑
摘要:The Pilots Brothers' refrigeratorTime Limit:1000MSMemory Limit:65536KTotal Submissions:17450Accepted:6600Special JudgeDescriptionThe game “The Pilots ... 阅读全文
posted @ 2014-04-26 11:56 heaventouch 阅读(288) 评论(0) 推荐(0) 编辑
摘要:Flip GameTime Limit:1000MSMemory Limit:65536KTotal Submissions:28805Accepted:12461DescriptionFlip game is played on a rectangular 4x4 field with two-s... 阅读全文
posted @ 2014-04-26 11:09 heaventouch 阅读(406) 评论(0) 推荐(0) 编辑
摘要:Cow SortingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2185Accepted Submission(s): 683Problem ... 阅读全文
posted @ 2014-04-26 10:02 heaventouch 阅读(272) 评论(0) 推荐(0) 编辑
摘要:Humble NumbersTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 15978Accepted Submission(s): 6915Pro... 阅读全文
posted @ 2014-04-24 10:36 heaventouch 阅读(332) 评论(0) 推荐(0) 编辑
摘要:Monkey and BananaTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6846Accepted Submission(s): 3508P... 阅读全文
posted @ 2014-04-24 09:44 heaventouch 阅读(183) 评论(0) 推荐(0) 编辑
摘要:Super Jumping! Jumping! Jumping!Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20485Accepted Subm... 阅读全文
posted @ 2014-04-23 23:55 heaventouch 阅读(140) 评论(0) 推荐(0) 编辑
摘要:免费馅饼Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23717Accepted Submission(s): 7989Problem Descr... 阅读全文
posted @ 2014-04-23 23:13 heaventouch 阅读(167) 评论(0) 推荐(0) 编辑
摘要:数塔Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 20191Accepted Submission(s): 12103Problem Descri... 阅读全文
posted @ 2014-04-23 21:40 heaventouch 阅读(198) 评论(0) 推荐(0) 编辑
摘要:Max SumTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 134690Accepted Submission(s): 31181Problem ... 阅读全文
posted @ 2014-04-23 21:30 heaventouch 阅读(242) 评论(0) 推荐(0) 编辑
摘要:FLIGHT GAMETime Limit : 3000/1000ms (Java/Other)Memory Limit : 65535/32768K (Java/Other)Total Submission(s) : 41Accepted Submission(s) : 10Font:Times ... 阅读全文
posted @ 2014-04-23 13:07 heaventouch 阅读(184) 评论(0) 推荐(0) 编辑
摘要:Luck and LoveTime Limit: 10000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4897Accepted Submission(s): 1219Prob... 阅读全文
posted @ 2014-04-21 21:34 heaventouch 阅读(338) 评论(0) 推荐(0) 编辑
摘要:Color the ballTime Limit: 9000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7540Accepted Submission(s): 3887Prob... 阅读全文
posted @ 2014-04-20 11:15 heaventouch 阅读(376) 评论(0) 推荐(0) 编辑
摘要:IntervieweTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4543Accepted Submission(s): 1108Problem ... 阅读全文
posted @ 2014-04-20 10:31 heaventouch 阅读(377) 评论(0) 推荐(0) 编辑
摘要:Connections between citiesTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4057Accepted Submission... 阅读全文
posted @ 2014-04-19 09:37 heaventouch 阅读(1205) 评论(0) 推荐(0) 编辑
摘要:Median FilterTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1092Accepted Submission(s): 269Proble... 阅读全文
posted @ 2014-04-17 14:39 heaventouch 阅读(362) 评论(0) 推荐(0) 编辑
摘要:Closest Common AncestorsTime Limit:2000MSMemory Limit:10000KTotal Submissions:14314Accepted:4607DescriptionWrite a program that takes as input a roote... 阅读全文
posted @ 2014-04-15 20:36 heaventouch 阅读(195) 评论(0) 推荐(0) 编辑
摘要:Nearest Common AncestorsTime Limit:1000MSMemory Limit:10000KTotal Submissions:16530Accepted:8839DescriptionA rooted tree is a well-known data structur... 阅读全文
posted @ 2014-04-15 16:07 heaventouch 阅读(179) 评论(0) 推荐(0) 编辑
摘要:How far away ?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4244Accepted Submission(s): 1617Prob... 阅读全文
posted @ 2014-04-13 11:12 heaventouch 阅读(244) 评论(0) 推荐(0) 编辑
摘要:Fence RepairTime Limit:2000MSMemory Limit:65536KTotal Submissions:23532Accepted:7491DescriptionFarmer John wants to repair a small length of the fence around the pasture. He measures the fence and finds that he needsN(1 ≤N≤ 20,000) planks of wood, each having some integer lengthLi(1 ≤Li≤ 50,000) uni 阅读全文
posted @ 2014-04-11 21:00 heaventouch 阅读(153) 评论(0) 推荐(0) 编辑
摘要:Sorting It All OutTime Limit:1000MSMemory Limit:10000KTotal Submissions:26088Accepted:9035DescriptionAn ascending sorted sequence of distinct values is one in which some form of a less-than operator is used to order the elements from smallest to largest. For example, the sorted sequence A, B, C, D i 阅读全文
posted @ 2014-04-11 17:43 heaventouch 阅读(249) 评论(0) 推荐(0) 编辑
摘要:Safe Or UnsafeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1388Accepted Submission(s): 544Problem DescriptionJavac++ 一天在看计算机的书籍的时候,看到了一个有趣的东西!每一串字符都可以被编码成一些数字来储存信息,但是不同的编码方式得到的储存空间是不一样的!并且当储存空间大于一定的值的时候是不安全的!所以Javac++ 就想是否有一种方式是可以得到字符编码最小的空间值!显然 阅读全文
posted @ 2014-04-10 22:48 heaventouch 阅读(343) 评论(0) 推荐(0) 编辑
摘要:EntropyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3648Accepted Submission(s): 1451Problem DescriptionAn entropy encoder is a data encoding method that achieves lossless data compression by encoding a message with “wasted” or “extra” informatio 阅读全文
posted @ 2014-04-10 16:46 heaventouch 阅读(345) 评论(0) 推荐(0) 编辑
摘要:Box RelationsTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 894Accepted Submission(s): 324Special JudgeProblem DescriptionThere arenboxesC1, C2, ..., Cnin 3D space. The edges of the boxes are parallel to thex, yorz-axis. We provide some relations 阅读全文
posted @ 2014-04-10 11:44 heaventouch 阅读(335) 评论(0) 推荐(0) 编辑
摘要:Tr ATime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2449Accepted Submission(s): 1819Problem DescriptionA为一个方阵,则Tr A表示A的迹(就是主对角线上各项的和),现要求Tr(A^k)%9973。Input数据的第一行是一个T,表示有T组数据。每组数据的第一行有n(2 8 #include 9 #define N 997310 struct matrix{11 int g[15]... 阅读全文
posted @ 2014-04-09 21:21 heaventouch 阅读(221) 评论(0) 推荐(0) 编辑
摘要:GCDTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5064Accepted Submission(s): 1818Problem DescriptionGiven 5 integers: a, b, c, d, k, you're to find x in a...b, y in c...d that GCD(x, y) = k. GCD(x, y) means the greatest common divisor of x an 阅读全文
posted @ 2014-04-09 19:57 heaventouch 阅读(272) 评论(0) 推荐(0) 编辑
摘要:GCDTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 890Accepted Submission(s): 396Problem DescriptionThe greatest common divisor GCD(a,b) of two positive integers a and b,sometimes written (a,b),is the largest divisor common to a and b,For example,( 阅读全文
posted @ 2014-04-09 13:40 heaventouch 阅读(256) 评论(0) 推荐(0) 编辑
摘要:CupTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3533Accepted Submission(s): 1136Problem DescriptionThe WHU ACM Team has a big cup, with which every member drinks water. Now, we know the volume of the water in the cup, can you tell us it height?T 阅读全文
posted @ 2014-04-08 22:31 heaventouch 阅读(229) 评论(0) 推荐(0) 编辑
摘要:Calculation 2Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1923Accepted Submission(s): 812Problem DescriptionGiven a positive integer N, your task is to calculate the sum of the positive integers less than N which are not coprime to N. A is said 阅读全文
posted @ 2014-04-08 19:34 heaventouch 阅读(175) 评论(0) 推荐(0) 编辑
摘要:GCD AgainTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2257Accepted Submission(s): 908Problem DescriptionDo you have spent some time to think and try to solve those unsolved problem after one ACM contest?No? Oh, you must do this when you want to 阅读全文
posted @ 2014-04-08 12:15 heaventouch 阅读(208) 评论(0) 推荐(0) 编辑
摘要:欧拉函数 1 /* 2 欧拉函数: 3 小于或等于n的正整数中,与n互质的数的数目 4 */ 5 #include 6 #define N 3000005 7 __int64 ans[N]; 8 void init() //打表法 9 {10 for(int i=1;i1) ret*=n-1;29 return ret;30 } 31 int main(void)32 {33 int n;34 while(scanf("%d",&n)!=EOF)35 {36 printf("%d\n",euler(n));37... 阅读全文
posted @ 2014-04-08 12:07 heaventouch 阅读(649) 评论(0) 推荐(0) 编辑
摘要:The Euler functionTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3333Accepted Submission(s): 1368Problem DescriptionThe Euler function phi is an important kind of function in number theory, (n) represents the amount of the numbers which are smalle 阅读全文
posted @ 2014-04-08 09:53 heaventouch 阅读(220) 评论(0) 推荐(0) 编辑
摘要:找新朋友Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6952Accepted Submission(s): 3612Problem Description新年快到了,“猪头帮协会”准备搞一个聚会,已经知道现有会员N人,把会员从1到N编号,其中会长的号码是N号,凡是和会长是老朋友的,那么该会员的号码肯定和N有大于1的公约数,否则都是新朋友,现在会长想知道究竟有几个新朋友?请你编程序帮会长计算出来。Input第一行是测试数据的组数CN(Case 阅读全文
posted @ 2014-04-08 09:32 heaventouch 阅读(208) 评论(0) 推荐(0) 编辑
摘要:PetTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1054Accepted Submission(s): 528Problem DescriptionOne day, Lin Ji wake up in the morning and found that his pethamster escaped. He searched in the room but didn’t find the hamster. He tried to use 阅读全文
posted @ 2014-04-03 21:02 heaventouch 阅读(162) 评论(0) 推荐(0) 编辑
摘要:CubeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 1307Accepted Submission(s): 674Problem DescriptionGiven an N*N*N cube A, whose elements are either 0 or 1. A[i, j, k] means the number in the i-th row , j-th column and k-th layer. Initially we h 阅读全文
posted @ 2014-04-01 21:50 heaventouch 阅读(198) 评论(0) 推荐(0) 编辑
摘要:MatrixTime Limit:3000MSMemory Limit:65536KTotal Submissions:16797Accepted:6312DescriptionGiven an N*N matrix A, whose elements are either 0 or 1. A[i, j] means the number in the i-th row and j-th column. Initially we have A[i, j] = 0 (1 14 #include15 #define N 100516 int c[N][N];17 int lowbit(int i) 阅读全文
posted @ 2014-04-01 21:12 heaventouch 阅读(178) 评论(0) 推荐(0) 编辑
摘要:Mobile phonesTime Limit:5000MSMemory Limit:65536KTotal Submissions:13889Accepted:6451DescriptionSuppose that the fourth generation mobile phone base stations in the Tampere area operate as follows. The area is divided into squares. The squares form an S * S matrix with the rows and columns numbered 阅读全文
posted @ 2014-04-01 12:46 heaventouch 阅读(276) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示