Advertisement
Guest User

Untitled

a guest
Jan 23rd, 2019
70
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.77 KB | None | 0 0
  1. #include <iostream>
  2.  
  3. using namespace std;
  4.  
  5. int a[1001];
  6.  
  7. int VerifPare(int a[], int st, int dr)
  8. {
  9. int mij,s=0;
  10. if(dr==st)
  11. {
  12. if(a[st] % 2 == 0)
  13. {
  14. return a[st];
  15. }
  16. return 0;
  17. }
  18. if(dr-st == 1)
  19. {
  20. if(a[st]%2==0 && a[dr]%2==0)
  21. {
  22. return a[st]+a[dr];
  23. }
  24. if(a[st]%2==0 && a[dr]%2==1)
  25. {
  26. return a[st];
  27. }
  28. if(a[dr]%2==0 && a[st]%2==1)
  29. {
  30. return a[dr];
  31. }
  32. }
  33. mij=(st+dr)/2;
  34. return VerifPare(a,st,mij)+VerifPare(a,mij+1,dr);
  35.  
  36. }
  37.  
  38. int main()
  39. {
  40. int n;
  41. cin>>n;
  42. for( int i=1; i<=n; i++)
  43. {
  44. cin >> a[i];
  45. }
  46. cout<<VerifPare(a,1,n);
  47. return 0;
  48. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement