摘要：
虽然regional都没去过，就要退役了，虽然没有认识很多人，但在多个人身上验证了‘山外有山， 人外有人’这句话，也算扩展了自己的视野吧。另外，虽然ACM成绩确实不咋地，但还是学到不少东西的，勇气、自信、耐心、代码能力、算法YY、决心。1.UESTC 1855 http://www.cnblogs.com/ramanujan/p/3412843.html2.uestc 1847 http://www.cnblogs.com/ramanujan/p/3412848.html3.poj 2632 http://www.cnblogs.com/ramanujan/p/3412860.html4.hd 阅读全文
摘要：
K - Nearest Common Ancestors Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 1330Description A rooted tree is a well-known data structure in computer science and engineering. An example is shown below: In the figure, each node is labeled with an in 阅读全文
摘要：
A - Shortest Prefixes Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 2001Description A prefix of a string is a substring starting at the beginning of the given string. The prefixes of "carbon" are: "c", "ca", "ca 阅读全文
摘要：
J - Closest Common Ancestors Time Limit:2000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 1470DescriptionWrite a program that takes as input a rooted tree and a list of pairs of vertices. For each pair (u,v) the program determines the closest common ancestor of 阅读全文
摘要：
D - Lost Cows Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Submit Status Practice POJ 2182DescriptionN (2 #define N 8005using namespace std;struct NODE{ int l,r,num;}node[Nleft){ int mid=(right+left)>>1; i=i=c) findBrand(i,c,j); else{ c-=node[i].num... 阅读全文
摘要：
G - Naive Time Limit:3000MS Memory Limit:131072KB 64bit IO Format:%lld & %llu Submit Status Practice HUST 1606DescriptionGive you a positive integer x, determine whether it is the sum of three positive cubic numbers.InputThere’re several test cases. For each case: Only one line containing an int 阅读全文
摘要：
D - Substring Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld & %llu Submit Status Practice HUST 1602DescriptionThis problem is quiet easy. Initially, there is a string A. Then we do the following process infinity times. A := A +“HUSTACM”+ A For example, if a = “X”, then After 1 step 阅读全文
摘要：
B - Cirno's Trick Time Limit:1000MS Memory Limit:65535KB 64bit IO Format:%I64d & %I64u Submit Status Practice NBUT 1115Description Cirno(チ ルノ) is an ice elf. Her hobby is tricking on others. But the biggest problem is that - Cirno is too foolish to do tricking. She knows this, so she makes s 阅读全文
摘要：
Happy Great BGTime Limit: 2 Seconds Memory Limit: 65536 KBThe summer training of ZJU ICPC in July is about to end. To celebrate this great and happy day, the coaches of ZJU ICPC Team Navi and Fancy decided to BG everyone! Beside the two coaches, there are N participants. Those participants are di... 阅读全文
摘要：
Choosing numberTime Limit: 2 Seconds Memory Limit: 65536 KBThere are n people standing in a row. And There are m numbers, 1.2...m. Every one should choose a number. But if two persons standing adjacent to each other choose the same number, the number shouldn't equal or less than k. Apart from th 阅读全文
摘要：
A - Equations Time Limit:3000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64u Submit Status Practice HDU 1496DescriptionConsider equations having the following form: a*x1^2+b*x2^2+c*x3^2+d*x4^2=0a, b, c, d are integers from the interval [-50,50] and any of them cannot be 0.It is consider a 阅读全文
摘要：
HyperhuffmanTime Limit: 5 Seconds Memory Limit: 32768 KBYou might have heard about Huffman encoding - that is the coding system that minimizes the expected length of the text if the codes for characters are required to consist of an integral number of bits.Let us recall codes assignment process i... 阅读全文
摘要：
C. FrecklesTime Limit: 2000msCase Time Limit: 2000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 15392... 阅读全文
摘要：
E. Scrambled PolygonTime Limit: 2000msCase Time Limit: 2000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 15872Font Size:A closed polygon is a figure bounded by a finite number of line segments. The intersections of the bounding line segments are calle. 阅读全文
摘要：
H. 硬币水题IITime Limit: 1000msCase Time Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 29064Font Size:小胖有一个正反面不对称的硬币。如果抛一次这个硬币，它的正面朝上的概率为p，反面朝上的概率为1-p。现在，小胖想用这个硬币来产生等概率的决策 （50%对50%）。当然，只抛一次是不行的。小胖的策略是这样的：每一次决策，需要抛硬币两次，如果都是正面朝上或者都是反面朝上，那么就重新再做一次. 阅读全文
摘要：
C. Adidas vs AdivonTime Limit: 1000msCase Time Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 29378Font Size:“我们坐在高高的土堆上面，听妈妈讲阿迪王的事情。我出生在一个不太普通的家庭，妈妈会预知术，在我小的时候，妈妈就常跟我说：‘在未来的世界，有一种叫 阿迪王的东西成为比石油、黄金还重要的东西……’那时，我痴痴地听着，一听就到半夜，听到入迷，任由鼻涕流到自己的嘴里。长大. 阅读全文
摘要：
B. Stealing a CakeTime Limit: 2000msCase Time Limit: 2000msMemory Limit: 32768KB64-bit integer IO format: %I64d Java class name: MainSubmit Status PID: 26588Font Size: There is a big round cake on the ground. A small ant plans to steal a small piece of cake. He starts from a certain point, reaches . 阅读全文
摘要：
I. The Power of XiangqiTime Limit: 1000msCase Time Limit: 1000msMemory Limit: 32768KB64-bit integer IO format: %I64d Java class name: MainSubmit Status PID: 26595Font Size:Xiangqi is one of the most popular two-player board games in China. The game represents a battle between two armies with the go. 阅读全文
摘要：
K. OutletsTime Limit: 1000msCase Time Limit: 1000msMemory Limit: 32768KB64-bit integer IO format: %I64d Java class name: MainSubmit Status PID: 26597Font Size: In China, foreign brand commodities are often much more expensive than abroad. The main reason is that we Chinese people tend to think fore. 阅读全文
摘要：
F. Mosquito MultiplicationTime Limit: 1000msCase Time Limit: 1000msMemory Limit: 65536KB64-bit integer IO format: %lld Java class name: MainSubmit Status PID: 26584Font Size:Have you ever wondered why there are so many mosquitos in wet environments? One of the reasons is that adult female mosquitos. 阅读全文