시나브로

#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..

#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()) {..

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 = ..

#include #include #include #include #include using namespace std; int main() { int a, b; cin >> a >> b; if (a > b) b--; else b++; for (int i = a; i != b;) { for (int j = 1; j < 10; j++) { cout