Notice
Recent Posts
Recent Comments
Link
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 | 31 |
Tags
- BOJ Social Distancing
- 18881번
- 백준 18877번
- VUE
- 텐서플로맛
- 18877번
- 백준 BOJ
- CCPC
- BOJ 18881
- 반응형 웹
- Spring Security
- BOJ Social Distancing II
- await
- 백준
- async
- java
- BOJ
- vue.js
- JavaScript
- 베리어블 폰트
- 18877번 Social Distancing
- 일해라 개발자
- BOJ 18877
- Social Distancing II
- social distancing
- spring boot
- 백준 Social Distancing II
- Catholic univ Computer Programming Contest
- 모바일 버전만들기
- CSS
Archives
- Today
- Total
목록BOJ 18881 (1)
나아가는 길에 발자국을 찍어보자

https://www.acmicpc.net/problem/18881 18881번: Social Distancing II The first line of input contains $N$. The next $N$ lines each describe one cow in terms of two integers, $x$ and $s$, where $x$ is the position ($0 \leq x \leq 10^6$), and $s$ is 0 for a healthy cow or 1 for a sick cow. At least one cow is sick, and all co www.acmicpc.net 문제 해설을 하자면, 소들의 수인 N(1 N; vectorcow; vectorcand; for (int ..
Algorithm/Problem Solving
2021. 1. 6. 19:08