Dropquest 2012 - Answer 1 Solution as C Program

gistfile1.txt

int test(int a, int b, int c, int d, int e)
{
    if ((a*b) != 24) return 0;
    if (d != (b/2)) return 0;
    if ((a+c)!=(d+e)) return 0;
    if ((a+b+c+d+e) != 26) return 0;
    
    // count occurences of digits
    int counts[10] = {0,0,0,0,0,0,0,0,0,0};
    
    counts[a]++;
    counts[b]++;
    counts[c]++;
    counts[d]++;
    counts[e]++;
    
    for (int i=0;i<10;i++)
    {
        if (counts[i]>1)
        {
            return 1;
        }
    }
    
    return 0;
}


int main(int argc, const char * argv[])
{
    for (int a=0;a<10;a++)
    {
        for (int b=0;b<10;b++)
        {
            for (int c=0;c<10;c++)
            {
                for (int d=0;d<10;d++)
                {
                    for (int e=0;e<10;e++)
                    {
                        if (test(a, b, c, d, e))
                        {
                           printf("valid answer: a=%d, b=%d, c=%d, d=%d, e=%d\n", a,b,c,d,e);
                        }
                    }
                }
            }
        }
    }
    
    return 0;
}