lickelon.log

문제 링크 : boj.kr/31885난이도 : G3태그 : 애드혹, set코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;ll dist(pll a, pll b) { return abs(a.first-b.first) + abs(a.second-b.second);}int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; set _s..

문제 링크 : boj.kr/31851난이도 : G4태그 : 브루트포스, 기하학코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;#define x first#define y secondtemplate istream& operator>>(istream & ist, pair &p) { ist >> p.first >> p.second; return ist;}template istream& operator>>(istream & ist, vector &arr..

문제 링크 : boj.kr/1976난이도 : G4태그 : 분리 집합코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int p[201];int find(int a) { if(a == p[a]) return a; return p[a] = find(p[a]);}void merge(int a, int b) { int fa = find(a); int fb = find(b); if(fa != fb) p[fa] = fb;}int main(){..

문제 링크 : boj.kr/1188난이도 : G4태그 : 정수코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;ll gcd(ll a, ll b){ if (!b) return a; return gcd(b, a % b);}int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m; cin >> n >> m; cout 풀이소세지를 일렬로 늘어놓는다. 일렬로 늘..

문제 링크 : boj.kr/31873난이도 : G2태그 : 해 구성하기, 애드혹코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, k; cin >> n >> k; if(k == 1 || (k == n && k % 2 == 1)) { cout 풀이불가능한 경우부터 제외하자. k가 1인 경우 당연히 불가..

문제 링크 : boj.kr/23749난이도 : G4태그 : BFS코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;bool eval(string str) { int score = 0; for(int i = 0; i 0) return true; else return false;}int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; ..

문제 링크 : boj.kr/31858난이도 : G4태그 : 애드혹, 스택코드#include #define all(x) (x).begin(), (x).end()#define INF 987654321#define int llusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;istream& operator>>(istream & ist, pii &p) { ist >> p.first >> p.second; return ist;}template istream& operator>>(istream & ist, vector &arr) { for(auto &u : arr) ist >..

문제 링크 : boj.kr/1531난이도 : G5태그 : DP, 맵코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;unordered_map _m;ll p, q;ll dp(ll n) { if(_m.find(n) != _m.end()) return _m[n]; return _m[n] = (dp(n/p) + dp(n/q));}int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(..

문제 링크 : boj.kr/29792난이도 : G5태그 : 브루트포스코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, m, k; cin >> n >> m >> k; vector arr(n); for(auto &u : arr) cin >> u; vector boss(k); for(auto &u :..

문제 링크 : boj.kr/14370난이도 : G4태그 : 문자열, 애드혹코드#include #define all(x) (x).begin(), (x).end()#define INF 0x7FFFFFFFusing namespace std;using ll = long long;using ld = long double;using pii = pair;using pll = pair;string numStr[] = {"ZERO", "TWO", "FOUR", "SIX", "EIGHT", "ONE", "THREE", "FIVE", "SEVEN", "NINE"};int numInt[] = {0, 2, 4, 6, 8, 1, 3, 5, 7, 9};int check[] = {0, 1, 2, 2, 2, 0, 1, 0, 0, 1}..