Timus : 1044 (Lucky Tickets. Easy!)



// http://acm.timus.ru/problem.aspx?space=1&num=1044
// Runtime: 0.031s
// Tag: Memoizition 


// @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 1000
#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;

bool isLucky (int n)
{
    char a [10];
    sprintf (a, "%08d", n);

    int sum1 = (a [0] - '0') + (a [1] - '0') + (a [2] - '0') + (a [3] - '0');
    int sum2 = (a [4] - '0') + (a [5] - '0') + (a [6] - '0') + (a [7] - '0');

    if ( sum1 == sum2 ) return true;
    return false;
}

int main ()
{
    // 2 - 10, 4 - 670, 6 - 55252, 8 - 4816030

    int n;

    while ( scanf ("%d", &n) != EOF ) {
        switch (n) {
            case 2: printf ("10\n"); break;
            case 4: printf ("670\n"); break;
            case 6: printf ("55252\n"); break;
            case 8: printf ("4816030\n"); break;
        }
    }

	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