[백준 알고리즘] 5622번 다이얼 (Python 3, Java)

 

 

 

<Python 3>

word = input()
num = ['ABC', 'DEF', 'GHI', 'JKL', 'MNO', 'PQRS', 'TUV', 'WXYZ']
sum = len(word)

for i in range(len(word)):
    for j in num:
        if word[i] in j:  
            sum += (num.index(j)+2)
print(sum)

 

<Java>

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        char[] word = br.readLine().toCharArray();
        int time = 0;

        for(char ch : word){
            time += (ch-'A')/3 + 3;
            if(ch =='S' || ch == 'V' || ch == 'Y'|| ch=='Z')
                time--;
        }
        System.out.println(time);
    }
}

 

▼링크

https://www.acmicpc.net/problem/5622

5622번: 다이얼