22.03.23

백준 10952번 JAVA

 

import java.util.Scanner;

public class Main {
	
	public static void main(String[] args) {
		
		Scanner scan = new Scanner(System.in);
		

		
		
		while(true) {
			
			int a = scan.nextInt();
			int b = scan.nextInt();
		
			if(a==0 && b==0) {
				scan.close();
				break;
			}
			System.out.println(a+b);
			
		}
	
	

}
	
}

 

 

백준 10818번 JAVA

 

package ch01;

import java.util.Arrays;
import java.util.Scanner;

public class array01 {

	public static void main(String[] args) {
		
		Scanner scan = new Scanner(System.in);
		
		int a = scan.nextInt();
		
		int arr[] = new int[a];
		
		for (int i = 0; i < a; i++) {
			arr[i] = scan.nextInt();
		}
		
		scan.close();
		Arrays.sort(arr); // 배열, 오름차순 정리
		System.out.println(arr[0] + " " + arr[a-1]); // 오름차순으로 정리된 배열의 0번째,마지막 코드

	}

}

 

백준 2562번

 

 

package ch01;

import java.util.Scanner;

public class array01 {

	public static void main(String[] args) {
		
			Scanner in = new Scanner(System.in);		
			int[] arr = { in.nextInt(), in.nextInt(), in.nextInt(),
					in.nextInt(), in.nextInt(), in.nextInt(),
					in.nextInt(), in.nextInt(), in.nextInt() };
			in.close();
			
			int count = 0;
			int max = 0;
			int index = 0;
	        
			for(int value : arr) { // arr에 있는 배열값을 하나씩 value에 대입함 ( 콜론 : )
				count++;
	            
				if(value > max) {
					max = value;
					index = count;
				}
			}
			System.out.print(max + "\n" + index);
			
		}
	}