블루베리의 블로그

[문제 링크] : https://www.acmicpc.net/problem/20006#include #include #include using namespace std;int main(){ int N, M; cin >> N >> M; vector> V[310]; for(int i=0; i> inp >> s; for(int j=0; j 0){ if(abs(V[j][0].second - inp) = M){ cout 0 && V[i].size()

[문제 링크] : https://www.acmicpc.net/problem/30802#include using namespace std;long long N, A, B;long long Arr[7];long long Ans;int main(){ cin >> N; for(int i=1; i> Arr[i]; } cin >> A >> B; for(int i=1; i

[문제 링크] : https://www.acmicpc.net/problem/11328#include #include using namespace std;int N;int Arr[26];bool flag;int main(){ cin >> N; string A, B; while(N--){ cin >> A >> B; memset(Arr, 0, sizeof(Arr)); flag = true; for(int i=0; i

[문제 링크] : https://www.acmicpc.net/problem/24883#include using namespace std;char C;int main(){ cin >> C; if(C == 'N' || C == 'n'){ cout

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

[문제 링크] : https://www.acmicpc.net/problem/17362#include using namespace std;int main(){ int N; cin >> N; N %= 8; cout 5 || N == 0 ? (10 - N) % 8 : N); return 0;}

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

[문제 링크] : https://www.acmicpc.net/problem/11098#include using namespace std;int main(){ int T, N; cin >> T; while(T--){ cin >> N; int cnt = 0, inp; string s, tmp; for(int i=0; i> inp >> tmp; if(inp > cnt){ cnt = inp; s = tmp; } } cout

[문제 링크] : https://www.acmicpc.net/problem/25418#include using namespace std;int N, M;int DP[1000001];int main(){ cin >> N >> M; for(int i=N+1; i= N){ DP[i] = min(DP[i], DP[i / 2] + 1); } } cout

[문제 링크] : https://www.acmicpc.net/problem/2789#include using namespace std;int main(){ string A, B = "CAMBRIDGE"; cin >> A; for(int i=0; i