Language: C++

#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define dup(x,y) (((x)+(y)-1)/(y))
#define v(T) vector<T>
#define vv(T) v(v(T))
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<pii> vp;
typedef vector<T> vt;
inline int getInt() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MX = 200005;
#define dame { puts("-1"); return 0;}
#define yn {puts("Yes");}else{puts("No");}
#define MOD 1000000007
//---------------------------------------------------------------
#define fastio cin.tie(nullptr); std::ios::sync_with_stdio(false);
#define myio ifstream iofi; if(argc>1){iofi.open(argv[1]); std::cin.rdbuf(iofi.rdbuf());}
//--------------------------------------------------------------
// [gcd]
template<class T> T gcd(T a, T b)
{if (a < b) swap;return b ? gcd(b, a % b) : a;}
template<class T> T lcm(T a, T b)
{T k=gcd(a, b);return (a/k) * (b/k)*k;}
void Main(){

 int n;cin>>n;
  vl a(n);
  cin>>a;
  ll nlcm = a[0];
  sort(rng(a));
  rep(i,n) nlcm = lcm(nlcm,a[i]);
  ll ans=0;
  rep(i,n){
    ans += nlcm/a[i];
    if(ans>MOD) ans%=MOD;
  }
  cout<<ans<<endl;

} int main(int argc,char** argv)
{fastio; myio; Main();}


Compiler output:
a.cc: In function 'T gcd(T, T)':
a.cc:59:17: error: statement cannot resolve address of overloaded function
   59 | {if (a < b) swap;return b ? gcd(b, a % b) : a;}
      |                 ^
a.cc: In instantiation of 'T gcd(T, T) [with T = long long int]':
a.cc:61:9:   required from 'T lcm(T, T) [with T = long long int]'
   61 | {T k=gcd(a, b);return (a/k) * (b/k)*k;}
      |      ~~~^~~~~~
a.cc:69:22:   required from here
   69 |   rep(i,n) nlcm = lcm(nlcm,a[i]);
      |                   ~~~^~~~~~~~~~~
a.cc:59:13: error: statement cannot resolve address of overloaded function
   59 | {if (a < b) swap;return b ? gcd(b, a % b) : a;}
      |             ^~~~