백준 11723번 집합

문제 링크입니다: https://www.acmicpc.net/problem/11723

visited 배열을 이용하면 쉽게 풀 수 있는 문제였습니다.

#include <iostream>

#include <string>

#include <cstring>

using namespace std;

 

const int MAX = 20 + 1;

 

bool visited[MAX];

 

int main(void)

{

        ios_base::sync_with_stdio(0);

        cin.tie(0);

        int M;

        cin >> M;

 

        for (int i = 0; i < M; i++)

        {

                 int x;

                 string s;

                 cin >> s;

 

                 if (s == "add")

                 {

                         cin >> x;

 

                         visited[x] = true;

                 }

                 else if (s == "remove")

                 {

                         cin >> x;

 

                         visited[x] = false;

                 }

                 else if (s == "check")

                 {

                         cin >> x;

 

                         if (visited[x])

                                 cout << 1 << "\n";

                         else

                                 cout << 0 << "\n";

                 }

                 else if (s == "toggle")

                 {

                         cin >> x;

 

                         if (visited[x])

                                 visited[x] = false;

                         else

                                 visited[x] = true;

                 }

                 else if (s == "all")

                         memset(visited, true, sizeof(visited));

                 else

                         memset(visited, false, sizeof(visited));

        }

        return 0;

}

개발환경:Visual Studio 2017

지적, 조언, 질문 환영입니다! 댓글 남겨주세요~