Advertisement
Guest User

Untitled

a guest
Jul 21st, 2017
64
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.18 KB | None | 0 0
  1. #include<stdio.h>
  2. #include<string.h>
  3.  
  4. int main()
  5. {
  6. int n,a[100],b[100],i,j,k,x,y,noofodd=0,noofeven=0,ans=0;
  7.  
  8. scanf("%d",&n);
  9.  
  10. for(i=0;i<n;i++) // find no of odd and evens
  11. {
  12. scanf("%d",&a[i]);
  13. if(a[i]%2==0)
  14. noofeven++;
  15. else
  16. noofodd++;
  17. }
  18.  
  19. for(x=0; x<n; x++) //sort in asc order
  20. for(y=0; y<n-1; y++)
  21. if(a[y]>a[y+1])
  22. {
  23. int temp = a[y+1];
  24. a[y+1] = a[y];
  25. a[y] = temp;
  26. }
  27.  
  28. if(noofeven==n) //if all evens
  29. ans=0;
  30. else if(noofodd==n && n%2==0) // if all odd and noofflowers is even
  31. {
  32. for(i=1;i<n;i++)
  33. ans=ans+a[i];
  34. }
  35. else if(noofodd==n && n%2!=0) // if all odd and noofflowers is odd
  36. {
  37. for(i=0;i<n;i++)
  38. ans=ans+a[i];
  39. }
  40. else //else
  41. {
  42. for(i=1;i<n;i++)
  43. ans=ans + a[i];
  44. if(ans%2!=0 && a[0]%2!=0)
  45. {
  46. ans=ans+0;
  47. }
  48. else if(ans%2!=0 && a[0]%2==0)
  49. {
  50. ans=ans+a[0];
  51. }
  52. else if(ans%2==0 && a[0]%2!=0)
  53. {
  54. ans=ans+a[0];
  55. }
  56. else if(ans%2==0 && a[0]%2==0)
  57. {
  58. ans=ans+a[0];
  59. for(i=1;i<n;i++)
  60. if(a[i]%2!=0)
  61. {ans=ans-a[i];break;}
  62. }
  63.  
  64.  
  65. }
  66. printf("%d",ans);
  67.  
  68. return 0;
  69. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement