• Home
  • About
    • Ryureka Moment photo

      Ryureka

      Sin Prisa, Sin Pausa

    • About Me
    • Facebook
    • Github
    • Youtube
  • Projects
  • Posts
    • Posts
    • ProblemSolvings
    • Tags
    • Blog
    • Examples
  • ProblemSolving
    • ProblemSolving
    • BOJ
    • Programmers
    • LeetCode
    • Codetree
    • SWEA
  • FrontEnd
    • FrontEnd
    • HTML
  • BackEnd
    • BackEnd
    • Server
      • Server
      • Spring
      • NodeJS
    • DataBase
      • DataBase
      • MySQL
      • MongoDB
  • Programming
    • Programming
    • Java
    • JS
    • Python
    • CleanCode
  • ComputerScience
    • DataStructure
    • Algorithm

[Codetree] 원 모양으로 되어있는 방

19 Sep 2026

Reading time ~1 minute

  • 풀이 구현
해당 문제는 코드트리 원 모양으로 되어있는 방에서 풀어보실 수 있습니다.

풀이 구현

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++)
            arr[i] = sc.nextInt();
        // Please write your code here.

        int min = Integer.MAX_VALUE;
        for(int cur = 1; cur <= n; cur++) {
            int sum = 0;
            for(int next = cur+1; next < cur+n; next++) {
                sum+= arr[next%n]*(next-cur);
            }
            min = Math.min(min,sum);
        }

        System.out.println(min);
    }
}


완전탐색 Share