백준일지64 [프로그래머스] 후보키 #include #define fastio cin.tie(0)->sync_with_stdio(0)using namespace std;vector candidates; // 이미 검사한 후보키를 등록bool isSubset(int target, int previous){ return ((target & previous) == previous); // 포함되는지}bool check_minimality(int target){ for(int previous : candidates){ if(isSubset(target, previous)) return false; } return true;}bool check_uniqueness(int i, vector> re.. 2025. 4. 14. [백준] 17609번 회문 #include #define fastio cin.tie(0)->sync_with_stdio(0)#define MAX 25using namespace std;int T;vector V;void Input() { cin >> T; for (int i = 0; i > S; V.push_back(S); }}int palindrome(int left, int right, int deleted, string str) { while (left [참고]https://yabmoons.tistory.com/704 2025. 4. 13. [백준] 1738번 병든 나이트 #include #define fastio cin.tie(0)->sync_with_stdio(0)using namespace std;int main () { fastio; int n, m; cin >> n >> m; if (n == 1) cout [참고]https://novlog.tistory.com/entry/CC-BOJ%EB%B0%B1%EC%A4%80-1783-%EB%B3%91%EB%93%A0-%EB%82%98%EC%9D%B4%ED%8A%B8-%EB%AC%B8%EC%A0%9C-%ED%92%80%EC%9D%B4-%EC%86%8C%EC%8A%A4-%EC%BD%94%EB%93%9C [설명]병든 나이트; 여행하는 칸 수 최소로이동횟수가 4보다 크면 이동 방법을 모두.. 2025. 4. 12. [프로그래머스] 순위 검색 #include #define fastio cin.tie(0)->sync_with_stdio(0)#define long long size_tusing namespace std;map> scores;void storeScore(vector> &tmp, int score) { string c1, c2, c3, c4; for (int i=0; i solution(vector info, vector query){ vector answer; vector> tmp(4, vector(2,"-")); for(int i=0; i>s){ if(idx>s){ if(s=="and") continue; if(idx 참고https://c.. 2025. 4. 12. 이전 1 2 3 4 ··· 16 다음