목록분류 전체보기 (172)

시나브로

The 7th day

Today is 7th day to read a english book😊 yesterday, i skipped to do that.😭 recently, i felt tried...and wanted to sleep....🥲 today i read a part 1. because i thank i need to reread that to more understand and to memory new words! #englishstudy #english #readingbooks #read #readingenglishbooks #englishbook #habit #habittoread #원서읽자 #원서 #원서읽기 #영어공부 #영어학습 #공부자극 #nightrotine
English/원서읽자 2022. 5. 9. 01:22
2470. 두 용액

#include #include #include using namespace std; int main(void) { freopen("inp.inp", "r", stdin); freopen("out.out", "w", stdout); int n; cin >> n; vector list; vector answer(2); for (int i = 0; i > box; list.push_back(box); } sort(list.begin(), list.end()); int s = 0; int e = n-1; long long min = 2000000001; while (s < e) { long long sum = list[s] + list[e]; if (min..
알고리즘/백준 2021. 10. 31. 01:19
17086. 아기 상어 2

#include #include using namespace std; int main(void) { freopen("inp.inp", "r", stdin); freopen("out.out", "w", stdout); int r, c; cin >> r >> c; int map[60][60] = { 0 }; int check[60][60] = { 0 }; queue q; for(int i=0;i> map[i][j]; if (map[i][j] == 1) { check[i][j] = 1; q.push({ i,j }); } } } int dx[] = { -1,-1,0,1,1,1,0,-1 }; int dy[] = { 0,1,1,1,0,-1,-1,-1 }; int max = 0; while (!q.empty()) {..
알고리즘/백준 2021. 10. 31. 00:08
3813. [Professional] 그래도 수명이 절반이 되어서는...

Solution : 이진 탐색 + 파라메트릭스 서치 #include #include #include #include #include using namespace std; int main() { freopen("inp.inp", "r", stdin); freopen("out.out", "w", stdout); int tc = 0; cin >> tc; for (int p = 1; p > n >> k; vector list; int a; for (int i = 0; i > a; list.push_back(a); } vector problem; for (int i = 0; i > a; problem.push_back(a); } int answer = ..
알고리즘/SW Expert Academy 2021. 4. 13. 19:24
Prev 1 2 3 4 5 6 7 ··· 43 Next