lickelon.log

문제 링크 : boj.kr/2777난이도 : S2태그 : 그리디코드#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 T; cin >> T; while(T--) { int n; cin >> n; int ans = (n==1); for(int i = 9; i > 1; i--..

문제 링크 : boj.kr/1991난이도 : S1태그 : 트리, 재귀코드#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;void traversal(vector tree, int node, int mode) { if(node == -19) return; auto [l, r] = tree[node]; if(mode == -1) cout > n; vector tree(n); for(int i = 0; i > a >> b >> c; ..

문제 링크 : boj.kr/6616난이도 : S3태그 : 문자열코드#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); while(true) { int N; cin >> N; if(N == 0) break; string s; getline(cin, s); getlin..

문제 링크 : boj.kr/9324난이도 : S4태그 : 문자열코드#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 T; cin >> T; while(T--) { string s; cin >> s; int cnt[26] = {}; bool flag = true; ..

문제 링크 : http://boj.kr/1980난이도 : S4태그 : 수학, 브루트포스코드#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, t; cin >> n >> m >> t; pii ans = {0, INF}; for(int i = 0; i*n k) { ans = {i+j, k..

문제 링크 : boj.kr/2090난이도 : S4태그 : 수학, 정수론코드#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; cin >> n; vector arr(n); ll mult = 1; ..

문제 링크 : boj.kr/2312난이도 : S3태그 : 정수론, 에라토스테네스의 체코드#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;vector sieve(int n) { vector primes; vector check(n+1, true); for(int i = 2; i > T; while(T--) { int n; cin >> n; map _m; for(auto p : primes) ..

문제 링크 : boj.kr/7585난이도 : S4태그 : 문자열, 스택코드#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); while(true) { string s; getline(cin, s); if(s[0] == '#') break; stack _st; bool flag ..

문제 링크 : boj.kr/20118난이도 : 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, m; cin >> n >> m; vector ans; for(int i = 0; i m) { for(int i = m; i 풀이$A \oplus A=0$을 이용하는..

문제 링크 : boj.kr/1516난이도 : G3태그 : 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;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector>> arr(n); for(auto &e : arr) { cin >> e.first; while(true) { int in..