Timus : 1079 (Maximum)



// http://acm.timus.ru/problem.aspx?space=1&num=1079
// Runtime: 0.015s
// Tag: Adhoc

// @BEGIN_OF_SOURCE_CODE

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <sstream>
#include <cmath>
#include <bitset>
#include <utility>
#include <set>
#include <numeric>

#define INF_MAX 2147483647
#define INF_MIN -2147483647
#define pi acos(-1.0)
#define N 1000000
#define LL long long

#define For(i, a, b) for( int i = (a); i < (b); i++ )
#define Fors(i, sz) for( size_t i = 0; i < sz.size (); i++ )
#define Fore(it, x) for(typeof (x.begin()) it = x.begin(); it != x.end (); it++)
#define Set(a, s) memset(a, s, sizeof (a))
#define Read(r) freopen(r, "r", stdin)
#define Write(w) freopen(w, "w", stdout)

using namespace std;

int main ()
{
    int arr [100000 + 10];
    arr [0] = 0;
    arr [1] = 1;

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

    int n;

    while ( scanf ("%d", &n) && n ) {
        int maxi = INF_MIN;
        for ( int i = 0; i <= n; i++ ) maxi = max ( maxi, arr [i]);
        printf ("%d\n", maxi);
     }

    return 0;
}

// @END_OF_SOURCE_CODE
Advertisements

Leave a Reply

Fill in your details below or click an icon to log in:

WordPress.com Logo

You are commenting using your WordPress.com account. Log Out / Change )

Twitter picture

You are commenting using your Twitter account. Log Out / Change )

Facebook photo

You are commenting using your Facebook account. Log Out / Change )

Google+ photo

You are commenting using your Google+ account. Log Out / Change )

Connecting to %s