[Codility]-FrogJmp

Python代码如下： def solution(X, Y, D): # write your code in Python 2.6 dis = Y-X if dis%D == 0: return dis/D else: return dis/D+1 pass

Question:codility Lesson3 FrogJmpMy answer:def solution(X, Y, D): distance = Y - X if distance % D == 0: return distance / D else: return distance / D + 1

// you can also use includes, for example: // #include int solution(int X, int Y, int D) { // write your code in C++98 int totalDis = Y-X; int remainder = totalDis%D; int quotient = t

Task description:A small frog wants to get to the other side of the road. The frog is currently located at position X and wants to get to a position greater than or equal to Y. The small frog always j...

所以我决定尝试Codility.第一项任务 – FrogJmp很容易,但令我惊讶的是我得了44％.解决方案,即使是正确的,在性能方面显然是不可接受的.原始解决方案public int solution2(int X, int Y, int D) {return (int) Math.ceil((float)(Y -X)/D);}所以我决定用不同的代码尝试它,没有浮点运算.public int s...

题意： 一行字符串由L和R组成，数组从1标号到n。青蛙从0的位置开始起跳，想到达n+1的位置，当他跳到L的时候只能往左跳，跳到R的时候只能往右跳，跳的范围由你来定。问最小的d是多少 思路： 这道题超级无敌水。你只需要从头到尾判断一边字符串，如果是L的话是一定不行的。这里我们只看位置是R的时候，因为当位置上是L的时候，一定是往左跳到里当前位置最近的R才能更好的跳到n+1这个位置。每次我们都用pos更...

FrogRiverOne Find the earliest time when a frog can jump to the other side of a river. Task description A small frog wants to get to the other side of a river. The frog is initially located on o...

传送门 题意： 开始位置在0，问能否跳到n+1位置 每步只能跳d 在1——n每个位置有方向，L,R，求d的最小值 思路： 只用找相邻两个R之间的最大值即可 代码： #include <iostream> #include <stdio.h> #include <algorithm> #include <string.h> #include <v...

Question: codility Lesson13 FibFrogMy Answer:def fibonacci(n): fib = [1,1] while fib[-1] < n: fib.append(fib[-1] + fib[-2]) return fib[1:-1]def solution(A): jumps = fibonacci(le

codility出了lesson 5了。(1) 合法括号序列，

Codeforces Round #627 (Div. 3) 比赛人数6434 [codeforces 1324C] Frog Jumps 一直向右+边界处理 总目录详见https://blog.csdn.net/mrcrack/article/details/103564004 也在线测评地址http://codeforces.com/contest/1324/problem/C...

The Fibonacci sequence is defined using the following recursive formula: F(0) = 0 F(1) = 1 F(M) = F(M - 1) + F(M - 2) if M >= 2 A small frog wants to get to the other side of a river.