블로그
-
{daily stoic 스토아철학} JUnE THE 12TH_a trained mind is better than any script_ 6월의 스토익 Problem solving
adapt to any circumstance in this way, if circumstances take you off script you wont be desperate for a new prompting stoics donot seek to have the answer for every question or a plan for every contingency Yet
blog.naver.com · 2026.06.13
-
대순진리회영문전경 권지 1장 20절
Scripture: Authority and Foreknowledge 1. 20 One day, on the way to White-Rock (Baekam) Village from New As Gong-Wu was too startled to answer Him, he just hesitated to reply.
blog.naver.com · 2026.02.23
-
China’s Escalating Clash With Japan’s New Prime Minister
She is Japan's new prime minister. Her answer did not actually change Japan’s position. It is a long-standing position.
blog.naver.com · 2025.11.18
-
박재희 통역사 - 계절이 바뀌는 시기 회화
Sample answer: I’ve started waking up earlier to have some quiet time before work. Useful expressions: form a new habit (새로운 습관을 들이다) break a bad habit (나쁜 습관을 고치다) stay consistent (꾸준히
blog.naver.com · 2025.10.21
-
타겟넘버
.*; class Solution { public int solution(int[] numbers, int target) { int answer = 0; Queue q = new LinkedList <>(); q.add(new int[]{numbers[0], 1}); q.add(new int[]{numbers[0] * -1, 1}); while(!
blog.naver.com · 2025.08.04
-
네트워크
= new boolean[n]; for(int i = 0;i q = new LinkedList<>(); if(! visited[i]){ answer++; visited[i] = true; q.add(i); } while(!
blog.naver.com · 2025.08.04
-
행렬테두리 회전하기
.*; class Solution { public int[] solution(int rows, int columns, int[][] queries) { int[] answer = new int[queries.length]; int[][] sq = new int[rows][columns]; for(int i = 0;i
blog.naver.com · 2025.07.04
-
(수정 중)PCCP모의고사2회 보물지도
len == " + len + " // used == " + used; } } public int solution(int n, int m, int[][] hole) { int answer = Integer.MAX_VALUE; int[][] maps = new int[m][n]; for(int[] h : hole){ maps[h[1] - 1][h[0] - 1] &
blog.naver.com · 2025.08.20
-
전력망을 둘로 나누기
public int solution(int n, int[][] wires) { int answer = Integer.MAX_VALUE; for (int i = 0; i < wires.length = wires[j][0]; int b = wires[j][1]; graph.get(a).add(b); graph.get(b).add(a); } boolean[] visited = new
blog.naver.com · 2025.07.04
-
책, <DEAD POETS SOCIETY> - 죽은 시인의 사회
The answer, my dear lads, is that we must constantly endeavor to find a new poing of view.
blog.naver.com · 2025.07.16
