블루베리의 블로그

[문제 링크] : https://www.acmicpc.net/problem/14470#include using namespace std;int main(){ int A, B, C, D, E; cin >> A >> B >> C >> D >> E; if(A

[문제 링크] : https://www.acmicpc.net/problem/2702#include using namespace std;int gcd(int a, int b){ if(b == 0) return a; else return gcd(b, a % b);}int main(){ int T, A, B, G; cin >> T; while(T--){ cin >> A >> B; G = gcd(A, B); cout

[문제 링크] : https://www.acmicpc.net/problem/9076#include #include #include using namespace std;int main(){ int N; cin >> N; for(int i=0; i V; int inp; for(int j=0; j> inp; V.push_back(inp); } sort(V.begin(), V.end()); if(V[3] - V[1] >= 4){ cout

[문제 링크] : https://www.acmicpc.net/problem/14696#include using namespace std;int A[5];int B[5];int main(){ int N, M, L, inp; cin >> N; for(int i=0; i> M; for(int j=0; j> inp; A[inp]++; } cin >> L; for (int j=0; j> inp; B[inp]++; } for(int j=4; j>0; j--){ if(A[j] > B[j]){ cout A[j]){ ..

[문제 링크] : https://www.acmicpc.net/problem/25238#include using namespace std;int main(){ int A, B; cin >> A >> B; int C = A * (100 - B) / 100; if(C >= 100){ cout

[문제 링크] : https://www.acmicpc.net/problem/14924#include using namespace std;int main(){ int S, T, D; cin >> S >> T >> D; cout

[문제 링크] : https://www.acmicpc.net/problem/8437#include #include #include using namespace std;string remove(string s){ int idx = s.size(); for(int i=0; i= 10){ c = true; tmp -= 10; } s[s.size() - i - 1] = tmp + '0'; } if(c > 0){ s.insert(s.begin(), '1'); } return remove(s);}bool comp(string s1, string s2){ if(s1.size() != s2.size()){..

[문제 링크] : https://www.acmicpc.net/problem/14697#include using namespace std;int A, B, C, N;void solve(){ for(int i=0; i> A >> B >> C >> N; solve(); return 0;}

[문제 링크] : https://www.acmicpc.net/problem/5052#include #include #include using namespace std;int main(){ int T, N; cin >> T; string S; while(T--){ cin >> N; vector V; for(int i=0; i> S; V.push_back(S); } sort(V.begin(), V.end()); bool f = true; for(int i=0; i next.length()) continue; if(cur == next.substr(0, cur.l..

[문제 링크] : https://www.acmicpc.net/problem/4195#include #include #include using namespace std;unordered_map M;unordered_map U;string solve(string s){ if(U[s] == s){ return s; } else{ return U[s] = solve(U[s]); }}void uni(string a, string b){ string ta = solve(a); string tb = solve(b); if(ta == tb){ return; } U[tb] = ta; M[ta] += M[tb]; ret..