발자취

[Softeer/C++] 나무 섭지

https://softeer.ai/practice/7726 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai소스코드#include #include #include #include using namespace std;struct Pos { int y, x; Pos() : y(0), x(0) {} Pos(int y, int x) : y(y), x(x) {}};int n, m;string board[1004][1004];int visitNamwoo[1004][1004];int visitGost[1004][1004];Pos exitPos;queuenamwooQ;queuegoastQ;int dy[4] = { -1,0,1,0 };int dx[4] = { 0,1,0,-1 };void GoastBF..

[Softeer/C++] [한양대 HCPC 2023] Hanyang Popularity Exceeding Competition

https://softeer.ai/practice/9495 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai소스코드#include#includeusing namespace std;int main(int argc, char** argv){ int n; int pi, ci; cin >> n; int answer = 0; for (int i = 0; i > pi >> ci; if (abs(answer - pi)

[Softeer/C++] [21년 재직자 대회 예선] 회의실 예약

https://softeer.ai/practice/6266 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai#include#include#include#include#includeusing namespace std;string formatString(int time){ string s = to_string(time); return s.size() > n >> m; string in; int start, end; vector roomName; map> room; for (int i = 0; i > in; roomName.push_back(in); room[in] = vector(10); } for (int i = 0; i > in >> start >> end; for (int i ..

https://softeer.ai/practice/9657 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai소스코드#include#include using namespace std;int main(int argc, char** argv){ int n, m ; int boardItem; int l1, r1; cin >> n >> m; vector> board (n, vector(m)); for (int i = 0; i > boardItem; board[i][j] = boardItem; } } for (int i = 0; i > l1 >> r1; for (int j = l1 - 1; j

https://softeer.ai/practice/6269/history?questionType=ALGORITHM Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 소스코드 #include using namespace std; int main() { int m,n,k; cin >> m>>n>>k; string secrit; string input; string inputButton; for (int i = 0; i > input; secrit += input; } string temp; int idx =0 ; bool isSecret = false; for (int i = 0; i > input; inputButton += ..

https://softeer.ai/practice/6282 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 소스코드 #include #include #include #include #include using namespace std; struct Pos { int y; int x; }; int _dx[4] = { 0,0,-1,1 }; int _dy[4] = { 1,-1,0,0 }; int _visit[26][26]; int _mask; int _n; string _list[26]; int BFS(Pos pos) { queue q; q.push(pos); _visit[pos.y][pos.x] = _mask; int count = 1; while (q.empty() == false) {..

https://softeer.ai/practice/6268 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 소스코드 #include #include #include #include #include using namespace std; int main(int argc, char** argv) { map m; m.insert({ "0",{1,1,1,0,1,1,1} }); m.insert({ "1",{0,0,1,0,0,1,0} }); m.insert({ "2",{1,0,1,1,1,0,1} }); m.insert({ "3",{1,0,1,1,0,1,1} }); m.insert({ "4",{0,1,1,1,0,1,0} }); m.insert({ "5",{1,1,0,1,0,1,1} }); m.in..

https://softeer.ai/practice/7374 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 소스코드 #include #include using namespace std; int minmin(int a, int b, int c) { int arr[3] = { a, b, c }; sort(arr, arr + 3); int middle = arr[1]; int result = 0; for (int i = 0; i < 3; i++) { if (arr[i] != middle) result = arr[i] - middle; } return abs(result); } int main(int argc, char** argv) { int in; int arr[3][3]; for (i..

https://softeer.ai/practice/6283/history?questionType=ALGORITHM Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 소스코드 #include #include using namespace std; int main() { int n; int temp = 0; string result; for (int i = 0; i > n; if (temp == 0) { temp = n; continue; } int min = n - temp; if (min == 1) { if (result == "") { result = "ascending"; } if (result != "ascending") { result = "mixe..

https://softeer.ai/practice/6284 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 소스코드 #include #include #include #include #include using namespace std; int main() { //바이러스의 수 K, 증가율 P, 총 시간 N(초)이 주어진다. unsigned long long k,p,n; cin >> k >> p>> n; for (int i = 0; i < n; i++) { k = k * p % 1000000007; } cout