UVA 900 - Brick Wall Patterns UVA • Aug 31, 2020 Problem PDFSolution:#include int main() { long long a[60],i,n; while(scanf("%lld",&n)==1) { if(n==0) break; a[0]=0; a[1]=1; for(i=2;i<=n+1;i++) a[i]=a[i-1]+a[i-2]; printf("%lld\n",a[n+1]); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/900/900.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