Hueestory

#include #include #include using namespace std;vector solution(vector record) { vector answer; map m1; vector> tmp; for (auto x : record){ int a = x.find(" "); int b = x.find(" ", a + 1); string ioc = x.substr(0, a); string uid = x.substr(a + 1, b - a - 1); if (ioc == "Enter"){ string name = x.substr(b + 1); m1[uid..

#include #include #include #include using namespace std;vector solution(vector fees, vector records) { vector answer; map tmp, cnt; for (auto s : records){ int time = stoi(s.substr(0, 2)) * 60 + stoi(s.substr(3, 2)); int car_num = stoi(s.substr(6, 4)); if (s.substr(11) == "IN") tmp[car_num] = time; else{ cnt[car_num] += time - tmp[car_num]; ..

#include #include #include #include using namespace std;string solution(string new_id) { // 1단계 transform (new_id.begin(), new_id.end(), new_id.begin(), ::tolower); // 2단계 string tmp = ""; for (auto x : new_id){ if (isalpha(x) || isdigit(x) || x == '-' || x == '_' || x == '.') tmp += x; } new_id = tmp; tmp = ""; // 3단계 for (auto x : new..

#include #include #include #include #include using namespace std;bool isPrime(long long num){ if (num 0){ s += to_string(n % k); n /= k; } reverse(s.begin(), s.end()); string tmp = ""; for(char x : s){ if(x == '0'){ if(!tmp.empty() && isPrime(stoll(tmp))) answer++; tmp = ""; } else tmp += x; } i..

#include #include #include using namespace std;bool cmp(pair &a, pair &b) { if (a.first == b.first) return a.second b.first;}vector solution(int N, vector stages) { vector answer(N); vector> rate; for (int i = 1; i