[BOJ][8393] 합

1. 문제 링크

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

2. 사용 알고리즘

구현

3. 풀이

1 ~ N까지 반복문을 돌며 합 계산

4. 소스 코드

4-1. C++

https://github.com/dev-aiden/problem-solving/blob/main/boj/8393.cpp

#include <iostream>

using namespace std;

int main(void) {
    ios_base::sync_with_stdio(false);
    int n, sum = 0; cin >> n;
    for (int i = 1; i <= n; ++i) sum += i;
    cout << sum << '\n';
    return 0;
}

4-2. JAVA

https://github.com/dev-aiden/problem-solving/blob/main/boj/8393.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));
        int n = Integer.parseInt(br.readLine());
        int sum = 0;
        for(int i = 1; i <= n; ++i) sum += i;
        System.out.println(sum);
    }
}