摘要：Problem 2Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:1... 阅读全文

摘要：#includeint main(void){ int n1, n2,n3; n1=333*(3+999)/2; n2=199*(5+995)/2; n3=66*(15+990)/2; printf("%d\n",n1+n2-n3); n1=getchar(); return 0;}Multiple... 阅读全文