algorithms 코드포스 (codeforces)

코드포스 59A (codeforces 59A)

2019.03.15 ·

코드포스 59A (codeforces 59A) 문제 풀이 및 코드 (description and code)

Problem - 59A - Codeforces

Codeforces 59A

코드포스 59A (codeforces 59A) 문제 풀이 및 코드 (description and code)

https://codeforces.com/problemset/problem/59/A

코드

import java.io.*;

public class CF59A {
    static String in;
    static int upper = 0, lower = 0;
    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        in = br.readLine();
        for (int i = 0; i < in.length(); i++) {
            upper += (in.charAt(i) < 96) ? 1 : 0;
            lower += (in.charAt(i) > 96) ? 1 : 0;
        }
        bw.write(((upper > lower) ? in.toUpperCase() : in.toLowerCase()) + "\n");
        bw.flush();bw.close();
    }
}

설명