![[C++] 백준 3단계 - 15552번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Fl15EO%2Fbtr53DEABwf%2FAAAAAAAAAAAAAAAAAAAAAAZJU0ihT7e7Z9tmfT1C4KSJJ0dCjWzUSB0UlGBgQAvk%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1759244399%26allow_ip%3D%26allow_referer%3D%26signature%3DTDxKxGYs%252F0wfOiVE5C6EdswuLBs%253D)
문제설명 소스코드 #include using namespace std; int main() { int T, a, b; ios_base::sync_with_stdio(false); cin.tie(NULL); cin >> T; for (int i = 0; i > a >> b; cout
![[C++]백준 2단계 - 2753번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Flv8Ny%2FbtrRqE5eB8E%2FAAAAAAAAAAAAAAAAAAAAAE08x3TAQ6ZlI1ngx_jXyMOSaWklXELc2E1ko84aHgwu%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1759244399%26allow_ip%3D%26allow_referer%3D%26signature%3DNSkbLdPFn9cuM6%252BoghECla20xMM%253D)
먼저 이 코드를 보면 쉬울 것이다. #include using namespace std; int main() { int year = 20; if (year % 4 == 0 && (true || true))cout
![[C++]백준 2단계 - 9498번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FYHk1O%2FbtrRn6BE77H%2FAAAAAAAAAAAAAAAAAAAAAK_Gj3S96-gF6qOGyhvljDjHIENAVRGAXfXsYvxrk0sy%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1759244399%26allow_ip%3D%26allow_referer%3D%26signature%3DdhwT4KZquao7CcjEPkXwbfL5BZA%253D)
전형적인 if문 문제 #include using namespace std; int main() { int score; cin >> score; if (score = 90)cout = 80)cout = 70)cout = 60)cout
![[C++]백준 2단계 - 1330번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Fc6dDfZ%2FbtrRn0nXtLd%2FAAAAAAAAAAAAAAAAAAAAACH1Et2dEW_CcZDT-rpHy5ImAsvcV3v52GGhrw5CXejV%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1759244399%26allow_ip%3D%26allow_referer%3D%26signature%3D04iAH3G655bK5UhMBP%252F%252BBsw3YN8%253D)
간단한 if문 문제 #include using namespace std; int main() { int a, b; cin >> a >> b; if (a < b)cout b) cout
![[C++]백준 1단계 - 10171번, 10172번, 25083번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FyX9QM%2FbtrRoqNxSj2%2FAAAAAAAAAAAAAAAAAAAAAE5Cp3e3r6ylRKfpOSgN35hGrf6rlZxQtEXD6CpwOWkb%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1759244399%26allow_ip%3D%26allow_referer%3D%26signature%3DukIQxsFtLRLA1gFO%252FAThW4R6Ri4%253D)
#include using namespace std; int main() { cout
![[C++]백준 1단계 - 2588번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FApJR8%2FbtrRpo9vUyF%2FAAAAAAAAAAAAAAAAAAAAAJqFXylBtYX9rlS1oeg77ur4oyGl_VvLHELhUa-b09-o%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1759244399%26allow_ip%3D%26allow_referer%3D%26signature%3DKNSsWcWaUS7whPhmARomWU0JojI%253D)
초반엔 막힘 없이 풀다가 갑자기 어렵게 생각해서 중반에 생각이 많았던 문제 먼저 385의 일의 자리를 어떻게 구하느냐? 그냥 10으로 나눈 나머지를 구하면 된다. int a = 385 % 10; //a에 5가 저장된다. 같은 방식으로 385의 십의 자리는 int b = 385 % 100; // a에는 85가 저장된다. b = b / 10; //이러면 8이 저장된다. 백의 자리는 int c = 385 / 100 //이러면 3이 저장된다. 여기까지 생각해냈다면 절반정도 푼거다. 마지막으로 472 a = 2,360이 된다. 472 b = 3,776이 된다. 즉, 37760이 나와야 하는데 10이 덜 곱해진 거다. 따라서 10을 곱해주면 된다. 472 * c = 1,416이 된다 따라서 100을 곱해주면 된다...
![[C++]백준 1단계 - 10430번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FLMlDj%2FbtrRqF37YNo%2FAAAAAAAAAAAAAAAAAAAAAEJ0MgbMH_yHZSaNNRLrGdSfNHL0RgkNCBDs8ExPVKyT%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1759244399%26allow_ip%3D%26allow_referer%3D%26signature%3DXygJV1LgcFwM9TWaJKsxxihH9co%253D)
#include using namespace std; int main() { int a, b, c = 0; cin >> a >> b >> c; cout
![[C++]백준 1단계 - 3003번 문제](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2F5mROS%2FbtrRpERVt8W%2FAAAAAAAAAAAAAAAAAAAAAL3JUBLA-4nVUcv1ZY8HRTit1LySvs0E3drP0k7cd2qI%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1759244399%26allow_ip%3D%26allow_referer%3D%26signature%3DoyeJnq2isqqXvMMI%252B0VnRaBJEVI%253D)
예를 들어 2개 있어야 할 나이트가 1개 있다면 1을 출력하고 0개 있다면 2, 2개 있다면 0을 출력해야한다. 만약에 더 많이 있다면, 3개를 가지고 있다면 -1을 출력해야한다. 이건 걍 원래 있어야 할 개수에서 현재 가지고 있는 수를 빼주면 된다. #include using namespace std; int main() { int a, b, c, d, e, f = 0; cin >> a >> b >> c >> d >> e >> f; cout