soominkim Study
article thumbnail
[Programmers] Lv0. 두수의 곱

class Solution { public int solution(int num1, int num2) { return num1*num2; } }

article thumbnail
[BAEKJOON] 2558번

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int b = sc.nextInt(); System.out.println(a*(b%10)); System.out.println(a*(b%100/10)); System.out.println(a*(b/100)); System.out.println(a*b); } }

article thumbnail
[Programmers] Lv0. 다음에 올 숫자

class Solution { public int solution(int[] common) { int answer = 0; if(common[1]-common[0]==common[2]-common[1]){ answer = common[common.length-1]+(common[1]-common[0]); }else{ answer = common[common.length-1]*(common[1]/common[0]); } return answer; } }

article thumbnail
[BAEKJOON] 2557번

public class Main { public static void main(String[] args) { System.out.print("Hello World!"); } }

article thumbnail
[BAEKJOON] 1000번

import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int a = sc.nextInt(); int b = sc.nextInt(); System.out.print(a+b); } }

article thumbnail
[Programmers] Lv0. 7의 개수

class Solution { public int solution(int[] array) { int answer = 0; for(int i=0; i

article thumbnail
[Programmers] Lv0. 분수 덧셈

1. 전체 코드 class Solution { public int[] solution(int denum1, int num1, int denum2, int num2) { int denum3 = (denum1*num2)+(denum2*num1); int num3 = num1*num2; int gcd = getGCD(denum3,num3); int res1 = denum3/gcd; int res2 = num3/gcd; int[] answer = {res1,res2}; return answer; } static int getGCD(int num1,int num2){ int r = num1%num2; if(r==0){ return num2; }else{ return getGCD(num2,r); } } } 2. 부..

검색 태그