블루베리의 블로그

[문제 링크] : https://www.acmicpc.net/problem/1522#include using namespace std;int main(){ string S; cin >> S; int A = 0, Ans = S.size(); for(auto c : S){ if(c == 'a'){ A++; } } for(int i=0; i

[문제 링크] : https://www.acmicpc.net/problem/2011#include using namespace std;int DP[5001];int main(){ string S; cin >> S; DP[0] = DP[1] = 1; for(int i=2; i= 10 && res

[문제 링크] : https://www.acmicpc.net/problem/1516#include #include using namespace std;int C[501];vector V[501];int DP[501];void solve(int n){ if(DP[n] != 1234567890) return; if(V[n].size() == 0){ DP[n] = C[n]; return; } int cnt = 0; for(int i=0; i> N; for(int i=0; i> C[i]; while(cin >> p && p != -1){ V[i].push_back(p); } } ..

[문제 링크] : https://www.acmicpc.net/problem/11779#include #include #include using namespace std;int N, M;vector> V[1001];vector R;int Dist[1001];int Route[1001];int S, E;void solve(){ priority_queue> PQ; PQ.push({0, S}); Dist[S] = 0; while(PQ.empty() == false){ int cnt = -PQ.top().first; int cur = PQ.top().second; PQ.pop(); if(Dist[cur] cnt + cost){ ..

[문제 링크] : https://www.acmicpc.net/problem/4179#include #include using namespace std;int R, C;char Arr[1001][1001];int Fire[1001][1001];bool Visit[1001][1001];int Dir[4][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}};int Y, X;queue> Q;int solve(int a, int b){ queue>> q; q.push({0, {a, b}}); Visit[a][b] = true; while(q.empty() == false){ int y = q.front().second.first; int x = q..

[문제 링크] : https://www.acmicpc.net/problem/1271#include #include using namespace std;char *big(char *a, char *b){ for (int i = 0; i b[i]) return a; } return a;}void subtract(char *a, char *b){ for (int i = 0; i = 0; i--) { if (a[i] '0' || big(a + index, b) == a + index) { subtract(a + index, b); ++q[index]; }}void devide(char *a, char *b, char *q){ int index = 0; int digi..

[문제 링크] : https://www.acmicpc.net/problem/30804#include #include using namespace std;int N, T, cnt[10], Ans;queue Q;int main(){ cin >> N; while(N--){ int inp; cin >> inp; Q.push(inp); if(cnt[inp]++ == 0){ T++; } while(T > 2){ inp = Q.front(); Q.pop(); if(--cnt[inp] == 0){ T--; } ..

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

#include #include using namespace std;int N;int a, b;map M;int main(){ cin >> N; char inp; while(N--){ cin >> inp; M[inp]++; } a = M['S'] + M['L']; b = M['S'] + M['L'] / 2 + 1; if(b

#include #include using namespace std;int N, M;int Arr[101];vector V;int main(){ cin >> N >> M; for(int i=1; i> A >> B >> C; int idx = 0; V.clear(); for(int j=C; j