fork download
  1. #include <stdio.h>
  2.  
  3. void input(int *buffer, int *length);
  4. void output(int *buffer, int length);
  5. int sum_numbers(int *buffer, int length);
  6. int find_numbers(int *buffer, int length, int number, int *numbers);
  7.  
  8. int main() {
  9. int length;
  10. int buffer[10];
  11.  
  12. input(buffer, &length);
  13.  
  14. int sum = sum_numbers(buffer, length);
  15. if (sum == 0) {
  16. printf("n/a\n");
  17. return 0;
  18. }
  19.  
  20. int numbers[10];
  21. int new_length = find_numbers(buffer, length, sum, numbers);
  22.  
  23. printf("%d\n", sum);
  24. output(numbers, new_length);
  25.  
  26. return 0;
  27. }
  28.  
  29. void input(int *buffer, int *length) {
  30. scanf("%d", length);
  31. for (int i = 0; i < *length; i++) {
  32. scanf("%d", &buffer[i]);
  33. }
  34. }
  35.  
  36. void output(int *buffer, int length) {
  37. for (int i = 0; i < length; i++) {
  38. printf("%d ", buffer[i]);
  39. }
  40. printf("\n");
  41. }
  42.  
  43. int sum_numbers(int *buffer, int length) {
  44. int sum = 0;
  45. for (int i = 0; i < length; i++) {
  46. if (buffer[i] % 2 == 0) {
  47. sum += buffer[i];
  48. }
  49. }
  50. return sum;
  51. }
  52.  
  53. int find_numbers(int *buffer, int length, int number, int *numbers) {
  54. int index = 0;
  55. for (int i = 0; i < length; i++) {
  56. if (number != 0 && buffer[i] % number == 0) {
  57. numbers[index] = buffer[i];
  58. index++;
  59. }
  60. }
  61. return index;
  62. }
Success #stdin #stdout 0s 5296KB
stdin
4 3 9 0 1 2 0 2 7 -1
stdout
n/a