求输入的N（1~20）个整数（1~200000）的最大公约数算法
December 10th, 2008
2 comments
求输入的N（1~20）个整数（1~200000）的最大公约数算法
盐城师范学院软件协会 ACM/ICPC 试题
如需转载请保留相关作者注释，标明出处
说明：
算法使用了位运算的优化，减少MOD运算和除法运算的开销
实现一次遍历求出结果
算法时间复杂度O（n），最差情况O（Log2^C *N）C=所有数中最大数
Archive
Posts Tagged ‘ACM/ICPC’
Recent Posts
Random Post
Tags
Archives
- December 2021
- July 2021
- June 2020
- May 2020
- April 2020
- January 2020
- July 2019
- March 2019
- November 2018
- September 2017
- August 2017
- February 2017
- December 2016
- August 2016
- July 2016
- June 2016
- January 2016
- December 2015
- October 2015
- September 2015
- August 2015
- July 2015
- March 2015
- November 2014
- September 2014
- August 2014
- July 2014
- May 2014
- April 2014
- December 2013
- October 2013
- September 2013
- August 2013
- July 2013
- June 2013
- March 2013
- August 2012
- July 2012
- June 2012
- November 2009
- October 2009
- September 2009
- August 2009
- July 2009
- June 2009
- May 2009
- April 2009
- March 2009
- February 2009
- January 2009
- December 2008
Recent Comments