fork download
  1. #include <stdio.h>
  2. int nagative(int a[], int n)
  3. {
  4. int max_nagative = -1e9, dem = 0;
  5. for (int i = 0; i < n; i++)
  6. {
  7. if (a[i] < 0 && a[i] > max_nagative && a[i] % 2 == 0)
  8. {
  9. max_nagative = a[i];
  10. dem++;
  11. }
  12. }
  13. if (!dem)
  14. return 0;
  15. return max_nagative;
  16. }
  17. int sum(int a[], int n)
  18. {
  19. int res = 0;
  20. for (int i = 0; i < n; i++)
  21. {
  22. if (a[i] % 2 != 0)
  23. res += a[i];
  24. }
  25. return res;
  26. }
  27. int gcd(int a, int b)
  28. {
  29. if (b == 0)
  30. return a;
  31. return gcd(b, a % b);
  32. }
  33. int gcd_array(int a[], int n)
  34. {
  35. int res = a[0];
  36. for (int i = 1; i < n; i++)
  37. res = gcd(res, a[i]);
  38. return res;
  39. }
  40. void sort(int a[], int n)
  41. {
  42. for (int i = 0; i < n - 1; i++)
  43. {
  44. for (int j = 0; j < n - i - 1; j++)
  45. {
  46. if (a[j] > a[j+1])
  47. {
  48. int tmp = a[j];
  49. a[j] = a[j+1];
  50. a[j+1] = tmp;
  51. }
  52. }
  53. }
  54. }
  55. int main()
  56. {
  57. int n;
  58. scanf("%d", &n);
  59. printf("N=%d\n", n);
  60. int a[n];
  61. for (int i = 0; i < n; i++)
  62. scanf("%d", &a[i]);
  63. printf("%d\n", nagative(a, n));
  64. printf("%d\n", sum(a, n));
  65. printf("%d\n", gcd_array(a, n));
  66. sort(a,n);
  67. for(int i=0; i<n; i++) printf("%d ",a[i]);
  68. }
Success #stdin #stdout 0s 5448KB
stdin
Standard input is empty
stdout
N=0
0
0
1