Home > database >  notes
notes

Time:10-03

Accumulation and - cycle int/double sum=0 sum +=t; T change 1 1 2 3 5 x1=1; X2=1; X=x1 + x2. 2 x1 x2=; 1//2 x2=x1 x2=x + x2. 2 x=x1 + x2//the Fibonacci sequence, the former 20 # include "stdio.h" void main () {int x1=1, x2=1, x. int i; Printf (" % 5 d % d ", x1, x2); for(i=2; i<20;) {x=x1 + x2. i++; Printf (" % 5 d, x); If (I % 4==0) putchar (' \ n '); The x1 x2=; X2=x; }}//exercises 5 # include "stdio.h" void main () {int sum=0; Int t, a; Int I=0; int n; The scanf (" % d % d ", & amp; A, & amp; n); T=a; for(; i CodePudding user response:

Notes class knowledge, it is suggested that write personal blog, thank you.