![[C++] 백준 6단계 - 1316번 문제 (그룹 단어 체커)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Fbgtku5%2Fbtsaw9lyVgU%2FAAAAAAAAAAAAAAAAAAAAAJ3yELRYDQdRJ69njftnmjicw2NAPoah7ZmkPVog8xR8%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DlUwa7LzAyIAusdPkzWPNkCEf3dU%253D)
문제설명 소스코드 #include using namespace std; int main() { string input; int N; int count = 0; cin >> N; for (int i = 0; i > input; for (int j = 0; j < input.length(); ++j) { for (int u = 0; u < j; ++u) { if ((input[j] == input[u]) && (input[j] != input[j - 1])){ TF = false; break; } } } if (TF) ++count; } cout
![[C++] 백준 6단계 - 2941번 문제 (크로아티아 알파벳)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FVB2jg%2Fbtsah9tvt2u%2FAAAAAAAAAAAAAAAAAAAAADgGlXNPhk_GOh7E4ffDz3c_WMY7mYyK6T2muVqWMbQ5%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DoHMydh1K3QdZOr7q9rJumdrsTjc%253D)
문제설명 소스코드 #include using namespace std; int main() { string input; cin >> input; while (true) { if ((input.find("nj") != string::npos) || (input.find("c=") != string::npos) || (input.find("c-") != string::npos) || (input.find("dz=") != string::npos) || (input.find("d-") != string::npos) || (input.find("lj") != string::npos) || (input.find("s=") != string::npos) || (input.find("z=") != string::np..
![[C++] 백준 - 10039번 문제 (평균 점수)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FKjDXB%2Fbtsaiqovnxh%2FAAAAAAAAAAAAAAAAAAAAAKtRv-ScKN4CtEPGfwBEjp08j1jgVTKWFZ9udiF5XZIV%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DsO2qhLlOhS4hyYhZh9IEon1vx%252Bk%253D)
문제설명 소스코드 #include using namespace std; int main() { int sum = 0; for (int i = 0; i > n; if (n
![[C++] 백준 6단계 - 1157번 문제 (단어 공부)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FOp5t0%2Fbtr9si6ye2A%2FAAAAAAAAAAAAAAAAAAAAAKy_SO-91JyHR4LYI2EmmSpMf-sClS_qKnZ5zlCYA3R1%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3D4AVUfmmn8XnCOSsfZnDGdurAuv8%253D)
문제설명 소스코드 #include using namespace std; int main() { int arr[26] = { 0 }; int max = 0; int count = 0; int idx = 0; string input; cin >> input; for (int i = 0; i max){ max = arr[i]; idx = i; } //가장 많이 사용된 알파벳 검사 for (int i = 0; i < 26; ++i) i..
![[C++] 백준 6단계 - 10988번 문제 (팰린드롬인지 확인하기)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Fcaio6d%2Fbtr9BIa87sF%2FAAAAAAAAAAAAAAAAAAAAAEkkYHr9iN2-RKpSqLtjCuItdR-RwEPS4WZxQNckKr8j%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DspvF6w4HowR0dGCT014yYKBnxWw%253D)
문제설명 소스코드 #include using namespace std; int main() { string input; cin >> input; for (int i = 0; i < input.length() / 2; ++i) { if (input[i] != input[input.length() - 1 - i]) { cout 4번 반복 input[input.length() - 1 - i] 이부분은 i가 증가할 수록 문자열 인덱스의 끝에서 점점 인덱스의 가운데를 비교하게 한다.
![[C++] 백준 - 5524번 문제 (입실 관리)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FbXDAip%2Fbtr822ixNbf%2FAAAAAAAAAAAAAAAAAAAAABfrRTLlzLcs47W7DyNScbmGiNT8sI4UxxtUQL_HkRyz%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3D%252FZdrqjCcIBiwjVtdRnc%252BMdNvphU%253D)
문제설명 소스코드 #include using namespace std; int main() { int n; string input; cin >> n; for (int i = 0; i > input; for (int i = 0; i < input.length(); i++) { input[i] = tolower(input[i]); } cout
![[C++] 백준 - 5532번 문제 (방학 숙제)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FmxbY7%2Fbtr8LrQxv43%2FAAAAAAAAAAAAAAAAAAAAAB7alraulWFGbWyw5FmPO2vdpEVrw5Cnpb5UbDfaQ0i7%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3D0qqZSKyQ0chJGOVmUoEN1CJrTek%253D)
문제설명 소스코드 #include using namespace std; int main() { int L, A, B, C, D, tmp1, tmp2; cin >> L >> A >> B >> C >> D; if (A % C != 0) tmp1 = (A / C) + 1; else tmp1 = A / C; if (B % D != 0) tmp2 = (B / D) + 1; else tmp2 = B / D; if (tmp1 > tmp2) cout
![[C++] 백준 - 2752번 문제 (세수 정렬)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FumTD8%2Fbtr8InAIqHp%2FAAAAAAAAAAAAAAAAAAAAAOcGdOn2iuczNE3UZtWIDkpdTRoGpoDMRBoCRQiFH-sj%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DQU%252B8lLcJhYiP%252FWGZvge7S%252FPLLDc%253D)
문제설명 소스코드 #include using namespace std; int main() { int arr[3]; for (int i = 0; i > arr[i]; } int tmp; for (int i = 0; i arr[j]) { tmp = arr[j]; arr[j] = arr[i]; arr[i] = tmp; } } } for (int i = 0; i < 3; ++i) { cout