![[C++] 백준 8단계 - 11005번 문제 (진법 변환 2)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FcyzQZQ%2FbtsbTuCUABI%2FAAAAAAAAAAAAAAAAAAAAANzz3hIHCb7gzyJqh0zyvYYR1djgJ5-i1IfB_FJRzNMR%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3D93MTUJRmviI9zrVPuuSru11QJFs%253D)
문제설명 소스코드 #include using namespace std; int main() { long long N; int B; int digits = 0; char arr[20]; string dchar = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"; cin >> N >> B; while (N != 0) { arr[digits++] = dchar[N % B]; N /= B; } for (int i = digits - 1; i >= 0; i--) cout
![[C++] 백준 8단계 - 2745번 문제 (진법 변환)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Fcybm4O%2FbtsbRzY9LKu%2FAAAAAAAAAAAAAAAAAAAAAKJAc2NElgWGZqroBqdSaAcAC6U1DqrX-kZtRrjep9s-%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DcRZlrsZHfebWSS0mndzkbuHmB%252Bk%253D)
문제설명 소스코드 #include #include #include using namespace std; int main() { string N; int B; int result = 0; string dchar = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"; cin >> N >> B; for (int i = 0; i < N.length(); ++i) { int d = dchar.find(N[i]); result += d * pow(B, N.length() - 1 - i); } cout
![[C++] 백준 - 4470번 문제 (줄 번호)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FducBaO%2FbtsbT1zLYc4%2FAAAAAAAAAAAAAAAAAAAAAGMYvdjCQ7dMv6qliUgQYRRO0m6zBDFI2ftji82R1O3z%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3Ddk6YRU0alEmsSh5rFEv%252F2GXHRvs%253D)
문제설명 소스코드 #include #include using namespace std; int main() { int N; string input; cin >> N; cin.ignore(); for (int i = 0; i < N; ++i) { getline(cin, input); cin.clear(); cout
![[C++] 백준 7단계 - 2563번 문제 (색종이)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FcdQNkS%2FbtsbDF4UWCu%2FAAAAAAAAAAAAAAAAAAAAAIdwFS-_brnISkIUJiTGt_8bKMQjsDbewNX9yQHOQ8Sa%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DXe5UNUMfFn3TJXwYNfO6gHRpV%252BE%253D)
문제설명 소스코드 #include using namespace std; int main() { int whitepaper[100][100] = { 0 }; int N; int row; int col; int total = 0; cin >> N; for (int i = 0; i > row >> col; for (int j = row; j col; for (int j = ro..
![[C++] 백준 7단계 - 10798번 문제 (세로읽기)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Febs3NM%2Fbtsa9Kypb0A%2FAAAAAAAAAAAAAAAAAAAAADEMNdgBMUEi65vW2CFiuayfqnk-w1VwOiMH_fP9zAFh%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DVkVm%252BAozfqQ5W2LjtizgGXEgK3Y%253D)
문제설명 소스코드 #include #include using namespace std; int main() { string arr[5]; for(int i = 0; i > arr[i]; for (int i = 0; i i) cout
![[C++] 백준 7단계 - 2566번 문제 (최댓값)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2FbHnDEA%2FbtsaVdCcD42%2FAAAAAAAAAAAAAAAAAAAAADNy755c-rB-Aga3F64sD6NdWrBbsrI4HNjseBK8V5_V%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DjtqfX0UDn9qELWawiXJNzVCk8Xo%253D)
문제설명 소스코드 #include using namespace std; int main() { int arr[9][9]; int input; int max = -1; int x; int y; for (int i = 0; i > input; arr[i][j] = input; if (arr[i][j] > max) { max = arr[i][j]; x = i; y = j; } } } cout
![[C++] 백준 7단계 - 2738번 문제 (행렬 덧셈)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2F1cEj0%2FbtsayU4Fc5b%2FAAAAAAAAAAAAAAAAAAAAAEBn03Pj_51SIp7x7Zt83sfqym_POCZtsNAt2PMYqHHX%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3D4gM2Ko4PJUCabHIKmCU7AKH4eMg%253D)
문제설명 소스코드 #include using namespace std; int main() { int N; int M; cin >> N >> M; int** arr = new int* [N]; //2차원 배열 동적할당을 위한 더블 포인터 선언 for (int i = 0; i > arr[i][j]; //첫 ..
![[C++] 백준 6단계 - 25206번 문제 (너의 평점은)](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdna%2Fw0Qg9%2FbtsaKx8ef97%2FAAAAAAAAAAAAAAAAAAAAADE85QBbHdKBQB2Nb3PSERZJxjC4qzfYj-JKzhOwLU2P%2Fimg.png%3Fcredential%3DyqXZFxpELC7KVnFOS48ylbz2pIh7yKj8%26expires%3D1753973999%26allow_ip%3D%26allow_referer%3D%26signature%3DlAJ1LSy1tHcThmy8qLJ6KSTLJfk%253D)
문제설명 소스코드 #include using namespace std; int main() { string majorName; double avg = 0; float sumGrade = 0; double score[20]; float grade[20]; string input; for (int i = 0; i > majorName >> grade[i] >> input; if (input == "A+") score[i] = 4.5; else if (input == "A0") score[i] = 4.0; else if (input == "B+") score[i] = 3.5; else if (input == "B0") score[i] = 3.0; else if (input ==..