fork download
  1. #include <iostream>
  2. #include <algorithm>
  3. #include <vector>
  4. #include <typeinfo>
  5. #include <cmath>
  6. #include <cstdlib>
  7.  
  8.  
  9. int main(){
  10. const int n=11;
  11. double x[n],a3[n],a1[n];
  12.  
  13. x[0]=-0.717778;
  14. x[1]=-0.496843;
  15. x[2]=-0.429063;
  16. x[3]=-0.3596;
  17. x[4]=-0.205607;
  18. x[5]=0.0730536;
  19. x[6]=0.138018;
  20. x[7]=0.585526;
  21. x[8]=2.40104;
  22. x[9]=3.75268;
  23. x[10]=4.55704;
  24.  
  25. a3[0]=0.790832;
  26. a3[1]=0.569896;
  27. a3[2]=0.502116;
  28. a3[3]=0.432653;
  29. a3[4]=0.343625;
  30. a3[5]=0.512472;
  31. a3[6]=0.56708;
  32. a3[7]=1.01459;
  33. a3[8]=2.32799;
  34. a3[9]=3.67962;
  35. a3[10]=4.48398;
  36.  
  37. std::cout.precision(10);
  38. std::copy(a3,a3+n,a1);
  39. for(int i=0;i<n;i++) a1[i]+=x[i];
  40. std::sort(a1,a1+n);
  41. for(int i=0;i<n;i++) std::cout << a1[i] << std::endl;
  42. std::cout << "---" << std::endl;
  43. int n_1 = std::unique(a1,a1+n,
  44. [](float a, float b)
  45. {
  46. return std::fabs(a-b) < 10e-9;
  47. }
  48. ) - a1;
  49. std::cout << "length of unique subvector " << n_1 << std::endl;
  50. std::cout << "---" << std::endl;
  51. for(int i=0;i<n_1;i++) std::cout << a1[i] << std::endl;
  52. std::cout << "---" << std::endl;
  53. }
Success #stdin #stdout 0s 3348KB
stdin
Standard input is empty
stdout
0.073053
0.073053
0.073053
0.073054
0.138018
0.5855256
0.705098
1.600116
4.72903
7.4323
9.04102
---
length of unique subvector 9
---
0.073053
0.073054
0.138018
0.5855256
0.705098
1.600116
4.72903
7.4323
9.04102
---