utoppia is another word .

题目描述： 数塔 Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 11593    Accepted Submission(s): 6969 Problem Description 在讲述DP算法的时候，一个经典

POJ 1654 Area 很水的题。。 然后注意用上longlong，否则可能答案会不对。 #include #include #include #include #include #include using namespace std; #define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++) #define DOR(i,a,b) for(

A: 我采用游程编码的方法，就是讲aaaabbbc这样的字符串变成[4]a[3]b[1]c 然后就是暴力地扫描就行了。 CODE： #include #include #include #include #include #include #include using namespace std; #define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(

PRO IS HERE 大家可以看看翻译题意神马的就理解了： Translate 集合的判断，是否相交什么的。大水题。。。 纯暴力就足够了。。。 CODE： #include #include #include #include #include #include #include #include #include #include using names

175. Encoding time limit per test: 0.5 sec. memory limit per test: 4096 KB input: standard output: standard Let phi(W) is the result of encoding for algorithm: 1. If the length of W is

184. Patties time limit per test: 0.5 sec. memory limit per test: 4096 KB input: standard input output: standard output Petya is well-known with his famous cabbage patties. Petya's birt

163. Wise King time limit per test: 0.5 sec. memory limit per test: 65536 KB input: standard input output: standard output Once upon a time in a country far away lived a king and he had

题目描述： 115. Calendar time limit per test: 0.5 sec. memory limit per test: 4096 KB First year of new millenium is gone away. In commemoration of it write a program that finds the name of th

146. The Runner time limit per test: 0.5 sec. memory limit per test: 4096 KB input: standard input output: standard output The runner moves along the ring road with length L. His way co

题目描述： 144. Meeting time limit per test: 0.5 sec. memory limit per test: 4096 KB Two of the three membersof the winning team of one of the ACM regional contests are going to meetin order t

题目描述： 105. Div 3 time limit per test: 0.5 sec. memory limit per test: 4096 KB There is sequence 1, 12, 123, 1234, ..., 12345678910, ... . Given first N elements of that sequence. You must

题目描述： 107. 987654321 problem time limit per test: 0.5 sec. memory limit per test: 4096 KB For given number N you must output amount of N-digit numbers, such, that last digits of their squ

题目描述： 135. Drawing Lines time limit per test: 0.5 sec. memory limit per test: 4096 KB Little Johnny likesto draw a lot. A few days ago he painted lots of straight lines on hissheet of pap

127. Telephone directory time limit per test: 0.5 sec. memory limit per test: 4096 KB CIA has decided to create a special telephone directory for its agents. The first 2 pages of the directory c

题目描述： 123. The sum time limit per test: 0.5 sec. memory limit per test: 4096 KB The Fibonacci sequence of numbers is known: F1 = 1; F2 = 1; Fn+1 = Fn + Fn-1, for n>1. You have to find S

题目描述： Bone Collector Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 14889    Accepted Submission(s): 5911 Problem Description Man

题目描述： FATE Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 4124    Accepted Submission(s): 1843 Problem Description 最近xhd正在玩一款叫做FA

栈模拟 #include #include #include #include #include using namespace std; #define sf scanf #define pf printf #define rep(i,n) for(int (i)=0;(i)<(n);(i)++) #define dbg(x) cerr << "Line:" << __LI