UVA 496 - Simply Subsets

此题只需算出只属于a数组的元素个数，只属于b数组的元素个数和共同元素个数即可，注意输入两组数组的方式

代码如下：

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int main()
{
    int m,n,x,i=0,j,y,z;
    int a[10000],b[10000];
    char c;
    while(scanf("%d%c",&a[i++],&c)!=EOF)
    {
        m=1;
        n=1;
        while(c!='\n')
        {
            scanf("%d%c",&a[i++],&c);
            m++;
        }
        i=0;
        if(scanf("%d%c",&b[i++],&c)!=EOF)
        {
            while(c!='\n')
            {
                scanf("%d%c",&b[i++],&c);
                n++;
            }
        }
        x=0;
        for(i=0; i<m; ++i)
            for(j=0; j<n; ++j)
                if(a[i]==b[j])
                {
                    x++;
                    break;
                }
        y=m-x;
        z=n-x;
        if(x&&y&&z)
            cout<<"I'm confused!"<<endl;
        if(x&&(!y)&&(!z))
            cout<<"A equals B"<<endl;
        if(x&&y&&(!z))
            cout<<"B is a proper subset of A"<<endl;
        if(x&&z&&(!y))
            cout<<"A is a proper subset of B"<<endl;
        if(!x)
            cout<<"A and B are disjoint"<<endl;
        i=0;
    }
    return 0;
}