la_neige的专栏

弗洛伊德算法，最短路径。 #include #include #define INF 53356 char str[105][105]; int tmp =0; void Ppath(int path[][100],int i2,int j2) { int k2; k2=path[i2][j2]; if(k2==-1) { return;

公式题，ans=（max*2^(n-1)）%2006; #include #include using namespace std; const int MaxN = 1 << 30; int main() { int n; while(1 == scanf("%d", &n) && n ) { int ma

题意：统计每一句的单词数，可以打表：#include int main() { int a[31]={10,31,11,22,19,19,26,20,25,27, 30,35,11,41,21,33,15,26,11,25, 33,29,11,34,36,50,21,49,33,37,24}; int b[3]={13

简单题，最开始学C写的代码。 #include #include #include int main() { char *a[13]={"Adam","Seth","Enosh","Kenan","Mahalalel", "Jared","Enoch","Methuselah","Lamech","Noah",

Description The total available floor space on the ark would have been over 100,000 square feet, which would be more floor space than in 20 standard sized  basketball courts. But in our story, we

贪心，把每一列最小的加起来。 #include #include #include #define INF 10001 int main() { int cas; while((scanf("%d" , &cas)) != EOF) { int a[8][cas]; int i , j; for(i = 0

进制转化：#include #include #include int main() { double metre[3]; double temp; char a[3][15]; double val; val = 0.0000001; int i , j; while(scanf("%lf", &temp)!=EOF)

#include #include #include #include using namespace std; long n,m,k,s,t; vector map[200001]; bool hash[200001]; struct { long v; long len; }que[200001]; long bfs() { long i;