![프로그래머스 Lv.0 합성수 찾기](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FqHT0r%2FbtsDLr553nX%2FdL5kJUDn910ivaHoZy1WK0%2Fimg.png)
class Solution { public int solution(int n) { int answer = 0; int num = 0; for(int i = 1; i
![프로그래머스 Lv.0 세로 읽기](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FueOQN%2FbtsDKQZbVsr%2FXrLa1ABooDwcOcuJoKxVA1%2Fimg.png)
class Solution { public String solution(String my_string, int m, int c) { String answer = ""; for(int i = 0; i < my_string.length(); i++) { if (i == (c - 1)){ answer += String.valueOf(my_string.charAt(c - 1)); c += m; } } return answer; } }
![프로그래머스 Lv.1 하샤드 수](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FdkWqJT%2FbtsDJjuixDD%2F0JjV78am9XvuxLV8HV0KA1%2Fimg.png)
class Solution { public boolean solution(int x) { String[] str = String.valueOf(x).split(""); int num = 0; for(int i = 0; i < str.length; i ++) { num += Integer.parseInt(str[i]); } boolean answer = (x % num == 0) ? true : false; return answer; } }
![프로그래머스 Lv.1 정수 내림차순으로 배치하기](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FcEDx8e%2FbtsDJmR24ei%2FprOip9fOjOK6IyoglxS9uk%2Fimg.png)
import java.util.*; class Solution { public long solution(long n) { long answer = 0; String str = n + ""; String[] strArr = str.split(""); Long[] lonArr = new Long[strArr.length]; for(int i = 0; i = 0; i--) { str += lonArr[i] + ""; } answer = Long.parseLong(str); return..
![프로그래머스 Lv.1 정수 제곱근 판별](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FLVS5z%2FbtsDqPtDzre%2F0XshCH8e9q5Hk3LwpfBuh0%2Fimg.png)
class Solution { public long solution(long n) { long answer = -1; long num = 0; for(int i = 1; i