| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | 3 | 4 | |||
| 5 | 6 | 7 | 8 | 9 | 10 | 11 |
| 12 | 13 | 14 | 15 | 16 | 17 | 18 |
| 19 | 20 | 21 | 22 | 23 | 24 | 25 |
| 26 | 27 | 28 | 29 | 30 |
- Docker
- codetree
- 도커
- Node.js 개요
- SWEA
- SQL
- Python
- javascript
- 리액트
- 클래스
- CSS
- CS
- node.js
- 자바
- 스프링
- java
- 실버
- Spring
- 네트워크
- 프로그래머스
- react
- programmers
- 별 찍는 것을 5번 반복하기
- Fast API
- vue.js
- 반복 출력하기
- 파이썬
- 함수를 이용해 직사각형 만들기
- 숫자로 이루어진 사각형
- 백준
- Today
- Total
목록java (404)
HELLo WORLD
https://www.acmicpc.net/problem/1920 import java.io.*;import java.util.*;public class Main { static int binarySearch(int[] arr, int target){ int left = 0; int right = arr.length-1; while(left
https://www.acmicpc.net/problem/2110 import java.io.*;import java.util.*;public class Main { static int countNum(int[] arr, int N, long distance){ int count = 1; int last = arr[0]; for(int i=1;i=distance){ count++; last = arr[i]; } } return count; } public static void main(String[] args) throws IOExcepti..
https://www.acmicpc.net/problem/2805 import java.io.*;import java.util.*;public class Main { static long countNum(int[] arr, int N, long standard){ long tot = 0; for(int i=0;i0){ tot+=val; } } return tot; } public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStrea..
https://www.acmicpc.net/problem/1654 이분탐색을 생각을 못했네,,import java.io.*;import java.util.*;public class Main { static long countNum(int[] arr, int k, long standard){ long tot = 0; for(int i = 0; i = N){ answer = mid; left = mid + 1; } else { right = mid - 1; } } System.out.println(answer); }}
https://www.acmicpc.net/problem/2075 import java.util.*;import java.io.*;class Main { static class Point implements Comparable { int val; public Point(int val) { this.val = val; } @Override public int compareTo(Point p) { return this.val - p.val; // 오름차순으로 정렬 } } public static void main(String[] args) throws IOException { ..
https://www.acmicpc.net/problem/12851 import java.util.*;import java.io.*;class Main { static class Point { int pos; int cnt; public Point(int pos, int cnt) { this.pos = pos; this.cnt = cnt; } } static int N, K, min = Integer.MAX_VALUE, cnt = 0; static boolean[] visited = new boolean[100001]; public static void main(String[] args) ..
https://www.acmicpc.net/problem/1743 import java.util.*;import java.io.*;class Main { static int N,M,K,num; static int[][] arr; static boolean[][] visited; static int[] dx = {-1,1,0,0}; static int[] dy = {0,0,-1,1}; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); StringTokenizer..
https://www.acmicpc.net/problem/1303 import java.util.*;import java.io.*;class Main { static int N,M,num,WCount,BCount; static char[][] arr; static boolean[][] visited; static int[] dx = {-1,1,0,0}; static int[] dy = {0,0,-1,1}; public static void main(String[] args) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); St..
https://www.codetree.ai/trails/complete/curated-cards/challenge-yutnori-1d/description Code Tree | Learning to Code with ConfidenceA super-comprehensive, meticulously arranged Coding Learning Curriculum engineered by Algorithm Experts composed of former International Olympiad in Informatics (IOI) medalists.www.codetree.ai import java.io.*;import java.util.*;public class Main { static int N,M,..
https://www.codetree.ai/trails/complete/curated-cards/intro-n-permutations-of-k-with-repetition-under-constraint/description Code Tree | Learning to Code with ConfidenceA super-comprehensive, meticulously arranged Coding Learning Curriculum engineered by Algorithm Experts composed of former International Olympiad in Informatics (IOI) medalists.www.codetree.ai import java.io.*;import java.util.*;..