src2020/1668_zuidagongyue/Readme.md

19 lines
321 B
Markdown
Raw Permalink Blame History

This file contains invisible Unicode characters

This file contains invisible Unicode characters that are indistinguishable to humans but may be processed differently by a computer. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

This file contains Unicode characters that might be confused with other characters. If you think that this is intentional, you can safely ignore this warning. Use the Escape button to reveal them.

# 1668 『入门』递归专题n个数的最大公约数
[问题描述]
  输入n个正整数求它们的最大公约数。
[输入格式]
  第一行一个整数n表示数的个数。(1 < n <= 101)
  第二行n个整数相互之间空格隔开
[输出格式]
  一行为N个整数的最大公约数
[输入样例]
2
48 54
[输出样例]
6