코딩공부

#include #include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(0); int N, K; int ans = 0; cin >> N >> K; vector a(N); for (int i = 0; i > a[i]; } int temp; vector vi(N); temp = a[0]; while (vi[temp] != true) { ans++; vi[temp] = true; if (temp == K) { cout

#include #include #include #include #include using namespace std; int main() { double ans = 0; char temp; string a; cin >> a; temp = a[0]; for (int i = 1; i < a.size(); i++) { if (temp == a[i]) { continue; } else { temp = a[i]; ans++; } } cout

#include #include #include #include #include #include #include using namespace std; int main() { int N; cin >> N; int ans = 0; string a; int cal=0; int i = 1; while (1) { a = to_string(i); if(a.find("666")!=string::npos) { ans++; } if (ans == N) { cout

#include #include #include #include #include #include #include using namespace std; int main() { int N,M; cin >> N>>M; vector full(M); vector single(M); for (int i = 0;i > full[i] >> single[i]; } sort(full.begin(), full.end()); sort(single.begin(), single.end()); int a=0,b=0; if (full[0] < single[0] * 6) { a = N / 6; } else { b = N * single[0]; cout

#include #include #include using namespace std; int main(void) { vector a; vector b; int N; int ans = 0; int num; cin >> N; for (int i = 0; i > num; a.push_back(num); } for (int i = 0; i > num; b.push_back(num); } sort(a.begin(), a.end()); sort(b.begin(), b.end(), greater()); for (int i = 0; i < N; i++) { ans += a[i] * b[i]; } cout

그리디 알고리즘으로 푸는 간단한 문제 #include using namespace std; int main() { int N; int answer=0; cin >> N; //5kg로 나누어 질때까지 3kg를 감소 while (N>=0) { if (N % 5 == 0) { answer += N / 5; cout