UVA 900 Brick Wall Patterns Solution


Solve in C++:

//AH Tonmoy
//Department of CSE ,Islamic University
#include<bits/stdc++.h>
using namespace std;
int main()
{
    {

        int ar[100000],n,i,r;
        while(cin>>n)
        {
            if(n==0)
                break;
            ar[1]=1;
            ar[2]=2;
            for(i=3; i<=n; i++)
                ar[i]=ar[i-2]+ar[i-1];
            cout<<ar[n]<<endl;
            ar[n]=0;


        }

    }
}

No comments

Most View Post

Recent post

Codeforces Round 925 (Div. 3) 1931D. Divisible Pairs Solution

    Problem Link  :   https://codeforces.com/contest/1931/problem/D S olution in C++: /// Author : AH_Tonmoy #include < bits / stdc ++. ...

Powered by Blogger.