목록전체 글 (601)
sm 기술 블로그
import sys input = sys.stdin.readline N = int(input()) K = int(input()) start = 1 end = K result = 0 while(end - start >= 0): mid = (start + end) // 2 cnt = 0 for i in range(1, N+1): cnt += min(mid // i, N) if(K
import java.util.*; import java.io.*; class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int N = sc.nextInt(); int C = sc.nextInt(); long[] home = new long[N]; for (int i = 0; i = 0) { long mid = (start ..
import sys input = sys.stdin.readline N, C = map(int, input().split()) home = sorted(list(int(input()) for _ in range(N))) start = 1 # 최소거리 end = home[-1] - home[0] # 최대거리 result = 0 while(end - start >= 0): mid = (start + end) // 2 currentHome = home[0] wifi = 1 for i in range(1, len(home)): if home[i] >= currentHome + mid: wifi += 1 currentHome = home[i] if wifi >= C: start = mid + 1 result = ..
import java.util.*; import java.io.*; class Main { public static void main(String[] args)throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); String[] tmp = br.readLine().split(" "); int N = Integer.parseInt(tmp[0]); long M = Long.parseLong(tmp[1]); long[] tree = new long[N]; tmp = br.readLine().split(" "); for (int i = 0; i < N; i++) { tree[i] = Long.pa..