cgy12306

#include #include #include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int N, M, num; vector v; cin >> N >> M; for (int i = 0; i > num; v.push_back(num); } for (int i = 0; i > num; v.push_back(num); } sort(v.begin(), v.end()); for (auto iter = v.begin(); iter != v.end(); ++iter) { cout

#include #include #include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int N, M, num; vector::iterator up, low; vector A, B; cin >> N; for (int i = 0 ; i > num; A.push_back(num); } cin >> M; for (int i = 0; i > num; B.push_back(num); } sort(A.begin(), A.end()); for (auto iter = B.begin(); iter != B.end(); ++iter)..

#include #include #include using namespace std; int N, M, num; vector A, B, check; int search(int target) { int start = 0, end, mid; end = A.size() - 1; while (start target) end = mid - 1; else if (A[mid] == target) return 1; } return 0; } int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); cin >> N; for (int i = 0; i > num; A.push_back(num); } cin >> M; for..

#include #include #include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int N, M, a, b, pay = 0; vector v1, v2; cin >> N; cin >> M; for (int i = 0; i > a; cin >> b; v1.push_back(a); v2.push_back(b); } sort(v1.begin(), v1.end()); sort(v2.begin(), v2.end()); if (N >= 6) { if (v1.front() < v2.front() * 6) { pay = (N / 6) * v1.front()..

#include #include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); int N, M, res; cin >> N; cin >> M; if (N == 1) { res = 1; } else if (N == 2) { res = min(4, (M + 1) / 2 ); } else if (M < 7) { res = min(4, M); } else { res = M - 7 + 5; } cout

#include #include #include #include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); vector v; string s; bool flag = false; int sum = 0; cin >> s; for (int i = 0; i < s.size(); i++) { v.push_back(s[i] - '0'); sum += s[i] - '0'; } sort(v.begin(), v.end(), greater()); if (v[v.size() - 1] == 0 && sum % 3 == 0) { for (int i = 0; i < s.size(); i++) { cout

#include using namespace std; int main() { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); // N 여자, M 남자, K 인턴 int N, M, K, team = 0; cin >> N >> M >> K; while (N > 1 && M > 0 && N+M-K>2) { N -= 2; M--; team++; } cout

#pragma warning(disable:4996) #include int main() { int a = 0, b = 1, c, n, i=0, sum=0; scanf("%d", &n); if (n == 0) { printf("0"); return 0; } else if (n == 1) { printf("1"); return 0; } for (i = 1; i < n; i++) { c = a + b; a = b; b = c; } printf("%d", c); return 0; }