勇敢前进的ACMer

文章出处：http://blog.csdn.net/buutterfly/article/details/6617375内存溢出 out of memory，是指程序在申请内存时，没有足够的内存空间供其使用，出现out of memory；比如申请了一个integer,但给它存了long才能存下的数，那就是内存溢出。内存泄露 memory leak，是指程序在申请内存后，无法释

小希的迷宫Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 54476    Accepted Submission(s): 17103Problem Description上次Gardon的迷宫城堡小希玩了很

继续畅通工程Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 26168 Accepted Submission(s): 11072Problem Description 省政府“畅通工程”的目标是使全省任何两个村庄间都可以实现公路

How to TypeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7194    Accepted Submission(s): 3249Problem DescriptionPirates have f

龟兔赛跑Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 19740    Accepted Submission(s): 7289Problem Description据说在很久很久以前，可怜的兔子经历了人生

Doing Homework againTime Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14870    Accepted Submission(s): 8679Problem Description

RP问题Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1204    Accepted Submission(s): 471Problem Description在人类社会中，任何个体都具有人品，人品有各种

PearlsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2769    Accepted Submission(s): 1380Problem DescriptionIn Pearlania everyb

Just a NumbleTime Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3581    Accepted Submission(s): 1797Problem DescriptionNow give you

Calculate S(n)Time Limit: 10000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 12001    Accepted Submission(s): 4310Problem DescriptionCalculate

将string直接转换成const char *类型，一个是.c_str()，一个是data成员函数。#include #include #include using namespace std;int main(){ string s1 = "hello world!"; const char *p1 = s1.c_str(); const char *p2

#include #include #include #include using namespace std;int main(){ string str = "hello world!"; int len = str.length(); char *p; p = (char *)malloc((len)*sizeof(char)); str.

SubstringsTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10797    Accepted Submission(s): 5167Problem DescriptionYou are given

字串数Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4794    Accepted Submission(s): 1275Problem Description一个A和两个B一共可以组成三种字符串:"AB

直接贴代码吧，一看就懂#include #include #include #include using namespace std;/*从文件中读取数据，并计算相邻两点的距离上下两行的数据默认是两个相邻点的数据*/char buffer[250];int main(){ double dist; double x[100],y[100]; int

A Walk Through the ForestTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8954    Accepted Submission(s): 3308Problem Description

让我们从一个非常简单的例子开始，如下： int n; 这个应该被理解为“declare n as an int”（n是一个int型的变量）接下去来看一下指针变量，如下： int *p; 这个应该被理解为“declare p as an int ”（p是一个int 型的变量），或者说p是一个指向一个int型变量的指针。我想在这里展开讨论一下：我觉得在声明一个指针（或引用）类型的变量时，最好将*

1．字符串与字符串指针 字符串是存放在字符数组中的，通常将字符串作为一个整体来使用，用指针来处理字符串更加方便。 当用指向字符串的指针来处理字符串时，并不关心存放字符串的数组大小，而只关心是否已处理到字符串的结束符。 用指针实现字符串拷贝 　# include <iostream.h>　# include <string.h>　void main(void) { char *p1 =

1．数组指针 　　数组的首地址称为数组指针。若定义整型数组a[5]，系统为数组分配的地址从1000到1019，则数组a的首地址1000为数组a的数组指针。 C++规定，数组的首地址可用数组名a表示，因此，数组a的数组指针 =a =&a[0]。2．数组指针变量 　　存放数组元素地址的变量称为数组指针变量。如： 　　int a[5]; 　　int *p = &a[0]; 　　则p为

1．二维数组元素在内存中的存放方式 　　在C++中，二维数组元素值在内存中是按行的顺序存放的。　用指针变量输出二维数组各元素的值。#include <iostream.h>void main(void){ int a[3][3]={{1,2,3},{4,5,6},{7,8,9}};　　int *p = &a[0][0]; //将二维数组首地址赋给指针变量p　　for (int i=0

HDU TodayTime Limit: 15000/5000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 31489    Accepted Submission(s): 7675Problem Description经过锦囊相助，海东集团终于度

最短路径问题Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 29132    Accepted Submission(s): 8661Problem Description给你n个点，m条无向边，每条边都有长

FatMouse' TradeTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 80550    Accepted Submission(s): 27846Problem DescriptionFatMouse

畅通工程Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 32086    Accepted Submission(s): 14163Problem Description省政府“畅通工程”的目标是使全省任何两

还是畅通工程Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 48922    Accepted Submission(s): 22331Problem Description某省调查乡村交通状况，得到的统计表

Constructing RoadsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 24271 Accepted Submission(s): 9345Problem Description There are N village

Color the ballTime Limit: 9000/3000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 23142    Accepted Submission(s): 11237Problem DescriptionN个气球排成一排，

Minimum Transport CostTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11344    Accepted Submission(s): 3168Problem DescriptionTh

ArbitrageTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 8575    Accepted Submission(s): 3953Problem DescriptionArbitrage is the

Falling LeavesTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 5576 Accepted: 3001Description Figure 1Figure 1 shows a graphical representation of