water
文章平均质量分 73
utoppia
这个作者很懒,什么都没留下…
展开
-
hdu 2084 数塔
题目描述:数塔Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11593 Accepted Submission(s): 6969Problem Description在讲述DP算法的时候,一个经典原创 2012-10-19 00:01:24 · 326 阅读 · 0 评论 -
POJ 1654 Area
POJ 1654 Area很水的题。。然后注意用上longlong,否则可能答案会不对。#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)#define DOR(i,a,b) for(原创 2013-08-21 09:44:35 · 547 阅读 · 0 评论 -
alpc training 2013-7-31
A:我采用游程编码的方法,就是讲aaaabbbc这样的字符串变成[4]a[3]b[1]c然后就是暴力地扫描就行了。CODE:#include#include#include#include#include#include#includeusing namespace std;#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);(原创 2013-08-01 21:43:37 · 684 阅读 · 0 评论 -
URal 1350. Canteen
PRO IS HERE大家可以看看翻译题意神马的就理解了:Translate集合的判断,是否相交什么的。大水题。。。纯暴力就足够了。。。CODE:#include#include#include#include#include#include#include#include#include#includeusing names原创 2013-06-06 11:49:30 · 790 阅读 · 0 评论 -
sgu 175 Encoding
175. Encodingtime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standardoutput: standardLet phi(W) is the result of encoding for algorithm:1. If the length of W is原创 2012-11-06 17:39:00 · 418 阅读 · 0 评论 -
sgu 184 Patties
184. Pattiestime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standard inputoutput: standard outputPetya is well-known with his famous cabbage patties. Petya's birt原创 2012-11-06 20:53:52 · 423 阅读 · 0 评论 -
sgu 163 Wise King
163. Wise Kingtime limit per test: 0.5 sec.memory limit per test: 65536 KBinput: standard inputoutput: standard outputOnce upon a time in a country far away lived a king and he had原创 2012-11-05 23:29:59 · 422 阅读 · 0 评论 -
sgu 115 Calendar
题目描述:115. Calendartime limit per test: 0.5 sec. memory limit per test: 4096 KBFirst year of new millenium is gone away. In commemoration of it write a program that finds the name of th原创 2012-10-26 10:52:48 · 366 阅读 · 0 评论 -
sgu 146 The Runner
146. The Runnertime limit per test: 0.5 sec.memory limit per test: 4096 KBinput: standard inputoutput: standard outputThe runner moves along the ring road with length L. His way co原创 2012-11-04 14:05:43 · 436 阅读 · 0 评论 -
sgu 144
题目描述:144. Meetingtime limit per test: 0.5 sec. memory limit per test: 4096 KBTwo of the three membersof the winning team of one of the ACM regional contests are going to meetin order t原创 2012-11-04 11:06:48 · 340 阅读 · 0 评论 -
sgu 105 Div 3
题目描述:105. Div 3time limit per test: 0.5 sec. memory limit per test: 4096 KBThere is sequence 1, 12, 123, 1234, ..., 12345678910, ... . Given first N elements of that sequence. You must原创 2012-10-23 23:06:27 · 589 阅读 · 0 评论 -
sgu 107 987654321 problem
题目描述:107. 987654321 problemtime limit per test: 0.5 sec. memory limit per test: 4096 KBFor given number N you must output amount of N-digit numbers, such, that last digits of their squ原创 2012-10-24 17:35:44 · 407 阅读 · 0 评论 -
sgu 135 Drawing Lines
题目描述:135. Drawing Linestime limit per test: 0.5 sec. memory limit per test: 4096 KBLittle Johnny likesto draw a lot. A few days ago he painted lots of straight lines on hissheet of pap原创 2012-11-01 22:24:37 · 438 阅读 · 0 评论 -
sgu 127 Telephone directory
127. Telephone directorytime limit per test: 0.5 sec. memory limit per test: 4096 KBCIA has decided to create a special telephone directory for its agents. The first 2 pages of the directory c原创 2012-11-01 00:38:02 · 433 阅读 · 0 评论 -
sgu 123 The sum
题目描述:123. The sumtime limit per test: 0.5 sec. memory limit per test: 4096 KBThe Fibonacci sequence of numbers is known: F1 = 1; F2 = 1; Fn+1 = Fn + Fn-1, for n>1.You have to find S原创 2012-10-31 22:14:20 · 399 阅读 · 0 评论 -
hdu 2602 Bone Collector
题目描述:Bone CollectorTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14889 Accepted Submission(s): 5911Problem DescriptionMan原创 2012-10-19 18:29:52 · 328 阅读 · 0 评论 -
hdu 2159 FATE
题目描述:FATETime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4124 Accepted Submission(s): 1843Problem Description最近xhd正在玩一款叫做FA原创 2012-10-19 00:14:43 · 325 阅读 · 0 评论 -
HDU 1022 Train Problem I
栈模拟#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原创 2013-11-10 14:24:07 · 644 阅读 · 0 评论