C++) #include #include #include #include using namespace std; int main(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n, m, temp; cin >> n >> m; vector v; for (int i = 0; i > temp; v.push_back(temp); } deque dq; for (int i = 1; i
C++) #include #include #include #include using namespace std; int main(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); int t, n; cin >> t; string p, num; while (t--) { cin >> p;// 수행할 함수 cin >> n;// 배열에 들어있는 갯수 cin >> num;// 정수들 // 정수들을 덱에 집어넣기 deque dq; string arr = ""; for (auto ele : num) { if (ele != ',' && ele != '[' && ele != ']') arr += ele; else { if (arr != "") dq.push_back(..
C++) #include #include using namespace std; int main(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; queue q; for(int i = 1; i
C++) #include #include #include #define endl "\n" using namespace std; int main(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; string str; queue q; for (int i = 0; i > str; switch (str[1]) { case 'u': int temp; cin >> temp; q.push(temp); break; case 'o': if (q.empty()) cout
C++) #include #include #include using namespace std; int main(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; long long ans = 0; int temp = 0; stack st; map m; while(n--) { cin >> temp; while (!st.empty() && st.top() < temp) { m[st.top()]--; st.pop(); ans++; } if (!st.empty()) { if (st.top() == temp) { if (st.size() == m[temp]) ans += st.size(); else ans += (m[temp] ..
C++) #include #include using namespace std; int main(void) { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; long long ans = 0; int temp = 0; stack st; for(int idx = 1; idx > temp; while (!st.empty() && st.top()
C++) #include using namespace std; int GetDivisor(int number){ int ans = 0; for (int i = 1; i limit else temp) return ans
#include #include #include using namespace std; vector solution(int n, int m) { int a = max(n,m); int b = min(n,m); while(b != 0) { int temp = a; a = b; b = temp % b; } return {a, n * m / a}; } - 유클리드 호제법 : https://tech.lonpeach.com/2017/11/12/Euclidean-algorithm/ Python) def solution(n, m): a = max(n,m) b = min(n,m) while b != 0: temp = a a = b b = temp%b return [a, n*m/a]
C++) #include #include #include using namespace std; int solution(vector nums) { map m; for(auto num : nums) m[num] = true; return min(m.size(), nums.size()/2); } Python) def solution(nums): arr = {} for num in nums: arr[num] = 1 return min(len(arr), len(nums)/2)
C++) #include #include #include using namespace std; vector solution(int n, vector arr1, vector arr2) { vector answer; for(int idx = 0; idx < n; idx++) { int num = (arr1.at(idx) | arr2.at(idx)); string str = ""; for(int i = 0; i < n; i++) { str = ((num % 2 == 0) ? ' ' : '#') + str; num /= 2; } answer.push_back(str); } return answer; } Python) def solution(n, arr1, arr2): ans = [] for i in range(..
