POJ 1013

#include"string.h"
char left[3][7],right[3][7],result[3][5];
bool isHeavy(char x )
{
    int i;
    for(i=0;i<3;i++)
    {
        switch(result[i][0])
        {
        case 'u':if(strchr(left[i],x)==NULL)return false;break;
        case 'e':if(strchr(left[i],x)!=NULL||strchr(right[i],x)!=NULL)return false;break;
        case 'd':if(strchr(right[i],x)==NULL)return false;break;
        }
    }
    return true;  //
}
bool isLight(char x )
{
    int i;
    for(i=0;i<3;i++)
    {
        switch(result[i][0])
        {
        case 'u':if(strchr(right[i],x)==NULL)return false;break;
        case 'e':if(strchr(left[i],x)!=NULL||strchr(right[i],x)!=NULL)return false;break;
        case 'd':if(strchr(left[i],x)==NULL)return false;break;
        }
    }
    return true; //
}
int main()
{
    int n;
    char c;        
    int i;
    scanf("%d",&n);
    while(n>0)
    {
        for( i=0;i<3;i++)
            scanf("%s%s%s",left[i],right[i],result[i]);
        for(c='A';c<='L';c++)
        {
            if(isLight(c))
            {
                printf("%c is the counterfeit coin and it is light. ",c);
                break;
            }
            if(isHeavy(c))
            {
                printf("%c is the counterfeit coin and it is heavy. ",c);
                break;
            }
        }
        n--;
    }
    return 0;
}

关注我的公众号，当然，如果你对Java, Scala, Python等技术经验，以及编程日记，感兴趣的话。 

技术网站地址： vmfor.com