발자취

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

https://softeer.ai/practice/6288/history?questionType=ALGORITHM Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 소스코드 #include #include #include #include #include using namespace std; int main() { int bag, n; cin >> bag >> n; int m;//무게 int p;//가격 vector pm; int result = 0; for (int i = 0; i > m >> p; pm.push_back({ p,m }); } sort(pm.begin(), pm.end(), greater()); for (int i = 0; i < pm.s..

https://softeer.ai/practice/7703/history?questionType=ALGORITHM Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 소스코드 #include using namespace std; int main() { int n; cin >> n; string a, b; string result; for (int i = 0; i > a >> b; for (int i = 0; i < a.size(); i++) { a[i] = toupper(a[i]); } size_t idx = a.find("X"); string temp = b.substr(idx, 1); result+= toupper(temp[0]); } cout

https://softeer.ai/practice/7368 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 소스코드 #include #include #include #include #include using namespace std; int main(int argc, char** argv) { int a,b,d; cin >> a>>b>>d; int destint = d * 2; int curdir =0; int time =0; int temp = 0; bool isFront = false; while (destint != curdir) { if (isFront == false) { for (int i = 0; i < a; i++) { time += 1; curdir += 1; if ..

https://softeer.ai/practice/7353 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 소스코드 #include #include #include #include #include using namespace std; int main(int argc, char** argv) { int n; cin >> n; vector inputs; int input, max = -100000; for (int i = 0; i > input; inputs.push_back(input); } int mul; for (int i = 0; i < inputs.size(); i++) { for (int j = i + 1; j < inputs.size(); j+..