Timus online judge 1079. Maximum

Problem link


A solution in c++

#include<bits/stdc++.h>

using namespace std;

/// Typedef
typedef long long ll;

#define sc1(a) scanf("%lld",&a)
#define sc2(a,b) scanf("%lld %lld",&a,&b)

#define pf1(a) printf("%lld\n",a)
#define pf2(a,b) printf("%lld %lld\n",a,b)

#define mx 100005
#define mod 10000007


int main()
{
    //freopen ("input.txt", "r", stdin);
    ll tc,n,m,a,b;

    ll arr[mx];
    arr[0] = 0;
    arr[1] = 1;

    for(ll i = 1; i < mx/2; i++){
        arr[i*2] = arr[i];
        arr[i*2 + 1] = arr[i] + arr[i+1];
    }

    while(sc1(n) && n){
        ll ck = 0;
         for(ll i = 0; i <= n; i++){
            ck = max(ck, arr[i]);
         }

         pf1(ck);
    }

}