블루베리의 블로그

[알고리즘] 백준 2712 - 미국 스타일 (C++)

[문제 링크] : https://www.acmicpc.net/problem/2712#include using namespace std;double T, W;string S;double solve(){ if(S == "kg"){ S = "lb"; return W * 2.2046; } if(S == "lb"){ S = "kg"; return W * 0.4536; } if(S == "l"){ S = "g"; return W * 0.2642; } S = "l"; return W * 3.7854;}int main(){ cin >> T; cout > W >> S; ..

[알고리즘] 백준 15610 - Abbey Courtyard (C++)

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

[알고리즘] 백준 16017 - Telemarketer or not? (C++)

[문제 링크] : https://www.acmicpc.net/problem/16017#include using namespace std;int number[4];bool flag = true;int main(){ for(int i=0; i> number[i]; if((i == 0 || i == 3) && !(8 = number[i])){ flag = false; } if(i == 2 && number[i] != number[i-1]){ flag = false; } } cout

[문제 링크] : https://www.acmicpc.net/problem/18411#include #include using namespace std;int Arr[3];int main(){ for(int i=0; i> Arr[i]; } sort(Arr, Arr + 3); cout

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

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

[문제 링크] : https://www.acmicpc.net/problem/10173#include #include #include using namespace std;int main(){ string S; while(true){ getline(cin, S); if(S == "EOI"){ break; } bool flag = 0; transform(S.begin(), S.end(), S.begin(), ::tolower); if(S.length() > 3){ for(int i=0; i

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

[문제 링크] : https://www.acmicpc.net/problem/5724#include using namespace std;int main(){ int N; while(true){ int Ans = 0; cin >> N; if(N == 0){ break; } Ans += N * N + 1; for(int i=2; i

[문제 링크] : https://www.acmicpc.net/problem/9455#include using namespace std;int main(){ int T, N, M; cin >> T; while (T--){ int cnt = 0; int Arr[100][100]; cin >> N >> M; for(int i=0; i> Arr[i][j]; } } for(int i=0; i