ep 06-2.문제 풀이

2908번: 상수 (acmicpc.net)

2908번: 상수

import java.util.Scanner;

public class Main
{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String str = sc.next();
		StringBuffer sb = new StringBuffer(str);
		str = sb.reverse().toString();
		String str2 = sc.next();
		StringBuffer sb2 = new StringBuffer(str2);
		str2 = sb2.reverse().toString();
		int n1 =  Integer.parseInt(str);
		int n2 =  Integer.parseInt(str2);
		if(n1 > n2){
		    System.out.print(n1);
		}
		else{
		    System.out.print(n2);
		}
		
	}
}

5622번: 다이얼 (acmicpc.net)

5622번: 다이얼

import java.util.Scanner;

public class Main
{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String str = sc.next();
		int count = 0;
		
		for(int i=0; i<str.length(); i++){
			switch(str.charAt(i)) {
            
			case 'A' : case 'B': case 'C' : 
				count += 3;
				break;
                
			case 'D' : case 'E': case 'F' :
				count += 4; 
				break;
                
			case 'G' : case 'H': case 'I' :
				count += 5; 
				break;
                
			case 'J' : case 'K': case 'L' : 
				count += 6;
				break;
                
			case 'M' : case 'N': case 'O' :
				count += 7;
				break;
                
			case 'P' : case 'Q': case 'R' : case 'S' : 
				count += 8; 
				break;
                
			case 'T' : case 'U': case 'V' : 
				count += 9;
				break;
                
			case 'W' : case 'X': case 'Y' : case 'Z' : 
				count += 10;
				break;
		    }
		}
		System.out.print(count);
    }
}

10809번: 알파벳 찾기 (acmicpc.net)

10809번: 알파벳 찾기

import java.util.Scanner;

public class Main
{
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		String str = sc.next();
		int[] ab = new int[26];
		
		for(int i = 0; i<ab.length; i++){
		    ab[i] = -1;
		}
		for(int i = 0; i<str.length(); i++){
		    char c = str.charAt(i);
		    
		    if(ab[c -'a'] == -1){
		    ab[c - 'a' ] = i;
		    }
		}
		for(int result : ab){
		    System.out.print(result+" ");
		}
    }
}