블루베리의 블로그

[문제 링크] : https://www.acmicpc.net/problem/8320#include #include #include using namespace std;int N, Ans;int solve(int n){ int div = 2, res = 1; if(n == 1 || n == 2){ return 1; } while(n != 1){ int cnt = 0; while(n % div == 0){ n /= div; cnt++; } div++; res *= (cnt + 1); } return (res + 1) / 2;}int main(){ ci..

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

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

[문제 링크] : https://www.acmicpc.net/problem/26711#include #include using namespace std;int N;string A, B, Ans;int C;int main(){ ios::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin >> A >> B; reverse(A.begin(), A.end()); reverse(B.begin(), B.end()); while(A.length() 9){ C = 1; tmp -= 10; } else{ C = 0; } Ans += tmp..

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

[문제 링크] : https://www.acmicpc.net/problem/10539#include using namespace std;int main(){ int N; cin >> N; int sum = 0, M, res; for(int i=0; i> M; res = M * (i + 1) - sum; cout

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

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

[문제 링크] : https://www.acmicpc.net/problem/6996#include #include using namespace std;int main(){ int T; string a, b, tmp1, tmp2; cin >> T; for(int i=0; i> a >> b; tmp1 = a, tmp2 = b; sort(a.begin(), a.end()); sort(b.begin(), b.end()); if(a == b){ cout

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