<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0">
  <channel>
    <title>jyamethyst21 님의 블로그</title>
    <link>https://jyamethyst21.tistory.com/</link>
    <description>jyamethyst21 님의 블로그 입니다.</description>
    <language>ko</language>
    <pubDate>Tue, 2 Jun 2026 18:53:34 +0900</pubDate>
    <generator>TISTORY</generator>
    <ttl>100</ttl>
    <managingEditor>jyamethyst21</managingEditor>
    <image>
      <title>jyamethyst21 님의 블로그</title>
      <url>https://tistory1.daumcdn.net/tistory/7339653/attach/0caa4be6535443babf98a932cc0a1dba</url>
      <link>https://jyamethyst21.tistory.com</link>
    </image>
    <item>
      <title>프로그래머스 - '세균 증식' (PYTHON 풀이)</title>
      <link>https://jyamethyst21.tistory.com/368</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;문제:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;figure class=&quot;imageblock alignCenter&quot; data-ke-mobileStyle=&quot;widthOrigin&quot; data-origin-width=&quot;737&quot; data-origin-height=&quot;607&quot;&gt;&lt;span data-url=&quot;https://blog.kakaocdn.net/dn/vAK7E/dJMcaarZIsI/Fcn4hYJ19h7vPWBlK774g0/img.png&quot; data-phocus=&quot;https://blog.kakaocdn.net/dn/vAK7E/dJMcaarZIsI/Fcn4hYJ19h7vPWBlK774g0/img.png&quot;&gt;&lt;img src=&quot;https://blog.kakaocdn.net/dn/vAK7E/dJMcaarZIsI/Fcn4hYJ19h7vPWBlK774g0/img.png&quot; srcset=&quot;https://img1.daumcdn.net/thumb/R1280x0/?scode=mtistory2&amp;fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FvAK7E%2FdJMcaarZIsI%2FFcn4hYJ19h7vPWBlK774g0%2Fimg.png&quot; onerror=&quot;this.onerror=null; this.src='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png'; this.srcset='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png';&quot; loading=&quot;lazy&quot; width=&quot;737&quot; height=&quot;607&quot; data-origin-width=&quot;737&quot; data-origin-height=&quot;607&quot;/&gt;&lt;/span&gt;&lt;/figure&gt;
&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;세균 수와 경과한 시간이 주어질 때, 해당 시간 이후에 존재하는 세균 수를 바로 출력하면 된다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;풀이:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;pre id=&quot;code_1780373307508&quot; class=&quot;bash&quot; data-ke-language=&quot;bash&quot; data-ke-type=&quot;codeblock&quot;&gt;&lt;code&gt;def solution(n, t):
    return n * (2 ** t)&lt;/code&gt;&lt;/pre&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;</description>
      <category>CODING  </category>
      <category>Coding</category>
      <category>programmers</category>
      <category>Python</category>
      <category>세균 증식</category>
      <category>코딩</category>
      <category>파이썬</category>
      <category>프로그래머스</category>
      <author>jyamethyst21</author>
      <guid isPermaLink="true">https://jyamethyst21.tistory.com/368</guid>
      <comments>https://jyamethyst21.tistory.com/368#entry368comment</comments>
      <pubDate>Tue, 2 Jun 2026 13:10:55 +0900</pubDate>
    </item>
    <item>
      <title>프로그래머스 - '약수 구하기' (PYTHON 풀이)</title>
      <link>https://jyamethyst21.tistory.com/367</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;문제:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;figure class=&quot;imageblock alignCenter&quot; data-ke-mobileStyle=&quot;widthOrigin&quot; data-origin-width=&quot;703&quot; data-origin-height=&quot;578&quot;&gt;&lt;span data-url=&quot;https://blog.kakaocdn.net/dn/72H0b/dJMcafUmbZB/gS8ew2fXpkbiZtFWvknvkK/img.png&quot; data-phocus=&quot;https://blog.kakaocdn.net/dn/72H0b/dJMcafUmbZB/gS8ew2fXpkbiZtFWvknvkK/img.png&quot;&gt;&lt;img src=&quot;https://blog.kakaocdn.net/dn/72H0b/dJMcafUmbZB/gS8ew2fXpkbiZtFWvknvkK/img.png&quot; srcset=&quot;https://img1.daumcdn.net/thumb/R1280x0/?scode=mtistory2&amp;fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2F72H0b%2FdJMcafUmbZB%2FgS8ew2fXpkbiZtFWvknvkK%2Fimg.png&quot; onerror=&quot;this.onerror=null; this.src='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png'; this.srcset='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png';&quot; loading=&quot;lazy&quot; width=&quot;703&quot; height=&quot;578&quot; data-origin-width=&quot;703&quot; data-origin-height=&quot;578&quot;/&gt;&lt;/span&gt;&lt;/figure&gt;
&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;/span&gt;정수 n이 있을 때 해당 정수의 약수를 오름차순으로 전부 출력하는 문제이다. 이때 출력 형식은 배열이어야 한다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;풀이:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;pre id=&quot;code_1780241529901&quot; class=&quot;bash&quot; data-ke-language=&quot;bash&quot; data-ke-type=&quot;codeblock&quot;&gt;&lt;code&gt;def solution(n):
    result = []
    for i in range(1,n+1):
        if n % i == 0:
            result.append(i)
    return result&lt;/code&gt;&lt;/pre&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;약수는 해당 수로 나눴을 때 딱 떨어지기 때문에 해당 특성을 활용하여 문제를 풀면 된다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;먼저 결과값을 담을 result 리스트를 선언하고, 반복문을 활용하여 1부터 n까지 1씩 더하면서 나눠 떨어지는지 확인한다. 이후 떨어진다면 결과 리스트인 result에 해당 값을 추가하고 마지막으로 해당 리스트를 반환하면 된다.&lt;/p&gt;</description>
      <category>CODING  </category>
      <category>Coding</category>
      <category>programmers</category>
      <category>Python</category>
      <category>약수 구하기</category>
      <category>코딩</category>
      <category>파이썬</category>
      <category>프로그래머스</category>
      <author>jyamethyst21</author>
      <guid isPermaLink="true">https://jyamethyst21.tistory.com/367</guid>
      <comments>https://jyamethyst21.tistory.com/367#entry367comment</comments>
      <pubDate>Mon, 1 Jun 2026 00:33:32 +0900</pubDate>
    </item>
    <item>
      <title>프로그래머스 - '제곱수 판별하기' (PYTHON 풀이)</title>
      <link>https://jyamethyst21.tistory.com/366</link>
      <description>&lt;p style=&quot;color: #333333; text-align: start;&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;문제:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;figure class=&quot;imageblock alignCenter&quot; data-ke-mobileStyle=&quot;widthOrigin&quot; data-origin-width=&quot;747&quot; data-origin-height=&quot;348&quot;&gt;&lt;span data-url=&quot;https://blog.kakaocdn.net/dn/rG2TI/dJMcaaFxh1L/lPlMAz2HgLXKftqv6atBb0/img.png&quot; data-phocus=&quot;https://blog.kakaocdn.net/dn/rG2TI/dJMcaaFxh1L/lPlMAz2HgLXKftqv6atBb0/img.png&quot;&gt;&lt;img src=&quot;https://blog.kakaocdn.net/dn/rG2TI/dJMcaaFxh1L/lPlMAz2HgLXKftqv6atBb0/img.png&quot; srcset=&quot;https://img1.daumcdn.net/thumb/R1280x0/?scode=mtistory2&amp;fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FrG2TI%2FdJMcaaFxh1L%2FlPlMAz2HgLXKftqv6atBb0%2Fimg.png&quot; onerror=&quot;this.onerror=null; this.src='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png'; this.srcset='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png';&quot; loading=&quot;lazy&quot; width=&quot;747&quot; height=&quot;348&quot; data-origin-width=&quot;747&quot; data-origin-height=&quot;348&quot;/&gt;&lt;/span&gt;&lt;/figure&gt;
&lt;/p&gt;
&lt;p style=&quot;color: #333333; text-align: start;&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p style=&quot;color: #333333; text-align: start;&quot; data-ke-size=&quot;size16&quot;&gt;n을 입력받았을 때, n이 제곱수라면 1, 아니라면 2를 출력하는 문제이다.&lt;/p&gt;
&lt;p style=&quot;color: #333333; text-align: start;&quot; data-ke-size=&quot;size16&quot;&gt;제곱수란 '2*2=4'와 같이 같은 수를 곱한 수를 의미한다.&lt;/p&gt;
&lt;p style=&quot;color: #333333; text-align: start;&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p style=&quot;color: #333333; text-align: start;&quot; data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;풀이:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;pre id=&quot;code_1780103064847&quot; class=&quot;angelscript&quot; style=&quot;background-color: #f8f8f8; color: #383a42; text-align: start;&quot; data-ke-type=&quot;codeblock&quot; data-ke-language=&quot;bash&quot;&gt;&lt;code&gt;def solution(n):
    for i in range(1, 1001):
        if i*i==n:
            return 1
        elif i*i&amp;gt;n:
            return 2
    return 2&lt;/code&gt;&lt;/pre&gt;
&lt;p style=&quot;color: #333333; text-align: start;&quot; data-ke-size=&quot;size16&quot;&gt;문제 자체에 1,000,000까지 제한이 있기 때문에 반복문을 활용하여서 1부터 1000까지만 반복문을 돌도록 하였다.&lt;/p&gt;
&lt;p style=&quot;color: #333333; text-align: start;&quot; data-ke-size=&quot;size16&quot;&gt;i를 제곱했을 때 n이라면 1을 리턴하고(제곱수이므로), 그렇지 않으면 2를 리턴하는 로직으로 코드를 작성하였다.&lt;/p&gt;
&lt;p style=&quot;color: #333333; text-align: start;&quot; data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p style=&quot;color: #333333; text-align: start;&quot; data-ke-size=&quot;size16&quot;&gt;n보다 i*i가 큰 경우여야 하는 이유는 작은 경우로 작성 시 문제가 발생하기 때문이다.&lt;/p&gt;
&lt;p style=&quot;color: #333333; text-align: start;&quot; data-ke-size=&quot;size16&quot;&gt;예를 들어, 부등호가 '&amp;lt;'이고&amp;nbsp; n이 9, i가 1인 경우 3이 제곱수이지만 '1&amp;lt;9'의 조건이 되어 2가 리턴된다.&lt;/p&gt;
&lt;p style=&quot;color: #333333; text-align: start;&quot; data-ke-size=&quot;size16&quot;&gt;원하지 않은 값이 리턴되므로 상기와 같이 '&amp;gt;'로 작성을 하여야 한다.&lt;/p&gt;</description>
      <category>CODING  </category>
      <category>Coding</category>
      <category>programmers</category>
      <category>Python</category>
      <category>제곱수 판별하기</category>
      <category>코딩</category>
      <category>파이썬</category>
      <category>프로그래머스</category>
      <author>jyamethyst21</author>
      <guid isPermaLink="true">https://jyamethyst21.tistory.com/366</guid>
      <comments>https://jyamethyst21.tistory.com/366#entry366comment</comments>
      <pubDate>Sun, 31 May 2026 00:04:29 +0900</pubDate>
    </item>
    <item>
      <title>프로그래머스 - '문자열안에 문자열' (PYTHON 풀이)</title>
      <link>https://jyamethyst21.tistory.com/364</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;문제:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;figure class=&quot;imageblock alignCenter&quot; data-ke-mobileStyle=&quot;widthOrigin&quot; data-origin-width=&quot;731&quot; data-origin-height=&quot;484&quot;&gt;&lt;span data-url=&quot;https://blog.kakaocdn.net/dn/bX3UOc/dJMcaaFwxig/oRbID2hnygDBIETMMs6Qb1/img.png&quot; data-phocus=&quot;https://blog.kakaocdn.net/dn/bX3UOc/dJMcaaFwxig/oRbID2hnygDBIETMMs6Qb1/img.png&quot;&gt;&lt;img src=&quot;https://blog.kakaocdn.net/dn/bX3UOc/dJMcaaFwxig/oRbID2hnygDBIETMMs6Qb1/img.png&quot; srcset=&quot;https://img1.daumcdn.net/thumb/R1280x0/?scode=mtistory2&amp;fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FbX3UOc%2FdJMcaaFwxig%2FoRbID2hnygDBIETMMs6Qb1%2Fimg.png&quot; onerror=&quot;this.onerror=null; this.src='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png'; this.srcset='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png';&quot; loading=&quot;lazy&quot; width=&quot;731&quot; height=&quot;484&quot; data-origin-width=&quot;731&quot; data-origin-height=&quot;484&quot;/&gt;&lt;/span&gt;&lt;/figure&gt;
&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;str1 안에 str2가 들어있으면 1을 그렇지 않으면 2를 출력하는 문제이다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;예를 들어 str1이 'appleabc'이고 str2가 'apple'라면 str1에 포함이 되므로, 1을 출력하면 된다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;풀이:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;pre id=&quot;code_1780099790974&quot; class=&quot;bash&quot; data-ke-language=&quot;bash&quot; data-ke-type=&quot;codeblock&quot;&gt;&lt;code&gt;def solution(str1, str2):
    if str2 in str1:
        return 1
    else:
        return 2&lt;/code&gt;&lt;/pre&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;str1 안에 str2가 존재하면 1을 리턴, 그렇지 않으면 2를 리턴하는 문제이다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;if ~ in문을 통해 문제를 바로 풀 수 있다.&lt;/p&gt;</description>
      <category>CODING  </category>
      <category>Coding</category>
      <category>programmers</category>
      <category>Python</category>
      <category>문자열안에 문자열</category>
      <category>코딩</category>
      <category>파이썬</category>
      <category>프로그래머스</category>
      <author>jyamethyst21</author>
      <guid isPermaLink="true">https://jyamethyst21.tistory.com/364</guid>
      <comments>https://jyamethyst21.tistory.com/364#entry364comment</comments>
      <pubDate>Sat, 30 May 2026 09:13:30 +0900</pubDate>
    </item>
    <item>
      <title>프로그래머스 - '자릿수 더하기' (PYTHON 풀이)</title>
      <link>https://jyamethyst21.tistory.com/363</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;문제:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;figure class=&quot;imageblock alignCenter&quot; data-ke-mobileStyle=&quot;widthOrigin&quot; data-origin-width=&quot;445&quot; data-origin-height=&quot;349&quot;&gt;&lt;span data-url=&quot;https://blog.kakaocdn.net/dn/KQXm8/dJMcadIRrBW/vBOlkkpj6w9tNB4YMeaZSk/img.png&quot; data-phocus=&quot;https://blog.kakaocdn.net/dn/KQXm8/dJMcadIRrBW/vBOlkkpj6w9tNB4YMeaZSk/img.png&quot;&gt;&lt;img src=&quot;https://blog.kakaocdn.net/dn/KQXm8/dJMcadIRrBW/vBOlkkpj6w9tNB4YMeaZSk/img.png&quot; srcset=&quot;https://img1.daumcdn.net/thumb/R1280x0/?scode=mtistory2&amp;fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FKQXm8%2FdJMcadIRrBW%2FvBOlkkpj6w9tNB4YMeaZSk%2Fimg.png&quot; onerror=&quot;this.onerror=null; this.src='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png'; this.srcset='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png';&quot; loading=&quot;lazy&quot; width=&quot;445&quot; height=&quot;349&quot; data-origin-width=&quot;445&quot; data-origin-height=&quot;349&quot;/&gt;&lt;/span&gt;&lt;/figure&gt;
&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;정수 n을 입력받고, 각 자리의 수를 전부 돌면서 합을 구하는 문제이다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;풀이:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;pre id=&quot;code_1780013076117&quot; class=&quot;bash&quot; data-ke-language=&quot;bash&quot; data-ke-type=&quot;codeblock&quot;&gt;&lt;code&gt;def solution(n):
    total = 0
    for i in str(n):
        total += int(i)
    return total&lt;/code&gt;&lt;/pre&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;우선 정수 형태의 수는 반복 가능한 객체가 아니기 때문에 반복문을 통해 수를 바로 더할 수 없다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;그래서 str 형태로 변환을 해준 뒤 더할 때만 int로 바꾸어서 total 변수에 더한 뒤 이를 리턴하면 된다.&lt;/p&gt;</description>
      <category>CODING  </category>
      <category>Coding</category>
      <category>programmers</category>
      <category>Python</category>
      <category>자릿수 더하기</category>
      <category>코딩</category>
      <category>파이썬</category>
      <category>프로그래머스</category>
      <author>jyamethyst21</author>
      <guid isPermaLink="true">https://jyamethyst21.tistory.com/363</guid>
      <comments>https://jyamethyst21.tistory.com/363#entry363comment</comments>
      <pubDate>Fri, 29 May 2026 09:05:39 +0900</pubDate>
    </item>
    <item>
      <title>프로그래머스 - 'n의 배수 고르기' (PYTHON 풀이)</title>
      <link>https://jyamethyst21.tistory.com/362</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;문제:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;figure class=&quot;imageblock alignCenter&quot; data-ke-mobileStyle=&quot;widthOrigin&quot; data-origin-width=&quot;713&quot; data-origin-height=&quot;438&quot;&gt;&lt;span data-url=&quot;https://blog.kakaocdn.net/dn/sdDbN/dJMcaf7MZRG/kvx7kNB9UU4fW03xAcwxLk/img.png&quot; data-phocus=&quot;https://blog.kakaocdn.net/dn/sdDbN/dJMcaf7MZRG/kvx7kNB9UU4fW03xAcwxLk/img.png&quot;&gt;&lt;img src=&quot;https://blog.kakaocdn.net/dn/sdDbN/dJMcaf7MZRG/kvx7kNB9UU4fW03xAcwxLk/img.png&quot; srcset=&quot;https://img1.daumcdn.net/thumb/R1280x0/?scode=mtistory2&amp;fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FsdDbN%2FdJMcaf7MZRG%2Fkvx7kNB9UU4fW03xAcwxLk%2Fimg.png&quot; onerror=&quot;this.onerror=null; this.src='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png'; this.srcset='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png';&quot; loading=&quot;lazy&quot; width=&quot;713&quot; height=&quot;438&quot; data-origin-width=&quot;713&quot; data-origin-height=&quot;438&quot;/&gt;&lt;/span&gt;&lt;/figure&gt;
&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;정수와 정수 배열을 입력받고, 정수 배열에서 정수의 배수가 아닌 수들은 제거하고 배수인 수만 남겨서 리턴하는 문제이다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;풀이:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;pre id=&quot;code_1779926551974&quot; class=&quot;bash&quot; data-ke-language=&quot;bash&quot; data-ke-type=&quot;codeblock&quot;&gt;&lt;code&gt;def solution(n, numlist):
    answer = []
    for i in numlist:
        if i % n == 0:
            answer.append(i)
    return answer&lt;/code&gt;&lt;/pre&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;반환할 리스트를 초기화하고 반복문을 통해 각 자리의 수를 하나씩 확인한 다음, 각각의 수를 n으로 나눈 값이 0인 경우(즉, 나눠 떨어지는 경우)에 반환할 리스트에 해당 값을 추가한 후 최종적으로 해당 리스트를 반환하는 코드이다.&lt;/p&gt;</description>
      <category>CODING  </category>
      <category>Coding</category>
      <category>n의 배수 고르기</category>
      <category>programmers</category>
      <category>Python</category>
      <category>코딩</category>
      <category>파이썬</category>
      <category>프로그래머스</category>
      <author>jyamethyst21</author>
      <guid isPermaLink="true">https://jyamethyst21.tistory.com/362</guid>
      <comments>https://jyamethyst21.tistory.com/362#entry362comment</comments>
      <pubDate>Thu, 28 May 2026 09:04:06 +0900</pubDate>
    </item>
    <item>
      <title>프로그래머스 - '가장 큰 수 찾기' (PYTHON 풀이)</title>
      <link>https://jyamethyst21.tistory.com/361</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;문제:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;figure class=&quot;imageblock alignCenter&quot; data-ke-mobileStyle=&quot;widthOrigin&quot; data-origin-width=&quot;456&quot; data-origin-height=&quot;406&quot;&gt;&lt;span data-url=&quot;https://blog.kakaocdn.net/dn/crpNJa/dJMcahkiYlh/bwvnjvYV5IpbUewlEHtsok/img.png&quot; data-phocus=&quot;https://blog.kakaocdn.net/dn/crpNJa/dJMcahkiYlh/bwvnjvYV5IpbUewlEHtsok/img.png&quot;&gt;&lt;img src=&quot;https://blog.kakaocdn.net/dn/crpNJa/dJMcahkiYlh/bwvnjvYV5IpbUewlEHtsok/img.png&quot; srcset=&quot;https://img1.daumcdn.net/thumb/R1280x0/?scode=mtistory2&amp;fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FcrpNJa%2FdJMcahkiYlh%2FbwvnjvYV5IpbUewlEHtsok%2Fimg.png&quot; onerror=&quot;this.onerror=null; this.src='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png'; this.srcset='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png';&quot; loading=&quot;lazy&quot; width=&quot;456&quot; height=&quot;406&quot; data-origin-width=&quot;456&quot; data-origin-height=&quot;406&quot;/&gt;&lt;/span&gt;&lt;/figure&gt;
&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;배열을 입력받고, 배열에 존재하는 가장 큰 수와 큰 수가 존재하는 인덱스를 배열 형태로 출력하는 문제이다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;풀이:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;pre id=&quot;code_1779861712921&quot; class=&quot;bash&quot; data-ke-language=&quot;bash&quot; data-ke-type=&quot;codeblock&quot;&gt;&lt;code&gt;def solution(array):
    li = []
    number = max(array)
    li.append(number)
    li.append(array.index(number))
    return li&lt;/code&gt;&lt;/pre&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;새로운 리스트에 가장 큰 값을 넣고(max 활용), 특정 값의 인덱스를 반환해주는 index 함수를 활용하여 나온 결과값을 li 리스트에 추가한다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;마지막으로 해당 리스트를 반환해주면 된다.&lt;/p&gt;</description>
      <category>CODING  </category>
      <category>Coding</category>
      <category>programmers</category>
      <category>Python</category>
      <category>가장 큰 수 찾기</category>
      <category>코딩</category>
      <category>파이썬</category>
      <category>프로그래머스</category>
      <author>jyamethyst21</author>
      <guid isPermaLink="true">https://jyamethyst21.tistory.com/361</guid>
      <comments>https://jyamethyst21.tistory.com/361#entry361comment</comments>
      <pubDate>Wed, 27 May 2026 15:02:47 +0900</pubDate>
    </item>
    <item>
      <title>프로그래머스 - '대문자와 소문자' (PYTHON 풀이)</title>
      <link>https://jyamethyst21.tistory.com/360</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;문제:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;figure class=&quot;imageblock alignCenter&quot; data-ke-mobileStyle=&quot;widthOrigin&quot; data-origin-width=&quot;570&quot; data-origin-height=&quot;377&quot;&gt;&lt;span data-url=&quot;https://blog.kakaocdn.net/dn/cFppLO/dJMcaipU7uK/DAl1m8rkozsNuKIB6eZLZ1/img.png&quot; data-phocus=&quot;https://blog.kakaocdn.net/dn/cFppLO/dJMcaipU7uK/DAl1m8rkozsNuKIB6eZLZ1/img.png&quot;&gt;&lt;img src=&quot;https://blog.kakaocdn.net/dn/cFppLO/dJMcaipU7uK/DAl1m8rkozsNuKIB6eZLZ1/img.png&quot; srcset=&quot;https://img1.daumcdn.net/thumb/R1280x0/?scode=mtistory2&amp;fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FcFppLO%2FdJMcaipU7uK%2FDAl1m8rkozsNuKIB6eZLZ1%2Fimg.png&quot; onerror=&quot;this.onerror=null; this.src='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png'; this.srcset='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png';&quot; loading=&quot;lazy&quot; width=&quot;570&quot; height=&quot;377&quot; data-origin-width=&quot;570&quot; data-origin-height=&quot;377&quot;/&gt;&lt;/span&gt;&lt;/figure&gt;
&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;my_string에 소문자가 존재하면 대문자로, 대문자가 존재하면 소문자로 변경해서 이를 출력하는 문제이다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;풀이:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;pre id=&quot;code_1779754094036&quot; class=&quot;bash&quot; data-ke-language=&quot;bash&quot; data-ke-type=&quot;codeblock&quot;&gt;&lt;code&gt;def solution(my_string):
    answer = &quot;&quot;

    for i in my_string:
        if i.isupper():
            answer += i.lower()
        else:
            answer += i.upper()

    return answer&lt;/code&gt;&lt;/pre&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;변환된 문자열을 반환하기 위하여 answer 변수를 초기화하고, 반복문을 통해 모든 문자열을 확인한다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;이때 파이썬의 isupper()를 활용해서 만약 대문자라면 이를 소문자로 바꾼 뒤 answer 변수에 추가하고, 그렇지 않다면 대문자로 바꿔서 추가하는 로직을 세웠다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;최종적으로 변환된 변수인 answer를 반환하면 된다.&lt;/p&gt;</description>
      <category>CODING  </category>
      <category>Coding</category>
      <category>programmers</category>
      <category>Python</category>
      <category>대문자와 소문자</category>
      <category>코딩</category>
      <category>파이썬</category>
      <category>프로그래머스</category>
      <author>jyamethyst21</author>
      <guid isPermaLink="true">https://jyamethyst21.tistory.com/360</guid>
      <comments>https://jyamethyst21.tistory.com/360#entry360comment</comments>
      <pubDate>Tue, 26 May 2026 09:11:28 +0900</pubDate>
    </item>
    <item>
      <title>프로그래머스 - '삼각형의 완성조건 (1)' (PYTHON 풀이)</title>
      <link>https://jyamethyst21.tistory.com/359</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;문제:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;figure class=&quot;imageblock alignCenter&quot; data-ke-mobileStyle=&quot;widthOrigin&quot; data-origin-width=&quot;646&quot; data-origin-height=&quot;553&quot;&gt;&lt;span data-url=&quot;https://blog.kakaocdn.net/dn/cc3OVt/dJMcadB11X4/ixe3wZXUOKpVxcMSGFhdYk/img.png&quot; data-phocus=&quot;https://blog.kakaocdn.net/dn/cc3OVt/dJMcadB11X4/ixe3wZXUOKpVxcMSGFhdYk/img.png&quot;&gt;&lt;img src=&quot;https://blog.kakaocdn.net/dn/cc3OVt/dJMcadB11X4/ixe3wZXUOKpVxcMSGFhdYk/img.png&quot; srcset=&quot;https://img1.daumcdn.net/thumb/R1280x0/?scode=mtistory2&amp;fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2Fcc3OVt%2FdJMcadB11X4%2Fixe3wZXUOKpVxcMSGFhdYk%2Fimg.png&quot; onerror=&quot;this.onerror=null; this.src='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png'; this.srcset='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png';&quot; loading=&quot;lazy&quot; width=&quot;646&quot; height=&quot;553&quot; data-origin-width=&quot;646&quot; data-origin-height=&quot;553&quot;/&gt;&lt;/span&gt;&lt;/figure&gt;
&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;입력받은 세 변의 길이를 확인해서 삼각형을 만들 수 있다면 1을, 그렇지 않다면 2를 출력하는 문제이다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;풀이:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;pre id=&quot;code_1779528935120&quot; class=&quot;bash&quot; data-ke-language=&quot;bash&quot; data-ke-type=&quot;codeblock&quot;&gt;&lt;code&gt;def solution(sides):
    new = sorted(sides, reverse = True)
    
    if new[0] &amp;lt; new[1] + new[2]:
        return 1
    else:
        return 2&lt;/code&gt;&lt;/pre&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;삼각형을 만들기 위해서는 &lt;b&gt;세 변 중 가장 큰 값이 나머지 두 변의 값을 더한 값보다 작아야 한다&lt;/b&gt;.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;즉 a가 가장 긴 값, b, c가 나머지 두 변이라면&lt;b&gt; 'a &amp;lt; b + c'&lt;/b&gt;가 성립되어야 삼각형을 만들 수 있다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;해당 공식을 활용하여 필자는 sorted 함수를 활용해서 입력받은 배열을 내림차순으로 정렬하고, 정렬 이후 첫 번째 인덱스 값이 가장 큰 값이 되기 때문에, 해당 값과 나머지 두 변의 값을 더한 값을 비교해서 가장 길이가 긴 변이 두 변을 더한 수보다 작으면 1을, 그렇지 않으면 2를 리턴하도록 하였다.&lt;/p&gt;</description>
      <category>CODING  </category>
      <category>Coding</category>
      <category>programmers</category>
      <category>Python</category>
      <category>삼각형의 완성조건 (1)</category>
      <category>코딩</category>
      <category>파이썬</category>
      <category>프로그래머스</category>
      <author>jyamethyst21</author>
      <guid isPermaLink="true">https://jyamethyst21.tistory.com/359</guid>
      <comments>https://jyamethyst21.tistory.com/359#entry359comment</comments>
      <pubDate>Mon, 25 May 2026 00:38:26 +0900</pubDate>
    </item>
    <item>
      <title>프로그래머스 - '숨어있는 숫자의 덧셈 (1)' (PYTHON 풀이)</title>
      <link>https://jyamethyst21.tistory.com/358</link>
      <description>&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;문제:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;p&gt;&lt;figure class=&quot;imageblock alignCenter&quot; data-ke-mobileStyle=&quot;widthOrigin&quot; data-origin-width=&quot;664&quot; data-origin-height=&quot;370&quot;&gt;&lt;span data-url=&quot;https://blog.kakaocdn.net/dn/bW3rYl/dJMcajh1anW/D7hYND89O6BavIQaULqV6K/img.png&quot; data-phocus=&quot;https://blog.kakaocdn.net/dn/bW3rYl/dJMcajh1anW/D7hYND89O6BavIQaULqV6K/img.png&quot;&gt;&lt;img src=&quot;https://blog.kakaocdn.net/dn/bW3rYl/dJMcajh1anW/D7hYND89O6BavIQaULqV6K/img.png&quot; srcset=&quot;https://img1.daumcdn.net/thumb/R1280x0/?scode=mtistory2&amp;fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FbW3rYl%2FdJMcajh1anW%2FD7hYND89O6BavIQaULqV6K%2Fimg.png&quot; onerror=&quot;this.onerror=null; this.src='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png'; this.srcset='//t1.daumcdn.net/tistory_admin/static/images/no-image-v1.png';&quot; loading=&quot;lazy&quot; width=&quot;664&quot; height=&quot;370&quot; data-origin-width=&quot;664&quot; data-origin-height=&quot;370&quot;/&gt;&lt;/span&gt;&lt;/figure&gt;
&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;/span&gt;문자열이 주어질 때, 해당 문자열에 존재하는 숫자를 전부 더해서 리턴하는 문제이다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&lt;span style=&quot;background-color: #ffc9af;&quot;&gt;&lt;b&gt;풀이:&lt;/b&gt;&lt;/span&gt;&lt;/p&gt;
&lt;pre id=&quot;code_1779528437771&quot; class=&quot;bash&quot; data-ke-language=&quot;bash&quot; data-ke-type=&quot;codeblock&quot;&gt;&lt;code&gt;def solution(my_string):
    li = ['0','1','2','3','4','5','6','7','8','9']
    result = 0

    for i in my_string:
        if i in li:
            result += int(i)

    return result&lt;/code&gt;&lt;/pre&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;문자열에 숫자가 포함되어 있는지 확인하는 함수인 isdigit()을 활용하는 방법도 있으나, 필자는 최대한 함수를 쓰지 않고 작성하기 위해 상기와 같이 작성하였다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;입력받은 문자열 type이 문자이므로 숫자인지 확인하기 위해서 li 리스트에 숫자를 문자 형태로 작성해서 저장하였다. 그 후 결과값을 담을 숫자형 변수인 result를 선언하고 반복문을 사용하였다.&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;입력받은 문자열을 하나씩 확인하여서 만약 각 자릿수의 값이 li(숫자값인지 확인하는 리스트)에 포함되어 있다면, result 변수에 해당 값을 숫자 형태로 변환하여서 더해주었다.&amp;nbsp;&lt;/p&gt;
&lt;p data-ke-size=&quot;size16&quot;&gt;그 후 최종적으로 숫자값이 전부 더해진 result를 리턴하면 되는 문제이다.&lt;/p&gt;</description>
      <category>CODING  </category>
      <category>Coding</category>
      <category>programmers</category>
      <category>Python</category>
      <category>숨어있는 숫자의 덧셈 (1)</category>
      <category>코딩</category>
      <category>파이썬</category>
      <category>프로그래머스</category>
      <author>jyamethyst21</author>
      <guid isPermaLink="true">https://jyamethyst21.tistory.com/358</guid>
      <comments>https://jyamethyst21.tistory.com/358#entry358comment</comments>
      <pubDate>Sun, 24 May 2026 00:30:19 +0900</pubDate>
    </item>
  </channel>
</rss>