Google Code Jam : Snapper Chain (large)


// @BEGIN_OF_SOURCE_CODE
// large input verdict : Correct!

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <sstream>
#include <set>
#include <math.h>
#define N 1000000
using namespace std;


int main ()
{
    //freopen ("A-large.in", "r", stdin);
    //freopen ("A-large.out", "w", stdout);
    int T;
    scanf ("%d", &T);
    int cases = 0;

    while ( T-- ) {
        int n;
        int k;
        scanf ("%d %d", &n, &k);

        int power = 1;

        for ( int i = 0; i < n; i++ )
            power *= 2;

        if ( k % power == power - 1 )
            printf ("Case #%d: ON\n", ++cases);
        else
            printf ("Case #%d: OFF\n", ++cases);
    }

    return 0;
}

// @END_OF_SOURCE_CODE

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