fork download
  1. #pragma GCC optimize ("Ofast")
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4. template<class S, class T> inline S chmin(S &a, T b){
  5. if(a>b){
  6. a=b;
  7. }
  8. return a;
  9. }
  10. #define main dummy_main
  11. int main(){
  12. return 0;
  13. }
  14. #undef main
  15. class Solution{
  16. public:
  17. vector<vector<int>> minimumAbsDifference(vector<int>& arr){
  18. int i;
  19. int mi = 1073709056;
  20. int N = arr.size();
  21. vector<vector<int>> res;
  22. sort(arr.begin(), arr.end());
  23. mi = 1073709056;
  24. for(i=(1);i<(N);i++){
  25. chmin(mi, arr[i] - arr[i-1]);
  26. }
  27. for(i=(1);i<(N);i++){
  28. if(arr[i] - arr[i-1] == mi){
  29. res.push_back( vector<int>({arr[i-1], arr[i]}) );
  30. }
  31. }
  32. return res;
  33. }
  34. }
  35. ;
  36. // cLay varsion 20190921-1
  37.  
  38. // --- original code ---
  39. // #define main dummy_main
  40. // {}
  41. // #undef main
  42. //
  43. // class Solution {
  44. // public:
  45. // vector<vector<int>> minimumAbsDifference(vector<int>& arr) {
  46. // int mi = int_inf, N = arr.size();
  47. // vector<vector<int>> res;
  48. // sort(arr.begin(), arr.end());
  49. // mi = int_inf;
  50. // rep(i,1,N) mi <?= arr[i] - arr[i-1];
  51. // rep(i,1,N) if(arr[i] - arr[i-1] == mi) res.push_back( vector<int>({arr[i-1], arr[i]}) );
  52. // return res;
  53. // }
  54. // };
  55.  
Compilation error #stdin compilation error #stdout 0s 0KB
stdin
Standard input is empty
compilation info
/usr/bin/ld: /usr/lib/gcc/x86_64-linux-gnu/8/../../../x86_64-linux-gnu/Scrt1.o: in function `_start':
(.text+0x20): undefined reference to `main'
collect2: error: ld returned 1 exit status
stdout
Standard output is empty