Member/see_imm
algotutoring
2019. 7. 19. 14:49
2019. 7. 19. 14:49
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 | #include <iostream> #include <algorithm> #include <string> using namespace std; int main() { string N; cin >> N; int sum = 0; for (int i = 0; i < N.length(); i++) { sum += N[i]; } sort(N.begin(), N.end()); if (N[0] == '0' && sum % 3 == 0) { reverse(N.begin(), N.end()); cout << N; } else { cout << "-1"; } } | cs |
algotutoring
2019. 7. 19. 14:21
2019. 7. 19. 14:21
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 | #include <iostream> #include <algorithm> using namespace std; int main() { int N; cin >> N; int w[100000] = { 0 }; for (int i = 0; i < N; i++) { cin >> w[i]; } sort(w, w + N); int result = 0; for (int i = 0; i < N; i++) { result = max(result, w[i] * (N - i)); } cout << result; } | cs |
algotutoring
2019. 7. 19. 14:01
2019. 7. 19. 14:01
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 | #include <iostream> #include <algorithm> using namespace std; int main() { int L; cin >> L; int arr[50] = { 0 }; for (int i = 0; i < L; i++) { cin >> arr[i]; } int N; cin >> N; sort(arr, arr + L); int least = 1, large; for (int i = 0; i < L; i++) { if (N <= arr[i]) { large = arr[i]; break; } least = arr[i] + 1; } int cnt = 0; for (int i = least; i < large; i++) { for (int j = i + 1; j < large; j++) { if (i <= N && N <= j) { cnt++; } } } cout << cnt; } | cs |
algotutoring
2019. 7. 9. 14:29
2019. 7. 9. 14:29
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 | #include <iostream> #include <algorithm> using namespace std; int main() { int N, M; cin >> N >> M; int pac, ind, paci = 1000, indi = 1000; for (int i = 0; i < M; i++) { cin >> pac >> ind; paci = min(pac, paci); indi = min(ind, indi); } if (paci > 6 * indi) { cout << indi * N; } else { cout << min((N / 6)*paci + (N % 6)*indi, ((N / 6) + 1) * paci) << endl; } } | cs |
algotutoring
2019. 7. 9. 12:43
2019. 7. 9. 12:43
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 | #include <iostream> #include <string> #include <algorithm> using namespace std; int main() { string s; cin >> s; int len, zero = 0, one = 0; len = s.length(); for (int i = 0; i < len; i++) { if (s[i] != s[i+1]) { if (s[i] == '0') { zero++; } else if (s[i] == '1') { one++; } } } cout << min(zero, one); } | cs |