#include <stdio.h> #include <stdlib.h> #define MAX(a,b) ((a>b)?(a):(b)) int tab[1 + 1000 + 20]; void niestety(void) { printf("NIESTETY\n"); exit(0); } int main(int argc, char *argv[]) { int n; long long sum = 0, newsum = 0; int max = 0; int i; // int coins = 0; scanf("%d", &n); for (i = 0; i < n; i++) { int tmp; scanf("%d", &tmp); max = MAX(max, tmp); tab[tmp] += 1; sum += tmp; // coins += 1; } newsum = sum; if (sum % 2) { /* find smallest odd num to make result even */ for (i = 1; i <= max; i += 2) { if (tab[i]) { newsum -= i; --tab[i]; break; } } if (newsum == sum || newsum == 0) niestety(); } printf ("%lld\n", newsum); return 0; }
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 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 | #include <stdio.h> #include <stdlib.h> #define MAX(a,b) ((a>b)?(a):(b)) int tab[1 + 1000 + 20]; void niestety(void) { printf("NIESTETY\n"); exit(0); } int main(int argc, char *argv[]) { int n; long long sum = 0, newsum = 0; int max = 0; int i; // int coins = 0; scanf("%d", &n); for (i = 0; i < n; i++) { int tmp; scanf("%d", &tmp); max = MAX(max, tmp); tab[tmp] += 1; sum += tmp; // coins += 1; } newsum = sum; if (sum % 2) { /* find smallest odd num to make result even */ for (i = 1; i <= max; i += 2) { if (tab[i]) { newsum -= i; --tab[i]; break; } } if (newsum == sum || newsum == 0) niestety(); } printf ("%lld\n", newsum); return 0; } |