隔山忘己-CSDN博客

原创 Linux系统下安装FASTDFS STORAGE AND TRACKER

下载组件包括：libfastcommon-master.zipfastdfs-master.zipfastdfs-nginx-module_v1.16.tar.gznginx-1.8.1.tar.gzngx_cache_purge-2.3.tar.gzopenssl-1.0.1s.tar.gzpcre-

2017-03-14 10:40:08 2258

原创 hdu1231最大子序列

http://acm.hdu.edu.cn/showproblem.php?pid=1231 dp的题目大部分只要找出状态方程就很好做，本题是 if (current{ current=a[i];temp=a[i];}else current+=a[i];if (current>res){ res=current;first=temp;l

2015-12-23 13:53:57 344

转载俄罗斯方块源代码

/* *俄罗斯方块源程序 */ #include #include #include #include /*图形函数库*/ /*定义按键码*/ #define VK_LEFT 0x4b00 #define VK_RIGHT 0x4d00 #define VK_DOWN 0x5000 #define VK_UP 0x4800

2015-01-31 14:39:57 606

原创 Kruskal标准模板

#include#includeusing namespace std;#define M 100#define N 100typedef struct edge{ int a,b,value;}edge;edge edges[M];int final[N];int nodecount[N];bool cmp(edge a,edge b)//判

2015-01-31 14:35:11 338

原创 poj2485

HighwaysTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 23171 Accepted: 10681DescriptionThe island nation of Flatopia is perfectly flat. Unfortunately

2015-01-04 13:55:24 280

原创 poj2421

Constructing RoadsTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 19843 Accepted: 8298DescriptionThere are N villages, which are numbered from 1 to N,

2015-01-04 12:59:26 320

原创 POJ2034

Anti-prime SequencesTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 3099 Accepted: 1415DescriptionGiven a sequence of consecutive integers n,n+1,n+2,.

2015-01-03 15:17:25 448

转载 hdu2143

转自 http://blog.csdn.net/ysc504/article/details/8505630boxTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 5323 Accepted Submission(s):

2014-12-28 03:14:42 433

原创 hdu1846

Brave GameTime Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7274 Accepted Submission(s): 4840Problem Description十年前读大学的时候，中国每年都要从国外

2014-12-28 02:55:17 293

原创 poj1014

DividingTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 61037 Accepted: 15763DescriptionMarsha and Bill own a collection of marbles. They want to split

2014-12-28 02:46:24 270

原创 poj2389

#include using namespace std; const int MAX=40; //题目要求整数位不超过40位const int result=100; //两数相乘结果要较大，位数较多char a[MAX+10]; char b[MAX+10]; //接受输入的数字int amul[MAX+10]; int bmul[MAX+10]; //存储转

2014-12-21 14:28:40 463

原创 hdu2110

#include#include#define M 10007int c1[M],c2[M],num[107],id[107];int main(){ int t; while(scanf("%d",&t),t)//输入价值数 { memset(num,0,sizeof(num));//num初始为0 int c

2014-12-21 14:27:43 428

原创 hdu3635

#include#include#include#includeconst int MAX=100001;int c1[MAX]; //判断数组using namespace std;struct facility//建立一个设备结构体{ int value; int num;};facility s[MAX];int mai

2014-12-21 03:37:29 300

原创 hdu1753

大明A+BTime Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8980 Accepted Submission(s): 3185Problem Description话说，经过了漫长的一个多月，小明已经成长了许多，

2014-12-14 13:16:30 333

原创 hdu1711

Big Event in HDUTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 24956 Accepted Submission(s): 8774Problem DescriptionNowadays, w

2014-12-14 02:20:55 264

原创 hdu1042

N!Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 58227 Accepted Submission(s): 16532Problem DescriptionGiven an integer N(0 ≤ N

2014-12-14 01:42:05 319

原创 poj2739解题报告

#include#include#includeusing namespace std ;const int MAX=10000; bool flag[MAX+1]; int a[MAX+1]; int size=0; void prime(int max) { memset(flag,true,sizeof(flag));

2014-12-07 01:36:51 315

原创 POJ1250解题报告

Tanning SalonTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 7478 Accepted: 4022DescriptionTan Your Hide, Inc., owns several coin-operated tanning sal

2014-12-07 01:17:10 417

原创 poj1323解题报告

Game PredictionTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 9689 Accepted: 4630DescriptionSuppose there are M people, including you, playing a specia

2014-12-06 01:34:28 1430

原创 poj2126解题报告

Factoring a PolynomialTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 2453 Accepted: 1272DescriptionRecently Georgie has learned about polynomials. A po

2014-11-30 12:51:56 424

原创 poj1961解题报告

PeriodTime Limit: 3000MS Memory Limit: 30000KTotal Submissions: 13616 Accepted: 6417DescriptionFor each prefix of a given string S with N characters (each charact

2014-11-29 14:27:13 500

原创 poj2406解题报告

Power StringsTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 33547 Accepted: 13935DescriptionGiven two strings a and b we define a*b to be their concate

2014-11-29 14:13:35 413

原创 poj1401解题报告

FactorialTime Limit: 1500MS Memory Limit: 65536KTotal Submissions: 14561 Accepted: 9015DescriptionThe most important part of a GSM network is so called Base Trans

2014-11-16 13:01:03 398

原创 poj1328解题报告

Radar InstallationTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 54665 Accepted: 12314DescriptionAssume the coasting is an infinite straight line. Land

2014-11-15 00:40:20 440

原创 poj1423解题报告

Big NumberTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26063 Accepted: 8323DescriptionIn many applications very large integers numbers are required.

2014-11-12 20:07:15 304

原创 poj2551

OnesTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 10813 Accepted: 6153DescriptionGiven any integer 0 InputEach line contains a number n.Output

2014-11-09 12:01:56 362

原创 poj2608

SoundexTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 9385 Accepted: 4656DescriptionSoundex coding groups together words that appear to sound alike bas

2014-11-08 14:28:47 275

原创 poj2209解题报告

The KingTime Limit: 2000MS Memory Limit: 65536KTotal Submissions: 6549 Accepted: 3644DescriptionOnce upon a time in a country far away lived a king and he had a b

2014-11-06 20:11:51 317

原创 poj1450

GridlandTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 8253 Accepted: 4181DescriptionBackground For years, computer scientists have been trying to

2014-11-02 13:11:26 299

原创 poj2739解题报告

#include#include#includeusing namespace std;int main(){int i,j,n,t=0,temp,sum,num,s;int a[2000];for (i=2;i{ temp=0;if (i%2==0 && i!=2) {continue;} for (j=2;j{if (i%j==0)

2014-10-31 23:52:08 324

原创 poj1326解题报告

Mileage BankTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 13705 Accepted: 5713DescriptionMileage program of ACM (Airline of Charming Merlion) is reall

2014-10-31 14:39:22 364

原创 poj1004

Financial ManagementTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 139320 Accepted: 58075DescriptionLarry graduated this year and finally has a job. He

2014-10-26 21:49:45 288

原创 POJ3299解题报告

HumidexTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 17054 Accepted: 6199DescriptionAdapted from Wikipedia, the free encyclopediaThe humidex is a me

2014-10-26 21:19:06 318

u013343013的专栏

原创 Linux系统下安装FASTDFS STORAGE AND TRACKER

原创 hdu1231最大子序列

转载俄罗斯方块源代码

原创 Kruskal标准模板

原创 poj2485

原创 poj2421

原创 POJ2034

转载 hdu2143

原创 hdu1846

原创 poj1014

原创 poj2389

原创 hdu2110

原创 hdu3635

原创 hdu1753

原创 hdu1711

原创 hdu1042

原创 poj2739解题报告

原创 POJ1250解题报告

原创 poj1323解题报告

原创 poj2126解题报告

原创 poj1961解题报告

原创 poj2406解题报告

原创 poj1401解题报告

原创 poj1328解题报告

原创 poj1423解题报告

原创 poj2551

原创 poj2608

原创 poj2209解题报告

原创 poj1450

原创 poj2739解题报告

原创 poj1326解题报告

原创 poj1004

原创 POJ3299解题报告

空空如也

空空如也