-
백준 2675 2739 10818 10869 10950 | java 자바[백준 알고리즘]/[자바 Java] 2024. 1. 9. 16:11728x90반응형
이번 포스팅은 백준 2675, 2739, 10818, 10869, 10950번 자바 java 정답 코드입니다.
아래 url를 클릭하시면 백준 사이트에서 문제를 볼 수 있습니다.
https://www.acmicpc.net/problem/2675
https://www.acmicpc.net/problem/2739
https://www.acmicpc.net/problem/10818
https://www.acmicpc.net/problem/10869
https://www.acmicpc.net/problem/10950
전체 코드
123456789101112131415161718192021222324252627//백준 2675 문자열 반복import java.util.Scanner;public class Main{public static void main(String[] args){Scanner sc = new Scanner(System.in);String s="", p="";int t=0, r=0;t=sc.nextInt();for(int i=0; i<t; i++, p=""){r=sc.nextInt();s=sc.next();for(int j=0; j<s.length(); j++){for(int k=0; k<r;k++){p+=s.charAt(j);}}System.out.println(p);}sc.close();}}cs 12345678910111213141516171819//백준 2739 구구단import java.util.Scanner;public class Boj2739 {public static void main(String[] args) {Scanner sc = new Scanner(System.in);int n=0, mul=0;n=sc.nextInt();for(int i=1; i<=9; i++){mul= n*i;System.out.println(n+" * "+i+" = "+n*i);}sc.close();}}cs 12345678910111213141516171819202122232425//백준 10818 최소, 최대import java.util.Scanner;public class Main{public static void main(String[] args) {Scanner sc = new Scanner(System.in);int n=0, input=0, max= -1000001, min= 1000001;n=sc.nextInt();for(int i=0;i<n;i++){input=sc.nextInt();if(input>max){max=input;}if(input<min){min=input;}}System.out.print(min+" "+max);sc.close();}}cs 1234567891011121314151617181920212223242526//백준 10869 사칙연산import java.util.Scanner;public class Main{public static void main(String[] args) {Scanner sc = new Scanner(System.in);int a=0, b=0, sum=0, diff=0, mul=0, div=0, rem=0;a=sc.nextInt();b=sc.nextInt();sum=a+b;diff=a-b;mul=a*b;div=a/b;rem=a%b;System.out.println(sum);System.out.println(diff);System.out.println(mul);System.out.println(div);System.out.println(rem);sc.close();}}cs 1234567891011121314151617181920//백준 10950 A+B - 3import java.util.Scanner;public class Main{public static void main(String[] args) {Scanner sc = new Scanner(System.in);int t=0, a=0, b=0, sum=0;t=sc.nextInt();for(int i=0; i<t; i++){a=sc.nextInt();b=sc.nextInt();sum=a+b;System.out.println(sum);}sc.close();}}cs 728x90반응형'[백준 알고리즘] > [자바 Java]' 카테고리의 다른 글
백준 1259 팰린드롬수 | 자바 java (1) 2024.01.10 백준 1978 소수 찾기 | 자바 java (0) 2024.01.10 백준 4153 직각삼각형 | 자바 java (1) 2024.01.10 백준 10951 10952 11654 11720 25083 27866 | java 자바 (0) 2024.01.09 백준 1008 1330 2438 2557 2562 | java 자바 (0) 2024.01.09