발자취

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/7628 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai소스코드#include #include using namespace std;int main(){ int n, v; cin >> n; vector list; for (int i = 0; i > v ; list.push_back(v); } sort(list.begin(), list.end()); int result = 0 ; int count = 0; for (int i = 2; i

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

https://softeer.ai/practice/7626 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 소스코드 #include #include #include #include #include using namespace std; int main(int argc, char** argv) { int a,b; cin >> a; vector list; map m; for (int i = 0; i > b; list.push_back(b); } int temp = list[0]; for (int i = 1; i < list.size(); i++) { int min = list[i] - temp; m[min] += 1; temp = list[i]; } int ..

https://softeer.ai/practice/7695 Softeer - 현대자동차그룹 SW인재확보플랫폼 softeer.ai 틀렸는데 피드백좀해주세요 ㅠ 소스코드 #include #include #include #include using namespace std; int main(int argc, char** argv) { int n; cin >> n; cin.ignore(); string maxStr; int max = 0; for (int i = 0; i > a >> b; int result = abs(a - b); if (max < result) { max = result; maxStr = to_string(a)+" "+ to_string(..