백준 11944번 NN

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

string을 적절히 이용하면 쉽게 풀 수 있는 문제였습니다.

#include <iostream>

#include <string>

using namespace std;

 

int main(void)

{

        ios_base::sync_with_stdio(0);

        cin.tie(0);

        string N;

        int M;

        cin >> N >> M;

 

        int len = N.length();

        int num = stoi(N);

        string result;

        if (len * num >= M)

        {

                 int cnt = 0;

                 while (1)

                 {

                         if (cnt + len > M)

                                 break;

 

                         result += N;

                         cnt += len;

                 }

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

                         result += N[i];

        }

        else

        {

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

                         result += N;

        }

        cout << result << "\n";

        return 0;

}

개발환경:Visual Studio 2017

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