【水题】Codeforces Round #485 (Div. 2) A. Infinity Gauntlet

题目链接：http://codeforces.com/contest/987/problem/A

  

 题目大意：

　　输入正整数n与n种看到的颜色，根据颜色来判断宝石，输出未看到的宝石的数量与名称

#include <bits/stdc++.h>

using namespace std;

#define ll long long


map<string,int> m;
string ss[] = {"purple","green","blue","orange","red","yellow"};
int book[] = {0,0,0,0,0,0,0};
string sss[] = {"Power","Time","Space","Soul","Reality","Mind"};
int main()
{
    int n;
    scanf("%d",&n);
    int p = 6-n;
    string s;
    for(int i = 1;i <= n;++i)
    {
        cin >> s;
        m[s] = 1;
    }
    cout << p << endl;
    for(int i = 0;i < 6;++i)
    {
        if(m[ss[i]] == 0)
        {
            book[i] = 1;
        }
    }
    for(int i = 0;i < 6;++i)
    {
        if(book[i])
            cout << sss[i] << endl;
    }
    return 0;
}