백준 1972번 놀라운 문자열

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

간단한 문자열 처리 문제였지만 파싱에 유의해야하는 문제였습니다.

각 단어마다 모든 가능한 D-쌍을 벡터에 넣어 중복되는지 확인하면 되는 문제였습니다.

#include <iostream>

#include <vector>

#include <string>

using namespace std;

 

int main(void)

{

        ios_base::sync_with_stdio(0);

        cin.tie(0);

       

        while (1)

        {

                 string s;

                 cin >> s;

 

                 if (s == "*")

                         break;

 

                 int len = 1;

                 bool surprising = true;

 

                 while (len < s.length())

                 {

                         vector<string> v;

                         for (int i = 0; i < s.length(); i++)

                         {

                                 if (i + len >= s.length())

                                          break;

                                 string temp = "";

                                 temp += s[i];

                                 temp += s[i + len];

                                 v.push_back(temp);

                         }

                         for(int i=0; i<v.size(); i++)

                                 for(int j=i+1; j<v.size(); j++)

                                          if (v[i] == v[j])

                                          {

                                                  surprising = false;

                                                  break;

                                          }

                         if (!surprising)

                                 break;

                         len++;

                 }

                 if (surprising)

                         cout << s << " is surprising.\n";

                 else

                         cout << s << " is NOT surprising.\n";

        }

        return 0;

}

개발환경:Visual Studio 2017

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