Warm-Up Trap
Practice
3 (1 votes)
Easy
Problem
57% Success 258 Attempts 20 Points 0.2s Time Limit 256MB Memory 1024 KB Max Code
You are given an array of N integers. Your task is find the Greatest Common Divisor of the array.
Input Format:
Input will contain an interger N. Next line contain N space saperated integers.
Output Format:
Output will contain the Greatest Common Divisor of the array.
Contraints:
\( 1 \le N \le 10^{5}\)
\( 0 \le a[i] \le 10^{9}\)
Code Editor
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor
Submissions
Please login to view your submissions
Similar Problems
Points:20
1 votes
Tags:
Math
Points:30
290 votes
Tags:
ReadyBit manipulationApprovedEasy-Medium
Points:20
2 votes
Editorial
Login to unlock the editorial
Please login to use the editor
You need to be logged in to access the code editor
Loading...
Please wait while we load the editor