![[C++] 백준 5단계 - 5622번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FuQrX4%2Fbtr7NQW6sO6%2F3GeHhIqmlHiWWzIpZNh4Ak%2Fimg.png)
문제설명 소스코드 #include using namespace std; int main() { string input; int sum = 0; cin >> input; for (int i = 0; i < input.length(); ++i) { if (input[i] == 'A' || input[i] == 'B' || input[i] == 'C') sum += 3; else if (input[i] == 'D' || input[i] == 'E' || input[i] == 'F') sum += 4; else if (input[i] == 'G' || input[i] == 'H' || input[i] == 'I') sum += 5; else if (input[i] == 'J' || input[i] == 'K' ..
![[C++] 백준 5단계 - 2908번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FbaPyPn%2Fbtr7n06XWdR%2F8c5Aqwkya66AkRFPP8GWQ1%2Fimg.png)
문제설명 소스코드 #include #include using namespace std; int main() { string a; string b; cin >> a >> b; for (int i = 0; i d ? cout
![[C++] 백준 5단계 - 1152번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FcmqdY1%2Fbtr7gQcYCdw%2FXRkeGfrbLtHhd5GKm59at1%2Fimg.png)
문제설명 소스코드 #include #include using namespace std; int main() { string input; int count = 0; getline(cin, input); if (input.empty() || ((input[0] == ' ') && input.length() == 1)) { //문자열이 없거나 있어도 공백을 포함한 1글자라면 0을 출력한다. cout
![[C++] 백준 5단계 - 2675번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FbnspDq%2Fbtr7iK4opde%2FN5gBYn48djxMnCxJCOD9eK%2Fimg.png)
문제설명 소스코드 #include using namespace std; int main() { int T; int N; string input; cin >> T; for (int i = 0; i > N >> input; for (int j = 0; j < input.length(); ++j) { for (int k = 0; k < N; ++k) cout
![[C++] 백준 5단계 - 10809번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FbaplLX%2Fbtr7gycvVpl%2FnisByK8uOUgrjLvWwfPdW0%2Fimg.png)
문제설명 소스코드 #include using namespace std; int main() { string input; string alphabet = "abcdefghijklmnopqrstuvwxyz"; cin >> input; for (int i = 0; i < alphabet.length(); ++i) { if (input.find(alphabet[i]) != string::npos) { cout
![[C++] 백준 5단계 - 11720번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FcFUtXT%2Fbtr7hve2oOJ%2FiKMwrbd1jIq2BVNvjA23iK%2Fimg.png)
문제설명 소스코드 #include #include //stoi()함수를 쓰기위해 using namespace std; int main() { string input; int N; int sum = 0; string tmp; cin >> N; cin >> input; for (int i = 0; i N; for (int i = 0; i > input; sum += input - 48; } cout
![[C++] 백준 5단계 - 11654번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2F3y7Ho%2Fbtr7f0mNXE0%2FZJjPUt97SknK6MCq0BKRG1%2Fimg.png)
문제설명 소스코드 #include using namespace std; int main() { char input; cin >> input; cout
![[C++] 백준 5단계 - 9086번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2FKHX9p%2Fbtr7mtgFN0v%2FCXP3yJQ2lkkUd2fIk75Ky1%2Fimg.png)
문제설명 소스코드 #include using namespace std; int main() { int N; string input; cin >> N; for (int i = 0; i > input; cout