<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>문제풀이 on Sobamemil</title>
    <link>https://blog.sobamemil.com/tags/%EB%AC%B8%EC%A0%9C%ED%92%80%EC%9D%B4/</link>
    <description>Recent content in 문제풀이 on Sobamemil</description>
    <generator>Hugo</generator>
    <language>ko</language>
    <lastBuildDate>Mon, 19 Jun 2023 21:35:34 +0900</lastBuildDate>
    <atom:link href="https://blog.sobamemil.com/tags/%EB%AC%B8%EC%A0%9C%ED%92%80%EC%9D%B4/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>[Swift] 문자열 반복해서 출력하기 / LV.0, 181950, 프로그래머스</title>
      <link>https://blog.sobamemil.com/posts/188-swift-%EB%AC%B8%EC%9E%90%EC%97%B4-%EB%B0%98%EB%B3%B5%ED%95%B4%EC%84%9C-%EC%B6%9C%EB%A0%A5%ED%95%98%EA%B8%B0-lv0-181950-%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/</link>
      <pubDate>Mon, 19 Jun 2023 21:35:34 +0900</pubDate>
      <guid>https://blog.sobamemil.com/posts/188-swift-%EB%AC%B8%EC%9E%90%EC%97%B4-%EB%B0%98%EB%B3%B5%ED%95%B4%EC%84%9C-%EC%B6%9C%EB%A0%A5%ED%95%98%EA%B8%B0-lv0-181950-%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/</guid>
      <description>&lt;p&gt;&lt;strong&gt;문제:&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;문자열 str과 정수 n이 주어집니다.&lt;br&gt;
str이 n번 반복된 문자열을 만들어 출력하는 코드를 작성해 보세요.&lt;/p&gt;
&lt;p&gt;&lt;a href=&#34;https://school.programmers.co.kr/learn/courses/30/lessons/181950&#34;&gt;https://school.programmers.co.kr/learn/courses/30/lessons/181950&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;[프로그래머스&lt;/p&gt;
&lt;p&gt;코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요.&lt;/p&gt;
&lt;p&gt;programmers.co.kr](&lt;a href=&#34;https://school.programmers.co.kr/learn/courses/30/lessons/181950&#34;&gt;https://school.programmers.co.kr/learn/courses/30/lessons/181950&lt;/a&gt;)&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;제한사항:&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;1 ≤ str의 길이 ≤ 10&lt;/li&gt;
&lt;li&gt;1 ≤ n ≤ 5&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;풀이:&lt;/strong&gt;&lt;/p&gt;
&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;&#34;&gt;&lt;code class=&#34;language-cpp&#34; data-lang=&#34;cpp&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;let inp &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; readLine()&lt;span style=&#34;color:#f92672&#34;&gt;!&lt;/span&gt;.components(separatedBy: [&lt;span style=&#34;color:#e6db74&#34;&gt;&amp;#34; &amp;#34;&lt;/span&gt;]).map { &lt;span style=&#34;color:#960050;background-color:#1e0010&#34;&gt;$&lt;/span&gt;&lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt; }
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;let (s1, a) &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; (inp[&lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt;], Int(inp[&lt;span style=&#34;color:#ae81ff&#34;&gt;1&lt;/span&gt;])&lt;span style=&#34;color:#f92672&#34;&gt;!&lt;/span&gt;)
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;let resultString: String &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; {
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    var string: String &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; &lt;span style=&#34;color:#e6db74&#34;&gt;&amp;#34;&amp;#34;&lt;/span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;for&lt;/span&gt; _ in &lt;span style=&#34;color:#ae81ff&#34;&gt;0.&lt;/span&gt;.&lt;span style=&#34;color:#f92672&#34;&gt;&amp;lt;&lt;/span&gt;a {
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;        string &lt;span style=&#34;color:#f92672&#34;&gt;+=&lt;/span&gt; s1
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    }
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;    &lt;span style=&#34;color:#66d9ef&#34;&gt;return&lt;/span&gt; string
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;}()
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;print(resultString)
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;// 또는
&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;// let resultString = String(repeating: s1, count: a)
&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;// print(resultString)
&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;문자열을 n 번 반복해서 이어 붙이면 되는 문제입니다.&lt;/p&gt;</description>
    </item>
    <item>
      <title>[Swift] a와 b 출력하기 / LV.0, 181951, 프로그래머스</title>
      <link>https://blog.sobamemil.com/posts/187-swift-a%EC%99%80-b-%EC%B6%9C%EB%A0%A5%ED%95%98%EA%B8%B0-lv0-181951-%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/</link>
      <pubDate>Sun, 18 Jun 2023 19:30:04 +0900</pubDate>
      <guid>https://blog.sobamemil.com/posts/187-swift-a%EC%99%80-b-%EC%B6%9C%EB%A0%A5%ED%95%98%EA%B8%B0-lv0-181951-%ED%94%84%EB%A1%9C%EA%B7%B8%EB%9E%98%EB%A8%B8%EC%8A%A4/</guid>
      <description>&lt;p&gt;&lt;strong&gt;문제:&lt;/strong&gt;&lt;/p&gt;
&lt;p&gt;정수 a와 b가 주어집니다. 각 수를 입력받아 입출력 예와 같은 형식으로 출력하는 코드를 작성해 보세요.&lt;/p&gt;
&lt;p&gt;&lt;a href=&#34;https://school.programmers.co.kr/learn/courses/30/lessons/181951&#34;&gt;https://school.programmers.co.kr/learn/courses/30/lessons/181951&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;[프로그래머스&lt;/p&gt;
&lt;p&gt;코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요.&lt;/p&gt;
&lt;p&gt;programmers.co.kr](&lt;a href=&#34;https://school.programmers.co.kr/learn/courses/30/lessons/181951&#34;&gt;https://school.programmers.co.kr/learn/courses/30/lessons/181951&lt;/a&gt;)&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;제한사항:&lt;/strong&gt;&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;-100,000 ≤ a, b ≤ 100,000&lt;/li&gt;
&lt;/ul&gt;
&lt;p&gt;&lt;strong&gt;풀이:&lt;/strong&gt;&lt;/p&gt;
&lt;div class=&#34;highlight&#34;&gt;&lt;pre tabindex=&#34;0&#34; style=&#34;color:#f8f8f2;background-color:#272822;-moz-tab-size:4;-o-tab-size:4;tab-size:4;&#34;&gt;&lt;code class=&#34;language-cpp&#34; data-lang=&#34;cpp&#34;&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;let n &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; readLine()&lt;span style=&#34;color:#f92672&#34;&gt;!&lt;/span&gt;.components(separatedBy: [&lt;span style=&#34;color:#e6db74&#34;&gt;&amp;#34; &amp;#34;&lt;/span&gt;])
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;let (a, b) &lt;span style=&#34;color:#f92672&#34;&gt;=&lt;/span&gt; (n[&lt;span style=&#34;color:#ae81ff&#34;&gt;0&lt;/span&gt;], n[&lt;span style=&#34;color:#ae81ff&#34;&gt;1&lt;/span&gt;])
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;print(&lt;span style=&#34;color:#e6db74&#34;&gt;&amp;#34;a = \(a)&lt;/span&gt;&lt;span style=&#34;color:#ae81ff&#34;&gt;\n&lt;/span&gt;&lt;span style=&#34;color:#e6db74&#34;&gt;b = \(b)&amp;#34;&lt;/span&gt;)
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;
&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;// 또는 
&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;// print(&amp;#34;a =&amp;#34;, a)
&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;span style=&#34;display:flex;&#34;&gt;&lt;span&gt;&lt;span style=&#34;color:#75715e&#34;&gt;// print(&amp;#34;b =&amp;#34;, b)
&lt;/span&gt;&lt;/span&gt;&lt;/span&gt;&lt;/code&gt;&lt;/pre&gt;&lt;/div&gt;&lt;p&gt;두 가지의 정수를 공백 기준으로 나눈 후, 형식에 맞게 출력 해주면 되는 문제입니다.&lt;/p&gt;</description>
    </item>
    <item>
      <title>데이터 통신과 네트워킹 Chapter 1 개요 연습 문제 정답</title>
      <link>https://blog.sobamemil.com/posts/144-%EB%8D%B0%EC%9D%B4%ED%84%B0-%ED%86%B5%EC%8B%A0%EA%B3%BC-%EB%84%A4%ED%8A%B8%EC%9B%8C%ED%82%B9-chapter-1-%EA%B0%9C%EC%9A%94-%EC%97%B0%EC%8A%B5-%EB%AC%B8%EC%A0%9C-%EC%A0%95%EB%8B%B5/</link>
      <pubDate>Sun, 12 Apr 2020 23:42:49 +0900</pubDate>
      <guid>https://blog.sobamemil.com/posts/144-%EB%8D%B0%EC%9D%B4%ED%84%B0-%ED%86%B5%EC%8B%A0%EA%B3%BC-%EB%84%A4%ED%8A%B8%EC%9B%8C%ED%82%B9-chapter-1-%EA%B0%9C%EC%9A%94-%EC%97%B0%EC%8A%B5-%EB%AC%B8%EC%A0%9C-%EC%A0%95%EB%8B%B5/</guid>
      <description>&lt;p&gt;&lt;strong&gt;Chapter 1 개요 &lt;strong&gt;연습 문제 풀이(답)&lt;/strong&gt;&lt;/strong&gt;&lt;/p&gt;
&lt;ol&gt;
&lt;li&gt;근거리 통신망(LAN)은 _______ 로 정의된다.&lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;-&amp;gt; a. 네트워크의 기하학적 크기&lt;/p&gt;
&lt;ol start=&#34;2&#34;&gt;
&lt;li&gt;광역 통신망이 포괄할 수 있는 가장 큰 지역은 _______ 이다. &lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;-&amp;gt; d. 세계&lt;/p&gt;
&lt;ol start=&#34;3&#34;&gt;
&lt;li&gt;제안 표준은 적어도 2개의 성공적인 시도 후 _______ 표준 상태로 올라간다. &lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;-&amp;gt; c. 드래프트&lt;/p&gt;
&lt;ol start=&#34;4&#34;&gt;
&lt;li&gt;다음 중 데이터 통신 시스템의 구성요소가 아닌 것은? &lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;-&amp;gt; d. a, b, c 모두 정답 (a. 메시지, b. 송신자, c. 매체)&lt;/p&gt;
&lt;ol start=&#34;5&#34;&gt;
&lt;li&gt;다음 중 데이터 통신 시스템의 특성이 아닌 것은? &lt;/li&gt;
&lt;/ol&gt;
&lt;p&gt;-&amp;gt; d. a, b, c 모두 정답 (a. 전달성, b. 정확성, c. 지터)&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
