https://www.acmicpc.net/problem/1541
#include <iostream>
#include <string>
#include <vector>
using namespace std;
int main() {
string mathExpression;
cin >> mathExpression;
std::vector<string> v;
int offset = 0;
while (true) {
int size = mathExpression.find('-', offset);
if (size == string::npos) {
v.push_back(mathExpression.substr(offset));
break;
}
v.push_back(mathExpression.substr(offset, size - offset));
offset = size + 1;
}
vector<int> v1;
int size = v.size();
for (int i = 0; i < size; ++i) {
int tmp = 1;
int sum = 0;
for (int j = v[i].size() - 1; j >= 0; --j) {
if (v[i][j] - '0' > 9 || v[i][j] - '0' < 0) {
tmp = 1;
continue;
}
sum += (v[i][j] - '0') * tmp;
tmp *= 10;
}
v1.push_back(sum);
}
int sum = v1[0] * 2;
for (auto& it : v1) {
sum -= it;
}
cout << sum;
return 0;
}
'백준' 카테고리의 다른 글
백준 1929번(silver 3) (0) | 2025.03.14 |
---|---|
백준 1931번 (Gold 5) (0) | 2025.03.12 |
백준 1744번(Gold 4) (0) | 2025.03.12 |
백준 1715번 (Gold 4) (0) | 2025.03.11 |
백준 1300번(Gold 1) (0) | 2025.03.10 |