189A Codeforces - Cut Ribbon

189A Codeforces - Cut Ribbon

Link ; http://codeforces.com/problemset/problem/189/A

Solution in C++

#include <bits/stdc++.h>

using namespace std;

#define pii pair<int,int>

typedef long long int lli;

int n,sol[4004],t;

int main()

{

    ios::sync_with_stdio(0);

    cin.tie(0);cout.tie(0);

    fill(sol+1,sol+4004,-10000);

    cin>>n;

    for(int i=0; i<3;i++)

    {

        cin>>t;

        for(int o=t;o<=n;o++)sol[o]=max(sol[o],sol[o-t]+1);

    }

    cout<<sol[n];

    return 0;

}

Share on Google Plus

About Mohamed Sobhi

My name is Mo.Sobhy ,I study at School excelling high school in Ain Shams ,Cairo
My hobbies is programming ,and web development ,playing chess and writing horror stories.