Language: C++

#include<bits/stdc++.h>
#define INF 1e9
#define llINF 1e18
#define MOD 1000000007
#define pb push_back
#define mp make_pair 
#define F first
#define S second
#define ll long long
#define vi vector<ll>
#define vvi vector<vi>
#define substr(s,f,t) (s.substr(f-1,t-f+1))
#define ALL(a) (a).begin(),(a).end()
#define Yes(hoge) cout<<((hoge)?"Yes":"No")<<endl;
#define YES(hoge) cout<<((hoge)?"YES":"NO")<<endl;
using namespace std;
struct Grid{ll x,y,t;};
struct Edge{ll to,cost;};
struct Graph{vector<vector<Edge>>E;int V;
  const ll Inf = llINF;const int MAX_V=201010;vector<ll>d;
  Graph(int n):E(n){d.resize(MAX_V);E.resize(n);V=n;}
  void init(){for(int i=0;i<MAX_V;i++)d[i]=Inf;}
  void add_edge(ll from,ll to,ll cost){E[from].pb({to,cost});}
};
int n;
int dep;
int ans=0;
set<int>se;
void dfs(int bit,int d){
  if(de==d){
    vi ho;
    int cnt=0;
    for(int num:se){
      if(bit&(1<<cnt)){
	ho.pb((24-num)%24);
      }else{
	ho.pb(num);
      }
      cnt++;
    }
    int mi=INF;
    for(int i=0;i<dep;i++)
      for(int j=i+1;j<dep;j++)
	mi=min(mi,abs(ho[i]-ho[j]));
    ans=max(ans,mi);
  }
  
  dfs(bit+1<<d,d+1);
  dfs(bit,d+1);
}
int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cin>>n;
  se.insert(0);
  for(int i=1;i<=n;i++){int a;cin>>a;se.insert(a);}
  dep=se.size();
  dfs(0,0);
  cout<<ans<<endl;
  return 0;
}


Compiler output:
a.cc: In function 'void dfs(int, int)':
a.cc:30:6: error: 'de' was not declared in this scope; did you mean 'd'?
   30 |   if(de==d){
      |      ^~
      |      d
a.cc:44:15: error: no matching function for call to 'min(int&, long long int)'
   44 |         mi=min(mi,abs(ho[i]-ho[j]));
      |            ~~~^~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/14/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:51,
                 from a.cc:1:
/usr/include/c++/14/bits/stl_algobase.h:233:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
a.cc:44:15: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
   44 |         mi=min(mi,abs(ho[i]-ho[j]));
      |            ~~~^~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algobase.h:281:5: note:   candidate expects 3 arguments, 2 provided
In file included from /usr/include/c++/14/algorithm:61:
/usr/include/c++/14/bits/stl_algo.h:5686:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(initializer_list<_Tp>)'
 5686 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5686:5: note:   candidate expects 1 argument, 2 provided
/usr/include/c++/14/bits/stl_algo.h:5696:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(initializer_list<_Tp>, _Compare)'
 5696 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/14/bits/stl_algo.h:5696:5: note:   template argument deduction/substitution failed:
a.cc:44:15: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
   44 |         mi=min(mi,abs(ho[i]-ho[j]));
      |            ~~~^~~~~~~~~~~~~~~~~~~~~