1278: Simply Subsets

最新推荐文章于 2024-03-09 11:39:09 发布

kongming_acm

最新推荐文章于 2024-03-09 11:39:09 发布

阅读量559

点赞数

分类专栏： joj acm_stl 文章标签： iterator insert equals each pair manager

本文链接：https://blog.csdn.net/kongming_acm/article/details/5725886

版权

joj acm_stl 专栏收录该内容

8 篇文章 0 订阅

订阅专栏

1278: Simply Subsets

Result	TIME Limit	MEMORY Limit	Run Times	AC Times	JUDGE
	3s	8192K	942	132	Standard

After graduating from the University of Notre Dame, you obtained a job at Top Shelf Software, Inc., as an entry-level computer engineer. On the first day, your manager sits down with you and tasks you with the following job: ``We want to see how well you understand computer programming and the abstract science behind it. As an evaluation for all of our new hires, we require them to write a program to determine the relationship between pairs of sets. I'm quite sure that you'll do well; my confidence is high. Here's a list of requirements for what the program should do. Good luck.''

Input

Your program should accept an even number of lines of text. Each pair of lines will represent two sets; the first line represents set A, the second line represents set B. Each line of text (set) will be a list of distinct integers.

Output

After each pair of lines has been read in, the sets should be compared and one of the following responses should be output:

A is a proper subset of B
B is a proper subset of A
A equals B
A and B are disjoint
I'm confused!

Sample Input

Sample Output

A equals B
B is a proper subset of A
A is a proper subset of B
A and B are disjoint
I'm confused!

This problem is used for contest: 117

#include<iostream>
#include<set>
#include<algorithm>
#include<string>
#include<sstream>
using namespace std;
int main()
{
    string str;int n;
    while(getline(cin,str))
    {
        set< int > a,b;
        for(istringstream sin(str);sin>>n;) a.insert(n);
        str.clear();
        getline(cin,str);
        for(istringstream sin(str);sin>>n;) b.insert(n);
        if(a==b) {printf("A equals B/n");continue;}
        //q为a,b的并集
        set< int > q;
        set_union(a.begin(),a.end(),b.begin(),b.end(),insert_iterator< set < int > >(q,q.begin()));
        //p为a,b的交集
        set< int > p;
        set_intersection(a.begin(),a.end(),b.begin(),b.end(),insert_iterator< set < int > >(p,p.begin()));
        //v为a,b的差集
        set< int > v;
        set_difference(a.begin(),a.end(),b.begin(),b.end(),insert_iterator< set < int > >(v,v.begin()));
        //u为a,b的环和
        set< int > u;
        set_symmetric_difference(a.begin(),a.end(),b.begin(),b.end(),insert_iterator< set < int > >(u,u.begin()));
        //..........
        if(q==b) {printf("A is a proper subset of B/n");continue;}
        if(q==a) {printf("B is a proper subset of A/n");continue;}
        if(p.size()==0) {printf("A and B are disjoint/n");continue;}
        printf("I'm confused!/n");
    }
    return 0;
}