标签:数字 step import str scribe rgs [] integer pre
输入为一个正整数N(1 ≤ N ≤ 1,000,000)
输出一个最小的步数变为Fibonacci数"
15
2
1 import java.util.Scanner; 2 3 /** 4 * 5 * Fibonacci 数列 6 * @author Dell 7 * 8 */ 9 public class Main { 10 11 static public int n = 15; 12 static public int x = 0; 13 static public int y = 1; 14 static public int step; 15 static public void f() { 16 while(y<n) { 17 int i = y; 18 y = x+y; 19 x = i; 20 } 21 step = Math.min(Math.abs(x-n),Math.abs(y-n)); 22 } 23 public static void main(String[] args) { 24 25 Scanner sc =new Scanner(System.in); 26 n = Integer.parseInt(sc.nextLine().trim()); 27 f(); 28 System.out.println(step); 29 } 30 }
标签:数字 step import str scribe rgs [] integer pre
原文地址:https://www.cnblogs.com/the-wang/p/8979405.html