UVA 12459 - Bees' ancestors UVA • Sep 1, 2020 Problem PDFSolution:#include #include #include #include #include #include #include #include #include #include #include #include #define ll long long #define sc scanf #define pf printf #define Pi 2*acos(0.0) using namespace std; int main() { ll n; while(sc("%lld",&n)==1) { ll a=2; ll b=1; ll sum=0; if(n==0) break; else if(n==1){ pf("1\n"); continue; } else if(n==2){ pf("2\n"); continue; } while(n>=3) { sum=a+b; b=a; a=sum; n--; } pf("%lld\n",sum); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/12459/12459.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read