qq_270284627的博客

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=1029 用map储存 maps； #include #include #include #include using namespace std; int main() { int n; while(scanf("%d",&n)!=EOF) {

Let the Balloon Rise（链接） Sample Input 5 green red blue red red 3 pink orange pink 0   Sample Output red pink   输出出现次数最多的颜色  用map存一下就好了 #include #include #include #inclu

Train Problem IProblem DescriptionAs the new term comes, the Ignatius Train Station is very busy nowadays. A lot of student want to get back to school by train(because the trains in the Ignatius Train...