블루베리의 블로그

[알고리즘] 백준 17406 - 배열 돌리기 4 (C++)

[문제 링크] : https://www.acmicpc.net/problem/17406#include using namespace std;int N, M, K;int Ans = 1234567890;int Arr[51][51];int Tmp[51][51];int Cal[6][3];bool Check[6];int Order[6];int calc(){ int res = 1234567890; for(int i=1; ix-i; j--){ Tmp[y - i][j] = Tmp[y - i][j - 1]; } for(int j=x-i+1; jy-i; j--){ Tmp[j][x + i] = Tmp[j - 1][x + i]..

[알고리즘] 백준 3020 - 개똥벌레 (C++)

[문제 링크] : https://www.acmicpc.net/problem/3020#include using namespace std;int U[500001];int D[500001];int main(){ int N, H, inp; cin >> N >> H; for(int i=0; i> inp; if(i % 2 == 0){ D[inp]++; } else{ U[H - inp + 1]++; } } for(int i=1; i

[알고리즘] 백준 16637 - 괄호 추가하기 (C++)

[문제 링크] : https://www.acmicpc.net/problem/16637#include using namespace std;int N;string S;int Ans = -1234567890;int calc(int a, int b, char op){ int res = a; if(op == '+'){ res += b; } else if(op == '-'){ res -= b; } else if(op == '*'){ res *= b; } return res;}void solve(int idx, int val){ if(idx > N - 1){ Ans = max(Ans, val); return..

[문제 링크] : https://www.acmicpc.net/problem/17472#include #include #include #include using namespace std;int N, M;int Arr[11][11];int Cnt = 2;int Dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};int Parent[11];bool Visit[11];vector>> V;int Ans;int get(int n){ if (Parent[n] == n) return n; else return get(Parent[n]);}void unionP(int a, int b) { a = get(a); b = get(b); if(a > Q; Q.push({y, x}); ..

[문제 링크] : https://www.acmicpc.net/problem/17140#include #include #include #include using namespace std;int R, C, K;int Arr[201][201];int Cnt[101];int rSize = 3, cSize = 3;int main(){ cin >> R >> C >> K; int inp; for(int i=1; i> Arr[i][j]; } } int Ans = 0; while(true){ if(Ans > 100){ cout = cSize){ int maxi = 0; for(int i=1; i> V; ..

[문제 링크] : https://www.acmicpc.net/problem/6593#include #include #include using namespace std;int L, C, R;char Arr[31][31][31];bool Visit[31][31][31];int sz, sy, sx;int Dir[6][3] = {{0, 0, -1}, {0, 0, 1}, {0, -1, 0}, {0, 1, 0}, {-1, 0, 0}, {1, 0, 0}};void init(){ for(int i=0; i, int>> Q; Q.push({{sz, sy}, sx}); Visit[sz][sy][sx] = true; int Ans = 0; while(Q.empty() == false){ ..

[문제 링크] : https://www.acmicpc.net/problem/17863#include using namespace std;string S;int main(){ cin >> S; if(S.substr(0,3) == "555"){ cout

[문제 링크] : https://www.acmicpc.net/problem/18409#include using namespace std;int main(){ int N, Ans = 0; string S; cin >> N >> S; for(int i=0; i

[문제 링크] : https://www.acmicpc.net/problem/2981#include #include #include using namespace std;int N, T;int inp;vector V, Ans;int solve(int a, int b){ if(b == 0){ return a; } return solve(b, a % b);}int main() { cin >> N; for(int i=0; i> inp; V.push_back(inp); } sort(V.begin(), V.end()); T = V[1] - V[0]; for(int i=2; i

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