블루베리의 블로그

[알고리즘] 백준 2143 - 두 배열의 합 (C++)

[문제 링크] : https://www.acmicpc.net/problem/2143#include #include #include using namespace std;int T, N, M;int A[1001], B[1001];vector AV, BV;int main(){ cin >> T; cin >> N; for(int i=0; i> A[i]; } cin >> M; for(int i=0; i> B[i]; } for(int i=0; i

[알고리즘] 백준 5557 - 1학년 (C++)

[문제 링크] : https://www.acmicpc.net/problem/5557#include using namespace std;int N;long long Arr[101];long long DP[101][21];int main(){ cin >> N; for(int i=0; i> Arr[i]; } DP[0][Arr[0]] = 1; for(int i=1; i= 0 && a = 0 && b

[알고리즘] 백준 2631 - 줄세우기 (C++)

[문제 링크] : https://www.acmicpc.net/problem/2631#include using namespace std;int N, Maxi;int Arr[201];int DP[201];int main(){ cin >> N; for(int i=1; i> Arr[i]; } for(int i=1; i DP[i]){ DP[i] = DP[j] + 1; } } Maxi = max(Maxi, DP[i]); } cout

[문제 링크] : https://www.acmicpc.net/problem/21608#include #include using namespace std;int N, Ans;int Arr[21][21];int Dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};int Score[5] = {0, 1, 10, 100, 1000};vector V[401];void solve(int idx){ int a[N][N]; int b[N][N]; int maxi = -1, y = 0, x = 0, tmp = 0, cnt = 0; for(int i=0; i= N || nx = N){ continue; } ..

[문제 링크] : https://www.acmicpc.net/problem/1700#include using namespace std;int N, K, Ans;int Arr[101];int Map[101];int main(){ cin >> N >> K; for(int i=0; i> Arr[i]; } for(int i=0; i idx){ pos = j; idx = tmp; } } Map[pos] = Arr[i]; Ans++; } cout

[문제 링크] : https://www.acmicpc.net/problem/11559#include #include #include #include using namespace std;char Arr[12][6];bool Check[12][6];int Dir[4][2] = {{0, -1}, {0, 1}, {1, 0}, {-1, 0}};int tmp, Ans;bool flag;vector> T, V;void print(){ for(int i=0; i= 12 || nx >= 6){ continue; } if(Arr[ny][nx] == '.' || Check[ny][nx] == true || Arr[y][x] != Arr[ny][nx]){ ..

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

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

[문제 링크] : https://www.acmicpc.net/problem/17135#include #include #include using namespace std;int N, M, D;int Map[16][16];int Arr[16][16];int Ans;bool comp(pair, int> a, pair, int> b){ if(a.second == b.second){ return a.first.second &v){ int ret = 0; int line = N; while(line > 0){ vector> tmp; for(auto &at : v){ vector, int>> enemy; for(int..

[문제 링크] : https://www.acmicpc.net/problem/1871#include using namespace std;int main(){ int T; string S; cin >> T; while(T--){ cin >> S; int Ans = abs(((S[0] - 'A') * 26 * 26 + (S[1] - 'A') * 26 + (S[2] - 'A')) - ((S[4] - '0') * 1000 + (S[5] - '0') * 100 + (S[6] - '0') * 10 + (S[7] - '0'))); if(Ans