Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
129580 | 薛承谦 | 斐波那契数列 | C++ | Accepted | 2 MS | 272 KB | 387 | 2025-08-29 10:48:26 |
#include<iostream> using namespace std; int main(){ int a,j=0,k=1; cin>>a; //j = 0 ---0 //k = 1 ---1 //1 //j = 1 ---2 //k = 2 ---3 //2 //j = 3 ---4 //k = 5 ---5 //3 //j = 8 ---6 //k = 13 ---7 //4 //j = 21 ---8 //k = 44 ---9 for(int i=0;i<a/2;i++){ j+=k; k+=j; } if(a%2==1){ cout<<k; } else{ cout<<j; } }