GCD and LCM of "n" numbers nor 2 numbers

[curious]

i need program that can find GCD and another one for to find LCM of "n"numbers not 2 numbers thank you for trying answering

[ne555]

First approach

std::accumulate(
  v.begin(),
  v.end(),
  0,
  gcd
);