碳酸钙的01妖精的博客

HDU-1004 Let the Balloon Rise(map)Problem Description Contest time again! How excited it is to see balloons floating around. But to tell you a secret, the judges' favorite time is guessing the most po...

HDU-1075 What Are You Talking About(map)Problem Description Ignatius is so lucky that he met a Martian yesterday. But he didn't know the language the Martians use. The Martian gives him a history book...

HDU-1263 水果(map)Problem Description 夏天来了~~好开心啊,呵呵,好多好多水果~~Joe经营着一个不大的水果店.他认为生存之道就是经营最受顾客欢迎的水果.现在他想要一份水果销售情况的明细表,这样Joe就可以很容易掌握所有水果的销售情况了. Input 第一行正整数N(0<N<=10)表示有N组测试数据.每组测试数据的第一行是一个整数M(0<M&l...

 map<string,int> si for(map<string,int>::iterator it=si.begin();it!=si.end();it++)  {           cout<<it->first<<end;  }这个竟然是按string的字典序输出的si.clear()就是map的清0 当...

 PAT (Advanced Level) Practice  1092 To Buy or Not to Buy （20 分）Eva would like to make a string of beads with her favorite colors so she went to a small shop to buy some beads. There were many col...

Problem J八数码时限：5000ms 内存限制：20000K 总时限：10000ms描述： 在九宫格里放在1到8共8个数字还有一个是空格，与空格相邻的数字可以移动到空格的位置，问给定的状态最少需要几步能到达目标状态（用0表示空格）：1 2 34 5 67 8 0输入： 输入一个给定的状态。输出： 输出到达目标状态的最小步数。不能到达时输出-1...