블루베리의 블로그

[문제 링크] : https://www.acmicpc.net/problem/14467#include #include using namespace std;int Arr[11];int N;int main(){ memset(Arr,-1,sizeof(Arr)); cin >> N; int Ans = 0; while(N--){ int a, b; cin >> a >> b; if(Arr[a] != -1 && Arr[a] != b){ Ans++; } Arr[a] = b; } cout

[문제 링크] : https://www.acmicpc.net/problem/14719#include using namespace std;int N, M;int Arr[501];int main(){ cin >> N >> M; int idx, cnt=0; for(int i=0; i> Arr[i]; } int Ans = 0; for(int i=1; ii; j--){ e = max(e, Arr[j]); } Ans += max(0, min(s, e) - Arr[i]); } cout

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

[문제 링크] : https://www.acmicpc.net/problem/23971#include using namespace std;int main(){ int H, W, N, M; cin >> H >> W >> N >> M; int A = H / (N + 1); int B = W / (M + 1); if(H % (N + 1) > 0){ A++; } if(W % (M + 1) > 0){ B++; } cout

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

[문제 링크] : https://www.acmicpc.net/problem/17614#include using namespace std;int N, Ans;int solve(int n){ int cnt = 0, tmp = n; while(tmp){ if(tmp % 10 == 3 || tmp % 10 == 6 || tmp % 10 == 9){ cnt++; } tmp /= 10; } return cnt;}int main(){ cin >> N; for(int i=1; i

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

[문제 링크] : https://www.acmicpc.net/problem/28702#include using namespace std;int main(){ ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); string A, B, C; cin >> A >> B >> C; if(C[0] >= 48 && C[0] = 48 && B[0] = 48 && A[0]

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

[문제 링크] : https://www.acmicpc.net/problem/8545#include #include using namespace std;int main(){ string S; cin >> S; reverse(S.begin(), S.end()); cout