摘要：
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%）。当然，只抛一次是不行的。小胖的策略是这样的：每一次决策，需要抛硬币两次，如果都是正面朝上或者都是反面朝上，那么就重新再做一次. 阅读全文