FIND HCF
Abierto
algorithm
Beginner
good first issue
Hacktoberfest
hacktoberfest2020
Java
- Lenguaje dominante
- Java
- Estrellas
- 101
- Forks
- 131
- Métricas de merge de PR
- Sin PR fusionados en 30 d
Descripción
Given N positive numbers, your task is to calculate their HCF.
Input Format
First line of input contains a single integer N, second line contains N space separated positive integers whose HCF is to be computed.
Constraints
N <= 10 and all the numbers lie between 1 and 100.
Output Format
Print HCF of N numbers.
Sample Input
3
2 4 6
Sample Output
2
Guía de contribución
No hay ninguna guía de contribución indexada para este repositorio
Evaluación
Este issue todavía no se ha evaluado.