백준/백준-C++
2576번: 홀수
Beabletoet
2017. 9. 4. 21:35
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 | #include<cstdio> int main() { int num, sum = 0, low = 100; for (int i = 7; i--;) { scanf("%d", &num); if (num % 2 == 1) { sum += num; low = (num < low) ? num : low; } } if (low == 100) { low = -1; printf("%d", low); } else printf("%d\n%d", sum, low); } | cs |