Study & Project ✏️/알고리즘 📋

백준[JAVA] 2355.시그마 - 자바

JM 2022. 9. 11. 16:38
반응형

📖 문제

📃 코드

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

public class Main {
    static long sum(long A, long B) {
        long result = (A + B) * ((B - A + 1) / 2);
        System.out.println((B - A + 1) / 2);
        // if numbers are odd
        if ((B - A + 1) % 2 != 0) {
            result += (A + B) / 2;
        }
        return result;
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine());
        long N = Long.parseLong(st.nextToken());
        long M = Long.parseLong(st.nextToken());
        long A = Math.min(N, M);
        long B = Math.max(N, M);

        System.out.println(sum(A, B));
    }
}

 

🔗 링크

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

 

2355번: 시그마

첫째 줄에 두 정수 A, B가 주어진다. (-2,147,483,648 ≤ A, B ≤ 2,147,483,647)

www.acmicpc.net