![[C++] 백준 10단계 - 9063번 문제 (대지)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FzYQGV%2FbtsfjKBoK8P%2FAAAAAAAAAAAAAAAAAAAAABiOOjyqUyJvFdf0a-WhmLaepEWUTT2T9jiYpdY_JKC0%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DqfrlOH3UOguk8ueJEts1hbmTAW8%253D)
문제설명 소스코드 #include using namespace std; int main() { int N; int minx = 100000; int maxx = -100000; int miny = 100000; int maxy = -100000; cin >> N; int* x = new int[N]; //N만큼 동적할당 int* y = new int[N]; //N만큼 동적할당 for (int i = 0; i > x[i] >> y[i]; if (minx > x[i]) minx = x[i]; if (maxx y[i]) miny = y[i]; if (maxy < y[i]) maxy = y[i]; } cout
![[C++] 백준 10단계 - 15894번 문제 (수학은 체육과목 입니다)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Fb202Nl%2Fbtsfbjr0wUr%2FAAAAAAAAAAAAAAAAAAAAAOmk09jE8MBSBm5Z6s79Sh32dslrH96LBjU5niJB6J7V%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DwaG5ouiu8%252BHYM5Zwy2Ufja9Laqg%253D)
문제설명 소스코드 #include using namespace std; int main() { unsigned int N; cin >> N; cout
![[C++] 백준 10단계 - 3009번 문제 (네 번째 점)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2F3gQWf%2FbtsfdqcSkCf%2FAAAAAAAAAAAAAAAAAAAAAIb_w3quI4OKNuWw1kkhc3ltVjCOEf4cogqddVuj726p%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3Df71c5kLAAobwoGds3sLcjx3aLjc%253D)
문제설명 소스코드 #include using namespace std; int main() { int x[3]; int y[3]; for (int i = 0; i > x[i] >> y[i]; if (x[0] == x[1]) cout
![[C++] 백준 9단계 - 11653번 문제 (소인수분해)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FcGIVLd%2FbtsftIpBYNx%2FAAAAAAAAAAAAAAAAAAAAAOFLI10NkhztDoGlcfRm4Sp8zLIVEDVF_gO22o0oBhCV%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DboEtNz%252FvBXhciE1XquQzvfL1aKM%253D)
문제설명 소스코드 #include using namespace std; int main() { int N; cin >> N; if (N != 1) for (int i = 2; i
![[C++] 백준 9단계 - 2581번 문제 (소수)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FbC0vhT%2FbtsfaNMBhAF%2FAAAAAAAAAAAAAAAAAAAAAGcwbmry0JZd6GGywbQqPe8bOOTTaePDqz5zWVTN6i28%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DYkL9MFsslxJprAA9yVyer%252Fn%252BS5w%253D)
문제설명 소스코드 #include using namespace std; int main() { int N, M; int sum = 0; int min = 10000; bool flag = false; bool flag2 = false; cin >> N >> M; for (int i = N; i
![[C++] 백준 9단계 - 1978번 문제 (소수 찾기)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FekLQYB%2FbtsfbzfUC73%2FAAAAAAAAAAAAAAAAAAAAAEzibzpWrgdsI-x75jko51ARtRprp6VVo_VuvYgEqcJO%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DZC3ACtxxIUSk3KZthe5LWVO1bEw%253D)
문제설명 소스코드 #include using namespace std; int main() { int N, input; int count = 0; bool flag = false; cin >> N; for (int i = 0; i > input; for (int j = 2; j < input; ++j) //1과 자기 자신만으로 나누어 떨어지는 1보다 큰 양의 정수. { //즉, 1과 자기 자신 외에 수로 나누어 떨어지면 소수가 아님 if (flag == true) break; // 소수가 아니라고 이미 판정되었으면 반복할 필요가 없음 if (input % j == 0) flag = true; //1과 자기 자신 외에 수로 나누어 떨어지면 flag = true } if (in..
![[C++] 백준 9단계 - 9506번 문제 (약수들의 합)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FbBnsC4%2FbtseRqcSv0w%2FAAAAAAAAAAAAAAAAAAAAAGCM8EWyP3i5Oy4qkg8bUnWHW6DEOcHy4IUp3jT1M0PM%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3D32wt9Dp0QzztfhIenTAqN8kw6do%253D)
문제설명 소스코드 #include using namespace std; int main() { int N; int count = 0; int sum = 0; while (true) { cin >> N; if (N == -1) break; int* arr = new int[N]; //동적 할당 for (int i = 1; i < N; ++i) { if (N % i == 0) //i로 나눈 나머지가 0이라면 { arr[count++] = i; //배열에 i를 저장 sum += i; //sum에 i를 더함 } } if (sum == N) //완전수라면 { cout
![[C++] 백준 9단계 - 2501번 문제 (약수 구하기)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FbwlvLe%2FbtseK6LHyj8%2FAAAAAAAAAAAAAAAAAAAAAI8S2aeRT0OTsk_s3Is4v-Nhk7ZRdfgpOR1OCtGgZTvC%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DhhhgN9Rrjn3pB17PMFFaBfEdTbE%253D)
문제설명 소스코드 #include using namespace std; int main() { int N, K; int count = 0; cin >> N >> K; int* arr = new int[N]; for (int i = 1; i