10.14,坐标:电子科技大学 24h,不间断的编程,感觉还是很爽的. 排名一般,但是这是开始,未来还很远. 题目举例1: 广袤的非洲大草原上,狮子居住在一个个的网格里,他们的势力范围会以曼哈顿路程的的方式给出,求出哪个狮子重叠在其他狮子领地里的次数最少. 代码如下: #include<stdio.h> #include<algorithm> #include<iostream> #include<vector> #include<map> #i…

去年742,今年72,也算一种小小的进步. 明年前30(笑 1. Drawing Rooted Binary Trees 给定一个树的中序和前序的遍历,要求输出这棵树(包括空格的) #include <iostream>// #include <string.h>// #include <stdio.h>// #include <stdlib.h>// #include <math.h>// #include <string.h>//…

这是 meelo 原创的 IEEEXtreme极限编程大赛题解 IEEEXtreme全球极限编程挑战赛,是由IEEE主办,IEEE学生分会组织承办.IEEE会员参与指导和监督的.IEEE学生会员以团队为单位参与的全球性竞赛,参赛者要在24小时内完成一系列程序设计问题.竞赛自2007年起每年10月份举办一次,迄今为止已经举办9届,参赛规模不断扩大,去年已吸引全球2400多支队伍参赛. 参赛者必须是IEEE学生会员,参赛者以队为单位参加,每个队至多包含3名IEEE学生会员,其中最多有2名研究生.每支…

这是 meelo 原创的 IEEEXtreme极限编程大赛题解 Xtreme 10.0 - Inti Sets 题目来源 第10届IEEE极限编程大赛 https://www.hackerrank.com/contests/ieeextreme-challenges/challenges/inti-sets In order to motivate his Peruvian students, a teacher includes words in the Quechua language in…

博客中的文章均为 meelo 原创,请务必以链接形式注明 本文地址 Xtreme 10.0 - Dog Walking 题目来源 第10届IEEE极限编程大赛 https://www.hackerrank.com/contests/ieeextreme-challenges/challenges/dog-walking Your friend, Alice, is starting a dog walking business. She already has K dog walkers emp…

这是 meelo 原创的 IEEEXtreme极限编程比赛题解 Xtreme 10.0 - Painter's Dilemma 题目来源 第10届IEEE极限编程大赛 https://www.hackerrank.com/contests/ieeextreme-challenges/challenges/painters-dilemma Bob just got his first job as a house painter. Today, on his first day on the jo…

这是 meelo 原创的 IEEEXtreme极限编程大赛题解 Xtreme 10.0 - Ellipse Art 题目来源 第10届IEEE极限编程大赛 https://www.hackerrank.com/contests/ieeextreme-challenges/challenges/ellipse-art In IEEEXtreme 9.0, you met the famous artist, I.M. Blockhead. This year we want to introduc…

这是 meelo 原创的 IEEEXtreme极限编程大赛题解 Xtreme 10.0 - Counting Molecules 题目来源 第10届IEEE极限编程大赛 https://www.hackerrank.com/contests/ieeextreme-challenges/challenges/counting-molecules Your task is to count the number of molecules in a cup of soda which contains…

这是 meelo 原创的 IEEEXtreme极限编程大赛题解 Xtreme 10.0 - Checkers Challenge 题目来源 第10届IEEE极限编程大赛 https://www.hackerrank.com/contests/ieeextreme-challenges/challenges/draughts-1 Watch the following YouTube video clip. Your task is to compute the number of possibl…

这是 meelo 原创的 IEEEXtreme极限编程大赛题解 Xtreme 10.0 - Game of Stones 题目来源 第10届IEEE极限编程大赛 https://www.hackerrank.com/contests/ieeextreme-challenges/challenges/game-of-stones-1-1 Alice and Bob play a game. The game is turn based: Alice moves first, then Bob, a…