눈송이의 개발생활

문제 https://www.acmicpc.net/problem/10799 코드 #include #include #include using namespace std; int main(void){ cin.tie(0);cout.tie(0); ios_base::sync_with_stdio(false); stack s; string str; int sum=0; cin >> str; for(int i =0; i< str.length(); i++){ if(str.at(i) == &#39;(&#39;) { s.push(str.at(i)); } else{ if(str.at(i-1) == &#39;(&#39;){ s.pop(); sum += s.size(); } else{ s.pop(); sum +=1; } } } cout

문제 https://www.acmicpc.net/problem/10828 코드 #include #include #include using namespace std; int main(void){ cin.tie(0);cout.tie(0); ios_base::sync_with_stdio(false); stack s; int N; cin >> N; for (int i=0; i> command; if (command == "push"){ int n; cin >> n; s.push(n); } else if (command == "pop"){ if(s.empty()) cout

문제 https://www.acmicpc.net/problem/1448 코드 #include #include #include #include using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(0), cout.tie(0); int N; int array[1000000]; cin >> N; for (int i=0; i> array[i]; } sort(array, array+N, greater()); int i=0; int total; while(i biggest){ total = biggest+ array[i+1]+ array[i+2]; break; } else { i++; total = -1; } } cout

문제 https://www.acmicpc.net/problem/11582 코드 #include #include #include using namespace std; int sorted[1048576]; int N; int stu; int array[1048576]; void merge(int a[], int m, int middle, int n){ if((n-m)>(N/stu)) return; int i = m; int j = middle + 1; int k = m; while (i

문제 https://www.acmicpc.net/problem/10610 코드 #include #include #include #include #include using namespace std; int main(){ ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); string str; cin >> str; vector v; //더해서 3의 배수인지 보기 int total =0; for (int i=0; i

문제 https://www.acmicpc.net/problem/11931 코드 #include #include #include #include using namespace std; void init(){ cin.tie(0); cout.tie(0); ios_base::sync_with_stdio(false); } int main(){ int num; cin >> num; vector v; for (int i =0; i> input; v.insert(v.begin() + i, input); } sort(v.begin(), v.end(), greater()); for(int i : v){ cout