package day07;
//求斐波那契数列的前30项,每输出8位就换行
public class Fibonacci {
public static void main(String[] args) {
int a = 1;
int b = 1;
int c;
System.out.print(a+" "+b+" ");
//这里的i控制项数
int t = 0;
for (int i = 3; i <= 24 ; i++) {
c = a + b;
a = b;
b = c;
System.out.print(c+" ");
t++;
if(t == 8){
System.out.println();
t = 0;
}
}
}
}
//求斐波那契数列的前30项,每输出8位就换行
public class Fibonacci {
public static void main(String[] args) {
int a = 1;
int b = 1;
int c;
System.out.print(a+" "+b+" ");
//这里的i控制项数
int t = 0;
for (int i = 3; i <= 24 ; i++) {
c = a + b;
a = b;
b = c;
System.out.print(c+" ");
t++;
if(t == 8){
System.out.println();
t = 0;
}
}
}
}