#include <stdio.h> #include <stdlib.h> #define ENOUGHT 2 void subtree() { int ones = 0; int akt; int n; scanf("%d", &n); int i = 0; while (i < n && ones < ENOUGHT) { scanf("%d", &akt); if (akt == 1) { ones++; } i++; } if (ones == ENOUGHT) { printf("0\n%d\n1 2\n", ENOUGHT); } else { int change = ENOUGHT - ones; printf("%d\n%d\n1 2\n", change, ENOUGHT); } } int main(int argc, char const *argv[]) { subtree(); 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 | #include <stdio.h> #include <stdlib.h> #define ENOUGHT 2 void subtree() { int ones = 0; int akt; int n; scanf("%d", &n); int i = 0; while (i < n && ones < ENOUGHT) { scanf("%d", &akt); if (akt == 1) { ones++; } i++; } if (ones == ENOUGHT) { printf("0\n%d\n1 2\n", ENOUGHT); } else { int change = ENOUGHT - ones; printf("%d\n%d\n1 2\n", change, ENOUGHT); } } int main(int argc, char const *argv[]) { subtree(); return 0; } |