hackerrank刷题
文章平均质量分 71
从零开始学习的ZHL
已工作但很弱鸡的学习者
展开
-
Climbing the Leaderboard
Alice is playing an arcade game and wants to climb to the top of the leaderboard. Can you help her track her ranking as she beats each level? The game uses Dense Ranking, so its leaderboard works li原创 2017-12-21 19:12:26 · 413 阅读 · 0 评论 -
Breaking Sticks
题目:(来自world codesprint12)大意:给你一个数,把这个分解,每次分解时会得到一个因数,将这些因数相加。求出能够得到的最大因数和思路:当这个数是质数时,就不能再分解了,这个时候就是最大的。一直对n = n/d进行分解,直到n是质数。由于n = p *q,所以分解时有可能分成p个部分,再分成q,也有可能反过来,但是p*q = q*p。我们需要一个序列,p1>p2>p原创 2017-12-25 22:01:24 · 168 阅读 · 0 评论 -
Red Knight's Shortest Path
题目太长,就不写了,出自:https://www.hackerrank.com/contests/world-codesprint-12/challenges/red-knights-shortest-path思路:用广度优先搜索寻找终点,广度优先搜索是求最短路径的一种方法。注意保存路径的方法,比如a->b->c,不管c前面的b是怎么走的,c始终是在b的基础上转移过来的,所以c的路径就是b的路原创 2017-12-25 22:18:11 · 211 阅读 · 0 评论 -
The Salesman
题目:https://www.hackerrank.com/contests/world-codesprint-12/challenges/the-salesman思路:贪心#include using namespace std;int minimumTime(vector x) { // Return the minimum time needed to visit原创 2017-12-25 22:22:35 · 192 阅读 · 0 评论 -
Forming a Magic Square
题目:We define a magic square to be an matrix of distinct positive integers from to where the sum of any row, column, or diagonal (of length ) is always equal to the same number (i.e., the原创 2017-12-16 21:03:30 · 682 阅读 · 0 评论 -
Multiples of 3 and 5
题目:If we list all the natural numbers below that are multiples of or , we get and . The sum of these multiples is .Find the sum of all the multiples of or below .大意:找出N以下的所有3,5的倍数原创 2017-12-16 21:09:13 · 653 阅读 · 0 评论 -
Extra Long Factorials
大数阶乘思路:利用个大数组保存结果,定义个数保存进位,定义个数保存数位。从a[0]开始,依次往后乘,低位是相乘后的余数,高位是乘的数加上进位。整个过程就是模拟我们做竖式的乘法int main(){ int n; cin >> n; int res[2000]; res[0]=1; int digit = 1; int jinwei = 0原创 2017-12-18 16:47:49 · 201 阅读 · 0 评论