[알고리즘] 백준 3449 - 해밍 거리 (C++) [문제 링크] : https://www.acmicpc.net/problem/3449#include using namespace std;int main(){ string A, B; int T; cin >> T; for(int i=0; i> A >> B; int cnt = 0; for(int j=0; j 알고리즘 2025.02.28
[알고리즘] 백준 17202 - 핸드폰 번호 궁합 (C++) [문제 링크] : https://www.acmicpc.net/problem/17202#include using namespace std;string A, B, S = "";int main(){ cin >> A >> B; for(int i=0; i 2){ for(int i=0; i 알고리즘 2025.02.27
[알고리즘] 백준 2858 - 기숙사 바닥 (C++) [문제 링크] : https://www.acmicpc.net/problem/2858#include using namespace std;int R, B, S;bool flag;void solve(int cnt, int tmp){ int r = 0, b = 0; for(int i=0; i> R >> B; S = R + B; int l = 1; while(true){ if(S % l == 0){ int tmp = l; int cnt = S / l; solve(tmp, cnt); if(flag == true){ cout 알고리즘 2025.02.27
[알고리즘] 백준 29731 - 2033년 밈 투표 (C++) [문제 링크] : https://www.acmicpc.net/problem/29731#include #include using namespace std;long long T;string S;string check[7] = { "Never gonna give you up", "Never gonna let you down", "Never gonna run around and desert you", "Never gonna make you cry", "Never gonna say goodbye", "Never gonna tell a lie and hurt you", "Never gonna stop"};int main(){ .. 알고리즘 2025.02.25
[알고리즘] 백준 13597 - Tri-du (C++) [문제 링크] : https://www.acmicpc.net/problem/13597#include using namespace std;int main(){ int A, B; cin >> A >> B; if(A > B || A == B){ cout 알고리즘 2025.02.24
[알고리즘] 백준 10419 - 지각 (C++) [문제 링크] : https://www.acmicpc.net/problem/10419#include using namespace std;int main(){ int T, tmp, Ans = 0; cin >> T; for(int i=0; i> tmp; for(int j=0; j*j+j Ans){ Ans = j; } } cout 알고리즘 2025.02.23
[알고리즘] 백준 5928 - Contest Timing (C++) [문제 링크] : https://www.acmicpc.net/problem/5928#include using namespace std;int D, H, M;int main(){ cin >> D >> H >> M; int tmp = 11 + 11 * 60 + 11 * 60 * 24; int Ans = M + H * 60 + D * 60 * 24 - tmp; if(Ans 알고리즘 2025.02.22
[알고리즘] 백준 29699 - Welcome to SMUPC (C++) [문제 링크] : https://www.acmicpc.net/problem/29699#include using namespace std;int main(){ int N; string S = "WelcomeToSMUPC"; cin >> N; cout 알고리즘 2025.02.21
[알고리즘] 백준 26209 - Intercepting Information (C++) [문제 링크] : https://www.acmicpc.net/problem/26209#include using namespace std;int main(){ bool flag = false; int inp; for(int i=0; i> inp; if(inp == 9){ flag = true; } } if(flag == true){ cout 알고리즘 2025.02.20
[알고리즘] 백준 27389 - Metronome (C++) [문제 링크] : https://www.acmicpc.net/problem/27389#include using namespace std;int main(){ int N; cin >> N; double Ans = N / 4.0; cout 알고리즘 2025.02.19