Advertisement
Guest User

Untitled

a guest
Jan 23rd, 2019
77
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.09 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. using namespace std;
  4.  
  5. ifstream fin("date.in");
  6. ofstream fout ("date.out");
  7.  
  8. int n;
  9. int v[100];
  10. int a[100], b[100];
  11. int s1;
  12. int k;
  13. void minim (int v[])
  14. {
  15. int min=999999;
  16. for(int i=1; i<=n;i++)
  17. if(v[i]<min) min=v[i];
  18. fout<<min<<' ';
  19. }
  20.  
  21. void pare (int v[])
  22. {
  23.  
  24. for(int i=1; i<=n;i++)
  25. if(v[i]%2==0) fout<<v[i]<<' ';
  26.  
  27. }
  28.  
  29. void impare (int v[])
  30. {
  31. for(int i=1; i<=n;i++)
  32. if(v[i]%2==1) fout<<v[i]<<' ';
  33. }
  34.  
  35. void maxim (int [])
  36. {
  37. int max=-100000;
  38. for(int i=1; i<=n;i++)
  39. if(v[i]>max) max=v[i];
  40. fout<<max<<' ';
  41. }
  42.  
  43. void suma_impare (int v[])
  44. {
  45. for(int i=1; i<=n;i++)
  46. if(v[i]%2==1) s1=s1+v[i];
  47. fout<< s1<<' ';
  48. }
  49.  
  50. void nr_de_pare (int v[])
  51. {
  52. for(int i=1; i<=n;i++)
  53. if(v[i]%2==0) k++;
  54. fout<< k<<' ';
  55. }
  56.  
  57. int main()
  58. {
  59.  
  60. fin>>n;
  61. for(int i=1; i<=n;i++)
  62. fin>>v[i];
  63. minim(v);
  64. pare(v);
  65. impare(v);
  66. fout<<endl;
  67. maxim(v);
  68. suma_impare(v);
  69. nr_de_pare(v);
  70.  
  71. return 0;
  72. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement