Competitive/Collaborative Programming Class

/* Class:   CSC 2700 Programming Competitions
 * Prof:    Isaac Traxler
 * Name:    Matthew Gavin
 * Problem: 636 - Squares (III)
 *
 * Note: Spent a lot of time debugging the wrong thing... once I found the error of getting the "highest"
 *       I finally got it AC :\
 */ 


#include <cstdio>
#include <iostream>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <algorithm>

using namespace std;

//#define DEBUG  //comment this line to pull out print statements
#ifdef DEBUG
#define TAB '\t'
#define debug(a, end) cout << #a << ": " << a << end
#define dbg(end) end
#else
#define debug(a, end)
#define dbg(end)
#endif

typedef pair<int, int> point;
typedef vector<int> vi; //?
typedef vector<point> vp; //?

#define UN(v) SORT(v),v.erase(unique(v.begin(),v.end()),v.end())   
#define SORT(c) sort((c).begin(),(c).end())   
#define FOR(i,a,b) for (int  i=(a); i < (b); i++)    
#define REP(i,n) FOR(i,0,n)    
#define CL(a,b) memset(a,b,sizeof(a))
#define CL2d(a,b,x,y) memset(a, b, sizeof(a[0][0])*x*y)

/*global variables*/
typedef unsigned long long ull;

char num[15];
ull numb;
/*global variables*/

void dump()
{
    //dump data
}

bool getInput()
{
    //get input
    fgets(num, 15, stdin);
    sscanf(num, "%llu", &numb);
    debug(numb, endl);
    if (num[0] == '0' && (strlen(num) == 2 || strlen(num) == 1) ) return false;
    return true;
}

void unbase(ull& n, ull numbe, int base)
{
    n = 0;
    int exp = 0;
    while (numbe != 0)
    {
        //debug(numbe, TAB); debug(n, TAB); debug(exp, endl);
        //debug((long long)(pow(base, exp)), TAB); debug(numbe%10, endl);
        n += (long long)pow(base, exp++) * (numbe%10);
        numbe /= 10;
    }

}

void process()
{
    //process input
    long double rt;
    ull n = 0;
    int highest = 0;
    debug(num, TAB); debug(strlen(num), endl);
    REP(i, strlen(num))
    {
        highest = max(highest, num[i]-0x30);
        debug(num[i]-0x30, endl);
    }
    
    debug(highest, endl);
    FOR(i, highest+1, 100)
    {
        unbase(n, numb, i); //numb = strtoll(num, NULL, i);
        rt = sqrt((long double)n);
        debug(i, TAB);
        debug((long double)n, TAB);
        debug(numb, TAB);        
        debug(rt, endl);
        debug((long long)ceil(rt), TAB);
        debug((long long)floor(rt), TAB);
        debug(rt*rt, TAB);
        debug(((long long)rt*rt == n), endl);
        if ((long long)ceil(rt) == (long long)floor(rt))
        {
            cout << i << endl;
            break;
        }
    }
    
}

int main()
{
    while (getInput())
    {

        process();

        /*CLEAR GLOBAL VARIABLES!*/

        /*CLEAR GLOBAL VARIABLES!*/
    }

    return 0;
}

The statements and opinions included in these pages are those of  only. Any statements and 
          opinions included in these pages are not those of Louisiana 
          State University or the LSU Board of Supervisors.
© 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012, 2013, 2014